We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
出处:LeetCode 算法第84题 给定 n 个非负整数,用来表示柱状图中各个柱子的高度。每个柱子彼此相邻,且宽度为 1 。 求在该柱状图中,能够勾勒出来的矩形的最大面积。 以上是柱状图的示例,其中每个柱子的宽度为 1,给定的高度为 [2,1,5,6,2,3]。 图中阴影部分为所能勾勒出的最大矩形面积,其面积为 10 个单位。 示例: 输入: [2,1,5,6,2,3] 输出: 10
出处:LeetCode 算法第84题
给定 n 个非负整数,用来表示柱状图中各个柱子的高度。每个柱子彼此相邻,且宽度为 1 。
求在该柱状图中,能够勾勒出来的矩形的最大面积。
以上是柱状图的示例,其中每个柱子的宽度为 1,给定的高度为 [2,1,5,6,2,3]。
[2,1,5,6,2,3]
图中阴影部分为所能勾勒出的最大矩形面积,其面积为 10 个单位。
10
示例:
输入: [2,1,5,6,2,3] 输出: 10
var largestRectangleArea = function (heights) { heights.push(0); var max = 0; var stack = [[0, -1]]; var top = 0; heights.forEach(function (height, index) { var current = index; while (stack[top][0] > height) { var [h, i] = stack.pop(); max = Math.max(max, (index - i) * h) current = i; top--; } if (stack[top][0] < height) { stack.push([height, current]); top++; } }) return max; };
Ï
The text was updated successfully, but these errors were encountered:
No branches or pull requests
习题
解答
Ï
The text was updated successfully, but these errors were encountered: