LeetCode Container With Most Water

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 i = 0,j = height.size() - 1;
int m = 0, s;
while(i < j) {
s = min(height[i], height[j]) * (j - i);
if(s > m) m = s;
if(height[i] < height[j]) i++;
else j--;
}
return m;
}
};

思路：解法时间复杂度O(n)，又一次采用了和Two Sum类似的方法。

暴力解法的时间复杂度O(n^2)。