Leetcode 84. Largest Rectangle in Histogram

最新推荐文章于 2024-01-26 10:15:16 发布

SnailTyan

最新推荐文章于 2024-01-26 10:15:16 发布

阅读量188

点赞数

分类专栏： Leetcode 文章标签： Leetcode

本文链接：https://blog.csdn.net/Quincuntial/article/details/81190208

版权

Leetcode 同时被 2 个专栏收录

409 篇文章 18 订阅

订阅专栏

Algorithm

260 篇文章 2 订阅

订阅专栏

文章作者：Tyan
博客：noahsnail.com | CSDN | 简书

1. Description

Largest Rectangle in Histogram

2. Solution

O(N^2)

class Solution {
public:
    int largestRectangleArea(vector<int>& heights) {
        int maxArea = 0;
        for(int i = 0; i < heights.size(); i++) {
            int left = i;
            int right = i;
            for(left = i; left >= 0; left--) {
                if(heights[left] < heights[i]) {
                    break;
                }
            }
            for(right = i; right < heights.size(); right++) {
                if(heights[right] < heights[i]) {
                    break;
                }
            }
            int area = (right - 1 - left - 1 + 1) * heights[i];
            if(area > maxArea) {
                maxArea = area;
            }
        }
        return maxArea;
    }
};

O(N)

class Solution {
public:
    int largestRectangleArea(vector<int>& heights) {
        int maxArea = 0;
        stack<int> border;
        heights.push_back(0);
        for(int i = 0; i < heights.size(); i++) {
            if(border.empty() || heights[i] > heights[border.top()]) {
                border.push(i);
            }
            else {
                int index = border.top();
                border.pop();
                int area = heights[index] * (border.empty()?i:i - border.top() - 1);
                if(area > maxArea) {
                    maxArea = area;
                }
                i--;
            }
        }
        return maxArea;
    }
};