leetcode 二分查找 Search in Rotated Sorted ArrayII
来源:互联网 发布:中文翻译缅甸语言软件 编辑:程序博客网 时间:2024/05/21 10:28
Search in Rotated Sorted Array II
Total Accepted: 18500 Total Submissions: 59945My SubmissionsFollow up for "Search in Rotated Sorted Array":
What if duplicates are allowed?
Would this affect the run-time complexity? How and why?
Write a function to determine if a given target is in the array.
题意:一个已经排序好的数组,被按某个位置旋转了一次,给定一个值target,在该旋转后的数组里查找该值。(数组中的元素可能重复)
思路:二分查找
难点在于确定往数组的哪一半段继续二分查找
设起点、中间点、终点分别为 start、middle、end (采用前闭后开的区间表示方法
如果target = A[middle] return middle
如果A[middle] > A[start],则[start,middle)单调递增
1.如果target < A[middle] && target >= A[start],则 end = middle
2.start = middle + 1, otherwise
如果A[middle] < A[start],则[middle,end)单调递增
1.如果target > A[middle] && target <= A[end - 1],则 start = middle + 1
2.end = middle, otherwise
如果A[middle] == A[start],那A[start]也不会是target,可以通过start++; 去掉A[start]
复杂度:时间O(n),空间O(1)
int search(int A[], int n, int target){int start = 0, end = n, middle ;while(start < end){middle = (start + end) / 2;if(A[middle] == target) return middle;if(A[middle] > A[start]){if(target >= A[start] && target < A[middle]){end = middle;}else{start = middle + 1;}}else if(A[middle] < A[start]){if(target > A[middle] && target <= A[end - 1]){start = middle + 1;}else{end = middle;}}else{++start;}}return -1;}
0 0
- leetcode 二分查找 Search in Rotated Sorted ArrayII
- LeetCode @ Search in Rotated Sorted ArrayII 旋转数组查找II
- LeetCode 081 Search in Rotated Sorted ArrayII
- Leetcode-Search in Rotated Sorted Array&&Search in Rotated Sorted ArrayII
- Search in Rotated Sorted Array && Search in Rotated Sorted ArrayII
- Search in Rotated Sorted Array && Search in Rotated Sorted ArrayII
- leetcode 二分查找 Search in Rotated Sorted Array
- LeetCode 33 Search in Rotated Sorted Array (二分查找 推荐)
- leetcode 33. Search in Rotated Sorted Array(二分查找)
- [LeetCode 33]Search in Rotated Sorted Array (二分查找)
- leetcode 33. Search in Rotated Sorted Array 二分查找
- leetcode 81. Search in Rotated Sorted Array II 二分查找
- leetcode 33. Search in Rotated Sorted Array (复杂二分查找)
- [leetcode]Find Minimum in Rotated Sorted ArrayII
- leetcode---search-in-rotated-sorted-array---查找
- leetcode 81. Search in Rotated Sorted Array II-旋转数组|二分查找
- ※ Leetcode - Binary Search - 153. Find Minimum in Rotated Sorted Array(二分查找)
- Leetcode 33 Search in Rotated Sorted Array 二分查找变式
- Hdu 1878 欧拉回路[判断是否存在欧拉回路]
- unity3d XmlException: Text node cannot appear in this state.的解决办法
- 【转载】Shell图形化监控网络流量
- Ubuntu安装配置Mysql
- hdu 1698 线段树
- leetcode 二分查找 Search in Rotated Sorted ArrayII
- 最长回文串子串 渣渣版
- CString::GetBuffer函数作用
- ubuntu tomcat7
- POJ2104 归并树
- 【笔记】正则表达式
- Java中的移位操作——Java编程思想笔记
- poj 1743 后缀数组求最长不重叠重复子串
- DP专辑(转)进阶、分类