Container With Most Water

Description:

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

转载于:https://www.cnblogs.com/deofly/p/container-with-most-water.html