Container With Most Water

標籤：java   leetcode   數組   

題目

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 int maxArea(int[] height) {        if (height == null || height.length == 0 || height.length == 1) {            return 0;        }        int len = height.length;        int left = 0;        int right = len - 1;        int area = 0;        while (left < right) {        int temp = Math.min(height[left], height[right]) * (right - left);        if (temp > area) {        area = temp;        }        if (height[left] < height[right]) {        left++;        } else {        right--;        }        }        return area;    }