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.
https://leetcode.com/problems/container-with-most-water/
先看了Trapping Rain Water从Similar Problems里找到这道,迷糊了好久。
就是选2块隔板,隔板之间的不占容积。
双指针水题。
1 /** 2 * @param {number[]} height 3 * @return {number} 4 */ 5 var maxArea = function(height) { 6 var i = 0, j = height.length - 1, max = 0, curr; 7 while(i < j){ 8 curr = Math.min(height[i], height[j]) * (j - i); 9 if(curr > max){ 10 max = curr; 11 } 12 height[i] < height[j] ? i++ : j--; 13 } 14 return max; 15 };
时间: 2024-10-13 20:57:42