zoukankan      html  css  js  c++  java
  • 11. Container With Most Water

    Given n non-negative integers a1a2, ..., an , where each represents a point at coordinate (iai). n vertical lines are drawn such that the two endpoints of line i is at (iai) 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
     
    至今无法理解怎么想出这种方法的.
    从两端向中间逼近. 面积=宽(j-i) x 高 
    接下来选择i,j中比较矮的向中间靠近即可.
     
    class Solution {
    public:
        int maxArea(vector<int>& height) {
            int res=0;
            for(int i=0,j=height.size()-1;i<j;)
            {
                res=max(res,min(height[i],height[j])*(j-i));
                if(height[i]<height[j])++i;
                else --j;
            }
            return res;
        }
    };
  • 相关阅读:
    购物车宣传页
    项目开发流程
    AJAX跨域
    jQuery中的AJAX
    AJAX封装
    AJAX里使用模板引擎
    AJAX的具体使用
    AJAX的基本使用
    js技巧汇总
    CSS特效汇集
  • 原文地址:https://www.cnblogs.com/lychnis/p/11749495.html
Copyright © 2011-2022 走看看