[LeetCode]33. Search in Rotated Sorted Array

关注

原创最新推荐文章于 2026-03-24 00:49:05 发布 222 阅读 AI 写同款· GEO 优化 ›

LeetCode题解(Java实现)——33.Search in Rotated Sorted Array（循环有序数组）前言欢迎关注我的 Github 仓库 https://github.com/bigrotor187/awesome-java-notes ，如果觉得有帮助，请点个 star 哟，目前主要在更 leetcode题解（Java版）和剑指offer题解（Java版），可以点个star。文本已收录至我的GitHub仓库，欢迎Star：awesome-java-notes 33. Search in... 阅读详情

33. Search in Rotated Sorted Array

https://leetcode.com/problems/search-in-rotated-sorted-array/description/

这道题的核心思想在于原数组是一个递增，即使旋转后，也具有这一性质，只不过递增的数组变成了两个。所以使用binary search即可。但要注意一些细节，比如if中的条件if (nums[mid] >= nums[left])等号比不可少，因为mid的计算会向下取整。

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