zoukankan      html  css  js  c++  java
  • leetcode

    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(std::vector<int> &height) {
            height.push_back(0);
    		std::stack<int> s;
    		int i = 0;
    		int maxArea = 0;
    		while (i < height.size())
    		{
    			if(s.empty() || height[s.top()] <= height[i])
    			{
    				s.push(i++);
    			}
    			else
    			{
    				int t = s.top();
    				s.pop();
    				maxArea = std::max(maxArea,height[t]*(s.empty() ?

    i : i - s.top() - 1)); } } return maxArea; } };



  • 相关阅读:
    Codeforces 672D
    Codeforces 672C
    Codeforces 673D
    Codeforces 1181D
    Codeforces 1181C
    Codeforces 1011F
    Codeforces 1011E
    2020.1.3计导全面复习
    csp模拟题-201903
    CCF模拟题-201909
  • 原文地址:https://www.cnblogs.com/mfrbuaa/p/5162199.html
Copyright © 2011-2022 走看看