Refine 011_Container_With_Most_Water

Author: qiyuangong

.gitignore

@@ -3,7 +3,7 @@ __pycache__/
 *.py[cod]
 *$py.class
 .idea/
-
+*.iml
 # C extensions
 *.so
 

README.md

@@ -20,6 +20,7 @@ I'm currently working on [Analytics-Zoo](https://github.com/intel-analytics/anal
 | 7 | [Reverse Integer](https://leetcode.com/problems/reverse-integer/) | [Python](https://github.com/qiyuangong/leetcode/blob/master/python/007_Reverse_Integer.py) [Java](https://github.com/qiyuangong/leetcode/blob/master/java/007_Reverse_Integer.java) | Overflow when the result is greater than 2147483647 or less than -2147483648.
 | 8 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/) | [Python](https://github.com/qiyuangong/leetcode/blob/master/python/008_String_to_Integer(atoi).py) [Java](https://github.com/qiyuangong/leetcode/blob/master/java/008_String_to_Integer(atoi).java) | Overflow, Space, and negative number |
 | 9 | [Palindrome Number](https://leetcode.com/problems/palindrome-number/) | [Python](https://github.com/qiyuangong/leetcode/blob/master/python/009_Palindrome_Number.py) [Java](https://github.com/qiyuangong/leetcode/blob/master/java/009_Palindrome_Number.java) | Get the len and check left and right with 10^len, 10 |
+| 11 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water/) | [Python](https://github.com/qiyuangong/leetcode/blob/master/python/011_Container_With_Most_Water.py) [Java](https://github.com/qiyuangong/leetcode/blob/master/java/011_Container_With_Most_Water.java) | 1. Brute Force, O(n^2) and O(1)<br>2. Two points, O(n) and O(1)  |
 | 12 | [Integer to Roman](https://leetcode.com/problems/integer-to-roman/) | [Python](https://github.com/qiyuangong/leetcode/blob/master/python/012_Integer_to_Roman.py) | [Background knowledge](http://www.rapidtables.com/convert/number/how-number-to-roman-numerals.htm) Just like 10-digit number, divide and minus |
 | 13 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer/) | [Python](https://github.com/qiyuangong/leetcode/blob/master/python/013_Roman_to_Integer.py) | Add all curr, if curr > prev, then need to subtract 2 * prev |
 | 15 | [3Sum](https://leetcode.com/problems/3sum/) | [Python](https://github.com/qiyuangong/leetcode/blob/master/python/015_3Sum.py) | 1. Sort and O(n^2) search with three points <br>2. Multiple Two Sum (Problem 1) |

java/011_Container_With_Most_Water.java

@@ -0,0 +1,16 @@
+class Solution {
+  public int maxArea(int[] height) {
+
+    int maxArea = 0;
+    int left = 0;
+    int right = height.length - 1;
+
+    while (left < right) {
+      maxArea = Math.max(maxArea, (right - left) * Math.min(height[left], height[right]));
+      // Two points
+      if (height[left] < height[right]) left++;
+      else right--;
+    }
+    return maxArea;
+  }
+}

java/011_containerwithmostwater.java

@@ -1,43 +1,14 @@
-# class Solution(object):
-#     def maxArea(self, height):
-#         """
-#         :type height: List[int]
-#         :rtype: int
-#         """
-class Solution(object):
-#     def maxArea(self, height):
-#         # brute force
-#         ls = len(height)
-#         left, right = 0, ls - 1
-#         result = 0
-#         while left < right:
-#             result = max(min(height[left], height[right]) * (right - left), result)
-#             if height[left] > height[right]:
-#                 right -= 1
-#             else:
-#                 left += 1
-#         return result
-
-    def maxArea(self, height):
-        # skip some choices
-        ls = len(height)
-        lm = min(height[0], height[ls - 1])
-        max_v = lm * (ls - 1)
-        low = 0
-        high = ls - 1
-        while low < high:
-            while height[low] < lm and low < ls:
-                low += 1
-            while height[high] < lm and high < ls:
-                high -= 1
-            if low > high:
-                break
-            m = min(height[low], height[high])
-            if m * (high - low) > max_v:
-                max_v = m * (high - low)
-                lm = m
-            if height[low] < height[high]:
-                low += 1
+class Solution:
+    def maxArea(self, height: List[int]) -> int:
+        # Two points
+        left, right = 0, len(height) - 1
+        result = 0
+        while left < right:
+            result = max(min(height[left], height[right]) * (right - left), result)
+            if height[left] > height[right]:
+                # remove right
+                right -= 1
             else:
-                high -= 1
-        return max_v
+                # remove left
+                left += 1
+        return result