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.

 

思路：

1.两个循环（time exceeded）

 

看了discuss之后我发现我的想法不对，我原本以为是取i~j列中的最小值作为水平面。但题目的意思是只管两侧就好了

 

代码 C++：

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

https://leetcode.com/discuss/41527/simple-and-fast-c-c-with-explanation