11. Container With Most Water

哦？markdown编辑器更新了？啥玩意？
不管不管，完成作业要紧。

题目

leetcode 11

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 and n is at least 2.

解答

solution的动态直观明了。这应该是贪心算法吧。
面积取决于短板，下一次就从更换短的，看下一个能不能变长。

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