@@ -0,0 +1,592 @@
+package algorithms.a11_to_a20.a11_ContainerWithMostWater_Medium;%0A%0A//#Array#, #Two Pointers#%0Apublic class Solution %7B%0A    public int maxArea(int%5B%5D height) %7B%0A        int l = 0, r = height.length - 1;%0A        int max = 0;%0A        while (l %3C r) %7B%0A        %09max = Math.max(max, (r - l) * Math.min(height%5Bl%5D, height%5Br%5D));%0A        %09if (height%5Bl%5D %3C height%5Br%5D) %7B%0A        %09%09do %7B%0A        %09%09%09l++;%0A        %09%09%7D while (l %3C r && height%5Bl%5D %3C height%5Bl - 1%5D);%0A        %09%7D else %7B%0A        %09%09do %7B%0A        %09%09%09r--;%0A        %09%09%7D while (l %3C r && height%5Br%5D %3C height%5Br + 1%5D);%0A        %09%7D%0A        %7D%0A        return max;%0A    %7D%0A%7D

solve 11