【LeetCode 33】 Search in Rotated Sorted Array

最新推荐文章于 2023-11-12 22:31:34 发布

原创最新推荐文章于 2023-11-12 22:31:34 发布 · 193 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

LeetCode

二分

本文介绍了LeetCode中第33题的解决方案。这道题要求在一个已排序但未知旋转点的数组中搜索目标值，返回目标值的索引，若未找到则返回-1。算法需保证时间复杂度为O(log n)。文章提供了解题思路和具体代码实现。

题目描述

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

(i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).

You are given a target value to search. If found in the array return its index, otherwise return -1.

You may assume no duplicate exists in the array.

Your algorithm’s runtime complexity must be in the order of O(log n).

Example 1:

Input: nums = [4,5,6,7,0,1,2], target = 0
Output: 4

Example 2:

Input: nums = [4,5,6,7,0,1,2], target = 3
Output: -1

思路

每次，左右区间一定有一个单调区间，根据区间两端元素大小判断target是否在单调区间。

代码

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

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