LeetCode: Find Minimum in Rotated Sorted Array II

// https://code.dennyzhang.com/find-minimum-in-rotated-sorted-array-ii
// Basic Ideas: binary search
//  If nums[mid] > nums[right], it's in the right half, (excluding mid)
//  If nums[mid] < nums[right], it's in the left half
//  If nums[mid] = nums[right], drop nums[right]
// 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 {
            if nums[mid] < nums[right] {
                // drop the left half
                right = mid
            } else {
                right--
            }
        }
    }
    return nums[left]
}