33.Search in Rotated Sorted Array

标签：arc   cto   solution   search   vector   target   array   ret   size   

class Solution {
public:
    int search(vector<int>& nums, int target) {
        int left = 0, right = nums.size() - 1;
        while (left <= right) {
            int mid = left + (right - left) / 2;
            if (nums[mid] == target) return mid;
            else if (nums[mid] < nums[right]) {
                if (nums[mid] < target && nums[right] >= target) left = mid + 1;
                else right = mid - 1;
            } else {
                if (nums[left] <= target && nums[mid] > target) right = mid - 1;
                else left = mid + 1;
            }
        }
        return -1;
    }
};

33.Search in Rotated Sorted Array

标签：arc   cto   solution   search   vector   target   array   ret   size   

原文地址：https://www.cnblogs.com/smallredness/p/10673351.html