Container With Most Water

题目

Given n non-negative integers a1a2, ..., an, where each represents a point at coordinate (iai). n vertical lines are drawn such that the two endpoints of line i is at (iai) 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;
    }


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值