{"version":1,"pages":[{"id":"-MJeEMKyx8CmWLCJ8l9n","title":"introduction","pathname":"/leetcode-solution","siteSpaceId":"sitesp_rDqfs","description":""},{"id":"-MJjODnQxYhQmFzZm5gC","title":"第一章 - 算法专题","pathname":"/leetcode-solution/thinkings","siteSpaceId":"sitesp_rDqfs","description":""},{"id":"-MJeEql13YVcUfcClsyt","title":"数据结构","pathname":"/leetcode-solution/thinkings/basic-data-structure","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第一章 - 算法专题"}]},{"id":"-MLkFAr3doSXXiMDoTQP","title":"链表专题","pathname":"/leetcode-solution/thinkings/linked-list","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第一章 - 算法专题"}]},{"id":"-MMoACnqUZQGhAIdlKvo","title":"树专题","pathname":"/leetcode-solution/thinkings/tree","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第一章 - 算法专题"}]},{"id":"-MPcxhpKBlzBk3sbE0CW","title":"堆专题（上）","pathname":"/leetcode-solution/thinkings/heap","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第一章 - 算法专题"}]},{"id":"-MRtQwdIPUMkbm9xXL0-","title":"堆专题（下）","pathname":"/leetcode-solution/thinkings/heap-2","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第一章 - 算法专题"}]},{"id":"-MWXhoOVOkQJMVV0cTJT","title":"二分专题（上）","pathname":"/leetcode-solution/thinkings/binary-search-1","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第一章 - 算法专题"}]},{"id":"-MWXhoOW6uW3DK-vJ3l-","title":"二分专题（下）","pathname":"/leetcode-solution/thinkings/binary-search-2","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第一章 - 算法专题"}]},{"id":"-MJeEqjATFOoqhGroJD6","title":"动态规划(重置版)","pathname":"/leetcode-solution/thinkings/dynamic-programming","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第一章 - 算法专题"}]},{"id":"A5D4fRRxRAlAYfvL3KJ5","title":"大话搜索","pathname":"/leetcode-solution/thinkings/search","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第一章 - 算法专题"}]},{"id":"-MJeEqvBPh4cUQ2IwItz","title":"二叉树的遍历","pathname":"/leetcode-solution/thinkings/binary-tree-traversal","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第一章 - 算法专题"}]},{"id":"-MJeEqxQ2Ydbg5LXeNSj","title":"哈夫曼编码和游程编码","pathname":"/leetcode-solution/thinkings/run-length-encode-and-huffman-encode","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第一章 - 算法专题"}]},{"id":"-MJeEqvkXAAjnX3ohNYe","title":"布隆过滤器","pathname":"/leetcode-solution/thinkings/bloom-filter","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第一章 - 算法专题"}]},{"id":"-MJeEr04A9a5R1t230Uw","title":"前缀树","pathname":"/leetcode-solution/thinkings/trie","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第一章 - 算法专题"}]},{"id":"-MKsWPLA5Xo5INzM7YWi","title":"回溯","pathname":"/leetcode-solution/thinkings/backtrack","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第一章 - 算法专题"}]},{"id":"-MJeEqnvitFmMcZgifOF","title":"滑动窗口（思路 + 模板）","pathname":"/leetcode-solution/thinkings/slide-window","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第一章 - 算法专题"}]},{"id":"-MJeEqicmM4XiItHEf1Y","title":"位运算","pathname":"/leetcode-solution/thinkings/bit","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第一章 - 算法专题"}]},{"id":"-MJeEqinL-tK-yvKeuR9","title":"小岛问题","pathname":"/leetcode-solution/thinkings/island","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第一章 - 算法专题"}]},{"id":"-MJeEqkYDqdfthovTngp","title":"最大公约数","pathname":"/leetcode-solution/thinkings/gcd","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第一章 - 算法专题"}]},{"id":"-MJeEqiO2bdd0B9gRzvW","title":"并查集","pathname":"/leetcode-solution/thinkings/union-find","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第一章 - 算法专题"}]},{"id":"-MJeEqoXLbHUPOb5ZBKS","title":"平衡二叉树专题","pathname":"/leetcode-solution/thinkings/balanced-tree","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第一章 - 算法专题"}]},{"id":"-MQqLsiHSTGgn6yOUV74","title":"蓄水池抽样","pathname":"/leetcode-solution/thinkings/reservoid-sampling","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第一章 - 算法专题"}]},{"id":"-MLCUB6FmOoUeEsKzpSW","title":"单调栈","pathname":"/leetcode-solution/thinkings/monotone-stack","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第一章 - 算法专题"}]},{"id":"-MJjODnlW5j9kqy84f7v","title":"第二章 - 91 天学算法","pathname":"/leetcode-solution/91","siteSpaceId":"sitesp_rDqfs","description":""},{"id":"-MJh1IC8o6vJQSk0qmVu","title":"第一期讲义-二分法","pathname":"/leetcode-solution/91/binary-search","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第二章 - 91 天学算法"}]},{"id":"-MJh1IC9dg9qTl-8bE1K","title":"第一期讲义-双指针","pathname":"/leetcode-solution/91/two-pointers","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第二章 - 91 天学算法"}]},{"id":"-MJjODnpPg71iVdqC2lF","title":"第三章 - 精选题解","pathname":"/leetcode-solution/selected","siteSpaceId":"sitesp_rDqfs","description":""},{"id":"-MJh1ICEmQrsILIQqaik","title":"字典序列删除","pathname":"/leetcode-solution/selected/a-deleted","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第三章 - 精选题解"}]},{"id":"-MJh1ICG5xa7wLw5Btpe","title":"西法的刷题秘籍】一次搞定前缀和","pathname":"/leetcode-solution/selected/atmostk","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第三章 - 精选题解"}]},{"id":"-MJh1ICHmcWUnBtDS8DQ","title":"字节跳动的算法面试题是什么难度？","pathname":"/leetcode-solution/selected/byte-dance-algo-ex","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第三章 - 精选题解"}]},{"id":"-MJh1ICIo1jRXJaTvJv1","title":"字节跳动的算法面试题是什么难度？（第二弹）","pathname":"/leetcode-solution/selected/byte-dance-algo-ex-2017","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第三章 - 精选题解"}]},{"id":"-MJh1ICJ2EAYTvNeT7ZK","title":"《我是你的妈妈呀》 * 第一期","pathname":"/leetcode-solution/selected/mother-01","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第三章 - 精选题解"}]},{"id":"-MJh1ICKhuZqz385N_PG","title":"一文带你看懂二叉树的序列化","pathname":"/leetcode-solution/selected/serialize","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第三章 - 精选题解"}]},{"id":"-MJh1ICL32pCCz03triT","title":"穿上衣服我就不认识你了？来聊聊最长上升子序列","pathname":"/leetcode-solution/selected/lis","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第三章 - 精选题解"}]},{"id":"-MJh1ICMOJCDqiVeypAk","title":"你的衣服我扒了 * 《最长公共子序列》","pathname":"/leetcode-solution/selected/lcs","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第三章 - 精选题解"}]},{"id":"-MJh1ICNrszexHs3qusy","title":"一文看懂《最大子序列和问题》","pathname":"/leetcode-solution/selected/lss","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第三章 - 精选题解"}]},{"id":"-MJf-hr3ClzkQydmwW13","title":"第四章 - 高频考题（简单）","pathname":"/leetcode-solution/easy","siteSpaceId":"sitesp_rDqfs","description":""},{"id":"-MJehBzz33taTFhxl6JQ","title":"面试题 17.12. BiNode","pathname":"/leetcode-solution/easy/binode-lcci","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJjODo3XXthsNBeMZ3A","title":"0001. 两数之和","pathname":"/leetcode-solution/easy/1.two-sum","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJjODo4SRljFwizSf83","title":"0020. 有效的括号","pathname":"/leetcode-solution/easy/20.valid-parentheses","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJjODo5XhfMiamwstUv","title":"0021. 合并两个有序链表","pathname":"/leetcode-solution/easy/21.merge-two-sorted-lists","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJjODo6UQZ7UKCw9WSk","title":"0026. 删除排序数组中的重复项","pathname":"/leetcode-solution/easy/26.remove-duplicates-from-sorted-array","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJjODo7sxoVxUzN614N","title":"0053. 最大子序和","pathname":"/leetcode-solution/easy/53.maximum-sum-subarray-cn","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MN6kI3FFSrr7BdyAHmS","title":"0160. 相交链表","pathname":"/leetcode-solution/easy/160.intersection-of-two-linked-lists","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MLvpg0Db3euhLPIv-8S","title":"0066. 加一","pathname":"/leetcode-solution/easy/66.plus-one","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJjODo8H2JlWTxYpooo","title":"0088. 合并两个有序数组","pathname":"/leetcode-solution/easy/88.merge-sorted-array","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJehC-5MCMZx5taH0nL","title":"0101. 对称二叉树","pathname":"/leetcode-solution/easy/101.symmetric-tree","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJjODoAONCA6WmhjZfL","title":"0104. 二叉树的最大深度","pathname":"/leetcode-solution/easy/104.maximum-depth-of-binary-tree","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJehC-7cU23QCS_Cl28","title":"0108. 将有序数组转换为二叉搜索树","pathname":"/leetcode-solution/easy/108.convert-sorted-array-to-binary-search-tree","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJjODoCgmebzzl6GJ_x","title":"0121. 买卖股票的最佳时机","pathname":"/leetcode-solution/easy/121.best-time-to-buy-and-sell-stock","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJjODoD_bWY-DS_RcqK","title":"0122. 买卖股票的最佳时机 II","pathname":"/leetcode-solution/easy/122.best-time-to-buy-and-sell-stock-ii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJjODoEYNgrZXTAQ-ke","title":"0125. 验证回文串","pathname":"/leetcode-solution/easy/125.valid-palindrome","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJehC-BS1cjwuq9qrqY","title":"0136. 只出现一次的数字","pathname":"/leetcode-solution/easy/136.single-number","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJehC-CvG9pKauagpdc","title":"0155. 最小栈","pathname":"/leetcode-solution/easy/155.min-stack","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJehC-DO3zyUKNuFy0a","title":"0167. 两数之和 II 输入有序数组","pathname":"/leetcode-solution/easy/167.two-sum-ii-input-array-is-sorted","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJehC-EuHh6ba5LKylW","title":"0169. 多数元素","pathname":"/leetcode-solution/easy/169.majority-element","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJehC-FqNRI-URbRFev","title":"0172. 阶乘后的零","pathname":"/leetcode-solution/easy/172.factorial-trailing-zeroes","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJehC-GSIcK5qgmwAc2","title":"0190. 颠倒二进制位","pathname":"/leetcode-solution/easy/190.reverse-bits","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJehC-HaWHO9QFh7ZKq","title":"0191. 位 1 的个数","pathname":"/leetcode-solution/easy/191.number-of-1-bits","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJehC-ICJAW6baOcVNn","title":"0198. 打家劫舍","pathname":"/leetcode-solution/easy/198.house-robber","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJehC-J3Z3pNavAeWb3","title":"0203. 移除链表元素","pathname":"/leetcode-solution/easy/203.remove-linked-list-elements","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJehC-K-15pwvOig0ft","title":"0206. 反转链表","pathname":"/leetcode-solution/easy/206.reverse-linked-list","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJehC-L_gvFetcwgYrV","title":"0219. 存在重复元素 II","pathname":"/leetcode-solution/easy/219.contains-duplicate-ii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJehC-MxgiIFglPb8SM","title":"0226. 翻转二叉树","pathname":"/leetcode-solution/easy/226.invert-binary-tree","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJehC-NDwm7co-7QAD3","title":"0232. 用栈实现队列","pathname":"/leetcode-solution/easy/232.implement-queue-using-stacks","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJehC-O1H56GTyDTzr-","title":"0263. 丑数","pathname":"/leetcode-solution/easy/263.ugly-number","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJehC-PTlkma7aKIkwQ","title":"0283. 移动零","pathname":"/leetcode-solution/easy/283.move-zeroes","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJehC-QRQjAekW-DFCS","title":"0342. 4 的幂","pathname":"/leetcode-solution/easy/342.power-of-four","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJehC-Rdn5s8vMhMk-J","title":"0349. 两个数组的交集","pathname":"/leetcode-solution/easy/349.intersection-of-two-arrays","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJehC-S8OFyXoGJ0OIA","title":"0371. 两整数之和","pathname":"/leetcode-solution/easy/371.sum-of-two-integers","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MPmemgi72hNM8_oM-XR","title":"401. 二进制手表","pathname":"/leetcode-solution/easy/401.binary-watch","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJehC-TbJQcxa25Q1FE","title":"0437. 路径总和 III","pathname":"/leetcode-solution/easy/437.path-sum-iii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJehC-UTrhjTdYA9rt9","title":"0455. 分发饼干","pathname":"/leetcode-solution/easy/455.assigncookies","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MVFeA04GUB2mcWuUDGT","title":"0504. 七进制数","pathname":"/leetcode-solution/easy/504.base-7","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJehC-VyWp9ZAORL1AX","title":"0575. 分糖果","pathname":"/leetcode-solution/easy/575.distribute-candies","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MSuQ3hqj2P8_05HhnAE","title":"0665. 非递减数列","pathname":"/leetcode-solution/easy/665.non-decreasing-array","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"sIxwp6iCWl6pfjPgTQrV","title":"0661. 图片平滑器","pathname":"/leetcode-solution/easy/661.image-smoother","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MLvpg0f2gDzj5QcdVS3","title":"821. 字符的最短距离","pathname":"/leetcode-solution/easy/821.shortest-distance-to-a-character","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJehC-W60ZZd4JkpOlF","title":"0874. 模拟行走机器人","pathname":"/leetcode-solution/easy/874.walking-robot-simulation","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MRyLhTYOnmkxPnZ4lvd","title":"1128. 等价多米诺骨牌对的数量","pathname":"/leetcode-solution/easy/1128.number-of-equivalent-domino-pairs","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJefnocm3hzpUwq4zuk","title":"1260. 二维网格迁移","pathname":"/leetcode-solution/easy/1260.shift-2d-grid","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJefnodbtzWc4aBkTAf","title":"1332. 删除回文子序列","pathname":"/leetcode-solution/easy/1332.remove-palindromic-subsequences","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"1BaCNvgbBDr8WT15Xexf","title":"2591. 将钱分给最多的儿童","pathname":"/leetcode-solution/easy/2591.distribute-money-to-maximum-children","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第四章 - 高频考题（简单）"}]},{"id":"-MJfmb_ifdTNJosDKa8U","title":"第五章 - 高频考题（中等）","pathname":"/leetcode-solution/medium","siteSpaceId":"sitesp_rDqfs","description":""},{"id":"-MPUQiayrSl-gbUY8aor","title":"面试题 17.09. 第 k 个数","pathname":"/leetcode-solution/medium/get-kth-magic-number-lcci","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MPU6YqYu4O690YlEaPa","title":"面试题 17.23. 最大黑方阵","pathname":"/leetcode-solution/medium/max-black-square-lcci","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MZ2lvBTsxGqPLhq2ipV","title":"面试题 16.16. 部分排序","pathname":"/leetcode-solution/medium/sub-sort-lcci","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MW2x1ytTo7HEbG4PDK-","title":"Increasing Digits","pathname":"/leetcode-solution/medium/increasing-digits","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MW2x1yuKXU07h7zGKmD","title":"Longest Contiguously Strictly Increasing Sublist After Deletion","pathname":"/leetcode-solution/medium/longest-contiguously-strictly-increasing-sublist-after-deletion","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MWSwSY68ZAXrOJHD7Wp","title":"Consecutive Wins","pathname":"/leetcode-solution/medium/consecutive-wins","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MWc03fxjUu12SlWQUIy","title":"Number of Substrings with Single Character Difference","pathname":"/leetcode-solution/medium/number-of-substrings-with-single-character-difference","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MX1LWufK6Vb7zVNTWKL","title":"Bus Fare","pathname":"/leetcode-solution/medium/bus-fare","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MX6AuV2pRw6wJIarm6j","title":"Minimum Dropping Path Sum","pathname":"/leetcode-solution/medium/minimum-dropping-path-sum","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"kJjdYJzNEzO9vCZapXmQ","title":"Every Sublist Min Sum","pathname":"/leetcode-solution/medium/every-sublist-min-sum","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"IwJvgRazo3NKO0J2cWdX","title":"Maximize the Number of Equivalent Pairs After Swaps","pathname":"/leetcode-solution/medium/maximize-the-number-of-equivalent-pairs-after-swaps","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojC2LiV_kb5KyLz","title":"0002. 两数相加","pathname":"/leetcode-solution/medium/2.add-two-numbers","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojDG4Hdcw2JBDR1","title":"0003. 无重复字符的最长子串","pathname":"/leetcode-solution/medium/3.longest-substring-without-repeating-characters","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojEbeQsCoqvGg3_","title":"0005. 最长回文子串","pathname":"/leetcode-solution/medium/5.longest-palindromic-substring","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojF2u8pNNxUtj8G","title":"0011. 盛最多水的容器","pathname":"/leetcode-solution/medium/11.container-with-most-water","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojG5xoqX3FlTfgQ","title":"0015. 三数之和","pathname":"/leetcode-solution/medium/15.3sum","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojHUuVRmhFDJY7d","title":"0017. 电话号码的字母组合","pathname":"/leetcode-solution/medium/17.letter-combinations-of-a-phone-number","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojIMlFfin_aWH46","title":"0019. 删除链表的倒数第 N 个节点","pathname":"/leetcode-solution/medium/19.removenthnodefromendoflist","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojJEgYV_TaahK8X","title":"0022. 括号生成","pathname":"/leetcode-solution/medium/22.generate-parentheses","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojKhC56aB4xspJO","title":"0024. 两两交换链表中的节点","pathname":"/leetcode-solution/medium/24.swapnodesinpairs","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojLp1yj_7Iiym-o","title":"0029. 两数相除","pathname":"/leetcode-solution/medium/29.divide-two-integers","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojM-iHHF-gc4hHm","title":"0031. 下一个排列","pathname":"/leetcode-solution/medium/31.next-permutation","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojNlhfxVmCsGeiq","title":"0033. 搜索旋转排序数组","pathname":"/leetcode-solution/medium/33.search-in-rotated-sorted-array","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojODC70evEXNPi5","title":"0039. 组合总和","pathname":"/leetcode-solution/medium/39.combination-sum","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojPTmwHeJDnd8w_","title":"0040. 组合总和 II","pathname":"/leetcode-solution/medium/40.combination-sum-ii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojQgPDVukWmPhNm","title":"0046. 全排列","pathname":"/leetcode-solution/medium/46.permutations","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojRZk6-SbU7Dzen","title":"0047. 全排列 II","pathname":"/leetcode-solution/medium/47.permutations-ii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojSyKJLpvn2WBi-","title":"0048. 旋转图像","pathname":"/leetcode-solution/medium/48.rotate-image","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojTB-wpXgb7YAg8","title":"0049. 字母异位词分组","pathname":"/leetcode-solution/medium/49.group-anagrams","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojUneclJecOvFNC","title":"0050. Pow(x, n)","pathname":"/leetcode-solution/medium/50.pow-x-n","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojVgZ-zyEkpBrXX","title":"0055. 跳跃游戏","pathname":"/leetcode-solution/medium/55.jump-game","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojWZ2H4k6Ib1Fa7","title":"0056. 合并区间","pathname":"/leetcode-solution/medium/56.merge-intervals","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojXrCZgIlQnICfJ","title":"0060. 第 k 个排列","pathname":"/leetcode-solution/medium/60.permutation-sequence","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MPUQi_O5iHzWhCMOeU8","title":"0061. 旋转链表","pathname":"/leetcode-solution/medium/61.rotate-list","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojYYbd6MGEo3uAP","title":"0062. 不同路径","pathname":"/leetcode-solution/medium/62.unique-paths","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojZLppyitUtscJl","title":"0073. 矩阵置零","pathname":"/leetcode-solution/medium/73.set-matrix-zeroes","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1oj_wz2pC2JRPivG","title":"0075. 颜色分类","pathname":"/leetcode-solution/medium/75.sort-colors","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1oja8KmRJDEG3Ohy","title":"0078. 子集","pathname":"/leetcode-solution/medium/78.subsets","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJpDGiaKsroUeecGUqF","title":"0079. 单词搜索","pathname":"/leetcode-solution/medium/79.word-search","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojcZ7p4rKdA4Btq","title":"0080. 删除排序数组中的重复项 II","pathname":"/leetcode-solution/medium/80.remove-duplicates-from-sorted-array-ii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojdjpy2ZNFWo0q1","title":"0086. 分隔链表","pathname":"/leetcode-solution/medium/86.partition-list","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojeZy0D_BAH2gkh","title":"0090. 子集 II","pathname":"/leetcode-solution/medium/90.subsets-ii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojfyNHKM3K5Itqb","title":"0091. 解码方法","pathname":"/leetcode-solution/medium/91.decode-ways","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojgwO50zCj7Olfy","title":"0092. 反转链表 II","pathname":"/leetcode-solution/medium/92.reverse-linked-list-ii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojhVbgqbmGjHhOl","title":"0094. 二叉树的中序遍历","pathname":"/leetcode-solution/medium/94.binary-tree-inorder-traversal","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojiJbfOhjMrG4k7","title":"0095. 不同的二叉搜索树 II","pathname":"/leetcode-solution/medium/95.unique-binary-search-trees-ii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojjE1CW2PzWJBTA","title":"0096. 不同的二叉搜索树","pathname":"/leetcode-solution/medium/96.unique-binary-search-trees","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojk8_cwdZLP8Jvd","title":"0098. 验证二叉搜索树","pathname":"/leetcode-solution/medium/98.validate-binary-search-tree","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojlWWKilgUI2tMK","title":"0102. 二叉树的层序遍历","pathname":"/leetcode-solution/medium/102.binary-tree-level-order-traversal","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojm6Ucl3L5Q0tW0","title":"0103. 二叉树的锯齿形层次遍历","pathname":"/leetcode-solution/medium/103.binary-tree-zigzag-level-order-traversal","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojoCvOzZgSAHGL-","title":"0113. 路径总和 II","pathname":"/leetcode-solution/medium/113.path-sum-ii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojp8xJXakXpgswx","title":"0129. 求根到叶子节点数字之和","pathname":"/leetcode-solution/medium/129.sum-root-to-leaf-numbers","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojqBU4ZSd1BLjNB","title":"0130. 被围绕的区域","pathname":"/leetcode-solution/medium/130.surrounded-regions","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojrdJb9fx3GQOHk","title":"0131. 分割回文串","pathname":"/leetcode-solution/medium/131.palindrome-partitioning","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojsg7t9LJ4Hzh7K","title":"0139. 单词拆分","pathname":"/leetcode-solution/medium/139.word-break","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojtP6mN6MXOpScF","title":"0144. 二叉树的前序遍历","pathname":"/leetcode-solution/medium/144.binary-tree-preorder-traversal","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MPUQi_k9UwBab3qtIuG","title":"0147. 对链表进行插入排序","pathname":"/leetcode-solution/medium/147.insertion-sort-list","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojugqt46T_yuFYB","title":"0150. 逆波兰表达式求值","pathname":"/leetcode-solution/medium/150.evaluate-reverse-polish-notation","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojv7jV7TAfvjuDt","title":"0152. 乘积最大子数组","pathname":"/leetcode-solution/medium/152.maximum-product-subarray","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MXq9VHMAjuUOEyIxyel","title":"0153. 寻找旋转排序数组中的最小值","pathname":"/leetcode-solution/medium/153.find-minimum-in-rotated-sorted-array","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojwi2myo0f-xULv","title":"0199. 二叉树的右视图","pathname":"/leetcode-solution/medium/199.binary-tree-right-side-view","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojxm5bIIdXfy7oY","title":"0200. 岛屿数量","pathname":"/leetcode-solution/medium/200.number-of-islands","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojylmRUbrRSKiKi","title":"0201. 数字范围按位与","pathname":"/leetcode-solution/medium/201.bitwise-and-of-numbers-range","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ojzsb2FGFyABood","title":"0208. 实现 Trie (前缀树)","pathname":"/leetcode-solution/medium/208.implement-trie-prefix-tree","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ok-DTEjJX9xB9kW","title":"0209. 长度最小的子数组","pathname":"/leetcode-solution/medium/209.minimum-size-subarray-sum","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ok0nFFy2y1hjozE","title":"0211. 添加与搜索单词 - 数据结构设计","pathname":"/leetcode-solution/medium/211.add-and-search-word-data-structure-design","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ok1C3-wrIli3n3I","title":"0215. 数组中的第 K 个最大元素","pathname":"/leetcode-solution/medium/215.kth-largest-element-in-an-array","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MVLSJdi6fvScWQTqFWO","title":"0220. 存在重复元素 III","pathname":"/leetcode-solution/medium/220.contains-duplicate-iii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ok2Cvoiti4QXkyh","title":"0221. 最大正方形","pathname":"/leetcode-solution/medium/221.maximal-square","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MPU6YpW8T2AAvDyPuOr","title":"0227. 基本计算器 II","pathname":"/leetcode-solution/medium/227.basic-calculator-ii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ok3WZjIzB_hKAzQ","title":"0229. 求众数 II","pathname":"/leetcode-solution/medium/229.majority-element-ii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ok4BniZwIA0uxhO","title":"0230. 二叉搜索树中第 K 小的元素","pathname":"/leetcode-solution/medium/230.kth-smallest-element-in-a-bst","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ok5Iee4QMMp3xAV","title":"0236. 二叉树的最近公共祖先","pathname":"/leetcode-solution/medium/236.lowest-common-ancestor-of-a-binary-tree","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJpDGj5cf9Q_yB1elPy","title":"0238. 除自身以外数组的乘积","pathname":"/leetcode-solution/medium/238.product-of-array-except-self","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ok7zHzSqNwrn3Sj","title":"0240. 搜索二维矩阵 II","pathname":"/leetcode-solution/medium/240.search-a-2-d-matrix-ii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ok8S-XZhIt0Lji_","title":"0279. 完全平方数","pathname":"/leetcode-solution/medium/279.perfect-squares","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ok99KqY_KoU9QHd","title":"0309. 最佳买卖股票时机含冷冻期","pathname":"/leetcode-solution/medium/309.best-time-to-buy-and-sell-stock-with-cooldown","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1okAod72Q3uwO9Vh","title":"0322. 零钱兑换","pathname":"/leetcode-solution/medium/322.coin-change","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"6bZJsumjE2aap0pzCkJt","title":"0324. 摆动排序 II","pathname":"/leetcode-solution/medium/324.wiggle-sort-ii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1okBokuAzOErPe0S","title":"0328. 奇偶链表","pathname":"/leetcode-solution/medium/328.odd-even-linked-list","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MYyHvCp1VaHHX0on5BY","title":"0331. 验证二叉树的前序序列化","pathname":"/leetcode-solution/medium/331.verify-preorder-serialization-of-a-binary-tree","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1okCfijfhYuknZqL","title":"0334. 递增的三元子序列","pathname":"/leetcode-solution/medium/334.increasing-triplet-subsequence","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1okDVxSyBwWZdCEY","title":"0337. 打家劫舍 III","pathname":"/leetcode-solution/medium/337.house-robber-iii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1okEWD_H2jMb6U1c","title":"0343. 整数拆分","pathname":"/leetcode-solution/medium/343.integer-break","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1okFxuGPubIYjsEB","title":"0365. 水壶问题","pathname":"/leetcode-solution/medium/365.water-and-jug-problem","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1okGxG1Mk_ADiyWR","title":"0378. 有序矩阵中第 K 小的元素","pathname":"/leetcode-solution/medium/378.kth-smallest-element-in-a-sorted-matrix","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1okHAzX-XtehBZWC","title":"0380. 常数时间插入、删除和获取随机元素","pathname":"/leetcode-solution/medium/380.insert-delete-getrandom-o1","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MLvpg1qtJI_awpxud8e","title":"0394. 字符串解码","pathname":"/leetcode-solution/medium/394.decode-string","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1okIbm0rUjwesa3Z","title":"0416. 分割等和子集","pathname":"/leetcode-solution/medium/416.partition-equal-subset-sum","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MSWrywme5J20_H0M87I","title":"0424. 替换后的最长重复字符","pathname":"/leetcode-solution/medium/424.longest-repeating-character-replacement","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MZC1ODbsQZRmbcbzaq3","title":"0438. 找到字符串中所有字母异位词","pathname":"/leetcode-solution/medium/438.find-all-anagrams-in-a-string","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1okJptFOmJAnNCV9","title":"0445. 两数相加 II","pathname":"/leetcode-solution/medium/445.add-two-numbers-ii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1okKdvEAd-6ocD35","title":"0454. 四数相加 II","pathname":"/leetcode-solution/medium/454.4-sum-ii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MWY5IqQBelsdrqUqkuA","title":"0456. 132 模式","pathname":"/leetcode-solution/medium/456.132-pattern","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MilUj69JEX49jaiJNfs","title":"0457.457. 环形数组是否存在循环","pathname":"/leetcode-solution/medium/457.circular-array-loop","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MPU6YppUfCea_hKBGAS","title":"0464. 我能赢么","pathname":"/leetcode-solution/medium/464.can-i-win","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-Mio52vMqQLvJgvcffZv","title":"0470. 用 Rand7() 实现 Rand10","pathname":"/leetcode-solution/medium/470.implement-rand10-using-rand7","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-Mac1w2cYzwjB5Zp8Rgj","title":"0473. 火柴拼正方形","pathname":"/leetcode-solution/medium/473.matchsticks-to-square","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1okMuDTeL0hMV6k-","title":"0494. 目标和","pathname":"/leetcode-solution/medium/494.target-sum","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1okNz9IyfNX68vW2","title":"0516. 最长回文子序列","pathname":"/leetcode-solution/medium/516.longest-palindromic-subsequence","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MN6kI5-1vLJw3O7AZAS","title":"0513. 找树左下角的值","pathname":"/leetcode-solution/medium/513.find-bottom-left-tree-value","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1okOMprWpkSfKWBs","title":"0518. 零钱兑换 II","pathname":"/leetcode-solution/medium/518.coin-change-2","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MbEgs9lqD7MP3psSdCc","title":"0525. 连续数组","pathname":"/leetcode-solution/medium/525.contiguous-array","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"NhU9zNQzDDihy1ChXcOg","title":"0547. 朋友圈","pathname":"/leetcode-solution/medium/0547.-peng-you-quan","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1okQNF7onvTnYTlH","title":"0560. 和为 K 的子数组","pathname":"/leetcode-solution/medium/560.subarray-sum-equals-k","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1okR003C8E6qXf3Z","title":"0609. 在系统中查找重复文件","pathname":"/leetcode-solution/medium/609.find-duplicate-file-in-system","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1okSIDscphXF7WIf","title":"0611. 有效三角形的个数","pathname":"/leetcode-solution/medium/611.valid-triangle-number","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MRcPwp1UPgtMH3ztXdw","title":"0673. 最长递增子序列的个数","pathname":"/leetcode-solution/medium/673.number-of-longest-increasing-subsequence","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MKj4e1pTgrP6x56L2kp","title":"0686. 重复叠加字符串匹配","pathname":"/leetcode-solution/medium/686.repeated-string-match","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"3rWp3EirNUMREHnCxTKh","title":"0710. 黑名单中的随机数","pathname":"/leetcode-solution/medium/710.random-pick-with-blacklist","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MVPy8LIZISt4tzFVVcR","title":"0714. 买卖股票的最佳时机含手续费","pathname":"/leetcode-solution/medium/714.best-time-to-buy-and-sell-stock-with-transaction-fee","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1okTDI6oteqCrtXf","title":"0718. 最长重复子数组","pathname":"/leetcode-solution/medium/718.maximum-length-of-repeated-subarray","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-Mal6KAazb8bGBTG04OU","title":"0735. 行星碰撞","pathname":"/leetcode-solution/medium/735.asteroid-collision","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1okUCQ_6Fm6smzLV","title":"0754. 到达终点数字","pathname":"/leetcode-solution/medium/754.reach-a-number","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1okVVVajF-wGLrBD","title":"0785. 判断二分图","pathname":"/leetcode-solution/medium/785.is-graph-bipartite","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MTiW86zIX1suTysVN3b","title":"0790. 多米诺和托米诺平铺","pathname":"/leetcode-solution/medium/790.domino-and-tromino-tiling","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MTZyQpymfleO4lduq6p","title":"0799. 香槟塔","pathname":"/leetcode-solution/medium/799.champagne-tower","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MT_Zs2Obx2XuefBmTqV","title":"0801. 使序列递增的最小交换次数","pathname":"/leetcode-solution/medium/801.minimum-swaps-to-make-sequences-increasing","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-ML6sMyh1TMSNwTOG4Dr","title":"0816. 模糊坐标","pathname":"/leetcode-solution/medium/816.ambiguous-coordinates","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1okW-KEWZgz4b2w2","title":"0820. 单词的压缩编码","pathname":"/leetcode-solution/medium/820.short-encoding-of-words","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MjtUiIWUmpVJ0qfs-Bg","title":"0838. 推多米诺","pathname":"/leetcode-solution/medium/838.push-dominoes","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MWSLDpZfhx6LGob8Edn","title":"0873. 最长的斐波那契子序列的长度","pathname":"/leetcode-solution/medium/873.length-of-longest-fibonacci-subsequence","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1okXebI602cBDsdS","title":"0875. 爱吃香蕉的珂珂","pathname":"/leetcode-solution/medium/875.koko-eating-bananas","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1okY9V6KzIVzi3W_","title":"0877. 石子游戏","pathname":"/leetcode-solution/medium/877.stone-game","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1okZ5k6ybuwaMCjU","title":"0886. 可能的二分法","pathname":"/leetcode-solution/medium/886.possible-bipartition","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MT4_6dVO6_DJc9L5URm","title":"0898. 子数组按位或操作","pathname":"/leetcode-solution/medium/898.bitwise-ors-of-subarrays","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1ok_yjVPRPSnN_VC","title":"0900. RLE 迭代器","pathname":"/leetcode-solution/medium/900.rle-iterator","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MS_yWba6hFQAtWcGGbX","title":"0911. 在线选举","pathname":"/leetcode-solution/medium/911.online-election","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1okaNYk6506-FFoV","title":"0912. 排序数组","pathname":"/leetcode-solution/medium/912.sort-an-array","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MSXUHmot3p6MSFbipQK","title":"0932. 漂亮数组","pathname":"/leetcode-solution/medium/932.beautiful-array","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJf1okb7ieEab2AmaXM","title":"0935. 骑士拨号器","pathname":"/leetcode-solution/medium/935.knight-dialer","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MR3WaiMakWYHEudoPV0","title":"0947. 移除最多的同行或同列石头","pathname":"/leetcode-solution/medium/947.most-stones-removed-with-same-row-or-column","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MRrxwhQQ6gWARmcvF2a","title":"0959. 由斜杠划分区域","pathname":"/leetcode-solution/medium/959.regions-cut-by-slashes","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MKQIVIqR83aEl17HaAH","title":"0978. 最长湍流子数组","pathname":"/leetcode-solution/medium/978.longest-turbulent-subarray","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MN6kI5Jid3auYQoPOM6","title":"0987. 二叉树的垂序遍历","pathname":"/leetcode-solution/medium/987.vertical-order-traversal-of-a-binary-tree","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MTsC3XthN6R5FNNM10q","title":"1004. 最大连续 1 的个数 III","pathname":"/leetcode-solution/medium/1004.max-consecutive-ones-iii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJjODq4i-Y_e5ihKZOy","title":"1011. 在 D 天内送达包裹的能力","pathname":"/leetcode-solution/medium/1011.capacity-to-ship-packages-within-d-days","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJeuQdut8bizknXfFro","title":"1014. 最佳观光组合","pathname":"/leetcode-solution/medium/1014.best-sightseeing-pair","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJeuQdvmj41wuK2YWhg","title":"1015. 可被 K 整除的最小整数","pathname":"/leetcode-solution/medium/1015.smallest-integer-divisible-by-k","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJeuQdwsu9SiAGa1C7-","title":"1019. 链表中的下一个更大节点","pathname":"/leetcode-solution/medium/1019.next-greater-node-in-linked-list","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJeuQdxvcBGCG-0nv0t","title":"1020. 飞地的数量","pathname":"/leetcode-solution/medium/1020.number-of-enclaves","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJeuQdyuU-gfLJsQCG6","title":"1023. 驼峰式匹配","pathname":"/leetcode-solution/medium/1023.camelcase-matching","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJeuQdz4xpSVpmLauzz","title":"1031. 两个非重叠子数组的最大和","pathname":"/leetcode-solution/medium/1031.maximum-sum-of-two-non-overlapping-subarrays","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MV0E_ylrH0vDl7Z5Bg1","title":"1043. 分隔数组以得到最大和","pathname":"/leetcode-solution/medium/1043.partition-array-for-maximum-sum","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"o9yEx6UboqTZ2YM550w5","title":"1053. 交换一次的先前排列)","pathname":"/leetcode-solution/medium/1053.previous-permutation-with-one-swap","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJeuQe-9-fC7gtapfav","title":"1104. 二叉树寻路","pathname":"/leetcode-solution/medium/1104.path-in-zigzag-labelled-binary-tree","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MaOsXC3KzzDBaXMRjra","title":"1129. 颜色交替的最短路径","pathname":"/leetcode-solution/medium/1129.shortest-path-with-alternating-colors","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJeuQe0bY-rBOv2r6Ps","title":"1131.绝对值表达式的最大值","pathname":"/leetcode-solution/medium/1131.maximum-of-absolute-value-expression","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MkzI20Ett3z9fwmexWu","title":"1138. 字母板上的路径","pathname":"/leetcode-solution/medium/1138.alphabet-board-path","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJeuQe19wKdqjcchjgy","title":"1186. 删除一次得到子数组最大和","pathname":"/leetcode-solution/medium/1186.maximum-subarray-sum-with-one-deletion","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJeuQe2O3SMN9UALyMD","title":"1218. 最长定差子序列","pathname":"/leetcode-solution/medium/1218.longest-arithmetic-subsequence-of-given-difference","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJeuQe3mwadgxgjavOs","title":"1227. 飞机座位分配概率","pathname":"/leetcode-solution/medium/1227.airplane-seat-assignment-probability","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJeuQe47AJlLMwzmow6","title":"1261. 在受污染的二叉树中查找元素","pathname":"/leetcode-solution/medium/1261.find-elements-in-a-contaminated-binary-tree","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJeuQe5Bgu36k7Nxku4","title":"1262. 可被三整除的最大和","pathname":"/leetcode-solution/medium/1262.greatest-sum-divisible-by-three","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJeuQe6WSEyHxo9evSN","title":"1297. 子串的最大出现次数","pathname":"/leetcode-solution/medium/1297.maximum-number-of-occurrences-of-a-substring","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJeuQe7d6ujifa0MB17","title":"1310. 子数组异或查询","pathname":"/leetcode-solution/medium/1310.xor-queries-of-a-subarray","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJeuQe8GDmKxsGM8-aW","title":"1334. 阈值距离内邻居最少的城市","pathname":"/leetcode-solution/medium/1334.find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJeuQe9ATn3ijMc6SmN","title":"1371.每个元音包含偶数次的最长子字符串","pathname":"/leetcode-solution/medium/1371.find-the-longest-substring-containing-vowels-in-even-counts","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MPU6YqTCIiSNTQKYgiA","title":"1381. 设计一个支持增量操作的栈","pathname":"/leetcode-solution/medium/1381.design-a-stack-with-increment-operation","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MU3BSuB0LSNmOpupTaJ","title":"1438. 绝对差不超过限制的最长连续子数组","pathname":"/leetcode-solution/medium/1438.longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MPU6YqU7VWZiuNpNYEX","title":"1558. 得到目标数组的最少函数调用次数","pathname":"/leetcode-solution/medium/1558.minimum-numbers-of-function-calls-to-make-target-array","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MPU6YqVSF0Ro5DE0Jfu","title":"1574. 删除最短的子数组使剩余数组有序","pathname":"/leetcode-solution/medium/1574.shortest-subarray-to-be-removed-to-make-array-sorted","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MKsCmPPOsJpIe_7kg6y","title":"1631. 最小体力消耗路径","pathname":"/leetcode-solution/medium/1631.path-with-minimum-effort","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"XbKT04T39MpiL3lLr0j9","title":"1638. 统计只差一个字符的子串数目","pathname":"/leetcode-solution/medium/1638.count-substrings-that-differ-by-one-character","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MO07rpTLqKJbT52OGSS","title":"1658. 将 x 减到 0 的最小操作数","pathname":"/leetcode-solution/medium/1658.minimum-operations-to-reduce-x-to-zero","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MTZyQq_VVD8VWaQAA6d","title":"1697. 检查边长度限制的路径是否存在","pathname":"/leetcode-solution/medium/1697.checking-existence-of-edge-length-limited-paths","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MS7HuEjLJEbZPwJy0En","title":"1737. 满足三条件之一需改变的最少字符数","pathname":"/leetcode-solution/medium/1737.change-minimum-characters-to-satisfy-one-of-three-conditions","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"G0cpwWe4CxCcyN6pr99P","title":"1770. 执行乘法运算的最大分数","pathname":"/leetcode-solution/medium/1770.maximum-score-from-performing-multiplication-operations","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"VORDYxbqVVkHx8pcRTHr","title":"1793. 好子数组的最大分数","pathname":"/leetcode-solution/medium/1793.maximum-score-of-a-good-subarray","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-M_AMk90WruoPQQvptB3","title":"1834. 单线程 CPU","pathname":"/leetcode-solution/medium/1834.single-threaded-cpu","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-McINp2h2FPFAQ05nHp4","title":"1899. 合并若干三元组以形成目标三元组","pathname":"/leetcode-solution/medium/1899.merge-triplets-to-form-target-triplet","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-McrStK54X5TCQrsH7KV","title":"1904. 你完成的完整对局数","pathname":"/leetcode-solution/medium/1904.the-number-of-full-rounds-you-have-played","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-McrPRr_FY3uqhWKd340","title":"1906. 查询差绝对值的最小值","pathname":"/leetcode-solution/medium/1906.minimum-absolute-difference-queries","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"dwhvGLLkD00vp0NWdjYl","title":"2007. 从双倍数组中还原原数组","pathname":"/leetcode-solution/medium/2007.find-original-array-from-doubled-array","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MkSPL7qv78rjj_I4Fww","title":"2008. 出租车的最大盈利","pathname":"/leetcode-solution/medium/2008.maximum-earnings-from-taxi","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"M7a07XoUu1HAglP73rZq","title":"2100. 适合打劫银行的日子","pathname":"/leetcode-solution/medium/5935.find-good-days-to-rob-the-bank","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"FyHkIvS7wo4YJCZV51Vh","title":"2101. 引爆最多的炸弹","pathname":"/leetcode-solution/medium/5936.detonate-the-maximum-bombs","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"vVI682Df4J7khnzZjIqe","title":"2121. 相同元素的间隔之和","pathname":"/leetcode-solution/medium/5965.intervals-between-identical-elements","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"Q6dBSHfoI11Q0VOuAS2j","title":"2207. 字符串中最多数目的子字符串","pathname":"/leetcode-solution/medium/6201.maximize-number-of-subsequences-in-a-string","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"fyA1sQrsXkv8M5SqWKPW","title":"2592. 最大化数组的伟大值","pathname":"/leetcode-solution/medium/2592.maximize-greatness-of-an-array","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"8RlNznwEjtho90fDWK8H","title":"2593. 标记所有元素后数组的分数","pathname":"/leetcode-solution/medium/2593.find-score-of-an-array-after-marking-all-elements","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"1M40ePJY14kUzuecc83g","title":"2817. 限制条件下元素之间的最小绝对差","pathname":"/leetcode-solution/medium/2817.minimum-absolute-difference-between-elements-with-constraint","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"L38TSAACiS9Q6wPh0INe","title":"2865. 美丽塔 I","pathname":"/leetcode-solution/medium/2865.beautiful-towers-i","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"xlik2m4I2pLhB11Fw2BW","title":"2866. 美丽塔 II","pathname":"/leetcode-solution/medium/2866.beautiful-towers-ii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"lUaVMj5e2dQ5mgUzh2Eh","title":"2939. 最大异或乘积","pathname":"/leetcode-solution/medium/2939.maximum-xor-product","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"IiPoJ5FZkMThjn18mOvo","title":"3377. 使两个整数相等的数位操作","pathname":"/leetcode-solution/medium/3377.digit-operations-to-make-two-integers-equal","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"ZUy4TcqDnkEbD5PFufa4","title":"3404. 统计特殊子序列的数目","pathname":"/leetcode-solution/medium/3404.count-special-subsequences","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"BTg7oRDFrnnLghAaNtv8","title":"3428. 至多 K 个子序列的最大和最小和","pathname":"/leetcode-solution/medium/3428.maximum-and-minimum-sums-of-at-most-size-k-subsequences","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"wHjQd3LcN4ubLO7hGwq8","title":"3599. 划分数组以最小化异或值","pathname":"/leetcode-solution/medium/3599.partition-array-to-minimize-xor","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第五章 - 高频考题（中等）"}]},{"id":"-MJfmbbSyJxVbdvaj_Mm","title":"第六章 - 高频考题（困难）","pathname":"/leetcode-solution/hard","siteSpaceId":"sitesp_rDqfs","description":""},{"id":"-MSQpyscDR5F5UPk82F4","title":"LCP 20. 快速公交","pathname":"/leetcode-solution/hard/lcp20.mechtz","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MWNcTrBde7mn54EmRhu","title":"LCP 21. 追逐游戏","pathname":"/leetcode-solution/hard/lcp21.za25ha","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MUHtaRY8l5lOIlN41Uv","title":"Number Stream to Intervals","pathname":"/leetcode-solution/hard/number-stream-to-intervals","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MUr4ksQlKWtDVs89_vp","title":"Triple-Inversion","pathname":"/leetcode-solution/hard/triple-inversion","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MUr4ksRDXp9uENstsza","title":"Kth-Pair-Distance","pathname":"/leetcode-solution/hard/kth-pair-distance","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MUr4ksSzEl615SBjVBu","title":"Minimum-Light-Radius","pathname":"/leetcode-solution/hard/minimum-light-radius","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MX5xe61HHjQxl9Cjzq0","title":"Largest Equivalent Set of Pairs","pathname":"/leetcode-solution/hard/largest-equivalent-set-of-pairs","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-McD-pKGfmgFYsG5qe0P","title":"Ticket-Order.md","pathname":"/leetcode-solution/hard/ticket-order","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-McD-pKHW0YWxa06jknI","title":"Connected-Road-to-Destination","pathname":"/leetcode-solution/hard/connected-road-to-destination","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MJf1okv3tfDca9yUtU1","title":"0004. 寻找两个正序数组的中位数","pathname":"/leetcode-solution/hard/4.median-of-two-sorted-arrays","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MJf1okwiE5G-xlzGy5s","title":"0023. 合并 K 个升序链表","pathname":"/leetcode-solution/hard/23.merge-k-sorted-lists","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MJpDGjzPwXS33fuHe0w","title":"0025. K 个一组翻转链表","pathname":"/leetcode-solution/hard/25.reverse-nodes-in-k-groups","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MJf1okyuE_4K-gXk4nM","title":"0030. 串联所有单词的子串","pathname":"/leetcode-solution/hard/30.substring-with-concatenation-of-all-words","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MJf1okzHKn2q_RS3-yL","title":"0032. 最长有效括号","pathname":"/leetcode-solution/hard/32.longest-valid-parentheses","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MJpwHF9qVF7pBubJU8h","title":"0042. 接雨水","pathname":"/leetcode-solution/hard/42.trapping-rain-water","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MJf1ol0JSs5KLp32NS1","title":"0052. N 皇后 II","pathname":"/leetcode-solution/hard/52.n-queens-ii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MLGs7uArsOOoJWY2Lm_","title":"0057. 插入区间","pathname":"/leetcode-solution/hard/57.insert-interval","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MZght0ceMWRuucKSzkK","title":"0065. 有效数字","pathname":"/leetcode-solution/hard/65.valid-number","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MJf1ol1Xjmj_Y4xqKmU","title":"0084. 柱状图中最大的矩形","pathname":"/leetcode-solution/hard/84.largest-rectangle-in-histogram","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MJf1ol2L9oVT5WG_YH-","title":"0085. 最大矩形","pathname":"/leetcode-solution/hard/85.maximal-rectangle","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MYP1-EvgIqq8sWkpSiV","title":"0087. 扰乱字符串","pathname":"/leetcode-solution/hard/87.scramble-string","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MJf1ol3U80zMfe0x0Cg","title":"0124. 二叉树中的最大路径和","pathname":"/leetcode-solution/hard/124.binary-tree-maximum-path-sum","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MJf1ol4AJ2MpH-D5NM3","title":"0128. 最长连续序列","pathname":"/leetcode-solution/hard/128.longest-consecutive-sequence","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MVFeA2f15b5U1GJS6Of","title":"0132. 分割回文串 II","pathname":"/leetcode-solution/hard/132.palindrome-partitioning-ii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-ML6sMzL6BojfppYZyzj","title":"0140. 单词拆分 II","pathname":"/leetcode-solution/hard/140.word-break-ii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MJf1ol5IgntFqc4ioTN","title":"0145. 二叉树的后序遍历","pathname":"/leetcode-solution/hard/145.binary-tree-postorder-traversal","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MUv630bscl6P1wopsIn","title":"0146. LRU 缓存机制","pathname":"/leetcode-solution/hard/146.lru-cache","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MXq9VJDUHyxL4yskFI0","title":"0154. 寻找旋转排序数组中的最小值 II","pathname":"/leetcode-solution/hard/154.find-minimum-in-rotated-sorted-array-ii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MjhVrVU1N0sOuQqpEs4","title":"0212. 单词搜索 II","pathname":"/leetcode-solution/hard/212.word-search-ii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MJf1ol75zkNuEA3PH7S","title":"0239. 滑动窗口最大值","pathname":"/leetcode-solution/hard/239.sliding-window-maximum","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MJf1ol89s1Qr2Ukqr5p","title":"0295. 数据流的中位数","pathname":"/leetcode-solution/hard/295.find-median-from-data-stream","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MN6kI5xa9JoB0qD2LKJ","title":"0297. 二叉树的序列化与反序列化","pathname":"/leetcode-solution/hard/297.serialize-and-deserialize-binary-tree","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MJf1ol9Ch0AYYq1O3k2","title":"0301. 删除无效的括号","pathname":"/leetcode-solution/hard/301.remove-invalid-parentheses","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MJf1olA_hpBkSNIcL_W","title":"0312. 戳气球","pathname":"/leetcode-solution/hard/312.burst-balloons","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MPiN5XsopkbHhBTu2jU","title":"330. 按要求补齐数组","pathname":"/leetcode-solution/hard/330.patching-array","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MJf1olBDpdReIzOws9x","title":"0335. 路径交叉","pathname":"/leetcode-solution/hard/335.self-crossing","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MJf1olCw63g5TOriEov","title":"0460. LFU 缓存","pathname":"/leetcode-solution/hard/460.lfu-cache","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MJf1olDxp2xhsqT2IHj","title":"0472. 连接词","pathname":"/leetcode-solution/hard/472.concatenated-words","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MS_yWcXZ1xtIAtx29D4","title":"0480. 滑动窗口中位数","pathname":"/leetcode-solution/hard/480.sliding-window-median","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MRNmrxs88S-MFT7PvK6","title":"0483. 最小好进制","pathname":"/leetcode-solution/hard/483.smallest-good-base","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MJf1olEcwzf3Wq_PDA6","title":"0488. 祖玛游戏","pathname":"/leetcode-solution/hard/488.zuma-game","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MJf1olFkktxZEzYxm0r","title":"0493. 翻转对","pathname":"/leetcode-solution/hard/493.reverse-pairs","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MaYQvTEmLg-fYpu63Cg","title":"0664. 奇怪的打印机","pathname":"/leetcode-solution/hard/664.strange-printer","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MSNpAr8hsl__djkB6Vj","title":"0679. 24 点游戏","pathname":"/leetcode-solution/hard/679.24-game","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MS_yWcby05ATXJm-0qq","title":"0715. Range 模块","pathname":"/leetcode-solution/hard/715.range-module","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-Mdr-A30QivtHPchNgVz","title":"0726. 原子的数量","pathname":"/leetcode-solution/hard/726.number-of-atoms","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MPUQibPKuWTQczgKAKp","title":"0768. 最多能完成排序的块 II","pathname":"/leetcode-solution/hard/768.max-chunks-to-make-sorted-ii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MSb5Lz3YjYMT_vev3Fi","title":"0805. 数组的均值分割","pathname":"/leetcode-solution/hard/805.split-array-with-same-average","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MSNN-ZG8s7IKy1Golgu","title":"0839. 相似字符串组","pathname":"/leetcode-solution/hard/839.similar-string-groups","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MJf1olGEwiEZsIew0xA","title":"0887. 鸡蛋掉落","pathname":"/leetcode-solution/hard/887.super-egg-drop","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MJf1olHCSXBMjvag7S_","title":"0895. 最大频率栈","pathname":"/leetcode-solution/hard/895.maximum-frequency-stack","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MS_yWcgTpze9aQUgkmU","title":"0975. 奇偶跳","pathname":"/leetcode-solution/hard/975.odd-even-jump","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MTnJ7MYib29WFRqJm2f","title":"0995. K 连续位的最小翻转次数","pathname":"/leetcode-solution/hard/995.minimum-number-of-k-consecutive-bit-flips","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MJeuQeZ5RK2OXDKkhl0","title":"1032. 字符流","pathname":"/leetcode-solution/hard/1032.stream-of-characters","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MJpDGkTA0WVGliNBB93","title":"1168. 水资源分配优化","pathname":"/leetcode-solution/hard/1168.optimize-water-distribution-in-a-village","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MURbFEyNgboO0KfqGYs","title":"1178. 猜字谜","pathname":"/leetcode-solution/hard/1178.number-of-valid-words-for-each-puzzle","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MS_yWcj7Cf2RH8gTeZY","title":"1203. 项目管理","pathname":"/leetcode-solution/hard/1203.sort-items-by-groups-respecting-dependencies","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MKsqJTd_bay_fgIkIEM","title":"1255. 得分最高的单词集合","pathname":"/leetcode-solution/hard/1255.maximum-score-words-formed-by-letters","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MPhAUaWoeyyIadalypL","title":"1345. 跳跃游戏 IV","pathname":"/leetcode-solution/hard/1435.jump-game-iv","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MJeuQea0pF_Y01-2epo","title":"1449. 数位成本和为目标值的最大数字","pathname":"/leetcode-solution/hard/1449.form-largest-integer-with-digits-that-add-up-to-target","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MT0D8V_U1ZVQCFRzl59","title":"1494. 并行课程 II","pathname":"/leetcode-solution/hard/1494.parallel-courses-ii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MRcPwrZwyCn_ZdcI5Wy","title":"1521. 找到最接近目标值的函数值","pathname":"/leetcode-solution/hard/1521.find-a-value-of-a-mysterious-function-closest-to-target","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MRYEnctA-S5hG5teDPO","title":"1526. 形成目标数组的子数组最少增加次数","pathname":"/leetcode-solution/hard/1526.minimum-number-of-increments-on-subarrays-to-form-a-target-array","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"2j5bgSQ5vpLfLCko0eJW","title":"1639. 通过给定词典构造目标字符串的方案数","pathname":"/leetcode-solution/hard/1639.number-of-ways-to-form-a-target-string-given-a-dictionary","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MR4uO6EDXKmNfzPGLZY","title":"1649. 通过指令创建有序数组","pathname":"/leetcode-solution/hard/1649.create-sorted-array-through-instructions","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MRnyAaKMDWgAtFbT5h9","title":"1671. 得到山形数组的最少删除次数","pathname":"/leetcode-solution/hard/1671.minimum-number-of-removals-to-make-mountain-array","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MPhAUaY2ox-Yz9JofF9","title":"1707. 与数组中元素的最大异或值","pathname":"/leetcode-solution/hard/5640.maximum-xor-with-an-element-from-array","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MdW3FtSNEBlZxpxyIwt","title":"1713. 得到子序列的最少操作次数","pathname":"/leetcode-solution/hard/1713.minimum-operations-to-make-a-subsequence","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-M_A901pHq3K3FEPlb9f","title":"1723. 完成所有工作的最短时间","pathname":"/leetcode-solution/hard/1723.find-minimum-time-to-finish-all-jobs","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MaYQvTbMAKkKP43HNHL","title":"1787. 使所有区间的异或结果为零","pathname":"/leetcode-solution/hard/1787.make-the-xor-of-all-segments-equal-to-zero","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-M_4iR-joiFimhgzSg0o","title":"1835. 所有数对按位与结果的异或和","pathname":"/leetcode-solution/hard/1835.find-xor-sum-of-all-pairs-bitwise-and","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-McmZRMdrhH4z_xnH1r3","title":"1871. 跳跃游戏 VII","pathname":"/leetcode-solution/hard/1871.jump-game-vii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-McSxmls8dAQXZ-KpPOR","title":"1872. 石子游戏 VIII","pathname":"/leetcode-solution/hard/1872.stone-game-viii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MawHm4tUeG_TrqVHpP_","title":"1883. 准时抵达会议现场的最小跳过休息次数","pathname":"/leetcode-solution/hard/5775.minimum-skips-to-arrive-at-meeting-on-time","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MhEZgN3kKohvyJWBCrq","title":"1970. 你能穿过矩阵的最后一天","pathname":"/leetcode-solution/hard/1970.last-day-where-you-can-still-cross","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MkSWbCKu2xWBo13AzRm","title":"2009. 使数组连续的最少操作数","pathname":"/leetcode-solution/hard/2009.minimum-number-of-operations-to-make-array-continuous","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MlQFoiFtNvUQJFRDcC0","title":"2025. 分割数组的最多方案数","pathname":"/leetcode-solution/hard/2025.maximum-number-of-ways-to-partition-an-array","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-Ml9FWOyOWNab_mNu0Z4","title":"2030. 含特定字母的最小子序列","pathname":"/leetcode-solution/hard/2030.smallest-k-length-subsequence-with-occurrences-of-a-letter","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"bQmSaqukRiDmVM8W4wFR","title":"2102. 序列顺序查询","pathname":"/leetcode-solution/hard/2102.sequentially-ordinal-rank-tracker","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"IR8zThsDxH5KrYIIUr18","title":"2141. 同时运行 N 台电脑的最长时间","pathname":"/leetcode-solution/hard/2141.maximum-running-time-of-n-computers","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"PRtgrg4sKUslwCnNy53R","title":"2179. 统计数组中好三元组数目 👍","pathname":"/leetcode-solution/hard/2179.-tong-ji-shu-zu-zhong-hao-san-yuan-zu-shu-mu","siteSpaceId":"sitesp_rDqfs","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"CRpkYi9KfL7XFwUCFqSF","title":"2209. 用地毯覆盖后的最少白色砖块","pathname":"/leetcode-solution/hard/2209.minimum-white-tiles-after-covering-with-carpets","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"aFE2F9cfR1NtPu5AYuL5","title":"2281.sum-of-total-strength-of-wizards","pathname":"/leetcode-solution/hard/2281.sum-of-total-strength-of-wizards","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"DI2GAkptdgcTYRB0XbrT","title":"2306. 公司命名","pathname":"/leetcode-solution/hard/2306.naming-a-company","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"1T9IbgDFElXU9y0MrPnX","title":"2312. 卖木头块","pathname":"/leetcode-solution/hard/2312.selling-pieces-of-wood","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"LyVeRRVuwzhawbRXt5Yh","title":"2842. 统计一个字符串的 k 子序列美丽值最大的数目","pathname":"/leetcode-solution/hard/2842.count-k-subsequences-of-a-string-with-maximum-beauty","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"aTnhF2Oh4cL2U0BUCVJ0","title":"2972. 统计移除递增子数组的数目 II","pathname":"/leetcode-solution/hard/2972.count-the-number-of-incremovable-subarrays-ii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"dStX6VirtmAyioBd9f3P","title":"3027. 人员站位的方案数 II","pathname":"/leetcode-solution/hard/3027.find-the-number-of-ways-to-place-people-ii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"fcWOzRZ0pX6iH1AEih9C","title":"3041. 修改数组后最大化数组中的连续元素数目","pathname":"/leetcode-solution/hard/3041.maximize-consecutive-elements-in-an-array-after-modification","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"A53D7HiD9UN7vrI7qRjZ","title":"3082. 求出所有子序列的能量和","pathname":"/leetcode-solution/hard/3082.find-the-sum-of-the-power-of-all-subsequences","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"ySXYN0KC4VNhNr9hs5oo","title":"3108. 带权图里旅途的最小代价","pathname":"/leetcode-solution/hard/3108.minimum-cost-walk-in-weighted-graph","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"N1h1MGmQXBhYDf4404zK","title":"3347. 执行操作后元素的最高频率 II","pathname":"/leetcode-solution/hard/3347.maximum-frequency-of-an-element-after-performing-operations-ii","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"iSs5TPOZsyF8IdEyHDid","title":"3336. 最大公约数相等的子序列数量","pathname":"/leetcode-solution/hard/3336.find-the-number-of-subsequences-with-equal-gcd","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"LQnqDxWaPImVRzv9amHy","title":"3410. 删除所有值为某个元素后的最大子数组和","pathname":"/leetcode-solution/hard/3410.maximize-subarray-sum-after-removing-all-occurrences-of-one-element","siteSpaceId":"sitesp_rDqfs","description":"","breadcrumbs":[{"label":"第六章 - 高频考题（困难）"}]},{"id":"-MJpwHFWbiV2qtWHYoNH","title":"后序","pathname":"/leetcode-solution/epilogue","siteSpaceId":"sitesp_rDqfs","description":""}]}