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

 

题目意思大概是找出可以盛放最多水的容器，我的思路是通过遍历一个一个的去比较，找出乘积最大的数

使用了双重for循环，时间复杂度为O(n2)：

代码如下(js实现):

var maxArea = function(height) {
    var area = 0;
    var Maxarea = 0;
    for(var i=0;i<height.length;i++){
        for(var j=i+1;j<height.length;j++){
            if(height[i]<=height[j]){
                area = height[i] * (j-i);
            }else{
                area = height[j] * (j-i);
            }
            if(Maxarea<=area){
                Maxarea = area;
            }
        }
    }
    return Maxarea;
};