LC153 - 寻找旋转排序数组中的最小值

package BinarySearch

import "math"

func findMin(nums []int) int {
    ans := math.MaxInt
    for l, r := 0, len(nums)-1; l <= r; {
        m := l + (r-l)/2
        if nums[l] <= nums[m] {
            ans = min(nums[l], ans)
            l = m + 1
        } else {
            ans = min(nums[m], ans)
            r = m - 1
        }
    }
    return ans
}