LeetCode--Container With Most Water

最新推荐文章于 2025-09-10 15:24:29 发布

weixin_30681121

最新推荐文章于 2025-09-10 15:24:29 发布

阅读量46

点赞数

CC 4.0 BY-SA版权

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/neversayno/p/5291819.html

本文介绍了一种计算垂直线形成的水桶最大容量的方法，通过遍历数组找到两个最远且高度差值最大的线段，以此计算水桶的最大容量。

Given n non-negative integers a₁, a₂, ..., a_n, where each represents a point at coordinate (i, a_i). n vertical lines are drawn such that the two endpoints of line i is at (i, a_i) 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.

代码：

package leetcode;
//题目的意思：两条垂直线和所对应的i的差值所组成的水桶（短的那条决定高度），计算其最大的容量；
public class ContainerWithMostWater {

   public int maxArea(int[] height) {
       if (height.length <= 1||height==null)
           return 0;
       int start = 0;
       int end = height.length - 1;
       int MaxCon = 0;
       while (start < end) {
           int high = Math.min(height[start], height[end]);
           int wide = end - start;
           int curCon = high * wide;

           MaxCon = Math.max(MaxCon, curCon);
           if (height[start] < height[end]) {
               start++;
           } else {
               end--;
           }
       }
       return MaxCon;

   }

   public static void main(String[] args) {
       // TODO Auto-generated method stub

   }

}