题目描述:
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 heights = [2,1,5,6,2,3]
,
return 10
.
class Solution {
public:
int largestRectangleArea(vector<int>& heights) {
int result=0;
for(int i=0;i<heights.size();i++)
{
if((i<(heights.size()-1)&&heights[i+1]<heights[i])||(i==heights.size()-1))
{
int min_height=heights[i];
int min_area=heights[i];
for(int j=i;j>=0;j--)
{
min_height=min(min_height,heights[j]);
min_area=min_height*(i-j+1);
result=max(result,min_area);
}
}
}
return result;
}
};