Created
May 26, 2013 16:42
-
-
Save bittib/5653293 to your computer and use it in GitHub Desktop.
Largest Rectangle in Histogram
Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram. For example, Given height = [2,1,5,6,2,3], return 10.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class Bar{ | |
int height, startIdx; | |
Bar(int h, int i){ this.height = h; this.startIdx = i; } | |
} | |
public int largestRectangleArea(int[] height) { | |
int maxArea = 0; | |
Stack<Bar> stack = new Stack<Bar>(); | |
stack.push(new Bar(-1, 0)); | |
for (int i=0; i<=height.length; i++){ | |
int h = i < height.length ? height[i] : 0; | |
int startIdx = i; | |
while (!stack.isEmpty() && stack.peek().height >= h){ | |
Bar bar = stack.pop(); | |
startIdx = bar.startIdx; | |
maxArea = Math.max(maxArea, (i - startIdx) * bar.height); | |
} | |
stack.push(new Bar(h, startIdx)); | |
} | |
return maxArea; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment