commit solution 11

Author: lxlxw

Diff for: index-tags.md

@@ -7,6 +7,7 @@
 |  题号  |  题解  |  标签  | 难度  | 是否解题 |
 | --- | --- | --- | --- | --- |
 |  [1](https://leetcode-cn.com/problems/two-sum)  |  [两数之和](/solution/1-99/0001.two-sum/)  |  `数组`,`哈希表`  |  <font color=green>简单</font>  | ✅ |
+|  [11](https://leetcode-cn.com/problems/container-with-most-water)  |  [盛最多水的容器](/solution/1-99/0011.container-with-most-water/)  |  `数组`,`双指针`  |  <font color=blue>中等</font>  |✅ |
 |  [26](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array)  |  [删除排序数组中的重复项](/solution/1-99/0026.remove-duplicates-from-sorted-array/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
 |  [27](https://leetcode-cn.com/problems/remove-element)  |  [移除元素](/solution/1-99/0027.remove-element/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
 |  [35](https://leetcode-cn.com/problems/search-insert-position)  |  [搜索插入位置](/solution/1-99/0035.search-insert-position/)  |  `数组`,`二分查找`  |  <font color=green>简单</font>  |✅ |
@@ -65,6 +66,7 @@
 
 |  题号  |  题解  |  标签  | 难度  | 是否解题 |
 | --- | --- | --- | --- | --- |
+|  [11](https://leetcode-cn.com/problems/container-with-most-water)  |  [盛最多水的容器](/solution/1-99/0011.container-with-most-water/)  |  `数组`,`双指针`  |  <font color=blue>中等</font>  |✅ |
 |  [26](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array)  |  [删除排序数组中的重复项](/solution/1-99/0026.remove-duplicates-from-sorted-array/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
 |  [27](https://leetcode-cn.com/problems/remove-element)  |  [移除元素](/solution/1-99/0027.remove-element/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
 |  [28](https://leetcode-cn.com/problems/implement-strstr)  |  [实现 strstr()](/solution/1-99/0028.implement-strstr%28%29/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |✅ |

Diff for: index-type.md

@@ -410,7 +410,7 @@
 |  [5](https://leetcode-cn.com/problems/longest-palindromic-substring)  |  [最长回文子串](/solution/1-99/0005.longest-palindromic-substring/)  |  `字符串`,`动态规划`  |  <font color=blue>中等</font>  |
 |  [6](https://leetcode-cn.com/problems/zigzag-conversion)  |  [z 字形变换](/solution/1-99/0006.zigzag-conversion/)  |  `字符串`  |  <font color=blue>中等</font>  |
 |  [8](https://leetcode-cn.com/problems/string-to-integer-atoi)  |  [字符串转换整数 (atoi)](/solution/1-99/0008.string-to-integer-%28atoi%29/)  |  `数学`,`字符串`  |  <font color=blue>中等</font>  |
-|  [11](https://leetcode-cn.com/problems/container-with-most-water)  |  [盛最多水的容器](/solution/1-99/0011.container-with-most-water/)  |  `数组`,`双指针`  |  <font color=blue>中等</font>  |
+|  [11](https://leetcode-cn.com/problems/container-with-most-water)  |  [盛最多水的容器](/solution/1-99/0011.container-with-most-water/)  |  `数组`,`双指针`  |  <font color=blue>中等</font>  |✅ |
 |  [12](https://leetcode-cn.com/problems/integer-to-roman)  |  [整数转罗马数字](/solution/1-99/0012.integer-to-roman/)  |  `数学`,`字符串`  |  <font color=blue>中等</font>  |
 |  [15](https://leetcode-cn.com/problems/3sum)  |  [三数之和](/solution/1-99/0015.3sum/)  |  `数组`,`双指针`  |  <font color=blue>中等</font>  |
 |  [16](https://leetcode-cn.com/problems/3sum-closest)  |  [最接近的三数之和](/solution/1-99/0016.3sum-closest/)  |  `数组`,`双指针`  |  <font color=blue>中等</font>  |

Diff for: solution/1-99/0011.container-with-most-water/README.md

@@ -2,7 +2,6 @@
 
 ### 题目描述
 
-<!-- 这里写题目描述 -->
 <p>给你 <em>n</em> 个非负整数 <em>a</em><sub>1</sub>，<em>a</em><sub>2，</sub>...，<em>a</em><sub>n，</sub>每个数代表坐标中的一个点&nbsp;(<em>i</em>,&nbsp;<em>a<sub>i</sub></em>) 。在坐标内画 <em>n</em> 条垂直线，垂直线 <em>i</em>&nbsp;的两个端点分别为&nbsp;(<em>i</em>,&nbsp;<em>a<sub>i</sub></em>) 和 (<em>i</em>, 0)。找出其中的两条线，使得它们与&nbsp;<em>x</em>&nbsp;轴共同构成的容器可以容纳最多的水。</p>
 
 <p><strong>说明：</strong>你不能倾斜容器，且&nbsp;<em>n</em>&nbsp;的值至少为 2。</p>
@@ -24,14 +23,30 @@
 
 ### 解题思路
 
+1. 双指针
 
 ### 具体解法
 
-<!-- tabs:start -->
 
 #### **Golang**
 ```go
-
+func maxArea(height []int) int {
+	p, q := 0, len(height)-1
+	var ret int
+	var tmp int
+	for p < q {
+		if height[p] < height[q] {
+			tmp = height[p] * (q - p)
+			p++
+		} else {
+			tmp = height[q] * (q - p)
+			q--
+		}
+		if ret < tmp {
+			ret = tmp
+		}
+	}
+	return ret
+}
 ```
 
-<!-- tabs:end -->

Diff for: solution/1-99/0011.container-with-most-water/solution.go

@@ -0,0 +1,29 @@
+package leetcode
+
+/*
+ * @lc app=leetcode.cn id=11 lang=golang
+ *
+ * [11] 盛最多水的容器
+ */
+
+// @lc code=start
+func maxArea(height []int) int {
+	p, q := 0, len(height)-1
+	var ret int
+	var tmp int
+	for p < q {
+		if height[p] < height[q] {
+			tmp = height[p] * (q - p)
+			p++
+		} else {
+			tmp = height[q] * (q - p)
+			q--
+		}
+		if ret < tmp {
+			ret = tmp
+		}
+	}
+	return ret
+}
+
+// @lc code=end

Diff for: solution/1-99/0011.container-with-most-water/solution_test.go

@@ -0,0 +1,16 @@
+package leetcode
+
+import (
+	"testing"
+)
+
+func TestMaxArea(t *testing.T) {
+	var ret int
+	var nums []int
+
+	nums = []int{1, 8, 6, 2, 5, 4, 8, 3, 7}
+	ret = 49
+	if ret != maxArea(nums) {
+		t.Fatalf("case fails %v\n", ret)
+	}
+}

Diff for: solution/1-99/_sidebar.md

@@ -16,7 +16,7 @@
     - [8. 字符串转换整数 (atoi)](solution/1-99/0008.string-to-integer-atoi/)
     - [9. 回文数 ✅](solution/1-99/0009.palindrome-number/)
     - [10. 正则表达式匹配](solution/1-99/0010.regular-expression-matching/)
-    - [11. 盛最多水的容器](solution/1-99/0011.container-with-most-water/)
+    - [11. 盛最多水的容器 ✅](solution/1-99/0011.container-with-most-water/)
     - [12. 整数转罗马数字](solution/1-99/0012.integer-to-roman/)
     - [13. 罗马数字转整数 ✅](solution/1-99/0013.roman-to-integer/)
     - [14. 最长公共前缀](solution/1-99/0014.longest-common-prefix/)