leetcode 81. 搜索旋转排序数组 II

class Solution {
public:
    bool search(vector<int>& nums, int target) {
        if(nums.size() == 0)
            return false;
        int start = 0, end = nums.size() - 1;
        int mid;
        
        while(start <= end){
            mid = start + (end - start) / 2;
            if(nums[mid] == target)
                return true;
            if(nums[start] == nums[mid]){
                start++;
                continue;
            }
            
            //前半部分有序
            if(nums[start] < nums[mid]){
                //target在前半部分
                if(nums[mid] > target && nums[start] <= target)
                    end = mid - 1;
                else  //否则去前半部分找
                    start = mid + 1;
            }else{ //后半部分有序
                //target在后半部分
                if(nums[mid] < target && nums[end] >= target)
                    start = mid + 1;
                else  //否则，去后半部分找
                    end = mid - 1;
            }
        }
        
        //一直没找到
        return false;
    }
};

class Solution {
public:
    int search(vector<int>& nums, int target) {
        if(nums.size() == 0)
            return -1;
        int start = 0, end = nums.size() - 1;

        while(start <= end){
            int mid = start + (end - start) / 2;
            if(nums[mid] == target)
                return mid;
            if(nums[start] <= nums[mid]){
                if(target >= nums[start] && target < nums[mid])
                    end = mid - 1;
                else
                    start = mid + 1;
            }
            else{
                if(target > nums[mid] && target <= nums[end])
                    start = mid + 1;
                else
                    end = mid - 1;
            }

            
        }

        return -1;
    }
};