zoukankan      html  css  js  c++  java
  • Container With Most Water(LintCode)

    Container With Most Water

    Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai)n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.

    Example

    Given [1,3,2], the max area of the container is 2.

    Note

    You may not slant the container.

    从数组两头遍历,计算面积,然后从小的那一段a开始找到下一个比a大的元素。直到所有数组都被遍历。

     1 public class Solution {
     2     /**
     3      * @param heights: an array of integers
     4      * @return: an integer
     5      */
     6     public int maxArea(int[] heights) {
     7         int l = heights.length;
     8         if (l == 0) {
     9             return 0;
    10         }
    11         int max = -1;
    12         int i = 0;
    13         int j = l-1;
    14         while (i < j) {
    15             int v = (j - i) * Math.min(heights[i],heights[j]);
    16             if (max < v) {
    17                 max = v;
    18             }
    19             
    20             if(heights[i] > heights[j]){
    21                 int x = heights[j];
    22                 while (heights[j] <= x && i < j) j--;
    23             }else {
    24                 int x = heights[i];
    25                 while(heights[i] <= x && i < j) i++;
    26             }
    27         }
    28         return max;
    29     }
    30 }
    View Code
  • 相关阅读:
    tornado中form表单验证详解
    关于tornado中session的总结
    Linux常用命令
    css3动画属性详解 与超酷例子
    keepalive高可用的健康检查
    keepalive的nginx防火墙问题
    安装配置hadoop
    tmux的简单快捷键
    部署使用elk
    k8s搭建部署
  • 原文地址:https://www.cnblogs.com/FJH1994/p/5033436.html
Copyright © 2011-2022 走看看