Leetcode11 Container With Most Water

class Solution {
    public int maxArea(int[] height) {
//        int[][] dp = new int[height.length][height.length];
        int max=0;
        for(int i=0;i<height.length-1;i++) {
            for(int j=i+1;j<height.length;j++) {
//                dp[i][j]=(j-i)*Math.min(height[i], height[j]);
                max = Math.max(max, (j-i)*Math.min(height[i], height[j]));
            }
        }
        return max;
    }
}

class Solution {
    public int maxArea(int[] height) {
        int max=0,l=0,r=height.length-1;
        while(l<r) {
            max = Math.max(max, (r-l)*Math.min(height[l], height[r]));
            if(height[l]>height[r]) r--;
            else l++;
        }
        return max;
    }
}