11. Container With Most Water

11. 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 and n is at least 2.
The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.
Example:

Input: [1,8,6,2,5,4,8,3,7]
Output: 49

class Solution {
    public int maxArea(int[] height) {
        if(height.length <= 0) return 0;
        int res = 0;
        int left = 0, right = height.length-1;
        int V = 0;
        while(left < right) {
            int left_side = height[left];
            int right_side = height[right];
            if(left_side < right_side) {
                V = left_side * (right - left);
                left++;
            }
            else {
                V = right_side * (right - left);
                right--;
            }
            res = Math.max(res, V);
        }
        return res;
    }
}

posted on 2019-01-10 15:14 9042 阅读( ...) 评论( ...) 编辑 收藏

转载于:https://www.cnblogs.com/lawrenceSeattle/p/10250145.html