话题分类 > 单调栈
| # | 题目 | 标签 | 难度 |
|---|---|---|---|
| 2104 | 子数组范围和 | [栈] [数组] [单调栈] | Medium |
| 2030 | 含特定字母的最小子序列 | [栈] [贪心] [字符串] [单调栈] | Hard |
| 1996 | 游戏中弱角色的数量 | [栈] [贪心] [数组] [排序] [单调栈] | Medium |
| 1950 | 所有子数组最小值中的最大值 🔒 | [栈] [数组] [单调栈] | Medium |
| 1944 | 队列中可以看到的人数 | [栈] [数组] [单调栈] | Hard |
| 1856 | 子数组最小乘积的最大值 | [栈] [数组] [前缀和] [单调栈] | Medium |
| 1793 | 好子数组的最大分数 | [栈] [数组] [双指针] [二分查找] [单调栈] | Hard |
| 1776 | 车队 II | [栈] [数组] [数学] [单调栈] [堆（优先队列）] | Hard |
| 1762 | 能看到海景的建筑物 🔒 | [栈] [数组] [单调栈] | Medium |
| 1673 | 找出最具竞争力的子序列 | [栈] [贪心] [数组] [单调栈] | Medium |
| 1574 | 删除最短的子数组使剩余数组有序 | [栈] [数组] [双指针] [二分查找] [单调栈] | Medium |
| 1526 | 形成目标数组的子数组最少增加次数 | [栈] [贪心] [数组] [动态规划] [单调栈] | Hard |
| 1504 | 统计全 1 子矩形 | [栈] [数组] [动态规划] [矩阵] [单调栈] | Medium |
| 1475 | 商品折扣后的最终价格 | [栈] [数组] [单调栈] | Easy |
| 1130 | 叶值的最小代价生成树 | [栈] [贪心] [动态规划] [单调栈] | Medium |
| 1124 | 表现良好的最长时间段 | [栈] [数组] [哈希表] [前缀和] [单调栈] | Medium |
| 1081 | 不同字符的最小子序列 | [栈] [贪心] [字符串] [单调栈] | Medium |
| 1063 | 有效子数组的数目 🔒 | [栈] [数组] [单调栈] | Hard |
| 1019 | 链表中的下一个更大节点 | [栈] [数组] [链表] [单调栈] | Medium |
| 1008 | 前序遍历构造二叉搜索树 | [栈] [树] [二叉搜索树] [数组] [二叉树] [单调栈] | Medium |
| 975 | 奇偶跳 | [栈] [数组] [动态规划] [有序集合] [单调栈] | Hard |
| 962 | 最大宽度坡 | [栈] [数组] [单调栈] | Medium |
| 907 | 子数组的最小值之和 | [栈] [数组] [动态规划] [单调栈] | Medium |
| 901 | 股票价格跨度 | [栈] [设计] [数据流] [单调栈] | Medium |
| 853 | 车队 | [栈] [数组] [排序] [单调栈] | Medium |
| 769 | 最多能完成排序的块 | [栈] [贪心] [数组] [排序] [单调栈] | Medium |
| 768 | 最多能完成排序的块 II | [栈] [贪心] [数组] [排序] [单调栈] | Hard |
| 739 | 每日温度 | [栈] [数组] [单调栈] | Medium |
| 654 | 最大二叉树 | [栈] [树] [数组] [分治] [二叉树] [单调栈] | Medium |
| 581 | 最短无序连续子数组 | [栈] [贪心] [数组] [双指针] [排序] [单调栈] | Medium |
| 503 | 下一个更大元素 II | [栈] [数组] [单调栈] | Medium |
| 496 | 下一个更大元素 I | [栈] [数组] [哈希表] [单调栈] | Easy |
| 456 | 132 模式 | [栈] [数组] [二分查找] [有序集合] [单调栈] | Medium |
| 402 | 移掉 K 位数字 | [栈] [贪心] [字符串] [单调栈] | Medium |
| 321 | 拼接最大数 | [栈] [贪心] [单调栈] | Hard |
| 316 | 去除重复字母 | [栈] [贪心] [字符串] [单调栈] | Medium |
| 255 | 验证前序遍历序列二叉搜索树 🔒 | [栈] [树] [二叉搜索树] [递归] [二叉树] [单调栈] | Medium |
| 85 | 最大矩形 | [栈] [数组] [动态规划] [矩阵] [单调栈] | Hard |
| 84 | 柱状图中最大的矩形 | [栈] [数组] [单调栈] | Hard |
| 42 | 接雨水 | [栈] [数组] [双指针] [动态规划] [单调栈] | Hard |