【LeetCode】Search in Rotated Sorted Array

来源:互联网 发布:猫咪咖啡店 知乎 编辑:程序博客网 时间:2024/05/29 15:52
class Solution {public:    int search(int A[], int n, int target) {        int start = 0, end = n;while (start != end){int mid = (start + end) / 2;if (A[mid] == target)return  mid;if (A[mid] >= A[start]){if (A[start] <= target && A[mid] > target){end = mid;}else{start = mid + 1;}}else{if (A[mid]<target && target<=A[end-1]){start = mid+1;}else{end = mid;}}}return -1;    }};

0 0