feat: add 011

Author: Blankj

note/011/README.md

@@ -0,0 +1,29 @@
+# [Container With Most Water][title]
+
+## Description
+
+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.
+
+**Tags:** Array, Two Pointers
+
+
+## 思路
+
+
+
+```java
+
+```
+
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-java-leetcode][ajl]
+
+
+
+[title]: https://leetcode.com/problems/container-with-most-water
+[ajl]: https://github.com/Blankj/awesome-java-leetcode