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.

Example

Example 1:

Input：[2,1,5,6,2,3]
Output：10
Explanation：
The third and fourth rectangular truncated rectangle has an area of 2*5=10.

Example 2:

Input：[1,1]
Output：2
Explanation：
The first and second rectangular truncated rectangle has an area of 2*1=2.

思路：求最大矩阵，就是求每个元素height * 最左边第一个小于他的元素 到右边第一个小于他的元素之间的距离；

这样求左右第一个最小，我们用单调递增栈可以完成。注意stack里面存的是index；因为需要计算width，用index可以知道高度；反而用高度没法计算width； Trapping Rain Water 用的是递减栈；这里需要求最小，用的是递增栈；

class Solution {
    public int largestRectangleArea(int[] heights) {
        Stack<Integer> stack = new Stack<>();
        int res = 0;
        for(int i = 0; i <= heights.length; i++) {
            if(stack.isEmpty()) {
                stack.push(i);
            } else {
                int curvalue = (i == heights.length) ? -1 : heights[i];
                while(!stack.isEmpty() && heights[stack.peek()] >= curvalue) {
                    int j = stack.pop();
                    int left = stack.isEmpty() ? 0 : stack.peek() + 1;
                    int right = i - 1;
                    int len = right - left + 1;
                    res = Math.max(res, len * heights[j]);
                }
                stack.push(i);
            }
        }
        return res;
    }
}