Largest Rectangle in Histogram

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.

Solution I

First solution comes to my mind is that For every rectangle, traverse all the rectangles before it and store current max area. If the height of current rectangle is less than or equals to next one, skip current rectangle to decrease time.

public class Solution {
    public int largestRectangleArea(int[] height) {
        if (height == null || height.length == 0)
            return 0;
            
        int max = 0;
        
        for (int i = 0; i < height.length; i++) {
            
            if (i + 1 < height.length && height[i] <= height[i + 1])
                continue;
                
            int min = height[i];
            
            for (int j = i; j >= 0; j--) {
                min = Math.min(min, height[j]);
                int maxArea = min * (i - j + 1);
                
                if (maxArea > max) {
                    max = maxArea;
                }
                
            }
        }
        
        
        return max;
    }
}