8 - Container With Most Water

Given n non-negative integers a₁, a₂, ..., a_n, where each represents a point at coordinate (i, a_i). n vertical lines are drawn such that the two endpoints of line i is at (i, a_i) 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.

solution: 设置start与end两个一前一后的变量分别值为数组最前与最后数据，计算面积，若大于已存最大面积则保存；同时两变量根据数组中的值大小来进行递增递减；最终相遇。

原理是如果height[i]较小，那么根据木桶装水的理论，这是短板，因此无论j再往前移多少位，都不过超过当前的值了，故而i++，同理对j--

做到trapping water的时候发现这两题略有点类似，都是根据木桶原理来装水的，道理也一样都是得到短板再计算装水量。算法也是类似，都是two point；链接如下，以供以后参考。

http://blog.csdn.net/superrobin/article/details/12610591

class Solution {
public:
    int min(int left, int right)
    {
        return left>right?right:left;
    }

    int maxArea(vector<int> &height) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int size = height.size();
        if(size < 2)
            return 0;
        
        int start = 0;
        int end = size -1;
        int area = 0;
        
        while(start < end)
        {
            int hei = min(height[start],height[end]);
            int tempArea = hei * (end - start);
            if(tempArea > area)
                area = tempArea;
            
            if(height[start] <= height[end])
                start ++;
            else
                end --;
        }
        
        return area;
    }
};