153. 寻找旋转排序数组中的最小值

原题

https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array/description/

思路

二分查找

复杂度

时间：O(n)
空间：O(n)

Python代码

class Solution:
    def findMin(self, nums: List[int]) -> int:
        l, r = 0, len(nums)-1
        
        while l < r:
            mid = (l + r) // 2 
            if nums[mid] > nums[r]:
                l = mid + 1 
            else:
                r = mid 
        return nums[l]

Go代码

func findMin(nums []int) int {
	l, r := 0, len(nums)-1
	for l < r {
		mid := (l + r) / 2
		if nums[mid] > nums[r] {
			l = mid + 1
		} else {
			r = mid
		}
	}
	return nums[l]
}