Leetcode_84 Largest Rectangle in Histogram
来源:互联网 发布:ffreebsd 安装软件 编辑:程序博客网 时间:2024/06/01 09:04
今天看了看Leetcode_84题,难度是hard,趁着空闲,简单地写一写吧。
原题链接:https://leetcode.com/problems/largest-rectangle-in-histogram/?tab=Description
原题题目:
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
.
这道题开始我没有想出比较好的解法,因此参考了网上的解法,网上利用堆栈的方式解决了这道题,仔细想想本解法还是很有道理的。利用堆栈来实现类似的升序排列,时间复杂度为o(n^2)。
程序如下图所示:
最终的运行时间截图:
阅读全文
0 0
- Leetcode_84 Largest Rectangle in Histogram
- Largest Rectangle in Histogram
- Largest Rectangle in Histogram
- Largest Rectangle in Histogram
- Largest Rectangle in Histogram
- Largest Rectangle in Histogram
- Largest Rectangle in Histogram
- Largest Rectangle in Histogram
- Largest Rectangle in Histogram
- Largest Rectangle in Histogram
- Largest Rectangle in Histogram
- Largest Rectangle in Histogram
- Largest Rectangle in Histogram
- Largest Rectangle in Histogram
- Largest Rectangle in Histogram
- Largest Rectangle in Histogram
- Largest Rectangle in Histogram
- Largest Rectangle in Histogram
- Mac上mp3格式转caf格式
- 笔记
- 搜索三步的黑白棋
- Calendar中add()和roll()函数的用法
- 第十周 项目一 层次遍历算法的验证
- Leetcode_84 Largest Rectangle in Histogram
- 第十三周项目一
- 第13周 【项目一】 验证折半查找算法
- 数据库闪回
- (一)java基础篇笔记库(12)
- js调用百度地图api
- 相机标定
- Spring整合JMS(消息中间件)
- 目标检测--Light-Head R-CNN: In Defense of Two-Stage Object Detector