Day60(84)完结撒花

84. Largest Rectangle in Histogram

Given an array of integers heights representing the histogram’s bar height where the width of each bar is 1, return the area of the largest rectangle in the histogram.

Example 1:

Day60(84)完结撒花_第1张图片

Input: heights = [2,1,5,6,2,3]
Output: 10
Explanation: The above is a histogram where width of each bar is 1.
The largest rectangle is shown in the red area, which has an area = 10 units.

Example 2:

Day60(84)完结撒花_第2张图片

Input: heights = [2,4]
Output: 4

class Solution {  
    int largestRectangleArea(int[] heights) {  
        Stack st = new Stack();  
          
        int [] newHeights = new int[heights.length + 2];  
        newHeights[0] = 0;  
        newHeights[newHeights.length - 1] = 0;  
        for (int index = 0; index < heights.length; index++){  
            newHeights[index + 1] = heights[index];  
        }  
  
        heights = newHeights;  
  
        st.push(0);  
        int result = 0;  
        for (int i = 1; i < heights.length; i++) {  
            if (heights[i] > heights[st.peek()]) {  
                st.push(i);  
            } else if (heights[i] == heights[st.peek()]) {  
                st.pop();   
                st.push(i);  
            } else {  
                while (heights[i] < heights[st.peek()]) {   
                    int mid = st.peek();  
                    st.pop();  
                    int left = st.peek();  
                    int right = i;  
                    int w = right - left - 1;  
                    int h = heights[mid];  
                    result = Math.max(result, w * h);  
                }  
                st.push(i);  
            }  
        }  
        return result;  
    }  
}

你可能感兴趣的:(leetcode刷题,算法)