[Leetcode] 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.

Note: You may not slant the container.

 

1. left pointer

2. right pointer

3. max to store the result

 

edge case

height == null?

height.length == 0?

time complexity O(n)

 

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

 

[Leetcode] Container with Most Water