Search in Rotated Sorted Array(leetcode)

1. Search_In_Rotated_Sorted_Array_1

Suppose a sorted array is rotated at some pivot unknown to you beforehand.
(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).
You are given a target value to search. If found in the array return its index, otherwise return -1.
You may assume no duplicate exists in the array.
分析：本题采用二分搜索，由于数组已排序，在任意时刻可能的情况为三种。（图形只表示一定的位置关系）

int search(vector<int> &nums, int target)
{
    int len = nums.size();
    if(len == 0)         //数组长度为零
        return -1;

    int left = 0;        //区间左边界
    int right = len - 1; //区间右边界
    int mid;
    while(left <= right)
    {
        mid = (left + right) / 2;
        if(nums[mid] == target)
            return mid;
        if(nums[mid] > nums[left])                //情形2（情形1）
        {
            if(target >= nums[left] && target < nums[mid])
                right = mid - 1;
            else
                left = mid + 1;
        }
        else if(nums[mid] < nums[left])           //情形3
        {
            if(target > nums[mid] && target <= nums[right])
                left = mid + 1;
            else
                right = mid - 1;
        }
        else              //right - left <= 1 时，防止进入死循环                     
            ++left
    }
    return -1;
}

2.Search_In_Rotated_Sorted_Array_2

Follow up for “Search in Rotated Sorted Array”:
What if duplicates are allowed?
分析：当数组元素存在重复值时，与1的区别在于曲线不再是在一定范围内递增，但是走势与1类似。依然采用1的方法。