LeetCode: Search in Rotated Sorted Array II

搞了很久始终没通过，看了网上的简单答案，这道题的关键在于看target处于哪段递增区间里

class Solution {
public:
    bool search(int A[], int n, int target) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int left, right, mid;
        left = 0, right = n-1;
        while (left <= right) {
            mid = (left+right)/2;
            if (target == A[mid]) return true;
            if (A[left] < A[mid]) {
                if (target >= A[left] && target < A[mid]) right = mid - 1;
                else left = mid + 1;
            } else if (A[left] > A[mid]) {
                if (target > A[mid] && target <= A[right]) left = mid + 1;
                else right = mid - 1;
            }
            else left++;
        }
    }
};

 C#

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