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.

    这道题里面,一开始从左右两边开始,这个case下宽度是最大的,那之后出现比它大的情况只有两条边中至少一边更长。一种思路是先从左边开始,如果左边比右边小,那么向左挪一位,继续比较。当左边比右边大的情况下,修正结果。然后从右边开始挪,因为此时左边的边是更大的,只有右边比左边还大才可能比之前的contains更多水。

    public int MaxArea(int[] height) {
             int left = 0;
             int right = height.Count()-1;
             int res =Math.Min(height[right],height[left])*(right - left);
             while(left<right)
             {
                 res =Math.Max(res,Math.Min(height[right],height[left])*(right - left));
                 if(height[left]>= height[right])
                 {
                     right--;
                 }
                 else 
                 {
                     left++;
                 }
                
             }
             
             return res;
        }
  • 相关阅读:
    h5-news_index
    h5-爆料view
    h5-列表
    h5-注册
    h5-登录
    h5-弹出层layer,提示,顶部横条,
    jquery 弹窗插件 layer
    jQuery幻灯片插件Owl Carousel
    display:block jquery.sort()
    Android 开源框架ViewPageIndicator 和 ViewPager 仿网易新闻客户端Tab标签
  • 原文地址:https://www.cnblogs.com/renyualbert/p/5907685.html
Copyright © 2011-2022 走看看