友情支持

如果您觉得这个笔记对您有所帮助，看在D瓜哥码这么多字的辛苦上，请友情支持一下，D瓜哥感激不尽，😜

支付宝

微信

有些打赏的朋友希望可以加个好友，欢迎关注D 瓜哥的微信公众号，这样就可以通过公众号的回复直接给我发信息。

wx jikerizhi

公众号的微信号是: jikerizhi。因为众所周知的原因，有时图片加载不出来。 如果图片加载不出来可以直接通过搜索微信号来查找我的公众号。

Stack 栈

经典题目

  1. 20. Valid Parentheses

  2. 32. 最长有效括号

  3. 42. 接雨水

  4. 71. Simplify Path

  5. 84. 柱状图中最大的矩形

  6. 85. 最大矩形

  7. 94. 二叉树的中序遍历

  8. 114. 二叉树展开为链表

  9. 143. 重排链表

  10. 144. 二叉树的前序遍历

  11. 145. Binary Tree Postorder Traversal

  12. 150. 逆波兰表达式求值

  13. 155. 最小栈

  14. 173. 二叉搜索树迭代器

  15. 224. 基本计算器

  16. 225. 用队列实现栈

  17. 227. Basic Calculator II

  18. 232. Implement Queue using Stacks

  19. 234. 回文链表

  20. [0255-verify-preorder-sequence-in-binary-search-tree]

  21. [0272-closest-binary-search-tree-value-ii]

  22. 316. 去除重复字母

  23. [0321-create-maximum-number]

  24. [0331-verify-preorder-serialization-of-a-binary-tree]

  25. 341. Flatten Nested List Iterator

  26. [0364-nested-list-weight-sum-ii]

  27. [0385-mini-parser]

  28. [0388-longest-absolute-file-path]

  29. 394. 字符串解码

  30. 402. 移掉 K 位数字

  31. [0426-convert-binary-search-tree-to-sorted-doubly-linked-list]

  32. [0439-ternary-expression-parser]

  33. 445. 两数相加 II

  34. 456. 132 模式

  35. [0484-find-permutation]

  36. [0488-zuma-game]

  37. 496. Next Greater Element I

  38. 503. Next Greater Element II

  39. [0536-construct-binary-tree-from-string]

  40. 581. Shortest Unsorted Continuous Subarray

  41. [0589-n-ary-tree-preorder-traversal]

  42. [0590-n-ary-tree-postorder-traversal]

  43. [0591-tag-validator]

  44. [0636-exclusive-time-of-functions]

  45. 654. Maximum Binary Tree

  46. [0678-valid-parenthesis-string]

  47. [0682-baseball-game]

  48. [0716-max-stack]

  49. [0726-number-of-atoms]

  50. [0735-asteroid-collision]

  51. [0736-parse-lisp-expression]

  52. 739. 每日温度

  53. 768. Max Chunks To Make Sorted II

  54. [0769-max-chunks-to-make-sorted]

  55. [0770-basic-calculator-iv]

  56. [0772-basic-calculator-iii]

  57. [0844-backspace-string-compare]

  58. [0853-car-fleet]

  59. [0856-score-of-parentheses]

  60. [0880-decoded-string-at-index]

  61. [0895-maximum-frequency-stack]

  62. [0897-increasing-order-search-tree]

  63. [0901-online-stock-span]

  64. [0907-sum-of-subarray-minimums]

  65. [0921-minimum-add-to-make-parentheses-valid]

  66. [0936-stamping-the-sequence]

  67. 946. Validate Stack Sequences

  68. [0962-maximum-width-ramp]

  69. [0975-odd-even-jump]

  70. [1003-check-if-word-is-valid-after-substitutions]

  71. 1006. 笨阶乘

  72. [1008-construct-binary-search-tree-from-preorder-traversal]

  73. [1019-next-greater-node-in-linked-list]

  74. [1021-remove-outermost-parentheses]

  75. 1047. 删除字符串中的所有相邻重复项

  76. [1063-number-of-valid-subarrays]

  77. 1081. 不同字符的最小子序列

  78. [1096-brace-expansion-ii]

  79. [1106-parsing-a-boolean-expression]

  80. [1111-maximum-nesting-depth-of-two-valid-parentheses-strings]

  81. [1124-longest-well-performing-interval]

  82. [1130-minimum-cost-tree-from-leaf-values]

  83. [1172-dinner-plate-stacks]

  84. [1190-reverse-substrings-between-each-pair-of-parentheses]

  85. 1209. 删除字符串中的所有相邻重复项 II

  86. [1214-two-sum-bsts]

  87. [1249-minimum-remove-to-make-valid-parentheses]

  88. [1265-print-immutable-linked-list-in-reverse]

  89. [1381-design-a-stack-with-increment-operation]

  90. [1441-build-an-array-with-stack-operations]

  91. [1472-design-browser-history]

  92. [1475-final-prices-with-a-special-discount-in-a-shop]

  93. [1504-count-submatrices-with-all-ones]

  94. [1526-minimum-number-of-increments-on-subarrays-to-form-a-target-array]

  95. [1541-minimum-insertions-to-balance-a-parentheses-string]

  96. [1544-make-the-string-great]

  97. [1574-shortest-subarray-to-be-removed-to-make-array-sorted]

  98. [1586-binary-search-tree-iterator-ii]

  99. [1597-build-binary-expression-tree-from-infix-expression]

  100. [1598-crawler-log-folder]

  101. [1614-maximum-nesting-depth-of-the-parentheses]

  102. [1628-design-an-expression-tree-with-evaluate-function]

  103. [1653-minimum-deletions-to-make-string-balanced]

  104. [1673-find-the-most-competitive-subsequence]

  105. 1700. 无法吃午餐的学生数量

  106. [1717-maximum-score-from-removing-substrings]

  107. [1756-design-most-recently-used-queue]

  108. [1762-buildings-with-an-ocean-view]

  109. [1776-car-fleet-ii]

  110. [1793-maximum-score-of-a-good-subarray]

  111. [1856-maximum-subarray-min-product]

  112. [1896-minimum-cost-to-change-the-final-value-of-expression]

  113. [1910-remove-all-occurrences-of-a-substring]

  114. [1944-number-of-visible-people-in-a-queue]

  115. [1950-maximum-of-minimum-values-in-all-subarrays]

  116. [1963-minimum-number-of-swaps-to-make-the-string-balanced]

  117. [1996-the-number-of-weak-characters-in-the-game]

  118. [2000-reverse-prefix-of-word]

  119. [2019-the-score-of-students-solving-math-expression]

  120. [2030-smallest-k-length-subsequence-with-occurrences-of-a-letter]

  121. [2104-sum-of-subarray-ranges]

  122. [2116-check-if-a-parentheses-string-can-be-valid]

  123. [2130-maximum-twin-sum-of-a-linked-list]

  124. [2197-replace-non-coprime-numbers-in-array]

  125. [2211-count-collisions-on-a-road]

  126. [2216-minimum-deletions-to-make-array-beautiful]

  127. [2254-design-video-sharing-platform]

  128. [2281-sum-of-total-strength-of-wizards]

  129. [2282-number-of-people-that-can-be-seen-in-a-grid]

  130. [2289-steps-to-make-array-non-decreasing]

  131. [2296-design-a-text-editor]

  132. [2297-jump-game-viii]

  133. [2334-subarray-with-elements-greater-than-varying-threshold]

  134. [2345-finding-the-number-of-visible-mountains]

  135. [2355-maximum-number-of-books-you-can-take]

  136. [2375-construct-smallest-number-from-di-string]

  137. [2390-removing-stars-from-a-string]

  138. [2434-using-a-robot-to-print-the-lexicographically-smallest-string]

  139. [2454-next-greater-element-iv]

  140. [2487-remove-nodes-from-linked-list]

  141. [2524-maximum-frequency-score-of-a-subarray]

  142. [2589-minimum-time-to-complete-all-tasks]

  143. [2617-minimum-number-of-visited-cells-in-a-grid]

  144. [2645-minimum-additions-to-make-valid-string]

  145. [2696-minimum-string-length-after-removing-substrings]

  146. [2736-maximum-sum-queries]

  147. [2751-robot-collisions]

  148. [2764-is-array-a-preorder-of-some-binary-tree]

  149. [2813-maximum-elegance-of-a-k-length-subsequence]

  150. [2816-double-a-number-represented-as-a-linked-list]

  151. [2818-apply-operations-to-maximize-score]

  152. [2832-maximal-range-that-each-element-is-maximum-in-it]

  153. [2863-maximum-length-of-semi-decreasing-subarrays]

  154. [2865-beautiful-towers-i]

  155. [2866-beautiful-towers-ii]

  156. [2940-find-building-where-alice-and-bob-can-meet]

  157. [2945-find-maximum-non-decreasing-array-length]

  158. [3113-find-the-number-of-subarrays-where-boundary-elements-are-maximum]

  159. [3170-lexicographically-minimum-string-after-removing-stars]

  160. [3174-clear-digits]

  161. [3205-maximum-array-hopping-score-i]

  162. [3221-maximum-array-hopping-score-ii]

  163. [3229-minimum-operations-to-make-array-equal-to-target]

  164. [3359-find-sorted-submatrices-with-maximum-element-at-most-k]

  165. [3412-find-mirror-score-of-a-string]

  166. [3420-count-non-decreasing-subarrays-after-k-operations]

  167. [3430-maximum-and-minimum-sums-of-at-most-size-k-subarrays]

← Previous: List 链表 | ↑ Up: LeetCode 解题笔记 | Next: Queue 队列 →