iT邦幫忙

第 11 屆 iT 邦幫忙鐵人賽

DAY 6
0
Software Development

LeetCode小試身手系列 第 6

【Day 6】#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.
LeetCode #6
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) {
        int maxarea = 0, l = 0, r = height.length - 1;
        while (l < r) {
            maxarea = Math.max(maxarea, Math.min(height[l], height[r]) * (r - l));
            if (height[l] < height[r])
                l++;
            else
                r--;
        }
        return maxarea;
    }
}

心得

此題難度為Medium,類似題目還有【42. Trapping Rain Water】,難度為Hard。


希望透過記錄解題的過程,可以對於資料結構及演算法等有更深一層的想法。
如有需訂正的地方歡迎告知,若有更好的解法也歡迎留言,謝謝。


上一篇
【Day 5】#66 - Plus One
下一篇
【Day 7】#1184 - Distance Between Bus Stops
系列文
LeetCode小試身手14

尚未有邦友留言

立即登入留言