11. Container With Most Water

来源:互联网 发布:淘宝千人千面原理 编辑:程序博客网 时间:2024/06/16 17:45

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.

时间复杂度O(n​2)class Solution {    public int maxArea(int[] height) {        int l = 0;        int area = 0;        for (int i = 0; i < height.length - 1; i++) {            for (int j = i; j < height.length; j++) {                area = Math.max(area, Math.abs((j - i) * Math.min(height[j], height[i])));            }        }        return area;    }}
原创粉丝点击