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.

    Similar: 42. Trapping Rain Water

     1 public class Solution {
     2     public int maxArea(int[] height) {
     3         if (height.length < 2) return 0;
     4         int l = 0, r = height.length-1;
     5         int max = 0;
     6         while (l < r) {
     7             int lomax = height[l];
     8             int himax = height[r];
     9             max = Math.max(max, (r - l) * (lomax < himax ? lomax : himax));
    10             
    11             if (height[l] < height[r])
    12                 while (l < r && height[l] <= lomax) l++; // will change l at least one step
    13             else while (l < r && height[r] <= himax) r--;
    14         }
    15         
    16         return max;
    17     }
    18 }
  • 相关阅读:
    回顾C#3.0新特性(3)
    第五周作业
    第六周基础作业
    第三周syh
    基础作业
    第七周作业
    2019年春季学期第四周作业
    第八周作业
    .Net 反射
    C#中SqlParameter
  • 原文地址:https://www.cnblogs.com/joycelee/p/5398059.html
Copyright © 2011-2022 走看看