leetcode记录33. Search in Rotated Sorted Array

hinanmu

于 2019-05-05 11:22:13 发布

阅读量100

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/csdn_47/article/details/89841783

leetcode 专栏收录该内容

37 篇文章

订阅专栏

博客围绕在旋转排序数组中进行搜索展开，核心聚焦于该特定场景下的搜索问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

33. Search in Rotated Sorted Array

√ Accepted
  √ 196/196 cases passed (4 ms)
  √ Your runtime beats 100 % of cpp submissions
  √ Your memory usage beats 98.58 % of cpp submissions (8.9 MB)


class Solution {
public:
    int search(vector<int>& nums, int target) {
        int l = 0;
        int r = nums.size() - 1;

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

};