LeetCode-11 Container With Most Water(two pointers)

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 and n is at least 2.

----

---

Initially we consider the area constituting the exterior most lines. Now, to maximize the area, we need to consider the area between the lines of larger lengths. If we try to move the pointer at the longer line inwards, we won't gain any increase in area, since it is limited by the shorter line. But moving the shorter line's pointer could turn out to be beneficial, as per the same argument, despite the reduction in the width. This is done since a relatively longer line obtained by moving the shorter line's pointer might overcome the reduction in area caused by the width reduction.

如果把 长的边（长边） 往 里面移动的话，不可能获得更大的面积，因为 矩形的面积是 被 短边 来限制的。 而 把  短边  往里面 移动 ，可以通过获得 更长的 边长 而 弥补 宽度的减小。

leetcode上solution中的方法不太好，我处理的更合适。

老办法遍历肯定是超时 无需尝试.

解决思路为取两侧的挡板,高为a,b.因为是两侧了,所以距离肯定是最远的.接下来从a,b中高度低的一侧向里找,遇到比a高的就比较容积,

当a,b大小发生改变时候重新判断,保证遍历方向是从a,b中低的一侧向里走就好.

//自己写的代码如：

class Solution {

    public int maxArea(int[] height) {

        int left=0, right = height.length-1;

        int area=0;

        

        while(left<right)

        {

            int leftHeight=height[left];

            int rightHeight=height[right];

            //计算面积

            area=Math.max(area,Math.min(leftHeight,rightHeight)*(right-left));

            

            //找到比矮边大的边

             if(leftHeight<rightHeight)

                while(left<right&&height[left]<=leftHeight) left++;  // leetcode上solution中的方法不太好，我处理的更合适 。我这样写更好。

            else

                while(left<right&&height[right]<=rightHeight) right--;

        }

        return area;

    }

}