LeetCode Largest Rectangle in Histogram

Largest Rectangle in Histogram

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 height = [2,1,5,6,2,3],
return 10.

这是一类题，要好好体会。

class Solution {
public:
    int largestRectangleArea(vector<int> &height) {
    	if(0 == height.size())
			return 0;
		vector<int> leftLimit(height.size());
		stack<int> limits;
		for(int i = 0; i < height.size(); ++i)
		{
			while(!limits.empty())
			{
				if(height[limits.top()] >= height[i])
					limits.pop();
				else
					break;
			}
			if(limits.empty())
				leftLimit[i] = -1;
			else
				leftLimit[i] = limits.top();
			limits.push(i);
		}

		while(!limits.empty()) limits.pop();

		vector<int> rightLimit(height.size());
		for(int i = height.size() - 1; i >= 0; --i)
		{
			while(!limits.empty())
			{
				if(height[limits.top()] >= height[i])
					limits.pop();
				else
					break;
			}
			if(limits.empty())
				rightLimit[i] = height.size();
			else
				rightLimit[i] = limits.top();
			limits.push(i);
		}

		int ret = 0;
		int temp = 0;
		for(int i = 0; i < height.size(); ++i)
		{
			temp = (rightLimit[i] - leftLimit[i] - 1)*height[i];
			if(temp > ret)
				ret = temp;
		}

		return ret;
    }
};