[Leetcode] Find Minimum in Rotated Sorted Array

最新推荐文章于 2024-11-13 08:49:23 发布

泉山绿树

最新推荐文章于 2024-11-13 08:49:23 发布

阅读量266

点赞数

CC 4.0 BY-SA版权

分类专栏：算法

本文链接：https://blog.youkuaiyun.com/u011327334/article/details/49661715

算法专栏收录该内容

55 篇文章

订阅专栏

本文详细介绍了如何通过二分查找算法解决旋转排序数组中寻找最小元素的问题，并分享了作者对于此题的解题思路及心得。

Find Minimum in Rotated Sorted Array My Submissions Question
Total Accepted: 67103 Total Submissions: 195803 Difficulty: Medium
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.

Subscribe to see which companies asked this question

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