首页 > 其他 > 详细

LeetCode开心刷题三十四天——84. Largest Rectangle in Histogram

时间:2019-08-13 18:56:41      阅读:86      评论:0      收藏:0      [点我收藏+]
84. Largest Rectangle in Histogram
Hard

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.

 

Example:

Input: [2,1,5,6,2,3]
Output: 10
 This problem is a bold attempt(大胆尝试) for me ,because I try multiply ways to solve this problem.I‘ve been heard multi-way can make people get clear

LeetCode开心刷题三十四天——84. Largest Rectangle in Histogram

原文:https://www.cnblogs.com/Marigolci/p/11347210.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!