Container With Most Water

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.

我们双指针解决这个问题。left指针指向第一个线段，right指针指向最后一个线段，得到一个面积area。面积area的大小是受长度短的那个边来决定的，因此如果left指向的线段L小于right指向的线段R时，我们就让left ++， 否则right++，直到left 和right两个指针重合。代码如下：

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