11.计算容器最大储水量

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.

知识补充：

在解决此类问题时要善于逻辑分析理解问题，找到最优化的解法，排除掉冗余的计算。
例如本题，当左侧的高度高于右侧的高度时，保持右侧高度不变，内部高度无论多少都不可能比此时面积大。同理当右侧的高度高于左侧的高度时，保持左侧高度不变，内部高度无论多少都不可能比此时面积大。这样大大的减少了计算复杂度。

测试代码（c++）：

int maxArea(vector<int>& height) {
        int chang = 0;
        int kuan = 0;
        int area = 0;
        int max_area = 0;
        int posx = 0;
        int posy = height.size()-1;

        while(posx<posy)
        {
            if(height[posx]>height[posy])
            {
                chang = posy-posx;
                area = chang*height[posy];
                posy--;

            }else
            {
                chang = posy-posx;
                area = chang*height[posx];
                posx++;
            }
            if(area>max_area)
                max_area = area;

        }
        return max_area;
    }

性能：

参考答案（c++）：

int maxArea(vector<int>& height) {
        int water = 0;
        int i = 0, j = height.size() - 1;
        while (i < j) {
            int h = min(height[i], height[j]);
            water = max(water, (j - i) * h);
            while (height[i] <= h && i < j) i++;
            while (height[j] <= h && i < j) j--;
        }
        return water;
}

性能：

参考答案（python）：

def maxArea(self, height):
    L, R, width, res = 0, len(height) - 1, len(height) - 1, 0
    for w in range(width, 0, -1):
        if height[L] < height[R]:
            res, L = max(res, height[L] * w), L + 1
        else:
            res, R = max(res, height[R] * w), R - 1
    return res

性能：