[leetcode]11. Container With Most Water

[leetcode]11. Container With Most Water

---

Analysis

是阴天呢—— [每天刷题并不难0.0]

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.

Explanation:

前后两个指针同时遍历，最开始容器的底部是最宽的，所以如果想要后面的容器可以装更多的水必须要找到更高的容器。

Implement

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