zoukankan      html  css  js  c++  java
  • 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.

     1 public class Solution {
     2     public int maxArea(int[] height) {
     3         int left = 0, right = height.length - 1;
     4         int maxArea = 0;
     5         
     6         while (left < right) {
     7             if (height[left] < height[right]) {
     8                 maxArea = Math.max( height[left] * (right - left), maxArea );
     9                 left++;
    10             } else {
    11                 maxArea = Math.max( height[right] * (right - left), maxArea );
    12                 right--;
    13             }
    14         }
    15         
    16         return maxArea;
    17     }
    18 }
  • 相关阅读:
    Java学习
    机器学习
    机器学习
    Java 学习
    哈希表复习
    [转] 数据库设计步骤
    Java
    c++的函数重载-笔记
    进程与线程-笔记
    内存知识-笔记
  • 原文地址:https://www.cnblogs.com/amazingzoe/p/6660720.html
Copyright © 2011-2022 走看看