[LeetCode] Container With Most Water

[Problem][/b]
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.


[Solution]

class Solution {
public:
int maxArea(vector<int> &height) {
// Start typing your C/C++ solution below
// DO NOT write int main() function

int i = 0, j = height.size()-1, area = 0, max = 0;
while(i < j){
area = (height[i] < height[j] ? height[i] : height[j]) * (j - i);
max = max > area ? max : area;
height[i] < height[j] ? i++ : j--;
}
return max;
}
};

说明：版权所有，转载请注明出处。Coder007的博客