Container With Most Water Leetcode

最新推荐文章于 2019-01-10 22:08:37 发布

AresGod

最新推荐文章于 2019-01-10 22:08:37 发布

阅读量690

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/AresGod/article/details/40042647

版权

LeetCode 专栏收录该内容

35 篇文章 0 订阅

订阅专栏

Container With Most Water

Total Accepted: 18794 Total Submissions: 60105 My Submissions

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.

Note: You may not slant the container.

public class Solution {
    public int maxArea(int[] height) {
        int maxArea = 0;
        if (height == null || height.length <= 1) {
            return maxArea;
        }
        if (height.length == 2) {
            return Math.min(height[1], height[0]);
        }
        int left = 0;
        int right = height.length - 1;
        int maxHeight = 0;
        boolean direction = false;
        while (left < right){
          int usefulHeight = Math.min(height[left], height[right]);
          int thisArea = usefulHeight * (right - left);
          maxArea = Math.max(thisArea, maxArea);
          if (height[left] > height[right]) {
            right--;
          } else {
                left++;
          }
    }
    return maxArea;
}
}

改进了一下，但是速度好像没什么提高

public class Solution {
    public int maxArea(int[] height) {
        int maxArea = 0;
        if (height == null || height.length <= 1) {
            return maxArea;
        }
        if (height.length == 2) {
            return Math.min(height[1], height[0]);
        }
        int left = 0;
        int right = height.length - 1;
        int maxHeight = 0;
        boolean direction = false;
        while (left < right){
          int usefulHeight = Math.min(height[left], height[right]);
          int thisArea = usefulHeight * (right - left);
          maxArea = Math.max(thisArea, maxArea);
          int oldLeft = left;
          int oldRight = right;
          if (height[left] > height[right]) {
            int temp = right;
            while (temp > left && height[temp] <= height[right]){
                temp--;
            }
            right = temp;
          } else {
              int temp = left;
              while (temp < right && height[temp] <= height[left]) {
                 temp++;
              }
              left = temp;
          }
          if ( left == oldLeft && right == oldRight) {
              break;
          }
    }
    return maxArea;
}
}