Search in Rotated Sorted Array II

Follow 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.

思路总结：

总体思路同 Search in Rotated Sorted Array ，见 http://blog.csdn.net/poxiaozhuimeng/article/details/39475085

问题点在于：

1、当有重复的元素的时候，我们不用用A[low] <= A[mid]来确定划分点（即mid）落在了哪个子数组中，需要将该条件拆分；

2、拆分为A[low] < A[mid] 和A[low] == A[mid]，A[low] < A[mid] 对应一个完全递增子数组；对于A[low] == A[mid]，可以每次将low递增1，直到low == mid，或者A[low] > A[mid]，此情况即"形式同原数组的子数组”

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