LeetCode: Find Minimum in Rotated Sorted Array

// https://code.dennyzhang.com/find-minimum-in-rotated-sorted-array
// Basic Ideas: binary search
//  If nums[mid] > nums[right], the starting point is in the right half
//  Otherwise, it's in the left half
// Complexity: Time O(log(n)), Space O(1)
func findMin(nums []int) int {
    left, right := 0, len(nums)-1
    // must exists
    for left<right {
        mid := (right-left)/2+left
        if nums[mid] > nums[right] {
            left = mid+1
        } else {
            right = mid
        }
    }
    return nums[left]
}