Largest Rectangle in Histogram
2014-04-30 22:17
351 查看
class Solution { public: int largestRectangleArea(vector<int> &height) { if(height.empty()) return 0; int maxArea=0; stack<int> stk;//栈中保存非降的高度的下标 height.push_back(0);//用来处理掉栈中的数据 for(size_t i=0;i!=height.size();) { if(stk.empty() || height[i] >= height[stk.top()]) { stk.push(i); i++; } else { int h=height[stk.top()];//高度 stk.pop(); int w=stk.empty()?i:(i-stk.top()-1);//宽度 maxArea=(h*w)>maxArea?(h*w):maxArea; } } return maxArea; } };
相关文章推荐
- 84. Largest Rectangle in Histogram
- Largest Rectangle in Histogram
- LeetCode:Largest Rectangle in Histogram(update)
- 暑期dp46道(8)--HDOJ 1506 Largest Rectangle in a Histogram
- 84. Largest Rectangle in Histogram
- POJ 2559 Largest Rectangle in a Histogram (单调栈或者dp)
- Hdu 1506 Largest Rectangle in a Histogram (DP求最大长方形面积)
- HDU1506 Largest Rectangle in a Histogram (动规)
- POJ 2559 Largest Rectangle in a Histogram -- 动态规划
- LeetCode——Largest Rectangle in Histogram
- HDU - 1506 - Largest Rectangle in a Histogram
- POJ2559 Largest Rectangle in a Histogram(单调栈)
- HDU 1506 Largest Rectangle in a Histogram(dp)
- HDU 1506 Largest Rectangle in a Histogram
- POJ2559-Largest Rectangle in a Histogram
- HDU 1506 Largest Rectangle in a Histogram 单调栈
- Leetcode - Largest Rectangle in Histogram
- hdu 1506(nyoj 258)Largest Rectangle in a Histogram(最大长方形(二))(单调栈)
- POJ 2559 Largest Rectangle in a Histogram + POJ 2082Terrible Sets(DP/单调栈)
- LeetCode算法题目:Largest Rectangle in Histogram