把一個數組最開始的若干個元素搬到數組的末尾，我們稱之為數組的旋轉。輸入一個遞增排序的數組的一個旋轉，輸出旋轉數組的最小元素。例如，數組 [3,4,5,1,2] 為 [1,2,3,4,5] 的一個旋轉，該數組的最小值為1。
鏈接：https://leetcode-cn.com/problems/xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof
示例 1：
輸入：[3,4,5,1,2]
輸出：1
示例 2：
輸入：[2,2,2,0,1]
輸出：0
func minInOrder(numbers []int, index1 int, index2 int) int {
result := numbers[index1]
for i := index1 + 1; i <= index2; i++ {
if result > numbers[i] {
result = numbers[I]
}
}
return result
}
func minArray(numbers []int) int {
index1 := 0
index2 := len(numbers) - 1
indexMid := index1
for numbers[index1] >= numbers[index2] {
if index2 - index1 == 1 {
indexMid = index2
break
}
indexMid = (index1 + index2) / 2
if (numbers[index1] == numbers[index2] &&
numbers[indexMid] == numbers[index1]) {
return minInOrder(numbers, index1, index2)
}
if numbers[indexMid] >= numbers[index1] {
index1 = indexMid
} else if numbers[indexMid] <= numbers[index2] {
index2 = indexMid
}
}
return numbers[indexMid]
}
image.png
