LeetCode 0153 - Find Minimum in Rotated Sorted Array

Reck Zhang

发布于 2021-08-11 14:48:26

1860

发布于 2021-08-11 14:48:26

文章被收录于专栏：Reck Zhang

Find Minimum in Rotated Sorted Array

Desicription

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

Solution

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

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2018-06-02，如有侵权请联系 cloudcommunity@tencent.com 删除

element