Leetcode: Searching an Element in a Rotated Sorted Array I
2013-01-04 08:10
288 查看
class Solution {
public:
int search(int A[], int n, int target) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int start=0;
int end=n-1;
while(start<=end){
int mid=(start+end)/2;
if(A[mid]==target)
return mid;
if(A[start]<=A[mid]){
if(A[start]<=target&&target<A[mid]){
end=mid-1;
} else start=mid+1;
} else {
if(A[mid]<target&&target<=A[end])
start=mid+1;
else end=mid-1;
}
}
return -1;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- Searching an Element in a Rotated Sorted Array
- LeetCode153 Find Minimum in Rotated Sorted Array. LeetCode162 Find Peak Element
- 【LEETCODE】153-Find Minimum in Rotated Sorted Array
- LeetCode Find Minimum in Rotated Sorted Array
- LeetCode 081 Search in Rotated Sorted Array II
- LeetCode Search in Rotated Sorted Array II
- LeetCode *** 33. Search in Rotated Sorted Array
- LeetCode算法问题14 —— Kth Largest Element in an Array
- LeetCode题解——Kth Largest Element in an Array
- LeetCode Search in Rotated Sorted Array
- Leetcode NO.81 Search in Rotated Sorted Array II
- 【leetcode】No.81 Search in Rotated Sorted Array II
- LeetCode 81 Search in Rotated Sorted Array II
- LeetCode(80)Search in Rotated Sorted Array II
- LeetCode Search in Rotated Sorted Array
- [Leetcode 154, Hard] Find Minimum in Rotated Sorted Array II
- leetcode Find minimum in rotated sorted array
- LeetCode 215. Kth Largest Element in an Array
- [LeetCode] Search in Rotated Sorted Array II
- [LeetCode] Search in Rotated Sorted Array