-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlargestRectangleInHistogram.js
More file actions
44 lines (42 loc) · 1.38 KB
/
Copy pathlargestRectangleInHistogram.js
File metadata and controls
44 lines (42 loc) · 1.38 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
/**
* @param {number[]} heights
* @return {number}
*/
var largestRectangleArea = function(heights) {
let prevSmallElementArr = [];
let stack = [];
for(let itr = 0; itr < heights.length; itr++) {
while(stack.length && heights[stack[stack.length-1]] >= heights[itr]){
stack.pop();
}
if(stack.length == 0) {
prevSmallElementArr.push(-1 + 1);
} else {
prevSmallElementArr.push(stack[stack.length-1] + 1);
}
stack.push(itr);
}
console.log(prevSmallElementArr);
let nextSmallerElementArr = [];
stack = [];
for(let itr = heights.length-1; itr >= 0; itr--) {
while(stack.length && heights[stack[stack.length-1]] >= heights[itr]){
stack.pop();
}
if(stack.length == 0) {
nextSmallerElementArr.push(heights.length-1);
} else {
nextSmallerElementArr.push(stack[stack.length-1] - 1);
}
stack.push(itr);
}
nextSmallerElementArr.reverse()
console.log(nextSmallerElementArr);
let maxArea = 0;
for(let itr = 0; itr < heights.length; itr++) {
let area = heights[itr] * ( nextSmallerElementArr[itr] - prevSmallElementArr[itr] +1 );
maxArea = Math.max(maxArea, area);
}
return maxArea;
};
//https://leetcode.com/problems/largest-rectangle-in-histogram/