11. Container With Most Water(unsolved)

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.

解答：
这道题的意思就是给出一堆高度作为左右面板高度，计算两面板和x轴组成的盆的容积。盆的容积应以最低面板高度为准。
算法核心就是一个个试，但是怎么试呢，就是一个个计算容积，然后移动较低的面板。因为变成高的面板后才有可能容积变得更大。

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