81.Search in Rotated Sorted Array II

标签：arch   targe   int   ret   als   while   sort   return   sorted   

class Solution {
public:
    bool search(int A[], int n, int target) {
        if (n == 0) return false;
        int left = 0, right = n - 1;
        while (left <= right) {
            int mid = (left + right) / 2;
            if (A[mid] == target) return true;
            else if (A[mid] < A[right]) {
                if (A[mid] < target && A[right] >= target) left = mid + 1;
                else right = mid - 1;
            } else if (A[mid] > A[right]){
                if (A[left] <= target && A[mid] > target) right = mid - 1;
                else left = mid + 1;
            } else --right;
        }
        return false;
    }
};

81.Search in Rotated Sorted Array II

标签：arch   targe   int   ret   als   while   sort   return   sorted   

原文地址：https://www.cnblogs.com/smallredness/p/10675990.html