feat: binary search

Author: kimi0230

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

@@ -0,0 +1,90 @@
+---
+title: 0153.Find-Minimum-in-Rotated-Sorted-Array
+subtitle: "https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/description/"
+date: 2024-03-29T00:27:00+08:00
+lastmod: 2024-03-29T00:27:00+08:00
+draft: false
+author: "Kimi.Tsai"
+authorLink: "https://kimi0230.github.io/"
+description: "0153.Find-Minimum-in-Rotated-Sorted-Array"
+license: ""
+images: []
+
+tags: [LeetCode, Go, Medium, LEETCODETITLE,Amazon, Facebook, Microsoft, Adobe, Goldman Sachs]
+categories: [LeetCode]
+
+featuredImage: ""
+featuredImagePreview: ""
+
+hiddenFromHomePage: false
+hiddenFromSearch: false
+twemoji: false
+lightgallery: true
+ruby: true
+fraction: true
+fontawesome: true
+linkToMarkdown: false
+rssFullText: false
+
+toc:
+  enable: true
+  auto: true
+code:
+  copy: true
+  maxShownLines: 200
+math:
+  enable: false
+  # ...
+mapbox:
+  # ...
+share:
+  enable: true
+  # ...
+comment:
+  enable: true
+  # ...
+library:
+  css:
+    # someCSS = "some.css"
+    # located in "assets/"
+    # Or
+    # someCSS = "https://cdn.example.com/some.css"
+  js:
+    # someJS = "some.js"
+    # located in "assets/"
+    # Or
+    # someJS = "https://cdn.example.com/some.js"
+seo:
+  images: []
+  # ...
+---
+# [0153.Find-Minimum-in-Rotated-Sorted-Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/description/)
+
+## 題目
+
+## 題目大意
+
+
+## 解題思路
+
+## Big O
+
+* 時間複雜 : `O(logN)`
+* 空間複雜 : `O(1)`
+
+## 來源
+* https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/description/
+* https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array/
+
+## 解答
+https://github.com/kimi0230/LeetcodeGolang/blob/master/Leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array/main.go
+
+```go
+
+```
+
+##  Benchmark
+
+```sh
+
+```

Leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array/main.go

@@ -0,0 +1,19 @@
+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]
+}

Leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array/main_test.go

@@ -0,0 +1,28 @@
+package findminimuminrotatedsortedarray
+
+import "testing"
+
+var tests = []struct {
+	nums []int
+	want int
+}{
+	{[]int{3, 4, 5, 1, 2}, 1},
+	{[]int{4, 5, 6, 7, 0, 1, 2}, 0},
+	{[]int{11, 13, 15, 17}, 11},
+	{[]int{2, 1}, 1},
+	{[]int{1}, 1},
+}
+
+func TestFindMin(t *testing.T) {
+	for _, tt := range tests {
+		if got := findMin(tt.nums); got != tt.want {
+			t.Errorf("findMin(%v) = %v, want %v", tt.nums, got, tt.want)
+		}
+	}
+}
+
+func BenchmarkFindMin(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		findMin(tests[0].nums)
+	}
+}

Leetcode_labuladong/153.寻找旋转排序数组中的最小值.go

@@ -9,15 +9,15 @@
 // @lc code=start
 func findMin(nums []int) int {
 	left, right := 0, len(nums)-1
-	for left <= right {
+	for left < right {
 		if nums[left] < nums[right] {
 			return nums[left]
 		}
 		mid := int(uint(left+right) >> 1)
-		if nums[mid] < left {
-			right = mid - 1
-		} else {
+		if nums[mid] >= nums[left] {
 			left = mid + 1
+		} else {
+			right = mid
 		}
 	}
 	return nums[left]