153. Find Minimum in Rotated Sorted Array

153. Find Minimum in Rotated Sorted Array
Medium

840

143

Favorite

Share
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
Accepted
262,921
Submissions
618,208



class Solution:
    def findMin(self, nums: List[int]) -> int:

        left, right = 0, len(nums)-1

        while left < right:
            mid = (right - left)//2 + left
            if nums[mid] > nums[right]:
                left = mid+1
            else:
                right = mid

        return nums[left]