【Leetcode】Largest Ractangular_leetcode largestrectanglearea-优快云博客

本文介绍了一种求解直方图中最大矩形面积的方法，通过使用栈来记录柱状的高度并计算最大面积。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

【题目】

Largest Rectangle in Histogram

Total Accepted: 42804 Total Submissions: 188970 My Submissions

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.

【思路】

觉得并没有特别懂。。。懂得留个言

【代码】

public class Solution {
public int largestRectangleArea(int[] height) {
    if (height==null) return 0;//Should throw exception
    if (height.length==0) return 0;

    Stack<Integer> index= new Stack<Integer>();
    index.push(-1);
    int max=0;

    for  (int i=0;i<height.length;i++){
            //Start calculate the max value
        while (index.peek()>-1)
            if (height[index.peek()]>height[i]){
                int top=index.pop();                    
                max=Math.max(max,height[top]*(i-1-index.peek()));  
            }else break;

        index.push(i);
    }
    while(index.peek()!=-1){
        int top=index.pop();
        max=Math.max(max,height[top]*(height.length-1-index.peek()));
    }        
    return max;
}