添加 problem 11

Algorithms/11. Container With Most Water/11. Container With Most Water.go

@@ -0,0 +1,22 @@
+package leetcode
+
+func maxArea(height []int) int {
+	max, start, end := 0, 0, len(height)-1
+	for start < end {
+		width := end - start
+		high := 0
+		if height[start] < height[end] {
+			high = height[start]
+			start++
+		} else {
+			high = height[end]
+			end--
+		}
+
+		temp := width * high
+		if temp > max {
+			max = temp
+		}
+	}
+	return max
+}

Algorithms/11. Container With Most Water/11. Container With Most Water_test.go

@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+	"fmt"
+	"testing"
+)
+
+type question11 struct {
+	para11
+	ans11
+}
+
+// para 是参数
+// one 代表第一个参数
+type para11 struct {
+	one []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans11 struct {
+	one int
+}
+
+func Test_Problem11(t *testing.T) {
+
+	qs := []question11{
+
+		question11{
+			para11{[]int{1, 8, 6, 2, 5, 4, 8, 3, 7}},
+			ans11{49},
+		},
+
+		question11{
+			para11{[]int{1, 1}},
+			ans11{1},
+		},
+	}
+
+	fmt.Printf("------------------------Leetcode Problem 11------------------------\n")
+
+	for _, q := range qs {
+		_, p := q.ans11, q.para11
+		fmt.Printf("【input】:%v    【output】:%v\n", p.one, maxArea(p.one))
+	}
+	fmt.Printf("\n\n\n")
+}

Algorithms/11. Container With Most Water/README.md

@@ -0,0 +1,27 @@
+# [11. Container With Most Water](https://leetcode.com/problems/container-with-most-water/)
+
+## 题目
+
+Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.
+
+Note: You may not slant the container and n is at least 2.
+
+![](https://s3-lc-upload.s3.amazonaws.com/uploads/2018/07/17/question_11.jpg)
+
+The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.
+
+Example 1:
+
+```c
+Input: [1,8,6,2,5,4,8,3,7]
+Output: 49
+```
+
+
+## 题目大意
+
+给出一个非负整数数组 a1，a2，a3，…… an，每个整数标识一个竖立在坐标轴 x 位置的一堵高度为 ai 的墙，选择两堵墙，和 x 轴构成的容器可以容纳最多的水。
+
+
+这一题也是对撞指针的思路。首尾分别 2 个指针，每次移动以后都分别判断长宽的乘积是否最大。
+