LeetCode算法系列：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.

 

The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.

 

Example:

Input: [1,8,6,2,5,4,8,3,7]
Output: 49

算法描述

最简单的方法是计算所有情况，进行暴力枚举，时间复杂度达到O(n^2),在此不再叙述

---

给定一个int型变量记录最大蓄水量的值，其初值设为0，然后分别从数组的两侧向对方方向扫描，由于蓄水量=底(j-i)X高(i,j处高的较小值)。

area=min(height[right],height[left])∗(right−left)area=min(height[right],height[left])∗(right−left) 

要想使最大蓄水量值增大，在底减小的情况下要使高增大。

---

具体策略如下：
如果height[left] < height[right]，那么left右移，找到一个比height[left]大的值。反之，则right左移。

这样则可以保证未计算的所有情况都小于某一时刻的最大蓄水量值

算法实现

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