# 力扣加加 - 努力做西湖区最好的算法题解

## 力扣加加 - 努力做西湖区最好的算法题解

- [introduction](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/introduction.md)
- [第一章 - 算法专题](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/thinkings.md)
- [数据结构](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/thinkings/basic-data-structure.md)
- [链表专题](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/thinkings/linked-list.md)
- [树专题](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/thinkings/tree.md)
- [堆专题（上）](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/thinkings/heap.md)
- [堆专题（下）](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/thinkings/heap-2.md)
- [二分专题（上）](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/thinkings/binary-search-1.md)
- [二分专题（下）](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/thinkings/binary-search-2.md)
- [动态规划(重置版)](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/thinkings/dynamic-programming.md)
- [大话搜索](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/thinkings/search.md)
- [二叉树的遍历](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/thinkings/binary-tree-traversal.md)
- [哈夫曼编码和游程编码](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/thinkings/run-length-encode-and-huffman-encode.md)
- [布隆过滤器](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/thinkings/bloom-filter.md)
- [前缀树](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/thinkings/trie.md)
- [回溯](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/thinkings/backtrack.md)
- [滑动窗口（思路 + 模板）](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/thinkings/slide-window.md)
- [位运算](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/thinkings/bit.md)
- [小岛问题](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/thinkings/island.md)
- [最大公约数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/thinkings/gcd.md)
- [并查集](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/thinkings/union-find.md)
- [平衡二叉树专题](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/thinkings/balanced-tree.md)
- [蓄水池抽样](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/thinkings/reservoid-sampling.md)
- [单调栈](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/thinkings/monotone-stack.md)
- [第二章 - 91 天学算法](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/91.md)
- [第一期讲义-二分法](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/91/binary-search.md)
- [第一期讲义-双指针](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/91/two-pointers.md)
- [第三章 - 精选题解](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/selected.md)
- [字典序列删除](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/selected/a-deleted.md)
- [西法的刷题秘籍】一次搞定前缀和](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/selected/atmostk.md)
- [字节跳动的算法面试题是什么难度？](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/selected/byte-dance-algo-ex.md)
- [字节跳动的算法面试题是什么难度？（第二弹）](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/selected/byte-dance-algo-ex-2017.md)
- [《我是你的妈妈呀》 \* 第一期](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/selected/mother-01.md)
- [一文带你看懂二叉树的序列化](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/selected/serialize.md)
- [穿上衣服我就不认识你了？来聊聊最长上升子序列](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/selected/lis.md)
- [你的衣服我扒了 \* 《最长公共子序列》](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/selected/lcs.md)
- [一文看懂《最大子序列和问题》](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/selected/lss.md)
- [第四章 - 高频考题（简单）](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy.md)
- [面试题 17.12. BiNode](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/binode-lcci.md)
- [0001. 两数之和](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/1.two-sum.md)
- [0020. 有效的括号](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/20.valid-parentheses.md)
- [0021. 合并两个有序链表](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/21.merge-two-sorted-lists.md)
- [0026. 删除排序数组中的重复项](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/26.remove-duplicates-from-sorted-array.md)
- [0053. 最大子序和](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/53.maximum-sum-subarray-cn.md)
- [0160. 相交链表](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/160.intersection-of-two-linked-lists.md)
- [0066. 加一](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/66.plus-one.md)
- [0088. 合并两个有序数组](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/88.merge-sorted-array.md)
- [0101. 对称二叉树](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/101.symmetric-tree.md)
- [0104. 二叉树的最大深度](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/104.maximum-depth-of-binary-tree.md)
- [0108. 将有序数组转换为二叉搜索树](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/108.convert-sorted-array-to-binary-search-tree.md)
- [0121. 买卖股票的最佳时机](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/121.best-time-to-buy-and-sell-stock.md)
- [0122. 买卖股票的最佳时机 II](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/122.best-time-to-buy-and-sell-stock-ii.md)
- [0125. 验证回文串](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/125.valid-palindrome.md)
- [0136. 只出现一次的数字](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/136.single-number.md)
- [0155. 最小栈](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/155.min-stack.md)
- [0167. 两数之和 II 输入有序数组](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/167.two-sum-ii-input-array-is-sorted.md)
- [0169. 多数元素](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/169.majority-element.md)
- [0172. 阶乘后的零](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/172.factorial-trailing-zeroes.md)
- [0190. 颠倒二进制位](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/190.reverse-bits.md)
- [0191. 位 1 的个数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/191.number-of-1-bits.md)
- [0198. 打家劫舍](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/198.house-robber.md)
- [0203. 移除链表元素](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/203.remove-linked-list-elements.md)
- [0206. 反转链表](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/206.reverse-linked-list.md)
- [0219. 存在重复元素 II](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/219.contains-duplicate-ii.md)
- [0226. 翻转二叉树](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/226.invert-binary-tree.md)
- [0232. 用栈实现队列](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/232.implement-queue-using-stacks.md)
- [0263. 丑数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/263.ugly-number.md)
- [0283. 移动零](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/283.move-zeroes.md)
- [0342. 4 的幂](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/342.power-of-four.md)
- [0349. 两个数组的交集](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/349.intersection-of-two-arrays.md)
- [0371. 两整数之和](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/371.sum-of-two-integers.md)
- [401. 二进制手表](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/401.binary-watch.md)
- [0437. 路径总和 III](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/437.path-sum-iii.md)
- [0455. 分发饼干](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/455.assigncookies.md)
- [0504. 七进制数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/504.base-7.md)
- [0575. 分糖果](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/575.distribute-candies.md)
- [0665. 非递减数列](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/665.non-decreasing-array.md)
- [0661. 图片平滑器](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/661.image-smoother.md)
- [821. 字符的最短距离](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/821.shortest-distance-to-a-character.md)
- [0874. 模拟行走机器人](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/874.walking-robot-simulation.md)
- [1128. 等价多米诺骨牌对的数量](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/1128.number-of-equivalent-domino-pairs.md)
- [1260. 二维网格迁移](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/1260.shift-2d-grid.md)
- [1332. 删除回文子序列](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/1332.remove-palindromic-subsequences.md)
- [2591. 将钱分给最多的儿童](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/easy/2591.distribute-money-to-maximum-children.md)
- [第五章 - 高频考题（中等）](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium.md)
- [面试题 17.09. 第 k 个数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/get-kth-magic-number-lcci.md)
- [面试题 17.23. 最大黑方阵](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/max-black-square-lcci.md)
- [面试题 16.16. 部分排序](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/sub-sort-lcci.md)
- [Increasing Digits](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/increasing-digits.md)
- [Longest Contiguously Strictly Increasing Sublist After Deletion](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/longest-contiguously-strictly-increasing-sublist-after-deletion.md)
- [Consecutive Wins](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/consecutive-wins.md)
- [Number of Substrings with Single Character Difference](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/number-of-substrings-with-single-character-difference.md)
- [Bus Fare](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/bus-fare.md)
- [Minimum Dropping Path Sum](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/minimum-dropping-path-sum.md)
- [Every Sublist Min Sum](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/every-sublist-min-sum.md)
- [Maximize the Number of Equivalent Pairs After Swaps](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/maximize-the-number-of-equivalent-pairs-after-swaps.md)
- [0002. 两数相加](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/2.add-two-numbers.md)
- [0003. 无重复字符的最长子串](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/3.longest-substring-without-repeating-characters.md)
- [0005. 最长回文子串](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/5.longest-palindromic-substring.md)
- [0011. 盛最多水的容器](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/11.container-with-most-water.md)
- [0015. 三数之和](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/15.3sum.md)
- [0017. 电话号码的字母组合](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/17.letter-combinations-of-a-phone-number.md)
- [0019. 删除链表的倒数第 N 个节点](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/19.removenthnodefromendoflist.md)
- [0022. 括号生成](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/22.generate-parentheses.md)
- [0024. 两两交换链表中的节点](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/24.swapnodesinpairs.md)
- [0029. 两数相除](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/29.divide-two-integers.md)
- [0031. 下一个排列](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/31.next-permutation.md)
- [0033. 搜索旋转排序数组](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/33.search-in-rotated-sorted-array.md)
- [0039. 组合总和](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/39.combination-sum.md)
- [0040. 组合总和 II](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/40.combination-sum-ii.md)
- [0046. 全排列](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/46.permutations.md)
- [0047. 全排列 II](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/47.permutations-ii.md)
- [0048. 旋转图像](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/48.rotate-image.md)
- [0049. 字母异位词分组](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/49.group-anagrams.md)
- [0050. Pow(x, n)](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/50.pow-x-n.md)
- [0055. 跳跃游戏](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/55.jump-game.md)
- [0056. 合并区间](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/56.merge-intervals.md)
- [0060. 第 k 个排列](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/60.permutation-sequence.md)
- [0061. 旋转链表](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/61.rotate-list.md)
- [0062. 不同路径](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/62.unique-paths.md)
- [0073. 矩阵置零](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/73.set-matrix-zeroes.md)
- [0075. 颜色分类](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/75.sort-colors.md)
- [0078. 子集](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/78.subsets.md)
- [0079. 单词搜索](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/79.word-search.md)
- [0080. 删除排序数组中的重复项 II](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/80.remove-duplicates-from-sorted-array-ii.md)
- [0086. 分隔链表](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/86.partition-list.md)
- [0090. 子集 II](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/90.subsets-ii.md)
- [0091. 解码方法](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/91.decode-ways.md)
- [0092. 反转链表 II](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/92.reverse-linked-list-ii.md)
- [0094. 二叉树的中序遍历](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/94.binary-tree-inorder-traversal.md)
- [0095. 不同的二叉搜索树 II](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/95.unique-binary-search-trees-ii.md)
- [0096. 不同的二叉搜索树](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/96.unique-binary-search-trees.md)
- [0098. 验证二叉搜索树](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/98.validate-binary-search-tree.md)
- [0102. 二叉树的层序遍历](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/102.binary-tree-level-order-traversal.md)
- [0103. 二叉树的锯齿形层次遍历](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/103.binary-tree-zigzag-level-order-traversal.md)
- [0113. 路径总和 II](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/113.path-sum-ii.md)
- [0129. 求根到叶子节点数字之和](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/129.sum-root-to-leaf-numbers.md)
- [0130. 被围绕的区域](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/130.surrounded-regions.md)
- [0131. 分割回文串](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/131.palindrome-partitioning.md)
- [0139. 单词拆分](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/139.word-break.md)
- [0144. 二叉树的前序遍历](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/144.binary-tree-preorder-traversal.md)
- [0147. 对链表进行插入排序](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/147.insertion-sort-list.md)
- [0150. 逆波兰表达式求值](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/150.evaluate-reverse-polish-notation.md)
- [0152. 乘积最大子数组](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/152.maximum-product-subarray.md)
- [0153. 寻找旋转排序数组中的最小值](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/153.find-minimum-in-rotated-sorted-array.md)
- [0199. 二叉树的右视图](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/199.binary-tree-right-side-view.md)
- [0200. 岛屿数量](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/200.number-of-islands.md)
- [0201. 数字范围按位与](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/201.bitwise-and-of-numbers-range.md)
- [0208. 实现 Trie (前缀树)](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/208.implement-trie-prefix-tree.md)
- [0209. 长度最小的子数组](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/209.minimum-size-subarray-sum.md)
- [0211. 添加与搜索单词 - 数据结构设计](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/211.add-and-search-word-data-structure-design.md)
- [0215. 数组中的第 K 个最大元素](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/215.kth-largest-element-in-an-array.md)
- [0220. 存在重复元素 III](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/220.contains-duplicate-iii.md)
- [0221. 最大正方形](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/221.maximal-square.md)
- [0227. 基本计算器 II](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/227.basic-calculator-ii.md)
- [0229. 求众数 II](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/229.majority-element-ii.md)
- [0230. 二叉搜索树中第 K 小的元素](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/230.kth-smallest-element-in-a-bst.md)
- [0236. 二叉树的最近公共祖先](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/236.lowest-common-ancestor-of-a-binary-tree.md)
- [0238. 除自身以外数组的乘积](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/238.product-of-array-except-self.md)
- [0240. 搜索二维矩阵 II](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/240.search-a-2-d-matrix-ii.md)
- [0279. 完全平方数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/279.perfect-squares.md)
- [0309. 最佳买卖股票时机含冷冻期](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/309.best-time-to-buy-and-sell-stock-with-cooldown.md)
- [0322. 零钱兑换](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/322.coin-change.md)
- [0324. 摆动排序 II](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/324.wiggle-sort-ii.md)
- [0328. 奇偶链表](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/328.odd-even-linked-list.md)
- [0331. 验证二叉树的前序序列化](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/331.verify-preorder-serialization-of-a-binary-tree.md)
- [0334. 递增的三元子序列](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/334.increasing-triplet-subsequence.md)
- [0337. 打家劫舍 III](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/337.house-robber-iii.md)
- [0343. 整数拆分](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/343.integer-break.md)
- [0365. 水壶问题](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/365.water-and-jug-problem.md)
- [0378. 有序矩阵中第 K 小的元素](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/378.kth-smallest-element-in-a-sorted-matrix.md)
- [0380. 常数时间插入、删除和获取随机元素](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/380.insert-delete-getrandom-o1.md)
- [0394. 字符串解码](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/394.decode-string.md)
- [0416. 分割等和子集](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/416.partition-equal-subset-sum.md)
- [0424. 替换后的最长重复字符](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/424.longest-repeating-character-replacement.md)
- [0438. 找到字符串中所有字母异位词](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/438.find-all-anagrams-in-a-string.md)
- [0445. 两数相加 II](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/445.add-two-numbers-ii.md)
- [0454. 四数相加 II](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/454.4-sum-ii.md)
- [0456. 132 模式](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/456.132-pattern.md)
- [0457.457. 环形数组是否存在循环](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/457.circular-array-loop.md)
- [0464. 我能赢么](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/464.can-i-win.md)
- [0470. 用 Rand7() 实现 Rand10](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/470.implement-rand10-using-rand7.md)
- [0473. 火柴拼正方形](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/473.matchsticks-to-square.md)
- [0494. 目标和](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/494.target-sum.md)
- [0516. 最长回文子序列](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/516.longest-palindromic-subsequence.md)
- [0513. 找树左下角的值](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/513.find-bottom-left-tree-value.md)
- [0518. 零钱兑换 II](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/518.coin-change-2.md)
- [0525. 连续数组](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/525.contiguous-array.md)
- [0547. 朋友圈](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/0547.-peng-you-quan.md)
- [0560. 和为 K 的子数组](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/560.subarray-sum-equals-k.md)
- [0609. 在系统中查找重复文件](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/609.find-duplicate-file-in-system.md)
- [0611. 有效三角形的个数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/611.valid-triangle-number.md)
- [0673. 最长递增子序列的个数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/673.number-of-longest-increasing-subsequence.md)
- [0686. 重复叠加字符串匹配](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/686.repeated-string-match.md)
- [0710. 黑名单中的随机数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/710.random-pick-with-blacklist.md)
- [0714. 买卖股票的最佳时机含手续费](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/714.best-time-to-buy-and-sell-stock-with-transaction-fee.md)
- [0718. 最长重复子数组](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/718.maximum-length-of-repeated-subarray.md)
- [0735. 行星碰撞](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/735.asteroid-collision.md)
- [0754. 到达终点数字](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/754.reach-a-number.md)
- [0785. 判断二分图](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/785.is-graph-bipartite.md)
- [0790. 多米诺和托米诺平铺](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/790.domino-and-tromino-tiling.md)
- [0799. 香槟塔](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/799.champagne-tower.md)
- [0801. 使序列递增的最小交换次数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/801.minimum-swaps-to-make-sequences-increasing.md)
- [0816. 模糊坐标](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/816.ambiguous-coordinates.md)
- [0820. 单词的压缩编码](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/820.short-encoding-of-words.md)
- [0838. 推多米诺](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/838.push-dominoes.md)
- [0873. 最长的斐波那契子序列的长度](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/873.length-of-longest-fibonacci-subsequence.md)
- [0875. 爱吃香蕉的珂珂](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/875.koko-eating-bananas.md)
- [0877. 石子游戏](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/877.stone-game.md)
- [0886. 可能的二分法](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/886.possible-bipartition.md)
- [0898. 子数组按位或操作](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/898.bitwise-ors-of-subarrays.md)
- [0900. RLE 迭代器](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/900.rle-iterator.md)
- [0911. 在线选举](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/911.online-election.md)
- [0912. 排序数组](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/912.sort-an-array.md)
- [0932. 漂亮数组](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/932.beautiful-array.md)
- [0935. 骑士拨号器](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/935.knight-dialer.md)
- [0947. 移除最多的同行或同列石头](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/947.most-stones-removed-with-same-row-or-column.md)
- [0959. 由斜杠划分区域](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/959.regions-cut-by-slashes.md)
- [0978. 最长湍流子数组](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/978.longest-turbulent-subarray.md)
- [0987. 二叉树的垂序遍历](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/987.vertical-order-traversal-of-a-binary-tree.md)
- [1004. 最大连续 1 的个数 III](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1004.max-consecutive-ones-iii.md)
- [1011. 在 D 天内送达包裹的能力](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1011.capacity-to-ship-packages-within-d-days.md)
- [1014. 最佳观光组合](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1014.best-sightseeing-pair.md)
- [1015. 可被 K 整除的最小整数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1015.smallest-integer-divisible-by-k.md)
- [1019. 链表中的下一个更大节点](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1019.next-greater-node-in-linked-list.md)
- [1020. 飞地的数量](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1020.number-of-enclaves.md)
- [1023. 驼峰式匹配](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1023.camelcase-matching.md)
- [1031. 两个非重叠子数组的最大和](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1031.maximum-sum-of-two-non-overlapping-subarrays.md)
- [1043. 分隔数组以得到最大和](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1043.partition-array-for-maximum-sum.md)
- [1053. 交换一次的先前排列)](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1053.previous-permutation-with-one-swap.md)
- [1104. 二叉树寻路](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1104.path-in-zigzag-labelled-binary-tree.md)
- [1129. 颜色交替的最短路径](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1129.shortest-path-with-alternating-colors.md)
- [1131.绝对值表达式的最大值](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1131.maximum-of-absolute-value-expression.md)
- [1138. 字母板上的路径](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1138.alphabet-board-path.md)
- [1186. 删除一次得到子数组最大和](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1186.maximum-subarray-sum-with-one-deletion.md)
- [1218. 最长定差子序列](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1218.longest-arithmetic-subsequence-of-given-difference.md)
- [1227. 飞机座位分配概率](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1227.airplane-seat-assignment-probability.md)
- [1261. 在受污染的二叉树中查找元素](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1261.find-elements-in-a-contaminated-binary-tree.md)
- [1262. 可被三整除的最大和](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1262.greatest-sum-divisible-by-three.md)
- [1297. 子串的最大出现次数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1297.maximum-number-of-occurrences-of-a-substring.md)
- [1310. 子数组异或查询](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1310.xor-queries-of-a-subarray.md)
- [1334. 阈值距离内邻居最少的城市](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1334.find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance.md)
- [1371.每个元音包含偶数次的最长子字符串](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1371.find-the-longest-substring-containing-vowels-in-even-counts.md)
- [1381. 设计一个支持增量操作的栈](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1381.design-a-stack-with-increment-operation.md)
- [1438. 绝对差不超过限制的最长连续子数组](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1438.longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.md)
- [1558. 得到目标数组的最少函数调用次数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1558.minimum-numbers-of-function-calls-to-make-target-array.md)
- [1574. 删除最短的子数组使剩余数组有序](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1574.shortest-subarray-to-be-removed-to-make-array-sorted.md)
- [1631. 最小体力消耗路径](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1631.path-with-minimum-effort.md)
- [1638. 统计只差一个字符的子串数目](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1638.count-substrings-that-differ-by-one-character.md)
- [1658. 将 x 减到 0 的最小操作数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1658.minimum-operations-to-reduce-x-to-zero.md)
- [1697. 检查边长度限制的路径是否存在](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1697.checking-existence-of-edge-length-limited-paths.md)
- [1737. 满足三条件之一需改变的最少字符数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1737.change-minimum-characters-to-satisfy-one-of-three-conditions.md)
- [1770. 执行乘法运算的最大分数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1770.maximum-score-from-performing-multiplication-operations.md)
- [1793. 好子数组的最大分数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1793.maximum-score-of-a-good-subarray.md)
- [1834. 单线程 CPU](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1834.single-threaded-cpu.md)
- [1899. 合并若干三元组以形成目标三元组](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1899.merge-triplets-to-form-target-triplet.md)
- [1904. 你完成的完整对局数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1904.the-number-of-full-rounds-you-have-played.md)
- [1906. 查询差绝对值的最小值](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/1906.minimum-absolute-difference-queries.md)
- [2007. 从双倍数组中还原原数组](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/2007.find-original-array-from-doubled-array.md)
- [2008. 出租车的最大盈利](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/2008.maximum-earnings-from-taxi.md)
- [2100. 适合打劫银行的日子](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/5935.find-good-days-to-rob-the-bank.md)
- [2101. 引爆最多的炸弹](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/5936.detonate-the-maximum-bombs.md)
- [2121. 相同元素的间隔之和](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/5965.intervals-between-identical-elements.md)
- [2207. 字符串中最多数目的子字符串](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/6201.maximize-number-of-subsequences-in-a-string.md)
- [2592. 最大化数组的伟大值](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/2592.maximize-greatness-of-an-array.md)
- [2593. 标记所有元素后数组的分数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/2593.find-score-of-an-array-after-marking-all-elements.md)
- [2817. 限制条件下元素之间的最小绝对差](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/2817.minimum-absolute-difference-between-elements-with-constraint.md)
- [2865. 美丽塔 I](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/2865.beautiful-towers-i.md)
- [2866. 美丽塔 II](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/2866.beautiful-towers-ii.md)
- [2939. 最大异或乘积](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/2939.maximum-xor-product.md)
- [3377. 使两个整数相等的数位操作](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/3377.digit-operations-to-make-two-integers-equal.md)
- [3404. 统计特殊子序列的数目](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/3404.count-special-subsequences.md)
- [3428. 至多 K 个子序列的最大和最小和](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/3428.maximum-and-minimum-sums-of-at-most-size-k-subsequences.md)
- [3599. 划分数组以最小化异或值](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/medium/3599.partition-array-to-minimize-xor.md)
- [第六章 - 高频考题（困难）](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard.md)
- [LCP 20. 快速公交](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/lcp20.mechtz.md)
- [LCP 21. 追逐游戏](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/lcp21.za25ha.md)
- [Number Stream to Intervals](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/number-stream-to-intervals.md)
- [Triple-Inversion](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/triple-inversion.md)
- [Kth-Pair-Distance](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/kth-pair-distance.md)
- [Minimum-Light-Radius](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/minimum-light-radius.md)
- [Largest Equivalent Set of Pairs](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/largest-equivalent-set-of-pairs.md)
- [Ticket-Order.md](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/ticket-order.md)
- [Connected-Road-to-Destination](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/connected-road-to-destination.md)
- [0004. 寻找两个正序数组的中位数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/4.median-of-two-sorted-arrays.md)
- [0023. 合并 K 个升序链表](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/23.merge-k-sorted-lists.md)
- [0025. K 个一组翻转链表](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/25.reverse-nodes-in-k-groups.md)
- [0030. 串联所有单词的子串](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/30.substring-with-concatenation-of-all-words.md)
- [0032. 最长有效括号](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/32.longest-valid-parentheses.md)
- [0042. 接雨水](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/42.trapping-rain-water.md)
- [0052. N 皇后 II](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/52.n-queens-ii.md)
- [0057. 插入区间](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/57.insert-interval.md)
- [0065. 有效数字](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/65.valid-number.md)
- [0084. 柱状图中最大的矩形](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/84.largest-rectangle-in-histogram.md)
- [0085. 最大矩形](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/85.maximal-rectangle.md)
- [0087. 扰乱字符串](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/87.scramble-string.md)
- [0124. 二叉树中的最大路径和](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/124.binary-tree-maximum-path-sum.md)
- [0128. 最长连续序列](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/128.longest-consecutive-sequence.md)
- [0132. 分割回文串 II](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/132.palindrome-partitioning-ii.md)
- [0140. 单词拆分 II](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/140.word-break-ii.md)
- [0145. 二叉树的后序遍历](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/145.binary-tree-postorder-traversal.md)
- [0146. LRU 缓存机制](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/146.lru-cache.md)
- [0154. 寻找旋转排序数组中的最小值 II](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/154.find-minimum-in-rotated-sorted-array-ii.md)
- [0212. 单词搜索 II](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/212.word-search-ii.md)
- [0239. 滑动窗口最大值](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/239.sliding-window-maximum.md)
- [0295. 数据流的中位数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/295.find-median-from-data-stream.md)
- [0297. 二叉树的序列化与反序列化](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/297.serialize-and-deserialize-binary-tree.md)
- [0301. 删除无效的括号](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/301.remove-invalid-parentheses.md)
- [0312. 戳气球](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/312.burst-balloons.md)
- [330. 按要求补齐数组](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/330.patching-array.md)
- [0335. 路径交叉](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/335.self-crossing.md)
- [0460. LFU 缓存](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/460.lfu-cache.md)
- [0472. 连接词](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/472.concatenated-words.md)
- [0480. 滑动窗口中位数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/480.sliding-window-median.md)
- [0483. 最小好进制](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/483.smallest-good-base.md)
- [0488. 祖玛游戏](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/488.zuma-game.md)
- [0493. 翻转对](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/493.reverse-pairs.md)
- [0664. 奇怪的打印机](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/664.strange-printer.md)
- [0679. 24 点游戏](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/679.24-game.md)
- [0715. Range 模块](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/715.range-module.md)
- [0726. 原子的数量](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/726.number-of-atoms.md)
- [0768. 最多能完成排序的块 II](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/768.max-chunks-to-make-sorted-ii.md)
- [0805. 数组的均值分割](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/805.split-array-with-same-average.md)
- [0839. 相似字符串组](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/839.similar-string-groups.md)
- [0887. 鸡蛋掉落](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/887.super-egg-drop.md)
- [0895. 最大频率栈](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/895.maximum-frequency-stack.md)
- [0975. 奇偶跳](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/975.odd-even-jump.md)
- [0995. K 连续位的最小翻转次数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/995.minimum-number-of-k-consecutive-bit-flips.md)
- [1032. 字符流](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/1032.stream-of-characters.md)
- [1168. 水资源分配优化](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/1168.optimize-water-distribution-in-a-village.md)
- [1178. 猜字谜](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/1178.number-of-valid-words-for-each-puzzle.md)
- [1203. 项目管理](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/1203.sort-items-by-groups-respecting-dependencies.md)
- [1255. 得分最高的单词集合](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/1255.maximum-score-words-formed-by-letters.md)
- [1345. 跳跃游戏 IV](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/1435.jump-game-iv.md)
- [1449. 数位成本和为目标值的最大数字](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/1449.form-largest-integer-with-digits-that-add-up-to-target.md)
- [1494. 并行课程 II](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/1494.parallel-courses-ii.md)
- [1521. 找到最接近目标值的函数值](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/1521.find-a-value-of-a-mysterious-function-closest-to-target.md)
- [1526. 形成目标数组的子数组最少增加次数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/1526.minimum-number-of-increments-on-subarrays-to-form-a-target-array.md)
- [1639. 通过给定词典构造目标字符串的方案数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/1639.number-of-ways-to-form-a-target-string-given-a-dictionary.md)
- [1649. 通过指令创建有序数组](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/1649.create-sorted-array-through-instructions.md)
- [1671. 得到山形数组的最少删除次数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/1671.minimum-number-of-removals-to-make-mountain-array.md)
- [1707. 与数组中元素的最大异或值](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/5640.maximum-xor-with-an-element-from-array.md)
- [1713. 得到子序列的最少操作次数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/1713.minimum-operations-to-make-a-subsequence.md)
- [1723. 完成所有工作的最短时间](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/1723.find-minimum-time-to-finish-all-jobs.md)
- [1787. 使所有区间的异或结果为零](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/1787.make-the-xor-of-all-segments-equal-to-zero.md)
- [1835. 所有数对按位与结果的异或和](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/1835.find-xor-sum-of-all-pairs-bitwise-and.md)
- [1871. 跳跃游戏 VII](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/1871.jump-game-vii.md)
- [1872. 石子游戏 VIII](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/1872.stone-game-viii.md)
- [1883. 准时抵达会议现场的最小跳过休息次数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/5775.minimum-skips-to-arrive-at-meeting-on-time.md)
- [1970. 你能穿过矩阵的最后一天](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/1970.last-day-where-you-can-still-cross.md)
- [2009. 使数组连续的最少操作数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/2009.minimum-number-of-operations-to-make-array-continuous.md)
- [2025. 分割数组的最多方案数](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/2025.maximum-number-of-ways-to-partition-an-array.md)
- [2030. 含特定字母的最小子序列](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/2030.smallest-k-length-subsequence-with-occurrences-of-a-letter.md)
- [2102. 序列顺序查询](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/2102.sequentially-ordinal-rank-tracker.md)
- [2141. 同时运行 N 台电脑的最长时间](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/2141.maximum-running-time-of-n-computers.md)
- [2179. 统计数组中好三元组数目 👍](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/2179.-tong-ji-shu-zu-zhong-hao-san-yuan-zu-shu-mu.md)
- [2209. 用地毯覆盖后的最少白色砖块](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/2209.minimum-white-tiles-after-covering-with-carpets.md)
- [2281.sum-of-total-strength-of-wizards](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/2281.sum-of-total-strength-of-wizards.md)
- [2306. 公司命名](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/2306.naming-a-company.md)
- [2312. 卖木头块](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/2312.selling-pieces-of-wood.md)
- [2842. 统计一个字符串的 k 子序列美丽值最大的数目](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/2842.count-k-subsequences-of-a-string-with-maximum-beauty.md)
- [2972. 统计移除递增子数组的数目 II](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/2972.count-the-number-of-incremovable-subarrays-ii.md)
- [3027. 人员站位的方案数 II](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/3027.find-the-number-of-ways-to-place-people-ii.md)
- [3041. 修改数组后最大化数组中的连续元素数目](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/3041.maximize-consecutive-elements-in-an-array-after-modification.md)
- [3082. 求出所有子序列的能量和](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/3082.find-the-sum-of-the-power-of-all-subsequences.md)
- [3108. 带权图里旅途的最小代价](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/3108.minimum-cost-walk-in-weighted-graph.md)
- [3347. 执行操作后元素的最高频率 II](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/3347.maximum-frequency-of-an-element-after-performing-operations-ii.md)
- [3336. 最大公约数相等的子序列数量](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/3336.find-the-number-of-subsequences-with-equal-gcd.md)
- [3410. 删除所有值为某个元素后的最大子数组和](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/hard/3410.maximize-subarray-sum-after-removing-all-occurrences-of-one-element.md)
- [后序](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/epilogue.md)


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## Querying This Documentation
If you need additional information, you can query the documentation dynamically by asking a question.
Perform an HTTP GET request on a page URL with the `ask` query parameter:
```
GET https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/introduction.md?ask=<question>
```
The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.
Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.