153. Find Minimum in Rotated Sorted Array

最新推荐文章于 2025-05-20 18:03:40 发布

forest小拳拳

最新推荐文章于 2025-05-20 18:03:40 发布

阅读量125

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode

本文链接：https://blog.youkuaiyun.com/qq_33097439/article/details/88773297

Leetcode 专栏收录该内容

97 篇文章

订阅专栏

本文介绍了一种寻找旋转排序数组中最小元素的方法。该数组原本按升序排列后被旋转，可能存在重复元素。通过使用二分查找算法，在O(log n)的时间复杂度内找到最小元素。

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

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]).

Find the minimum element.

You may assume no duplicate exists in the array.

Example 1:

Input: [3,4,5,1,2] 
Output: 1

Example 2:

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

class Solution {
public:
    int findMin(vector<int>& nums) {
        int start =0;
        int end = nums.size()-1;
        
        while(start<end){
            if (nums[start]<nums[end])
                return nums[start];
            
            int mid = (start+end)/2;
            if(nums[mid]>=nums[start])
                start=mid+1;
            else
                end = mid;
        }
        return nums[start];
    }
};