33. 搜索旋转排序数组(c++/二分查找/线性查找)

O(n)算法，顺序搜索：

class Solution {
public:
    int search(vector<int>& nums, int target) {
        for(int i = 0; i < nums.size(); i++){
            if(nums[i] == target){
                return i;
            }
        }
        return -1;
    }
};

class Solution {
public:
    int search(vector<int>& nums, int target) {
        int n = nums.size();
        if(n == 1){
            return nums[0] == target ? 0:-1; 
        }

        int l = 0;
        int r = n - 1;
        while(l <= r){
            int mid = (l + r) /2;
            if(nums[mid] == target){
                return mid;
            }
            //左边有序
            if(nums[0] <= nums[mid]){
                if(target >= nums[l] && target <= nums[mid]){
                    r = mid - 1;//target在左边
                }else{
                    l = mid + 1;//target在右边
                }
            }else{//右边有序
                if(target >= nums[mid] && target <= nums[r]){
                    l = mid + 1;//target在右边
                }else{
                    r = mid - 1;//target在左边
                }
            }
        }
        return -1;

    }
};