leetcode #153 in cpp

最新推荐文章于 2024-09-20 15:28:15 发布

xiaolienahu

最新推荐文章于 2024-09-20 15:28:15 发布

阅读量189

点赞数

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

本文链接：https://blog.csdn.net/xiaolienahu/article/details/51781483

版权

interview 专栏收录该内容

135 篇文章 0 订阅

订阅专栏

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; 
    }
};