单调栈
Haskei
这个作者很懒,什么都没留下…
展开
-
腾讯笔试: 逛街(单调栈)
题目链接:逛街#include<stdio.h>#include<iostream>#include<vector>#include<queue>#include<string.h>#include<math.h>#include<unordered_map>#include<algorithm>#include<deque>#include<set>#inclu原创 2020-09-12 06:17:36 · 375 阅读 · 0 评论 -
[Leetcode] 85. Maximal Rectangle 单调栈
85.Maximal Rectangle(题目链接)HardGiven a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area.Example:Input:[ ["1","0","1","0","0"], ["1","0","1","1","1"], ["1","1","1","1","1"], ["1",.原创 2020-08-25 07:30:37 · 166 阅读 · 0 评论 -
[Leetcode] 84. Largest Rectangle in Histogram 单调栈
84.Largest Rectangle in Histogram(题目链接)HardGivennnon-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 i...原创 2020-08-25 06:06:56 · 170 阅读 · 0 评论 -
[Leetcode] 42. Trapping Rain Water 单调栈
42.Trapping Rain Water(题目链接)HardGivennnon-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.The above elevation map is represented by array [0,1,0,2,1,0,1,3,2...原创 2020-08-25 06:54:38 · 225 阅读 · 0 评论