LeetCode之旅（38）

Container With Most Water

Given n non-negative integers a₁, a₂, ..., a_n, where each represents a point at coordinate (i, a_i). n vertical lines are drawn such that the two endpoints of line i is at (i, a_i) 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 s = height.size();
        int maxa = 0, l = 0, r = s-1, tmp;
        while (l < r) {
            tmp = min(height[l], height[r]) * (r-l);
            maxa = max(maxa, tmp);
            if (height[l] <= height[r]) l++;
            else r--;
        }
        return maxa;
    }
};