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.

    此题用two pointer来做,用sum来保存容积,两个pointer中,高度相对较小的往中间移,代码如下:

    public class Solution {

        public int maxArea(int[] height) {

            int left = 0;

            int right = height.length-1;

            int sum=-1;

            while(left<right){

                sum = Math.max(sum,(right-left)*Math.min(height[left],height[right]));

                if(height[left]<height[right]){

                    left++;

                }else{

                    right--;

                }

            }

            return sum;

        }

    }

  • 相关阅读:
    UIViewController生命周期
    NSTImer重复执行任务
    IOS平台汉字转拼音方案
    @properties指针说明
    自定义yum仓库
    man手册、zip备份
    ln 软连接与硬连接
    fdisk分区规划和添加wap交换空间
    window部署ftp服务器
    配置附加权限和LDAP
  • 原文地址:https://www.cnblogs.com/codeskiller/p/6357297.html
Copyright © 2011-2022 走看看