|
1 | 1 | # 特殊数据结构:单调栈
|
2 | 2 |
|
| 3 | + |
| 4 | + |
| 5 | + |
| 6 | + |
| 7 | + |
| 8 | + |
3 | 9 | <p align='center'>
|
4 | 10 | <a href="https://github.com/labuladong/fucking-algorithm" target="view_window"><img alt="GitHub" src="https://img.shields.io/github/stars/labuladong/fucking-algorithm?label=Stars&style=flat-square&logo=GitHub"></a>
|
5 | 11 | <a href="https://appktavsiei5995.pc.xiaoe-tech.com/index" target="_blank"><img class="my_header_icon" src="https://img.shields.io/static/v1?label=精品课程&message=查看&color=pink&style=flat"></a>
|
|
9 | 15 |
|
10 | 16 | 
|
11 | 17 |
|
12 |
| -**通知:[数据结构精品课](https://aep.h5.xeknow.com/s/1XJHEO) 已更新到 V1.9,[第 11 期刷题打卡挑战(9/19 开始)](https://mp.weixin.qq.com/s/eUG2OOzY3k_ZTz-CFvtv5Q) 开始报名。另外,建议你在我的 [网站](https://labuladong.github.io/algo/) 学习文章,体验更好。** |
| 18 | +**通知:[数据结构精品课](https://aep.h5.xeknow.com/s/1XJHEO) 已更新到 V1.9,[第 11 期刷题打卡挑战(9/19 开始)](https://mp.weixin.qq.com/s/eUG2OOzY3k_ZTz-CFvtv5Q) 开始报名。** |
13 | 19 |
|
14 | 20 |
|
15 | 21 |
|
@@ -197,43 +203,6 @@ int[] nextGreaterElements(int[] nums) {
|
197 | 203 |
|
198 | 204 | 我会在 [单调栈的几种变体](https://appktavsiei5995.pc.xiaoe-tech.com/detail/i_628dc1ace4b09dda126cf793/1) 对比单调栈的几种其他形式,并在 [单调栈的运用](https://appktavsiei5995.pc.xiaoe-tech.com/detail/i_628dc2d7e4b0cedf38b67734/1) 中给出单调栈的经典例题。
|
199 | 205 |
|
200 |
| - |
201 |
| - |
202 |
| -<hr> |
203 |
| -<details> |
204 |
| -<summary><strong>引用本文的文章</strong></summary> |
205 |
| - |
206 |
| - - [一个方法团灭 LeetCode 打家劫舍问题](https://labuladong.github.io/article/fname.html?fname=抢房子) |
207 |
| - - [一道数组去重的算法题把我整不会了](https://labuladong.github.io/article/fname.html?fname=单调栈去重) |
208 |
| - - [单调栈代码模板的几种变体](https://appktavsiei5995.pc.xiaoe-tech.com/detail/i_628dc1ace4b09dda126cf793/1) |
209 |
| - - [单调队列的通用实现及经典习题](https://appktavsiei5995.pc.xiaoe-tech.com/detail/i_62a692efe4b01a48520b9b9b/1) |
210 |
| - - [单调队列结构解决滑动窗口问题](https://labuladong.github.io/article/fname.html?fname=单调队列) |
211 |
| - - [数据结构设计:最大栈](https://labuladong.github.io/article/fname.html?fname=最大栈) |
212 |
| - |
213 |
| -</details><hr> |
214 |
| - |
215 |
| - |
216 |
| - |
217 |
| - |
218 |
| -<hr> |
219 |
| -<details> |
220 |
| -<summary><strong>引用本文的题目</strong></summary> |
221 |
| - |
222 |
| -<strong>安装 [我的 Chrome 刷题插件](https://mp.weixin.qq.com/s/X-fE9sR4BLi6T9pn7xP4pg) 点开下列题目可直接查看解题思路:</strong> |
223 |
| - |
224 |
| -| LeetCode | 力扣 | |
225 |
| -| :----: | :----: | |
226 |
| -| [1019. Next Greater Node In Linked List](https://leetcode.com/problems/next-greater-node-in-linked-list/?show=1) | [1019. 链表中的下一个更大节点](https://leetcode.cn/problems/next-greater-node-in-linked-list/?show=1) | |
227 |
| -| [1944. Number of Visible People in a Queue](https://leetcode.com/problems/number-of-visible-people-in-a-queue/?show=1) | [1944. 队列中可以看到的人数](https://leetcode.cn/problems/number-of-visible-people-in-a-queue/?show=1) | |
228 |
| -| [402. Remove K Digits](https://leetcode.com/problems/remove-k-digits/?show=1) | [402. 移掉 K 位数字](https://leetcode.cn/problems/remove-k-digits/?show=1) | |
229 |
| -| [42. Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/?show=1) | [42. 接雨水](https://leetcode.cn/problems/trapping-rain-water/?show=1) | |
230 |
| -| [901. Online Stock Span](https://leetcode.com/problems/online-stock-span/?show=1) | [901. 股票价格跨度](https://leetcode.cn/problems/online-stock-span/?show=1) | |
231 |
| -| [918. Maximum Sum Circular Subarray](https://leetcode.com/problems/maximum-sum-circular-subarray/?show=1) | [918. 环形子数组的最大和](https://leetcode.cn/problems/maximum-sum-circular-subarray/?show=1) | |
232 |
| - |
233 |
| -</details> |
234 |
| - |
235 |
| - |
236 |
| - |
237 | 206 | **_____________**
|
238 | 207 |
|
239 | 208 | **《labuladong 的算法小抄》已经出版,关注公众号查看详情;后台回复关键词「进群」可加入算法群;回复「PDF」可获取精华文章 PDF**:
|
|
0 commit comments