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

解答：

class Solution {
public:
    int maxArea(vector<int> &height) {
        int left = 0;
        int right = height.size() - 1;
        int max = 0;
        int cur;
        
        while(left < right) {
            cur = min(height[left], height[right]) * (right - left);
            max = max > cur ? max : cur;
            
            if(height[left] < height[right]) {
                left++;
            }
            else {
                right--;
            }
        }
        
        return max;
    }
};

思路：

简单理解就是想区域内插两块板，最优解的两块板一定在区域内，所以定下规则让left自加与right自减，则一定能找到最优解。