Leetcode 33. Search in Rotated Sorted Array

最新推荐文章于 2023-12-29 18:00:11 发布

哀酱

最新推荐文章于 2023-12-29 18:00:11 发布

阅读量128

点赞数

分类专栏： LeetCode(c++&python)

本文链接：https://blog.csdn.net/u010821666/article/details/82597552

版权

LeetCode(c++&python) 专栏收录该内容

136 篇文章 0 订阅

订阅专栏

Leetcode 33. Search in Rotated Sorted Array


class Solution {
public:
    int search(vector<int>& nums, int target) {
      //auto pos = std::is_sorted_until(nums.begin(),nums.end());
      //int pivot = pos-nums.begin();

      if(nums.empty())
    return -1;
      int left = 0,right = nums.size()-1;

      while(left <= right){
    int mid = (left + right)/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[mid] > target && nums[left] <= target)
          right = mid -1;
      else 
          left = mid + 1;;
    }
      }
      return -1;
    }
};