33 独立了查找最小值的函数

Author: aQuaYi

Algorithms/0033.search-in-rotated-sorted-array/search-in-rotated-sorted-array.go

@@ -2,22 +2,9 @@ package problem0033
 
 func search(nums []int, target int) int {
 	size := len(nums)
-
 	left, right := 0, size-1
-	for left < right {
-		mid := (left + right) / 2
-		if nums[mid] > nums[right] {
-			left = mid + 1
-		} else {
-			right = mid
-		}
-	}
-
-	/* lo = hi，是最小值的索引值 */
-
-	rotated := left /* 数组旋转了的距离 */
-
-	left, right = 0, size-1
+	/* 数组旋转了的距离 */
+	rotated := indexOfMin(nums)
 
 	for left <= right {
 		mid := (left + right) / 2
@@ -35,3 +22,18 @@ func search(nums []int, target int) int {
 
 	return -1
 }
+
+/* nums 是被旋转了的递增数组 */
+func indexOfMin(nums []int) int {
+	size := len(nums)
+	left, right := 0, size-1
+	for left < right {
+		mid := (left + right) / 2
+		if nums[mid] > nums[right] {
+			left = mid + 1
+		} else {
+			right = mid
+		}
+	}
+	return left
+}

Algorithms/0033.search-in-rotated-sorted-array/search-in-rotated-sorted-array_test.go

@@ -80,3 +80,16 @@ func Test_Problem0033(t *testing.T) {
 		ast.Equal(a.one, search(p.one, p.two), "输入:%v", p)
 	}
 }
+
+func Test_indexOfMin(t *testing.T) {
+	ast := assert.New(t)
+
+	array := []int{1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
+
+	for i := 0; i < 10; i++ {
+		nums := array[i : i+10]
+		actual := 9 - i
+		expected := indexOfMin(nums)
+		ast.Equal(expected, actual)
+	}
+}