[go语言算法]旋转数组最小值查找

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