Leet Code 11 Container With Most Water - Java

问题原始链接 https://leetcode.com/problems/container-with-most-water

给定n个非负整数a1,a2,...,an，每个数表示一个点(i,ai)，以(i,ai)和(i,0)为端点画直线。找到两条直线，它们和x轴组成一个容器，能够放最多的水。

public class Solution {
  public static int maxArea(int[] height) {
    if (height == null || height.length <= 1) {
      return 0;
    }

    int maxArea = 0;
    int left = 0;
    int right = height.length - 1;
    while (left < right) {
      maxArea = Math.max(maxArea,
          (right - left) * Math.min(height[left], height[right]));
      if (height[left] < height[right]) {
        left++;
      } else {
        right--;
      }
    }
    return maxArea;
  }
}

 

转载于:https://my.oschina.net/mistymarch/blog/687906