[LeetCode] 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.

利用贪心的思想，从头尾开始遍历，移动较矮的索引。基本原理是，一个索引low，一个索引high。装水的容量是由短板决定的，所以需要移动的是短板。

class Solution{
public:
    int maxArea(vector<int>& height){
        int max_area = 0x8fffffff;
        int low = 0;
        int high = height.size()-1;
        while(low<high){
            int temp = (high-low)*min(height[low],height[high]);
            if(max_area<temp)
                max_area = temp;
            if(height[low]<height[high])
                ++low;
            else
                --high;
        }
        return max_area;
    }
};