leetcode #153 in cpp

最新推荐文章于 2023-02-15 13:45:09 发布

xiaolienahu

最新推荐文章于 2023-02-15 13:45:09 发布

阅读量209

点赞数

分类专栏： interview 文章标签： cpp leetcode

本文链接：https://blog.youkuaiyun.com/xiaolienahu/article/details/51781483

版权

interview 专栏收录该内容

135 篇文章

订阅专栏

本文介绍了一种高效查找旋转排序数组中最小元素的方法。通过利用二分搜索的思想，在O(log n)的时间复杂度内找到被旋转数组的最小值。文章提供了一个C++实现示例，展示了如何通过比较中间元素与数组尾部元素来判断旋转点的位置。

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

Suppose a sorted array 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.

Code:

class Solution {
public:
    int findMin(vector<int>& nums) {
        int h = nums.size() - 1;
        int l = 0; 
        int minn = INT_MAX;
        while(l<=h){
            int mid = (l+h)/2; 
            if(nums[mid] > nums[h]){//if the pivot is contained in nums[mid ...h], we can abandon nums[l...mid]
                minn = min(nums[l], minn);
                l = mid + 1; 
            }else{//if the pivot is contained in nums[l ...mid], we can abandon nums[mid...h]
                minn = min(nums[mid],minn);
                h = mid - 1; 
            }
            
        }
        return minn; 
    }
};