力扣84. 柱状图中最大的矩形

SEVENY_

已于 2022-07-05 21:10:26 修改

阅读量299

点赞数

分类专栏：单调栈工作机试文章标签： leetcode 算法华为 c 单调栈

于 2022-07-04 00:05:04 首次发布

本文链接：https://blog.csdn.net/SEVENY_/article/details/125591836

版权

工作机试同时被 2 个专栏收录

7 篇文章 0 订阅

订阅专栏

单调栈

4 篇文章 0 订阅

订阅专栏

84. 柱状图中最大的矩形

暴力循环（c超时）

int largestRectangleArea(int* heights, int heightsSize){
    int area = 0;
    for (int i = 0; i < heightsSize; i++) {
        int weight = 1;
        int height = heights[i];
        int j = i;
        while ((--j >= 0) && (heights[j] >= height)) {
            weight++;
        }
        j = i;
        while ((++j < heightsSize) && (heights[j] >= height)) {
            weight++;
        }
        if (area < (weight * height)) {
            area = weight * height;
        }
    }
    return area;
}

单调栈

int largestRectangleArea(int* heights, int heightsSize){
    int area = 0;
    int *htemp = NULL;
    int sstack[heightsSize + 2];
    int top = 0;
    htemp = (int *)malloc((heightsSize + 2) * sizeof(int));
    htemp[0] = htemp[heightsSize + 1] = 0;
    for (int i = 0; i < heightsSize; i++) {
        htemp[i + 1] = heights[i];
    }
    for (int i = 0; i < heightsSize + 2; i++) {
        while ((top > 0) && (htemp[sstack[top - 1]] > htemp[i])) {
            int height = htemp[sstack[top - 1]];
            top--;
            if (area < ((i - sstack[top - 1] - 1) * height)) {
                area = (i - sstack[top - 1] - 1) * height;
            } 
        }
        sstack[top] = i;
        top++;
    }
    return area;
}