33 重构了程序，添加了更详细的代码

Author: aQuaYi

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

@@ -1,20 +1,19 @@
 package problem0033
 
 func search(nums []int, target int) int {
+	rotated := indexOfMin(nums) /* 数组旋转了的距离 */
 	size := len(nums)
 	left, right := 0, size-1
-	/* 数组旋转了的距离 */
-	rotated := indexOfMin(nums)
 
 	for left <= right {
 		mid := (left + right) / 2
 		/* nums 是 rotated，所以需要使用 rotatedMid 来获取 mid 的值 */
 		rotatedMid := (rotated + mid) % size
 		switch {
-		case nums[rotatedMid] > target:
-			right = mid - 1
 		case nums[rotatedMid] < target:
 			left = mid + 1
+		case target < nums[rotatedMid]:
+			right = mid - 1
 		default:
 			return rotatedMid
 		}
@@ -29,7 +28,7 @@ func indexOfMin(nums []int) int {
 	left, right := 0, size-1
 	for left < right {
 		mid := (left + right) / 2
-		if nums[mid] > nums[right] {
+		if nums[right] < nums[mid] {
 			left = mid + 1
 		} else {
 			right = mid

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

@@ -81,15 +81,26 @@ func Test_Problem0033(t *testing.T) {
 	}
 }
 
-func Test_indexOfMin(t *testing.T) {
+func Test_indexOfMin_evenLength(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}
-
+	numsSize := 10
 	for i := 0; i < 10; i++ {
-		nums := array[i : i+10]
-		actual := 9 - i
-		expected := indexOfMin(nums)
-		ast.Equal(expected, actual)
+		nums := array[i : i+numsSize]
+		indexOfZeroInNums := 9 - i
+		actual := indexOfMin(nums)
+		ast.Equal(indexOfZeroInNums, actual)
+	}
+}
+
+func Test_indexOfMin_oddLength(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}
+	numsSize := 9
+	for i := 1; i < 10; i++ {
+		nums := array[i : i+numsSize]
+		indexOfZeroInNums := 9 - i
+		actual := indexOfMin(nums)
+		ast.Equal(indexOfZeroInNums, actual)
 	}
 }