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

---

题目大意:

给定一个数组height，height[i] = j 表示坐标(i,j),从i和j做垂线到x轴。找出在height中的两个点和x轴能围成的“桶”能放的最多水是多少？
我们从最左边和左右边的算起，因为这样的底的长度是最大的。由木桶原理可知，“高”要选取较小的那个。之后，我们从高度较低的那边开始向中间偏移。直到算完为止。

---

题目代码:

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