feat: 0011.Container-With-Most-Water

Author: kimi0230

Leetcode/0011.Container-With-Most-Water/README.md

@@ -0,0 +1,123 @@
+---
+title: 0011.Container With Most Water
+subtitle: "https://leetcode.com/problems/container-with-most-water/description/"
+date: 2024-03-24T16:31:00+08:00
+lastmod: 2024-03-24T16:31:00+08:00
+draft: false
+author: "Kimi.Tsai"
+authorLink: "https://kimi0230.github.io/"
+description: "0011.Container-With-Most-Water"
+license: ""
+images: []
+
+tags: [LeetCode, Go, Medium, Container With Most Water, Amazon, Microsoft, Adobe, Facebook, Google, Array, Two Pointers, Greedy]
+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: []
+  # ...
+---
+# [0011.Container With Most Water](https://leetcode.com/problems/container-with-most-water/description/)
+
+## 題目
+
+## 題目大意
+
+
+## 解題思路
+利用雙指針, 找出最小的高並乘上兩指針距離, 得出面積
+當左指針高度比右指針高度高時, 將右指針往左移, 反之將左指針往右移.
+
+## Big O
+
+* 時間複雜 : `O(n)`
+* 空間複雜 : `O(1)`
+
+## 來源
+* https://leetcode.com/problems/container-with-most-water/description/
+* https://leetcode.cn/problems/container-with-most-water/description/
+
+## 解答
+https://github.com/kimi0230/LeetcodeGolang/blob/master/Leetcode/0011.Container-With-Most-Water/main.go
+
+```go
+package containerwithmostwater
+
+// 時間複雜 O(n), 空間複雜 O(1)
+func maxArea(height []int) int {
+	left, right := 0, len(height)-1
+	result := 0
+	for left < right {
+		tmp := (right - left) * min(height[left], height[right])
+		result = max(result, tmp)
+		if height[left] > height[right] {
+			right--
+		} else {
+			left++
+		}
+	}
+	return result
+}
+
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+
+```
+
+##  Benchmark
+
+```sh
+
+```

Leetcode/0011.Container-With-Most-Water/main.go

@@ -0,0 +1,31 @@
+package containerwithmostwater
+
+// 時間複雜 O(n), 空間複雜 O(1)
+func maxArea(height []int) int {
+	left, right := 0, len(height)-1
+	result := 0
+	for left < right {
+		tmp := (right - left) * min(height[left], height[right])
+		result = max(result, tmp)
+		if height[left] > height[right] {
+			right--
+		} else {
+			left++
+		}
+	}
+	return result
+}
+
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}

Leetcode/0011.Container-With-Most-Water/main_test.go

@@ -0,0 +1,39 @@
+package containerwithmostwater
+
+import "testing"
+
+var tests = []struct {
+	height []int
+	want   int
+}{
+	{
+		[]int{1, 8, 6, 2, 5, 4, 8, 3, 7},
+		49,
+	},
+	{
+		[]int{4, 3, 2, 1, 4},
+		16,
+	},
+	{
+		[]int{1, 2, 1},
+		2,
+	},
+	{
+		[]int{1, 1},
+		1,
+	},
+}
+
+func TestMaxArea(t *testing.T) {
+	for _, tt := range tests {
+		if got := maxArea(tt.height); got != tt.want {
+			t.Errorf("maxArea(%v) = %v, want %v", tt.height, got, tt.want)
+		}
+	}
+}
+
+func BenchmarkMaxArea(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		maxArea(tests[0].height)
+	}
+}

Leetcode_labuladong/11.盛最多水的容器.go

@@ -0,0 +1,40 @@
+// 時間複雜度: O(n)
+// 空間複雜度: O(1)
+/*
+ * @lc app=leetcode.cn id=11 lang=golang
+ *
+ * [11] 盛最多水的容器
+ */
+
+// @lc code=start
+func maxArea(height []int) int {
+	left, right := 0, len(height)-1
+	result := 0
+	for left < right {
+		tmp := (right - left) * min(height[left], height[right])
+		result = max(result, tmp)
+		if height[left] > height[right] {
+			right--
+		} else {
+			left++
+		}
+	}
+	return result
+}
+
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+
+// @lc code=end
+

README.md

@@ -308,6 +308,7 @@ https://labuladong.gitee.io/algo/2/21/57/
 | [0142](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0142.Linked-List-CycleII/)              |         [Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/)          |       [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0142.Linked-List-CycleII)        | Medium     | O(n) | O(1)  | Linked List, Two Pointers |
 | [0344](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0344.Reverse-String/)                   |               [Reverse String](https://leetcode.com/problems/reverse-string/)                |          [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0344.Reverse-String)          | Easy       | O(n) | O(1)  | Two Pointers              |
 | [0876](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0876.Middle-of-the-Linked-List/)        |    [Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/)     |    [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0876.Middle-of-the-Linked-List)     | Easy       |      |       | Linked List, Two Pointers |
+| [0011](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0011.Container-With-Most-Water/)        |    [Container With Most Water](0011.Container-With-Most-Water)     |    [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0011.Container-With-Most-Water)     | Medium       |      |       |Two Pointers |
 
 ---