Day60_单调栈
5. 柱状图中最大的矩形
84. 柱状图中最大的矩形
思路:
和上一题接雨水非常像,不过这里找的得是左右第一个低于当前高度的位置,计算面积时,只计算左右不低于自己的(即计算面积的高度就是当前列的高度),更低的会主动来和自己计算面积。
方法一:双指针
超时
时间复杂度:
O
(
n
2
)
O(n^2)
O(n2)
class Solution {
public:
int largestRectangleArea(vector<int>& heights) {
int size = heights.size();
int area = 0;
int right_h, left_h;
for (int i = 0; i < size; i++) {
for (left_h = i; left_h >= 0; left_h--) {
if (heights[i] > heights[left_h]) {
break;
}
}
for (right_h = i; right_h < size ; right_h++) {
if (heights[i] > heights[right_h]) {
break;
}
}
area = max(area, heights[i] * (right_h - left_h - 1));
}
return area;
}
};
方法二:动态规划
时间复杂度:最坏情况
O
(
n
2
)
O(n^2)
O(n2) 平均情况
O
(
n
)
O(n)
O(n)
class Solution {
public:
int largestRectangleArea(vector<int>& heights) {
int size = heights.size();
int area = 0;
vector<int> left_index(size, 0);
vector<int> right_index(size, 0);
left_index[0] = -1;
for (int i = 1; i < size; i++) {
int t = i - 1;
while (t >= 0 && heights[t] >= heights[i]) t = left_index[t];
left_index[i] = t;
}
right_index[size - 1] = size; // 为了计算面积,初始化要正确
for (int i = size - 1; i >= 0; i--) {
int t = i + 1;
while (t < size && heights[t] >= heights[i]) t = right_index[t];
right_index[i] = t;
}
for (int i = 0; i < size; i++) {
area = max(area, (right_index[i] - left_index[i] - 1) * heights[i]);
}
return area;
}
};
方法三:单调栈
这里是单调不增栈
时间复杂度: O ( n ) O(n) O(n)
class Solution {
public:
int largestRectangleArea(vector<int>& heights) {
heights.insert(heights.begin(), 0);
heights.push_back(0);
int size = heights.size();
int area = 0;
stack<int> stk;
stk.push(0);
for (int i = 1; i < size; i++) {
while (!stk.empty() && heights[i] < heights[stk.top()]) {
int h = heights[stk.top()];
stk.pop();
int w = i - stk.top() - 1;
area = max(area, h * w);
}
stk.push(i);
}
return area;
}
};