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.

Above is a histogram where width of each bar is 1, given height = [2,1,5,6,2,3].

The largest rectangle is shown in the shaded area, which has area = 10 unit.

For example,
Given height = [2,1,5,6,2,3],
return 10.

-----------------------------------------------------------------------------

1，剪枝。如果height[i+1] > height[i], 那么height[i]为右边界的肯定<height[i+1]为右边界的，所以不用往下考虑了。

2，用很神奇的stack。

public class Solution {
    public int largestRectangleArea(int[] height) {
        int len = height.length;
        int max = 0;
        
        //选择右边界，剪枝，穷举左边界。 
        for (int i = 0; i < len; i++) {
            while (i < len -1 && height[i+1] >= height[i]) {
                i++;
            }
            
            int min = height[i];
            for (int j = i; j >= 0; j--) {
                min = Math.min(min, height[j]);
                int area = min * (i - j + 1);
                max = Math.max(max, area);
            }
        }
        return max;
    }
}