@@ -0,0 +1,773 @@
+class Solution %7B%0A    public int maxArea(int%5B%5D height) %7B%0A        // https://leetcode-cn.com/problems/container-with-most-water/%0A        // %E6%9C%80%E5%A4%A7 -%3E %E6%9B%B4%E5%A4%A7%E6%80%8E%E4%B9%88%E6%89%BE%0A        int maxWater = 0;%0A        int curWater;%0A        int curHeight;%0A        int i = 0;%0A        int j = height.length - 1;%0A%0A        while (i %3C j) %7B%0A            curHeight = Math.min(height%5Bi%5D, height%5Bj%5D);%0A            curWater = curHeight * (j - i);%0A            // System.out.printf(%22i: %25d, j: %25d %5Cn%22, i, j);%0A            if (curWater %3E maxWater) %7B%0A                maxWater = curWater;%0A            %7D%0A%0A            while (i %3C j && height%5Bi%5D %3C= curHeight) %7B%0A                i++;%0A            %7D%0A            while (i %3C j && height%5Bj%5D %3C= curHeight ) %7B%0A                j--;%0A            %7D%0A        %7D%0A%0A        return maxWater;%0A    %7D%0A%7D%0A

Create MaxArea.java