feat: 0153.Find-Minimum-in-Rotated-Sorted-Array

Author: kimi0230

Leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array/README.md

@@ -80,6 +80,25 @@ seo:
 https://github.com/kimi0230/LeetcodeGolang/blob/master/Leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array/main.go
 
 ```go
+package findminimuminrotatedsortedarray
+
+// 時間複雜 O(logN), 空間複雜 O(1)
+func findMin(nums []int) int {
+	left, right := 0, len(nums)-1
+	for left < right {
+		if nums[left] < nums[right] {
+			return nums[left]
+		}
+		mid := int(uint(left+right) >> 1)
+		if nums[mid] >= nums[left] {
+			// mid 一定不是最小值了
+			left = mid + 1
+		} else {
+			right = mid
+		}
+	}
+	return nums[left]
+}
 
 ```
 

README.md

@@ -482,10 +482,11 @@ func RightBound(nums []int, target int) (index int) {
 	return right
 }
 ```
-| No.                                                                                  |                                           Title                                            |                                            Solution                                            | Difficulty | Time                                  | Space                         | Topic         |
-|--------------------------------------------------------------------------------------|:------------------------------------------------------------------------------------------:|:----------------------------------------------------------------------------------------------:|------------|---------------------------------------|-------------------------------|---------------|
-| [0704](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0704.Binary-Search/)       |             [704. Binary Search](https://leetcode.com/problems/binary-search/)             |    [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0704.Binary-Search)    | Easy       | 最差:O(long n)<br> 最佳O(1)剛好在中間 | 迭代: O(1) <br/> 遞迴O(log n) | Binary Search |
-| [0875](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0875.Koko-Eating-Bananas/) | [875. Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas/description/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0875.Koko-Eating-Bananas) | Medium     | O（n log m）                          | O(1)                          | Binary Search |
+| No.                                                                                                   |                                                            Title                                                             |                                                    Solution                                                     | Difficulty | Time                                  | Space                         | Topic         |
+|-------------------------------------------------------------------------------------------------------|:----------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------:|------------|---------------------------------------|-------------------------------|---------------|
+| [0704](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0704.Binary-Search/)                        |                              [704. Binary Search](https://leetcode.com/problems/binary-search/)                              |            [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0704.Binary-Search)             | Easy       | 最差:O(long n)<br> 最佳O(1)剛好在中間 | 迭代: O(1) <br/> 遞迴O(log n) | Binary Search |
+| [0875](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0875.Koko-Eating-Bananas/)                  |                  [875. Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas/description/)                  |         [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0875.Koko-Eating-Bananas)          | Medium     | O（n log m）                          | O(1)                          | Binary Search |
+| [0153](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array/) | [153. Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/description/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array) | Medium     | O(log n）                             | O(1)                          | Binary Search |
 
 
 ---