【leetcode】11. 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.
 */

//题意：有n条垂直于x轴的竖线，找两条与x轴围成的面积最大
//如果两条线为l,r(l<r),面积公式： min(a[l], a[r]) * (r - l);
//

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int maxArea(vector<int> &height) {

    int area = 0;
    int n = height.size();
    int l = 0, r = n - 1;
    while (l<r)
    {
        area = max(area, min(height[l], height[r]) * (r - l));

        //如果 左边的高度小于右边的高度，以及 height[l+1] < height[r], 就可以直接跳过
        if (height[l] < height[r])
        {
            int k = l;
            while (k < r && height[k] <= height[l])
                k++;
            l = k;
        }
        else
        {
            //同理，右边的高度小于左边的高度，以及 height[l] > height[r-1], 就可以直接跳过
            int k = r;
            while (k > l && height[k] <= height[r])
                k--;
            r = k;
        }
    }
    return area;
}


int main()
{
    vector<int> ret = { 8, 4, 9, 13, 2, 5, 7, 10 };

    cout << maxArea(ret);

    system("pause");
    return 0;
}