diff --git a/.github/workflows/sync.yml b/.github/workflows/sync.yml index 1d044f31..343e7cf5 100644 --- a/.github/workflows/sync.yml +++ b/.github/workflows/sync.yml @@ -14,5 +14,5 @@ jobs: env: SSH_PRIVATE_KEY: ${{ secrets.SYNC_GITEE_PRI_KEY }} with: - source-repo: "git@github.com:itcharge/LeetCode-Py.git" - destination-repo: "git@gitee.com:itcharge/LeetCode-Py.git" + source-repo: "git@github.com:itcharge/AlgoNote.git" + destination-repo: "git@gitee.com:itcharge/AlgoNote.git" diff --git a/Assets/Images/algo-book-contents.png b/Assets/Images/algo-book-contents.png deleted file mode 100644 index 7c30a25d..00000000 Binary files a/Assets/Images/algo-book-contents.png and /dev/null differ diff --git a/Assets/Images/algo-book-dark.png b/Assets/Images/algo-book-dark.png deleted file mode 100644 index d5d39abf..00000000 Binary files a/Assets/Images/algo-book-dark.png and /dev/null differ diff --git a/Assets/Images/algo-book-light.png b/Assets/Images/algo-book-light.png deleted file mode 100644 index 6bfc6191..00000000 Binary files a/Assets/Images/algo-book-light.png and /dev/null differ diff --git a/Assets/Images/itcharge-qr-code.png b/Assets/Images/itcharge-qr-code.png deleted file mode 100644 index 10af1597..00000000 Binary files a/Assets/Images/itcharge-qr-code.png and /dev/null differ diff --git a/Assets/Origins/Categories-List.md b/Assets/Origins/Categories-List.md deleted file mode 100644 index 4b27c52e..00000000 --- a/Assets/Origins/Categories-List.md +++ /dev/null @@ -1,338 +0,0 @@ -## 01. 数组 - -### [数组基础题目](../../Contents/01.Array/01.Array-Basic/02.Array-Basic-List.md) - -#### 数组操作题目 - -###### 0189. 轮转数组、0066. 加一、0724. 寻找数组的中心下标、0485. 最大连续 1 的个数、0238. 除自身以外数组的乘积 - -#### 二维数组题目 - -###### 0498. 对角线遍历、0048. 旋转图像、0073. 矩阵置零、0054. 螺旋矩阵、0059. 螺旋矩阵 II、0289. 生命游戏 - -### [排序算法题目](../../Contents/01.Array/02.Array-Sort/11.Array-Sort-List.md) - -#### 冒泡排序题目 - -###### 剑指 Offer 45. 把数组排成最小的数、0283. 移动零 - -#### 选择排序题目 - -###### 0215. 数组中的第K个最大元素 - -#### 插入排序题目 - -###### 0075. 颜色分类 - -#### 希尔排序题目 - -###### 0912. 排序数组、0506. 相对名次 - -#### 归并排序题目 - -###### 0912. 排序数组、0088. 合并两个有序数组、剑指 Offer 51. 数组中的逆序对、0315. 计算右侧小于当前元素的个数 - -#### 快速排序题目 - -###### 0912. 排序数组、0169. 多数元素 - -#### 堆排序题目 - -###### 0912. 排序数组、0215. 数组中的第K个最大元素、剑指 Offer 40. 最小的k个数 - -#### 计数排序题目 - -###### 0912. 排序数组、1122. 数组的相对排序 - -#### 桶排序题目 - -###### 0912. 排序数组、0220. 存在重复元素 III、0164. 最大间距 - -#### 基数排序题目 - -###### 0164. 最大间距、0561. 数组拆分 - -#### 其他排序题目 - -###### 0217. 存在重复元素、0136. 只出现一次的数字、0056. 合并区间、0179. 最大数、0384. 打乱数组、剑指 Offer 45. 把数组排成最小的数 - - -### [二分查找题目](../../Contents/01.Array/03.Array-Binary-Search/03.Array-Binary-Search-List.md) - -#### 二分下标题目 - -###### 0704. 二分查找、0374. 猜数字大小、0035. 搜索插入位置、0034. 在排序数组中查找元素的第一个和最后一个位置、0167. 两数之和 II - 输入有序数组、0153. 寻找旋转排序数组中的最小值、0154. 寻找旋转排序数组中的最小值 II、0033. 搜索旋转排序数组、0081. 搜索旋转排序数组 II、0278. 第一个错误的版本、0162. 寻找峰值、0852. 山脉数组的峰顶索引、1095. 山脉数组中查找目标值、0744. 寻找比目标字母大的最小字母、0004. 寻找两个正序数组的中位数、0074. 搜索二维矩阵、0240. 搜索二维矩阵 II - -#### 二分答案题目 - -###### 0069. x 的平方根、0287. 寻找重复数、0050. Pow(x, n)、0367. 有效的完全平方数、1300. 转变数组后最接近目标值的数组和、0400. 第 N 位数字 - -#### 复杂的二分查找问题 - -###### 0875. 爱吃香蕉的珂珂、0410. 分割数组的最大值、0209. 长度最小的子数组、0658. 找到 K 个最接近的元素、0270. 最接近的二叉搜索树值、0702. 搜索长度未知的有序数组、0349. 两个数组的交集、0350. 两个数组的交集 II、0287. 寻找重复数、0719. 找出第 K 小的数对距离、0259. 较小的三数之和、1011. 在 D 天内送达包裹的能力、1482. 制作 m 束花所需的最少天数 - -### [双指针题目](../../Contents/01.Array/04.Array-Two-Pointers/02.Array-Two-Pointers-List.md) - -#### 对撞指针题目 - -###### 0167. 两数之和 II - 输入有序数组、0344. 反转字符串、0345. 反转字符串中的元音字母、0125. 验证回文串、0011. 盛最多水的容器、0611. 有效三角形的个数、0015. 三数之和、0016. 最接近的三数之和、0018. 四数之和、0259. 较小的三数之和、0658. 找到 K 个最接近的元素、1099. 小于 K 的两数之和、0075. 颜色分类、0360. 有序转化数组、0977. 有序数组的平方、0881. 救生艇、0042. 接雨水、0443. 压缩字符串 - -#### 快慢指针题目 - -###### 0026. 删除有序数组中的重复项、0080. 删除有序数组中的重复项 II、0027. 移除元素、0283. 移动零、0845. 数组中的最长山脉、0088. 合并两个有序数组、0719. 找出第 K 小的数对距离、0334. 递增的三元子序列、0978. 最长湍流子数组、剑指 Offer 21. 调整数组顺序使奇数位于偶数前面 - -#### 分离双指针题目 - -###### 0350. 两个数组的交集 II、0925. 长按键入、0844. 比较含退格的字符串、1229. 安排会议日程、0415. 字符串相加、0392. 判断子序列 - -### [滑动窗口题目](../../Contents/01.Array/05.Array-Sliding-Window/02.Array-Sliding-Window-List.md) - -#### 固定长度窗口题目 - -###### 1343. 大小为 K 且平均值大于等于阈值的子数组数目、0643. 子数组最大平均数 I、1052. 爱生气的书店老板、1423. 可获得的最大点数、1456. 定长子串中元音的最大数目、0567. 字符串的排列、1100. 长度为 K 的无重复字符子串、1151. 最少交换次数来组合所有的 1、1176. 健身计划评估、0438. 找到字符串中所有字母异位词、0995. K 连续位的最小翻转次数、0683. K 个关闭的灯泡、0220. 存在重复元素 III、0239. 滑动窗口最大值、0480. 滑动窗口中位数 - -#### 不定长度窗口题目 - -###### 0674. 最长连续递增序列、0485. 最大连续 1 的个数、0487. 最大连续1的个数 II、0076. 最小覆盖子串、0718. 最长重复子数组、0209. 长度最小的子数组、1004. 最大连续1的个数 III、1658. 将 x 减到 0 的最小操作数、0424. 替换后的最长重复字符、0003. 无重复字符的最长子串、1695. 删除子数组的最大得分、1208. 尽可能使字符串相等、1493. 删掉一个元素以后全为 1 的最长子数组、0727. 最小窗口子序列、0159. 至多包含两个不同字符的最长子串、0340. 至多包含 K 个不同字符的最长子串、0795. 区间子数组个数、0992. K 个不同整数的子数组、0713. 乘积小于 K 的子数组、0904. 水果成篮、1358. 包含所有三种字符的子字符串数目、0467. 环绕字符串中唯一的子字符串、1438. 绝对差不超过限制的最长连续子数组 - -## 02. 链表 - -### [链表经典题目](../../Contents/02.Linked-List/01.Linked-List-Basic/02.Linked-List-Basic-List.md) - -###### 0707. 设计链表、0083. 删除排序链表中的重复元素、0082. 删除排序链表中的重复元素 II、0206. 反转链表、0092. 反转链表 II、0025. K 个一组翻转链表、0203. 移除链表元素、0328. 奇偶链表、0234. 回文链表、0430. 扁平化多级双向链表、0138. 复制带随机指针的链表、0061. 旋转链表 - -### [链表排序题目](../../Contents/02.Linked-List/02.Linked-List-Sort/02.Linked-List-Sort-List.md) - -###### 0148. 排序链表、0021. 合并两个有序链表、0023. 合并 K 个升序链表、0147. 对链表进行插入排序 - -### [链表双指针题目](../../Contents/02.Linked-List/03.Linked-List-Two-Pointers/02.Linked-List-Two-Pointers-List.md) - -###### 0141. 环形链表、0142. 环形链表 II、0160. 相交链表、0019. 删除链表的倒数第 N 个结点、0876. 链表的中间结点、剑指 Offer 22. 链表中倒数第k个节点、0143. 重排链表、0002. 两数相加、0445. 两数相加 II - -## 03. 堆栈 - -### [堆栈基础题目](../../Contents/03.Stack/01.Stack-Basic/02.Stack-Basic-List.md) - -###### 1047. 删除字符串中的所有相邻重复项、0155. 最小栈、0020. 有效的括号、0227. 基本计算器 II、0739. 每日温度、0150. 逆波兰表达式求值、0232. 用栈实现队列、剑指 Offer 09. 用两个栈实现队列、0394. 字符串解码、0032. 最长有效括号、0946. 验证栈序列、剑指 Offer 06. 从尾到头打印链表、0071. 简化路径 - -### [单调栈](../../Contents/03.Stack/02.Monotone-Stack/02.Monotone-Stack-List.md) - -###### 0739. 每日温度、0496. 下一个更大元素 I、0503. 下一个更大元素 II、0901. 股票价格跨度、0084. 柱状图中最大的矩形、0316. 去除重复字母、0042. 接雨水、0085. 最大矩形、0862. 和至少为 K 的最短子数组 - -## 04. 队列 - -### [队列基础题目](../../Contents/04.Queue/01.Queue-Basic/02.Queue-Basic-List.md) - -###### 0622. 设计循环队列、0346. 数据流中的移动平均值、0225. 用队列实现栈 - -### [优先队列题目](../../Contents/04.Queue/02.Priority-Queue/02.Priority-Queue-List.md) - -###### 0703. 数据流中的第 K 大元素、0347. 前 K 个高频元素、0451. 根据字符出现频率排序、0973. 最接近原点的 K 个点、1296. 划分数组为连续数字的集合、0239. 滑动窗口最大值、0295. 数据流的中位数、0023. 合并 K 个升序链表、0218. 天际线问题 - -## 05. 哈希表 - -### [哈希表题目](../../Contents/05.Hash-Table/02.Hash-Table-List.md) - -###### 0705. 设计哈希集合、0706. 设计哈希映射、0217. 存在重复元素、0219. 存在重复元素 II、0220. 存在重复元素 III、1941. 检查是否所有字符出现次数相同、0136. 只出现一次的数字、0383. 赎金信、0349. 两个数组的交集、0350. 两个数组的交集 II、0036. 有效的数独、0001. 两数之和、0015. 三数之和、0018. 四数之和、0454. 四数相加 II、0041. 缺失的第一个正数、0128. 最长连续序列、0202. 快乐数、0242. 有效的字母异位词、0205. 同构字符串、0442. 数组中重复的数据、剑指 Offer 61. 扑克牌中的顺子、0268. 丢失的数字、剑指 Offer 03. 数组中重复的数字、0451. 根据字符出现频率排序、0049. 字母异位词分组、0599. 两个列表的最小索引总和、0387. 字符串中的第一个唯一字符、0447. 回旋镖的数量、0149. 直线上最多的点数、0359. 日志速率限制器、0811. 子域名访问计数 - -## 06. 字符串 - -### [字符串基础题目](../../Contents/06.String/01.String-Basic/02.String-Basic-List.md) - -###### 0125. 验证回文串、0005. 最长回文子串、0003. 无重复字符的最长子串、0344. 反转字符串、0557. 反转字符串中的单词 III、0049. 字母异位词分组、0415. 字符串相加、0151. 反转字符串中的单词、0043. 字符串相乘、0014. 最长公共前缀 - -### [单模式串匹配题目](../../Contents/06.String/02.String-Single-Pattern-Matching/07.String-Single-Pattern-Matching-List.md) - -###### 0028. 找出字符串中第一个匹配项的下标、0459. 重复的子字符串、0686. 重复叠加字符串匹配、1668. 最大重复子字符串、0796. 旋转字符串、1408. 数组中的字符串匹配、2156. 查找给定哈希值的子串 - -### [字典树题目](../../Contents/06.String/03.String-Multi-Pattern-Matching/02.Trie-List.md) - -###### 0208. 实现 Trie (前缀树)、0677. 键值映射、0648. 单词替换、0642. 设计搜索自动补全系统、0211. 添加与搜索单词 - 数据结构设计、0421. 数组中两个数的最大异或值、0212. 单词搜索 II、0425. 单词方块、0336. 回文对、1023. 驼峰式匹配、0676. 实现一个魔法字典、0440. 字典序的第K小数字 - -## 07. 树 - -### [二叉树的遍历题目](../../Contents/07.Tree/01.Binary-Tree/03.Binary-Tree-Traverse-List.md) - -###### 0144. 二叉树的前序遍历、0094. 二叉树的中序遍历、0145. 二叉树的后序遍历、0102. 二叉树的层序遍历、0103. 二叉树的锯齿形层序遍历、0107. 二叉树的层序遍历 II、0104. 二叉树的最大深度、0111. 二叉树的最小深度、0124. 二叉树中的最大路径和、0101. 对称二叉树、0112. 路径总和、0113. 路径总和 II、0236. 二叉树的最近公共祖先、0199. 二叉树的右视图、0226. 翻转二叉树、0958. 二叉树的完全性检验、0572. 另一棵树的子树、0100. 相同的树、0116. 填充每个节点的下一个右侧节点指针、0117. 填充每个节点的下一个右侧节点指针 II、0297. 二叉树的序列化与反序列化、0114. 二叉树展开为链表 - -### [二叉树的还原题目](../../Contents/07.Tree/01.Binary-Tree/05.Binary-Tree-Reduction-List.md) - -###### 0105. 从前序与中序遍历序列构造二叉树、0106. 从中序与后序遍历序列构造二叉树、0889. 根据前序和后序遍历构造二叉树 - -### [二叉搜索树题目](../../Contents/07.Tree/02.Binary-Search-Tree/02.Binary-Search-Tree-List.md) - -###### 0098. 验证二叉搜索树、0173. 二叉搜索树迭代器、0700. 二叉搜索树中的搜索、0701. 二叉搜索树中的插入操作、0450. 删除二叉搜索树中的节点、0703. 数据流中的第 K 大元素、剑指 Offer 54. 二叉搜索树的第k大节点、0230. 二叉搜索树中第K小的元素、0235. 二叉搜索树的最近公共祖先、0426. 将二叉搜索树转化为排序的双向链表、0108. 将有序数组转换为二叉搜索树、0110. 平衡二叉树 - -### [线段树题目](../../Contents/07.Tree/03.Segment-Tree/02.Segment-Tree-List.md) - -#### 单点更新题目 - -###### 0303. 区域和检索 - 数组不可变、0307. 区域和检索 - 数组可修改、0354. 俄罗斯套娃信封问题 - -#### 区间更新题目 - -###### 0370. 区间加法、1109. 航班预订统计、1450. 在既定时间做作业的学生人数、0673. 最长递增子序列的个数、1310. 子数组异或查询、1851. 包含每个查询的最小区间 - -#### 区间合并题目 - -###### 0729. 我的日程安排表 I、0731. 我的日程安排表 II、0732. 我的日程安排表 III - -#### 扫描线问题 - -###### 0218. 天际线问题、0391. 完美矩形、0850. 矩形面积 II - -### [树状数组题目](../../Contents/07.Tree/04.Binary-Indexed-Tree/02.Binary-Indexed-Tree-List.md) - -###### 0303. 区域和检索 - 数组不可变、0307. 区域和检索 - 数组可修改、0315. 计算右侧小于当前元素的个数、1450. 在既定时间做作业的学生人数、0354. 俄罗斯套娃信封问题、0673. 最长递增子序列的个数、1310. 子数组异或查询、1893. 检查是否区域内所有整数都被覆盖 - -### [并查集题目](../../Contents/07.Tree/05.Union-Find/02.Union-Find-List.md) - -###### 0990. 等式方程的可满足性、0547. 省份数量、0684. 冗余连接、1319. 连通网络的操作次数、0765. 情侣牵手、0399. 除法求值、0959. 由斜杠划分区域、1631. 最小体力消耗路径、0778. 水位上升的泳池中游泳、1202. 交换字符串中的元素、0947. 移除最多的同行或同列石头、0803. 打砖块、0128. 最长连续序列 - -## 08. 图论 - -### [图的深度优先搜索题目](../../Contents/08.Graph/02.Graph-Traversal/02.Graph-DFS-List.md) - -###### 0797. 所有可能的路径、0200. 岛屿数量、0695. 岛屿的最大面积、0133. 克隆图、0494. 目标和、0144. 二叉树的前序遍历、0094. 二叉树的中序遍历、0145. 二叉树的后序遍历、0589. N 叉树的前序遍历、0590. N 叉树的后序遍历、0124. 二叉树中的最大路径和、0199. 二叉树的右视图、0543. 二叉树的直径、0662. 二叉树最大宽度、0958. 二叉树的完全性检验、0572. 另一棵树的子树、0100. 相同的树、0111. 二叉树的最小深度、0841. 钥匙和房间、0129. 求根节点到叶节点数字之和、0323. 无向图中连通分量的数目、0684. 冗余连接、0802. 找到最终的安全状态、0785. 判断二分图、0886. 可能的二分法、0323. 无向图中连通分量的数目、0130. 被围绕的区域、0417. 太平洋大西洋水流问题、1020. 飞地的数量、1254. 统计封闭岛屿的数目、1034. 边界着色、剑指 Offer 13. 机器人的运动范围、0529. 扫雷游戏 - -### [图的广度优先搜索题目](../../Contents/08.Graph/02.Graph-Traversal/04.Graph-BFS-List.md) - -###### 0797. 所有可能的路径、0286. 墙与门、0200. 岛屿数量、0752. 打开转盘锁、0279. 完全平方数、0133. 克隆图、0733. 图像渲染、0542. 01 矩阵、0322. 零钱兑换、0323. 无向图中连通分量的数目、剑指 Offer 13. 机器人的运动范围、0199. 二叉树的右视图、0662. 二叉树最大宽度、0958. 二叉树的完全性检验、0572. 另一棵树的子树、0100. 相同的树、0111. 二叉树的最小深度、剑指 Offer 32 - III. 从上到下打印二叉树 III - -### [图的拓扑排序题目](../../Contents/08.Graph/02.Graph-Traversal/06.Graph-Topological-Sorting-List.md) - -###### 0207. 课程表、0210. 课程表 II、1136. 并行课程、2050. 并行课程 III、0802. 找到最终的安全状态、0851. 喧闹和富有 - -### [图的最小生成树题目](../../Contents/08.Graph/03.Graph-Spanning-Tree/02.Graph-Minimum-Spanning-Tree-List.md) - -###### 1584. 连接所有点的最小费用、1631. 最小体力消耗路径、0778. 水位上升的泳池中游泳 - -### [单源最短路径题目](../../Contents/08.Graph/04.Graph-Shortest-Path/03.Graph-Single-Source-Shortest-Path-List.md) - -###### 0407. 接雨水 II、0743. 网络延迟时间、0787. K 站中转内最便宜的航班、1631. 最小体力消耗路径、1786. 从第一个节点出发到最后一个节点的受限路径数 - -### [多源最短路径题目](../../Contents/08.Graph/04.Graph-Shortest-Path/05.Graph-Multi-Source-Shortest-Path-List.md) - -###### 0815. 公交路线、1162. 地图分析 - -### [次短路径题目](../../Contents/08.Graph/04.Graph-Shortest-Path/07.Graph-The-Second-Shortest-Path-List.md) - -###### 2045. 到达目的地的第二短时间 - -### [差分约束系统](../../Contents/08.Graph/04.Graph-Shortest-Path/09.Graph-System-Of-Difference-Constraints-List.md) - -###### 0995. K 连续位的最小翻转次数、1109. 航班预订统计 - -### [二分图基础题目](../../Contents/08.Graph/05.Graph-Bipartite/02.Graph-Bipartite-Basic-List.md) - -###### 0785. 判断二分图 - -### [二分图最大匹配题目](../../Contents/08.Graph/05.Graph-Bipartite/06.Graph-Bipartite-Matching-List.md) - -###### LCP 04. 覆盖、1947. 最大兼容性评分和、1595. 连通两组点的最小成本 - -## 09. 基础算法 - -### [枚举算法题目](../../Contents/09.Algorithm-Base/01.Enumeration-Algorithm/02.Enumeration-Algorithm-List.md) - -###### 0001. 两数之和、0204. 计数质数、1925. 统计平方和三元组的数目、1450. 在既定时间做作业的学生人数、1620. 网络信号最好的坐标、剑指 Offer 57 - II. 和为s的连续正数序列、0800. 相似 RGB 颜色、0221. 最大正方形、0560. 和为 K 的子数组 - -### [递归算法题目](../../Contents/09.Algorithm-Base/02.Recursive-Algorithm/02.Recursive-Algorithm-List.md) - -###### 0344. 反转字符串、0024. 两两交换链表中的节点、0118. 杨辉三角、0119. 杨辉三角 II、0206. 反转链表、0092. 反转链表 II、0021. 合并两个有序链表、0509. 斐波那契数、0070. 爬楼梯、0104. 二叉树的最大深度、0124. 二叉树中的最大路径和、0226. 翻转二叉树、0050. Pow(x, n)、0779. 第K个语法符号、0095. 不同的二叉搜索树 II、剑指 Offer 62. 圆圈中最后剩下的数字 - -### [分治算法题目](../../Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/02.Divide-And-Conquer-Algorithm-List.md) - -###### 0004. 寻找两个正序数组的中位数、0023. 合并 K 个升序链表、0053. 最大子数组和、0241. 为运算表达式设计优先级、0169. 多数元素、0050. Pow(x, n)、0014. 最长公共前缀、剑指 Offer 33. 二叉搜索树的后序遍历序列 - -### [回溯算法题目](../../Contents/09.Algorithm-Base/04.Backtracking-Algorithm/02.Backtracking-Algorithm-List.md) - -###### 0046. 全排列、0047. 全排列 II、0037. 解数独、0022. 括号生成、0017. 电话号码的字母组合、0784. 字母大小写全排列、0039. 组合总和、0040. 组合总和 II、0078. 子集、0090. 子集 II、0473. 火柴拼正方形、1593. 拆分字符串使唯一子字符串的数目最大、1079. 活字印刷、0093. 复原 IP 地址、0079. 单词搜索、0679. 24 点游戏 - -### [贪心算法题目](../../Contents/09.Algorithm-Base/05.Greedy-Algorithm/02.Greedy-Algorithm-List.md) - -###### 0455. 分发饼干、0860. 柠檬水找零、0056. 合并区间、0435. 无重叠区间、0452. 用最少数量的箭引爆气球、0055. 跳跃游戏、0045. 跳跃游戏 II、0122. 买卖股票的最佳时机 II、0561. 数组拆分、1710. 卡车上的最大单元数、1217. 玩筹码、1247. 交换字符使得字符串相同、1400. 构造 K 个回文字符串、0921. 使括号有效的最少添加、1029. 两地调度、1605. 给定行和列的和求可行矩阵、0135. 分发糖果、0134. 加油站、0053. 最大子数组和、0376. 摆动序列、0738. 单调递增的数字、0402. 移掉 K 位数字、0861. 翻转矩阵后的得分、0670. 最大交换 - -### [位运算题目](../../Contents/09.Algorithm-Base/06.Bit-Operation/02.Bit-Operation-List.md) - -###### 0504. 七进制数、0405. 数字转换为十六进制数、0190. 颠倒二进制位、1009. 十进制整数的反码、0191. 位1的个数、0371. 两整数之和、0089. 格雷编码、0201. 数字范围按位与、0338. 比特位计数、0136. 只出现一次的数字、0137. 只出现一次的数字 II、0260. 只出现一次的数字 III、0268. 丢失的数字、1349. 参加考试的最大学生数、0645. 错误的集合、0078. 子集、0090. 子集 II - -## 10. 动态规划 - -### [动态规划基础题目](../../Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/02.Dynamic-Programming-Basic-List.md) - -###### 0509. 斐波那契数、0070. 爬楼梯、0062. 不同路径 - -### [记忆化搜索题目](../../Contents/10.Dynamic-Programming/02.Memoization/02.Memoization-List.md) - -###### 1137. 第 N 个泰波那契数、0375. 猜数字大小 II、0494. 目标和、0576. 出界的路径数、0087. 扰乱字符串、0403. 青蛙过河、0552. 学生出勤记录 II、0913. 猫和老鼠、0329. 矩阵中的最长递增路径 - -### [线性 DP 题目](../../Contents/10.Dynamic-Programming/03.Linear-DP/03.Linear-DP-List.md) - -#### 单串线性 DP 问题 - -###### 0300. 最长递增子序列、0673. 最长递增子序列的个数、0354. 俄罗斯套娃信封问题、0053. 最大子数组和、0152. 乘积最大子数组、0918. 环形子数组的最大和、0198. 打家劫舍、0213. 打家劫舍 II、0740. 删除并获得点数、1388. 3n 块披萨、0873. 最长的斐波那契子序列的长度、1027. 最长等差数列、1055. 形成字符串的最短路径、0368. 最大整除子集、0032. 最长有效括号、0413. 等差数列划分、0091. 解码方法、0639. 解码方法 II、0132. 分割回文串 II、1220. 统计元音字母序列的数目、0338. 比特位计数、0801. 使序列递增的最小交换次数、0871. 最低加油次数、0045. 跳跃游戏 II、0813. 最大平均值和的分组、0887. 鸡蛋掉落、0256. 粉刷房子、0265. 粉刷房子 II、1473. 粉刷房子 III、0975. 奇偶跳、0403. 青蛙过河、1478. 安排邮筒、1230. 抛掷硬币、0410. 分割数组的最大值、1751. 最多可以参加的会议数目 II、1787. 使所有区间的异或结果为零、0121. 买卖股票的最佳时机、0122. 买卖股票的最佳时机 II、0123. 买卖股票的最佳时机 III、0188. 买卖股票的最佳时机 IV、0309. 最佳买卖股票时机含冷冻期、0714. 买卖股票的最佳时机含手续费 - -#### 双串线性 DP 问题 - -###### 1143. 最长公共子序列、0712. 两个字符串的最小ASCII删除和、0718. 最长重复子数组、0583. 两个字符串的删除操作、0072. 编辑距离、0044. 通配符匹配、0010. 正则表达式匹配、0097. 交错字符串、0115. 不同的子序列、0087. 扰乱字符串 - -#### 矩阵线性 DP 问题 - -###### 0118. 杨辉三角、0119. 杨辉三角 II、0120. 三角形最小路径和、0064. 最小路径和、0174. 地下城游戏、0221. 最大正方形、0931. 下降路径最小和、0576. 出界的路径数、0085. 最大矩形、0363. 矩形区域不超过 K 的最大数值和、面试题 17.24. 最大子矩阵、1444. 切披萨的方案数 - -#### 无串线性 DP 问题 - -###### 1137. 第 N 个泰波那契数、0650. 只有两个键的键盘、0264. 丑数 II、0279. 完全平方数、0343. 整数拆分 - -### [背包问题题目](../../Contents/10.Dynamic-Programming/04.Knapsack-Problem/06.Knapsack-Problem-List.md) - -#### 0-1 背包问题 - -###### 0416. 分割等和子集、0494. 目标和、1049. 最后一块石头的重量 II - -#### 完全背包问题 - -###### 0279. 完全平方数、0322. 零钱兑换、0518. 零钱兑换 II、0139. 单词拆分、0377. 组合总和 Ⅳ、0638. 大礼包、1449. 数位成本和为目标值的最大数字 - -#### 多重背包问题 - -#### 分组背包问题 - -###### 1155. 掷骰子等于目标和的方法数、2585. 获得分数的方法数 - -#### 多维背包问题 - -###### 0474. 一和零、0879. 盈利计划、1995. 统计特殊四元组 - -### [区间 DP 题目](../../Contents/10.Dynamic-Programming/05.Interval-DP/02.Interval-DP-List.md) - -###### 0486. 预测赢家、0312. 戳气球、0877. 石子游戏、1000. 合并石头的最低成本、1547. 切棍子的最小成本、0664. 奇怪的打印机、1039. 多边形三角剖分的最低得分、0546. 移除盒子、0375. 猜数字大小 II、0678. 有效的括号字符串、0005. 最长回文子串、0516. 最长回文子序列、0730. 统计不同回文子序列、2104. 子数组范围和 - -### [树形 DP 题目](../../Contents/10.Dynamic-Programming/06.Tree-DP/02.Tree-DP-List.md) - -#### 固定根的树形 DP 题目 - -###### 0543. 二叉树的直径、0124. 二叉树中的最大路径和、1245. 树的直径、2246. 相邻字符不同的最长路径、0687. 最长同值路径、0337. 打家劫舍 III、0333. 最大 BST 子树、1617. 统计子树中城市之间最大距离、2538. 最大价值和与最小价值和的差值、1569. 将子数组重新排序得到同一个二叉搜索树的方案数、1372. 二叉树中的最长交错路径、1373. 二叉搜索子树的最大键值和、0968. 监控二叉树、1273. 删除树节点、1519. 子树中标签相同的节点数 - -#### 不定根的树形 DP 题目 - -###### 0310. 最小高度树、0834. 树中距离之和、2581. 统计可能的树根数目 - -### [状态压缩 DP 题目](../../Contents/10.Dynamic-Programming/07.State-DP/02.State-DP-List.md) - -###### 1879. 两个数组最小的异或值之和、2172. 数组的最大与和、1947. 最大兼容性评分和、1595. 连通两组点的最小成本、1494. 并行课程 II、1655. 分配重复整数、1986. 完成任务的最少工作时间段、1434. 每个人戴不同帽子的方案数、1799. N 次操作后的最大分数和、1681. 最小不兼容性、0526. 优美的排列、0351. 安卓系统手势解锁、0464. 我能赢吗、0847. 访问所有节点的最短路径、0638. 大礼包、1994. 好子集的数目、1349. 参加考试的最大学生数、0698. 划分为k个相等的子集、0943. 最短超级串、0691. 贴纸拼词、0982. 按位与为零的三元组 - -### [计数 DP 题目](../../Contents/10.Dynamic-Programming/08.Counting-DP/02.Counting-DP-List.md) - -###### 0062. 不同路径、0063. 不同路径 II、0343. 整数拆分、0096. 不同的二叉搜索树、1259. 不相交的握手、0790. 多米诺和托米诺平铺、0070. 爬楼梯、0746. 使用最小花费爬楼梯、0509. 斐波那契数、1137. 第 N 个泰波那契数 - -### [数位 DP 题目](../../Contents/10.Dynamic-Programming/09.Digit-DP/02.Digit-DP-List.md) - -###### 2376. 统计特殊整数、0357. 统计各位数字都不同的数字个数、1012. 至少有 1 位重复的数字、0902. 最大为 N 的数字组合、0788. 旋转数字、0600. 不含连续1的非负整数、0233. 数字 1 的个数、2719. 统计整数数目、0248. 中心对称数 III、1088. 易混淆数 II、1067. 范围内的数字计数、1742. 盒子中小球的最大数量、面试题 17.06. 2出现的次数 - -### [概率 DP 题目](../../Contents/10.Dynamic-Programming/10.Probability-DP/02.Probability-DP-List.md) - -###### 0688. 骑士在棋盘上的概率、0808. 分汤、0837. 新 21 点、1230. 抛掷硬币、1467. 两个盒子中球的颜色数相同的概率、1227. 飞机座位分配概率、1377. T 秒后青蛙的位置、剑指 Offer 60. n个骰子的点数 - -### [动态规划优化题目](../../Contents/10.Dynamic-Programming/11.DP-Optimization/04.DP-Optimization-List.md) diff --git a/Assets/Origins/Interview-100-List.md b/Assets/Origins/Interview-100-List.md deleted file mode 100644 index ba902907..00000000 --- a/Assets/Origins/Interview-100-List.md +++ /dev/null @@ -1,194 +0,0 @@ -## 01. 数组 - -### [数组基础题目](../../Contents/01.Array/01.Array-Basic/02.Array-Basic-List.md) - -###### 0054. 螺旋矩阵、0048. 旋转图像 - -### [排序算法题目](../../Contents/01.Array/02.Array-Sort/11.Array-Sort-List.md) - -#### 选择排序题目 - -###### 0215. 数组中的第K个最大元素 - -#### 希尔排序题目 - -###### 0912. 排序数组 - -#### 归并排序题目 - -###### 0912. 排序数组、0088. 合并两个有序数组 - -#### 快速排序题目 - -###### 0912. 排序数组、0169. 多数元素 - -#### 堆排序题目 - -###### 0912. 排序数组、0215. 数组中的第K个最大元素 - -#### 计数排序题目 - -###### 0912. 排序数组 - -#### 桶排序题目 - -###### 0912. 排序数组 - -#### 其他排序题目 - -###### 0136. 只出现一次的数字、0056. 合并区间、0179. 最大数 - -### [二分查找题目](../../Contents/01.Array/03.Array-Binary-Search/03.Array-Binary-Search-List.md) - -#### 二分下标题目 - -###### 0704. 二分查找、0034. 在排序数组中查找元素的第一个和最后一个位置、0153. 寻找旋转排序数组中的最小值、0033. 搜索旋转排序数组、0162. 寻找峰值、0004. 寻找两个正序数组的中位数、0240. 搜索二维矩阵 II - -#### 二分答案题目 - -###### 0069. x 的平方根 - -### [双指针题目](../../Contents/01.Array/04.Array-Two-Pointers/02.Array-Two-Pointers-List.md) - -#### 对撞指针题目 - -###### 0015. 三数之和 - -#### 快慢指针题目 - -###### 0283. 移动零、0088. 合并两个有序数组 - -#### 分离双指针题目 - -###### 0415. 字符串相加 - -### [滑动窗口题目](../../Contents/01.Array/05.Array-Sliding-Window/02.Array-Sliding-Window-List.md) - -#### 固定长度窗口题目 - -###### 0239. 滑动窗口最大值 - -#### 不定长度窗口题目 - -###### 0003. 无重复字符的最长子串、0076. 最小覆盖子串、0718. 最长重复子数组 - -## 02. 链表 - -### [链表经典题目](../../Contents/02.Linked-List/01.Linked-List-Basic/02.Linked-List-Basic-List.md) - -###### 0083. 删除排序链表中的重复元素、0082. 删除排序链表中的重复元素 II、0206. 反转链表、0092. 反转链表 II、0025. K 个一组翻转链表、0234. 回文链表 - -### [链表排序题目](../../Contents/02.Linked-List/02.Linked-List-Sort/02.Linked-List-Sort-List.md) - -###### 0148. 排序链表、0021. 合并两个有序链表、0023. 合并 K 个升序链表 - -### [链表双指针题目](../../Contents/02.Linked-List/03.Linked-List-Two-Pointers/02.Linked-List-Two-Pointers-List.md) - -###### 0141. 环形链表、0142. 环形链表 II、0160. 相交链表、0019. 删除链表的倒数第 N 个结点、剑指 Offer 22. 链表中倒数第k个节点、0143. 重排链表、0002. 两数相加 - -## 03. 堆栈 - -### [堆栈基础题目](../../Contents/03.Stack/01.Stack-Basic/02.Stack-Basic-List.md) - -###### 0155. 最小栈、0020. 有效的括号、0227. 基本计算器 II、0232. 用栈实现队列、0394. 字符串解码、0032. 最长有效括号 - -### [单调栈](../../Contents/03.Stack/02.Monotone-Stack/02.Monotone-Stack-List.md) - -###### 0042. 接雨水 - -## 04. 队列 - -### [队列基础题目](../../Contents/04.Queue/01.Queue-Basic/02.Queue-Basic-List.md) - -###### 0225. 用队列实现栈 - -### [优先队列题目](../../Contents/04.Queue/02.Priority-Queue/02.Priority-Queue-List.md) - -###### 0023. 合并 K 个升序链表、0239. 滑动窗口最大值 - -## 05. 哈希表 - -### [哈希表题目](../../Contents/05.Hash-Table/02.Hash-Table-List.md) - -###### 0001. 两数之和、0015. 三数之和、0041. 缺失的第一个正数、0128. 最长连续序列、0136. 只出现一次的数字 - -## 06. 字符串 - -### [字符串基础题目](../../Contents/06.String/01.String-Basic/02.String-Basic-List.md) - -###### 0003. 无重复字符的最长子串、0005. 最长回文子串、0415. 字符串相加、0151. 反转字符串中的单词、0043. 字符串相乘、0014. 最长公共前缀 - -## 07. 树 - -### [二叉树的遍历题目](../../Contents/07.Tree/01.Binary-Tree/03.Binary-Tree-Traverse-List.md) - -###### 0144. 二叉树的前序遍历、0094. 二叉树的中序遍历、0102. 二叉树的层序遍历、0103. 二叉树的锯齿形层序遍历、0236. 二叉树的最近公共祖先、0104. 二叉树的最大深度、0112. 路径总和、0113. 路径总和 II、0101. 对称二叉树、0124. 二叉树中的最大路径和、0199. 二叉树的右视图、0226. 翻转二叉树 - -### [二叉树的还原题目](../../Contents/07.Tree/01.Binary-Tree/05.Binary-Tree-Reduction-List.md) - -###### 0105. 从前序与中序遍历序列构造二叉树 - -### [二叉搜索树题目](../../Contents/07.Tree/02.Binary-Search-Tree/02.Binary-Search-Tree-List.md) - -###### 0098. 验证二叉搜索树、0110. 平衡二叉树 - -### [并查集题目](../../Contents/07.Tree/05.Union-Find/02.Union-Find-List.md) - -###### 0128. 最长连续序列 - -## 08. 图论 - -### [图的深度优先搜索题目](../../Contents/08.Graph/02.Graph-Traversal/02.Graph-DFS-List.md) - -###### 0200. 岛屿数量、0695. 岛屿的最大面积、0144. 二叉树的前序遍历、0094. 二叉树的中序遍历、0129. 求根节点到叶节点数字之和、0124. 二叉树中的最大路径和、0199. 二叉树的右视图、0543. 二叉树的直径、0662. 二叉树最大宽度 - -### [图的广度优先搜索题目](../../Contents/08.Graph/02.Graph-Traversal/04.Graph-BFS-List.md) - -###### 0200. 岛屿数量、0322. 零钱兑换、0199. 二叉树的右视图、0662. 二叉树最大宽度 - -## 09. 基础算法 - -### [枚举算法题目](../../Contents/09.Algorithm-Base/01.Enumeration-Algorithm/02.Enumeration-Algorithm-List.md) - -###### 0001. 两数之和、0078. 子集、0221. 最大正方形 - -### [递归算法题目](../../Contents/09.Algorithm-Base/02.Recursive-Algorithm/02.Recursive-Algorithm-List.md) - -###### 0024. 两两交换链表中的节点、0206. 反转链表、0092. 反转链表 II、0021. 合并两个有序链表、0070. 爬楼梯、0104. 二叉树的最大深度、0124. 二叉树中的最大路径和、0226. 翻转二叉树 - -### [分治算法题目](../../Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/02.Divide-And-Conquer-Algorithm-List.md) - -###### 0053. 最大子数组和、0023. 合并 K 个升序链表、0004. 寻找两个正序数组的中位数、0169. 多数元素、0014. 最长公共前缀 - -### [回溯算法题目](../../Contents/09.Algorithm-Base/04.Backtracking-Algorithm/02.Backtracking-Algorithm-List.md) - -###### 0046. 全排列、0022. 括号生成、0078. 子集、0039. 组合总和、0093. 复原 IP 地址 - -### [贪心算法题目](../../Contents/09.Algorithm-Base/05.Greedy-Algorithm/02.Greedy-Algorithm-List.md) - -###### 0053. 最大子数组和、0056. 合并区间、0122. 买卖股票的最佳时机 II - -### [位运算题目](../../Contents/09.Algorithm-Base/06.Bit-Operation/02.Bit-Operation-List.md) - -###### 0136. 只出现一次的数字 - -## 10. 动态规划 - -### [动态规划题目](../../Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/02.Dynamic-Programming-Basic-List.md) - -###### 0070. 爬楼梯、0121. 买卖股票的最佳时机、0322. 零钱兑换、0300. 最长递增子序列、1143. 最长公共子序列、0718. 最长重复子数组、0064. 最小路径和、0072. 编辑距离、0032. 最长有效括号、0221. 最大正方形、0062. 不同路径、0152. 乘积最大子数组、0198. 打家劫舍 - - -## 11. 补充题目 - -#### 设计数据结构题目 - -###### 0146. LRU 缓存 - -#### 模拟题目 - -###### 0008. 字符串转换整数 (atoi)、0165. 比较版本号、0468. 验证IP地址 - -#### 思维锻炼题目 - -###### 0031. 下一个排列、0470. 用 Rand7() 实现 Rand10() diff --git a/Assets/Origins/Interview-200-List.md b/Assets/Origins/Interview-200-List.md deleted file mode 100644 index cf0aec64..00000000 --- a/Assets/Origins/Interview-200-List.md +++ /dev/null @@ -1,233 +0,0 @@ -## 01. 数组 - -### [数组基础题目](../../Contents/01.Array/01.Array-Basic/02.Array-Basic-List.md) - -###### 0189. 轮转数组、0498. 对角线遍历、0048. 旋转图像、0054. 螺旋矩阵、0059. 螺旋矩阵 II - -### [排序算法题目](../../Contents/01.Array/02.Array-Sort/11.Array-Sort-List.md) - -#### 冒泡排序题目 - -###### 0283. 移动零 - -#### 选择排序题目 - -###### 0215. 数组中的第K个最大元素 - -#### 插入排序题目 - -###### 0075. 颜色分类 - -#### 希尔排序题目 - -###### 0912. 排序数组 - -#### 归并排序题目 - -###### 0912. 排序数组、0088. 合并两个有序数组、剑指 Offer 51. 数组中的逆序对 - -#### 快速排序题目 - -###### 0912. 排序数组、0169. 多数元素 - -#### 堆排序题目 - -###### 0912. 排序数组、0215. 数组中的第K个最大元素、剑指 Offer 40. 最小的k个数 - -#### 计数排序题目 - -###### 0912. 排序数组 - -#### 桶排序题目 - -###### 0912. 排序数组 - -#### 基数排序题目 - -###### 0164. 最大间距 - -#### 其他排序题目 - -###### 0136. 只出现一次的数字、0056. 合并区间、0179. 最大数、0384. 打乱数组、剑指 Offer 45. 把数组排成最小的数 - -### [二分查找题目](../../Contents/01.Array/03.Array-Binary-Search/03.Array-Binary-Search-List.md) - -#### 二分下标题目 - -###### 0704. 二分查找、0034. 在排序数组中查找元素的第一个和最后一个位置、0153. 寻找旋转排序数组中的最小值、0154. 寻找旋转排序数组中的最小值 II、0033. 搜索旋转排序数组、0162. 寻找峰值、0004. 寻找两个正序数组的中位数、0074. 搜索二维矩阵、0240. 搜索二维矩阵 II - -#### 二分答案题目 - -###### 0069. x 的平方根、0287. 寻找重复数、0050. Pow(x, n)、0400. 第 N 位数字 - -#### 复杂的二分查找问题 - -###### 0209. 长度最小的子数组、0349. 两个数组的交集 - -### [双指针题目](../../Contents/01.Array/04.Array-Two-Pointers/02.Array-Two-Pointers-List.md) - -#### 对撞指针题目 - -###### 0611. 有效三角形的个数、0015. 三数之和、0016. 最接近的三数之和、0125. 验证回文串、0011. 盛最多水的容器、0075. 颜色分类、剑指 Offer 21. 调整数组顺序使奇数位于偶数前面、0443. 压缩字符串 - -#### 快慢指针题目 - -###### 0026. 删除有序数组中的重复项、0283. 移动零、0088. 合并两个有序数组 - -#### 分离双指针题目 - -###### 0415. 字符串相加 - -### [滑动窗口题目](../../Contents/01.Array/05.Array-Sliding-Window/02.Array-Sliding-Window-List.md) - -#### 固定长度窗口题目 - -###### 0239. 滑动窗口最大值 - -#### 不定长度窗口题目 - -###### 0003. 无重复字符的最长子串、0076. 最小覆盖子串、0718. 最长重复子数组、0209. 长度最小的子数组、0862. 和至少为 K 的最短子数组、1004. 最大连续1的个数 III - -## 02. 链表 - -### [链表经典题目](../../Contents/02.Linked-List/01.Linked-List-Basic/02.Linked-List-Basic-List.md) - -###### 0083. 删除排序链表中的重复元素、0082. 删除排序链表中的重复元素 II、0206. 反转链表、0092. 反转链表 II、0025. K 个一组翻转链表、0328. 奇偶链表、0234. 回文链表、0138. 复制带随机指针的链表、0061. 旋转链表 - -### [链表排序题目](../../Contents/02.Linked-List/02.Linked-List-Sort/02.Linked-List-Sort-List.md) - -###### 0148. 排序链表、0021. 合并两个有序链表、0023. 合并 K 个升序链表 - -### [链表双指针题目](../../Contents/02.Linked-List/03.Linked-List-Two-Pointers/02.Linked-List-Two-Pointers-List.md) - -###### 0141. 环形链表、0142. 环形链表 II、0160. 相交链表、0019. 删除链表的倒数第 N 个结点、剑指 Offer 22. 链表中倒数第k个节点、0143. 重排链表、0002. 两数相加、0445. 两数相加 II - -## 03. 堆栈 - -### [堆栈基础题目](../../Contents/03.Stack/01.Stack-Basic/02.Stack-Basic-List.md) - -###### 1047. 删除字符串中的所有相邻重复项、0155. 最小栈、0020. 有效的括号、0224. 基本计算器、0227. 基本计算器 II、0232. 用栈实现队列、剑指 Offer 09. 用两个栈实现队列、0394. 字符串解码、0032. 最长有效括号、0739. 每日温度、0071. 简化路径 - -### [单调栈](../../Contents/03.Stack/02.Monotone-Stack/02.Monotone-Stack-List.md) - -###### 0739. 每日温度、0503. 下一个更大元素 II、0042. 接雨水、0085. 最大矩形 - -## 04. 队列 - -### [队列基础题目](../../Contents/04.Queue/01.Queue-Basic/02.Queue-Basic-List.md) - -###### 0225. 用队列实现栈 - -### [优先队列题目](../../Contents/04.Queue/02.Priority-Queue/02.Priority-Queue-List.md) - -###### 0347. 前 K 个高频元素、0239. 滑动窗口最大值、0295. 数据流的中位数、0023. 合并 K 个升序链表 - -## 05. 哈希表 - -### [哈希表题目](../../Contents/05.Hash-Table/02.Hash-Table-List.md) - -###### 0001. 两数之和、0015. 三数之和、0041. 缺失的第一个正数、0128. 最长连续序列、0136. 只出现一次的数字、0242. 有效的字母异位词、0442. 数组中重复的数据、剑指 Offer 61. 扑克牌中的顺子、0268. 丢失的数字、剑指 Offer 03. 数组中重复的数字 - -## 06. 字符串 - -### [字符串基础题目](../../Contents/06.String/01.String-Basic/02.String-Basic-List.md) - -###### 0125. 验证回文串、0005. 最长回文子串、0003. 无重复字符的最长子串、0344. 反转字符串、0557. 反转字符串中的单词 III、0415. 字符串相加、0151. 反转字符串中的单词、0043. 字符串相乘、0014. 最长公共前缀 - -### [单模式串匹配题目](../../Contents/06.String/02.String-Single-Pattern-Matching/07.String-Single-Pattern-Matching-List.md) - -###### 0459. 重复的子字符串 - -### [字典树题目](../../Contents/06.String/03.String-Multi-Pattern-Matching/02.Trie-List.md) - -###### 0208. 实现 Trie (前缀树)、0440. 字典序的第K小数字 - -## 07. 树 - -### [二叉树的遍历题目](../../Contents/07.Tree/01.Binary-Tree/03.Binary-Tree-Traverse-List.md) - -###### 0144. 二叉树的前序遍历、0094. 二叉树的中序遍历、0145. 二叉树的后序遍历、0102. 二叉树的层序遍历、0103. 二叉树的锯齿形层序遍历、0104. 二叉树的最大深度、0111. 二叉树的最小深度、0124. 二叉树中的最大路径和、0101. 对称二叉树、0112. 路径总和、0113. 路径总和 II、0236. 二叉树的最近公共祖先、0199. 二叉树的右视图、0226. 翻转二叉树、0958. 二叉树的完全性检验、0572. 另一棵树的子树、0100. 相同的树、0297. 二叉树的序列化与反序列化、0114. 二叉树展开为链表 - -### [二叉树的还原题目](../../Contents/07.Tree/01.Binary-Tree/05.Binary-Tree-Reduction-List.md) - -###### 0105. 从前序与中序遍历序列构造二叉树、0106. 从中序与后序遍历序列构造二叉树 - -### [二叉搜索树题目](../../Contents/07.Tree/02.Binary-Search-Tree/02.Binary-Search-Tree-List.md) - -###### 0098. 验证二叉搜索树、0450. 删除二叉搜索树中的节点、剑指 Offer 54. 二叉搜索树的第k大节点、0230. 二叉搜索树中第K小的元素、0426. 将二叉搜索树转化为排序的双向链表、0110. 平衡二叉树 - -### [并查集题目](../../Contents/07.Tree/05.Union-Find/02.Union-Find-List.md) - -###### 0128. 最长连续序列 - -## 08. 图论 - -### [图的深度优先搜索题目](../../Contents/08.Graph/02.Graph-Traversal/02.Graph-DFS-List.md) - -###### 0200. 岛屿数量、0695. 岛屿的最大面积、0144. 二叉树的前序遍历、0094. 二叉树的中序遍历、0145. 二叉树的后序遍历、0129. 求根节点到叶节点数字之和、0124. 二叉树中的最大路径和、0199. 二叉树的右视图、0543. 二叉树的直径、0662. 二叉树最大宽度、0958. 二叉树的完全性检验、0572. 另一棵树的子树、0100. 相同的树、0111. 二叉树的最小深度 - -### [图的广度优先搜索题目](../../Contents/08.Graph/02.Graph-Traversal/04.Graph-BFS-List.md) - -###### 0200. 岛屿数量、0322. 零钱兑换、0207. 课程表、0199. 二叉树的右视图、0662. 二叉树最大宽度、0958. 二叉树的完全性检验、0572. 另一棵树的子树、0100. 相同的树、0111. 二叉树的最小深度、剑指 Offer 32 - III. 从上到下打印二叉树 III - -### [图的拓扑排序题目](../../Contents/08.Graph/02.Graph-Traversal/06.Graph-Topological-Sorting-List.md) - -###### 0210. 课程表 II - -## 09. 基础算法 - -### [枚举算法题目](../../Contents/09.Algorithm-Base/01.Enumeration-Algorithm/02.Enumeration-Algorithm-List.md) - -###### 0001. 两数之和、0078. 子集、0221. 最大正方形、0560. 和为 K 的子数组 - -### [递归算法题目](../../Contents/09.Algorithm-Base/02.Recursive-Algorithm/02.Recursive-Algorithm-List.md) - -###### 0024. 两两交换链表中的节点、0206. 反转链表、0092. 反转链表 II、0021. 合并两个有序链表、0509. 斐波那契数、0070. 爬楼梯、0104. 二叉树的最大深度、0124. 二叉树中的最大路径和、0226. 翻转二叉树、剑指 Offer 62. 圆圈中最后剩下的数字 - -### [分治算法题目](../../Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/02.Divide-And-Conquer-Algorithm-List.md) - -###### 0004. 寻找两个正序数组的中位数、0023. 合并 K 个升序链表、0053. 最大子数组和、0169. 多数元素、0014. 最长公共前缀、剑指 Offer 33. 二叉搜索树的后序遍历序列 - -### [回溯算法题目](../../Contents/09.Algorithm-Base/04.Backtracking-Algorithm/02.Backtracking-Algorithm-List.md) - -###### 0046. 全排列、0047. 全排列 II、0037. 解数独、0022. 括号生成、0078. 子集、0039. 组合总和、0040. 组合总和 II、0093. 复原 IP 地址、0079. 单词搜索、0679. 24 点游戏 - -### [贪心算法题目](../../Contents/09.Algorithm-Base/05.Greedy-Algorithm/02.Greedy-Algorithm-List.md) - -###### 0053. 最大子数组和、0056. 合并区间、0122. 买卖股票的最佳时机 II、0055. 跳跃游戏、0402. 移掉 K 位数字、0135. 分发糖果、0134. 加油站、0670. 最大交换 - -### [位运算题目](../../Contents/09.Algorithm-Base/06.Bit-Operation/02.Bit-Operation-List.md) - -###### 0136. 只出现一次的数字、0191. 位1的个数、0268. 丢失的数字 - -## 10. 动态规划 - -### [动态规划题目](../../Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/02.Dynamic-Programming-Basic-List.md) - -###### 0070. 爬楼梯、0509. 斐波那契数、0121. 买卖股票的最佳时机、0322. 零钱兑换、0518. 零钱兑换 II、0300. 最长递增子序列、1143. 最长公共子序列、0718. 最长重复子数组、0064. 最小路径和、0072. 编辑距离、0032. 最长有效括号、0221. 最大正方形、0062. 不同路径、0063. 不同路径 II、0152. 乘积最大子数组、0198. 打家劫舍、0213. 打家劫舍 II、0091. 解码方法、0010. 正则表达式匹配、0678. 有效的括号字符串、0045. 跳跃游戏 II、0673. 最长递增子序列的个数、0139. 单词拆分、0044. 通配符匹配、0120. 三角形最小路径和、0096. 不同的二叉搜索树、0887. 鸡蛋掉落、0097. 交错字符串、0516. 最长回文子序列 - -### 记忆化搜索题目 - -###### 0329. 矩阵中的最长递增路径 - -## 11. 补充题目 - -#### 设计数据结构题目 - -###### 0146. LRU 缓存、0460. LFU 缓存 - -#### 数学题目 - -###### 0007. 整数反转、0009. 回文数、剑指 Offer 62. 圆圈中最后剩下的数字、0168. Excel表列名称、0400. 第 N 位数字 - -#### 模拟题目 - -###### 0008. 字符串转换整数 (atoi)、0165. 比较版本号、0468. 验证IP地址、0086. 分隔链表 - -#### 前缀和 - -###### 0560. 和为 K 的子数组 - -#### 思维锻炼题目 - -###### 0031. 下一个排列、0556. 下一个更大元素 III、0470. 用 Rand7() 实现 Rand10() \ No newline at end of file diff --git a/Assets/Origins/README-Catalogue-List.md b/Assets/Origins/README-Catalogue-List.md deleted file mode 100644 index 4864aef4..00000000 --- a/Assets/Origins/README-Catalogue-List.md +++ /dev/null @@ -1,215 +0,0 @@ -### 00. 绪论 - -- [算法与数据结构](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/01.Data-Structures-Algorithms.md) -- [算法复杂度](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/02.Algorithm-Complexity.md) -- [LeetCode 入门与攻略](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/03.LeetCode-Guide.md) -- [LeetCode 题解（字典序排序，850+ 道题解）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/04.Solutions-List.md) -- [LeetCode 题解（按分类排序，推荐刷题列表 ★★★）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/05.Categories-List.md) -- [LeetCode 面试最常考 100 题（按分类排序）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/06.Interview-100-List.md) -- [LeetCode 面试最常考 200 题（按分类排序）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/07.Interview-200-List.md) - -### 01. 数组 - -- 数组基础知识 - - [数组基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/01.Array-Basic/01.Array-Basic.md) - - [数组基础题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/01.Array-Basic/02.Array-Basic-List.md) -- 数组排序算法 - - [冒泡排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/01.Array-Bubble-Sort.md) - - [选择排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/02.Array-Selection-Sort.md) - - [插入排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/03.Array-Insertion-Sort.md) - - [希尔排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/04.Array-Shell-Sort.md) - - [归并排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/05.Array-Merge-Sort.md) - - [快速排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/06.Array-Quick-Sort.md) - - [堆排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/07.Array-Heap-Sort.md) - - [计数排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/08.Array-Counting-Sort.md) - - [桶排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/09.Array-Bucket-Sort.md) - - [基数排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/10.Array-Radix-Sort.md) - - [数组排序题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/11.Array-Sort-List.md) -- 二分查找 - - [二分查找知识（一）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/03.Array-Binary-Search/01.Array-Binary-Search-01.md) - - [二分查找知识（二）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/03.Array-Binary-Search/02.Array-Binary-Search-02.md) - - [二分查找题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/03.Array-Binary-Search/03.Array-Binary-Search-List.md) -- 数组双指针 - - [数组双指针知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/04.Array-Two-Pointers/01.Array-Two-Pointers.md) - - [数组双指针题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/04.Array-Two-Pointers/02.Array-Two-Pointers-List.md) -- 数组滑动窗口 - - [数组滑动窗口知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/05.Array-Sliding-Window/01.Array-Sliding-Window.md) - - [数组滑动窗口题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/05.Array-Sliding-Window/02.Array-Sliding-Window-List.md) - -### 02. 链表 - -- 链表基础知识 - - [链表基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/01.Linked-List-Basic/01.Linked-List-Basic.md) - - [链表经典题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/01.Linked-List-Basic/02.Linked-List-Basic-List.md) -- 链表排序 - - [链表排序知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/02.Linked-List-Sort/01.Linked-List-Sort.md) - - [链表排序题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/02.Linked-List-Sort/02.Linked-List-Sort-List.md) -- 链表双指针 - - [链表双指针知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/03.Linked-List-Two-Pointers/01.Linked-List-Two-Pointers.md) - - [链表双指针题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/03.Linked-List-Two-Pointers/02.Linked-List-Two-Pointers-List.md) - -### 03. 堆栈 - -- 堆栈基础知识 - - [堆栈基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/03.Stack/01.Stack-Basic/01.Stack-Basic.md) - - [堆栈基础题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/03.Stack/01.Stack-Basic/02.Stack-Basic-List.md) -- 单调栈 - - [单调栈知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/03.Stack/02.Monotone-Stack/01.Monotone-Stack.md) - - [单调栈题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/03.Stack/02.Monotone-Stack/02.Monotone-Stack-List.md) - -### 04. 队列 - -- 队列基础知识 - - [队列基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/04.Queue/01.Queue-Basic/01.Queue-Basic.md) - - [队列基础题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/04.Queue/01.Queue-Basic/02.Queue-Basic-List.md) -- 优先队列 - - [优先队列知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/04.Queue/02.Priority-Queue/01.Priority-Queue.md) - - [优先队列题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/04.Queue/02.Priority-Queue/02.Priority-Queue-List.md) - -### 05. 哈希表 - -- [哈希表知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/05.Hash-Table/01.Hash-Table.md) -- [哈希表题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/05.Hash-Table/02.Hash-Table-List.md) - -### 06. 字符串 - -- 字符串基础知识 - - [字符串基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/01.String-Basic/01.String-Basic.md) - - [字符串经典题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/01.String-Basic/02.String-Basic-List.md) -- 单模式串匹配 - - [Brute Force 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/01.String-Brute-Force.md) - - [Rabin Karp 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/02.String-Rabin-Karp.md) - - [KMP 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/03.String-KMP.md) - - [Boyer Moore 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/04.String-Boyer-Moore.md) - - [Horspool 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/05.String-Horspool.md) - - [Sunday 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/06.String-Sunday.md) - - [单模式串匹配题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/07.String-Single-Pattern-Matching-List.md) -- 多模式串匹配 - - [字典树知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/01.Trie.md) - - [字典树题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/02.Trie-List.md) - - [AC 自动机知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/03.AC-Automaton.md) - - [AC 自动机题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/04.AC-Automaton-List.md) - - [后缀数组知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/05.Suffix-Array.md) - - [后缀数组题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/06.Suffix-Array-List.md) - -### 07. 树 - -- 二叉树 - - [树与二叉树基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/01.Binary-Tree-Basic.md) - - [二叉树的遍历知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/02.Binary-Tree-Traverse.md) - - [二叉树的遍历题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/03.Binary-Tree-Traverse-List.md) - - [二叉树的还原知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/04.Binary-Tree-Reduction.md) - - [二叉树的还原题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/05.Binary-Tree-Reduction-List.md) -- 二叉搜索树 - - [二叉搜索树知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/02.Binary-Search-Tree/01.Binary-Search-Tree.md) - - [二叉搜索树题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/02.Binary-Search-Tree/02.Binary-Search-Tree-List.md) -- 线段树 - - [线段树知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/03.Segment-Tree/01.Segment-Tree.md) - - [线段树题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/03.Segment-Tree/02.Segment-Tree-List.md) -- 树状数组 - - [树状数组知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/04.Binary-Indexed-Tree/01.Binary-Indexed-Tree.md) - - [树状数组题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/04.Binary-Indexed-Tree/02.Binary-Indexed-Tree-List.md) -- 并查集 - - [并查集知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/05.Union-Find/01.Union-Find.md) - - [并查集题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/05.Union-Find/02.Union-Find-List.md) - -### 08. 图论 - -- 图的基础知识 - - [图的定义和分类](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/01.Graph-Basic/01.Graph-Basic.md) - - [图的存储结构和问题应用](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/01.Graph-Basic/02.Graph-Structure.md) -- 图的遍历 - - [图的深度优先搜索知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/01.Graph-DFS.md) - - [图的深度优先搜索题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/02.Graph-DFS-List.md) - - [图的广度优先搜索知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/03.Graph-BFS.md) - - [图的广度优先搜索题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/04.Graph-BFS-List.md) - - [图的拓扑排序知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/05.Graph-Topological-Sorting.md) - - [图的拓扑排序题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/06.Graph-Topological-Sorting-List.md) -- 图的生成树 - - [图的最小生成树知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/03.Graph-Spanning-Tree/01.Graph-Minimum-Spanning-Tree.md) - - [图的最小生成树题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/03.Graph-Spanning-Tree/02.Graph-Minimum-Spanning-Tree-List.md) -- 最短路径 - - [单源最短路径知识（一）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/01.Graph-Single-Source-Shortest-Path-01.md) - - [单源最短路径知识（二）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/02.Graph-Single-Source-Shortest-Path-02.md) - - [单源最短路径题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/03.Graph-Single-Source-Shortest-Path-List.md) - - [多源最短路径知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/04.Graph-Multi-Source-Shortest-Path.md) - - [多源最短路径题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/05.Graph-Multi-Source-Shortest-Path-List.md) - - [次短路径知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/06.Graph-The-Second-Shortest-Path.md) - - [次短路径题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/07.Graph-The-Second-Shortest-Path-List.md) - - [差分约束系统知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/08.Graph-System-Of-Difference-Constraints.md) - - [差分约束系统题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/09.Graph-System-Of-Difference-Constraints-List.md) -- 二分图 - - [二分图基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/01.Graph-Bipartite-Basic.md) - - [二分图基础题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/02.Graph-Bipartite-Basic-List.md) - - [二分图最大匹配知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/03.Graph-Bipartite-Matching.md) - - [匈牙利算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/04.Graph-Hungarian-Algorithm.md) - - [Hopcroft-Karp 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/05.Graph-Hopcroft-Karp.md) - - [二分图最大匹配题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/06.Graph-Bipartite-Matching-List.md) - -### 09. 基础算法 - -- 枚举算法 - - [枚举算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/01.Enumeration-Algorithm/01.Enumeration-Algorithm.md) - - [枚举算法题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/01.Enumeration-Algorithm/02.Enumeration-Algorithm-List.md) -- 递归算法 - - [递归算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/02.Recursive-Algorithm/01.Recursive-Algorithm.md) - - [递归算法题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/02.Recursive-Algorithm/02.Recursive-Algorithm-List.md) -- 分治算法 - - [分治算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/01.Divide-And-Conquer-Algorithm.md) - - [分治算法题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/02.Divide-And-Conquer-Algorithm-List.md) -- 回溯算法 - - [回溯算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/04.Backtracking-Algorithm/01.Backtracking-Algorithm.md) - - [回溯算法题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/04.Backtracking-Algorithm/02.Backtracking-Algorithm-List.md) -- 贪心算法 - - [贪心算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/05.Greedy-Algorithm/01.Greedy-Algorithm.md) - - [贪心算法题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/05.Greedy-Algorithm/02.Greedy-Algorithm-List.md) -- 位运算 - - [位运算知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/06.Bit-Operation/01.Bit-Operation.md) - - [位运算题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/06.Bit-Operation/02.Bit-Operation-List.md) - -### 10. 动态规划 - -- 动态规划基础 - - [动态规划基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/01.Dynamic-Programming-Basic.md) - - [动态规划基础题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/02.Dynamic-Programming-Basic-List.md) -- 记忆化搜索 - - [记忆化搜索知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/02.Memoization/01.Memoization.md) - - [记忆化搜索题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/02.Memoization/02.Memoization-List.md) -- 线性 DP - - [线性 DP 知识（一）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/03.Linear-DP/01.Linear-DP-01.md) - - [线性 DP 知识（二）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/03.Linear-DP/02.Linear-DP-02.md) - - [线性 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/03.Linear-DP/03.Linear-DP-List.md) -- 背包问题 - - [背包问题知识（一）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/01.Knapsack-Problem-01.md) - - [背包问题知识（二）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/02.Knapsack-Problem-02.md) - - [背包问题知识（三）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/03.Knapsack-Problem-03.md) - - [背包问题知识（四）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/04.Knapsack-Problem-04.md) - - [背包问题知识（五）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/05.Knapsack-Problem-05.md) - - [背包问题题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/06.Knapsack-Problem-List.md) -- 区间 DP - - [区间 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/05.Interval-DP/01.Interval-DP.md) - - [区间 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/05.Interval-DP/02.Interval-DP-List.md) -- 树形 DP - - [树形 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/06.Tree-DP/01.Tree-DP.md) - - [树形 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/06.Tree-DP/02.Tree-DP-List.md) -- 状态压缩 DP - - [状态压缩 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/07.State-DP/01.State-DP.md) - - [状态压缩 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/07.State-DP/02.State-DP-List.md) -- 计数 DP - - [计数 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/08.Counting-DP/01.Counting-DP.md) - - [计数 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/08.Counting-DP/02.Counting-DP-List.md) -- 数位 DP - - [数位 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/09.Digit-DP/01.Digit-DP.md) - - [数位 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/09.Digit-DP/02.Digit-DP-List.md) -- 概率 DP - - [概率 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/10.Probability-DP/01.Probability-DP.md) - - [概率 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/10.Probability-DP/02.Probability-DP-List.md) -- 动态规划优化 - - [单调栈 / 优先队列优化](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/11.DP-Optimization/01.Monotone-Stack-Queue-Optimization.md) - - [斜率优化](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/11.DP-Optimization/02.Slope-Optimization.md) - - [四边形不等式优化](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/11.DP-Optimization/03.Quadrangle-Optimization.md) - - [动态规划优化题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/11.DP-Optimization/04.DP-Optimization-List.md) - -### 11. 附加内容 - -- [内容完成时间线](./Contents/Others/Update-Time.md) diff --git a/Assets/Origins/README-Head.md b/Assets/Origins/README-Head.md deleted file mode 100644 index 4a89e73e..00000000 --- a/Assets/Origins/README-Head.md +++ /dev/null @@ -1,46 +0,0 @@ -# 算法通关手册（LeetCode） - -## 01. 项目简介 - -- **「算法与数据结构」** 基础知识的讲解教程，「LeetCode」800+ 道题目的详细解析。本项目易于理解，没有大跨度的思维跳跃，项目中使用部分图示、例子来帮助理解。 - -- 本教程先从基础的数据结构和算法开始讲解，再针对不同分类的数据结构和算法，进行具体题目的讲解分析。让读者可以通过「算法基础理论学习」和「编程实战学习」相结合的方式，彻底的掌握算法知识。 - -- 本教程采用 Python 作为编程语言，要求学习者已有基本 Python 程序设计的知识与经验。 - -## 02. 项目地址 - -欢迎右上角 **「Star ⭐️ 」** 和 **「Fork」**，这是对我最大的鼓励和支持。 - -- GitHub 地址：[https://github.com/itcharge/LeetCode-Py](https://github.com/itcharge/LeetCode-Py) - -支持黑暗模式的在线电子书《算法通关手册》。 - -- 电子书地址：[https://algo.itcharge.cn](https://algo.itcharge.cn) - -![电子书浅色模式](./Assets/Images/algo-book-light.png) - -![电子书深色模式](./Assets/Images/algo-book-dark.png) - -## 03. 关于作者 - -我是一名 iOS / macOS 的开发程序员，另外也是北航软院的一名非全硕士（在读）。曾在大学期间学习过算法知识，并参加过 3 年的 ACM 比赛， 但水平有限，未能取得理想成绩。但是这 3 年的 ACM 经历，给我最大的收获是锻炼了自己的逻辑思维和解决实际问题的能力，这种能力为我今后的工作、学习打下了坚实的基础。 - -我从 2021 年 03 月 30 日开始每日在 LeetCode 刷题，到 2022 年 06 月 08 日已经刷了 1000+ 道题目，并且完成了 800+ 道题解。努力向着 1000+、1500+、2000+ 道题解前进。 - -在公众号 **「程序员充电站」** 里回复 "**算法打卡**"，拉你进 LeetCode 算法打卡计划群一起组队打卡。 - -- 进群暗号：**算法打卡** -- 进群要求：少闲聊、多分享、改备注。 - -![](./Assets/Images/itcharge-qr-code.png) - -## 04. 版权说明 - -- 本教程采用 [知识署名—非商业性使用—禁止演绎（BY-NC-ND）4.0 协议国际许可协议](https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode.zh-Hans) 进行许可。 -- 本教程题解中的所有题目版权均归 [LeetCode](https://leetcode.com/) 和 [力扣中国](https://leetcode.cn/) 所有。 - -## 05. 章节目录 - -![章节目录](./Assets/Images/algo-book-contents.png) - diff --git a/Assets/Origins/Root-Index-Head.md b/Assets/Origins/Root-Index-Head.md deleted file mode 100644 index 78776f57..00000000 --- a/Assets/Origins/Root-Index-Head.md +++ /dev/null @@ -1,71 +0,0 @@ -# 算法通关手册（LeetCode） - -## 关于本书 - -本书不仅仅只是一本算法题解书，更是一本算法与数据结构基础知识的讲解书。本书易于理解，没有大跨度的思维跳跃，书中使用部分图示、例子来帮助理解。本书先从基础的数据结构和算法开始讲解，再针对不同分类的数据结构和算法，进行具体题目的讲解分析。让读者可以通过「算法基础理论学习」和「编程实战学习」相结合的方式，彻底的掌握算法知识。 - -本书采用 Python 作为编程语言，要求学习者已有基本 Python 程序设计的知识与经验。 - -## 本书起因 - -我想写一本通俗易懂的算法书已经很久了，久到大概有 6 年那么久。至今我还记着上大学时立下的 flag，我要把我所学的算法知识总结起来，整理成册，编辑成书。然后大大方方的在封面书上自己的昵称，再把它分享给想要学习算法的朋友们看。 - -结果是万万没想到，这一晃过去，毕业后参加工作都已经 5 年了，每天忙于开发需求、业务逻辑，写书这件事也跟其他大多数的待办事项和计划清单一样，被无限期地闲置一旁，再也不管不顾了。 - -不过，好在是今年我又重新拾起了算法，开始和朋友一起愉快的在 LeetCode 上刷题。于是往日的目标又浮现在了眼前，所以这次痛下决心，立志写一本浅显易懂、图文并茂的算法书，能够让没有算法基础的新手能够通过这本书学到一些「算法和数据结构」相关知识，并通过在 LeetCode 刷题的方式，锻炼自己的解决问题的能力和思维方式。 - -![](https://qcdn.itcharge.cn/images/20211027170432.png) - -## 源码地址 - -本书内容及代码都放在 [Github repo](https://github.com/itcharge/LeetCode-Py) 中，欢迎在下方项目中 **「Star ⭐️ 」** 和 **「Fork」**，这是对我最大的鼓励和支持。 - -- Github 地址：[https://github.com/itcharge/LeetCode-Py](https://github.com/itcharge/LeetCode-Py) - -## 本书前言 - -**「算法和数据结构」** 是计算机程序设计的重要理论技术基础，但很多程序员忽略了它的重要性。在日常开发工作中，最多的情况是使用成熟的开发框架，利用已经封装好的接口，进行 CRUD（增删改查）操作，似乎很少会需要自己实现相应的数据结构和算法。 - -况且工作中用到的编程语言、开发框架、开发平台，更新速度堪比摩尔定律。以前端为例，React 还没学明白呢，Vue 就火起来了。Vue 2.0 的文档还在研究呢，Vue 3.0 就发布了。很多时候，连新的技术还学不过来呢，哪还有时间去专门研究算法和数据结构呢。 - -诚然，语言、技术、框架固然重要，但背后的计算机算法和理论更为重要。因为语言、技术、框架的更新日新月异，但万变不离其宗的是背后的算法和理论，例如：**数据结构**、**算法**、**编译原理**、**计算机网络**、**计算机体系结构** 等等。任凭新技术如何变化，只要掌握了这些计算机科学的核心理论，就可以见招拆招，让自己立于不败之地。从此无论是看懂底层系统的设计原理、框架背后的设计思想，还是学习新技术、提升工作实战的效率，都可以做到得心应手。 - -**学习数据结构与算法的关键，在于掌握其中的思想和精髓，学会解决实际问题的方法。** - -本书采用算法与数据结构相结合的方法，把内容分为如下 6 部分： - -- 第一部分是序言（第 00 章）：介绍数据结构与算法的基础知识、算法复杂度、LeetCode 的入门和攻略，为后面的学习打好基础。 -- 第二部分是数据结构篇（第 01 ~ 08 章）：每一章对应一种数据结构，这个部分用来介绍最常见、最重要的数据结构，以及与该数据结构相关的算法知识。 -- 第三部分是基础算法篇（第 09 章）：这一章用来介绍基本的算法思想。包括枚举、递归、贪心、分治、回溯以及位运算。 -- 第四部分是动态规划篇（第 10 章）：这一章用来介绍动态规划的基础知识、题型和优化方法。 -- 第五部分是补充内容篇（第 11 章）：这一章用来补充之前章节没有讲到的内容。 -- 第六部分是 LeetCode 题解篇（第 12 章）：这一章用来讲解我在 LeetCode 上刷过的所有题目。可按照对应题号进行检索和学习。 - -在本书构思与写作阶段，很多朋友给我提出了有益的意见和建议。这些意见和建议令我受益匪浅。感谢在本书著作准备过程中，帮助过我的朋友，以及一起陪我刷题打卡的朋友，还有提供宝贵意见的读者。感谢为本书提供课程合作和宣传的 DataWhale 开源组织。谢谢诸位。 - -## 目标读者 - -- 拥有 Python 编程基础的编程爱好者 -- 对 LeetCode 刷题感兴趣的编程爱好者 -- 对算法感兴趣的计算机专业学生或程序员 - -## 使用说明 - -- 本电子书的左侧为所有章节目录导航，可直接点击对应章节跳转阅读。 -- 本电子书左上角有搜索栏，可以帮你迅速找到想看的章节和题解文章。 -- 本电子书每页都接入了 Utterances 评论系统，可在每页下方的评论框进行评论（需使用 GitHub 账号登录）。如果没有显示，请检查一下网络。 - -## 互助与勘误 - -限于本人的水平和经验，书中一定不乏纰漏和谬误之处。恳切希望读者给予批评指正。这将有利于我改进和提高，以帮助更多的读者。如果您对本书有任何评论和建议，或者遇到问题需要帮助，可在每页评论区留言，或者致信作者邮箱 [i@itcharge.cn](mailto:i@itcharge.cn)，我将不胜感激。 - -## 关于作者 - -我是一名 iOS / macOS 的开发程序员，另外也是北航软院的一名非全硕士（在读）。曾在大学期间学习过算法知识，并参加过 3 年的 ACM 比赛， 但水平有限，未能取得理想成绩。但是这 3 年的 ACM 经历，给我最大的收获是锻炼了自己的逻辑思维和解决实际问题的能力，这种能力为我今后的工作、学习打下了坚实的基础。 - -我从 2021 年 03 月 30 日开始每日在 LeetCode 刷题，到 2022 年 06 月 08 日已经刷了 1000+ 道题目，并且完成了 800+ 道题解。努力向着 1000+、1500+、2000+ 道题解前进。 - -## 版权说明 - -- 本书采用 [知识署名—非商业性使用—禁止演绎（BY-NC-ND）4.0 协议国际许可协议](https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode.zh-Hans) 进行许可。 -- 本书题解中的所有题目版权均归 [LeetCode](https://leetcode.com/) 和 [力扣中国](https://leetcode.cn/) 所有。 diff --git a/Assets/Scripts/create_auto.sh b/Assets/Scripts/create_auto.sh deleted file mode 100644 index ecff0238..00000000 --- a/Assets/Scripts/create_auto.sh +++ /dev/null @@ -1,8 +0,0 @@ -#!/usr/bin/env sh - -# 确保脚本抛出遇到的错误 -set -e - -cd ./ - -python3 create_readme.py \ No newline at end of file diff --git a/Assets/Scripts/create_readme.py b/Assets/Scripts/create_readme.py deleted file mode 100644 index 26d7b861..00000000 --- a/Assets/Scripts/create_readme.py +++ /dev/null @@ -1,33 +0,0 @@ -import create_solutions_list as gen - -# 生成分类题解列表 -solotions_path = '../../Solutions' -categories_origin_list_path = '../Origins/Categories-List.md' -categories_list_path = '../../Contents/00.Introduction/05.Categories-List.md' - -gen.gen_categories_list(solotions_path, categories_origin_list_path, categories_list_path) - -# 生成面试 Top 100 题解列表 -interview_100_origin_list_path = '../Origins/Interview-100-List.md' -interview_100_list_path = '../../Contents/00.Introduction/06.Interview-100-List.md' -gen.gen_interview_list(solotions_path, interview_100_origin_list_path, interview_100_list_path) - -# 生成面试 Top 200 题解列表 -interview_200_origin_list_path = '../Origins/Interview-200-List.md' -interview_200_list_path = '../../Contents/00.Introduction/07.Interview-200-List.md' -gen.gen_interview_list(solotions_path, interview_200_origin_list_path, interview_200_list_path) - -# 生成全部题解列表 -solotions_output_path = '../../Contents/00.Introduction/04.Solutions-List.md' - -solutions_count = gen.gen_solutions_list(solotions_path, solotions_output_path) - - -# 生成 README.md index.md 文件 -readme_head_path = '../Origins/README-Head.md' -readme_catalogue_list_path = '../Origins/README-Catalogue-List.md' -content_index_path = '../../Contents/index.md' -readme_path = '../../README.md' - -gen.merge_readme_file(solotions_output_path, readme_head_path, readme_catalogue_list_path, content_index_path, readme_path, solutions_count) - diff --git a/Assets/Scripts/create_solutions_list.py b/Assets/Scripts/create_solutions_list.py deleted file mode 100644 index 74f30d2b..00000000 --- a/Assets/Scripts/create_solutions_list.py +++ /dev/null @@ -1,324 +0,0 @@ -import os, re -from pathlib import Path -import pandas as pd -from urllib.parse import quote - -# 根据 frame 生成 Markdown 表格 -def gen_markdown_table(frame, need_sort): - - ELEMENT = " {} |" - - H = frame.shape[0] - W = frame.shape[1] - - LINE = "|" + ELEMENT * W - - head_name = ["题号", "标题", "题解", "标签", "难度"] - - lines = [] - - ## 表头部分 - lines += ["| {} | {} | {} | {} | {} |".format(head_name[0], head_name[1], head_name[2], head_name[3], head_name[4])] - - ## 分割线 - SPLIT = ":{}" - line = "|" - for i in range(W): - line = "{} {} |".format(line, SPLIT.format('-'*6)) - lines += [line] - - ## 数据部分 - if need_sort: - frame = frame.sort_values(by='题号') - frame = frame.reset_index(drop=True) - for i in range(H): - lines += ["| {} | {} | {} | {} | {} |".format(frame.at[i, '题号'], frame.at[i, '标题'], frame.at[i, '题解'], frame.at[i, '标签'], frame.at[i, '难度'])] - table = '\n'.join(lines) - return table - -# 根据题解目录 solutions_path 自动生成题解列表，并保存到 output_path 中 -def gen_solutions_list(solutions_path, solotions_output_path): - files = os.listdir(solutions_path) - frame = pd.DataFrame(columns=['题号', '标题', '题解', '标签', '难度']) - frame_cout = 0 - - df = pd.read_csv("leetcode-problems.csv") - - for file in files: - # 判断是否是文件夹 - if ".md" not in file: - continue - - # 获取题目所在行 - df_indexs = df[df['标题'] == Path(file).stem].index.tolist() - - if not df_indexs: - print('%s 没有出现在 leetcode-problems.csv 中' % (Path(file).stem)) - continue - row = df_indexs[0] - - problem_id = df.loc[row, "序号"] - problem_catalog = df.loc[row, "所在目录"] - problem_title = df.loc[row, "标题"] - problem_title_slug = df.loc[row, "标题末尾"] - problem_link = "[" + problem_title_slug + "](" + df.loc[row, "标题链接"] + ")" - problem_link_slug = df.loc[row, "标题链接末尾路径"] - problem_solution_path = os.path.join(solutions_path, problem_title + ".md") - if os.path.exists(problem_solution_path): - problem_solution_link = "[Python](" + df.loc[row, "github 题解链接"] + ")" - else: - problem_solution_link = "" - problem_label = df.loc[row, "标签"] - problem_difficulty = df.loc[row, "难度"] - res = [problem_id, problem_link, problem_solution_link, problem_label, problem_difficulty] - frame.loc[frame_cout] = res - frame_cout += 1 - - table = gen_markdown_table(frame, True) - with open(solotions_output_path, 'w') as f: - f.writelines("# LeetCode 题解（已完成 {} 道）\n\n".format(frame_cout)) - f.write(table) - f.close() - print("Create Solutions List Success") - return frame_cout - - -# 将 readme_head、list 合并到，自动生成 README.md 并保存到 readme_path 中 -def merge_readme_file(solotions_output_path, readme_head_path, readme_catalogue_list_path, content_index_path, readme_path, solutions_count): - - # 生成项目 README.md 文件 - readme_file = open(readme_path,'w') - - # 将 README 开头部分写入 README.md 中 - readme_head_file = open(readme_head_path) - readme_file.writelines(readme_head_file.readlines()) - readme_head_file.close() - - # 将章节目录写入 README.md 中 - readme_catelogue_list_file = open(readme_catalogue_list_path) - readme_catelogue_list_lines = readme_catelogue_list_file.readlines() - for readme_catelogue_list_line in readme_catelogue_list_lines: - readme_catelogue_list_line = readme_catelogue_list_line.replace('https://github.com/itcharge/LeetCode-Py/blob/main', '.') - readme_file.write(readme_catelogue_list_line) - readme_catelogue_list_file.close() - - # 将题解标题写入 readme 文件 - catalogue_list_file = open(solotions_output_path) - catalogue_list_lines = catalogue_list_file.readlines() - if len(catalogue_list_lines) > 0: - catalogue_list_title = catalogue_list_lines[0].strip('\n') - catalogue_list_title = '### [' + catalogue_list_title + '](./Contents/00.Introduction/04.Solutions-List.md)' - catalogue_list_title = catalogue_list_title.replace('# LeetCode 题解', '12. LeetCode 题解') - readme_file.writelines(catalogue_list_title) - catalogue_list_file.close() - - readme_file.close() - - - # 生成 Contents/index.md 文件 - content_index_file = open(content_index_path, 'w') - content_index_file.writelines("# 算法通关手册（LeetCode）\n\n") - content_index_file.writelines("## 章节目录\n\n") - - # 将章节目录写入 Contents/index.md 文件中 - readme_catelogue_list_file = open(readme_catalogue_list_path) - catalogue_list_lines = readme_catelogue_list_file.readlines() - for catalogue_list_line in catalogue_list_lines: - catalogue_list_line = catalogue_list_line.replace('https://github.com/itcharge/LeetCode-Py/blob/main/Contents', '.') - content_index_file.write(catalogue_list_line) - - readme_catelogue_list_file.close() - content_index_file.close() - -# 根据题解目录, 题目分类原始列表目录，生成分类题解，并将整体保存到 categories_list_path -def gen_categories_list(solutions_path, categories_origin_list_path, categories_list_path): - - f = open(categories_origin_list_path) - lines = f.readlines() - category_h2 = None - category_h3 = None - category_h4 = None - category_h6 = None - category_h3_file_path = None - category_h3_file_content = "" - category_file_content = "" - - df = pd.read_csv("leetcode-problems.csv") - - for i in range(len(lines)): - pattern = re.compile(r'(#{2,6}) (.*)') - match = pattern.match(lines[i]) - if match: - title_size, title_content = match.group(1,2) - if title_size == "##": - category_h2 = title_content - category_file_content += "## " + category_h2 + "\n\n" - elif title_size == "###": - if category_h3 and category_h3_file_path and category_h3_file_content: - with open(category_h3_file_path, 'w') as fi: - fi.write(category_h3_file_content) - fi.close() - category_h3 = None - category_h3_file_path = None - category_h3_file_content = "" - pattern1 = re.compile(r'\[(.*)\]\((.*)\)') - match1 = pattern1.match(title_content) - if match1: - category_h3, category_h3_file_path = match1.group(1,2) - category_h3_file_content += "### " + category_h3 + "\n\n" - category_file_content += "### " + category_h3 + "\n\n" - else: - category_h3 = title_content - category_file_content += "### " + category_h3 + "\n\n" - elif title_size == "####": - category_h4 = title_content - category_h3_file_content += "#### " + category_h4 + "\n\n" - category_file_content += "#### " + category_h4 + "\n\n" - elif title_size == "######": - category_h6 = title_content - problem_titles = title_content.split('、') - if not problem_titles: - continue - - frame = pd.DataFrame(columns=['题号', '标题', '题解', '标签', '难度']) - frame_cout = 0 - for problem_title in problem_titles: - # 获取题目所在行 - df_indexs = df[df['标题'] == problem_title].index.tolist() - - if not df_indexs: - print('%s 没有出现在 leetcode-problems.csv 中' % (problem_title)) - continue - row = df_indexs[0] - - problem_id = df.loc[row, "序号"] - problem_catalog = df.loc[row, "所在目录"] - problem_title = df.loc[row, "标题"] - problem_title_slug = df.loc[row, "标题末尾"] - problem_link = "[" + problem_title_slug + "](" + df.loc[row, "标题链接"] + ")" - problem_link_slug = df.loc[row, "标题链接末尾路径"] - problem_solution_path = os.path.join(solutions_path, problem_title + ".md") - if os.path.exists(problem_solution_path): - problem_solution_link = "[Python](" + df.loc[row, "github 题解链接"] + ")" - else: - problem_solution_link = "" - problem_label = df.loc[row, "标签"] - problem_difficulty = df.loc[row, "难度"] - res = [problem_id, problem_link, problem_solution_link, problem_label, problem_difficulty] - frame.loc[frame_cout] = res - frame_cout += 1 - - table = gen_markdown_table(frame, False) - category_h3_file_content += table + "\n\n" - category_file_content += table + "\n\n" - - if category_h3 and category_h3_file_path and category_h3_file_content: - with open(category_h3_file_path, 'w') as fi: - fi.write(category_h3_file_content) - fi.close() - - if category_file_content: - with open(categories_list_path, 'w') as fi: - fi.write("# LeetCode 题解（按分类排序，推荐刷题列表 ★★★）\n\n") - fi.write(category_file_content) - fi.close() - - print("Create Categories List Success") - - -# 根据题解目录, 面试题目分类原始列表目录，生成面试题解，并将整体保存到 interview_list_path -def gen_interview_list(solutions_path, interview_origin_list_path, interview_list_path): - - f = open(interview_origin_list_path) - lines = f.readlines() - interview_h2 = None - interview_h3 = None - interview_h4 = None - interview_h6 = None - interview_h3_file_path = None - interview_h3_file_content = "" - interview_file_content = "" - - df = pd.read_csv("leetcode-problems.csv") - - problems_set = set() - for i in range(len(lines)): - pattern = re.compile(r'(#{2,6}) (.*)') - match = pattern.match(lines[i]) - if match: - title_size, title_content = match.group(1,2) - if title_size == "##": - interview_h2 = title_content - interview_file_content += "## " + interview_h2 + "\n\n" - elif title_size == "###": - if interview_h3 and interview_h3_file_path and interview_h3_file_content: - interview_h3 = None - interview_h3_file_path = None - interview_h3_file_content = "" - pattern1 = re.compile(r'\[(.*)\]\((.*)\)') - match1 = pattern1.match(title_content) - if match1: - interview_h3, interview_h3_file_path = match1.group(1,2) - interview_h3_file_content += "### " + interview_h3 + "\n\n" - interview_file_content += "### " + interview_h3 + "\n\n" - else: - interview_h3 = title_content - interview_file_content += "### " + interview_h3 + "\n\n" - elif title_size == "####": - interview_h4 = title_content - interview_h3_file_content += "#### " + interview_h4 + "\n\n" - interview_file_content += "#### " + interview_h4 + "\n\n" - elif title_size == "######": - interview_h6 = title_content - problem_titles = title_content.split('、') - if not problem_titles: - continue - - frame = pd.DataFrame(columns=['题号', '标题', '题解', '标签', '难度']) - frame_cout = 0 - for problem_title in problem_titles: - # 获取题目所在行 - df_indexs = df[df['标题'] == problem_title].index.tolist() - - if not df_indexs: - print('%s 没有出现在 leetcode-problems.csv 中' % (problem_title)) - continue - - problems_set.add(problem_title) - row = df_indexs[0] - - problem_id = df.loc[row, "序号"] - problem_catalog = df.loc[row, "所在目录"] - problem_title = df.loc[row, "标题"] - problem_title_slug = df.loc[row, "标题末尾"] - problem_link = "[" + problem_title_slug + "](" + df.loc[row, "标题链接"] + ")" - problem_link_slug = df.loc[row, "标题链接末尾路径"] - problem_solution_path = os.path.join(solutions_path, problem_title + ".md") - if os.path.exists(problem_solution_path): - problem_solution_link = "[Python](" + df.loc[row, "github 题解链接"] + ")" - else: - problem_solution_link = "" - problem_label = df.loc[row, "标签"] - problem_difficulty = df.loc[row, "难度"] - res = [problem_id, problem_link, problem_solution_link, problem_label, problem_difficulty] - frame.loc[frame_cout] = res - frame_cout += 1 - - table = gen_markdown_table(frame, False) - interview_h3_file_content += table + "\n\n" - interview_file_content += table + "\n\n" - - if interview_file_content: - with open(interview_list_path, 'w') as fi: - if "Interview-100-List.md" in interview_origin_list_path: - fi.write("# LeetCode 面试最常考 100 题（按分类排序）\n\n") - elif "Interview-200-List.md" in interview_origin_list_path: - fi.write("# LeetCode 面试最常考 200 题（按分类排序）\n\n") - fi.write(interview_file_content) - fi.write("\n## 参考资料\n") - fi.write("\n- 【清单】[CodeTop 企业题库](https://codetop.cc/home)\n") - fi.close() - - print("Total Problems Count: " + str(len(problems_set))) - print(sorted(list(problems_set))) - print("Create Interview List Success") \ No newline at end of file diff --git a/Assets/Scripts/leetcode-problems.csv b/Assets/Scripts/leetcode-problems.csv deleted file mode 100644 index 54c8f30f..00000000 --- a/Assets/Scripts/leetcode-problems.csv +++ /dev/null @@ -1,3141 +0,0 @@ -序号,所在目录,标题,标题末尾,标题链接,标题链接末尾路径,标签,网站题解链接,github 题解链接,通过率,难度,题解数目 -0001,0001-0099,0001. 两数之和,两数之和,https://leetcode.cn/problems/two-sum/,two-sum,数组、哈希表,https://algo.itcharge.cn/Solutions/0001-0099/two-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0001.%20%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C.md,52.9%,简单,21940 -0002,0001-0099,0002. 两数相加,两数相加,https://leetcode.cn/problems/add-two-numbers/,add-two-numbers,递归、链表、数学,https://algo.itcharge.cn/Solutions/0001-0099/add-two-numbers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0002.%20%E4%B8%A4%E6%95%B0%E7%9B%B8%E5%8A%A0.md,42.4%,中等,12149 -0003,0001-0099,0003. 无重复字符的最长子串,无重复字符的最长子串,https://leetcode.cn/problems/longest-substring-without-repeating-characters/,longest-substring-without-repeating-characters,哈希表、字符串、滑动窗口,https://algo.itcharge.cn/Solutions/0001-0099/longest-substring-without-repeating-characters/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0003.%20%E6%97%A0%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2.md,39.1%,中等,13753 -0004,0001-0099,0004. 寻找两个正序数组的中位数,寻找两个正序数组的中位数,https://leetcode.cn/problems/median-of-two-sorted-arrays/,median-of-two-sorted-arrays,数组、二分查找、分治,https://algo.itcharge.cn/Solutions/0001-0099/median-of-two-sorted-arrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0004.%20%E5%AF%BB%E6%89%BE%E4%B8%A4%E4%B8%AA%E6%AD%A3%E5%BA%8F%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0.md,41.5%,困难,6962 -0005,0001-0099,0005. 最长回文子串,最长回文子串,https://leetcode.cn/problems/longest-palindromic-substring/,longest-palindromic-substring,字符串、动态规划,https://algo.itcharge.cn/Solutions/0001-0099/longest-palindromic-substring/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0005.%20%E6%9C%80%E9%95%BF%E5%9B%9E%E6%96%87%E5%AD%90%E4%B8%B2.md,37.6%,中等,7674 -0006,0001-0099,0006. N 字形变换,N 字形变换,https://leetcode.cn/problems/zigzag-conversion/,zigzag-conversion,字符串,https://algo.itcharge.cn/Solutions/0001-0099/zigzag-conversion/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0006.%20N%20%E5%AD%97%E5%BD%A2%E5%8F%98%E6%8D%A2.md,52.0%,中等,4647 -0007,0001-0099,0007. 整数反转,整数反转,https://leetcode.cn/problems/reverse-integer/,reverse-integer,数学,https://algo.itcharge.cn/Solutions/0001-0099/reverse-integer/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0007.%20%E6%95%B4%E6%95%B0%E5%8F%8D%E8%BD%AC.md,35.4%,中等,7244 -0008,0001-0099,0008. 字符串转换整数 (atoi),字符串转换整数 (atoi),https://leetcode.cn/problems/string-to-integer-atoi/,string-to-integer-atoi,字符串,https://algo.itcharge.cn/Solutions/0001-0099/string-to-integer-atoi/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0008.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%BD%AC%E6%8D%A2%E6%95%B4%E6%95%B0%20%28atoi%29.md,21.3%,中等,4293 -0009,0001-0099,0009. 回文数,回文数,https://leetcode.cn/problems/palindrome-number/,palindrome-number,数学,https://algo.itcharge.cn/Solutions/0001-0099/palindrome-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0009.%20%E5%9B%9E%E6%96%87%E6%95%B0.md,56.0%,简单,8400 -0010,0001-0099,0010. 正则表达式匹配,正则表达式匹配,https://leetcode.cn/problems/regular-expression-matching/,regular-expression-matching,递归、字符串、动态规划,https://algo.itcharge.cn/Solutions/0001-0099/regular-expression-matching/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0010.%20%E6%AD%A3%E5%88%99%E8%A1%A8%E8%BE%BE%E5%BC%8F%E5%8C%B9%E9%85%8D.md,30.8%,困难,2200 -0011,0001-0099,0011. 盛最多水的容器,盛最多水的容器,https://leetcode.cn/problems/container-with-most-water/,container-with-most-water,贪心、数组、双指针,https://algo.itcharge.cn/Solutions/0001-0099/container-with-most-water/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0011.%20%E7%9B%9B%E6%9C%80%E5%A4%9A%E6%B0%B4%E7%9A%84%E5%AE%B9%E5%99%A8.md,60.3%,中等,5531 -0012,0001-0099,0012. 整数转罗马数字,整数转罗马数字,https://leetcode.cn/problems/integer-to-roman/,integer-to-roman,哈希表、数学、字符串,https://algo.itcharge.cn/Solutions/0001-0099/integer-to-roman/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0012.%20%E6%95%B4%E6%95%B0%E8%BD%AC%E7%BD%97%E9%A9%AC%E6%95%B0%E5%AD%97.md,66.1%,中等,3016 -0013,0001-0099,0013. 罗马数字转整数,罗马数字转整数,https://leetcode.cn/problems/roman-to-integer/,roman-to-integer,哈希表、数学、字符串,https://algo.itcharge.cn/Solutions/0001-0099/roman-to-integer/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0013.%20%E7%BD%97%E9%A9%AC%E6%95%B0%E5%AD%97%E8%BD%AC%E6%95%B4%E6%95%B0.md,62.0%,简单,6679 -0014,0001-0099,0014. 最长公共前缀,最长公共前缀,https://leetcode.cn/problems/longest-common-prefix/,longest-common-prefix,字典树、字符串,https://algo.itcharge.cn/Solutions/0001-0099/longest-common-prefix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0014.%20%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%89%8D%E7%BC%80.md,43.4%,简单,6736 -0015,0001-0099,0015. 三数之和,三数之和,https://leetcode.cn/problems/3sum/,3sum,数组、双指针、排序,https://algo.itcharge.cn/Solutions/0001-0099/3sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0015.%20%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.md,37.0%,中等,5927 -0016,0001-0099,0016. 最接近的三数之和,最接近的三数之和,https://leetcode.cn/problems/3sum-closest/,3sum-closest,数组、双指针、排序,https://algo.itcharge.cn/Solutions/0001-0099/3sum-closest/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0016.%20%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9A%84%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.md,44.8%,中等,2456 -0017,0001-0099,0017. 电话号码的字母组合,电话号码的字母组合,https://leetcode.cn/problems/letter-combinations-of-a-phone-number/,letter-combinations-of-a-phone-number,哈希表、字符串、回溯,https://algo.itcharge.cn/Solutions/0001-0099/letter-combinations-of-a-phone-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0017.%20%E7%94%B5%E8%AF%9D%E5%8F%B7%E7%A0%81%E7%9A%84%E5%AD%97%E6%AF%8D%E7%BB%84%E5%90%88.md,58.1%,中等,5547 -0018,0001-0099,0018. 四数之和,四数之和,https://leetcode.cn/problems/4sum/,4sum,数组、双指针、排序,https://algo.itcharge.cn/Solutions/0001-0099/4sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0018.%20%E5%9B%9B%E6%95%B0%E4%B9%8B%E5%92%8C.md,36.8%,中等,2880 -0019,0001-0099,0019. 删除链表的倒数第 N 个结点,删除链表的倒数第 N 个结点,https://leetcode.cn/problems/remove-nth-node-from-end-of-list/,remove-nth-node-from-end-of-list,链表、双指针,https://algo.itcharge.cn/Solutions/0001-0099/remove-nth-node-from-end-of-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0019.%20%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E7%9A%84%E5%80%92%E6%95%B0%E7%AC%AC%20N%20%E4%B8%AA%E7%BB%93%E7%82%B9.md,45.6%,中等,7944 -0020,0001-0099,0020. 有效的括号,有效的括号,https://leetcode.cn/problems/valid-parentheses/,valid-parentheses,栈、字符串,https://algo.itcharge.cn/Solutions/0001-0099/valid-parentheses/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0020.%20%E6%9C%89%E6%95%88%E7%9A%84%E6%8B%AC%E5%8F%B7.md,44.0%,简单,9710 -0021,0001-0099,0021. 合并两个有序链表,合并两个有序链表,https://leetcode.cn/problems/merge-two-sorted-lists/,merge-two-sorted-lists,递归、链表,https://algo.itcharge.cn/Solutions/0001-0099/merge-two-sorted-lists/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0021.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E9%93%BE%E8%A1%A8.md,66.2%,简单,7227 -0022,0001-0099,0022. 括号生成,括号生成,https://leetcode.cn/problems/generate-parentheses/,generate-parentheses,字符串、动态规划、回溯,https://algo.itcharge.cn/Solutions/0001-0099/generate-parentheses/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0022.%20%E6%8B%AC%E5%8F%B7%E7%94%9F%E6%88%90.md,77.5%,中等,4751 -0023,0001-0099,0023. 合并 K 个升序链表,合并 K 个升序链表,https://leetcode.cn/problems/merge-k-sorted-lists/,merge-k-sorted-lists,链表、分治、堆（优先队列）、归并排序,https://algo.itcharge.cn/Solutions/0001-0099/merge-k-sorted-lists/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0023.%20%E5%90%88%E5%B9%B6%20K%20%E4%B8%AA%E5%8D%87%E5%BA%8F%E9%93%BE%E8%A1%A8.md,57.8%,困难,4267 -0024,0001-0099,0024. 两两交换链表中的节点,两两交换链表中的节点,https://leetcode.cn/problems/swap-nodes-in-pairs/,swap-nodes-in-pairs,递归、链表,https://algo.itcharge.cn/Solutions/0001-0099/swap-nodes-in-pairs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0024.%20%E4%B8%A4%E4%B8%A4%E4%BA%A4%E6%8D%A2%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E8%8A%82%E7%82%B9.md,71.3%,中等,4583 -0025,0001-0099,0025. K 个一组翻转链表,K 个一组翻转链表,https://leetcode.cn/problems/reverse-nodes-in-k-group/,reverse-nodes-in-k-group,递归、链表,https://algo.itcharge.cn/Solutions/0001-0099/reverse-nodes-in-k-group/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0025.%20K%20%E4%B8%AA%E4%B8%80%E7%BB%84%E7%BF%BB%E8%BD%AC%E9%93%BE%E8%A1%A8.md,67.7%,困难,3911 -0026,0001-0099,0026. 删除有序数组中的重复项,删除有序数组中的重复项,https://leetcode.cn/problems/remove-duplicates-from-sorted-array/,remove-duplicates-from-sorted-array,数组、双指针,https://algo.itcharge.cn/Solutions/0001-0099/remove-duplicates-from-sorted-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0026.%20%E5%88%A0%E9%99%A4%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E9%A1%B9.md,54.8%,简单,8460 -0027,0001-0099,0027. 移除元素,移除元素,https://leetcode.cn/problems/remove-element/,remove-element,数组、双指针,https://algo.itcharge.cn/Solutions/0001-0099/remove-element/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0027.%20%E7%A7%BB%E9%99%A4%E5%85%83%E7%B4%A0.md,59.2%,简单,7895 -0028,0001-0099,0028. 找出字符串中第一个匹配项的下标,找出字符串中第一个匹配项的下标,https://leetcode.cn/problems/find-the-index-of-the-first-occurrence-in-a-string/,find-the-index-of-the-first-occurrence-in-a-string,双指针、字符串、字符串匹配,https://algo.itcharge.cn/Solutions/0001-0099/find-the-index-of-the-first-occurrence-in-a-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0028.%20%E6%89%BE%E5%87%BA%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%8C%B9%E9%85%8D%E9%A1%B9%E7%9A%84%E4%B8%8B%E6%A0%87.md,42.5%,中等,5825 -0029,0001-0099,0029. 两数相除,两数相除,https://leetcode.cn/problems/divide-two-integers/,divide-two-integers,位运算、数学,https://algo.itcharge.cn/Solutions/0001-0099/divide-two-integers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0029.%20%E4%B8%A4%E6%95%B0%E7%9B%B8%E9%99%A4.md,22.2%,中等,1575 -0030,0001-0099,0030. 串联所有单词的子串,串联所有单词的子串,https://leetcode.cn/problems/substring-with-concatenation-of-all-words/,substring-with-concatenation-of-all-words,哈希表、字符串、滑动窗口,https://algo.itcharge.cn/Solutions/0001-0099/substring-with-concatenation-of-all-words/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0030.%20%E4%B8%B2%E8%81%94%E6%89%80%E6%9C%89%E5%8D%95%E8%AF%8D%E7%9A%84%E5%AD%90%E4%B8%B2.md,39.6%,困难,1300 -0031,0001-0099,0031. 下一个排列,下一个排列,https://leetcode.cn/problems/next-permutation/,next-permutation,数组、双指针,https://algo.itcharge.cn/Solutions/0001-0099/next-permutation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0031.%20%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%8E%92%E5%88%97.md,38.3%,中等,3214 -0032,0001-0099,0032. 最长有效括号,最长有效括号,https://leetcode.cn/problems/longest-valid-parentheses/,longest-valid-parentheses,栈、字符串、动态规划,https://algo.itcharge.cn/Solutions/0001-0099/longest-valid-parentheses/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0032.%20%E6%9C%80%E9%95%BF%E6%9C%89%E6%95%88%E6%8B%AC%E5%8F%B7.md,37.2%,困难,2312 -0033,0001-0099,0033. 搜索旋转排序数组,搜索旋转排序数组,https://leetcode.cn/problems/search-in-rotated-sorted-array/,search-in-rotated-sorted-array,数组、二分查找,https://algo.itcharge.cn/Solutions/0001-0099/search-in-rotated-sorted-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0033.%20%E6%90%9C%E7%B4%A2%E6%97%8B%E8%BD%AC%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md,43.8%,中等,4631 -0034,0001-0099,0034. 在排序数组中查找元素的第一个和最后一个位置,在排序数组中查找元素的第一个和最后一个位置,https://leetcode.cn/problems/find-first-and-last-position-of-element-in-sorted-array/,find-first-and-last-position-of-element-in-sorted-array,数组、二分查找,https://algo.itcharge.cn/Solutions/0001-0099/find-first-and-last-position-of-element-in-sorted-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0034.%20%E5%9C%A8%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9F%A5%E6%89%BE%E5%85%83%E7%B4%A0%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%92%8C%E6%9C%80%E5%90%8E%E4%B8%80%E4%B8%AA%E4%BD%8D%E7%BD%AE.md,42.4%,中等,7442 -0035,0001-0099,0035. 搜索插入位置,搜索插入位置,https://leetcode.cn/problems/search-insert-position/,search-insert-position,数组、二分查找,https://algo.itcharge.cn/Solutions/0001-0099/search-insert-position/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0035.%20%E6%90%9C%E7%B4%A2%E6%8F%92%E5%85%A5%E4%BD%8D%E7%BD%AE.md,45.0%,简单,7586 -0036,0001-0099,0036. 有效的数独,有效的数独,https://leetcode.cn/problems/valid-sudoku/,valid-sudoku,数组、哈希表、矩阵,https://algo.itcharge.cn/Solutions/0001-0099/valid-sudoku/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0036.%20%E6%9C%89%E6%95%88%E7%9A%84%E6%95%B0%E7%8B%AC.md,63.0%,中等,2646 -0037,0001-0099,0037. 解数独,解数独,https://leetcode.cn/problems/sudoku-solver/,sudoku-solver,数组、哈希表、回溯、矩阵,https://algo.itcharge.cn/Solutions/0001-0099/sudoku-solver/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0037.%20%E8%A7%A3%E6%95%B0%E7%8B%AC.md,67.6%,困难,1595 -0038,0001-0099,0038. 外观数列,外观数列,https://leetcode.cn/problems/count-and-say/,count-and-say,字符串,https://algo.itcharge.cn/Solutions/0001-0099/count-and-say/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0038.%20%E5%A4%96%E8%A7%82%E6%95%B0%E5%88%97.md,60.4%,中等,3274 -0039,0001-0099,0039. 组合总和,组合总和,https://leetcode.cn/problems/combination-sum/,combination-sum,数组、回溯,https://algo.itcharge.cn/Solutions/0001-0099/combination-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0039.%20%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8C.md,72.4%,中等,3907 -0040,0001-0099,0040. 组合总和 II,组合总和 II,https://leetcode.cn/problems/combination-sum-ii/,combination-sum-ii,数组、回溯,https://algo.itcharge.cn/Solutions/0001-0099/combination-sum-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0040.%20%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8C%20II.md,59.7%,中等,2734 -0041,0001-0099,0041. 缺失的第一个正数,缺失的第一个正数,https://leetcode.cn/problems/first-missing-positive/,first-missing-positive,数组、哈希表,https://algo.itcharge.cn/Solutions/0001-0099/first-missing-positive/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0041.%20%E7%BC%BA%E5%A4%B1%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E6%AD%A3%E6%95%B0.md,43.1%,困难,2202 -0042,0001-0099,0042. 接雨水,接雨水,https://leetcode.cn/problems/trapping-rain-water/,trapping-rain-water,栈、数组、双指针、动态规划、单调栈,https://algo.itcharge.cn/Solutions/0001-0099/trapping-rain-water/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0042.%20%E6%8E%A5%E9%9B%A8%E6%B0%B4.md,62.8%,困难,4396 -0043,0001-0099,0043. 字符串相乘,字符串相乘,https://leetcode.cn/problems/multiply-strings/,multiply-strings,数学、字符串、模拟,https://algo.itcharge.cn/Solutions/0001-0099/multiply-strings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0043.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E4%B9%98.md,44.4%,中等,2056 -0044,0001-0099,0044. 通配符匹配,通配符匹配,https://leetcode.cn/problems/wildcard-matching/,wildcard-matching,贪心、递归、字符串、动态规划,https://algo.itcharge.cn/Solutions/0001-0099/wildcard-matching/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0044.%20%E9%80%9A%E9%85%8D%E7%AC%A6%E5%8C%B9%E9%85%8D.md,33.8%,困难,905 -0045,0001-0099,0045. 跳跃游戏 II,跳跃游戏 II,https://leetcode.cn/problems/jump-game-ii/,jump-game-ii,贪心、数组、动态规划,https://algo.itcharge.cn/Solutions/0001-0099/jump-game-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0045.%20%E8%B7%B3%E8%B7%83%E6%B8%B8%E6%88%8F%20II.md,45.1%,中等,3378 -0046,0001-0099,0046. 全排列,全排列,https://leetcode.cn/problems/permutations/,permutations,数组、回溯,https://algo.itcharge.cn/Solutions/0001-0099/permutations/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0046.%20%E5%85%A8%E6%8E%92%E5%88%97.md,78.9%,中等,5792 -0047,0001-0099,0047. 全排列 II,全排列 II,https://leetcode.cn/problems/permutations-ii/,permutations-ii,数组、回溯,https://algo.itcharge.cn/Solutions/0001-0099/permutations-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0047.%20%E5%85%A8%E6%8E%92%E5%88%97%20II.md,65.5%,中等,2867 -0048,0001-0099,0048. 旋转图像,旋转图像,https://leetcode.cn/problems/rotate-image/,rotate-image,数组、数学、矩阵,https://algo.itcharge.cn/Solutions/0001-0099/rotate-image/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0048.%20%E6%97%8B%E8%BD%AC%E5%9B%BE%E5%83%8F.md,74.7%,中等,4452 -0049,0001-0099,0049. 字母异位词分组,字母异位词分组,https://leetcode.cn/problems/group-anagrams/,group-anagrams,数组、哈希表、字符串、排序,https://algo.itcharge.cn/Solutions/0001-0099/group-anagrams/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0049.%20%E5%AD%97%E6%AF%8D%E5%BC%82%E4%BD%8D%E8%AF%8D%E5%88%86%E7%BB%84.md,67.8%,中等,2594 -0050,0001-0099,"0050. Pow(x, n)","Pow(x, n)",https://leetcode.cn/problems/powx-n/,powx-n,递归、数学,https://algo.itcharge.cn/Solutions/0001-0099/powx-n/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0050.%20Pow%28x%2C%20n%29.md,38.0%,中等,2123 -0051,0001-0099,0051. N 皇后,N 皇后,https://leetcode.cn/problems/n-queens/,n-queens,数组、回溯,https://algo.itcharge.cn/Solutions/0001-0099/n-queens/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0051.%20N%20%E7%9A%87%E5%90%8E.md,74.1%,困难,3011 -0052,0001-0099,0052. N 皇后 II,N 皇后 II,https://leetcode.cn/problems/n-queens-ii/,n-queens-ii,回溯,https://algo.itcharge.cn/Solutions/0001-0099/n-queens-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0052.%20N%20%E7%9A%87%E5%90%8E%20II.md,82.4%,困难,933 -0053,0001-0099,0053. 最大子数组和,最大子数组和,https://leetcode.cn/problems/maximum-subarray/,maximum-subarray,数组、分治、动态规划,https://algo.itcharge.cn/Solutions/0001-0099/maximum-subarray/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0053.%20%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84%E5%92%8C.md,54.8%,中等,6888 -0054,0001-0099,0054. 螺旋矩阵,螺旋矩阵,https://leetcode.cn/problems/spiral-matrix/,spiral-matrix,数组、矩阵、模拟,https://algo.itcharge.cn/Solutions/0001-0099/spiral-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0054.%20%E8%9E%BA%E6%97%8B%E7%9F%A9%E9%98%B5.md,49.3%,中等,3875 -0055,0001-0099,0055. 跳跃游戏,跳跃游戏,https://leetcode.cn/problems/jump-game/,jump-game,贪心、数组、动态规划,https://algo.itcharge.cn/Solutions/0001-0099/jump-game/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0055.%20%E8%B7%B3%E8%B7%83%E6%B8%B8%E6%88%8F.md,43.6%,中等,4932 -0056,0001-0099,0056. 合并区间,合并区间,https://leetcode.cn/problems/merge-intervals/,merge-intervals,数组、排序,https://algo.itcharge.cn/Solutions/0001-0099/merge-intervals/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0056.%20%E5%90%88%E5%B9%B6%E5%8C%BA%E9%97%B4.md,49.4%,中等,4215 -0057,0001-0099,0057. 插入区间,插入区间,https://leetcode.cn/problems/insert-interval/,insert-interval,数组,https://algo.itcharge.cn/Solutions/0001-0099/insert-interval/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0057.%20%E6%8F%92%E5%85%A5%E5%8C%BA%E9%97%B4.md,42.0%,中等,1414 -0058,0001-0099,0058. 最后一个单词的长度,最后一个单词的长度,https://leetcode.cn/problems/length-of-last-word/,length-of-last-word,字符串,https://algo.itcharge.cn/Solutions/0001-0099/length-of-last-word/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0058.%20%E6%9C%80%E5%90%8E%E4%B8%80%E4%B8%AA%E5%8D%95%E8%AF%8D%E7%9A%84%E9%95%BF%E5%BA%A6.md,42.8%,简单,4621 -0059,0001-0099,0059. 螺旋矩阵 II,螺旋矩阵 II,https://leetcode.cn/problems/spiral-matrix-ii/,spiral-matrix-ii,数组、矩阵、模拟,https://algo.itcharge.cn/Solutions/0001-0099/spiral-matrix-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0059.%20%E8%9E%BA%E6%97%8B%E7%9F%A9%E9%98%B5%20II.md,72.8%,中等,3443 -0060,0001-0099,0060. 排列序列,排列序列,https://leetcode.cn/problems/permutation-sequence/,permutation-sequence,递归、数学,https://algo.itcharge.cn/Solutions/0001-0099/permutation-sequence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0060.%20%E6%8E%92%E5%88%97%E5%BA%8F%E5%88%97.md,53.5%,困难,1431 -0061,0001-0099,0061. 旋转链表,旋转链表,https://leetcode.cn/problems/rotate-list/,rotate-list,链表、双指针,https://algo.itcharge.cn/Solutions/0001-0099/rotate-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0061.%20%E6%97%8B%E8%BD%AC%E9%93%BE%E8%A1%A8.md,41.4%,中等,3060 -0062,0001-0099,0062. 不同路径,不同路径,https://leetcode.cn/problems/unique-paths/,unique-paths,数学、动态规划、组合数学,https://algo.itcharge.cn/Solutions/0001-0099/unique-paths/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0062.%20%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84.md,67.8%,中等,4228 -0063,0001-0099,0063. 不同路径 II,不同路径 II,https://leetcode.cn/problems/unique-paths-ii/,unique-paths-ii,数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/0001-0099/unique-paths-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0063.%20%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84%20II.md,41.1%,中等,3006 -0064,0001-0099,0064. 最小路径和,最小路径和,https://leetcode.cn/problems/minimum-path-sum/,minimum-path-sum,数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/0001-0099/minimum-path-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0064.%20%E6%9C%80%E5%B0%8F%E8%B7%AF%E5%BE%84%E5%92%8C.md,69.5%,中等,3408 -0065,0001-0099,0065. 有效数字,有效数字,https://leetcode.cn/problems/valid-number/,valid-number,字符串,https://algo.itcharge.cn/Solutions/0001-0099/valid-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0065.%20%E6%9C%89%E6%95%88%E6%95%B0%E5%AD%97.md,27.6%,困难,924 -0066,0001-0099,0066. 加一,加一,https://leetcode.cn/problems/plus-one/,plus-one,数组、数学,https://algo.itcharge.cn/Solutions/0001-0099/plus-one/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0066.%20%E5%8A%A0%E4%B8%80.md,45.1%,简单,5659 -0067,0001-0099,0067. 二进制求和,二进制求和,https://leetcode.cn/problems/add-binary/,add-binary,位运算、数学、字符串、模拟,https://algo.itcharge.cn/Solutions/0001-0099/add-binary/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0067.%20%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%B1%82%E5%92%8C.md,53.0%,简单,2929 -0068,0001-0099,0068. 文本左右对齐,文本左右对齐,https://leetcode.cn/problems/text-justification/,text-justification,数组、字符串、模拟,https://algo.itcharge.cn/Solutions/0001-0099/text-justification/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0068.%20%E6%96%87%E6%9C%AC%E5%B7%A6%E5%8F%B3%E5%AF%B9%E9%BD%90.md,52.4%,困难,802 -0069,0001-0099,0069. x 的平方根,x 的平方根,https://leetcode.cn/problems/sqrtx/,sqrtx,数学、二分查找,https://algo.itcharge.cn/Solutions/0001-0099/sqrtx/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0069.%20x%20%E7%9A%84%E5%B9%B3%E6%96%B9%E6%A0%B9.md,38.4%,简单,3757 -0070,0001-0099,0070. 爬楼梯,爬楼梯,https://leetcode.cn/problems/climbing-stairs/,climbing-stairs,记忆化搜索、数学、动态规划,https://algo.itcharge.cn/Solutions/0001-0099/climbing-stairs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0070.%20%E7%88%AC%E6%A5%BC%E6%A2%AF.md,54.1%,简单,6311 -0071,0001-0099,0071. 简化路径,简化路径,https://leetcode.cn/problems/simplify-path/,simplify-path,栈、字符串,https://algo.itcharge.cn/Solutions/0001-0099/simplify-path/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0071.%20%E7%AE%80%E5%8C%96%E8%B7%AF%E5%BE%84.md,44.2%,中等,1650 -0072,0001-0099,0072. 编辑距离,编辑距离,https://leetcode.cn/problems/edit-distance/,edit-distance,字符串、动态规划,https://algo.itcharge.cn/Solutions/0001-0099/edit-distance/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0072.%20%E7%BC%96%E8%BE%91%E8%B7%9D%E7%A6%BB.md,62.8%,困难,3123 -0073,0001-0099,0073. 矩阵置零,矩阵置零,https://leetcode.cn/problems/set-matrix-zeroes/,set-matrix-zeroes,数组、哈希表、矩阵,https://algo.itcharge.cn/Solutions/0001-0099/set-matrix-zeroes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0073.%20%E7%9F%A9%E9%98%B5%E7%BD%AE%E9%9B%B6.md,63.2%,中等,1831 -0074,0001-0099,0074. 搜索二维矩阵,搜索二维矩阵,https://leetcode.cn/problems/search-a-2d-matrix/,search-a-2d-matrix,数组、二分查找、矩阵,https://algo.itcharge.cn/Solutions/0001-0099/search-a-2d-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0074.%20%E6%90%9C%E7%B4%A2%E4%BA%8C%E7%BB%B4%E7%9F%A9%E9%98%B5.md,48.7%,中等,2963 -0075,0001-0099,0075. 颜色分类,颜色分类,https://leetcode.cn/problems/sort-colors/,sort-colors,数组、双指针、排序,https://algo.itcharge.cn/Solutions/0001-0099/sort-colors/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0075.%20%E9%A2%9C%E8%89%B2%E5%88%86%E7%B1%BB.md,60.4%,中等,3600 -0076,0001-0099,0076. 最小覆盖子串,最小覆盖子串,https://leetcode.cn/problems/minimum-window-substring/,minimum-window-substring,哈希表、字符串、滑动窗口,https://algo.itcharge.cn/Solutions/0001-0099/minimum-window-substring/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0076.%20%E6%9C%80%E5%B0%8F%E8%A6%86%E7%9B%96%E5%AD%90%E4%B8%B2.md,45.2%,困难,3407 -0077,0001-0099,0077. 组合,组合,https://leetcode.cn/problems/combinations/,combinations,回溯,https://algo.itcharge.cn/Solutions/0001-0099/combinations/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0077.%20%E7%BB%84%E5%90%88.md,77.1%,中等,2912 -0078,0001-0099,0078. 子集,子集,https://leetcode.cn/problems/subsets/,subsets,位运算、数组、回溯,https://algo.itcharge.cn/Solutions/0001-0099/subsets/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0078.%20%E5%AD%90%E9%9B%86.md,81.1%,中等,4313 -0079,0001-0099,0079. 单词搜索,单词搜索,https://leetcode.cn/problems/word-search/,word-search,数组、回溯、矩阵,https://algo.itcharge.cn/Solutions/0001-0099/word-search/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0079.%20%E5%8D%95%E8%AF%8D%E6%90%9C%E7%B4%A2.md,46.3%,中等,2603 -0080,0001-0099,0080. 删除有序数组中的重复项 II,删除有序数组中的重复项 II,https://leetcode.cn/problems/remove-duplicates-from-sorted-array-ii/,remove-duplicates-from-sorted-array-ii,数组、双指针,https://algo.itcharge.cn/Solutions/0001-0099/remove-duplicates-from-sorted-array-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0080.%20%E5%88%A0%E9%99%A4%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E9%A1%B9%20II.md,61.7%,中等,1974 -0081,0001-0099,0081. 搜索旋转排序数组 II,搜索旋转排序数组 II,https://leetcode.cn/problems/search-in-rotated-sorted-array-ii/,search-in-rotated-sorted-array-ii,数组、二分查找,https://algo.itcharge.cn/Solutions/0001-0099/search-in-rotated-sorted-array-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0081.%20%E6%90%9C%E7%B4%A2%E6%97%8B%E8%BD%AC%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%20II.md,41.0%,中等,1461 -0082,0001-0099,0082. 删除排序链表中的重复元素 II,删除排序链表中的重复元素 II,https://leetcode.cn/problems/remove-duplicates-from-sorted-list-ii/,remove-duplicates-from-sorted-list-ii,链表、双指针,https://algo.itcharge.cn/Solutions/0001-0099/remove-duplicates-from-sorted-list-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0082.%20%E5%88%A0%E9%99%A4%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0%20II.md,53.5%,中等,2784 -0083,0001-0099,0083. 删除排序链表中的重复元素,删除排序链表中的重复元素,https://leetcode.cn/problems/remove-duplicates-from-sorted-list/,remove-duplicates-from-sorted-list,链表,https://algo.itcharge.cn/Solutions/0001-0099/remove-duplicates-from-sorted-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0083.%20%E5%88%A0%E9%99%A4%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0.md,53.1%,简单,3606 -0084,0001-0099,0084. 柱状图中最大的矩形,柱状图中最大的矩形,https://leetcode.cn/problems/largest-rectangle-in-histogram/,largest-rectangle-in-histogram,栈、数组、单调栈,https://algo.itcharge.cn/Solutions/0001-0099/largest-rectangle-in-histogram/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0084.%20%E6%9F%B1%E7%8A%B6%E5%9B%BE%E4%B8%AD%E6%9C%80%E5%A4%A7%E7%9A%84%E7%9F%A9%E5%BD%A2.md,45.0%,困难,1984 -0085,0001-0099,0085. 最大矩形,最大矩形,https://leetcode.cn/problems/maximal-rectangle/,maximal-rectangle,栈、数组、动态规划、矩阵、单调栈,https://algo.itcharge.cn/Solutions/0001-0099/maximal-rectangle/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0085.%20%E6%9C%80%E5%A4%A7%E7%9F%A9%E5%BD%A2.md,54.7%,困难,1196 -0086,0001-0099,0086. 分隔链表,分隔链表,https://leetcode.cn/problems/partition-list/,partition-list,链表、双指针,https://algo.itcharge.cn/Solutions/0001-0099/partition-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0086.%20%E5%88%86%E9%9A%94%E9%93%BE%E8%A1%A8.md,64.2%,中等,2083 -0087,0001-0099,0087. 扰乱字符串,扰乱字符串,https://leetcode.cn/problems/scramble-string/,scramble-string,字符串、动态规划,https://algo.itcharge.cn/Solutions/0001-0099/scramble-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0087.%20%E6%89%B0%E4%B9%B1%E5%AD%97%E7%AC%A6%E4%B8%B2.md,47.3%,困难,440 -0088,0001-0099,0088. 合并两个有序数组,合并两个有序数组,https://leetcode.cn/problems/merge-sorted-array/,merge-sorted-array,数组、双指针、排序,https://algo.itcharge.cn/Solutions/0001-0099/merge-sorted-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0088.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84.md,52.5%,简单,6055 -0089,0001-0099,0089. 格雷编码,格雷编码,https://leetcode.cn/problems/gray-code/,gray-code,位运算、数学、回溯,https://algo.itcharge.cn/Solutions/0001-0099/gray-code/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0089.%20%E6%A0%BC%E9%9B%B7%E7%BC%96%E7%A0%81.md,75.5%,中等,906 -0090,0001-0099,0090. 子集 II,子集 II,https://leetcode.cn/problems/subsets-ii/,subsets-ii,位运算、数组、回溯,https://algo.itcharge.cn/Solutions/0001-0099/subsets-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0090.%20%E5%AD%90%E9%9B%86%20II.md,63.6%,中等,2267 -0091,0001-0099,0091. 解码方法,解码方法,https://leetcode.cn/problems/decode-ways/,decode-ways,字符串、动态规划,https://algo.itcharge.cn/Solutions/0001-0099/decode-ways/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0091.%20%E8%A7%A3%E7%A0%81%E6%96%B9%E6%B3%95.md,33.2%,中等,2315 -0092,0001-0099,0092. 反转链表 II,反转链表 II,https://leetcode.cn/problems/reverse-linked-list-ii/,reverse-linked-list-ii,链表,https://algo.itcharge.cn/Solutions/0001-0099/reverse-linked-list-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0092.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8%20II.md,55.7%,中等,3711 -0093,0001-0099,0093. 复原 IP 地址,复原 IP 地址,https://leetcode.cn/problems/restore-ip-addresses/,restore-ip-addresses,字符串、回溯,https://algo.itcharge.cn/Solutions/0001-0099/restore-ip-addresses/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0093.%20%E5%A4%8D%E5%8E%9F%20IP%20%E5%9C%B0%E5%9D%80.md,58.1%,中等,2476 -0094,0001-0099,0094. 二叉树的中序遍历,二叉树的中序遍历,https://leetcode.cn/problems/binary-tree-inorder-traversal/,binary-tree-inorder-traversal,栈、树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0001-0099/binary-tree-inorder-traversal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0094.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E4%B8%AD%E5%BA%8F%E9%81%8D%E5%8E%86.md,76.2%,简单,4277 -0095,0001-0099,0095. 不同的二叉搜索树 II,不同的二叉搜索树 II,https://leetcode.cn/problems/unique-binary-search-trees-ii/,unique-binary-search-trees-ii,树、二叉搜索树、动态规划、回溯、二叉树,https://algo.itcharge.cn/Solutions/0001-0099/unique-binary-search-trees-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0095.%20%E4%B8%8D%E5%90%8C%E7%9A%84%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%20II.md,73.4%,中等,1054 -0096,0001-0099,0096. 不同的二叉搜索树,不同的二叉搜索树,https://leetcode.cn/problems/unique-binary-search-trees/,unique-binary-search-trees,树、二叉搜索树、数学、动态规划、二叉树,https://algo.itcharge.cn/Solutions/0001-0099/unique-binary-search-trees/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0096.%20%E4%B8%8D%E5%90%8C%E7%9A%84%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md,70.9%,中等,2502 -0097,0001-0099,0097. 交错字符串,交错字符串,https://leetcode.cn/problems/interleaving-string/,interleaving-string,字符串、动态规划,https://algo.itcharge.cn/Solutions/0001-0099/interleaving-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0097.%20%E4%BA%A4%E9%94%99%E5%AD%97%E7%AC%A6%E4%B8%B2.md,44.7%,中等,888 -0098,0001-0099,0098. 验证二叉搜索树,验证二叉搜索树,https://leetcode.cn/problems/validate-binary-search-tree/,validate-binary-search-tree,树、深度优先搜索、二叉搜索树、二叉树,https://algo.itcharge.cn/Solutions/0001-0099/validate-binary-search-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0098.%20%E9%AA%8C%E8%AF%81%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md,37.0%,中等,4035 -0099,0001-0099,0099. 恢复二叉搜索树,恢复二叉搜索树,https://leetcode.cn/problems/recover-binary-search-tree/,recover-binary-search-tree,树、深度优先搜索、二叉搜索树、二叉树,https://algo.itcharge.cn/Solutions/0001-0099/recover-binary-search-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0099.%20%E6%81%A2%E5%A4%8D%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md,60.3%,中等,1091 -0100,0100-0199,0100. 相同的树,相同的树,https://leetcode.cn/problems/same-tree/,same-tree,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0100-0199/same-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0100.%20%E7%9B%B8%E5%90%8C%E7%9A%84%E6%A0%91.md,60.0%,简单,3145 -0101,0100-0199,0101. 对称二叉树,对称二叉树,https://leetcode.cn/problems/symmetric-tree/,symmetric-tree,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0100-0199/symmetric-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0101.%20%E5%AF%B9%E7%A7%B0%E4%BA%8C%E5%8F%89%E6%A0%91.md,58.8%,简单,4297 -0102,0100-0199,0102. 二叉树的层序遍历,二叉树的层序遍历,https://leetcode.cn/problems/binary-tree-level-order-traversal/,binary-tree-level-order-traversal,树、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0100-0199/binary-tree-level-order-traversal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0102.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%B1%82%E5%BA%8F%E9%81%8D%E5%8E%86.md,65.6%,中等,4512 -0103,0100-0199,0103. 二叉树的锯齿形层序遍历,二叉树的锯齿形层序遍历,https://leetcode.cn/problems/binary-tree-zigzag-level-order-traversal/,binary-tree-zigzag-level-order-traversal,树、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0100-0199/binary-tree-zigzag-level-order-traversal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0103.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%94%AF%E9%BD%BF%E5%BD%A2%E5%B1%82%E5%BA%8F%E9%81%8D%E5%8E%86.md,57.5%,中等,2476 -0104,0100-0199,0104. 二叉树的最大深度,二叉树的最大深度,https://leetcode.cn/problems/maximum-depth-of-binary-tree/,maximum-depth-of-binary-tree,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0100-0199/maximum-depth-of-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0104.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%A4%A7%E6%B7%B1%E5%BA%A6.md,77.1%,简单,5159 -0105,0100-0199,0105. 从前序与中序遍历序列构造二叉树,从前序与中序遍历序列构造二叉树,https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-inorder-traversal/,construct-binary-tree-from-preorder-and-inorder-traversal,树、数组、哈希表、分治、二叉树,https://algo.itcharge.cn/Solutions/0100-0199/construct-binary-tree-from-preorder-and-inorder-traversal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0105.%20%E4%BB%8E%E5%89%8D%E5%BA%8F%E4%B8%8E%E4%B8%AD%E5%BA%8F%E9%81%8D%E5%8E%86%E5%BA%8F%E5%88%97%E6%9E%84%E9%80%A0%E4%BA%8C%E5%8F%89%E6%A0%91.md,71.3%,中等,2626 -0106,0100-0199,0106. 从中序与后序遍历序列构造二叉树,从中序与后序遍历序列构造二叉树,https://leetcode.cn/problems/construct-binary-tree-from-inorder-and-postorder-traversal/,construct-binary-tree-from-inorder-and-postorder-traversal,树、数组、哈希表、分治、二叉树,https://algo.itcharge.cn/Solutions/0100-0199/construct-binary-tree-from-inorder-and-postorder-traversal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0106.%20%E4%BB%8E%E4%B8%AD%E5%BA%8F%E4%B8%8E%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86%E5%BA%8F%E5%88%97%E6%9E%84%E9%80%A0%E4%BA%8C%E5%8F%89%E6%A0%91.md,72.1%,中等,1737 -0107,0100-0199,0107. 二叉树的层序遍历 II,二叉树的层序遍历 II,https://leetcode.cn/problems/binary-tree-level-order-traversal-ii/,binary-tree-level-order-traversal-ii,树、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0100-0199/binary-tree-level-order-traversal-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0107.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%B1%82%E5%BA%8F%E9%81%8D%E5%8E%86%20II.md,72.5%,中等,1973 -0108,0100-0199,0108. 将有序数组转换为二叉搜索树,将有序数组转换为二叉搜索树,https://leetcode.cn/problems/convert-sorted-array-to-binary-search-tree/,convert-sorted-array-to-binary-search-tree,树、二叉搜索树、数组、分治、二叉树,https://algo.itcharge.cn/Solutions/0100-0199/convert-sorted-array-to-binary-search-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0108.%20%E5%B0%86%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E8%BD%AC%E6%8D%A2%E4%B8%BA%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md,77.4%,简单,2082 -0109,0100-0199,0109. 有序链表转换二叉搜索树,有序链表转换二叉搜索树,https://leetcode.cn/problems/convert-sorted-list-to-binary-search-tree/,convert-sorted-list-to-binary-search-tree,树、二叉搜索树、链表、分治、二叉树,https://algo.itcharge.cn/Solutions/0100-0199/convert-sorted-list-to-binary-search-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0109.%20%E6%9C%89%E5%BA%8F%E9%93%BE%E8%A1%A8%E8%BD%AC%E6%8D%A2%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md,76.5%,中等,1116 -0110,0100-0199,0110. 平衡二叉树,平衡二叉树,https://leetcode.cn/problems/balanced-binary-tree/,balanced-binary-tree,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0100-0199/balanced-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0110.%20%E5%B9%B3%E8%A1%A1%E4%BA%8C%E5%8F%89%E6%A0%91.md,57.5%,简单,2586 -0111,0100-0199,0111. 二叉树的最小深度,二叉树的最小深度,https://leetcode.cn/problems/minimum-depth-of-binary-tree/,minimum-depth-of-binary-tree,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0100-0199/minimum-depth-of-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0111.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%B0%8F%E6%B7%B1%E5%BA%A6.md,52.2%,简单,3859 -0112,0100-0199,0112. 路径总和,路径总和,https://leetcode.cn/problems/path-sum/,path-sum,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0100-0199/path-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0112.%20%E8%B7%AF%E5%BE%84%E6%80%BB%E5%92%8C.md,53.5%,简单,3126 -0113,0100-0199,0113. 路径总和 II,路径总和 II,https://leetcode.cn/problems/path-sum-ii/,path-sum-ii,树、深度优先搜索、回溯、二叉树,https://algo.itcharge.cn/Solutions/0100-0199/path-sum-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0113.%20%E8%B7%AF%E5%BE%84%E6%80%BB%E5%92%8C%20II.md,63.2%,中等,2216 -0114,0100-0199,0114. 二叉树展开为链表,二叉树展开为链表,https://leetcode.cn/problems/flatten-binary-tree-to-linked-list/,flatten-binary-tree-to-linked-list,栈、树、深度优先搜索、链表、二叉树,https://algo.itcharge.cn/Solutions/0100-0199/flatten-binary-tree-to-linked-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0114.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E5%B1%95%E5%BC%80%E4%B8%BA%E9%93%BE%E8%A1%A8.md,73.0%,中等,2921 -0115,0100-0199,0115. 不同的子序列,不同的子序列,https://leetcode.cn/problems/distinct-subsequences/,distinct-subsequences,字符串、动态规划,https://algo.itcharge.cn/Solutions/0100-0199/distinct-subsequences/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0115.%20%E4%B8%8D%E5%90%8C%E7%9A%84%E5%AD%90%E5%BA%8F%E5%88%97.md,52.2%,困难,1251 -0116,0100-0199,0116. 填充每个节点的下一个右侧节点指针,填充每个节点的下一个右侧节点指针,https://leetcode.cn/problems/populating-next-right-pointers-in-each-node/,populating-next-right-pointers-in-each-node,树、深度优先搜索、广度优先搜索、链表、二叉树,https://algo.itcharge.cn/Solutions/0100-0199/populating-next-right-pointers-in-each-node/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0116.%20%E5%A1%AB%E5%85%85%E6%AF%8F%E4%B8%AA%E8%8A%82%E7%82%B9%E7%9A%84%E4%B8%8B%E4%B8%80%E4%B8%AA%E5%8F%B3%E4%BE%A7%E8%8A%82%E7%82%B9%E6%8C%87%E9%92%88.md,72.6%,中等,2653 -0117,0100-0199,0117. 填充每个节点的下一个右侧节点指针 II,填充每个节点的下一个右侧节点指针 II,https://leetcode.cn/problems/populating-next-right-pointers-in-each-node-ii/,populating-next-right-pointers-in-each-node-ii,树、深度优先搜索、广度优先搜索、链表、二叉树,https://algo.itcharge.cn/Solutions/0100-0199/populating-next-right-pointers-in-each-node-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0117.%20%E5%A1%AB%E5%85%85%E6%AF%8F%E4%B8%AA%E8%8A%82%E7%82%B9%E7%9A%84%E4%B8%8B%E4%B8%80%E4%B8%AA%E5%8F%B3%E4%BE%A7%E8%8A%82%E7%82%B9%E6%8C%87%E9%92%88%20II.md,65.8%,中等,1378 -0118,0100-0199,0118. 杨辉三角,杨辉三角,https://leetcode.cn/problems/pascals-triangle/,pascals-triangle,数组、动态规划,https://algo.itcharge.cn/Solutions/0100-0199/pascals-triangle/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0118.%20%E6%9D%A8%E8%BE%89%E4%B8%89%E8%A7%92.md,75.5%,简单,3186 -0119,0100-0199,0119. 杨辉三角 II,杨辉三角 II,https://leetcode.cn/problems/pascals-triangle-ii/,pascals-triangle-ii,数组、动态规划,https://algo.itcharge.cn/Solutions/0100-0199/pascals-triangle-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0119.%20%E6%9D%A8%E8%BE%89%E4%B8%89%E8%A7%92%20II.md,68.9%,简单,2067 -0120,0100-0199,0120. 三角形最小路径和,三角形最小路径和,https://leetcode.cn/problems/triangle/,triangle,数组、动态规划,https://algo.itcharge.cn/Solutions/0100-0199/triangle/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0120.%20%E4%B8%89%E8%A7%92%E5%BD%A2%E6%9C%80%E5%B0%8F%E8%B7%AF%E5%BE%84%E5%92%8C.md,68.7%,中等,2422 -0121,0100-0199,0121. 买卖股票的最佳时机,买卖股票的最佳时机,https://leetcode.cn/problems/best-time-to-buy-and-sell-stock/,best-time-to-buy-and-sell-stock,数组、动态规划,https://algo.itcharge.cn/Solutions/0100-0199/best-time-to-buy-and-sell-stock/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0121.%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA.md,58.0%,简单,6175 -0122,0100-0199,0122. 买卖股票的最佳时机 II,买卖股票的最佳时机 II,https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/,best-time-to-buy-and-sell-stock-ii,贪心、数组,https://algo.itcharge.cn/Solutions/0100-0199/best-time-to-buy-and-sell-stock-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0122.%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA%20II.md,72.0%,中等,4616 -0123,0100-0199,0123. 买卖股票的最佳时机 III,买卖股票的最佳时机 III,https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-iii/,best-time-to-buy-and-sell-stock-iii,数组、动态规划,https://algo.itcharge.cn/Solutions/0100-0199/best-time-to-buy-and-sell-stock-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0123.%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA%20III.md,58.8%,困难,1475 -0124,0100-0199,0124. 二叉树中的最大路径和,二叉树中的最大路径和,https://leetcode.cn/problems/binary-tree-maximum-path-sum/,binary-tree-maximum-path-sum,树、深度优先搜索、动态规划、二叉树,https://algo.itcharge.cn/Solutions/0100-0199/binary-tree-maximum-path-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0124.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E8%B7%AF%E5%BE%84%E5%92%8C.md,45.3%,困难,1948 -0125,0100-0199,0125. 验证回文串,验证回文串,https://leetcode.cn/problems/valid-palindrome/,valid-palindrome,双指针、字符串,https://algo.itcharge.cn/Solutions/0100-0199/valid-palindrome/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0125.%20%E9%AA%8C%E8%AF%81%E5%9B%9E%E6%96%87%E4%B8%B2.md,46.4%,简单,2976 -0126,0100-0199,0126. 单词接龙 II,单词接龙 II,https://leetcode.cn/problems/word-ladder-ii/,word-ladder-ii,广度优先搜索、哈希表、字符串、回溯,https://algo.itcharge.cn/Solutions/0100-0199/word-ladder-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0126.%20%E5%8D%95%E8%AF%8D%E6%8E%A5%E9%BE%99%20II.md,37.9%,困难,493 -0127,0100-0199,0127. 单词接龙,单词接龙,https://leetcode.cn/problems/word-ladder/,word-ladder,广度优先搜索、哈希表、字符串,https://algo.itcharge.cn/Solutions/0100-0199/word-ladder/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0127.%20%E5%8D%95%E8%AF%8D%E6%8E%A5%E9%BE%99.md,48.3%,困难,1008 -0128,0100-0199,0128. 最长连续序列,最长连续序列,https://leetcode.cn/problems/longest-consecutive-sequence/,longest-consecutive-sequence,并查集、数组、哈希表,https://algo.itcharge.cn/Solutions/0100-0199/longest-consecutive-sequence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0128.%20%E6%9C%80%E9%95%BF%E8%BF%9E%E7%BB%AD%E5%BA%8F%E5%88%97.md,54.7%,中等,2349 -0129,0100-0199,0129. 求根节点到叶节点数字之和,求根节点到叶节点数字之和,https://leetcode.cn/problems/sum-root-to-leaf-numbers/,sum-root-to-leaf-numbers,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0100-0199/sum-root-to-leaf-numbers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0129.%20%E6%B1%82%E6%A0%B9%E8%8A%82%E7%82%B9%E5%88%B0%E5%8F%B6%E8%8A%82%E7%82%B9%E6%95%B0%E5%AD%97%E4%B9%8B%E5%92%8C.md,70.1%,中等,1772 -0130,0100-0199,0130. 被围绕的区域,被围绕的区域,https://leetcode.cn/problems/surrounded-regions/,surrounded-regions,深度优先搜索、广度优先搜索、并查集、数组、矩阵,https://algo.itcharge.cn/Solutions/0100-0199/surrounded-regions/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0130.%20%E8%A2%AB%E5%9B%B4%E7%BB%95%E7%9A%84%E5%8C%BA%E5%9F%9F.md,46.2%,中等,2210 -0131,0100-0199,0131. 分割回文串,分割回文串,https://leetcode.cn/problems/palindrome-partitioning/,palindrome-partitioning,字符串、动态规划、回溯,https://algo.itcharge.cn/Solutions/0100-0199/palindrome-partitioning/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0131.%20%E5%88%86%E5%89%B2%E5%9B%9E%E6%96%87%E4%B8%B2.md,73.4%,中等,1739 -0132,0100-0199,0132. 分割回文串 II,分割回文串 II,https://leetcode.cn/problems/palindrome-partitioning-ii/,palindrome-partitioning-ii,字符串、动态规划,https://algo.itcharge.cn/Solutions/0100-0199/palindrome-partitioning-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0132.%20%E5%88%86%E5%89%B2%E5%9B%9E%E6%96%87%E4%B8%B2%20II.md,49.9%,困难,621 -0133,0100-0199,0133. 克隆图,克隆图,https://leetcode.cn/problems/clone-graph/,clone-graph,深度优先搜索、广度优先搜索、图、哈希表,https://algo.itcharge.cn/Solutions/0100-0199/clone-graph/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0133.%20%E5%85%8B%E9%9A%86%E5%9B%BE.md,69.0%,中等,805 -0134,0100-0199,0134. 加油站,加油站,https://leetcode.cn/problems/gas-station/,gas-station,贪心、数组,https://algo.itcharge.cn/Solutions/0100-0199/gas-station/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0134.%20%E5%8A%A0%E6%B2%B9%E7%AB%99.md,51.3%,中等,1732 -0135,0100-0199,0135. 分发糖果,分发糖果,https://leetcode.cn/problems/candy/,candy,贪心、数组,https://algo.itcharge.cn/Solutions/0100-0199/candy/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0135.%20%E5%88%86%E5%8F%91%E7%B3%96%E6%9E%9C.md,50.5%,困难,1557 -0136,0100-0199,0136. 只出现一次的数字,只出现一次的数字,https://leetcode.cn/problems/single-number/,single-number,位运算、数组,https://algo.itcharge.cn/Solutions/0100-0199/single-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0136.%20%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B0%E5%AD%97.md,72.3%,简单,4067 -0137,0100-0199,0137. 只出现一次的数字 II,只出现一次的数字 II,https://leetcode.cn/problems/single-number-ii/,single-number-ii,位运算、数组,https://algo.itcharge.cn/Solutions/0100-0199/single-number-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0137.%20%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B0%E5%AD%97%20II.md,71.8%,中等,1089 -0138,0100-0199,0138. 复制带随机指针的链表,复制带随机指针的链表,https://leetcode.cn/problems/copy-list-with-random-pointer/,copy-list-with-random-pointer,哈希表、链表,https://algo.itcharge.cn/Solutions/0100-0199/copy-list-with-random-pointer/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0138.%20%E5%A4%8D%E5%88%B6%E5%B8%A6%E9%9A%8F%E6%9C%BA%E6%8C%87%E9%92%88%E7%9A%84%E9%93%BE%E8%A1%A8.md,66.0%,中等,1403 -0139,0100-0199,0139. 单词拆分,单词拆分,https://leetcode.cn/problems/word-break/,word-break,字典树、记忆化搜索、数组、哈希表、字符串、动态规划,https://algo.itcharge.cn/Solutions/0100-0199/word-break/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0139.%20%E5%8D%95%E8%AF%8D%E6%8B%86%E5%88%86.md,54.2%,中等,2500 -0140,0100-0199,0140. 单词拆分 II,单词拆分 II,https://leetcode.cn/problems/word-break-ii/,word-break-ii,字典树、记忆化搜索、数组、哈希表、字符串、动态规划、回溯,https://algo.itcharge.cn/Solutions/0100-0199/word-break-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0140.%20%E5%8D%95%E8%AF%8D%E6%8B%86%E5%88%86%20II.md,57.2%,困难,996 -0141,0100-0199,0141. 环形链表,环形链表,https://leetcode.cn/problems/linked-list-cycle/,linked-list-cycle,哈希表、链表、双指针,https://algo.itcharge.cn/Solutions/0100-0199/linked-list-cycle/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0141.%20%E7%8E%AF%E5%BD%A2%E9%93%BE%E8%A1%A8.md,51.6%,简单,5009 -0142,0100-0199,0142. 环形链表 II,环形链表 II,https://leetcode.cn/problems/linked-list-cycle-ii/,linked-list-cycle-ii,哈希表、链表、双指针,https://algo.itcharge.cn/Solutions/0100-0199/linked-list-cycle-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0142.%20%E7%8E%AF%E5%BD%A2%E9%93%BE%E8%A1%A8%20II.md,57.1%,中等,3798 -0143,0100-0199,0143. 重排链表,重排链表,https://leetcode.cn/problems/reorder-list/,reorder-list,栈、递归、链表、双指针,https://algo.itcharge.cn/Solutions/0100-0199/reorder-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0143.%20%E9%87%8D%E6%8E%92%E9%93%BE%E8%A1%A8.md,64.9%,中等,1851 -0144,0100-0199,0144. 二叉树的前序遍历,二叉树的前序遍历,https://leetcode.cn/problems/binary-tree-preorder-traversal/,binary-tree-preorder-traversal,栈、树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0100-0199/binary-tree-preorder-traversal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0144.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%89%8D%E5%BA%8F%E9%81%8D%E5%8E%86.md,71.3%,简单,3566 -0145,0100-0199,0145. 二叉树的后序遍历,二叉树的后序遍历,https://leetcode.cn/problems/binary-tree-postorder-traversal/,binary-tree-postorder-traversal,栈、树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0100-0199/binary-tree-postorder-traversal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0145.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86.md,76.3%,简单,2714 -0146,0100-0199,0146. LRU 缓存,LRU 缓存,https://leetcode.cn/problems/lru-cache/,lru-cache,设计、哈希表、链表、双向链表,https://algo.itcharge.cn/Solutions/0100-0199/lru-cache/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0146.%20LRU%20%E7%BC%93%E5%AD%98.md,53.5%,中等,3603 -0147,0100-0199,0147. 对链表进行插入排序,对链表进行插入排序,https://leetcode.cn/problems/insertion-sort-list/,insertion-sort-list,链表、排序,https://algo.itcharge.cn/Solutions/0100-0199/insertion-sort-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0147.%20%E5%AF%B9%E9%93%BE%E8%A1%A8%E8%BF%9B%E8%A1%8C%E6%8F%92%E5%85%A5%E6%8E%92%E5%BA%8F.md,69.5%,中等,1107 -0148,0100-0199,0148. 排序链表,排序链表,https://leetcode.cn/problems/sort-list/,sort-list,链表、双指针、分治、排序、归并排序,https://algo.itcharge.cn/Solutions/0100-0199/sort-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0148.%20%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8.md,65.7%,中等,2196 -0149,0100-0199,0149. 直线上最多的点数,直线上最多的点数,https://leetcode.cn/problems/max-points-on-a-line/,max-points-on-a-line,几何、数组、哈希表、数学,https://algo.itcharge.cn/Solutions/0100-0199/max-points-on-a-line/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0149.%20%E7%9B%B4%E7%BA%BF%E4%B8%8A%E6%9C%80%E5%A4%9A%E7%9A%84%E7%82%B9%E6%95%B0.md,39.3%,困难,786 -0150,0100-0199,0150. 逆波兰表达式求值,逆波兰表达式求值,https://leetcode.cn/problems/evaluate-reverse-polish-notation/,evaluate-reverse-polish-notation,栈、数组、数学,https://algo.itcharge.cn/Solutions/0100-0199/evaluate-reverse-polish-notation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0150.%20%E9%80%86%E6%B3%A2%E5%85%B0%E8%A1%A8%E8%BE%BE%E5%BC%8F%E6%B1%82%E5%80%BC.md,52.7%,中等,1962 -0151,0100-0199,0151. 反转字符串中的单词,反转字符串中的单词,https://leetcode.cn/problems/reverse-words-in-a-string/,reverse-words-in-a-string,双指针、字符串,https://algo.itcharge.cn/Solutions/0100-0199/reverse-words-in-a-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0151.%20%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%8D%95%E8%AF%8D.md,51.8%,中等,3043 -0152,0100-0199,0152. 乘积最大子数组,乘积最大子数组,https://leetcode.cn/problems/maximum-product-subarray/,maximum-product-subarray,数组、动态规划,https://algo.itcharge.cn/Solutions/0100-0199/maximum-product-subarray/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0152.%20%E4%B9%98%E7%A7%AF%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84.md,43.1%,中等,2142 -0153,0100-0199,0153. 寻找旋转排序数组中的最小值,寻找旋转排序数组中的最小值,https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array/,find-minimum-in-rotated-sorted-array,数组、二分查找,https://algo.itcharge.cn/Solutions/0100-0199/find-minimum-in-rotated-sorted-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0153.%20%E5%AF%BB%E6%89%BE%E6%97%8B%E8%BD%AC%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9C%80%E5%B0%8F%E5%80%BC.md,57.0%,中等,2473 -0154,0100-0199,0154. 寻找旋转排序数组中的最小值 II,寻找旋转排序数组中的最小值 II,https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array-ii/,find-minimum-in-rotated-sorted-array-ii,数组、二分查找,https://algo.itcharge.cn/Solutions/0100-0199/find-minimum-in-rotated-sorted-array-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0154.%20%E5%AF%BB%E6%89%BE%E6%97%8B%E8%BD%AC%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9C%80%E5%B0%8F%E5%80%BC%20II.md,52.5%,困难,1287 -0155,0100-0199,0155. 最小栈,最小栈,https://leetcode.cn/problems/min-stack/,min-stack,栈、设计,https://algo.itcharge.cn/Solutions/0100-0199/min-stack/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0155.%20%E6%9C%80%E5%B0%8F%E6%A0%88.md,59.0%,中等,2550 -0156,0100-0199,0156. 上下翻转二叉树,上下翻转二叉树,https://leetcode.cn/problems/binary-tree-upside-down/,binary-tree-upside-down,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0100-0199/binary-tree-upside-down/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0156.%20%E4%B8%8A%E4%B8%8B%E7%BF%BB%E8%BD%AC%E4%BA%8C%E5%8F%89%E6%A0%91.md,72.3%,中等,234 -0157,0100-0199,0157. 用 Read4 读取 N 个字符,用 Read4 读取 N 个字符,https://leetcode.cn/problems/read-n-characters-given-read4/,read-n-characters-given-read4,字符串、交互、模拟,https://algo.itcharge.cn/Solutions/0100-0199/read-n-characters-given-read4/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0157.%20%E7%94%A8%20Read4%20%E8%AF%BB%E5%8F%96%20N%20%E4%B8%AA%E5%AD%97%E7%AC%A6.md,54.4%,简单,135 -0158,0100-0199,0158. 用 Read4 读取 N 个字符 II,用 Read4 读取 N 个字符 II,https://leetcode.cn/problems/read-n-characters-given-read4-ii-call-multiple-times/,read-n-characters-given-read4-ii-call-multiple-times,字符串、交互、模拟,https://algo.itcharge.cn/Solutions/0100-0199/read-n-characters-given-read4-ii-call-multiple-times/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0158.%20%E7%94%A8%20Read4%20%E8%AF%BB%E5%8F%96%20N%20%E4%B8%AA%E5%AD%97%E7%AC%A6%20II.md,60.0%,困难,104 -0159,0100-0199,0159. 至多包含两个不同字符的最长子串,至多包含两个不同字符的最长子串,https://leetcode.cn/problems/longest-substring-with-at-most-two-distinct-characters/,longest-substring-with-at-most-two-distinct-characters,哈希表、字符串、滑动窗口,https://algo.itcharge.cn/Solutions/0100-0199/longest-substring-with-at-most-two-distinct-characters/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0159.%20%E8%87%B3%E5%A4%9A%E5%8C%85%E5%90%AB%E4%B8%A4%E4%B8%AA%E4%B8%8D%E5%90%8C%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2.md,55.6%,中等,345 -0160,0100-0199,0160. 相交链表,相交链表,https://leetcode.cn/problems/intersection-of-two-linked-lists/,intersection-of-two-linked-lists,哈希表、链表、双指针,https://algo.itcharge.cn/Solutions/0100-0199/intersection-of-two-linked-lists/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0160.%20%E7%9B%B8%E4%BA%A4%E9%93%BE%E8%A1%A8.md,63.7%,简单,3730 -0161,0100-0199,0161. 相隔为 1 的编辑距离,相隔为 1 的编辑距离,https://leetcode.cn/problems/one-edit-distance/,one-edit-distance,双指针、字符串,https://algo.itcharge.cn/Solutions/0100-0199/one-edit-distance/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0161.%20%E7%9B%B8%E9%9A%94%E4%B8%BA%201%20%E7%9A%84%E7%BC%96%E8%BE%91%E8%B7%9D%E7%A6%BB.md,33.9%,中等,184 -0162,0100-0199,0162. 寻找峰值,寻找峰值,https://leetcode.cn/problems/find-peak-element/,find-peak-element,数组、二分查找,https://algo.itcharge.cn/Solutions/0100-0199/find-peak-element/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0162.%20%E5%AF%BB%E6%89%BE%E5%B3%B0%E5%80%BC.md,49.3%,中等,1956 -0163,0100-0199,0163. 缺失的区间,缺失的区间,https://leetcode.cn/problems/missing-ranges/,missing-ranges,数组,https://algo.itcharge.cn/Solutions/0100-0199/missing-ranges/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0163.%20%E7%BC%BA%E5%A4%B1%E7%9A%84%E5%8C%BA%E9%97%B4.md,35.6%,简单,258 -0164,0100-0199,0164. 最大间距,最大间距,https://leetcode.cn/problems/maximum-gap/,maximum-gap,数组、桶排序、基数排序、排序,https://algo.itcharge.cn/Solutions/0100-0199/maximum-gap/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0164.%20%E6%9C%80%E5%A4%A7%E9%97%B4%E8%B7%9D.md,60.2%,困难,661 -0165,0100-0199,0165. 比较版本号,比较版本号,https://leetcode.cn/problems/compare-version-numbers/,compare-version-numbers,双指针、字符串,https://algo.itcharge.cn/Solutions/0100-0199/compare-version-numbers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0165.%20%E6%AF%94%E8%BE%83%E7%89%88%E6%9C%AC%E5%8F%B7.md,51.8%,中等,1304 -0166,0100-0199,0166. 分数到小数,分数到小数,https://leetcode.cn/problems/fraction-to-recurring-decimal/,fraction-to-recurring-decimal,哈希表、数学、字符串,https://algo.itcharge.cn/Solutions/0100-0199/fraction-to-recurring-decimal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0166.%20%E5%88%86%E6%95%B0%E5%88%B0%E5%B0%8F%E6%95%B0.md,33.4%,中等,530 -0167,0100-0199,0167. 两数之和 II - 输入有序数组,两数之和 II - 输入有序数组,https://leetcode.cn/problems/two-sum-ii-input-array-is-sorted/,two-sum-ii-input-array-is-sorted,数组、双指针、二分查找,https://algo.itcharge.cn/Solutions/0100-0199/two-sum-ii-input-array-is-sorted/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0167.%20%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C%20II%20-%20%E8%BE%93%E5%85%A5%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84.md,59.4%,中等,3672 -0168,0100-0199,0168. Excel表列名称,Excel表列名称,https://leetcode.cn/problems/excel-sheet-column-title/,excel-sheet-column-title,数学、字符串,https://algo.itcharge.cn/Solutions/0100-0199/excel-sheet-column-title/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0168.%20Excel%E8%A1%A8%E5%88%97%E5%90%8D%E7%A7%B0.md,43.8%,简单,1157 -0169,0100-0199,0169. 多数元素,多数元素,https://leetcode.cn/problems/majority-element/,majority-element,数组、哈希表、分治、计数、排序,https://algo.itcharge.cn/Solutions/0100-0199/majority-element/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0169.%20%E5%A4%9A%E6%95%B0%E5%85%83%E7%B4%A0.md,66.8%,简单,3743 -0170,0100-0199,0170. 两数之和 III - 数据结构设计,两数之和 III - 数据结构设计,https://leetcode.cn/problems/two-sum-iii-data-structure-design/,two-sum-iii-data-structure-design,设计、数组、哈希表、双指针、数据流,https://algo.itcharge.cn/Solutions/0100-0199/two-sum-iii-data-structure-design/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0170.%20%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C%20III%20-%20%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E8%AE%BE%E8%AE%A1.md,42.7%,简单,156 -0171,0100-0199,0171. Excel 表列序号,Excel 表列序号,https://leetcode.cn/problems/excel-sheet-column-number/,excel-sheet-column-number,数学、字符串,https://algo.itcharge.cn/Solutions/0100-0199/excel-sheet-column-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0171.%20Excel%20%E8%A1%A8%E5%88%97%E5%BA%8F%E5%8F%B7.md,71.3%,简单,1343 -0172,0100-0199,0172. 阶乘后的零,阶乘后的零,https://leetcode.cn/problems/factorial-trailing-zeroes/,factorial-trailing-zeroes,数学,https://algo.itcharge.cn/Solutions/0100-0199/factorial-trailing-zeroes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0172.%20%E9%98%B6%E4%B9%98%E5%90%8E%E7%9A%84%E9%9B%B6.md,50.0%,中等,1123 -0173,0100-0199,0173. 二叉搜索树迭代器,二叉搜索树迭代器,https://leetcode.cn/problems/binary-search-tree-iterator/,binary-search-tree-iterator,栈、树、设计、二叉搜索树、二叉树、迭代器,https://algo.itcharge.cn/Solutions/0100-0199/binary-search-tree-iterator/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0173.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E8%BF%AD%E4%BB%A3%E5%99%A8.md,81.6%,中等,896 -0174,0100-0199,0174. 地下城游戏,地下城游戏,https://leetcode.cn/problems/dungeon-game/,dungeon-game,数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/0100-0199/dungeon-game/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0174.%20%E5%9C%B0%E4%B8%8B%E5%9F%8E%E6%B8%B8%E6%88%8F.md,48.7%,困难,1403 -0175,0100-0199,0175. 组合两个表,组合两个表,https://leetcode.cn/problems/combine-two-tables/,combine-two-tables,,https://algo.itcharge.cn/Solutions/0100-0199/combine-two-tables/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0175.%20%E7%BB%84%E5%90%88%E4%B8%A4%E4%B8%AA%E8%A1%A8.md,74.2%,简单,2159 -0176,0100-0199,0176. 第二高的薪水,第二高的薪水,https://leetcode.cn/problems/second-highest-salary/,second-highest-salary,数据库,https://algo.itcharge.cn/Solutions/0100-0199/second-highest-salary/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0176.%20%E7%AC%AC%E4%BA%8C%E9%AB%98%E7%9A%84%E8%96%AA%E6%B0%B4.md,36.5%,中等,1677 -0177,0100-0199,0177. 第N高的薪水,第N高的薪水,https://leetcode.cn/problems/nth-highest-salary/,nth-highest-salary,数据库,https://algo.itcharge.cn/Solutions/0100-0199/nth-highest-salary/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0177.%20%E7%AC%ACN%E9%AB%98%E7%9A%84%E8%96%AA%E6%B0%B4.md,46.7%,中等,815 -0178,0100-0199,0178. 分数排名,分数排名,https://leetcode.cn/problems/rank-scores/,rank-scores,数据库,https://algo.itcharge.cn/Solutions/0100-0199/rank-scores/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0178.%20%E5%88%86%E6%95%B0%E6%8E%92%E5%90%8D.md,61.1%,中等,1012 -0179,0100-0199,0179. 最大数,最大数,https://leetcode.cn/problems/largest-number/,largest-number,贪心、数组、字符串、排序,https://algo.itcharge.cn/Solutions/0100-0199/largest-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0179.%20%E6%9C%80%E5%A4%A7%E6%95%B0.md,41.1%,中等,1451 -0180,0100-0199,0180. 连续出现的数字,连续出现的数字,https://leetcode.cn/problems/consecutive-numbers/,consecutive-numbers,数据库,https://algo.itcharge.cn/Solutions/0100-0199/consecutive-numbers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0180.%20%E8%BF%9E%E7%BB%AD%E5%87%BA%E7%8E%B0%E7%9A%84%E6%95%B0%E5%AD%97.md,47.8%,中等,877 -0181,0100-0199,0181. 超过经理收入的员工,超过经理收入的员工,https://leetcode.cn/problems/employees-earning-more-than-their-managers/,employees-earning-more-than-their-managers,数据库,https://algo.itcharge.cn/Solutions/0100-0199/employees-earning-more-than-their-managers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0181.%20%E8%B6%85%E8%BF%87%E7%BB%8F%E7%90%86%E6%94%B6%E5%85%A5%E7%9A%84%E5%91%98%E5%B7%A5.md,68.7%,简单,1115 -0182,0100-0199,0182. 查找重复的电子邮箱,查找重复的电子邮箱,https://leetcode.cn/problems/duplicate-emails/,duplicate-emails,数据库,https://algo.itcharge.cn/Solutions/0100-0199/duplicate-emails/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0182.%20%E6%9F%A5%E6%89%BE%E9%87%8D%E5%A4%8D%E7%9A%84%E7%94%B5%E5%AD%90%E9%82%AE%E7%AE%B1.md,79.0%,简单,1015 -0183,0100-0199,0183. 从不订购的客户,从不订购的客户,https://leetcode.cn/problems/customers-who-never-order/,customers-who-never-order,数据库,https://algo.itcharge.cn/Solutions/0100-0199/customers-who-never-order/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0183.%20%E4%BB%8E%E4%B8%8D%E8%AE%A2%E8%B4%AD%E7%9A%84%E5%AE%A2%E6%88%B7.md,66.3%,简单,1117 -0184,0100-0199,0184. 部门工资最高的员工,部门工资最高的员工,https://leetcode.cn/problems/department-highest-salary/,department-highest-salary,数据库,https://algo.itcharge.cn/Solutions/0100-0199/department-highest-salary/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0184.%20%E9%83%A8%E9%97%A8%E5%B7%A5%E8%B5%84%E6%9C%80%E9%AB%98%E7%9A%84%E5%91%98%E5%B7%A5.md,51.3%,中等,1123 -0185,0100-0199,0185. 部门工资前三高的所有员工,部门工资前三高的所有员工,https://leetcode.cn/problems/department-top-three-salaries/,department-top-three-salaries,数据库,https://algo.itcharge.cn/Solutions/0100-0199/department-top-three-salaries/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0185.%20%E9%83%A8%E9%97%A8%E5%B7%A5%E8%B5%84%E5%89%8D%E4%B8%89%E9%AB%98%E7%9A%84%E6%89%80%E6%9C%89%E5%91%98%E5%B7%A5.md,53.0%,困难,1020 -0186,0100-0199,0186. 反转字符串中的单词 II,反转字符串中的单词 II,https://leetcode.cn/problems/reverse-words-in-a-string-ii/,reverse-words-in-a-string-ii,双指针、字符串,https://algo.itcharge.cn/Solutions/0100-0199/reverse-words-in-a-string-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0186.%20%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%8D%95%E8%AF%8D%20II.md,76.0%,中等,186 -0187,0100-0199,0187. 重复的DNA序列,重复的DNA序列,https://leetcode.cn/problems/repeated-dna-sequences/,repeated-dna-sequences,位运算、哈希表、字符串、滑动窗口、哈希函数、滚动哈希,https://algo.itcharge.cn/Solutions/0100-0199/repeated-dna-sequences/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0187.%20%E9%87%8D%E5%A4%8D%E7%9A%84DNA%E5%BA%8F%E5%88%97.md,53.4%,中等,1007 -0188,0100-0199,0188. 买卖股票的最佳时机 IV,买卖股票的最佳时机 IV,https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-iv/,best-time-to-buy-and-sell-stock-iv,数组、动态规划,https://algo.itcharge.cn/Solutions/0100-0199/best-time-to-buy-and-sell-stock-iv/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0188.%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA%20IV.md,45.6%,困难,1353 -0189,0100-0199,0189. 轮转数组,轮转数组,https://leetcode.cn/problems/rotate-array/,rotate-array,数组、数学、双指针,https://algo.itcharge.cn/Solutions/0100-0199/rotate-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0189.%20%E8%BD%AE%E8%BD%AC%E6%95%B0%E7%BB%84.md,44.2%,中等,3304 -0190,0100-0199,0190. 颠倒二进制位,颠倒二进制位,https://leetcode.cn/problems/reverse-bits/,reverse-bits,位运算、分治,https://algo.itcharge.cn/Solutions/0100-0199/reverse-bits/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0190.%20%E9%A2%A0%E5%80%92%E4%BA%8C%E8%BF%9B%E5%88%B6%E4%BD%8D.md,71.8%,简单,1310 -0191,0100-0199,0191. 位1的个数,位1的个数,https://leetcode.cn/problems/number-of-1-bits/,number-of-1-bits,位运算、分治,https://algo.itcharge.cn/Solutions/0100-0199/number-of-1-bits/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0191.%20%E4%BD%8D1%E7%9A%84%E4%B8%AA%E6%95%B0.md,76.5%,简单,2075 -0192,0100-0199,0192. 统计词频,统计词频,https://leetcode.cn/problems/word-frequency/,word-frequency,,https://algo.itcharge.cn/Solutions/0100-0199/word-frequency/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0192.%20%E7%BB%9F%E8%AE%A1%E8%AF%8D%E9%A2%91.md,35.7%,中等,231 -0193,0100-0199,0193. 有效电话号码,有效电话号码,https://leetcode.cn/problems/valid-phone-numbers/,valid-phone-numbers,,https://algo.itcharge.cn/Solutions/0100-0199/valid-phone-numbers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0193.%20%E6%9C%89%E6%95%88%E7%94%B5%E8%AF%9D%E5%8F%B7%E7%A0%81.md,33.4%,简单,196 -0194,0100-0199,0194. 转置文件,转置文件,https://leetcode.cn/problems/transpose-file/,transpose-file,,https://algo.itcharge.cn/Solutions/0100-0199/transpose-file/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0194.%20%E8%BD%AC%E7%BD%AE%E6%96%87%E4%BB%B6.md,34.3%,中等,103 -0195,0100-0199,0195. 第十行,第十行,https://leetcode.cn/problems/tenth-line/,tenth-line,,https://algo.itcharge.cn/Solutions/0100-0199/tenth-line/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0195.%20%E7%AC%AC%E5%8D%81%E8%A1%8C.md,43.9%,简单,204 -0196,0100-0199,0196. 删除重复的电子邮箱,删除重复的电子邮箱,https://leetcode.cn/problems/delete-duplicate-emails/,delete-duplicate-emails,数据库,https://algo.itcharge.cn/Solutions/0100-0199/delete-duplicate-emails/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0196.%20%E5%88%A0%E9%99%A4%E9%87%8D%E5%A4%8D%E7%9A%84%E7%94%B5%E5%AD%90%E9%82%AE%E7%AE%B1.md,68.7%,简单,800 -0197,0100-0199,0197. 上升的温度,上升的温度,https://leetcode.cn/problems/rising-temperature/,rising-temperature,数据库,https://algo.itcharge.cn/Solutions/0100-0199/rising-temperature/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0197.%20%E4%B8%8A%E5%8D%87%E7%9A%84%E6%B8%A9%E5%BA%A6.md,54.2%,简单,1009 -0198,0100-0199,0198. 打家劫舍,打家劫舍,https://leetcode.cn/problems/house-robber/,house-robber,数组、动态规划,https://algo.itcharge.cn/Solutions/0100-0199/house-robber/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0198.%20%E6%89%93%E5%AE%B6%E5%8A%AB%E8%88%8D.md,54.4%,中等,4722 -0199,0100-0199,0199. 二叉树的右视图,二叉树的右视图,https://leetcode.cn/problems/binary-tree-right-side-view/,binary-tree-right-side-view,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0100-0199/binary-tree-right-side-view/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0199.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%8F%B3%E8%A7%86%E5%9B%BE.md,65.9%,中等,2734 -0200,0200-0299,0200. 岛屿数量,岛屿数量,https://leetcode.cn/problems/number-of-islands/,number-of-islands,深度优先搜索、广度优先搜索、并查集、数组、矩阵,https://algo.itcharge.cn/Solutions/0200-0299/number-of-islands/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0200.%20%E5%B2%9B%E5%B1%BF%E6%95%B0%E9%87%8F.md,59.3%,中等,4002 -0201,0200-0299,0201. 数字范围按位与,数字范围按位与,https://leetcode.cn/problems/bitwise-and-of-numbers-range/,bitwise-and-of-numbers-range,位运算,https://algo.itcharge.cn/Solutions/0200-0299/bitwise-and-of-numbers-range/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0201.%20%E6%95%B0%E5%AD%97%E8%8C%83%E5%9B%B4%E6%8C%89%E4%BD%8D%E4%B8%8E.md,54.0%,中等,518 -0202,0200-0299,0202. 快乐数,快乐数,https://leetcode.cn/problems/happy-number/,happy-number,哈希表、数学、双指针,https://algo.itcharge.cn/Solutions/0200-0299/happy-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0202.%20%E5%BF%AB%E4%B9%90%E6%95%B0.md,63.3%,简单,2817 -0203,0200-0299,0203. 移除链表元素,移除链表元素,https://leetcode.cn/problems/remove-linked-list-elements/,remove-linked-list-elements,递归、链表,https://algo.itcharge.cn/Solutions/0200-0299/remove-linked-list-elements/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0203.%20%E7%A7%BB%E9%99%A4%E9%93%BE%E8%A1%A8%E5%85%83%E7%B4%A0.md,54.9%,简单,3261 -0204,0200-0299,0204. 计数质数,计数质数,https://leetcode.cn/problems/count-primes/,count-primes,数组、数学、枚举、数论,https://algo.itcharge.cn/Solutions/0200-0299/count-primes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0204.%20%E8%AE%A1%E6%95%B0%E8%B4%A8%E6%95%B0.md,37.3%,中等,1102 -0205,0200-0299,0205. 同构字符串,同构字符串,https://leetcode.cn/problems/isomorphic-strings/,isomorphic-strings,哈希表、字符串,https://algo.itcharge.cn/Solutions/0200-0299/isomorphic-strings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0205.%20%E5%90%8C%E6%9E%84%E5%AD%97%E7%AC%A6%E4%B8%B2.md,49.6%,简单,1538 -0206,0200-0299,0206. 反转链表,反转链表,https://leetcode.cn/problems/reverse-linked-list/,reverse-linked-list,递归、链表,https://algo.itcharge.cn/Solutions/0200-0299/reverse-linked-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0206.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8.md,73.5%,简单,11518 -0207,0200-0299,0207. 课程表,课程表,https://leetcode.cn/problems/course-schedule/,course-schedule,深度优先搜索、广度优先搜索、图、拓扑排序,https://algo.itcharge.cn/Solutions/0200-0299/course-schedule/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0207.%20%E8%AF%BE%E7%A8%8B%E8%A1%A8.md,53.6%,中等,2176 -0208,0200-0299,0208. 实现 Trie (前缀树),实现 Trie (前缀树),https://leetcode.cn/problems/implement-trie-prefix-tree/,implement-trie-prefix-tree,设计、字典树、哈希表、字符串,https://algo.itcharge.cn/Solutions/0200-0299/implement-trie-prefix-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0208.%20%E5%AE%9E%E7%8E%B0%20Trie%20%28%E5%89%8D%E7%BC%80%E6%A0%91%29.md,71.9%,中等,1658 -0209,0200-0299,0209. 长度最小的子数组,长度最小的子数组,https://leetcode.cn/problems/minimum-size-subarray-sum/,minimum-size-subarray-sum,数组、二分查找、前缀和、滑动窗口,https://algo.itcharge.cn/Solutions/0200-0299/minimum-size-subarray-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0209.%20%E9%95%BF%E5%BA%A6%E6%9C%80%E5%B0%8F%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md,46.8%,中等,3433 -0210,0200-0299,0210. 课程表 II,课程表 II,https://leetcode.cn/problems/course-schedule-ii/,course-schedule-ii,深度优先搜索、广度优先搜索、图、拓扑排序,https://algo.itcharge.cn/Solutions/0200-0299/course-schedule-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0210.%20%E8%AF%BE%E7%A8%8B%E8%A1%A8%20II.md,56.6%,中等,1329 -0211,0200-0299,0211. 添加与搜索单词 - 数据结构设计,添加与搜索单词 - 数据结构设计,https://leetcode.cn/problems/design-add-and-search-words-data-structure/,design-add-and-search-words-data-structure,深度优先搜索、设计、字典树、字符串,https://algo.itcharge.cn/Solutions/0200-0299/design-add-and-search-words-data-structure/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0211.%20%E6%B7%BB%E5%8A%A0%E4%B8%8E%E6%90%9C%E7%B4%A2%E5%8D%95%E8%AF%8D%20-%20%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E8%AE%BE%E8%AE%A1.md,49.6%,中等,750 -0212,0200-0299,0212. 单词搜索 II,单词搜索 II,https://leetcode.cn/problems/word-search-ii/,word-search-ii,字典树、数组、字符串、回溯、矩阵,https://algo.itcharge.cn/Solutions/0200-0299/word-search-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0212.%20%E5%8D%95%E8%AF%8D%E6%90%9C%E7%B4%A2%20II.md,44.0%,困难,749 -0213,0200-0299,0213. 打家劫舍 II,打家劫舍 II,https://leetcode.cn/problems/house-robber-ii/,house-robber-ii,数组、动态规划,https://algo.itcharge.cn/Solutions/0200-0299/house-robber-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0213.%20%E6%89%93%E5%AE%B6%E5%8A%AB%E8%88%8D%20II.md,44.1%,中等,2720 -0214,0200-0299,0214. 最短回文串,最短回文串,https://leetcode.cn/problems/shortest-palindrome/,shortest-palindrome,字符串、字符串匹配、哈希函数、滚动哈希,https://algo.itcharge.cn/Solutions/0200-0299/shortest-palindrome/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0214.%20%E6%9C%80%E7%9F%AD%E5%9B%9E%E6%96%87%E4%B8%B2.md,40.0%,困难,463 -0215,0200-0299,0215. 数组中的第K个最大元素,数组中的第K个最大元素,https://leetcode.cn/problems/kth-largest-element-in-an-array/,kth-largest-element-in-an-array,数组、分治、快速选择、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/0200-0299/kth-largest-element-in-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0215.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E7%AC%ACK%E4%B8%AA%E6%9C%80%E5%A4%A7%E5%85%83%E7%B4%A0.md,63.7%,中等,4063 -0216,0200-0299,0216. 组合总和 III,组合总和 III,https://leetcode.cn/problems/combination-sum-iii/,combination-sum-iii,数组、回溯,https://algo.itcharge.cn/Solutions/0200-0299/combination-sum-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0216.%20%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8C%20III.md,71.5%,中等,1952 -0217,0200-0299,0217. 存在重复元素,存在重复元素,https://leetcode.cn/problems/contains-duplicate/,contains-duplicate,数组、哈希表、排序,https://algo.itcharge.cn/Solutions/0200-0299/contains-duplicate/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0217.%20%E5%AD%98%E5%9C%A8%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0.md,54.8%,简单,3744 -0218,0200-0299,0218. 天际线问题,天际线问题,https://leetcode.cn/problems/the-skyline-problem/,the-skyline-problem,树状数组、线段树、数组、分治、有序集合、扫描线、堆（优先队列）,https://algo.itcharge.cn/Solutions/0200-0299/the-skyline-problem/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0218.%20%E5%A4%A9%E9%99%85%E7%BA%BF%E9%97%AE%E9%A2%98.md,55.1%,困难,436 -0219,0200-0299,0219. 存在重复元素 II,存在重复元素 II,https://leetcode.cn/problems/contains-duplicate-ii/,contains-duplicate-ii,数组、哈希表、滑动窗口,https://algo.itcharge.cn/Solutions/0200-0299/contains-duplicate-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0219.%20%E5%AD%98%E5%9C%A8%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0%20II.md,44.3%,简单,1823 -0220,0200-0299,0220. 存在重复元素 III,存在重复元素 III,https://leetcode.cn/problems/contains-duplicate-iii/,contains-duplicate-iii,数组、桶排序、有序集合、排序、滑动窗口,https://algo.itcharge.cn/Solutions/0200-0299/contains-duplicate-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0220.%20%E5%AD%98%E5%9C%A8%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0%20III.md,30.0%,困难,630 -0221,0200-0299,0221. 最大正方形,最大正方形,https://leetcode.cn/problems/maximal-square/,maximal-square,数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/0200-0299/maximal-square/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0221.%20%E6%9C%80%E5%A4%A7%E6%AD%A3%E6%96%B9%E5%BD%A2.md,49.7%,中等,1694 -0222,0200-0299,0222. 完全二叉树的节点个数,完全二叉树的节点个数,https://leetcode.cn/problems/count-complete-tree-nodes/,count-complete-tree-nodes,树、深度优先搜索、二分查找、二叉树,https://algo.itcharge.cn/Solutions/0200-0299/count-complete-tree-nodes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0222.%20%E5%AE%8C%E5%85%A8%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E8%8A%82%E7%82%B9%E4%B8%AA%E6%95%B0.md,81.0%,中等,1780 -0223,0200-0299,0223. 矩形面积,矩形面积,https://leetcode.cn/problems/rectangle-area/,rectangle-area,几何、数学,https://algo.itcharge.cn/Solutions/0200-0299/rectangle-area/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0223.%20%E7%9F%A9%E5%BD%A2%E9%9D%A2%E7%A7%AF.md,53.8%,中等,647 -0224,0200-0299,0224. 基本计算器,基本计算器,https://leetcode.cn/problems/basic-calculator/,basic-calculator,栈、递归、数学、字符串,https://algo.itcharge.cn/Solutions/0200-0299/basic-calculator/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0224.%20%E5%9F%BA%E6%9C%AC%E8%AE%A1%E7%AE%97%E5%99%A8.md,42.4%,困难,1012 -0225,0200-0299,0225. 用队列实现栈,用队列实现栈,https://leetcode.cn/problems/implement-stack-using-queues/,implement-stack-using-queues,栈、设计、队列,https://algo.itcharge.cn/Solutions/0200-0299/implement-stack-using-queues/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0225.%20%E7%94%A8%E9%98%9F%E5%88%97%E5%AE%9E%E7%8E%B0%E6%A0%88.md,66.1%,简单,5563 -0226,0200-0299,0226. 翻转二叉树,翻转二叉树,https://leetcode.cn/problems/invert-binary-tree/,invert-binary-tree,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0200-0299/invert-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0226.%20%E7%BF%BB%E8%BD%AC%E4%BA%8C%E5%8F%89%E6%A0%91.md,79.5%,简单,4246 -0227,0200-0299,0227. 基本计算器 II,基本计算器 II,https://leetcode.cn/problems/basic-calculator-ii/,basic-calculator-ii,栈、数学、字符串,https://algo.itcharge.cn/Solutions/0200-0299/basic-calculator-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0227.%20%E5%9F%BA%E6%9C%AC%E8%AE%A1%E7%AE%97%E5%99%A8%20II.md,44.5%,中等,1102 -0228,0200-0299,0228. 汇总区间,汇总区间,https://leetcode.cn/problems/summary-ranges/,summary-ranges,数组,https://algo.itcharge.cn/Solutions/0200-0299/summary-ranges/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0228.%20%E6%B1%87%E6%80%BB%E5%8C%BA%E9%97%B4.md,54.6%,简单,1057 -0229,0200-0299,0229. 多数元素 II,多数元素 II,https://leetcode.cn/problems/majority-element-ii/,majority-element-ii,数组、哈希表、计数、排序,https://algo.itcharge.cn/Solutions/0200-0299/majority-element-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0229.%20%E5%A4%9A%E6%95%B0%E5%85%83%E7%B4%A0%20II.md,54.0%,中等,851 -0230,0200-0299,0230. 二叉搜索树中第K小的元素,二叉搜索树中第K小的元素,https://leetcode.cn/problems/kth-smallest-element-in-a-bst/,kth-smallest-element-in-a-bst,树、深度优先搜索、二叉搜索树、二叉树,https://algo.itcharge.cn/Solutions/0200-0299/kth-smallest-element-in-a-bst/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0230.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%AC%ACK%E5%B0%8F%E7%9A%84%E5%85%83%E7%B4%A0.md,76.0%,中等,1820 -0231,0200-0299,0231. 2 的幂,2 的幂,https://leetcode.cn/problems/power-of-two/,power-of-two,位运算、递归、数学,https://algo.itcharge.cn/Solutions/0200-0299/power-of-two/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0231.%202%20%E7%9A%84%E5%B9%82.md,50.1%,简单,2104 -0232,0200-0299,0232. 用栈实现队列,用栈实现队列,https://leetcode.cn/problems/implement-queue-using-stacks/,implement-queue-using-stacks,栈、设计、队列,https://algo.itcharge.cn/Solutions/0200-0299/implement-queue-using-stacks/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0232.%20%E7%94%A8%E6%A0%88%E5%AE%9E%E7%8E%B0%E9%98%9F%E5%88%97.md,68.3%,简单,2370 -0233,0200-0299,0233. 数字 1 的个数,数字 1 的个数,https://leetcode.cn/problems/number-of-digit-one/,number-of-digit-one,递归、数学、动态规划,https://algo.itcharge.cn/Solutions/0200-0299/number-of-digit-one/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0233.%20%E6%95%B0%E5%AD%97%201%20%E7%9A%84%E4%B8%AA%E6%95%B0.md,49.1%,困难,623 -0234,0200-0299,0234. 回文链表,回文链表,https://leetcode.cn/problems/palindrome-linked-list/,palindrome-linked-list,栈、递归、链表、双指针,https://algo.itcharge.cn/Solutions/0200-0299/palindrome-linked-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0234.%20%E5%9B%9E%E6%96%87%E9%93%BE%E8%A1%A8.md,53.3%,简单,3532 -0235,0200-0299,0235. 二叉搜索树的最近公共祖先,二叉搜索树的最近公共祖先,https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-search-tree/,lowest-common-ancestor-of-a-binary-search-tree,树、深度优先搜索、二叉搜索树、二叉树,https://algo.itcharge.cn/Solutions/0200-0299/lowest-common-ancestor-of-a-binary-search-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0235.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88.md,68.4%,中等,1870 -0236,0200-0299,0236. 二叉树的最近公共祖先,二叉树的最近公共祖先,https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/,lowest-common-ancestor-of-a-binary-tree,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0200-0299/lowest-common-ancestor-of-a-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0236.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88.md,69.7%,中等,2791 -0237,0200-0299,0237. 删除链表中的节点,删除链表中的节点,https://leetcode.cn/problems/delete-node-in-a-linked-list/,delete-node-in-a-linked-list,链表,https://algo.itcharge.cn/Solutions/0200-0299/delete-node-in-a-linked-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0237.%20%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E8%8A%82%E7%82%B9.md,86.1%,中等,1748 -0238,0200-0299,0238. 除自身以外数组的乘积,除自身以外数组的乘积,https://leetcode.cn/problems/product-of-array-except-self/,product-of-array-except-self,数组、前缀和,https://algo.itcharge.cn/Solutions/0200-0299/product-of-array-except-self/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0238.%20%E9%99%A4%E8%87%AA%E8%BA%AB%E4%BB%A5%E5%A4%96%E6%95%B0%E7%BB%84%E7%9A%84%E4%B9%98%E7%A7%AF.md,74.8%,中等,1711 -0239,0200-0299,0239. 滑动窗口最大值,滑动窗口最大值,https://leetcode.cn/problems/sliding-window-maximum/,sliding-window-maximum,队列、数组、滑动窗口、单调队列、堆（优先队列）,https://algo.itcharge.cn/Solutions/0200-0299/sliding-window-maximum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0239.%20%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E6%9C%80%E5%A4%A7%E5%80%BC.md,49.7%,困难,3311 -0240,0200-0299,0240. 搜索二维矩阵 II,搜索二维矩阵 II,https://leetcode.cn/problems/search-a-2d-matrix-ii/,search-a-2d-matrix-ii,数组、二分查找、分治、矩阵,https://algo.itcharge.cn/Solutions/0200-0299/search-a-2d-matrix-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0240.%20%E6%90%9C%E7%B4%A2%E4%BA%8C%E7%BB%B4%E7%9F%A9%E9%98%B5%20II.md,52.8%,中等,1754 -0241,0200-0299,0241. 为运算表达式设计优先级,为运算表达式设计优先级,https://leetcode.cn/problems/different-ways-to-add-parentheses/,different-ways-to-add-parentheses,递归、记忆化搜索、数学、字符串、动态规划,https://algo.itcharge.cn/Solutions/0200-0299/different-ways-to-add-parentheses/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0241.%20%E4%B8%BA%E8%BF%90%E7%AE%97%E8%A1%A8%E8%BE%BE%E5%BC%8F%E8%AE%BE%E8%AE%A1%E4%BC%98%E5%85%88%E7%BA%A7.md,75.6%,中等,752 -0242,0200-0299,0242. 有效的字母异位词,有效的字母异位词,https://leetcode.cn/problems/valid-anagram/,valid-anagram,哈希表、字符串、排序,https://algo.itcharge.cn/Solutions/0200-0299/valid-anagram/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0242.%20%E6%9C%89%E6%95%88%E7%9A%84%E5%AD%97%E6%AF%8D%E5%BC%82%E4%BD%8D%E8%AF%8D.md,65.8%,简单,3439 -0243,0200-0299,0243. 最短单词距离,最短单词距离,https://leetcode.cn/problems/shortest-word-distance/,shortest-word-distance,数组、字符串,https://algo.itcharge.cn/Solutions/0200-0299/shortest-word-distance/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0243.%20%E6%9C%80%E7%9F%AD%E5%8D%95%E8%AF%8D%E8%B7%9D%E7%A6%BB.md,66.8%,简单,184 -0244,0200-0299,0244. 最短单词距离 II,最短单词距离 II,https://leetcode.cn/problems/shortest-word-distance-ii/,shortest-word-distance-ii,设计、数组、哈希表、双指针、字符串,https://algo.itcharge.cn/Solutions/0200-0299/shortest-word-distance-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0244.%20%E6%9C%80%E7%9F%AD%E5%8D%95%E8%AF%8D%E8%B7%9D%E7%A6%BB%20II.md,59.7%,中等,107 -0245,0200-0299,0245. 最短单词距离 III,最短单词距离 III,https://leetcode.cn/problems/shortest-word-distance-iii/,shortest-word-distance-iii,数组、字符串,https://algo.itcharge.cn/Solutions/0200-0299/shortest-word-distance-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0245.%20%E6%9C%80%E7%9F%AD%E5%8D%95%E8%AF%8D%E8%B7%9D%E7%A6%BB%20III.md,57.2%,中等,89 -0246,0200-0299,0246. 中心对称数,中心对称数,https://leetcode.cn/problems/strobogrammatic-number/,strobogrammatic-number,哈希表、双指针、字符串,https://algo.itcharge.cn/Solutions/0200-0299/strobogrammatic-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0246.%20%E4%B8%AD%E5%BF%83%E5%AF%B9%E7%A7%B0%E6%95%B0.md,47.5%,简单,173 -0247,0200-0299,0247. 中心对称数 II,中心对称数 II,https://leetcode.cn/problems/strobogrammatic-number-ii/,strobogrammatic-number-ii,递归、数组、字符串,https://algo.itcharge.cn/Solutions/0200-0299/strobogrammatic-number-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0247.%20%E4%B8%AD%E5%BF%83%E5%AF%B9%E7%A7%B0%E6%95%B0%20II.md,54.4%,中等,133 -0248,0200-0299,0248. 中心对称数 III,中心对称数 III,https://leetcode.cn/problems/strobogrammatic-number-iii/,strobogrammatic-number-iii,递归、数组、字符串,https://algo.itcharge.cn/Solutions/0200-0299/strobogrammatic-number-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0248.%20%E4%B8%AD%E5%BF%83%E5%AF%B9%E7%A7%B0%E6%95%B0%20III.md,49.1%,困难,83 -0249,0200-0299,0249. 移位字符串分组,移位字符串分组,https://leetcode.cn/problems/group-shifted-strings/,group-shifted-strings,数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/0200-0299/group-shifted-strings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0249.%20%E7%A7%BB%E4%BD%8D%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%88%86%E7%BB%84.md,64.8%,中等,176 -0250,0200-0299,0250. 统计同值子树,统计同值子树,https://leetcode.cn/problems/count-univalue-subtrees/,count-univalue-subtrees,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0200-0299/count-univalue-subtrees/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0250.%20%E7%BB%9F%E8%AE%A1%E5%90%8C%E5%80%BC%E5%AD%90%E6%A0%91.md,63.5%,中等,157 -0251,0200-0299,0251. 展开二维向量,展开二维向量,https://leetcode.cn/problems/flatten-2d-vector/,flatten-2d-vector,设计、数组、双指针、迭代器,https://algo.itcharge.cn/Solutions/0200-0299/flatten-2d-vector/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0251.%20%E5%B1%95%E5%BC%80%E4%BA%8C%E7%BB%B4%E5%90%91%E9%87%8F.md,54.9%,中等,111 -0252,0200-0299,0252. 会议室,会议室,https://leetcode.cn/problems/meeting-rooms/,meeting-rooms,数组、排序,https://algo.itcharge.cn/Solutions/0200-0299/meeting-rooms/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0252.%20%E4%BC%9A%E8%AE%AE%E5%AE%A4.md,57.8%,简单,240 -0253,0200-0299,0253. 会议室 II,会议室 II,https://leetcode.cn/problems/meeting-rooms-ii/,meeting-rooms-ii,贪心、数组、双指针、前缀和、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/0200-0299/meeting-rooms-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0253.%20%E4%BC%9A%E8%AE%AE%E5%AE%A4%20II.md,52.2%,中等,588 -0254,0200-0299,0254. 因子的组合,因子的组合,https://leetcode.cn/problems/factor-combinations/,factor-combinations,数组、回溯,https://algo.itcharge.cn/Solutions/0200-0299/factor-combinations/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0254.%20%E5%9B%A0%E5%AD%90%E7%9A%84%E7%BB%84%E5%90%88.md,57.0%,中等,140 -0255,0200-0299,0255. 验证前序遍历序列二叉搜索树,验证前序遍历序列二叉搜索树,https://leetcode.cn/problems/verify-preorder-sequence-in-binary-search-tree/,verify-preorder-sequence-in-binary-search-tree,栈、树、二叉搜索树、递归、二叉树、单调栈,https://algo.itcharge.cn/Solutions/0200-0299/verify-preorder-sequence-in-binary-search-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0255.%20%E9%AA%8C%E8%AF%81%E5%89%8D%E5%BA%8F%E9%81%8D%E5%8E%86%E5%BA%8F%E5%88%97%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md,49.5%,中等,110 -0256,0200-0299,0256. 粉刷房子,粉刷房子,https://leetcode.cn/problems/paint-house/,paint-house,数组、动态规划,https://algo.itcharge.cn/Solutions/0200-0299/paint-house/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0256.%20%E7%B2%89%E5%88%B7%E6%88%BF%E5%AD%90.md,69.8%,中等,311 -0257,0200-0299,0257. 二叉树的所有路径,二叉树的所有路径,https://leetcode.cn/problems/binary-tree-paths/,binary-tree-paths,树、深度优先搜索、字符串、回溯、二叉树,https://algo.itcharge.cn/Solutions/0200-0299/binary-tree-paths/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0257.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%89%80%E6%9C%89%E8%B7%AF%E5%BE%84.md,70.7%,简单,1983 -0258,0200-0299,0258. 各位相加,各位相加,https://leetcode.cn/problems/add-digits/,add-digits,数学、数论、模拟,https://algo.itcharge.cn/Solutions/0200-0299/add-digits/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0258.%20%E5%90%84%E4%BD%8D%E7%9B%B8%E5%8A%A0.md,71.0%,简单,1393 -0259,0200-0299,0259. 较小的三数之和,较小的三数之和,https://leetcode.cn/problems/3sum-smaller/,3sum-smaller,数组、双指针、二分查找、排序,https://algo.itcharge.cn/Solutions/0200-0299/3sum-smaller/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0259.%20%E8%BE%83%E5%B0%8F%E7%9A%84%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.md,55.1%,中等,141 -0260,0200-0299,0260. 只出现一次的数字 III,只出现一次的数字 III,https://leetcode.cn/problems/single-number-iii/,single-number-iii,位运算、数组,https://algo.itcharge.cn/Solutions/0200-0299/single-number-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0260.%20%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B0%E5%AD%97%20III.md,72.0%,中等,949 -0261,0200-0299,0261. 以图判树,以图判树,https://leetcode.cn/problems/graph-valid-tree/,graph-valid-tree,深度优先搜索、广度优先搜索、并查集、图,https://algo.itcharge.cn/Solutions/0200-0299/graph-valid-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0261.%20%E4%BB%A5%E5%9B%BE%E5%88%A4%E6%A0%91.md,51.1%,中等,235 -0262,0200-0299,0262. 行程和用户,行程和用户,https://leetcode.cn/problems/trips-and-users/,trips-and-users,数据库,https://algo.itcharge.cn/Solutions/0200-0299/trips-and-users/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0262.%20%E8%A1%8C%E7%A8%8B%E5%92%8C%E7%94%A8%E6%88%B7.md,41.6%,困难,629 -0263,0200-0299,0263. 丑数,丑数,https://leetcode.cn/problems/ugly-number/,ugly-number,数学,https://algo.itcharge.cn/Solutions/0200-0299/ugly-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0263.%20%E4%B8%91%E6%95%B0.md,50.6%,简单,1150 -0264,0200-0299,0264. 丑数 II,丑数 II,https://leetcode.cn/problems/ugly-number-ii/,ugly-number-ii,哈希表、数学、动态规划、堆（优先队列）,https://algo.itcharge.cn/Solutions/0200-0299/ugly-number-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0264.%20%E4%B8%91%E6%95%B0%20II.md,58.6%,中等,954 -0265,0200-0299,0265. 粉刷房子 II,粉刷房子 II,https://leetcode.cn/problems/paint-house-ii/,paint-house-ii,数组、动态规划,https://algo.itcharge.cn/Solutions/0200-0299/paint-house-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0265.%20%E7%B2%89%E5%88%B7%E6%88%BF%E5%AD%90%20II.md,63.5%,困难,266 -0266,0200-0299,0266. 回文排列,回文排列,https://leetcode.cn/problems/palindrome-permutation/,palindrome-permutation,位运算、哈希表、字符串,https://algo.itcharge.cn/Solutions/0200-0299/palindrome-permutation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0266.%20%E5%9B%9E%E6%96%87%E6%8E%92%E5%88%97.md,70.1%,简单,180 -0267,0200-0299,0267. 回文排列 II,回文排列 II,https://leetcode.cn/problems/palindrome-permutation-ii/,palindrome-permutation-ii,哈希表、字符串、回溯,https://algo.itcharge.cn/Solutions/0200-0299/palindrome-permutation-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0267.%20%E5%9B%9E%E6%96%87%E6%8E%92%E5%88%97%20II.md,47.1%,中等,131 -0268,0200-0299,0268. 丢失的数字,丢失的数字,https://leetcode.cn/problems/missing-number/,missing-number,位运算、数组、哈希表、数学、二分查找、排序,https://algo.itcharge.cn/Solutions/0200-0299/missing-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0268.%20%E4%B8%A2%E5%A4%B1%E7%9A%84%E6%95%B0%E5%AD%97.md,66.3%,简单,2306 -0269,0200-0299,0269. 火星词典,火星词典,https://leetcode.cn/problems/alien-dictionary/,alien-dictionary,深度优先搜索、广度优先搜索、图、拓扑排序、数组、字符串,https://algo.itcharge.cn/Solutions/0200-0299/alien-dictionary/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0269.%20%E7%81%AB%E6%98%9F%E8%AF%8D%E5%85%B8.md,36.6%,困难,180 -0270,0200-0299,0270. 最接近的二叉搜索树值,最接近的二叉搜索树值,https://leetcode.cn/problems/closest-binary-search-tree-value/,closest-binary-search-tree-value,树、深度优先搜索、二叉搜索树、二分查找、二叉树,https://algo.itcharge.cn/Solutions/0200-0299/closest-binary-search-tree-value/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0270.%20%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9A%84%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E5%80%BC.md,57.0%,简单,205 -0271,0200-0299,0271. 字符串的编码与解码,字符串的编码与解码,https://leetcode.cn/problems/encode-and-decode-strings/,encode-and-decode-strings,设计、数组、字符串,https://algo.itcharge.cn/Solutions/0200-0299/encode-and-decode-strings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0271.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E7%BC%96%E7%A0%81%E4%B8%8E%E8%A7%A3%E7%A0%81.md,57.7%,中等,73 -0272,0200-0299,0272. 最接近的二叉搜索树值 II,最接近的二叉搜索树值 II,https://leetcode.cn/problems/closest-binary-search-tree-value-ii/,closest-binary-search-tree-value-ii,栈、树、深度优先搜索、二叉搜索树、双指针、二叉树、堆（优先队列）,https://algo.itcharge.cn/Solutions/0200-0299/closest-binary-search-tree-value-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0272.%20%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9A%84%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E5%80%BC%20II.md,66.0%,困难,128 -0273,0200-0299,0273. 整数转换英文表示,整数转换英文表示,https://leetcode.cn/problems/integer-to-english-words/,integer-to-english-words,递归、数学、字符串,https://algo.itcharge.cn/Solutions/0200-0299/integer-to-english-words/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0273.%20%E6%95%B4%E6%95%B0%E8%BD%AC%E6%8D%A2%E8%8B%B1%E6%96%87%E8%A1%A8%E7%A4%BA.md,36.5%,困难,441 -0274,0200-0299,0274. H 指数,H 指数,https://leetcode.cn/problems/h-index/,h-index,数组、计数排序、排序,https://algo.itcharge.cn/Solutions/0200-0299/h-index/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0274.%20H%20%E6%8C%87%E6%95%B0.md,44.4%,中等,792 -0275,0200-0299,0275. H 指数 II,H 指数 II,https://leetcode.cn/problems/h-index-ii/,h-index-ii,数组、二分查找,https://algo.itcharge.cn/Solutions/0200-0299/h-index-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0275.%20H%20%E6%8C%87%E6%95%B0%20II.md,45.2%,中等,553 -0276,0200-0299,0276. 栅栏涂色,栅栏涂色,https://leetcode.cn/problems/paint-fence/,paint-fence,动态规划,https://algo.itcharge.cn/Solutions/0200-0299/paint-fence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0276.%20%E6%A0%85%E6%A0%8F%E6%B6%82%E8%89%B2.md,53.5%,中等,190 -0277,0200-0299,0277. 搜寻名人,搜寻名人,https://leetcode.cn/problems/find-the-celebrity/,find-the-celebrity,贪心、图、双指针、交互,https://algo.itcharge.cn/Solutions/0200-0299/find-the-celebrity/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0277.%20%E6%90%9C%E5%AF%BB%E5%90%8D%E4%BA%BA.md,57.9%,中等,140 -0278,0200-0299,0278. 第一个错误的版本,第一个错误的版本,https://leetcode.cn/problems/first-bad-version/,first-bad-version,二分查找、交互,https://algo.itcharge.cn/Solutions/0200-0299/first-bad-version/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0278.%20%E7%AC%AC%E4%B8%80%E4%B8%AA%E9%94%99%E8%AF%AF%E7%9A%84%E7%89%88%E6%9C%AC.md,45.3%,简单,2528 -0279,0200-0299,0279. 完全平方数,完全平方数,https://leetcode.cn/problems/perfect-squares/,perfect-squares,广度优先搜索、数学、动态规划,https://algo.itcharge.cn/Solutions/0200-0299/perfect-squares/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0279.%20%E5%AE%8C%E5%85%A8%E5%B9%B3%E6%96%B9%E6%95%B0.md,66.2%,中等,2035 -0280,0200-0299,0280. 摆动排序,摆动排序,https://leetcode.cn/problems/wiggle-sort/,wiggle-sort,贪心、数组、排序,https://algo.itcharge.cn/Solutions/0200-0299/wiggle-sort/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0280.%20%E6%91%86%E5%8A%A8%E6%8E%92%E5%BA%8F.md,68.8%,中等,120 -0281,0200-0299,0281. 锯齿迭代器,锯齿迭代器,https://leetcode.cn/problems/zigzag-iterator/,zigzag-iterator,设计、队列、数组、迭代器,https://algo.itcharge.cn/Solutions/0200-0299/zigzag-iterator/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0281.%20%E9%94%AF%E9%BD%BF%E8%BF%AD%E4%BB%A3%E5%99%A8.md,76.8%,中等,128 -0282,0200-0299,0282. 给表达式添加运算符,给表达式添加运算符,https://leetcode.cn/problems/expression-add-operators/,expression-add-operators,数学、字符串、回溯,https://algo.itcharge.cn/Solutions/0200-0299/expression-add-operators/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0282.%20%E7%BB%99%E8%A1%A8%E8%BE%BE%E5%BC%8F%E6%B7%BB%E5%8A%A0%E8%BF%90%E7%AE%97%E7%AC%A6.md,46.9%,困难,214 -0283,0200-0299,0283. 移动零,移动零,https://leetcode.cn/problems/move-zeroes/,move-zeroes,数组、双指针,https://algo.itcharge.cn/Solutions/0200-0299/move-zeroes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0283.%20%E7%A7%BB%E5%8A%A8%E9%9B%B6.md,63.8%,简单,6468 -0284,0200-0299,0284. 顶端迭代器,顶端迭代器,https://leetcode.cn/problems/peeking-iterator/,peeking-iterator,设计、数组、迭代器,https://algo.itcharge.cn/Solutions/0200-0299/peeking-iterator/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0284.%20%E9%A1%B6%E7%AB%AF%E8%BF%AD%E4%BB%A3%E5%99%A8.md,76.5%,中等,256 -0285,0200-0299,0285. 二叉搜索树中的中序后继,二叉搜索树中的中序后继,https://leetcode.cn/problems/inorder-successor-in-bst/,inorder-successor-in-bst,树、深度优先搜索、二叉搜索树、二叉树,https://algo.itcharge.cn/Solutions/0200-0299/inorder-successor-in-bst/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0285.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E4%B8%AD%E5%BA%8F%E5%90%8E%E7%BB%A7.md,64.4%,中等,175 -0286,0200-0299,0286. 墙与门,墙与门,https://leetcode.cn/problems/walls-and-gates/,walls-and-gates,广度优先搜索、数组、矩阵,https://algo.itcharge.cn/Solutions/0200-0299/walls-and-gates/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0286.%20%E5%A2%99%E4%B8%8E%E9%97%A8.md,54.9%,中等,237 -0287,0200-0299,0287. 寻找重复数,寻找重复数,https://leetcode.cn/problems/find-the-duplicate-number/,find-the-duplicate-number,位运算、数组、双指针、二分查找,https://algo.itcharge.cn/Solutions/0200-0299/find-the-duplicate-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0287.%20%E5%AF%BB%E6%89%BE%E9%87%8D%E5%A4%8D%E6%95%B0.md,64.2%,中等,2002 -0288,0200-0299,0288. 单词的唯一缩写,单词的唯一缩写,https://leetcode.cn/problems/unique-word-abbreviation/,unique-word-abbreviation,设计、数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/0200-0299/unique-word-abbreviation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0288.%20%E5%8D%95%E8%AF%8D%E7%9A%84%E5%94%AF%E4%B8%80%E7%BC%A9%E5%86%99.md,49.2%,中等,86 -0289,0200-0299,0289. 生命游戏,生命游戏,https://leetcode.cn/problems/game-of-life/,game-of-life,数组、矩阵、模拟,https://algo.itcharge.cn/Solutions/0200-0299/game-of-life/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0289.%20%E7%94%9F%E5%91%BD%E6%B8%B8%E6%88%8F.md,75.7%,中等,1128 -0290,0200-0299,0290. 单词规律,单词规律,https://leetcode.cn/problems/word-pattern/,word-pattern,哈希表、字符串,https://algo.itcharge.cn/Solutions/0200-0299/word-pattern/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0290.%20%E5%8D%95%E8%AF%8D%E8%A7%84%E5%BE%8B.md,44.6%,简单,1696 -0291,0200-0299,0291. 单词规律 II,单词规律 II,https://leetcode.cn/problems/word-pattern-ii/,word-pattern-ii,哈希表、字符串、回溯,https://algo.itcharge.cn/Solutions/0200-0299/word-pattern-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0291.%20%E5%8D%95%E8%AF%8D%E8%A7%84%E5%BE%8B%20II.md,51.9%,中等,102 -0292,0200-0299,0292. Nim 游戏,Nim 游戏,https://leetcode.cn/problems/nim-game/,nim-game,脑筋急转弯、数学、博弈,https://algo.itcharge.cn/Solutions/0200-0299/nim-game/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0292.%20Nim%20%E6%B8%B8%E6%88%8F.md,70.4%,简单,1081 -0293,0200-0299,0293. 翻转游戏,翻转游戏,https://leetcode.cn/problems/flip-game/,flip-game,字符串,https://algo.itcharge.cn/Solutions/0200-0299/flip-game/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0293.%20%E7%BF%BB%E8%BD%AC%E6%B8%B8%E6%88%8F.md,72.7%,简单,125 -0294,0200-0299,0294. 翻转游戏 II,翻转游戏 II,https://leetcode.cn/problems/flip-game-ii/,flip-game-ii,记忆化搜索、数学、动态规划、回溯、博弈,https://algo.itcharge.cn/Solutions/0200-0299/flip-game-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0294.%20%E7%BF%BB%E8%BD%AC%E6%B8%B8%E6%88%8F%20II.md,59.6%,中等,88 -0295,0200-0299,0295. 数据流的中位数,数据流的中位数,https://leetcode.cn/problems/find-median-from-data-stream/,find-median-from-data-stream,设计、双指针、数据流、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/0200-0299/find-median-from-data-stream/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0295.%20%E6%95%B0%E6%8D%AE%E6%B5%81%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0.md,53.4%,困难,769 -0296,0200-0299,0296. 最佳的碰头地点,最佳的碰头地点,https://leetcode.cn/problems/best-meeting-point/,best-meeting-point,数组、数学、矩阵、排序,https://algo.itcharge.cn/Solutions/0200-0299/best-meeting-point/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0296.%20%E6%9C%80%E4%BD%B3%E7%9A%84%E7%A2%B0%E5%A4%B4%E5%9C%B0%E7%82%B9.md,61.1%,困难,68 -0297,0200-0299,0297. 二叉树的序列化与反序列化,二叉树的序列化与反序列化,https://leetcode.cn/problems/serialize-and-deserialize-binary-tree/,serialize-and-deserialize-binary-tree,树、深度优先搜索、广度优先搜索、设计、字符串、二叉树,https://algo.itcharge.cn/Solutions/0200-0299/serialize-and-deserialize-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0297.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%BA%8F%E5%88%97%E5%8C%96%E4%B8%8E%E5%8F%8D%E5%BA%8F%E5%88%97%E5%8C%96.md,58.9%,困难,1357 -0298,0200-0299,0298. 二叉树最长连续序列,二叉树最长连续序列,https://leetcode.cn/problems/binary-tree-longest-consecutive-sequence/,binary-tree-longest-consecutive-sequence,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0200-0299/binary-tree-longest-consecutive-sequence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0298.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E6%9C%80%E9%95%BF%E8%BF%9E%E7%BB%AD%E5%BA%8F%E5%88%97.md,59.9%,中等,145 -0299,0200-0299,0299. 猜数字游戏,猜数字游戏,https://leetcode.cn/problems/bulls-and-cows/,bulls-and-cows,哈希表、字符串、计数,https://algo.itcharge.cn/Solutions/0200-0299/bulls-and-cows/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0299.%20%E7%8C%9C%E6%95%B0%E5%AD%97%E6%B8%B8%E6%88%8F.md,57.4%,中等,896 -0300,0300-0399,0300. 最长递增子序列,最长递增子序列,https://leetcode.cn/problems/longest-increasing-subsequence/,longest-increasing-subsequence,数组、二分查找、动态规划,https://algo.itcharge.cn/Solutions/0300-0399/longest-increasing-subsequence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0300.%20%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E5%AD%90%E5%BA%8F%E5%88%97.md,54.8%,中等,4343 -0301,0300-0399,0301. 删除无效的括号,删除无效的括号,https://leetcode.cn/problems/remove-invalid-parentheses/,remove-invalid-parentheses,广度优先搜索、字符串、回溯,https://algo.itcharge.cn/Solutions/0300-0399/remove-invalid-parentheses/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0301.%20%E5%88%A0%E9%99%A4%E6%97%A0%E6%95%88%E7%9A%84%E6%8B%AC%E5%8F%B7.md,55.2%,困难,591 -0302,0300-0399,0302. 包含全部黑色像素的最小矩形,包含全部黑色像素的最小矩形,https://leetcode.cn/problems/smallest-rectangle-enclosing-black-pixels/,smallest-rectangle-enclosing-black-pixels,深度优先搜索、广度优先搜索、数组、二分查找、矩阵,https://algo.itcharge.cn/Solutions/0300-0399/smallest-rectangle-enclosing-black-pixels/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0302.%20%E5%8C%85%E5%90%AB%E5%85%A8%E9%83%A8%E9%BB%91%E8%89%B2%E5%83%8F%E7%B4%A0%E7%9A%84%E6%9C%80%E5%B0%8F%E7%9F%A9%E5%BD%A2.md,67.5%,困难,65 -0303,0300-0399,0303. 区域和检索 - 数组不可变,区域和检索 - 数组不可变,https://leetcode.cn/problems/range-sum-query-immutable/,range-sum-query-immutable,设计、数组、前缀和,https://algo.itcharge.cn/Solutions/0300-0399/range-sum-query-immutable/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0303.%20%E5%8C%BA%E5%9F%9F%E5%92%8C%E6%A3%80%E7%B4%A2%20-%20%E6%95%B0%E7%BB%84%E4%B8%8D%E5%8F%AF%E5%8F%98.md,76.8%,简单,2144 -0304,0300-0399,0304. 二维区域和检索 - 矩阵不可变,二维区域和检索 - 矩阵不可变,https://leetcode.cn/problems/range-sum-query-2d-immutable/,range-sum-query-2d-immutable,设计、数组、矩阵、前缀和,https://algo.itcharge.cn/Solutions/0300-0399/range-sum-query-2d-immutable/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0304.%20%E4%BA%8C%E7%BB%B4%E5%8C%BA%E5%9F%9F%E5%92%8C%E6%A3%80%E7%B4%A2%20-%20%E7%9F%A9%E9%98%B5%E4%B8%8D%E5%8F%AF%E5%8F%98.md,61.6%,中等,1342 -0305,0300-0399,0305. 岛屿数量 II,岛屿数量 II,https://leetcode.cn/problems/number-of-islands-ii/,number-of-islands-ii,并查集、数组,https://algo.itcharge.cn/Solutions/0300-0399/number-of-islands-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0305.%20%E5%B2%9B%E5%B1%BF%E6%95%B0%E9%87%8F%20II.md,42.2%,困难,127 -0306,0300-0399,0306. 累加数,累加数,https://leetcode.cn/problems/additive-number/,additive-number,字符串、回溯,https://algo.itcharge.cn/Solutions/0300-0399/additive-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0306.%20%E7%B4%AF%E5%8A%A0%E6%95%B0.md,37.8%,中等,687 -0307,0300-0399,0307. 区域和检索 - 数组可修改,区域和检索 - 数组可修改,https://leetcode.cn/problems/range-sum-query-mutable/,range-sum-query-mutable,设计、树状数组、线段树、数组,https://algo.itcharge.cn/Solutions/0300-0399/range-sum-query-mutable/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0307.%20%E5%8C%BA%E5%9F%9F%E5%92%8C%E6%A3%80%E7%B4%A2%20-%20%E6%95%B0%E7%BB%84%E5%8F%AF%E4%BF%AE%E6%94%B9.md,52.1%,中等,602 -0308,0300-0399,0308. 二维区域和检索 - 可变,二维区域和检索 - 可变,https://leetcode.cn/problems/range-sum-query-2d-mutable/,range-sum-query-2d-mutable,设计、树状数组、线段树、数组、矩阵,https://algo.itcharge.cn/Solutions/0300-0399/range-sum-query-2d-mutable/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0308.%20%E4%BA%8C%E7%BB%B4%E5%8C%BA%E5%9F%9F%E5%92%8C%E6%A3%80%E7%B4%A2%20-%20%E5%8F%AF%E5%8F%98.md,64.2%,困难,83 -0309,0300-0399,0309. 最佳买卖股票时机含冷冻期,最佳买卖股票时机含冷冻期,https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-cooldown/,best-time-to-buy-and-sell-stock-with-cooldown,数组、动态规划,https://algo.itcharge.cn/Solutions/0300-0399/best-time-to-buy-and-sell-stock-with-cooldown/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0309.%20%E6%9C%80%E4%BD%B3%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E6%97%B6%E6%9C%BA%E5%90%AB%E5%86%B7%E5%86%BB%E6%9C%9F.md,64.1%,中等,1916 -0310,0300-0399,0310. 最小高度树,最小高度树,https://leetcode.cn/problems/minimum-height-trees/,minimum-height-trees,深度优先搜索、广度优先搜索、图、拓扑排序,https://algo.itcharge.cn/Solutions/0300-0399/minimum-height-trees/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0310.%20%E6%9C%80%E5%B0%8F%E9%AB%98%E5%BA%A6%E6%A0%91.md,42.6%,中等,478 -0311,0300-0399,0311. 稀疏矩阵的乘法,稀疏矩阵的乘法,https://leetcode.cn/problems/sparse-matrix-multiplication/,sparse-matrix-multiplication,数组、哈希表、矩阵,https://algo.itcharge.cn/Solutions/0300-0399/sparse-matrix-multiplication/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0311.%20%E7%A8%80%E7%96%8F%E7%9F%A9%E9%98%B5%E7%9A%84%E4%B9%98%E6%B3%95.md,75.6%,中等,84 -0312,0300-0399,0312. 戳气球,戳气球,https://leetcode.cn/problems/burst-balloons/,burst-balloons,数组、动态规划,https://algo.itcharge.cn/Solutions/0300-0399/burst-balloons/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0312.%20%E6%88%B3%E6%B0%94%E7%90%83.md,69.9%,困难,660 -0313,0300-0399,0313. 超级丑数,超级丑数,https://leetcode.cn/problems/super-ugly-number/,super-ugly-number,数组、数学、动态规划,https://algo.itcharge.cn/Solutions/0300-0399/super-ugly-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0313.%20%E8%B6%85%E7%BA%A7%E4%B8%91%E6%95%B0.md,56.7%,中等,503 -0314,0300-0399,0314. 二叉树的垂直遍历,二叉树的垂直遍历,https://leetcode.cn/problems/binary-tree-vertical-order-traversal/,binary-tree-vertical-order-traversal,树、深度优先搜索、广度优先搜索、哈希表、二叉树,https://algo.itcharge.cn/Solutions/0300-0399/binary-tree-vertical-order-traversal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0314.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%9E%82%E7%9B%B4%E9%81%8D%E5%8E%86.md,55.6%,中等,172 -0315,0300-0399,0315. 计算右侧小于当前元素的个数,计算右侧小于当前元素的个数,https://leetcode.cn/problems/count-of-smaller-numbers-after-self/,count-of-smaller-numbers-after-self,树状数组、线段树、数组、二分查找、分治、有序集合、归并排序,https://algo.itcharge.cn/Solutions/0300-0399/count-of-smaller-numbers-after-self/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0315.%20%E8%AE%A1%E7%AE%97%E5%8F%B3%E4%BE%A7%E5%B0%8F%E4%BA%8E%E5%BD%93%E5%89%8D%E5%85%83%E7%B4%A0%E7%9A%84%E4%B8%AA%E6%95%B0.md,43.4%,困难,807 -0316,0300-0399,0316. 去除重复字母,去除重复字母,https://leetcode.cn/problems/remove-duplicate-letters/,remove-duplicate-letters,栈、贪心、字符串、单调栈,https://algo.itcharge.cn/Solutions/0300-0399/remove-duplicate-letters/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0316.%20%E5%8E%BB%E9%99%A4%E9%87%8D%E5%A4%8D%E5%AD%97%E6%AF%8D.md,48.3%,中等,887 -0317,0300-0399,0317. 离建筑物最近的距离,离建筑物最近的距离,https://leetcode.cn/problems/shortest-distance-from-all-buildings/,shortest-distance-from-all-buildings,广度优先搜索、数组、矩阵,https://algo.itcharge.cn/Solutions/0300-0399/shortest-distance-from-all-buildings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0317.%20%E7%A6%BB%E5%BB%BA%E7%AD%91%E7%89%A9%E6%9C%80%E8%BF%91%E7%9A%84%E8%B7%9D%E7%A6%BB.md,47.7%,困难,95 -0318,0300-0399,0318. 最大单词长度乘积,最大单词长度乘积,https://leetcode.cn/problems/maximum-product-of-word-lengths/,maximum-product-of-word-lengths,位运算、数组、字符串,https://algo.itcharge.cn/Solutions/0300-0399/maximum-product-of-word-lengths/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0318.%20%E6%9C%80%E5%A4%A7%E5%8D%95%E8%AF%8D%E9%95%BF%E5%BA%A6%E4%B9%98%E7%A7%AF.md,72.7%,中等,618 -0319,0300-0399,0319. 灯泡开关,灯泡开关,https://leetcode.cn/problems/bulb-switcher/,bulb-switcher,脑筋急转弯、数学,https://algo.itcharge.cn/Solutions/0300-0399/bulb-switcher/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0319.%20%E7%81%AF%E6%B3%A1%E5%BC%80%E5%85%B3.md,57.7%,中等,536 -0320,0300-0399,0320. 列举单词的全部缩写,列举单词的全部缩写,https://leetcode.cn/problems/generalized-abbreviation/,generalized-abbreviation,位运算、字符串、回溯,https://algo.itcharge.cn/Solutions/0300-0399/generalized-abbreviation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0320.%20%E5%88%97%E4%B8%BE%E5%8D%95%E8%AF%8D%E7%9A%84%E5%85%A8%E9%83%A8%E7%BC%A9%E5%86%99.md,70.1%,中等,82 -0321,0300-0399,0321. 拼接最大数,拼接最大数,https://leetcode.cn/problems/create-maximum-number/,create-maximum-number,栈、贪心、单调栈,https://algo.itcharge.cn/Solutions/0300-0399/create-maximum-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0321.%20%E6%8B%BC%E6%8E%A5%E6%9C%80%E5%A4%A7%E6%95%B0.md,42.0%,困难,300 -0322,0300-0399,0322. 零钱兑换,零钱兑换,https://leetcode.cn/problems/coin-change/,coin-change,广度优先搜索、数组、动态规划,https://algo.itcharge.cn/Solutions/0300-0399/coin-change/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0322.%20%E9%9B%B6%E9%92%B1%E5%85%91%E6%8D%A2.md,46.4%,中等,3607 -0323,0300-0399,0323. 无向图中连通分量的数目,无向图中连通分量的数目,https://leetcode.cn/problems/number-of-connected-components-in-an-undirected-graph/,number-of-connected-components-in-an-undirected-graph,深度优先搜索、广度优先搜索、并查集、图,https://algo.itcharge.cn/Solutions/0300-0399/number-of-connected-components-in-an-undirected-graph/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0323.%20%E6%97%A0%E5%90%91%E5%9B%BE%E4%B8%AD%E8%BF%9E%E9%80%9A%E5%88%86%E9%87%8F%E7%9A%84%E6%95%B0%E7%9B%AE.md,65.6%,中等,338 -0324,0300-0399,0324. 摆动排序 II,摆动排序 II,https://leetcode.cn/problems/wiggle-sort-ii/,wiggle-sort-ii,数组、分治、快速选择、排序,https://algo.itcharge.cn/Solutions/0300-0399/wiggle-sort-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0324.%20%E6%91%86%E5%8A%A8%E6%8E%92%E5%BA%8F%20II.md,40.9%,中等,399 -0325,0300-0399,0325. 和等于 k 的最长子数组长度,和等于 k 的最长子数组长度,https://leetcode.cn/problems/maximum-size-subarray-sum-equals-k/,maximum-size-subarray-sum-equals-k,数组、哈希表、前缀和,https://algo.itcharge.cn/Solutions/0300-0399/maximum-size-subarray-sum-equals-k/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0325.%20%E5%92%8C%E7%AD%89%E4%BA%8E%20k%20%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E6%95%B0%E7%BB%84%E9%95%BF%E5%BA%A6.md,51.7%,中等,191 -0326,0300-0399,0326. 3 的幂,3 的幂,https://leetcode.cn/problems/power-of-three/,power-of-three,递归、数学,https://algo.itcharge.cn/Solutions/0300-0399/power-of-three/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0326.%203%20%E7%9A%84%E5%B9%82.md,50.9%,简单,920 -0327,0300-0399,0327. 区间和的个数,区间和的个数,https://leetcode.cn/problems/count-of-range-sum/,count-of-range-sum,树状数组、线段树、数组、二分查找、分治、有序集合、归并排序,https://algo.itcharge.cn/Solutions/0300-0399/count-of-range-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0327.%20%E5%8C%BA%E9%97%B4%E5%92%8C%E7%9A%84%E4%B8%AA%E6%95%B0.md,40.7%,困难,353 -0328,0300-0399,0328. 奇偶链表,奇偶链表,https://leetcode.cn/problems/odd-even-linked-list/,odd-even-linked-list,链表,https://algo.itcharge.cn/Solutions/0300-0399/odd-even-linked-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0328.%20%E5%A5%87%E5%81%B6%E9%93%BE%E8%A1%A8.md,65.0%,中等,1598 -0329,0300-0399,0329. 矩阵中的最长递增路径,矩阵中的最长递增路径,https://leetcode.cn/problems/longest-increasing-path-in-a-matrix/,longest-increasing-path-in-a-matrix,深度优先搜索、广度优先搜索、图、拓扑排序、记忆化搜索、数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/0300-0399/longest-increasing-path-in-a-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0329.%20%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E8%B7%AF%E5%BE%84.md,51.7%,困难,842 -0330,0300-0399,0330. 按要求补齐数组,按要求补齐数组,https://leetcode.cn/problems/patching-array/,patching-array,贪心、数组,https://algo.itcharge.cn/Solutions/0300-0399/patching-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0330.%20%E6%8C%89%E8%A6%81%E6%B1%82%E8%A1%A5%E9%BD%90%E6%95%B0%E7%BB%84.md,52.9%,困难,192 -0331,0300-0399,0331. 验证二叉树的前序序列化,验证二叉树的前序序列化,https://leetcode.cn/problems/verify-preorder-serialization-of-a-binary-tree/,verify-preorder-serialization-of-a-binary-tree,栈、树、字符串、二叉树,https://algo.itcharge.cn/Solutions/0300-0399/verify-preorder-serialization-of-a-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0331.%20%E9%AA%8C%E8%AF%81%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%89%8D%E5%BA%8F%E5%BA%8F%E5%88%97%E5%8C%96.md,48.1%,中等,648 -0332,0300-0399,0332. 重新安排行程,重新安排行程,https://leetcode.cn/problems/reconstruct-itinerary/,reconstruct-itinerary,深度优先搜索、图、欧拉回路,https://algo.itcharge.cn/Solutions/0300-0399/reconstruct-itinerary/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0332.%20%E9%87%8D%E6%96%B0%E5%AE%89%E6%8E%92%E8%A1%8C%E7%A8%8B.md,47.7%,困难,608 -0333,0300-0399,0333. 最大 BST 子树,最大 BST 子树,https://leetcode.cn/problems/largest-bst-subtree/,largest-bst-subtree,树、深度优先搜索、二叉搜索树、动态规划、二叉树,https://algo.itcharge.cn/Solutions/0300-0399/largest-bst-subtree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0333.%20%E6%9C%80%E5%A4%A7%20BST%20%E5%AD%90%E6%A0%91.md,48.8%,中等,147 -0334,0300-0399,0334. 递增的三元子序列,递增的三元子序列,https://leetcode.cn/problems/increasing-triplet-subsequence/,increasing-triplet-subsequence,贪心、数组,https://algo.itcharge.cn/Solutions/0300-0399/increasing-triplet-subsequence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0334.%20%E9%80%92%E5%A2%9E%E7%9A%84%E4%B8%89%E5%85%83%E5%AD%90%E5%BA%8F%E5%88%97.md,43.1%,中等,822 -0335,0300-0399,0335. 路径交叉,路径交叉,https://leetcode.cn/problems/self-crossing/,self-crossing,几何、数组、数学,https://algo.itcharge.cn/Solutions/0300-0399/self-crossing/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0335.%20%E8%B7%AF%E5%BE%84%E4%BA%A4%E5%8F%89.md,42.4%,困难,168 -0336,0300-0399,0336. 回文对,回文对,https://leetcode.cn/problems/palindrome-pairs/,palindrome-pairs,字典树、数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/0300-0399/palindrome-pairs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0336.%20%E5%9B%9E%E6%96%87%E5%AF%B9.md,38.2%,困难,242 -0337,0300-0399,0337. 打家劫舍 III,打家劫舍 III,https://leetcode.cn/problems/house-robber-iii/,house-robber-iii,树、深度优先搜索、动态规划、二叉树,https://algo.itcharge.cn/Solutions/0300-0399/house-robber-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0337.%20%E6%89%93%E5%AE%B6%E5%8A%AB%E8%88%8D%20III.md,61.1%,中等,1748 -0338,0300-0399,0338. 比特位计数,比特位计数,https://leetcode.cn/problems/counting-bits/,counting-bits,位运算、动态规划,https://algo.itcharge.cn/Solutions/0300-0399/counting-bits/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0338.%20%E6%AF%94%E7%89%B9%E4%BD%8D%E8%AE%A1%E6%95%B0.md,78.6%,简单,2226 -0339,0300-0399,0339. 嵌套列表权重和,嵌套列表权重和,https://leetcode.cn/problems/nested-list-weight-sum/,nested-list-weight-sum,深度优先搜索、广度优先搜索,https://algo.itcharge.cn/Solutions/0300-0399/nested-list-weight-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0339.%20%E5%B5%8C%E5%A5%97%E5%88%97%E8%A1%A8%E6%9D%83%E9%87%8D%E5%92%8C.md,83.2%,中等,82 -0340,0300-0399,0340. 至多包含 K 个不同字符的最长子串,至多包含 K 个不同字符的最长子串,https://leetcode.cn/problems/longest-substring-with-at-most-k-distinct-characters/,longest-substring-with-at-most-k-distinct-characters,哈希表、字符串、滑动窗口,https://algo.itcharge.cn/Solutions/0300-0399/longest-substring-with-at-most-k-distinct-characters/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0340.%20%E8%87%B3%E5%A4%9A%E5%8C%85%E5%90%AB%20K%20%E4%B8%AA%E4%B8%8D%E5%90%8C%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2.md,51.1%,中等,307 -0341,0300-0399,0341. 扁平化嵌套列表迭代器,扁平化嵌套列表迭代器,https://leetcode.cn/problems/flatten-nested-list-iterator/,flatten-nested-list-iterator,栈、树、深度优先搜索、设计、队列、迭代器,https://algo.itcharge.cn/Solutions/0300-0399/flatten-nested-list-iterator/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0341.%20%E6%89%81%E5%B9%B3%E5%8C%96%E5%B5%8C%E5%A5%97%E5%88%97%E8%A1%A8%E8%BF%AD%E4%BB%A3%E5%99%A8.md,72.8%,中等,666 -0342,0300-0399,0342. 4的幂,4的幂,https://leetcode.cn/problems/power-of-four/,power-of-four,位运算、递归、数学,https://algo.itcharge.cn/Solutions/0300-0399/power-of-four/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0342.%204%E7%9A%84%E5%B9%82.md,52.9%,简单,1098 -0343,0300-0399,0343. 整数拆分,整数拆分,https://leetcode.cn/problems/integer-break/,integer-break,数学、动态规划,https://algo.itcharge.cn/Solutions/0300-0399/integer-break/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0343.%20%E6%95%B4%E6%95%B0%E6%8B%86%E5%88%86.md,62.2%,中等,1923 -0344,0300-0399,0344. 反转字符串,反转字符串,https://leetcode.cn/problems/reverse-string/,reverse-string,双指针、字符串,https://algo.itcharge.cn/Solutions/0300-0399/reverse-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0344.%20%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2.md,79.7%,简单,3706 -0345,0300-0399,0345. 反转字符串中的元音字母,反转字符串中的元音字母,https://leetcode.cn/problems/reverse-vowels-of-a-string/,reverse-vowels-of-a-string,双指针、字符串,https://algo.itcharge.cn/Solutions/0300-0399/reverse-vowels-of-a-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0345.%20%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%85%83%E9%9F%B3%E5%AD%97%E6%AF%8D.md,54.5%,简单,1442 -0346,0300-0399,0346. 数据流中的移动平均值,数据流中的移动平均值,https://leetcode.cn/problems/moving-average-from-data-stream/,moving-average-from-data-stream,设计、队列、数组、数据流,https://algo.itcharge.cn/Solutions/0300-0399/moving-average-from-data-stream/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0346.%20%E6%95%B0%E6%8D%AE%E6%B5%81%E4%B8%AD%E7%9A%84%E7%A7%BB%E5%8A%A8%E5%B9%B3%E5%9D%87%E5%80%BC.md,72.2%,简单,207 -0347,0300-0399,0347. 前 K 个高频元素,前 K 个高频元素,https://leetcode.cn/problems/top-k-frequent-elements/,top-k-frequent-elements,数组、哈希表、分治、桶排序、计数、快速选择、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/0300-0399/top-k-frequent-elements/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0347.%20%E5%89%8D%20K%20%E4%B8%AA%E9%AB%98%E9%A2%91%E5%85%83%E7%B4%A0.md,63.5%,中等,2922 -0348,0300-0399,0348. 设计井字棋,设计井字棋,https://leetcode.cn/problems/design-tic-tac-toe/,design-tic-tac-toe,设计、数组、哈希表、矩阵,https://algo.itcharge.cn/Solutions/0300-0399/design-tic-tac-toe/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0348.%20%E8%AE%BE%E8%AE%A1%E4%BA%95%E5%AD%97%E6%A3%8B.md,59.3%,中等,133 -0349,0300-0399,0349. 两个数组的交集,两个数组的交集,https://leetcode.cn/problems/intersection-of-two-arrays/,intersection-of-two-arrays,数组、哈希表、双指针、二分查找、排序,https://algo.itcharge.cn/Solutions/0300-0399/intersection-of-two-arrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0349.%20%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E7%9A%84%E4%BA%A4%E9%9B%86.md,74.3%,简单,2927 -0350,0300-0399,0350. 两个数组的交集 II,两个数组的交集 II,https://leetcode.cn/problems/intersection-of-two-arrays-ii/,intersection-of-two-arrays-ii,数组、哈希表、双指针、二分查找、排序,https://algo.itcharge.cn/Solutions/0300-0399/intersection-of-two-arrays-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0350.%20%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E7%9A%84%E4%BA%A4%E9%9B%86%20II.md,57.0%,简单,2816 -0351,0300-0399,0351. 安卓系统手势解锁,安卓系统手势解锁,https://leetcode.cn/problems/android-unlock-patterns/,android-unlock-patterns,动态规划、回溯,https://algo.itcharge.cn/Solutions/0300-0399/android-unlock-patterns/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0351.%20%E5%AE%89%E5%8D%93%E7%B3%BB%E7%BB%9F%E6%89%8B%E5%8A%BF%E8%A7%A3%E9%94%81.md,61.4%,中等,134 -0352,0300-0399,0352. 将数据流变为多个不相交区间,将数据流变为多个不相交区间,https://leetcode.cn/problems/data-stream-as-disjoint-intervals/,data-stream-as-disjoint-intervals,设计、二分查找、有序集合,https://algo.itcharge.cn/Solutions/0300-0399/data-stream-as-disjoint-intervals/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0352.%20%E5%B0%86%E6%95%B0%E6%8D%AE%E6%B5%81%E5%8F%98%E4%B8%BA%E5%A4%9A%E4%B8%AA%E4%B8%8D%E7%9B%B8%E4%BA%A4%E5%8C%BA%E9%97%B4.md,67.3%,困难,411 -0353,0300-0399,0353. 贪吃蛇,贪吃蛇,https://leetcode.cn/problems/design-snake-game/,design-snake-game,设计、队列、数组、矩阵,https://algo.itcharge.cn/Solutions/0300-0399/design-snake-game/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0353.%20%E8%B4%AA%E5%90%83%E8%9B%87.md,43.4%,中等,85 -0354,0300-0399,0354. 俄罗斯套娃信封问题,俄罗斯套娃信封问题,https://leetcode.cn/problems/russian-doll-envelopes/,russian-doll-envelopes,数组、二分查找、动态规划、排序,https://algo.itcharge.cn/Solutions/0300-0399/russian-doll-envelopes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0354.%20%E4%BF%84%E7%BD%97%E6%96%AF%E5%A5%97%E5%A8%83%E4%BF%A1%E5%B0%81%E9%97%AE%E9%A2%98.md,37.6%,困难,832 -0355,0300-0399,0355. 设计推特,设计推特,https://leetcode.cn/problems/design-twitter/,design-twitter,设计、哈希表、链表、堆（优先队列）,https://algo.itcharge.cn/Solutions/0300-0399/design-twitter/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0355.%20%E8%AE%BE%E8%AE%A1%E6%8E%A8%E7%89%B9.md,41.1%,中等,700 -0356,0300-0399,0356. 直线镜像,直线镜像,https://leetcode.cn/problems/line-reflection/,line-reflection,数组、哈希表、数学,https://algo.itcharge.cn/Solutions/0300-0399/line-reflection/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0356.%20%E7%9B%B4%E7%BA%BF%E9%95%9C%E5%83%8F.md,36.8%,中等,61 -0357,0300-0399,0357. 统计各位数字都不同的数字个数,统计各位数字都不同的数字个数,https://leetcode.cn/problems/count-numbers-with-unique-digits/,count-numbers-with-unique-digits,数学、动态规划、回溯,https://algo.itcharge.cn/Solutions/0300-0399/count-numbers-with-unique-digits/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0357.%20%E7%BB%9F%E8%AE%A1%E5%90%84%E4%BD%8D%E6%95%B0%E5%AD%97%E9%83%BD%E4%B8%8D%E5%90%8C%E7%9A%84%E6%95%B0%E5%AD%97%E4%B8%AA%E6%95%B0.md,60.5%,中等,936 -0358,0300-0399,0358. K 距离间隔重排字符串,K 距离间隔重排字符串,https://leetcode.cn/problems/rearrange-string-k-distance-apart/,rearrange-string-k-distance-apart,贪心、哈希表、字符串、计数、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/0300-0399/rearrange-string-k-distance-apart/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0358.%20K%20%E8%B7%9D%E7%A6%BB%E9%97%B4%E9%9A%94%E9%87%8D%E6%8E%92%E5%AD%97%E7%AC%A6%E4%B8%B2.md,36.6%,困难,91 -0359,0300-0399,0359. 日志速率限制器,日志速率限制器,https://leetcode.cn/problems/logger-rate-limiter/,logger-rate-limiter,设计、哈希表,https://algo.itcharge.cn/Solutions/0300-0399/logger-rate-limiter/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0359.%20%E6%97%A5%E5%BF%97%E9%80%9F%E7%8E%87%E9%99%90%E5%88%B6%E5%99%A8.md,74.7%,简单,103 -0360,0300-0399,0360. 有序转化数组,有序转化数组,https://leetcode.cn/problems/sort-transformed-array/,sort-transformed-array,数组、数学、双指针、排序,https://algo.itcharge.cn/Solutions/0300-0399/sort-transformed-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0360.%20%E6%9C%89%E5%BA%8F%E8%BD%AC%E5%8C%96%E6%95%B0%E7%BB%84.md,62.3%,中等,90 -0361,0300-0399,0361. 轰炸敌人,轰炸敌人,https://leetcode.cn/problems/bomb-enemy/,bomb-enemy,数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/0300-0399/bomb-enemy/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0361.%20%E8%BD%B0%E7%82%B8%E6%95%8C%E4%BA%BA.md,59.6%,中等,106 -0362,0300-0399,0362. 敲击计数器,敲击计数器,https://leetcode.cn/problems/design-hit-counter/,design-hit-counter,设计、队列、数组、哈希表、二分查找,https://algo.itcharge.cn/Solutions/0300-0399/design-hit-counter/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0362.%20%E6%95%B2%E5%87%BB%E8%AE%A1%E6%95%B0%E5%99%A8.md,68.8%,中等,124 -0363,0300-0399,0363. 矩形区域不超过 K 的最大数值和,矩形区域不超过 K 的最大数值和,https://leetcode.cn/problems/max-sum-of-rectangle-no-larger-than-k/,max-sum-of-rectangle-no-larger-than-k,数组、二分查找、矩阵、有序集合、前缀和,https://algo.itcharge.cn/Solutions/0300-0399/max-sum-of-rectangle-no-larger-than-k/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0363.%20%E7%9F%A9%E5%BD%A2%E5%8C%BA%E5%9F%9F%E4%B8%8D%E8%B6%85%E8%BF%87%20K%20%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E5%80%BC%E5%92%8C.md,48.1%,困难,265 -0364,0300-0399,0364. 加权嵌套序列和 II,加权嵌套序列和 II,https://leetcode.cn/problems/nested-list-weight-sum-ii/,nested-list-weight-sum-ii,栈、深度优先搜索、广度优先搜索,https://algo.itcharge.cn/Solutions/0300-0399/nested-list-weight-sum-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0364.%20%E5%8A%A0%E6%9D%83%E5%B5%8C%E5%A5%97%E5%BA%8F%E5%88%97%E5%92%8C%20II.md,67.0%,中等,77 -0365,0300-0399,0365. 水壶问题,水壶问题,https://leetcode.cn/problems/water-and-jug-problem/,water-and-jug-problem,深度优先搜索、广度优先搜索、数学,https://algo.itcharge.cn/Solutions/0300-0399/water-and-jug-problem/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0365.%20%E6%B0%B4%E5%A3%B6%E9%97%AE%E9%A2%98.md,39.9%,中等,610 -0366,0300-0399,0366. 寻找二叉树的叶子节点,寻找二叉树的叶子节点,https://leetcode.cn/problems/find-leaves-of-binary-tree/,find-leaves-of-binary-tree,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0300-0399/find-leaves-of-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0366.%20%E5%AF%BB%E6%89%BE%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%8F%B6%E5%AD%90%E8%8A%82%E7%82%B9.md,80.1%,中等,216 -0367,0300-0399,0367. 有效的完全平方数,有效的完全平方数,https://leetcode.cn/problems/valid-perfect-square/,valid-perfect-square,数学、二分查找,https://algo.itcharge.cn/Solutions/0300-0399/valid-perfect-square/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0367.%20%E6%9C%89%E6%95%88%E7%9A%84%E5%AE%8C%E5%85%A8%E5%B9%B3%E6%96%B9%E6%95%B0.md,44.8%,简单,1681 -0368,0300-0399,0368. 最大整除子集,最大整除子集,https://leetcode.cn/problems/largest-divisible-subset/,largest-divisible-subset,数组、数学、动态规划、排序,https://algo.itcharge.cn/Solutions/0300-0399/largest-divisible-subset/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0368.%20%E6%9C%80%E5%A4%A7%E6%95%B4%E9%99%A4%E5%AD%90%E9%9B%86.md,46.0%,中等,591 -0369,0300-0399,0369. 给单链表加一,给单链表加一,https://leetcode.cn/problems/plus-one-linked-list/,plus-one-linked-list,链表、数学,https://algo.itcharge.cn/Solutions/0300-0399/plus-one-linked-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0369.%20%E7%BB%99%E5%8D%95%E9%93%BE%E8%A1%A8%E5%8A%A0%E4%B8%80.md,62.9%,中等,230 -0370,0300-0399,0370. 区间加法,区间加法,https://leetcode.cn/problems/range-addition/,range-addition,数组、前缀和,https://algo.itcharge.cn/Solutions/0300-0399/range-addition/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0370.%20%E5%8C%BA%E9%97%B4%E5%8A%A0%E6%B3%95.md,76.7%,中等,276 -0371,0300-0399,0371. 两整数之和,两整数之和,https://leetcode.cn/problems/sum-of-two-integers/,sum-of-two-integers,位运算、数学,https://algo.itcharge.cn/Solutions/0300-0399/sum-of-two-integers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0371.%20%E4%B8%A4%E6%95%B4%E6%95%B0%E4%B9%8B%E5%92%8C.md,61.6%,中等,690 -0372,0300-0399,0372. 超级次方,超级次方,https://leetcode.cn/problems/super-pow/,super-pow,数学、分治,https://algo.itcharge.cn/Solutions/0300-0399/super-pow/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0372.%20%E8%B6%85%E7%BA%A7%E6%AC%A1%E6%96%B9.md,57.2%,中等,509 -0373,0300-0399,0373. 查找和最小的 K 对数字,查找和最小的 K 对数字,https://leetcode.cn/problems/find-k-pairs-with-smallest-sums/,find-k-pairs-with-smallest-sums,数组、堆（优先队列）,https://algo.itcharge.cn/Solutions/0300-0399/find-k-pairs-with-smallest-sums/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0373.%20%E6%9F%A5%E6%89%BE%E5%92%8C%E6%9C%80%E5%B0%8F%E7%9A%84%20K%20%E5%AF%B9%E6%95%B0%E5%AD%97.md,40.8%,中等,540 -0374,0300-0399,0374. 猜数字大小,猜数字大小,https://leetcode.cn/problems/guess-number-higher-or-lower/,guess-number-higher-or-lower,二分查找、交互,https://algo.itcharge.cn/Solutions/0300-0399/guess-number-higher-or-lower/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0374.%20%E7%8C%9C%E6%95%B0%E5%AD%97%E5%A4%A7%E5%B0%8F.md,52.2%,简单,1024 -0375,0300-0399,0375. 猜数字大小 II,猜数字大小 II,https://leetcode.cn/problems/guess-number-higher-or-lower-ii/,guess-number-higher-or-lower-ii,数学、动态规划、博弈,https://algo.itcharge.cn/Solutions/0300-0399/guess-number-higher-or-lower-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0375.%20%E7%8C%9C%E6%95%B0%E5%AD%97%E5%A4%A7%E5%B0%8F%20II.md,62.5%,中等,350 -0376,0300-0399,0376. 摆动序列,摆动序列,https://leetcode.cn/problems/wiggle-subsequence/,wiggle-subsequence,贪心、数组、动态规划,https://algo.itcharge.cn/Solutions/0300-0399/wiggle-subsequence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0376.%20%E6%91%86%E5%8A%A8%E5%BA%8F%E5%88%97.md,46.9%,中等,1568 -0377,0300-0399,0377. 组合总和 Ⅳ,组合总和 Ⅳ,https://leetcode.cn/problems/combination-sum-iv/,combination-sum-iv,数组、动态规划,https://algo.itcharge.cn/Solutions/0300-0399/combination-sum-iv/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0377.%20%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8C%20%E2%85%A3.md,52.9%,中等,964 -0378,0300-0399,0378. 有序矩阵中第 K 小的元素,有序矩阵中第 K 小的元素,https://leetcode.cn/problems/kth-smallest-element-in-a-sorted-matrix/,kth-smallest-element-in-a-sorted-matrix,数组、二分查找、矩阵、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/0300-0399/kth-smallest-element-in-a-sorted-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0378.%20%E6%9C%89%E5%BA%8F%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%AC%AC%20K%20%E5%B0%8F%E7%9A%84%E5%85%83%E7%B4%A0.md,63.6%,中等,839 -0379,0300-0399,0379. 电话目录管理系统,电话目录管理系统,https://leetcode.cn/problems/design-phone-directory/,design-phone-directory,设计、队列、数组、哈希表、链表,https://algo.itcharge.cn/Solutions/0300-0399/design-phone-directory/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0379.%20%E7%94%B5%E8%AF%9D%E7%9B%AE%E5%BD%95%E7%AE%A1%E7%90%86%E7%B3%BB%E7%BB%9F.md,61.2%,中等,116 -0380,0300-0399,0380. O(1) 时间插入、删除和获取随机元素,O(1) 时间插入、删除和获取随机元素,https://leetcode.cn/problems/insert-delete-getrandom-o1/,insert-delete-getrandom-o1,设计、数组、哈希表、数学、随机化,https://algo.itcharge.cn/Solutions/0300-0399/insert-delete-getrandom-o1/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0380.%20O%281%29%20%E6%97%B6%E9%97%B4%E6%8F%92%E5%85%A5%E3%80%81%E5%88%A0%E9%99%A4%E5%92%8C%E8%8E%B7%E5%8F%96%E9%9A%8F%E6%9C%BA%E5%85%83%E7%B4%A0.md,52.6%,中等,1663 -0381,0300-0399,0381. O(1) 时间插入、删除和获取随机元素 - 允许重复,O(1) 时间插入、删除和获取随机元素 - 允许重复,https://leetcode.cn/problems/insert-delete-getrandom-o1-duplicates-allowed/,insert-delete-getrandom-o1-duplicates-allowed,设计、数组、哈希表、数学、随机化,https://algo.itcharge.cn/Solutions/0300-0399/insert-delete-getrandom-o1-duplicates-allowed/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0381.%20O%281%29%20%E6%97%B6%E9%97%B4%E6%8F%92%E5%85%A5%E3%80%81%E5%88%A0%E9%99%A4%E5%92%8C%E8%8E%B7%E5%8F%96%E9%9A%8F%E6%9C%BA%E5%85%83%E7%B4%A0%20-%20%E5%85%81%E8%AE%B8%E9%87%8D%E5%A4%8D.md,42.3%,困难,239 -0382,0300-0399,0382. 链表随机节点,链表随机节点,https://leetcode.cn/problems/linked-list-random-node/,linked-list-random-node,水塘抽样、链表、数学、随机化,https://algo.itcharge.cn/Solutions/0300-0399/linked-list-random-node/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0382.%20%E9%93%BE%E8%A1%A8%E9%9A%8F%E6%9C%BA%E8%8A%82%E7%82%B9.md,72.8%,中等,454 -0383,0300-0399,0383. 赎金信,赎金信,https://leetcode.cn/problems/ransom-note/,ransom-note,哈希表、字符串、计数,https://algo.itcharge.cn/Solutions/0300-0399/ransom-note/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0383.%20%E8%B5%8E%E9%87%91%E4%BF%A1.md,60.6%,简单,3003 -0384,0300-0399,0384. 打乱数组,打乱数组,https://leetcode.cn/problems/shuffle-an-array/,shuffle-an-array,数组、数学、随机化,https://algo.itcharge.cn/Solutions/0300-0399/shuffle-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0384.%20%E6%89%93%E4%B9%B1%E6%95%B0%E7%BB%84.md,61.6%,中等,601 -0385,0300-0399,0385. 迷你语法分析器,迷你语法分析器,https://leetcode.cn/problems/mini-parser/,mini-parser,栈、深度优先搜索、字符串,https://algo.itcharge.cn/Solutions/0300-0399/mini-parser/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0385.%20%E8%BF%B7%E4%BD%A0%E8%AF%AD%E6%B3%95%E5%88%86%E6%9E%90%E5%99%A8.md,54.8%,中等,302 -0386,0300-0399,0386. 字典序排数,字典序排数,https://leetcode.cn/problems/lexicographical-numbers/,lexicographical-numbers,深度优先搜索、字典树,https://algo.itcharge.cn/Solutions/0300-0399/lexicographical-numbers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0386.%20%E5%AD%97%E5%85%B8%E5%BA%8F%E6%8E%92%E6%95%B0.md,74.8%,中等,672 -0387,0300-0399,0387. 字符串中的第一个唯一字符,字符串中的第一个唯一字符,https://leetcode.cn/problems/first-unique-character-in-a-string/,first-unique-character-in-a-string,队列、哈希表、字符串、计数,https://algo.itcharge.cn/Solutions/0300-0399/first-unique-character-in-a-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0387.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%94%AF%E4%B8%80%E5%AD%97%E7%AC%A6.md,55.9%,简单,2154 -0388,0300-0399,0388. 文件的最长绝对路径,文件的最长绝对路径,https://leetcode.cn/problems/longest-absolute-file-path/,longest-absolute-file-path,栈、深度优先搜索、字符串,https://algo.itcharge.cn/Solutions/0300-0399/longest-absolute-file-path/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0388.%20%E6%96%87%E4%BB%B6%E7%9A%84%E6%9C%80%E9%95%BF%E7%BB%9D%E5%AF%B9%E8%B7%AF%E5%BE%84.md,63.8%,中等,529 -0389,0300-0399,0389. 找不同,找不同,https://leetcode.cn/problems/find-the-difference/,find-the-difference,位运算、哈希表、字符串、排序,https://algo.itcharge.cn/Solutions/0300-0399/find-the-difference/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0389.%20%E6%89%BE%E4%B8%8D%E5%90%8C.md,66.7%,简单,1644 -0390,0300-0399,0390. 消除游戏,消除游戏,https://leetcode.cn/problems/elimination-game/,elimination-game,递归、数学,https://algo.itcharge.cn/Solutions/0300-0399/elimination-game/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0390.%20%E6%B6%88%E9%99%A4%E6%B8%B8%E6%88%8F.md,60.2%,中等,472 -0391,0300-0399,0391. 完美矩形,完美矩形,https://leetcode.cn/problems/perfect-rectangle/,perfect-rectangle,数组、扫描线,https://algo.itcharge.cn/Solutions/0300-0399/perfect-rectangle/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0391.%20%E5%AE%8C%E7%BE%8E%E7%9F%A9%E5%BD%A2.md,46.1%,困难,321 -0392,0300-0399,0392. 判断子序列,判断子序列,https://leetcode.cn/problems/is-subsequence/,is-subsequence,双指针、字符串、动态规划,https://algo.itcharge.cn/Solutions/0300-0399/is-subsequence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0392.%20%E5%88%A4%E6%96%AD%E5%AD%90%E5%BA%8F%E5%88%97.md,52.4%,简单,2748 -0393,0300-0399,0393. UTF-8 编码验证,UTF-8 编码验证,https://leetcode.cn/problems/utf-8-validation/,utf-8-validation,位运算、数组,https://algo.itcharge.cn/Solutions/0300-0399/utf-8-validation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0393.%20UTF-8%20%E7%BC%96%E7%A0%81%E9%AA%8C%E8%AF%81.md,43.7%,中等,488 -0394,0300-0399,0394. 字符串解码,字符串解码,https://leetcode.cn/problems/decode-string/,decode-string,栈、递归、字符串,https://algo.itcharge.cn/Solutions/0300-0399/decode-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0394.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%A7%A3%E7%A0%81.md,56.7%,中等,2240 -0395,0300-0399,0395. 至少有 K 个重复字符的最长子串,至少有 K 个重复字符的最长子串,https://leetcode.cn/problems/longest-substring-with-at-least-k-repeating-characters/,longest-substring-with-at-least-k-repeating-characters,哈希表、字符串、分治、滑动窗口,https://algo.itcharge.cn/Solutions/0300-0399/longest-substring-with-at-least-k-repeating-characters/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0395.%20%E8%87%B3%E5%B0%91%E6%9C%89%20K%20%E4%B8%AA%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2.md,52.5%,中等,661 -0396,0300-0399,0396. 旋转函数,旋转函数,https://leetcode.cn/problems/rotate-function/,rotate-function,数组、数学、动态规划,https://algo.itcharge.cn/Solutions/0300-0399/rotate-function/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0396.%20%E6%97%8B%E8%BD%AC%E5%87%BD%E6%95%B0.md,53.2%,中等,605 -0397,0300-0399,0397. 整数替换,整数替换,https://leetcode.cn/problems/integer-replacement/,integer-replacement,贪心、位运算、记忆化搜索、动态规划,https://algo.itcharge.cn/Solutions/0300-0399/integer-replacement/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0397.%20%E6%95%B4%E6%95%B0%E6%9B%BF%E6%8D%A2.md,42.4%,中等,702 -0398,0300-0399,0398. 随机数索引,随机数索引,https://leetcode.cn/problems/random-pick-index/,random-pick-index,水塘抽样、哈希表、数学、随机化,https://algo.itcharge.cn/Solutions/0300-0399/random-pick-index/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0398.%20%E9%9A%8F%E6%9C%BA%E6%95%B0%E7%B4%A2%E5%BC%95.md,69.7%,中等,476 -0399,0300-0399,0399. 除法求值,除法求值,https://leetcode.cn/problems/evaluate-division/,evaluate-division,深度优先搜索、广度优先搜索、并查集、图、数组、最短路,https://algo.itcharge.cn/Solutions/0300-0399/evaluate-division/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0399.%20%E9%99%A4%E6%B3%95%E6%B1%82%E5%80%BC.md,59.1%,中等,892 -0400,0400-0499,0400. 第 N 位数字,第 N 位数字,https://leetcode.cn/problems/nth-digit/,nth-digit,数学、二分查找,https://algo.itcharge.cn/Solutions/0400-0499/nth-digit/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0400.%20%E7%AC%AC%20N%20%E4%BD%8D%E6%95%B0%E5%AD%97.md,45.6%,中等,630 -0401,0400-0499,0401. 二进制手表,二进制手表,https://leetcode.cn/problems/binary-watch/,binary-watch,位运算、回溯,https://algo.itcharge.cn/Solutions/0400-0499/binary-watch/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0401.%20%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%89%8B%E8%A1%A8.md,62.6%,简单,884 -0402,0400-0499,0402. 移掉 K 位数字,移掉 K 位数字,https://leetcode.cn/problems/remove-k-digits/,remove-k-digits,栈、贪心、字符串、单调栈,https://algo.itcharge.cn/Solutions/0400-0499/remove-k-digits/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0402.%20%E7%A7%BB%E6%8E%89%20K%20%E4%BD%8D%E6%95%B0%E5%AD%97.md,31.7%,中等,952 -0403,0400-0499,0403. 青蛙过河,青蛙过河,https://leetcode.cn/problems/frog-jump/,frog-jump,数组、动态规划,https://algo.itcharge.cn/Solutions/0400-0499/frog-jump/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0403.%20%E9%9D%92%E8%9B%99%E8%BF%87%E6%B2%B3.md,46.0%,困难,575 -0404,0400-0499,0404. 左叶子之和,左叶子之和,https://leetcode.cn/problems/sum-of-left-leaves/,sum-of-left-leaves,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0400-0499/sum-of-left-leaves/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0404.%20%E5%B7%A6%E5%8F%B6%E5%AD%90%E4%B9%8B%E5%92%8C.md,62.4%,简单,2080 -0405,0400-0499,0405. 数字转换为十六进制数,数字转换为十六进制数,https://leetcode.cn/problems/convert-a-number-to-hexadecimal/,convert-a-number-to-hexadecimal,位运算、数学,https://algo.itcharge.cn/Solutions/0400-0499/convert-a-number-to-hexadecimal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0405.%20%E6%95%B0%E5%AD%97%E8%BD%AC%E6%8D%A2%E4%B8%BA%E5%8D%81%E5%85%AD%E8%BF%9B%E5%88%B6%E6%95%B0.md,54.7%,简单,635 -0406,0400-0499,0406. 根据身高重建队列,根据身高重建队列,https://leetcode.cn/problems/queue-reconstruction-by-height/,queue-reconstruction-by-height,贪心、树状数组、线段树、数组、排序,https://algo.itcharge.cn/Solutions/0400-0499/queue-reconstruction-by-height/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0406.%20%E6%A0%B9%E6%8D%AE%E8%BA%AB%E9%AB%98%E9%87%8D%E5%BB%BA%E9%98%9F%E5%88%97.md,76.3%,中等,1441 -0407,0400-0499,0407. 接雨水 II,接雨水 II,https://leetcode.cn/problems/trapping-rain-water-ii/,trapping-rain-water-ii,广度优先搜索、数组、矩阵、堆（优先队列）,https://algo.itcharge.cn/Solutions/0400-0499/trapping-rain-water-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0407.%20%E6%8E%A5%E9%9B%A8%E6%B0%B4%20II.md,57.6%,困难,307 -0408,0400-0499,0408. 有效单词缩写,有效单词缩写,https://leetcode.cn/problems/valid-word-abbreviation/,valid-word-abbreviation,双指针、字符串,https://algo.itcharge.cn/Solutions/0400-0499/valid-word-abbreviation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0408.%20%E6%9C%89%E6%95%88%E5%8D%95%E8%AF%8D%E7%BC%A9%E5%86%99.md,35.4%,简单,124 -0409,0400-0499,0409. 最长回文串,最长回文串,https://leetcode.cn/problems/longest-palindrome/,longest-palindrome,贪心、哈希表、字符串,https://algo.itcharge.cn/Solutions/0400-0499/longest-palindrome/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0409.%20%E6%9C%80%E9%95%BF%E5%9B%9E%E6%96%87%E4%B8%B2.md,55.8%,简单,2058 -0410,0400-0499,0410. 分割数组的最大值,分割数组的最大值,https://leetcode.cn/problems/split-array-largest-sum/,split-array-largest-sum,贪心、数组、二分查找、动态规划、前缀和,https://algo.itcharge.cn/Solutions/0400-0499/split-array-largest-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0410.%20%E5%88%86%E5%89%B2%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md,59.2%,困难,537 -0411,0400-0499,0411. 最短独占单词缩写,最短独占单词缩写,https://leetcode.cn/problems/minimum-unique-word-abbreviation/,minimum-unique-word-abbreviation,位运算、字符串、回溯,https://algo.itcharge.cn/Solutions/0400-0499/minimum-unique-word-abbreviation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0411.%20%E6%9C%80%E7%9F%AD%E7%8B%AC%E5%8D%A0%E5%8D%95%E8%AF%8D%E7%BC%A9%E5%86%99.md,49.6%,困难,35 -0412,0400-0499,0412. Fizz Buzz,Fizz Buzz,https://leetcode.cn/problems/fizz-buzz/,fizz-buzz,数学、字符串、模拟,https://algo.itcharge.cn/Solutions/0400-0499/fizz-buzz/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0412.%20Fizz%20Buzz.md,68.9%,简单,1255 -0413,0400-0499,0413. 等差数列划分,等差数列划分,https://leetcode.cn/problems/arithmetic-slices/,arithmetic-slices,数组、动态规划,https://algo.itcharge.cn/Solutions/0400-0499/arithmetic-slices/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0413.%20%E7%AD%89%E5%B7%AE%E6%95%B0%E5%88%97%E5%88%92%E5%88%86.md,69.5%,中等,1476 -0414,0400-0499,0414. 第三大的数,第三大的数,https://leetcode.cn/problems/third-maximum-number/,third-maximum-number,数组、排序,https://algo.itcharge.cn/Solutions/0400-0499/third-maximum-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0414.%20%E7%AC%AC%E4%B8%89%E5%A4%A7%E7%9A%84%E6%95%B0.md,39.7%,简单,1688 -0415,0400-0499,0415. 字符串相加,字符串相加,https://leetcode.cn/problems/add-strings/,add-strings,数学、字符串、模拟,https://algo.itcharge.cn/Solutions/0400-0499/add-strings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0415.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E5%8A%A0.md,54.6%,简单,1725 -0416,0400-0499,0416. 分割等和子集,分割等和子集,https://leetcode.cn/problems/partition-equal-subset-sum/,partition-equal-subset-sum,数组、动态规划,https://algo.itcharge.cn/Solutions/0400-0499/partition-equal-subset-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0416.%20%E5%88%86%E5%89%B2%E7%AD%89%E5%92%8C%E5%AD%90%E9%9B%86.md,52.2%,中等,2089 -0417,0400-0499,0417. 太平洋大西洋水流问题,太平洋大西洋水流问题,https://leetcode.cn/problems/pacific-atlantic-water-flow/,pacific-atlantic-water-flow,深度优先搜索、广度优先搜索、数组、矩阵,https://algo.itcharge.cn/Solutions/0400-0499/pacific-atlantic-water-flow/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0417.%20%E5%A4%AA%E5%B9%B3%E6%B4%8B%E5%A4%A7%E8%A5%BF%E6%B4%8B%E6%B0%B4%E6%B5%81%E9%97%AE%E9%A2%98.md,56.2%,中等,845 -0418,0400-0499,0418. 屏幕可显示句子的数量,屏幕可显示句子的数量,https://leetcode.cn/problems/sentence-screen-fitting/,sentence-screen-fitting,字符串、动态规划、模拟,https://algo.itcharge.cn/Solutions/0400-0499/sentence-screen-fitting/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0418.%20%E5%B1%8F%E5%B9%95%E5%8F%AF%E6%98%BE%E7%A4%BA%E5%8F%A5%E5%AD%90%E7%9A%84%E6%95%B0%E9%87%8F.md,39.1%,中等,59 -0419,0400-0499,0419. 甲板上的战舰,甲板上的战舰,https://leetcode.cn/problems/battleships-in-a-board/,battleships-in-a-board,深度优先搜索、数组、矩阵,https://algo.itcharge.cn/Solutions/0400-0499/battleships-in-a-board/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0419.%20%E7%94%B2%E6%9D%BF%E4%B8%8A%E7%9A%84%E6%88%98%E8%88%B0.md,78.0%,中等,563 -0420,0400-0499,0420. 强密码检验器,强密码检验器,https://leetcode.cn/problems/strong-password-checker/,strong-password-checker,贪心、字符串、堆（优先队列）,https://algo.itcharge.cn/Solutions/0400-0499/strong-password-checker/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0420.%20%E5%BC%BA%E5%AF%86%E7%A0%81%E6%A3%80%E9%AA%8C%E5%99%A8.md,39.1%,困难,163 -0421,0400-0499,0421. 数组中两个数的最大异或值,数组中两个数的最大异或值,https://leetcode.cn/problems/maximum-xor-of-two-numbers-in-an-array/,maximum-xor-of-two-numbers-in-an-array,位运算、字典树、数组、哈希表,https://algo.itcharge.cn/Solutions/0400-0499/maximum-xor-of-two-numbers-in-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0421.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%9A%84%E6%9C%80%E5%A4%A7%E5%BC%82%E6%88%96%E5%80%BC.md,61.1%,中等,418 -0422,0400-0499,0422. 有效的单词方块,有效的单词方块,https://leetcode.cn/problems/valid-word-square/,valid-word-square,数组、矩阵,https://algo.itcharge.cn/Solutions/0400-0499/valid-word-square/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0422.%20%E6%9C%89%E6%95%88%E7%9A%84%E5%8D%95%E8%AF%8D%E6%96%B9%E5%9D%97.md,43.4%,简单,96 -0423,0400-0499,0423. 从英文中重建数字,从英文中重建数字,https://leetcode.cn/problems/reconstruct-original-digits-from-english/,reconstruct-original-digits-from-english,哈希表、数学、字符串,https://algo.itcharge.cn/Solutions/0400-0499/reconstruct-original-digits-from-english/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0423.%20%E4%BB%8E%E8%8B%B1%E6%96%87%E4%B8%AD%E9%87%8D%E5%BB%BA%E6%95%B0%E5%AD%97.md,60.8%,中等,456 -0424,0400-0499,0424. 替换后的最长重复字符,替换后的最长重复字符,https://leetcode.cn/problems/longest-repeating-character-replacement/,longest-repeating-character-replacement,哈希表、字符串、滑动窗口,https://algo.itcharge.cn/Solutions/0400-0499/longest-repeating-character-replacement/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0424.%20%E6%9B%BF%E6%8D%A2%E5%90%8E%E7%9A%84%E6%9C%80%E9%95%BF%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6.md,54.6%,中等,746 -0425,0400-0499,0425. 单词方块,单词方块,https://leetcode.cn/problems/word-squares/,word-squares,字典树、数组、字符串、回溯,https://algo.itcharge.cn/Solutions/0400-0499/word-squares/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0425.%20%E5%8D%95%E8%AF%8D%E6%96%B9%E5%9D%97.md,62.8%,困难,48 -0426,0400-0499,0426. 将二叉搜索树转化为排序的双向链表,将二叉搜索树转化为排序的双向链表,https://leetcode.cn/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/,convert-binary-search-tree-to-sorted-doubly-linked-list,栈、树、深度优先搜索、二叉搜索树、链表、二叉树、双向链表,https://algo.itcharge.cn/Solutions/0400-0499/convert-binary-search-tree-to-sorted-doubly-linked-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0426.%20%E5%B0%86%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E8%BD%AC%E5%8C%96%E4%B8%BA%E6%8E%92%E5%BA%8F%E7%9A%84%E5%8F%8C%E5%90%91%E9%93%BE%E8%A1%A8.md,68.1%,中等,192 -0427,0400-0499,0427. 建立四叉树,建立四叉树,https://leetcode.cn/problems/construct-quad-tree/,construct-quad-tree,树、数组、分治、矩阵,https://algo.itcharge.cn/Solutions/0400-0499/construct-quad-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0427.%20%E5%BB%BA%E7%AB%8B%E5%9B%9B%E5%8F%89%E6%A0%91.md,71.2%,中等,337 -0428,0400-0499,0428. 序列化和反序列化 N 叉树,序列化和反序列化 N 叉树,https://leetcode.cn/problems/serialize-and-deserialize-n-ary-tree/,serialize-and-deserialize-n-ary-tree,树、深度优先搜索、广度优先搜索、字符串,https://algo.itcharge.cn/Solutions/0400-0499/serialize-and-deserialize-n-ary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0428.%20%E5%BA%8F%E5%88%97%E5%8C%96%E5%92%8C%E5%8F%8D%E5%BA%8F%E5%88%97%E5%8C%96%20N%20%E5%8F%89%E6%A0%91.md,68.9%,困难,83 -0429,0400-0499,0429. N 叉树的层序遍历,N 叉树的层序遍历,https://leetcode.cn/problems/n-ary-tree-level-order-traversal/,n-ary-tree-level-order-traversal,树、广度优先搜索,https://algo.itcharge.cn/Solutions/0400-0499/n-ary-tree-level-order-traversal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0429.%20N%20%E5%8F%89%E6%A0%91%E7%9A%84%E5%B1%82%E5%BA%8F%E9%81%8D%E5%8E%86.md,72.9%,中等,1174 -0430,0400-0499,0430. 扁平化多级双向链表,扁平化多级双向链表,https://leetcode.cn/problems/flatten-a-multilevel-doubly-linked-list/,flatten-a-multilevel-doubly-linked-list,深度优先搜索、链表、双向链表,https://algo.itcharge.cn/Solutions/0400-0499/flatten-a-multilevel-doubly-linked-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0430.%20%E6%89%81%E5%B9%B3%E5%8C%96%E5%A4%9A%E7%BA%A7%E5%8F%8C%E5%90%91%E9%93%BE%E8%A1%A8.md,59.5%,中等,893 -0431,0400-0499,0431. 将 N 叉树编码为二叉树,将 N 叉树编码为二叉树,https://leetcode.cn/problems/encode-n-ary-tree-to-binary-tree/,encode-n-ary-tree-to-binary-tree,树、深度优先搜索、广度优先搜索、设计、二叉树,https://algo.itcharge.cn/Solutions/0400-0499/encode-n-ary-tree-to-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0431.%20%E5%B0%86%20N%20%E5%8F%89%E6%A0%91%E7%BC%96%E7%A0%81%E4%B8%BA%E4%BA%8C%E5%8F%89%E6%A0%91.md,75.1%,困难,47 -0432,0400-0499,0432. 全 O(1) 的数据结构,全 O(1) 的数据结构,https://leetcode.cn/problems/all-oone-data-structure/,all-oone-data-structure,设计、哈希表、链表、双向链表,https://algo.itcharge.cn/Solutions/0400-0499/all-oone-data-structure/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0432.%20%E5%85%A8%20O%281%29%20%E7%9A%84%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84.md,46.9%,困难,308 -0433,0400-0499,0433. 最小基因变化,最小基因变化,https://leetcode.cn/problems/minimum-genetic-mutation/,minimum-genetic-mutation,广度优先搜索、哈希表、字符串,https://algo.itcharge.cn/Solutions/0400-0499/minimum-genetic-mutation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0433.%20%E6%9C%80%E5%B0%8F%E5%9F%BA%E5%9B%A0%E5%8F%98%E5%8C%96.md,54.8%,中等,739 -0434,0400-0499,0434. 字符串中的单词数,字符串中的单词数,https://leetcode.cn/problems/number-of-segments-in-a-string/,number-of-segments-in-a-string,字符串,https://algo.itcharge.cn/Solutions/0400-0499/number-of-segments-in-a-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0434.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%8D%95%E8%AF%8D%E6%95%B0.md,38.6%,简单,1151 -0435,0400-0499,0435. 无重叠区间,无重叠区间,https://leetcode.cn/problems/non-overlapping-intervals/,non-overlapping-intervals,贪心、数组、动态规划、排序,https://algo.itcharge.cn/Solutions/0400-0499/non-overlapping-intervals/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0435.%20%E6%97%A0%E9%87%8D%E5%8F%A0%E5%8C%BA%E9%97%B4.md,51.2%,中等,1644 -0436,0400-0499,0436. 寻找右区间,寻找右区间,https://leetcode.cn/problems/find-right-interval/,find-right-interval,数组、二分查找、排序,https://algo.itcharge.cn/Solutions/0400-0499/find-right-interval/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0436.%20%E5%AF%BB%E6%89%BE%E5%8F%B3%E5%8C%BA%E9%97%B4.md,56.8%,中等,574 -0437,0400-0499,0437. 路径总和 III,路径总和 III,https://leetcode.cn/problems/path-sum-iii/,path-sum-iii,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0400-0499/path-sum-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0437.%20%E8%B7%AF%E5%BE%84%E6%80%BB%E5%92%8C%20III.md,50.2%,中等,1526 -0438,0400-0499,0438. 找到字符串中所有字母异位词,找到字符串中所有字母异位词,https://leetcode.cn/problems/find-all-anagrams-in-a-string/,find-all-anagrams-in-a-string,哈希表、字符串、滑动窗口,https://algo.itcharge.cn/Solutions/0400-0499/find-all-anagrams-in-a-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0438.%20%E6%89%BE%E5%88%B0%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E6%89%80%E6%9C%89%E5%AD%97%E6%AF%8D%E5%BC%82%E4%BD%8D%E8%AF%8D.md,54.7%,中等,2161 -0439,0400-0499,0439. 三元表达式解析器,三元表达式解析器,https://leetcode.cn/problems/ternary-expression-parser/,ternary-expression-parser,栈、递归、字符串,https://algo.itcharge.cn/Solutions/0400-0499/ternary-expression-parser/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0439.%20%E4%B8%89%E5%85%83%E8%A1%A8%E8%BE%BE%E5%BC%8F%E8%A7%A3%E6%9E%90%E5%99%A8.md,60.6%,中等,104 -0440,0400-0499,0440. 字典序的第K小数字,字典序的第K小数字,https://leetcode.cn/problems/k-th-smallest-in-lexicographical-order/,k-th-smallest-in-lexicographical-order,字典树,https://algo.itcharge.cn/Solutions/0400-0499/k-th-smallest-in-lexicographical-order/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0440.%20%E5%AD%97%E5%85%B8%E5%BA%8F%E7%9A%84%E7%AC%ACK%E5%B0%8F%E6%95%B0%E5%AD%97.md,42.6%,困难,308 -0441,0400-0499,0441. 排列硬币,排列硬币,https://leetcode.cn/problems/arranging-coins/,arranging-coins,数学、二分查找,https://algo.itcharge.cn/Solutions/0400-0499/arranging-coins/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0441.%20%E6%8E%92%E5%88%97%E7%A1%AC%E5%B8%81.md,45.2%,简单,1122 -0442,0400-0499,0442. 数组中重复的数据,数组中重复的数据,https://leetcode.cn/problems/find-all-duplicates-in-an-array/,find-all-duplicates-in-an-array,数组、哈希表,https://algo.itcharge.cn/Solutions/0400-0499/find-all-duplicates-in-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0442.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E9%87%8D%E5%A4%8D%E7%9A%84%E6%95%B0%E6%8D%AE.md,75.1%,中等,1021 -0443,0400-0499,0443. 压缩字符串,压缩字符串,https://leetcode.cn/problems/string-compression/,string-compression,双指针、字符串,https://algo.itcharge.cn/Solutions/0400-0499/string-compression/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0443.%20%E5%8E%8B%E7%BC%A9%E5%AD%97%E7%AC%A6%E4%B8%B2.md,47.9%,中等,898 -0444,0400-0499,0444. 序列重建,序列重建,https://leetcode.cn/problems/sequence-reconstruction/,sequence-reconstruction,图、拓扑排序、数组,https://algo.itcharge.cn/Solutions/0400-0499/sequence-reconstruction/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0444.%20%E5%BA%8F%E5%88%97%E9%87%8D%E5%BB%BA.md,31.4%,中等,86 -0445,0400-0499,0445. 两数相加 II,两数相加 II,https://leetcode.cn/problems/add-two-numbers-ii/,add-two-numbers-ii,栈、链表、数学,https://algo.itcharge.cn/Solutions/0400-0499/add-two-numbers-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0445.%20%E4%B8%A4%E6%95%B0%E7%9B%B8%E5%8A%A0%20II.md,60.2%,中等,1299 -0446,0400-0499,0446. 等差数列划分 II - 子序列,等差数列划分 II - 子序列,https://leetcode.cn/problems/arithmetic-slices-ii-subsequence/,arithmetic-slices-ii-subsequence,数组、动态规划,https://algo.itcharge.cn/Solutions/0400-0499/arithmetic-slices-ii-subsequence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0446.%20%E7%AD%89%E5%B7%AE%E6%95%B0%E5%88%97%E5%88%92%E5%88%86%20II%20-%20%E5%AD%90%E5%BA%8F%E5%88%97.md,54.7%,困难,206 -0447,0400-0499,0447. 回旋镖的数量,回旋镖的数量,https://leetcode.cn/problems/number-of-boomerangs/,number-of-boomerangs,数组、哈希表、数学,https://algo.itcharge.cn/Solutions/0400-0499/number-of-boomerangs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0447.%20%E5%9B%9E%E6%97%8B%E9%95%96%E7%9A%84%E6%95%B0%E9%87%8F.md,66.7%,中等,434 -0448,0400-0499,0448. 找到所有数组中消失的数字,找到所有数组中消失的数字,https://leetcode.cn/problems/find-all-numbers-disappeared-in-an-array/,find-all-numbers-disappeared-in-an-array,数组、哈希表,https://algo.itcharge.cn/Solutions/0400-0499/find-all-numbers-disappeared-in-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0448.%20%E6%89%BE%E5%88%B0%E6%89%80%E6%9C%89%E6%95%B0%E7%BB%84%E4%B8%AD%E6%B6%88%E5%A4%B1%E7%9A%84%E6%95%B0%E5%AD%97.md,65.9%,简单,1940 -0449,0400-0499,0449. 序列化和反序列化二叉搜索树,序列化和反序列化二叉搜索树,https://leetcode.cn/problems/serialize-and-deserialize-bst/,serialize-and-deserialize-bst,树、深度优先搜索、广度优先搜索、设计、二叉搜索树、字符串、二叉树,https://algo.itcharge.cn/Solutions/0400-0499/serialize-and-deserialize-bst/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0449.%20%E5%BA%8F%E5%88%97%E5%8C%96%E5%92%8C%E5%8F%8D%E5%BA%8F%E5%88%97%E5%8C%96%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md,60.5%,中等,433 -0450,0400-0499,0450. 删除二叉搜索树中的节点,删除二叉搜索树中的节点,https://leetcode.cn/problems/delete-node-in-a-bst/,delete-node-in-a-bst,树、二叉搜索树、二叉树,https://algo.itcharge.cn/Solutions/0400-0499/delete-node-in-a-bst/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0450.%20%E5%88%A0%E9%99%A4%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E8%8A%82%E7%82%B9.md,52.4%,中等,1968 -0451,0400-0499,0451. 根据字符出现频率排序,根据字符出现频率排序,https://leetcode.cn/problems/sort-characters-by-frequency/,sort-characters-by-frequency,哈希表、字符串、桶排序、计数、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/0400-0499/sort-characters-by-frequency/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0451.%20%E6%A0%B9%E6%8D%AE%E5%AD%97%E7%AC%A6%E5%87%BA%E7%8E%B0%E9%A2%91%E7%8E%87%E6%8E%92%E5%BA%8F.md,72.0%,中等,1339 -0452,0400-0499,0452. 用最少数量的箭引爆气球,用最少数量的箭引爆气球,https://leetcode.cn/problems/minimum-number-of-arrows-to-burst-balloons/,minimum-number-of-arrows-to-burst-balloons,贪心、数组、排序,https://algo.itcharge.cn/Solutions/0400-0499/minimum-number-of-arrows-to-burst-balloons/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0452.%20%E7%94%A8%E6%9C%80%E5%B0%91%E6%95%B0%E9%87%8F%E7%9A%84%E7%AE%AD%E5%BC%95%E7%88%86%E6%B0%94%E7%90%83.md,50.7%,中等,1523 -0453,0400-0499,0453. 最小操作次数使数组元素相等,最小操作次数使数组元素相等,https://leetcode.cn/problems/minimum-moves-to-equal-array-elements/,minimum-moves-to-equal-array-elements,数组、数学,https://algo.itcharge.cn/Solutions/0400-0499/minimum-moves-to-equal-array-elements/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0453.%20%E6%9C%80%E5%B0%8F%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0%E4%BD%BF%E6%95%B0%E7%BB%84%E5%85%83%E7%B4%A0%E7%9B%B8%E7%AD%89.md,61.4%,中等,865 -0454,0400-0499,0454. 四数相加 II,四数相加 II,https://leetcode.cn/problems/4sum-ii/,4sum-ii,数组、哈希表,https://algo.itcharge.cn/Solutions/0400-0499/4sum-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0454.%20%E5%9B%9B%E6%95%B0%E7%9B%B8%E5%8A%A0%20II.md,64.2%,中等,1203 -0455,0400-0499,0455. 分发饼干,分发饼干,https://leetcode.cn/problems/assign-cookies/,assign-cookies,贪心、数组、双指针、排序,https://algo.itcharge.cn/Solutions/0400-0499/assign-cookies/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0455.%20%E5%88%86%E5%8F%91%E9%A5%BC%E5%B9%B2.md,56.4%,简单,2305 -0456,0400-0499,0456. 132 模式,132 模式,https://leetcode.cn/problems/132-pattern/,132-pattern,栈、数组、二分查找、有序集合、单调栈,https://algo.itcharge.cn/Solutions/0400-0499/132-pattern/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0456.%20132%20%E6%A8%A1%E5%BC%8F.md,36.4%,中等,614 -0457,0400-0499,0457. 环形数组是否存在循环,环形数组是否存在循环,https://leetcode.cn/problems/circular-array-loop/,circular-array-loop,数组、哈希表、双指针,https://algo.itcharge.cn/Solutions/0400-0499/circular-array-loop/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0457.%20%E7%8E%AF%E5%BD%A2%E6%95%B0%E7%BB%84%E6%98%AF%E5%90%A6%E5%AD%98%E5%9C%A8%E5%BE%AA%E7%8E%AF.md,43.4%,中等,374 -0458,0400-0499,0458. 可怜的小猪,可怜的小猪,https://leetcode.cn/problems/poor-pigs/,poor-pigs,数学、动态规划、组合数学,https://algo.itcharge.cn/Solutions/0400-0499/poor-pigs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0458.%20%E5%8F%AF%E6%80%9C%E7%9A%84%E5%B0%8F%E7%8C%AA.md,67.7%,困难,244 -0459,0400-0499,0459. 重复的子字符串,重复的子字符串,https://leetcode.cn/problems/repeated-substring-pattern/,repeated-substring-pattern,字符串、字符串匹配,https://algo.itcharge.cn/Solutions/0400-0499/repeated-substring-pattern/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0459.%20%E9%87%8D%E5%A4%8D%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md,51.2%,简单,1307 -0460,0400-0499,0460. LFU 缓存,LFU 缓存,https://leetcode.cn/problems/lfu-cache/,lfu-cache,设计、哈希表、链表、双向链表,https://algo.itcharge.cn/Solutions/0400-0499/lfu-cache/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0460.%20LFU%20%E7%BC%93%E5%AD%98.md,44.8%,困难,646 -0461,0400-0499,0461. 汉明距离,汉明距离,https://leetcode.cn/problems/hamming-distance/,hamming-distance,位运算,https://algo.itcharge.cn/Solutions/0400-0499/hamming-distance/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0461.%20%E6%B1%89%E6%98%8E%E8%B7%9D%E7%A6%BB.md,81.9%,简单,2077 -0462,0400-0499,0462. 最小操作次数使数组元素相等 II,最小操作次数使数组元素相等 II,https://leetcode.cn/problems/minimum-moves-to-equal-array-elements-ii/,minimum-moves-to-equal-array-elements-ii,数组、数学、排序,https://algo.itcharge.cn/Solutions/0400-0499/minimum-moves-to-equal-array-elements-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0462.%20%E6%9C%80%E5%B0%8F%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0%E4%BD%BF%E6%95%B0%E7%BB%84%E5%85%83%E7%B4%A0%E7%9B%B8%E7%AD%89%20II.md,62.4%,中等,526 -0463,0400-0499,0463. 岛屿的周长,岛屿的周长,https://leetcode.cn/problems/island-perimeter/,island-perimeter,深度优先搜索、广度优先搜索、数组、矩阵,https://algo.itcharge.cn/Solutions/0400-0499/island-perimeter/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0463.%20%E5%B2%9B%E5%B1%BF%E7%9A%84%E5%91%A8%E9%95%BF.md,70.0%,简单,1436 -0464,0400-0499,0464. 我能赢吗,我能赢吗,https://leetcode.cn/problems/can-i-win/,can-i-win,位运算、记忆化搜索、数学、动态规划、状态压缩、博弈,https://algo.itcharge.cn/Solutions/0400-0499/can-i-win/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0464.%20%E6%88%91%E8%83%BD%E8%B5%A2%E5%90%97.md,41.2%,中等,289 -0465,0400-0499,0465. 最优账单平衡,最优账单平衡,https://leetcode.cn/problems/optimal-account-balancing/,optimal-account-balancing,位运算、数组、动态规划、回溯、状态压缩,https://algo.itcharge.cn/Solutions/0400-0499/optimal-account-balancing/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0465.%20%E6%9C%80%E4%BC%98%E8%B4%A6%E5%8D%95%E5%B9%B3%E8%A1%A1.md,54.5%,困难,42 -0466,0400-0499,0466. 统计重复个数,统计重复个数,https://leetcode.cn/problems/count-the-repetitions/,count-the-repetitions,字符串、动态规划,https://algo.itcharge.cn/Solutions/0400-0499/count-the-repetitions/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0466.%20%E7%BB%9F%E8%AE%A1%E9%87%8D%E5%A4%8D%E4%B8%AA%E6%95%B0.md,37.6%,困难,204 -0467,0400-0499,0467. 环绕字符串中唯一的子字符串,环绕字符串中唯一的子字符串,https://leetcode.cn/problems/unique-substrings-in-wraparound-string/,unique-substrings-in-wraparound-string,字符串、动态规划,https://algo.itcharge.cn/Solutions/0400-0499/unique-substrings-in-wraparound-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0467.%20%E7%8E%AF%E7%BB%95%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E5%94%AF%E4%B8%80%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md,51.7%,中等,371 -0468,0400-0499,0468. 验证IP地址,验证IP地址,https://leetcode.cn/problems/validate-ip-address/,validate-ip-address,字符串,https://algo.itcharge.cn/Solutions/0400-0499/validate-ip-address/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0468.%20%E9%AA%8C%E8%AF%81IP%E5%9C%B0%E5%9D%80.md,28.1%,中等,716 -0469,0400-0499,0469. 凸多边形,凸多边形,https://leetcode.cn/problems/convex-polygon/,convex-polygon,几何、数学,https://algo.itcharge.cn/Solutions/0400-0499/convex-polygon/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0469.%20%E5%87%B8%E5%A4%9A%E8%BE%B9%E5%BD%A2.md,42.9%,中等,36 -0470,0400-0499,0470. 用 Rand7() 实现 Rand10(),用 Rand7() 实现 Rand10(),https://leetcode.cn/problems/implement-rand10-using-rand7/,implement-rand10-using-rand7,数学、拒绝采样、概率与统计、随机化,https://algo.itcharge.cn/Solutions/0400-0499/implement-rand10-using-rand7/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0470.%20%E7%94%A8%20Rand7%28%29%20%E5%AE%9E%E7%8E%B0%20Rand10%28%29.md,55.2%,中等,465 -0471,0400-0499,0471. 编码最短长度的字符串,编码最短长度的字符串,https://leetcode.cn/problems/encode-string-with-shortest-length/,encode-string-with-shortest-length,字符串、动态规划,https://algo.itcharge.cn/Solutions/0400-0499/encode-string-with-shortest-length/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0471.%20%E7%BC%96%E7%A0%81%E6%9C%80%E7%9F%AD%E9%95%BF%E5%BA%A6%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2.md,59.6%,困难,43 -0472,0400-0499,0472. 连接词,连接词,https://leetcode.cn/problems/concatenated-words/,concatenated-words,深度优先搜索、字典树、数组、字符串、动态规划,https://algo.itcharge.cn/Solutions/0400-0499/concatenated-words/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0472.%20%E8%BF%9E%E6%8E%A5%E8%AF%8D.md,52.0%,困难,266 -0473,0400-0499,0473. 火柴拼正方形,火柴拼正方形,https://leetcode.cn/problems/matchsticks-to-square/,matchsticks-to-square,位运算、数组、动态规划、回溯、状态压缩,https://algo.itcharge.cn/Solutions/0400-0499/matchsticks-to-square/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0473.%20%E7%81%AB%E6%9F%B4%E6%8B%BC%E6%AD%A3%E6%96%B9%E5%BD%A2.md,46.7%,中等,531 -0474,0400-0499,0474. 一和零,一和零,https://leetcode.cn/problems/ones-and-zeroes/,ones-and-zeroes,数组、字符串、动态规划,https://algo.itcharge.cn/Solutions/0400-0499/ones-and-zeroes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0474.%20%E4%B8%80%E5%92%8C%E9%9B%B6.md,65.2%,中等,1075 -0475,0400-0499,0475. 供暖器,供暖器,https://leetcode.cn/problems/heaters/,heaters,数组、双指针、二分查找、排序,https://algo.itcharge.cn/Solutions/0400-0499/heaters/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0475.%20%E4%BE%9B%E6%9A%96%E5%99%A8.md,41.0%,中等,706 -0476,0400-0499,0476. 数字的补数,数字的补数,https://leetcode.cn/problems/number-complement/,number-complement,位运算,https://algo.itcharge.cn/Solutions/0400-0499/number-complement/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0476.%20%E6%95%B0%E5%AD%97%E7%9A%84%E8%A1%A5%E6%95%B0.md,69.6%,简单,1094 -0477,0400-0499,0477. 汉明距离总和,汉明距离总和,https://leetcode.cn/problems/total-hamming-distance/,total-hamming-distance,位运算、数组、数学,https://algo.itcharge.cn/Solutions/0400-0499/total-hamming-distance/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0477.%20%E6%B1%89%E6%98%8E%E8%B7%9D%E7%A6%BB%E6%80%BB%E5%92%8C.md,60.6%,中等,388 -0478,0400-0499,0478. 在圆内随机生成点,在圆内随机生成点,https://leetcode.cn/problems/generate-random-point-in-a-circle/,generate-random-point-in-a-circle,几何、数学、拒绝采样、随机化,https://algo.itcharge.cn/Solutions/0400-0499/generate-random-point-in-a-circle/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0478.%20%E5%9C%A8%E5%9C%86%E5%86%85%E9%9A%8F%E6%9C%BA%E7%94%9F%E6%88%90%E7%82%B9.md,48.3%,中等,188 -0479,0400-0499,0479. 最大回文数乘积,最大回文数乘积,https://leetcode.cn/problems/largest-palindrome-product/,largest-palindrome-product,数学,https://algo.itcharge.cn/Solutions/0400-0499/largest-palindrome-product/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0479.%20%E6%9C%80%E5%A4%A7%E5%9B%9E%E6%96%87%E6%95%B0%E4%B9%98%E7%A7%AF.md,62.5%,困难,174 -0480,0400-0499,0480. 滑动窗口中位数,滑动窗口中位数,https://leetcode.cn/problems/sliding-window-median/,sliding-window-median,数组、哈希表、滑动窗口、堆（优先队列）,https://algo.itcharge.cn/Solutions/0400-0499/sliding-window-median/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0480.%20%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E4%B8%AD%E4%BD%8D%E6%95%B0.md,44.1%,困难,520 -0481,0400-0499,0481. 神奇字符串,神奇字符串,https://leetcode.cn/problems/magical-string/,magical-string,双指针、字符串,https://algo.itcharge.cn/Solutions/0400-0499/magical-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0481.%20%E7%A5%9E%E5%A5%87%E5%AD%97%E7%AC%A6%E4%B8%B2.md,64.2%,中等,470 -0482,0400-0499,0482. 密钥格式化,密钥格式化,https://leetcode.cn/problems/license-key-formatting/,license-key-formatting,字符串,https://algo.itcharge.cn/Solutions/0400-0499/license-key-formatting/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0482.%20%E5%AF%86%E9%92%A5%E6%A0%BC%E5%BC%8F%E5%8C%96.md,46.7%,简单,596 -0483,0400-0499,0483. 最小好进制,最小好进制,https://leetcode.cn/problems/smallest-good-base/,smallest-good-base,数学、二分查找,https://algo.itcharge.cn/Solutions/0400-0499/smallest-good-base/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0483.%20%E6%9C%80%E5%B0%8F%E5%A5%BD%E8%BF%9B%E5%88%B6.md,59.1%,困难,147 -0484,0400-0499,0484. 寻找排列,寻找排列,https://leetcode.cn/problems/find-permutation/,find-permutation,栈、贪心、数组、字符串,https://algo.itcharge.cn/Solutions/0400-0499/find-permutation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0484.%20%E5%AF%BB%E6%89%BE%E6%8E%92%E5%88%97.md,59.7%,中等,58 -0485,0400-0499,0485. 最大连续 1 的个数,最大连续 1 的个数,https://leetcode.cn/problems/max-consecutive-ones/,max-consecutive-ones,数组,https://algo.itcharge.cn/Solutions/0400-0499/max-consecutive-ones/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0485.%20%E6%9C%80%E5%A4%A7%E8%BF%9E%E7%BB%AD%201%20%E7%9A%84%E4%B8%AA%E6%95%B0.md,61.1%,简单,1615 -0486,0400-0499,0486. 预测赢家,预测赢家,https://leetcode.cn/problems/predict-the-winner/,predict-the-winner,递归、数组、数学、动态规划、博弈,https://algo.itcharge.cn/Solutions/0400-0499/predict-the-winner/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0486.%20%E9%A2%84%E6%B5%8B%E8%B5%A2%E5%AE%B6.md,59.5%,中等,562 -0487,0400-0499,0487. 最大连续1的个数 II,最大连续1的个数 II,https://leetcode.cn/problems/max-consecutive-ones-ii/,max-consecutive-ones-ii,数组、动态规划、滑动窗口,https://algo.itcharge.cn/Solutions/0400-0499/max-consecutive-ones-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0487.%20%E6%9C%80%E5%A4%A7%E8%BF%9E%E7%BB%AD1%E7%9A%84%E4%B8%AA%E6%95%B0%20II.md,57.6%,中等,231 -0488,0400-0499,0488. 祖玛游戏,祖玛游戏,https://leetcode.cn/problems/zuma-game/,zuma-game,栈、广度优先搜索、记忆化搜索、字符串、动态规划,https://algo.itcharge.cn/Solutions/0400-0499/zuma-game/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0488.%20%E7%A5%96%E7%8E%9B%E6%B8%B8%E6%88%8F.md,48.6%,困难,188 -0489,0400-0499,0489. 扫地机器人,扫地机器人,https://leetcode.cn/problems/robot-room-cleaner/,robot-room-cleaner,回溯、交互,https://algo.itcharge.cn/Solutions/0400-0499/robot-room-cleaner/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0489.%20%E6%89%AB%E5%9C%B0%E6%9C%BA%E5%99%A8%E4%BA%BA.md,74.8%,困难,37 -0490,0400-0499,0490. 迷宫,迷宫,https://leetcode.cn/problems/the-maze/,the-maze,深度优先搜索、广度优先搜索、图,https://algo.itcharge.cn/Solutions/0400-0499/the-maze/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0490.%20%E8%BF%B7%E5%AE%AB.md,50.2%,中等,139 -0491,0400-0499,0491. 递增子序列,递增子序列,https://leetcode.cn/problems/non-decreasing-subsequences/,non-decreasing-subsequences,位运算、数组、哈希表、回溯,https://algo.itcharge.cn/Solutions/0400-0499/non-decreasing-subsequences/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0491.%20%E9%80%92%E5%A2%9E%E5%AD%90%E5%BA%8F%E5%88%97.md,52.0%,中等,900 -0492,0400-0499,0492. 构造矩形,构造矩形,https://leetcode.cn/problems/construct-the-rectangle/,construct-the-rectangle,数学,https://algo.itcharge.cn/Solutions/0400-0499/construct-the-rectangle/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0492.%20%E6%9E%84%E9%80%A0%E7%9F%A9%E5%BD%A2.md,61.2%,简单,535 -0493,0400-0499,0493. 翻转对,翻转对,https://leetcode.cn/problems/reverse-pairs/,reverse-pairs,树状数组、线段树、数组、二分查找、分治、有序集合、归并排序,https://algo.itcharge.cn/Solutions/0400-0499/reverse-pairs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0493.%20%E7%BF%BB%E8%BD%AC%E5%AF%B9.md,36.5%,困难,401 -0494,0400-0499,0494. 目标和,目标和,https://leetcode.cn/problems/target-sum/,target-sum,数组、动态规划、回溯,https://algo.itcharge.cn/Solutions/0400-0499/target-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0494.%20%E7%9B%AE%E6%A0%87%E5%92%8C.md,48.7%,中等,1985 -0495,0400-0499,0495. 提莫攻击,提莫攻击,https://leetcode.cn/problems/teemo-attacking/,teemo-attacking,数组、模拟,https://algo.itcharge.cn/Solutions/0400-0499/teemo-attacking/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0495.%20%E6%8F%90%E8%8E%AB%E6%94%BB%E5%87%BB.md,59.4%,简单,1275 -0496,0400-0499,0496. 下一个更大元素 I,下一个更大元素 I,https://leetcode.cn/problems/next-greater-element-i/,next-greater-element-i,栈、数组、哈希表、单调栈,https://algo.itcharge.cn/Solutions/0400-0499/next-greater-element-i/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0496.%20%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%9B%B4%E5%A4%A7%E5%85%83%E7%B4%A0%20I.md,71.8%,简单,2391 -0497,0400-0499,0497. 非重叠矩形中的随机点,非重叠矩形中的随机点,https://leetcode.cn/problems/random-point-in-non-overlapping-rectangles/,random-point-in-non-overlapping-rectangles,水塘抽样、数组、数学、二分查找、有序集合、前缀和、随机化,https://algo.itcharge.cn/Solutions/0400-0499/random-point-in-non-overlapping-rectangles/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0497.%20%E9%9D%9E%E9%87%8D%E5%8F%A0%E7%9F%A9%E5%BD%A2%E4%B8%AD%E7%9A%84%E9%9A%8F%E6%9C%BA%E7%82%B9.md,41.9%,中等,214 -0498,0400-0499,0498. 对角线遍历,对角线遍历,https://leetcode.cn/problems/diagonal-traverse/,diagonal-traverse,数组、矩阵、模拟,https://algo.itcharge.cn/Solutions/0400-0499/diagonal-traverse/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0498.%20%E5%AF%B9%E8%A7%92%E7%BA%BF%E9%81%8D%E5%8E%86.md,55.9%,中等,1121 -0499,0400-0499,0499. 迷宫 III,迷宫 III,https://leetcode.cn/problems/the-maze-iii/,the-maze-iii,深度优先搜索、广度优先搜索、图、最短路、堆（优先队列）,https://algo.itcharge.cn/Solutions/0400-0499/the-maze-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0499.%20%E8%BF%B7%E5%AE%AB%20III.md,43.0%,困难,89 -0500,0500-0599,0500. 键盘行,键盘行,https://leetcode.cn/problems/keyboard-row/,keyboard-row,数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/0500-0599/keyboard-row/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0500.%20%E9%94%AE%E7%9B%98%E8%A1%8C.md,74.0%,简单,1033 -0501,0500-0599,0501. 二叉搜索树中的众数,二叉搜索树中的众数,https://leetcode.cn/problems/find-mode-in-binary-search-tree/,find-mode-in-binary-search-tree,树、深度优先搜索、二叉搜索树、二叉树,https://algo.itcharge.cn/Solutions/0500-0599/find-mode-in-binary-search-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0501.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E4%BC%97%E6%95%B0.md,54.7%,简单,1099 -0502,0500-0599,0502. IPO,IPO,https://leetcode.cn/problems/ipo/,ipo,贪心、数组、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/0500-0599/ipo/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0502.%20IPO.md,44.9%,困难,428 -0503,0500-0599,0503. 下一个更大元素 II,下一个更大元素 II,https://leetcode.cn/problems/next-greater-element-ii/,next-greater-element-ii,栈、数组、单调栈,https://algo.itcharge.cn/Solutions/0500-0599/next-greater-element-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0503.%20%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%9B%B4%E5%A4%A7%E5%85%83%E7%B4%A0%20II.md,66.8%,中等,1613 -0504,0500-0599,0504. 七进制数,七进制数,https://leetcode.cn/problems/base-7/,base-7,数学,https://algo.itcharge.cn/Solutions/0500-0599/base-7/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0504.%20%E4%B8%83%E8%BF%9B%E5%88%B6%E6%95%B0.md,51.8%,简单,841 -0505,0500-0599,0505. 迷宫 II,迷宫 II,https://leetcode.cn/problems/the-maze-ii/,the-maze-ii,深度优先搜索、广度优先搜索、图、最短路、堆（优先队列）,https://algo.itcharge.cn/Solutions/0500-0599/the-maze-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0505.%20%E8%BF%B7%E5%AE%AB%20II.md,51.6%,中等,115 -0506,0500-0599,0506. 相对名次,相对名次,https://leetcode.cn/problems/relative-ranks/,relative-ranks,数组、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/0500-0599/relative-ranks/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0506.%20%E7%9B%B8%E5%AF%B9%E5%90%8D%E6%AC%A1.md,65.0%,简单,979 -0507,0500-0599,0507. 完美数,完美数,https://leetcode.cn/problems/perfect-number/,perfect-number,数学,https://algo.itcharge.cn/Solutions/0500-0599/perfect-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0507.%20%E5%AE%8C%E7%BE%8E%E6%95%B0.md,49.1%,简单,570 -0508,0500-0599,0508. 出现次数最多的子树元素和,出现次数最多的子树元素和,https://leetcode.cn/problems/most-frequent-subtree-sum/,most-frequent-subtree-sum,树、深度优先搜索、哈希表、二叉树,https://algo.itcharge.cn/Solutions/0500-0599/most-frequent-subtree-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0508.%20%E5%87%BA%E7%8E%B0%E6%AC%A1%E6%95%B0%E6%9C%80%E5%A4%9A%E7%9A%84%E5%AD%90%E6%A0%91%E5%85%83%E7%B4%A0%E5%92%8C.md,75.5%,中等,567 -0509,0500-0599,0509. 斐波那契数,斐波那契数,https://leetcode.cn/problems/fibonacci-number/,fibonacci-number,递归、记忆化搜索、数学、动态规划,https://algo.itcharge.cn/Solutions/0500-0599/fibonacci-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0509.%20%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0.md,66.2%,简单,3152 -0510,0500-0599,0510. 二叉搜索树中的中序后继 II,二叉搜索树中的中序后继 II,https://leetcode.cn/problems/inorder-successor-in-bst-ii/,inorder-successor-in-bst-ii,树、二叉搜索树、二叉树,https://algo.itcharge.cn/Solutions/0500-0599/inorder-successor-in-bst-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0510.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E4%B8%AD%E5%BA%8F%E5%90%8E%E7%BB%A7%20II.md,60.4%,中等,74 -0511,0500-0599,0511. 游戏玩法分析 I,游戏玩法分析 I,https://leetcode.cn/problems/game-play-analysis-i/,game-play-analysis-i,数据库,https://algo.itcharge.cn/Solutions/0500-0599/game-play-analysis-i/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0511.%20%E6%B8%B8%E6%88%8F%E7%8E%A9%E6%B3%95%E5%88%86%E6%9E%90%20I.md,70.7%,简单,378 -0512,0500-0599,0512. 游戏玩法分析 II,游戏玩法分析 II,https://leetcode.cn/problems/game-play-analysis-ii/,game-play-analysis-ii,数据库,https://algo.itcharge.cn/Solutions/0500-0599/game-play-analysis-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0512.%20%E6%B8%B8%E6%88%8F%E7%8E%A9%E6%B3%95%E5%88%86%E6%9E%90%20II.md,54.2%,简单,229 -0513,0500-0599,0513. 找树左下角的值,找树左下角的值,https://leetcode.cn/problems/find-bottom-left-tree-value/,find-bottom-left-tree-value,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0500-0599/find-bottom-left-tree-value/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0513.%20%E6%89%BE%E6%A0%91%E5%B7%A6%E4%B8%8B%E8%A7%92%E7%9A%84%E5%80%BC.md,73.5%,中等,1542 -0514,0500-0599,0514. 自由之路,自由之路,https://leetcode.cn/problems/freedom-trail/,freedom-trail,深度优先搜索、广度优先搜索、字符串、动态规划,https://algo.itcharge.cn/Solutions/0500-0599/freedom-trail/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0514.%20%E8%87%AA%E7%94%B1%E4%B9%8B%E8%B7%AF.md,51.5%,困难,350 -0515,0500-0599,0515. 在每个树行中找最大值,在每个树行中找最大值,https://leetcode.cn/problems/find-largest-value-in-each-tree-row/,find-largest-value-in-each-tree-row,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0500-0599/find-largest-value-in-each-tree-row/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0515.%20%E5%9C%A8%E6%AF%8F%E4%B8%AA%E6%A0%91%E8%A1%8C%E4%B8%AD%E6%89%BE%E6%9C%80%E5%A4%A7%E5%80%BC.md,66.4%,中等,1115 -0516,0500-0599,0516. 最长回文子序列,最长回文子序列,https://leetcode.cn/problems/longest-palindromic-subsequence/,longest-palindromic-subsequence,字符串、动态规划,https://algo.itcharge.cn/Solutions/0500-0599/longest-palindromic-subsequence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0516.%20%E6%9C%80%E9%95%BF%E5%9B%9E%E6%96%87%E5%AD%90%E5%BA%8F%E5%88%97.md,67.2%,中等,1118 -0517,0500-0599,0517. 超级洗衣机,超级洗衣机,https://leetcode.cn/problems/super-washing-machines/,super-washing-machines,贪心、数组,https://algo.itcharge.cn/Solutions/0500-0599/super-washing-machines/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0517.%20%E8%B6%85%E7%BA%A7%E6%B4%97%E8%A1%A3%E6%9C%BA.md,51.1%,困难,187 -0518,0500-0599,0518. 零钱兑换 II,零钱兑换 II,https://leetcode.cn/problems/coin-change-ii/,coin-change-ii,数组、动态规划,https://algo.itcharge.cn/Solutions/0500-0599/coin-change-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0518.%20%E9%9B%B6%E9%92%B1%E5%85%91%E6%8D%A2%20II.md,70.5%,中等,1279 -0519,0500-0599,0519. 随机翻转矩阵,随机翻转矩阵,https://leetcode.cn/problems/random-flip-matrix/,random-flip-matrix,水塘抽样、哈希表、数学、随机化,https://algo.itcharge.cn/Solutions/0500-0599/random-flip-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0519.%20%E9%9A%8F%E6%9C%BA%E7%BF%BB%E8%BD%AC%E7%9F%A9%E9%98%B5.md,46.3%,中等,213 -0520,0500-0599,0520. 检测大写字母,检测大写字母,https://leetcode.cn/problems/detect-capital/,detect-capital,字符串,https://algo.itcharge.cn/Solutions/0500-0599/detect-capital/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0520.%20%E6%A3%80%E6%B5%8B%E5%A4%A7%E5%86%99%E5%AD%97%E6%AF%8D.md,56.8%,简单,1332 -0521,0500-0599,0521. 最长特殊序列 Ⅰ,最长特殊序列 Ⅰ,https://leetcode.cn/problems/longest-uncommon-subsequence-i/,longest-uncommon-subsequence-i,字符串,https://algo.itcharge.cn/Solutions/0500-0599/longest-uncommon-subsequence-i/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0521.%20%E6%9C%80%E9%95%BF%E7%89%B9%E6%AE%8A%E5%BA%8F%E5%88%97%20%E2%85%A0.md,73.7%,简单,573 -0522,0500-0599,0522. 最长特殊序列 II,最长特殊序列 II,https://leetcode.cn/problems/longest-uncommon-subsequence-ii/,longest-uncommon-subsequence-ii,数组、哈希表、双指针、字符串、排序,https://algo.itcharge.cn/Solutions/0500-0599/longest-uncommon-subsequence-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0522.%20%E6%9C%80%E9%95%BF%E7%89%B9%E6%AE%8A%E5%BA%8F%E5%88%97%20II.md,48.8%,中等,362 -0523,0500-0599,0523. 连续的子数组和,连续的子数组和,https://leetcode.cn/problems/continuous-subarray-sum/,continuous-subarray-sum,数组、哈希表、数学、前缀和,https://algo.itcharge.cn/Solutions/0500-0599/continuous-subarray-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0523.%20%E8%BF%9E%E7%BB%AD%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84%E5%92%8C.md,28.5%,中等,782 -0524,0500-0599,0524. 通过删除字母匹配到字典里最长单词,通过删除字母匹配到字典里最长单词,https://leetcode.cn/problems/longest-word-in-dictionary-through-deleting/,longest-word-in-dictionary-through-deleting,数组、双指针、字符串、排序,https://algo.itcharge.cn/Solutions/0500-0599/longest-word-in-dictionary-through-deleting/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0524.%20%E9%80%9A%E8%BF%87%E5%88%A0%E9%99%A4%E5%AD%97%E6%AF%8D%E5%8C%B9%E9%85%8D%E5%88%B0%E5%AD%97%E5%85%B8%E9%87%8C%E6%9C%80%E9%95%BF%E5%8D%95%E8%AF%8D.md,50.0%,中等,974 -0525,0500-0599,0525. 连续数组,连续数组,https://leetcode.cn/problems/contiguous-array/,contiguous-array,数组、哈希表、前缀和,https://algo.itcharge.cn/Solutions/0500-0599/contiguous-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0525.%20%E8%BF%9E%E7%BB%AD%E6%95%B0%E7%BB%84.md,54.7%,中等,704 -0526,0500-0599,0526. 优美的排列,优美的排列,https://leetcode.cn/problems/beautiful-arrangement/,beautiful-arrangement,位运算、数组、动态规划、回溯、状态压缩,https://algo.itcharge.cn/Solutions/0500-0599/beautiful-arrangement/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0526.%20%E4%BC%98%E7%BE%8E%E7%9A%84%E6%8E%92%E5%88%97.md,73.2%,中等,515 -0527,0500-0599,0527. 单词缩写,单词缩写,https://leetcode.cn/problems/word-abbreviation/,word-abbreviation,贪心、字典树、数组、字符串、排序,https://algo.itcharge.cn/Solutions/0500-0599/word-abbreviation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0527.%20%E5%8D%95%E8%AF%8D%E7%BC%A9%E5%86%99.md,60.1%,困难,42 -0528,0500-0599,0528. 按权重随机选择,按权重随机选择,https://leetcode.cn/problems/random-pick-with-weight/,random-pick-with-weight,数组、数学、二分查找、前缀和、随机化,https://algo.itcharge.cn/Solutions/0500-0599/random-pick-with-weight/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0528.%20%E6%8C%89%E6%9D%83%E9%87%8D%E9%9A%8F%E6%9C%BA%E9%80%89%E6%8B%A9.md,48.4%,中等,490 -0529,0500-0599,0529. 扫雷游戏,扫雷游戏,https://leetcode.cn/problems/minesweeper/,minesweeper,深度优先搜索、广度优先搜索、数组、矩阵,https://algo.itcharge.cn/Solutions/0500-0599/minesweeper/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0529.%20%E6%89%AB%E9%9B%B7%E6%B8%B8%E6%88%8F.md,64.0%,中等,600 -0530,0500-0599,0530. 二叉搜索树的最小绝对差,二叉搜索树的最小绝对差,https://leetcode.cn/problems/minimum-absolute-difference-in-bst/,minimum-absolute-difference-in-bst,树、深度优先搜索、广度优先搜索、二叉搜索树、二叉树,https://algo.itcharge.cn/Solutions/0500-0599/minimum-absolute-difference-in-bst/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0530.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E6%9C%80%E5%B0%8F%E7%BB%9D%E5%AF%B9%E5%B7%AE.md,63.4%,简单,1173 -0531,0500-0599,0531. 孤独像素 I,孤独像素 I,https://leetcode.cn/problems/lonely-pixel-i/,lonely-pixel-i,数组、哈希表、矩阵,https://algo.itcharge.cn/Solutions/0500-0599/lonely-pixel-i/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0531.%20%E5%AD%A4%E7%8B%AC%E5%83%8F%E7%B4%A0%20I.md,64.2%,中等,119 -0532,0500-0599,0532. 数组中的 k-diff 数对,数组中的 k-diff 数对,https://leetcode.cn/problems/k-diff-pairs-in-an-array/,k-diff-pairs-in-an-array,数组、哈希表、双指针、二分查找、排序,https://algo.itcharge.cn/Solutions/0500-0599/k-diff-pairs-in-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0532.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%20k-diff%20%E6%95%B0%E5%AF%B9.md,45.6%,中等,706 -0533,0500-0599,0533. 孤独像素 II,孤独像素 II,https://leetcode.cn/problems/lonely-pixel-ii/,lonely-pixel-ii,数组、哈希表、矩阵,https://algo.itcharge.cn/Solutions/0500-0599/lonely-pixel-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0533.%20%E5%AD%A4%E7%8B%AC%E5%83%8F%E7%B4%A0%20II.md,52.8%,中等,47 -0534,0500-0599,0534. 游戏玩法分析 III,游戏玩法分析 III,https://leetcode.cn/problems/game-play-analysis-iii/,game-play-analysis-iii,数据库,https://algo.itcharge.cn/Solutions/0500-0599/game-play-analysis-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0534.%20%E6%B8%B8%E6%88%8F%E7%8E%A9%E6%B3%95%E5%88%86%E6%9E%90%20III.md,68.9%,中等,201 -0535,0500-0599,0535. TinyURL 的加密与解密,TinyURL 的加密与解密,https://leetcode.cn/problems/encode-and-decode-tinyurl/,encode-and-decode-tinyurl,设计、哈希表、字符串、哈希函数,https://algo.itcharge.cn/Solutions/0500-0599/encode-and-decode-tinyurl/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0535.%20TinyURL%20%E7%9A%84%E5%8A%A0%E5%AF%86%E4%B8%8E%E8%A7%A3%E5%AF%86.md,87.5%,中等,278 -0536,0500-0599,0536. 从字符串生成二叉树,从字符串生成二叉树,https://leetcode.cn/problems/construct-binary-tree-from-string/,construct-binary-tree-from-string,树、深度优先搜索、字符串、二叉树,https://algo.itcharge.cn/Solutions/0500-0599/construct-binary-tree-from-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0536.%20%E4%BB%8E%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%94%9F%E6%88%90%E4%BA%8C%E5%8F%89%E6%A0%91.md,55.2%,中等,97 -0537,0500-0599,0537. 复数乘法,复数乘法,https://leetcode.cn/problems/complex-number-multiplication/,complex-number-multiplication,数学、字符串、模拟,https://algo.itcharge.cn/Solutions/0500-0599/complex-number-multiplication/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0537.%20%E5%A4%8D%E6%95%B0%E4%B9%98%E6%B3%95.md,74.6%,中等,666 -0538,0500-0599,0538. 把二叉搜索树转换为累加树,把二叉搜索树转换为累加树,https://leetcode.cn/problems/convert-bst-to-greater-tree/,convert-bst-to-greater-tree,树、深度优先搜索、二叉搜索树、二叉树,https://algo.itcharge.cn/Solutions/0500-0599/convert-bst-to-greater-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0538.%20%E6%8A%8A%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E8%BD%AC%E6%8D%A2%E4%B8%BA%E7%B4%AF%E5%8A%A0%E6%A0%91.md,76.6%,中等,1553 -0539,0500-0599,0539. 最小时间差,最小时间差,https://leetcode.cn/problems/minimum-time-difference/,minimum-time-difference,数组、数学、字符串、排序,https://algo.itcharge.cn/Solutions/0500-0599/minimum-time-difference/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0539.%20%E6%9C%80%E5%B0%8F%E6%97%B6%E9%97%B4%E5%B7%AE.md,65.9%,中等,672 -0540,0500-0599,0540. 有序数组中的单一元素,有序数组中的单一元素,https://leetcode.cn/problems/single-element-in-a-sorted-array/,single-element-in-a-sorted-array,数组、二分查找,https://algo.itcharge.cn/Solutions/0500-0599/single-element-in-a-sorted-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0540.%20%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E5%8D%95%E4%B8%80%E5%85%83%E7%B4%A0.md,60.5%,中等,1076 -0541,0500-0599,0541. 反转字符串 II,反转字符串 II,https://leetcode.cn/problems/reverse-string-ii/,reverse-string-ii,双指针、字符串,https://algo.itcharge.cn/Solutions/0500-0599/reverse-string-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0541.%20%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2%20II.md,58.0%,简单,1560 -0542,0500-0599,0542. 01 矩阵,01 矩阵,https://leetcode.cn/problems/01-matrix/,01-matrix,广度优先搜索、数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/0500-0599/01-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0542.%2001%20%E7%9F%A9%E9%98%B5.md,46.6%,中等,1110 -0543,0500-0599,0543. 二叉树的直径,二叉树的直径,https://leetcode.cn/problems/diameter-of-binary-tree/,diameter-of-binary-tree,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0500-0599/diameter-of-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0543.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E7%9B%B4%E5%BE%84.md,58.6%,简单,2257 -0544,0500-0599,0544. 输出比赛匹配对,输出比赛匹配对,https://leetcode.cn/problems/output-contest-matches/,output-contest-matches,递归、字符串、模拟,https://algo.itcharge.cn/Solutions/0500-0599/output-contest-matches/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0544.%20%E8%BE%93%E5%87%BA%E6%AF%94%E8%B5%9B%E5%8C%B9%E9%85%8D%E5%AF%B9.md,72.3%,中等,72 -0545,0500-0599,0545. 二叉树的边界,二叉树的边界,https://leetcode.cn/problems/boundary-of-binary-tree/,boundary-of-binary-tree,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0500-0599/boundary-of-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0545.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E8%BE%B9%E7%95%8C.md,44.7%,中等,101 -0546,0500-0599,0546. 移除盒子,移除盒子,https://leetcode.cn/problems/remove-boxes/,remove-boxes,记忆化搜索、数组、动态规划,https://algo.itcharge.cn/Solutions/0500-0599/remove-boxes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0546.%20%E7%A7%BB%E9%99%A4%E7%9B%92%E5%AD%90.md,60.8%,困难,149 -0547,0500-0599,0547. 省份数量,省份数量,https://leetcode.cn/problems/number-of-provinces/,number-of-provinces,深度优先搜索、广度优先搜索、并查集、图,https://algo.itcharge.cn/Solutions/0500-0599/number-of-provinces/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0547.%20%E7%9C%81%E4%BB%BD%E6%95%B0%E9%87%8F.md,62.2%,中等,1857 -0548,0500-0599,0548. 将数组分割成和相等的子数组,将数组分割成和相等的子数组,https://leetcode.cn/problems/split-array-with-equal-sum/,split-array-with-equal-sum,数组、前缀和,https://algo.itcharge.cn/Solutions/0500-0599/split-array-with-equal-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0548.%20%E5%B0%86%E6%95%B0%E7%BB%84%E5%88%86%E5%89%B2%E6%88%90%E5%92%8C%E7%9B%B8%E7%AD%89%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md,39.0%,困难,54 -0549,0500-0599,0549. 二叉树中最长的连续序列,二叉树中最长的连续序列,https://leetcode.cn/problems/binary-tree-longest-consecutive-sequence-ii/,binary-tree-longest-consecutive-sequence-ii,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0500-0599/binary-tree-longest-consecutive-sequence-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0549.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E6%9C%80%E9%95%BF%E7%9A%84%E8%BF%9E%E7%BB%AD%E5%BA%8F%E5%88%97.md,50.3%,中等,83 -0550,0500-0599,0550. 游戏玩法分析 IV,游戏玩法分析 IV,https://leetcode.cn/problems/game-play-analysis-iv/,game-play-analysis-iv,数据库,https://algo.itcharge.cn/Solutions/0500-0599/game-play-analysis-iv/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0550.%20%E6%B8%B8%E6%88%8F%E7%8E%A9%E6%B3%95%E5%88%86%E6%9E%90%20IV.md,43.8%,中等,337 -0551,0500-0599,0551. 学生出勤记录 I,学生出勤记录 I,https://leetcode.cn/problems/student-attendance-record-i/,student-attendance-record-i,字符串,https://algo.itcharge.cn/Solutions/0500-0599/student-attendance-record-i/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0551.%20%E5%AD%A6%E7%94%9F%E5%87%BA%E5%8B%A4%E8%AE%B0%E5%BD%95%20I.md,56.7%,简单,991 -0552,0500-0599,0552. 学生出勤记录 II,学生出勤记录 II,https://leetcode.cn/problems/student-attendance-record-ii/,student-attendance-record-ii,动态规划,https://algo.itcharge.cn/Solutions/0500-0599/student-attendance-record-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0552.%20%E5%AD%A6%E7%94%9F%E5%87%BA%E5%8B%A4%E8%AE%B0%E5%BD%95%20II.md,57.8%,困难,345 -0553,0500-0599,0553. 最优除法,最优除法,https://leetcode.cn/problems/optimal-division/,optimal-division,数组、数学、动态规划,https://algo.itcharge.cn/Solutions/0500-0599/optimal-division/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0553.%20%E6%9C%80%E4%BC%98%E9%99%A4%E6%B3%95.md,64.8%,中等,382 -0554,0500-0599,0554. 砖墙,砖墙,https://leetcode.cn/problems/brick-wall/,brick-wall,数组、哈希表,https://algo.itcharge.cn/Solutions/0500-0599/brick-wall/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0554.%20%E7%A0%96%E5%A2%99.md,51.5%,中等,601 -0555,0500-0599,0555. 分割连接字符串,分割连接字符串,https://leetcode.cn/problems/split-concatenated-strings/,split-concatenated-strings,贪心、数组、字符串,https://algo.itcharge.cn/Solutions/0500-0599/split-concatenated-strings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0555.%20%E5%88%86%E5%89%B2%E8%BF%9E%E6%8E%A5%E5%AD%97%E7%AC%A6%E4%B8%B2.md,37.6%,中等,32 -0556,0500-0599,0556. 下一个更大元素 III,下一个更大元素 III,https://leetcode.cn/problems/next-greater-element-iii/,next-greater-element-iii,数学、双指针、字符串,https://algo.itcharge.cn/Solutions/0500-0599/next-greater-element-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0556.%20%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%9B%B4%E5%A4%A7%E5%85%83%E7%B4%A0%20III.md,36.9%,中等,568 -0557,0500-0599,0557. 反转字符串中的单词 III,反转字符串中的单词 III,https://leetcode.cn/problems/reverse-words-in-a-string-iii/,reverse-words-in-a-string-iii,双指针、字符串,https://algo.itcharge.cn/Solutions/0500-0599/reverse-words-in-a-string-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0557.%20%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%8D%95%E8%AF%8D%20III.md,73.8%,简单,2558 -0558,0500-0599,0558. 四叉树交集,四叉树交集,https://leetcode.cn/problems/logical-or-of-two-binary-grids-represented-as-quad-trees/,logical-or-of-two-binary-grids-represented-as-quad-trees,树、分治,https://algo.itcharge.cn/Solutions/0500-0599/logical-or-of-two-binary-grids-represented-as-quad-trees/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0558.%20%E5%9B%9B%E5%8F%89%E6%A0%91%E4%BA%A4%E9%9B%86.md,62.8%,中等,164 -0559,0500-0599,0559. N 叉树的最大深度,N 叉树的最大深度,https://leetcode.cn/problems/maximum-depth-of-n-ary-tree/,maximum-depth-of-n-ary-tree,树、深度优先搜索、广度优先搜索,https://algo.itcharge.cn/Solutions/0500-0599/maximum-depth-of-n-ary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0559.%20N%20%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%A4%A7%E6%B7%B1%E5%BA%A6.md,75.0%,简单,1071 -0560,0500-0599,0560. 和为 K 的子数组,和为 K 的子数组,https://leetcode.cn/problems/subarray-sum-equals-k/,subarray-sum-equals-k,数组、哈希表、前缀和,https://algo.itcharge.cn/Solutions/0500-0599/subarray-sum-equals-k/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0560.%20%E5%92%8C%E4%B8%BA%20K%20%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md,45.0%,中等,1867 -0561,0500-0599,0561. 数组拆分,数组拆分,https://leetcode.cn/problems/array-partition/,array-partition,贪心、数组、计数排序、排序,https://algo.itcharge.cn/Solutions/0500-0599/array-partition/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0561.%20%E6%95%B0%E7%BB%84%E6%8B%86%E5%88%86.md,78.5%,简单,1125 -0562,0500-0599,0562. 矩阵中最长的连续1线段,矩阵中最长的连续1线段,https://leetcode.cn/problems/longest-line-of-consecutive-one-in-matrix/,longest-line-of-consecutive-one-in-matrix,数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/0500-0599/longest-line-of-consecutive-one-in-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0562.%20%E7%9F%A9%E9%98%B5%E4%B8%AD%E6%9C%80%E9%95%BF%E7%9A%84%E8%BF%9E%E7%BB%AD1%E7%BA%BF%E6%AE%B5.md,49.7%,中等,102 -0563,0500-0599,0563. 二叉树的坡度,二叉树的坡度,https://leetcode.cn/problems/binary-tree-tilt/,binary-tree-tilt,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0500-0599/binary-tree-tilt/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0563.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%9D%A1%E5%BA%A6.md,65.9%,简单,761 -0564,0500-0599,0564. 寻找最近的回文数,寻找最近的回文数,https://leetcode.cn/problems/find-the-closest-palindrome/,find-the-closest-palindrome,数学、字符串,https://algo.itcharge.cn/Solutions/0500-0599/find-the-closest-palindrome/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0564.%20%E5%AF%BB%E6%89%BE%E6%9C%80%E8%BF%91%E7%9A%84%E5%9B%9E%E6%96%87%E6%95%B0.md,30.4%,困难,261 -0565,0500-0599,0565. 数组嵌套,数组嵌套,https://leetcode.cn/problems/array-nesting/,array-nesting,深度优先搜索、数组,https://algo.itcharge.cn/Solutions/0500-0599/array-nesting/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0565.%20%E6%95%B0%E7%BB%84%E5%B5%8C%E5%A5%97.md,62.4%,中等,457 -0566,0500-0599,0566. 重塑矩阵,重塑矩阵,https://leetcode.cn/problems/reshape-the-matrix/,reshape-the-matrix,数组、矩阵、模拟,https://algo.itcharge.cn/Solutions/0500-0599/reshape-the-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0566.%20%E9%87%8D%E5%A1%91%E7%9F%A9%E9%98%B5.md,64.8%,简单,1336 -0567,0500-0599,0567. 字符串的排列,字符串的排列,https://leetcode.cn/problems/permutation-in-string/,permutation-in-string,哈希表、双指针、字符串、滑动窗口,https://algo.itcharge.cn/Solutions/0500-0599/permutation-in-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0567.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%8E%92%E5%88%97.md,44.5%,中等,2322 -0568,0500-0599,0568. 最大休假天数,最大休假天数,https://leetcode.cn/problems/maximum-vacation-days/,maximum-vacation-days,数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/0500-0599/maximum-vacation-days/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0568.%20%E6%9C%80%E5%A4%A7%E4%BC%91%E5%81%87%E5%A4%A9%E6%95%B0.md,53.8%,困难,42 -0569,0500-0599,0569. 员工薪水中位数,员工薪水中位数,https://leetcode.cn/problems/median-employee-salary/,median-employee-salary,数据库,https://algo.itcharge.cn/Solutions/0500-0599/median-employee-salary/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0569.%20%E5%91%98%E5%B7%A5%E8%96%AA%E6%B0%B4%E4%B8%AD%E4%BD%8D%E6%95%B0.md,57.4%,困难,266 -0570,0500-0599,0570. 至少有5名直接下属的经理,至少有5名直接下属的经理,https://leetcode.cn/problems/managers-with-at-least-5-direct-reports/,managers-with-at-least-5-direct-reports,数据库,https://algo.itcharge.cn/Solutions/0500-0599/managers-with-at-least-5-direct-reports/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0570.%20%E8%87%B3%E5%B0%91%E6%9C%895%E5%90%8D%E7%9B%B4%E6%8E%A5%E4%B8%8B%E5%B1%9E%E7%9A%84%E7%BB%8F%E7%90%86.md,64.9%,中等,227 -0571,0500-0599,0571. 给定数字的频率查询中位数,给定数字的频率查询中位数,https://leetcode.cn/problems/find-median-given-frequency-of-numbers/,find-median-given-frequency-of-numbers,数据库,https://algo.itcharge.cn/Solutions/0500-0599/find-median-given-frequency-of-numbers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0571.%20%E7%BB%99%E5%AE%9A%E6%95%B0%E5%AD%97%E7%9A%84%E9%A2%91%E7%8E%87%E6%9F%A5%E8%AF%A2%E4%B8%AD%E4%BD%8D%E6%95%B0.md,47.0%,困难,148 -0572,0500-0599,0572. 另一棵树的子树,另一棵树的子树,https://leetcode.cn/problems/subtree-of-another-tree/,subtree-of-another-tree,树、深度优先搜索、二叉树、字符串匹配、哈希函数,https://algo.itcharge.cn/Solutions/0500-0599/subtree-of-another-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0572.%20%E5%8F%A6%E4%B8%80%E6%A3%B5%E6%A0%91%E7%9A%84%E5%AD%90%E6%A0%91.md,47.5%,简单,1318 -0573,0500-0599,0573. 松鼠模拟,松鼠模拟,https://leetcode.cn/problems/squirrel-simulation/,squirrel-simulation,数组、数学,https://algo.itcharge.cn/Solutions/0500-0599/squirrel-simulation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0573.%20%E6%9D%BE%E9%BC%A0%E6%A8%A1%E6%8B%9F.md,65.3%,中等,49 -0574,0500-0599,0574. 当选者,当选者,https://leetcode.cn/problems/winning-candidate/,winning-candidate,数据库,https://algo.itcharge.cn/Solutions/0500-0599/winning-candidate/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0574.%20%E5%BD%93%E9%80%89%E8%80%85.md,66.4%,中等,162 -0575,0500-0599,0575. 分糖果,分糖果,https://leetcode.cn/problems/distribute-candies/,distribute-candies,数组、哈希表,https://algo.itcharge.cn/Solutions/0500-0599/distribute-candies/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0575.%20%E5%88%86%E7%B3%96%E6%9E%9C.md,70.4%,简单,1070 -0576,0500-0599,0576. 出界的路径数,出界的路径数,https://leetcode.cn/problems/out-of-boundary-paths/,out-of-boundary-paths,动态规划,https://algo.itcharge.cn/Solutions/0500-0599/out-of-boundary-paths/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0576.%20%E5%87%BA%E7%95%8C%E7%9A%84%E8%B7%AF%E5%BE%84%E6%95%B0.md,47.0%,中等,382 -0577,0500-0599,0577. 员工奖金,员工奖金,https://leetcode.cn/problems/employee-bonus/,employee-bonus,数据库,https://algo.itcharge.cn/Solutions/0500-0599/employee-bonus/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0577.%20%E5%91%98%E5%B7%A5%E5%A5%96%E9%87%91.md,69.2%,简单,165 -0578,0500-0599,0578. 查询回答率最高的问题,查询回答率最高的问题,https://leetcode.cn/problems/get-highest-answer-rate-question/,get-highest-answer-rate-question,数据库,https://algo.itcharge.cn/Solutions/0500-0599/get-highest-answer-rate-question/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0578.%20%E6%9F%A5%E8%AF%A2%E5%9B%9E%E7%AD%94%E7%8E%87%E6%9C%80%E9%AB%98%E7%9A%84%E9%97%AE%E9%A2%98.md,42.3%,中等,190 -0579,0500-0599,0579. 查询员工的累计薪水,查询员工的累计薪水,https://leetcode.cn/problems/find-cumulative-salary-of-an-employee/,find-cumulative-salary-of-an-employee,数据库,https://algo.itcharge.cn/Solutions/0500-0599/find-cumulative-salary-of-an-employee/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0579.%20%E6%9F%A5%E8%AF%A2%E5%91%98%E5%B7%A5%E7%9A%84%E7%B4%AF%E8%AE%A1%E8%96%AA%E6%B0%B4.md,44.1%,困难,188 -0580,0500-0599,0580. 统计各专业学生人数,统计各专业学生人数,https://leetcode.cn/problems/count-student-number-in-departments/,count-student-number-in-departments,数据库,https://algo.itcharge.cn/Solutions/0500-0599/count-student-number-in-departments/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0580.%20%E7%BB%9F%E8%AE%A1%E5%90%84%E4%B8%93%E4%B8%9A%E5%AD%A6%E7%94%9F%E4%BA%BA%E6%95%B0.md,53.6%,中等,156 -0581,0500-0599,0581. 最短无序连续子数组,最短无序连续子数组,https://leetcode.cn/problems/shortest-unsorted-continuous-subarray/,shortest-unsorted-continuous-subarray,栈、贪心、数组、双指针、排序、单调栈,https://algo.itcharge.cn/Solutions/0500-0599/shortest-unsorted-continuous-subarray/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0581.%20%E6%9C%80%E7%9F%AD%E6%97%A0%E5%BA%8F%E8%BF%9E%E7%BB%AD%E5%AD%90%E6%95%B0%E7%BB%84.md,41.8%,中等,1350 -0582,0500-0599,0582. 杀掉进程,杀掉进程,https://leetcode.cn/problems/kill-process/,kill-process,树、深度优先搜索、广度优先搜索、数组、哈希表,https://algo.itcharge.cn/Solutions/0500-0599/kill-process/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0582.%20%E6%9D%80%E6%8E%89%E8%BF%9B%E7%A8%8B.md,45.9%,中等,188 -0583,0500-0599,0583. 两个字符串的删除操作,两个字符串的删除操作,https://leetcode.cn/problems/delete-operation-for-two-strings/,delete-operation-for-two-strings,字符串、动态规划,https://algo.itcharge.cn/Solutions/0500-0599/delete-operation-for-two-strings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0583.%20%E4%B8%A4%E4%B8%AA%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E5%88%A0%E9%99%A4%E6%93%8D%E4%BD%9C.md,66.6%,中等,918 -0584,0500-0599,0584. 寻找用户推荐人,寻找用户推荐人,https://leetcode.cn/problems/find-customer-referee/,find-customer-referee,数据库,https://algo.itcharge.cn/Solutions/0500-0599/find-customer-referee/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0584.%20%E5%AF%BB%E6%89%BE%E7%94%A8%E6%88%B7%E6%8E%A8%E8%8D%90%E4%BA%BA.md,65.4%,简单,436 -0585,0500-0599,0585. 2016年的投资,2016年的投资,https://leetcode.cn/problems/investments-in-2016/,investments-in-2016,数据库,https://algo.itcharge.cn/Solutions/0500-0599/investments-in-2016/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0585.%202016%E5%B9%B4%E7%9A%84%E6%8A%95%E8%B5%84.md,47.7%,中等,190 -0586,0500-0599,0586. 订单最多的客户,订单最多的客户,https://leetcode.cn/problems/customer-placing-the-largest-number-of-orders/,customer-placing-the-largest-number-of-orders,数据库,https://algo.itcharge.cn/Solutions/0500-0599/customer-placing-the-largest-number-of-orders/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0586.%20%E8%AE%A2%E5%8D%95%E6%9C%80%E5%A4%9A%E7%9A%84%E5%AE%A2%E6%88%B7.md,69.5%,简单,357 -0587,0500-0599,0587. 安装栅栏,安装栅栏,https://leetcode.cn/problems/erect-the-fence/,erect-the-fence,几何、数组、数学,https://algo.itcharge.cn/Solutions/0500-0599/erect-the-fence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0587.%20%E5%AE%89%E8%A3%85%E6%A0%85%E6%A0%8F.md,60.9%,困难,139 -0588,0500-0599,0588. 设计内存文件系统,设计内存文件系统,https://leetcode.cn/problems/design-in-memory-file-system/,design-in-memory-file-system,设计、字典树、哈希表、字符串,https://algo.itcharge.cn/Solutions/0500-0599/design-in-memory-file-system/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0588.%20%E8%AE%BE%E8%AE%A1%E5%86%85%E5%AD%98%E6%96%87%E4%BB%B6%E7%B3%BB%E7%BB%9F.md,43.5%,困难,56 -0589,0500-0599,0589. N 叉树的前序遍历,N 叉树的前序遍历,https://leetcode.cn/problems/n-ary-tree-preorder-traversal/,n-ary-tree-preorder-traversal,栈、树、深度优先搜索,https://algo.itcharge.cn/Solutions/0500-0599/n-ary-tree-preorder-traversal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0589.%20N%20%E5%8F%89%E6%A0%91%E7%9A%84%E5%89%8D%E5%BA%8F%E9%81%8D%E5%8E%86.md,76.5%,简单,1142 -0590,0500-0599,0590. N 叉树的后序遍历,N 叉树的后序遍历,https://leetcode.cn/problems/n-ary-tree-postorder-traversal/,n-ary-tree-postorder-traversal,栈、树、深度优先搜索,https://algo.itcharge.cn/Solutions/0500-0599/n-ary-tree-postorder-traversal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0590.%20N%20%E5%8F%89%E6%A0%91%E7%9A%84%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86.md,78.7%,简单,918 -0591,0500-0599,0591. 标签验证器,标签验证器,https://leetcode.cn/problems/tag-validator/,tag-validator,栈、字符串,https://algo.itcharge.cn/Solutions/0500-0599/tag-validator/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0591.%20%E6%A0%87%E7%AD%BE%E9%AA%8C%E8%AF%81%E5%99%A8.md,52.1%,困难,197 -0592,0500-0599,0592. 分数加减运算,分数加减运算,https://leetcode.cn/problems/fraction-addition-and-subtraction/,fraction-addition-and-subtraction,数学、字符串、模拟,https://algo.itcharge.cn/Solutions/0500-0599/fraction-addition-and-subtraction/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0592.%20%E5%88%86%E6%95%B0%E5%8A%A0%E5%87%8F%E8%BF%90%E7%AE%97.md,59.8%,中等,478 -0593,0500-0599,0593. 有效的正方形,有效的正方形,https://leetcode.cn/problems/valid-square/,valid-square,几何、数学,https://algo.itcharge.cn/Solutions/0500-0599/valid-square/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0593.%20%E6%9C%89%E6%95%88%E7%9A%84%E6%AD%A3%E6%96%B9%E5%BD%A2.md,47.1%,中等,590 -0594,0500-0599,0594. 最长和谐子序列,最长和谐子序列,https://leetcode.cn/problems/longest-harmonious-subsequence/,longest-harmonious-subsequence,数组、哈希表、排序,https://algo.itcharge.cn/Solutions/0500-0599/longest-harmonious-subsequence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0594.%20%E6%9C%80%E9%95%BF%E5%92%8C%E8%B0%90%E5%AD%90%E5%BA%8F%E5%88%97.md,56.1%,简单,705 -0595,0500-0599,0595. 大的国家,大的国家,https://leetcode.cn/problems/big-countries/,big-countries,数据库,https://algo.itcharge.cn/Solutions/0500-0599/big-countries/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0595.%20%E5%A4%A7%E7%9A%84%E5%9B%BD%E5%AE%B6.md,66.8%,简单,594 -0596,0500-0599,0596. 超过5名学生的课,超过5名学生的课,https://leetcode.cn/problems/classes-more-than-5-students/,classes-more-than-5-students,数据库,https://algo.itcharge.cn/Solutions/0500-0599/classes-more-than-5-students/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0596.%20%E8%B6%85%E8%BF%875%E5%90%8D%E5%AD%A6%E7%94%9F%E7%9A%84%E8%AF%BE.md,50.7%,简单,477 -0597,0500-0599,0597. 好友申请 I：总体通过率,好友申请 I：总体通过率,https://leetcode.cn/problems/friend-requests-i-overall-acceptance-rate/,friend-requests-i-overall-acceptance-rate,数据库,https://algo.itcharge.cn/Solutions/0500-0599/friend-requests-i-overall-acceptance-rate/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0597.%20%E5%A5%BD%E5%8F%8B%E7%94%B3%E8%AF%B7%20I%EF%BC%9A%E6%80%BB%E4%BD%93%E9%80%9A%E8%BF%87%E7%8E%87.md,43.2%,简单,126 -0598,0500-0599,0598. 范围求和 II,范围求和 II,https://leetcode.cn/problems/range-addition-ii/,range-addition-ii,数组、数学,https://algo.itcharge.cn/Solutions/0500-0599/range-addition-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0598.%20%E8%8C%83%E5%9B%B4%E6%B1%82%E5%92%8C%20II.md,57.8%,简单,625 -0599,0500-0599,0599. 两个列表的最小索引总和,两个列表的最小索引总和,https://leetcode.cn/problems/minimum-index-sum-of-two-lists/,minimum-index-sum-of-two-lists,数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/0500-0599/minimum-index-sum-of-two-lists/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0599.%20%E4%B8%A4%E4%B8%AA%E5%88%97%E8%A1%A8%E7%9A%84%E6%9C%80%E5%B0%8F%E7%B4%A2%E5%BC%95%E6%80%BB%E5%92%8C.md,56.7%,简单,740 -0600,0600-0699,0600. 不含连续1的非负整数,不含连续1的非负整数,https://leetcode.cn/problems/non-negative-integers-without-consecutive-ones/,non-negative-integers-without-consecutive-ones,动态规划,https://algo.itcharge.cn/Solutions/0600-0699/non-negative-integers-without-consecutive-ones/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0600.%20%E4%B8%8D%E5%90%AB%E8%BF%9E%E7%BB%AD1%E7%9A%84%E9%9D%9E%E8%B4%9F%E6%95%B4%E6%95%B0.md,49.5%,困难,314 -0601,0600-0699,0601. 体育馆的人流量,体育馆的人流量,https://leetcode.cn/problems/human-traffic-of-stadium/,human-traffic-of-stadium,数据库,https://algo.itcharge.cn/Solutions/0600-0699/human-traffic-of-stadium/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0601.%20%E4%BD%93%E8%82%B2%E9%A6%86%E7%9A%84%E4%BA%BA%E6%B5%81%E9%87%8F.md,48.0%,困难,573 -0602,0600-0699,0602. 好友申请 II ：谁有最多的好友,好友申请 II ：谁有最多的好友,https://leetcode.cn/problems/friend-requests-ii-who-has-the-most-friends/,friend-requests-ii-who-has-the-most-friends,数据库,https://algo.itcharge.cn/Solutions/0600-0699/friend-requests-ii-who-has-the-most-friends/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0602.%20%E5%A5%BD%E5%8F%8B%E7%94%B3%E8%AF%B7%20II%20%EF%BC%9A%E8%B0%81%E6%9C%89%E6%9C%80%E5%A4%9A%E7%9A%84%E5%A5%BD%E5%8F%8B.md,61.1%,中等,164 -0603,0600-0699,0603. 连续空余座位,连续空余座位,https://leetcode.cn/problems/consecutive-available-seats/,consecutive-available-seats,数据库,https://algo.itcharge.cn/Solutions/0600-0699/consecutive-available-seats/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0603.%20%E8%BF%9E%E7%BB%AD%E7%A9%BA%E4%BD%99%E5%BA%A7%E4%BD%8D.md,64.0%,简单,237 -0604,0600-0699,0604. 迭代压缩字符串,迭代压缩字符串,https://leetcode.cn/problems/design-compressed-string-iterator/,design-compressed-string-iterator,设计、数组、哈希表、字符串、迭代器,https://algo.itcharge.cn/Solutions/0600-0699/design-compressed-string-iterator/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0604.%20%E8%BF%AD%E4%BB%A3%E5%8E%8B%E7%BC%A9%E5%AD%97%E7%AC%A6%E4%B8%B2.md,38.7%,简单,93 -0605,0600-0699,0605. 种花问题,种花问题,https://leetcode.cn/problems/can-place-flowers/,can-place-flowers,贪心、数组,https://algo.itcharge.cn/Solutions/0600-0699/can-place-flowers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0605.%20%E7%A7%8D%E8%8A%B1%E9%97%AE%E9%A2%98.md,32.3%,简单,1868 -0606,0600-0699,0606. 根据二叉树创建字符串,根据二叉树创建字符串,https://leetcode.cn/problems/construct-string-from-binary-tree/,construct-string-from-binary-tree,树、深度优先搜索、字符串、二叉树,https://algo.itcharge.cn/Solutions/0600-0699/construct-string-from-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0606.%20%E6%A0%B9%E6%8D%AE%E4%BA%8C%E5%8F%89%E6%A0%91%E5%88%9B%E5%BB%BA%E5%AD%97%E7%AC%A6%E4%B8%B2.md,62.2%,简单,728 -0607,0600-0699,0607. 销售员,销售员,https://leetcode.cn/problems/sales-person/,sales-person,数据库,https://algo.itcharge.cn/Solutions/0600-0699/sales-person/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0607.%20%E9%94%80%E5%94%AE%E5%91%98.md,68.2%,简单,396 -0608,0600-0699,0608. 树节点,树节点,https://leetcode.cn/problems/tree-node/,tree-node,数据库,https://algo.itcharge.cn/Solutions/0600-0699/tree-node/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0608.%20%E6%A0%91%E8%8A%82%E7%82%B9.md,61.0%,中等,401 -0609,0600-0699,0609. 在系统中查找重复文件,在系统中查找重复文件,https://leetcode.cn/problems/find-duplicate-file-in-system/,find-duplicate-file-in-system,数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/0600-0699/find-duplicate-file-in-system/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0609.%20%E5%9C%A8%E7%B3%BB%E7%BB%9F%E4%B8%AD%E6%9F%A5%E6%89%BE%E9%87%8D%E5%A4%8D%E6%96%87%E4%BB%B6.md,52.4%,中等,159 -0610,0600-0699,0610. 判断三角形,判断三角形,https://leetcode.cn/problems/triangle-judgement/,triangle-judgement,数据库,https://algo.itcharge.cn/Solutions/0600-0699/triangle-judgement/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0610.%20%E5%88%A4%E6%96%AD%E4%B8%89%E8%A7%92%E5%BD%A2.md,64.4%,简单,126 -0611,0600-0699,0611. 有效三角形的个数,有效三角形的个数,https://leetcode.cn/problems/valid-triangle-number/,valid-triangle-number,贪心、数组、双指针、二分查找、排序,https://algo.itcharge.cn/Solutions/0600-0699/valid-triangle-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0611.%20%E6%9C%89%E6%95%88%E4%B8%89%E8%A7%92%E5%BD%A2%E7%9A%84%E4%B8%AA%E6%95%B0.md,53.7%,中等,642 -0612,0600-0699,0612. 平面上的最近距离,平面上的最近距离,https://leetcode.cn/problems/shortest-distance-in-a-plane/,shortest-distance-in-a-plane,数据库,https://algo.itcharge.cn/Solutions/0600-0699/shortest-distance-in-a-plane/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0612.%20%E5%B9%B3%E9%9D%A2%E4%B8%8A%E7%9A%84%E6%9C%80%E8%BF%91%E8%B7%9D%E7%A6%BB.md,65.0%,中等,103 -0613,0600-0699,0613. 直线上的最近距离,直线上的最近距离,https://leetcode.cn/problems/shortest-distance-in-a-line/,shortest-distance-in-a-line,数据库,https://algo.itcharge.cn/Solutions/0600-0699/shortest-distance-in-a-line/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0613.%20%E7%9B%B4%E7%BA%BF%E4%B8%8A%E7%9A%84%E6%9C%80%E8%BF%91%E8%B7%9D%E7%A6%BB.md,79.6%,简单,121 -0614,0600-0699,0614. 二级关注者,二级关注者,https://leetcode.cn/problems/second-degree-follower/,second-degree-follower,数据库,https://algo.itcharge.cn/Solutions/0600-0699/second-degree-follower/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0614.%20%E4%BA%8C%E7%BA%A7%E5%85%B3%E6%B3%A8%E8%80%85.md,37.3%,中等,107 -0615,0600-0699,0615. 平均工资：部门与公司比较,平均工资：部门与公司比较,https://leetcode.cn/problems/average-salary-departments-vs-company/,average-salary-departments-vs-company,数据库,https://algo.itcharge.cn/Solutions/0600-0699/average-salary-departments-vs-company/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0615.%20%E5%B9%B3%E5%9D%87%E5%B7%A5%E8%B5%84%EF%BC%9A%E9%83%A8%E9%97%A8%E4%B8%8E%E5%85%AC%E5%8F%B8%E6%AF%94%E8%BE%83.md,42.3%,困难,150 -0616,0600-0699,0616. 给字符串添加加粗标签,给字符串添加加粗标签,https://leetcode.cn/problems/add-bold-tag-in-string/,add-bold-tag-in-string,字典树、数组、哈希表、字符串、字符串匹配,https://algo.itcharge.cn/Solutions/0600-0699/add-bold-tag-in-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0616.%20%E7%BB%99%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%B7%BB%E5%8A%A0%E5%8A%A0%E7%B2%97%E6%A0%87%E7%AD%BE.md,49.2%,中等,95 -0617,0600-0699,0617. 合并二叉树,合并二叉树,https://leetcode.cn/problems/merge-two-binary-trees/,merge-two-binary-trees,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0600-0699/merge-two-binary-trees/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0617.%20%E5%90%88%E5%B9%B6%E4%BA%8C%E5%8F%89%E6%A0%91.md,79.1%,简单,2362 -0618,0600-0699,0618. 学生地理信息报告,学生地理信息报告,https://leetcode.cn/problems/students-report-by-geography/,students-report-by-geography,数据库,https://algo.itcharge.cn/Solutions/0600-0699/students-report-by-geography/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0618.%20%E5%AD%A6%E7%94%9F%E5%9C%B0%E7%90%86%E4%BF%A1%E6%81%AF%E6%8A%A5%E5%91%8A.md,62.2%,困难,88 -0619,0600-0699,0619. 只出现一次的最大数字,只出现一次的最大数字,https://leetcode.cn/problems/biggest-single-number/,biggest-single-number,数据库,https://algo.itcharge.cn/Solutions/0600-0699/biggest-single-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0619.%20%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E5%AD%97.md,48.3%,简单,184 -0620,0600-0699,0620. 有趣的电影,有趣的电影,https://leetcode.cn/problems/not-boring-movies/,not-boring-movies,数据库,https://algo.itcharge.cn/Solutions/0600-0699/not-boring-movies/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0620.%20%E6%9C%89%E8%B6%A3%E7%9A%84%E7%94%B5%E5%BD%B1.md,77.1%,简单,458 -0621,0600-0699,0621. 任务调度器,任务调度器,https://leetcode.cn/problems/task-scheduler/,task-scheduler,贪心、数组、哈希表、计数、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/0600-0699/task-scheduler/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0621.%20%E4%BB%BB%E5%8A%A1%E8%B0%83%E5%BA%A6%E5%99%A8.md,59.7%,中等,844 -0622,0600-0699,0622. 设计循环队列,设计循环队列,https://leetcode.cn/problems/design-circular-queue/,design-circular-queue,设计、队列、数组、链表,https://algo.itcharge.cn/Solutions/0600-0699/design-circular-queue/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0622.%20%E8%AE%BE%E8%AE%A1%E5%BE%AA%E7%8E%AF%E9%98%9F%E5%88%97.md,47.1%,中等,1002 -0623,0600-0699,0623. 在二叉树中增加一行,在二叉树中增加一行,https://leetcode.cn/problems/add-one-row-to-tree/,add-one-row-to-tree,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0600-0699/add-one-row-to-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0623.%20%E5%9C%A8%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E5%A2%9E%E5%8A%A0%E4%B8%80%E8%A1%8C.md,60.1%,中等,655 -0624,0600-0699,0624. 数组列表中的最大距离,数组列表中的最大距离,https://leetcode.cn/problems/maximum-distance-in-arrays/,maximum-distance-in-arrays,贪心、数组,https://algo.itcharge.cn/Solutions/0600-0699/maximum-distance-in-arrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0624.%20%E6%95%B0%E7%BB%84%E5%88%97%E8%A1%A8%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E8%B7%9D%E7%A6%BB.md,40.8%,中等,96 -0625,0600-0699,0625. 最小因式分解,最小因式分解,https://leetcode.cn/problems/minimum-factorization/,minimum-factorization,贪心、数学,https://algo.itcharge.cn/Solutions/0600-0699/minimum-factorization/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0625.%20%E6%9C%80%E5%B0%8F%E5%9B%A0%E5%BC%8F%E5%88%86%E8%A7%A3.md,34.6%,中等,70 -0626,0600-0699,0626. 换座位,换座位,https://leetcode.cn/problems/exchange-seats/,exchange-seats,数据库,https://algo.itcharge.cn/Solutions/0600-0699/exchange-seats/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0626.%20%E6%8D%A2%E5%BA%A7%E4%BD%8D.md,67.9%,中等,601 -0627,0600-0699,0627. 变更性别,变更性别,https://leetcode.cn/problems/swap-salary/,swap-salary,数据库,https://algo.itcharge.cn/Solutions/0600-0699/swap-salary/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0627.%20%E5%8F%98%E6%9B%B4%E6%80%A7%E5%88%AB.md,82.1%,简单,653 -0628,0600-0699,0628. 三个数的最大乘积,三个数的最大乘积,https://leetcode.cn/problems/maximum-product-of-three-numbers/,maximum-product-of-three-numbers,数组、数学、排序,https://algo.itcharge.cn/Solutions/0600-0699/maximum-product-of-three-numbers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0628.%20%E4%B8%89%E4%B8%AA%E6%95%B0%E7%9A%84%E6%9C%80%E5%A4%A7%E4%B9%98%E7%A7%AF.md,52.0%,简单,1090 -0629,0600-0699,0629. K 个逆序对数组,K 个逆序对数组,https://leetcode.cn/problems/k-inverse-pairs-array/,k-inverse-pairs-array,动态规划,https://algo.itcharge.cn/Solutions/0600-0699/k-inverse-pairs-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0629.%20K%20%E4%B8%AA%E9%80%86%E5%BA%8F%E5%AF%B9%E6%95%B0%E7%BB%84.md,51.1%,困难,212 -0630,0600-0699,0630. 课程表 III,课程表 III,https://leetcode.cn/problems/course-schedule-iii/,course-schedule-iii,贪心、数组、堆（优先队列）,https://algo.itcharge.cn/Solutions/0600-0699/course-schedule-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0630.%20%E8%AF%BE%E7%A8%8B%E8%A1%A8%20III.md,46.2%,困难,267 -0631,0600-0699,0631. 设计 Excel 求和公式,设计 Excel 求和公式,https://leetcode.cn/problems/design-excel-sum-formula/,design-excel-sum-formula,图、设计、拓扑排序,https://algo.itcharge.cn/Solutions/0600-0699/design-excel-sum-formula/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0631.%20%E8%AE%BE%E8%AE%A1%20Excel%20%E6%B1%82%E5%92%8C%E5%85%AC%E5%BC%8F.md,33.4%,困难,48 -0632,0600-0699,0632. 最小区间,最小区间,https://leetcode.cn/problems/smallest-range-covering-elements-from-k-lists/,smallest-range-covering-elements-from-k-lists,贪心、数组、哈希表、排序、滑动窗口、堆（优先队列）,https://algo.itcharge.cn/Solutions/0600-0699/smallest-range-covering-elements-from-k-lists/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0632.%20%E6%9C%80%E5%B0%8F%E5%8C%BA%E9%97%B4.md,60.7%,困难,313 -0633,0600-0699,0633. 平方数之和,平方数之和,https://leetcode.cn/problems/sum-of-square-numbers/,sum-of-square-numbers,数学、双指针、二分查找,https://algo.itcharge.cn/Solutions/0600-0699/sum-of-square-numbers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0633.%20%E5%B9%B3%E6%96%B9%E6%95%B0%E4%B9%8B%E5%92%8C.md,38.3%,中等,1032 -0634,0600-0699,0634. 寻找数组的错位排列,寻找数组的错位排列,https://leetcode.cn/problems/find-the-derangement-of-an-array/,find-the-derangement-of-an-array,数学、动态规划,https://algo.itcharge.cn/Solutions/0600-0699/find-the-derangement-of-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0634.%20%E5%AF%BB%E6%89%BE%E6%95%B0%E7%BB%84%E7%9A%84%E9%94%99%E4%BD%8D%E6%8E%92%E5%88%97.md,47.4%,中等,35 -0635,0600-0699,0635. 设计日志存储系统,设计日志存储系统,https://leetcode.cn/problems/design-log-storage-system/,design-log-storage-system,设计、哈希表、字符串、有序集合,https://algo.itcharge.cn/Solutions/0600-0699/design-log-storage-system/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0635.%20%E8%AE%BE%E8%AE%A1%E6%97%A5%E5%BF%97%E5%AD%98%E5%82%A8%E7%B3%BB%E7%BB%9F.md,56.3%,中等,108 -0636,0600-0699,0636. 函数的独占时间,函数的独占时间,https://leetcode.cn/problems/exclusive-time-of-functions/,exclusive-time-of-functions,栈、数组,https://algo.itcharge.cn/Solutions/0600-0699/exclusive-time-of-functions/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0636.%20%E5%87%BD%E6%95%B0%E7%9A%84%E7%8B%AC%E5%8D%A0%E6%97%B6%E9%97%B4.md,66.0%,中等,348 -0637,0600-0699,0637. 二叉树的层平均值,二叉树的层平均值,https://leetcode.cn/problems/average-of-levels-in-binary-tree/,average-of-levels-in-binary-tree,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0600-0699/average-of-levels-in-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0637.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%B1%82%E5%B9%B3%E5%9D%87%E5%80%BC.md,69.8%,简单,1059 -0638,0600-0699,0638. 大礼包,大礼包,https://leetcode.cn/problems/shopping-offers/,shopping-offers,位运算、记忆化搜索、数组、动态规划、回溯、状态压缩,https://algo.itcharge.cn/Solutions/0600-0699/shopping-offers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0638.%20%E5%A4%A7%E7%A4%BC%E5%8C%85.md,62.9%,中等,338 -0639,0600-0699,0639. 解码方法 II,解码方法 II,https://leetcode.cn/problems/decode-ways-ii/,decode-ways-ii,字符串、动态规划,https://algo.itcharge.cn/Solutions/0600-0699/decode-ways-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0639.%20%E8%A7%A3%E7%A0%81%E6%96%B9%E6%B3%95%20II.md,37.4%,困难,322 -0640,0600-0699,0640. 求解方程,求解方程,https://leetcode.cn/problems/solve-the-equation/,solve-the-equation,数学、字符串、模拟,https://algo.itcharge.cn/Solutions/0600-0699/solve-the-equation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0640.%20%E6%B1%82%E8%A7%A3%E6%96%B9%E7%A8%8B.md,44.6%,中等,711 -0641,0600-0699,0641. 设计循环双端队列,设计循环双端队列,https://leetcode.cn/problems/design-circular-deque/,design-circular-deque,设计、队列、数组、链表,https://algo.itcharge.cn/Solutions/0600-0699/design-circular-deque/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0641.%20%E8%AE%BE%E8%AE%A1%E5%BE%AA%E7%8E%AF%E5%8F%8C%E7%AB%AF%E9%98%9F%E5%88%97.md,57.1%,中等,647 -0642,0600-0699,0642. 设计搜索自动补全系统,设计搜索自动补全系统,https://leetcode.cn/problems/design-search-autocomplete-system/,design-search-autocomplete-system,设计、字典树、字符串、数据流,https://algo.itcharge.cn/Solutions/0600-0699/design-search-autocomplete-system/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0642.%20%E8%AE%BE%E8%AE%A1%E6%90%9C%E7%B4%A2%E8%87%AA%E5%8A%A8%E8%A1%A5%E5%85%A8%E7%B3%BB%E7%BB%9F.md,56.1%,困难,91 -0643,0600-0699,0643. 子数组最大平均数 I,子数组最大平均数 I,https://leetcode.cn/problems/maximum-average-subarray-i/,maximum-average-subarray-i,数组、滑动窗口,https://algo.itcharge.cn/Solutions/0600-0699/maximum-average-subarray-i/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0643.%20%E5%AD%90%E6%95%B0%E7%BB%84%E6%9C%80%E5%A4%A7%E5%B9%B3%E5%9D%87%E6%95%B0%20I.md,43.4%,简单,912 -0644,0600-0699,0644. 子数组最大平均数 II,子数组最大平均数 II,https://leetcode.cn/problems/maximum-average-subarray-ii/,maximum-average-subarray-ii,数组、二分查找、前缀和,https://algo.itcharge.cn/Solutions/0600-0699/maximum-average-subarray-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0644.%20%E5%AD%90%E6%95%B0%E7%BB%84%E6%9C%80%E5%A4%A7%E5%B9%B3%E5%9D%87%E6%95%B0%20II.md,44.4%,困难,41 -0645,0600-0699,0645. 错误的集合,错误的集合,https://leetcode.cn/problems/set-mismatch/,set-mismatch,位运算、数组、哈希表、排序,https://algo.itcharge.cn/Solutions/0600-0699/set-mismatch/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0645.%20%E9%94%99%E8%AF%AF%E7%9A%84%E9%9B%86%E5%90%88.md,39.7%,简单,1049 -0646,0600-0699,0646. 最长数对链,最长数对链,https://leetcode.cn/problems/maximum-length-of-pair-chain/,maximum-length-of-pair-chain,贪心、数组、动态规划、排序,https://algo.itcharge.cn/Solutions/0600-0699/maximum-length-of-pair-chain/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0646.%20%E6%9C%80%E9%95%BF%E6%95%B0%E5%AF%B9%E9%93%BE.md,62.3%,中等,649 -0647,0600-0699,0647. 回文子串,回文子串,https://leetcode.cn/problems/palindromic-substrings/,palindromic-substrings,字符串、动态规划,https://algo.itcharge.cn/Solutions/0600-0699/palindromic-substrings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0647.%20%E5%9B%9E%E6%96%87%E5%AD%90%E4%B8%B2.md,66.9%,中等,1716 -0648,0600-0699,0648. 单词替换,单词替换,https://leetcode.cn/problems/replace-words/,replace-words,字典树、数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/0600-0699/replace-words/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0648.%20%E5%8D%95%E8%AF%8D%E6%9B%BF%E6%8D%A2.md,64.0%,中等,823 -0649,0600-0699,0649. Dota2 参议院,Dota2 参议院,https://leetcode.cn/problems/dota2-senate/,dota2-senate,贪心、队列、字符串,https://algo.itcharge.cn/Solutions/0600-0699/dota2-senate/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0649.%20Dota2%20%E5%8F%82%E8%AE%AE%E9%99%A2.md,48.2%,中等,417 -0650,0600-0699,0650. 只有两个键的键盘,只有两个键的键盘,https://leetcode.cn/problems/2-keys-keyboard/,2-keys-keyboard,数学、动态规划,https://algo.itcharge.cn/Solutions/0600-0699/2-keys-keyboard/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0650.%20%E5%8F%AA%E6%9C%89%E4%B8%A4%E4%B8%AA%E9%94%AE%E7%9A%84%E9%94%AE%E7%9B%98.md,57.7%,中等,788 -0651,0600-0699,0651. 4键键盘,4键键盘,https://leetcode.cn/problems/4-keys-keyboard/,4-keys-keyboard,数学、动态规划,https://algo.itcharge.cn/Solutions/0600-0699/4-keys-keyboard/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0651.%204%E9%94%AE%E9%94%AE%E7%9B%98.md,59.7%,中等,98 -0652,0600-0699,0652. 寻找重复的子树,寻找重复的子树,https://leetcode.cn/problems/find-duplicate-subtrees/,find-duplicate-subtrees,树、深度优先搜索、哈希表、二叉树,https://algo.itcharge.cn/Solutions/0600-0699/find-duplicate-subtrees/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0652.%20%E5%AF%BB%E6%89%BE%E9%87%8D%E5%A4%8D%E7%9A%84%E5%AD%90%E6%A0%91.md,61.3%,中等,645 -0653,0600-0699,0653. 两数之和 IV - 输入二叉搜索树,两数之和 IV - 输入二叉搜索树,https://leetcode.cn/problems/two-sum-iv-input-is-a-bst/,two-sum-iv-input-is-a-bst,树、深度优先搜索、广度优先搜索、二叉搜索树、哈希表、双指针、二叉树,https://algo.itcharge.cn/Solutions/0600-0699/two-sum-iv-input-is-a-bst/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0653.%20%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C%20IV%20-%20%E8%BE%93%E5%85%A5%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md,63.5%,简单,985 -0654,0600-0699,0654. 最大二叉树,最大二叉树,https://leetcode.cn/problems/maximum-binary-tree/,maximum-binary-tree,栈、树、数组、分治、二叉树、单调栈,https://algo.itcharge.cn/Solutions/0600-0699/maximum-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0654.%20%E6%9C%80%E5%A4%A7%E4%BA%8C%E5%8F%89%E6%A0%91.md,82.6%,中等,1602 -0655,0600-0699,0655. 输出二叉树,输出二叉树,https://leetcode.cn/problems/print-binary-tree/,print-binary-tree,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0600-0699/print-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0655.%20%E8%BE%93%E5%87%BA%E4%BA%8C%E5%8F%89%E6%A0%91.md,69.7%,中等,510 -0656,0600-0699,0656. 金币路径,金币路径,https://leetcode.cn/problems/coin-path/,coin-path,数组、动态规划,https://algo.itcharge.cn/Solutions/0600-0699/coin-path/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0656.%20%E9%87%91%E5%B8%81%E8%B7%AF%E5%BE%84.md,34.3%,困难,35 -0657,0600-0699,0657. 机器人能否返回原点,机器人能否返回原点,https://leetcode.cn/problems/robot-return-to-origin/,robot-return-to-origin,字符串、模拟,https://algo.itcharge.cn/Solutions/0600-0699/robot-return-to-origin/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0657.%20%E6%9C%BA%E5%99%A8%E4%BA%BA%E8%83%BD%E5%90%A6%E8%BF%94%E5%9B%9E%E5%8E%9F%E7%82%B9.md,79.0%,简单,835 -0658,0600-0699,0658. 找到 K 个最接近的元素,找到 K 个最接近的元素,https://leetcode.cn/problems/find-k-closest-elements/,find-k-closest-elements,数组、双指针、二分查找、排序、滑动窗口、堆（优先队列）,https://algo.itcharge.cn/Solutions/0600-0699/find-k-closest-elements/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0658.%20%E6%89%BE%E5%88%B0%20K%20%E4%B8%AA%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9A%84%E5%85%83%E7%B4%A0.md,47.9%,中等,827 -0659,0600-0699,0659. 分割数组为连续子序列,分割数组为连续子序列,https://leetcode.cn/problems/split-array-into-consecutive-subsequences/,split-array-into-consecutive-subsequences,贪心、数组、哈希表、堆（优先队列）,https://algo.itcharge.cn/Solutions/0600-0699/split-array-into-consecutive-subsequences/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0659.%20%E5%88%86%E5%89%B2%E6%95%B0%E7%BB%84%E4%B8%BA%E8%BF%9E%E7%BB%AD%E5%AD%90%E5%BA%8F%E5%88%97.md,54.7%,中等,389 -0660,0600-0699,0660. 移除 9,移除 9,https://leetcode.cn/problems/remove-9/,remove-9,数学,https://algo.itcharge.cn/Solutions/0600-0699/remove-9/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0660.%20%E7%A7%BB%E9%99%A4%209.md,65.0%,困难,40 -0661,0600-0699,0661. 图片平滑器,图片平滑器,https://leetcode.cn/problems/image-smoother/,image-smoother,数组、矩阵,https://algo.itcharge.cn/Solutions/0600-0699/image-smoother/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0661.%20%E5%9B%BE%E7%89%87%E5%B9%B3%E6%BB%91%E5%99%A8.md,64.2%,简单,571 -0662,0600-0699,0662. 二叉树最大宽度,二叉树最大宽度,https://leetcode.cn/problems/maximum-width-of-binary-tree/,maximum-width-of-binary-tree,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0600-0699/maximum-width-of-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0662.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E6%9C%80%E5%A4%A7%E5%AE%BD%E5%BA%A6.md,43.6%,中等,830 -0663,0600-0699,0663. 均匀树划分,均匀树划分,https://leetcode.cn/problems/equal-tree-partition/,equal-tree-partition,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0600-0699/equal-tree-partition/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0663.%20%E5%9D%87%E5%8C%80%E6%A0%91%E5%88%92%E5%88%86.md,46.0%,中等,59 -0664,0600-0699,0664. 奇怪的打印机,奇怪的打印机,https://leetcode.cn/problems/strange-printer/,strange-printer,字符串、动态规划,https://algo.itcharge.cn/Solutions/0600-0699/strange-printer/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0664.%20%E5%A5%87%E6%80%AA%E7%9A%84%E6%89%93%E5%8D%B0%E6%9C%BA.md,65.3%,困难,236 -0665,0600-0699,0665. 非递减数列,非递减数列,https://leetcode.cn/problems/non-decreasing-array/,non-decreasing-array,数组,https://algo.itcharge.cn/Solutions/0600-0699/non-decreasing-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0665.%20%E9%9D%9E%E9%80%92%E5%87%8F%E6%95%B0%E5%88%97.md,27.7%,中等,1195 -0666,0600-0699,0666. 路径总和 IV,路径总和 IV,https://leetcode.cn/problems/path-sum-iv/,path-sum-iv,树、深度优先搜索、数组、二叉树,https://algo.itcharge.cn/Solutions/0600-0699/path-sum-iv/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0666.%20%E8%B7%AF%E5%BE%84%E6%80%BB%E5%92%8C%20IV.md,62.7%,中等,110 -0667,0600-0699,0667. 优美的排列 II,优美的排列 II,https://leetcode.cn/problems/beautiful-arrangement-ii/,beautiful-arrangement-ii,数组、数学,https://algo.itcharge.cn/Solutions/0600-0699/beautiful-arrangement-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0667.%20%E4%BC%98%E7%BE%8E%E7%9A%84%E6%8E%92%E5%88%97%20II.md,66.7%,中等,519 -0668,0600-0699,0668. 乘法表中第k小的数,乘法表中第k小的数,https://leetcode.cn/problems/kth-smallest-number-in-multiplication-table/,kth-smallest-number-in-multiplication-table,数学、二分查找,https://algo.itcharge.cn/Solutions/0600-0699/kth-smallest-number-in-multiplication-table/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0668.%20%E4%B9%98%E6%B3%95%E8%A1%A8%E4%B8%AD%E7%AC%ACk%E5%B0%8F%E7%9A%84%E6%95%B0.md,58.6%,困难,278 -0669,0600-0699,0669. 修剪二叉搜索树,修剪二叉搜索树,https://leetcode.cn/problems/trim-a-binary-search-tree/,trim-a-binary-search-tree,树、深度优先搜索、二叉搜索树、二叉树,https://algo.itcharge.cn/Solutions/0600-0699/trim-a-binary-search-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0669.%20%E4%BF%AE%E5%89%AA%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md,67.5%,中等,933 -0670,0600-0699,0670. 最大交换,最大交换,https://leetcode.cn/problems/maximum-swap/,maximum-swap,贪心、数学,https://algo.itcharge.cn/Solutions/0600-0699/maximum-swap/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0670.%20%E6%9C%80%E5%A4%A7%E4%BA%A4%E6%8D%A2.md,47.9%,中等,936 -0671,0600-0699,0671. 二叉树中第二小的节点,二叉树中第二小的节点,https://leetcode.cn/problems/second-minimum-node-in-a-binary-tree/,second-minimum-node-in-a-binary-tree,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0600-0699/second-minimum-node-in-a-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0671.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E7%AC%AC%E4%BA%8C%E5%B0%8F%E7%9A%84%E8%8A%82%E7%82%B9.md,48.0%,简单,862 -0672,0600-0699,0672. 灯泡开关 Ⅱ,灯泡开关 Ⅱ,https://leetcode.cn/problems/bulb-switcher-ii/,bulb-switcher-ii,位运算、深度优先搜索、广度优先搜索、数学,https://algo.itcharge.cn/Solutions/0600-0699/bulb-switcher-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0672.%20%E7%81%AF%E6%B3%A1%E5%BC%80%E5%85%B3%20%E2%85%A1.md,60.8%,中等,263 -0673,0600-0699,0673. 最长递增子序列的个数,最长递增子序列的个数,https://leetcode.cn/problems/number-of-longest-increasing-subsequence/,number-of-longest-increasing-subsequence,树状数组、线段树、数组、动态规划,https://algo.itcharge.cn/Solutions/0600-0699/number-of-longest-increasing-subsequence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0673.%20%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E4%B8%AA%E6%95%B0.md,44.6%,中等,653 -0674,0600-0699,0674. 最长连续递增序列,最长连续递增序列,https://leetcode.cn/problems/longest-continuous-increasing-subsequence/,longest-continuous-increasing-subsequence,数组,https://algo.itcharge.cn/Solutions/0600-0699/longest-continuous-increasing-subsequence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0674.%20%E6%9C%80%E9%95%BF%E8%BF%9E%E7%BB%AD%E9%80%92%E5%A2%9E%E5%BA%8F%E5%88%97.md,55.6%,简单,1298 -0675,0600-0699,0675. 为高尔夫比赛砍树,为高尔夫比赛砍树,https://leetcode.cn/problems/cut-off-trees-for-golf-event/,cut-off-trees-for-golf-event,广度优先搜索、数组、矩阵、堆（优先队列）,https://algo.itcharge.cn/Solutions/0600-0699/cut-off-trees-for-golf-event/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0675.%20%E4%B8%BA%E9%AB%98%E5%B0%94%E5%A4%AB%E6%AF%94%E8%B5%9B%E7%A0%8D%E6%A0%91.md,52.5%,困难,219 -0676,0600-0699,0676. 实现一个魔法字典,实现一个魔法字典,https://leetcode.cn/problems/implement-magic-dictionary/,implement-magic-dictionary,设计、字典树、哈希表、字符串,https://algo.itcharge.cn/Solutions/0600-0699/implement-magic-dictionary/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0676.%20%E5%AE%9E%E7%8E%B0%E4%B8%80%E4%B8%AA%E9%AD%94%E6%B3%95%E5%AD%97%E5%85%B8.md,65.3%,中等,471 -0677,0600-0699,0677. 键值映射,键值映射,https://leetcode.cn/problems/map-sum-pairs/,map-sum-pairs,设计、字典树、哈希表、字符串,https://algo.itcharge.cn/Solutions/0600-0699/map-sum-pairs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0677.%20%E9%94%AE%E5%80%BC%E6%98%A0%E5%B0%84.md,65.7%,中等,705 -0678,0600-0699,0678. 有效的括号字符串,有效的括号字符串,https://leetcode.cn/problems/valid-parenthesis-string/,valid-parenthesis-string,栈、贪心、字符串、动态规划,https://algo.itcharge.cn/Solutions/0600-0699/valid-parenthesis-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0678.%20%E6%9C%89%E6%95%88%E7%9A%84%E6%8B%AC%E5%8F%B7%E5%AD%97%E7%AC%A6%E4%B8%B2.md,39.3%,中等,671 -0679,0600-0699,0679. 24 点游戏,24 点游戏,https://leetcode.cn/problems/24-game/,24-game,数组、数学、回溯,https://algo.itcharge.cn/Solutions/0600-0699/24-game/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0679.%2024%20%E7%82%B9%E6%B8%B8%E6%88%8F.md,53.8%,困难,362 -0680,0600-0699,0680. 验证回文串 II,验证回文串 II,https://leetcode.cn/problems/valid-palindrome-ii/,valid-palindrome-ii,贪心、双指针、字符串,https://algo.itcharge.cn/Solutions/0600-0699/valid-palindrome-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0680.%20%E9%AA%8C%E8%AF%81%E5%9B%9E%E6%96%87%E4%B8%B2%20II.md,40.0%,简单,1190 -0681,0600-0699,0681. 最近时刻,最近时刻,https://leetcode.cn/problems/next-closest-time/,next-closest-time,字符串、枚举,https://algo.itcharge.cn/Solutions/0600-0699/next-closest-time/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0681.%20%E6%9C%80%E8%BF%91%E6%97%B6%E5%88%BB.md,49.9%,中等,92 -0682,0600-0699,0682. 棒球比赛,棒球比赛,https://leetcode.cn/problems/baseball-game/,baseball-game,栈、数组、模拟,https://algo.itcharge.cn/Solutions/0600-0699/baseball-game/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0682.%20%E6%A3%92%E7%90%83%E6%AF%94%E8%B5%9B.md,71.3%,简单,991 -0683,0600-0699,0683. K 个关闭的灯泡,K 个关闭的灯泡,https://leetcode.cn/problems/k-empty-slots/,k-empty-slots,树状数组、数组、有序集合、滑动窗口,https://algo.itcharge.cn/Solutions/0600-0699/k-empty-slots/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0683.%20K%20%E4%B8%AA%E5%85%B3%E9%97%AD%E7%9A%84%E7%81%AF%E6%B3%A1.md,45.9%,困难,78 -0684,0600-0699,0684. 冗余连接,冗余连接,https://leetcode.cn/problems/redundant-connection/,redundant-connection,深度优先搜索、广度优先搜索、并查集、图,https://algo.itcharge.cn/Solutions/0600-0699/redundant-connection/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0684.%20%E5%86%97%E4%BD%99%E8%BF%9E%E6%8E%A5.md,67.4%,中等,939 -0685,0600-0699,0685. 冗余连接 II,冗余连接 II,https://leetcode.cn/problems/redundant-connection-ii/,redundant-connection-ii,深度优先搜索、广度优先搜索、并查集、图,https://algo.itcharge.cn/Solutions/0600-0699/redundant-connection-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0685.%20%E5%86%97%E4%BD%99%E8%BF%9E%E6%8E%A5%20II.md,42.2%,困难,356 -0686,0600-0699,0686. 重复叠加字符串匹配,重复叠加字符串匹配,https://leetcode.cn/problems/repeated-string-match/,repeated-string-match,字符串、字符串匹配,https://algo.itcharge.cn/Solutions/0600-0699/repeated-string-match/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0686.%20%E9%87%8D%E5%A4%8D%E5%8F%A0%E5%8A%A0%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%8C%B9%E9%85%8D.md,39.8%,中等,642 -0687,0600-0699,0687. 最长同值路径,最长同值路径,https://leetcode.cn/problems/longest-univalue-path/,longest-univalue-path,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0600-0699/longest-univalue-path/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0687.%20%E6%9C%80%E9%95%BF%E5%90%8C%E5%80%BC%E8%B7%AF%E5%BE%84.md,47.7%,中等,671 -0688,0600-0699,0688. 骑士在棋盘上的概率,骑士在棋盘上的概率,https://leetcode.cn/problems/knight-probability-in-chessboard/,knight-probability-in-chessboard,动态规划,https://algo.itcharge.cn/Solutions/0600-0699/knight-probability-in-chessboard/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0688.%20%E9%AA%91%E5%A3%AB%E5%9C%A8%E6%A3%8B%E7%9B%98%E4%B8%8A%E7%9A%84%E6%A6%82%E7%8E%87.md,58.1%,中等,391 -0689,0600-0699,0689. 三个无重叠子数组的最大和,三个无重叠子数组的最大和,https://leetcode.cn/problems/maximum-sum-of-3-non-overlapping-subarrays/,maximum-sum-of-3-non-overlapping-subarrays,数组、动态规划,https://algo.itcharge.cn/Solutions/0600-0699/maximum-sum-of-3-non-overlapping-subarrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0689.%20%E4%B8%89%E4%B8%AA%E6%97%A0%E9%87%8D%E5%8F%A0%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%92%8C.md,56.2%,困难,293 -0690,0600-0699,0690. 员工的重要性,员工的重要性,https://leetcode.cn/problems/employee-importance/,employee-importance,深度优先搜索、广度优先搜索、哈希表,https://algo.itcharge.cn/Solutions/0600-0699/employee-importance/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0690.%20%E5%91%98%E5%B7%A5%E7%9A%84%E9%87%8D%E8%A6%81%E6%80%A7.md,65.7%,中等,668 -0691,0600-0699,0691. 贴纸拼词,贴纸拼词,https://leetcode.cn/problems/stickers-to-spell-word/,stickers-to-spell-word,位运算、数组、字符串、动态规划、回溯、状态压缩,https://algo.itcharge.cn/Solutions/0600-0699/stickers-to-spell-word/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0691.%20%E8%B4%B4%E7%BA%B8%E6%8B%BC%E8%AF%8D.md,58.9%,困难,207 -0692,0600-0699,0692. 前K个高频单词,前K个高频单词,https://leetcode.cn/problems/top-k-frequent-words/,top-k-frequent-words,字典树、哈希表、字符串、桶排序、计数、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/0600-0699/top-k-frequent-words/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0692.%20%E5%89%8DK%E4%B8%AA%E9%AB%98%E9%A2%91%E5%8D%95%E8%AF%8D.md,56.2%,中等,1066 -0693,0600-0699,0693. 交替位二进制数,交替位二进制数,https://leetcode.cn/problems/binary-number-with-alternating-bits/,binary-number-with-alternating-bits,位运算,https://algo.itcharge.cn/Solutions/0600-0699/binary-number-with-alternating-bits/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0693.%20%E4%BA%A4%E6%9B%BF%E4%BD%8D%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%95%B0.md,65.1%,简单,840 -0694,0600-0699,0694. 不同岛屿的数量,不同岛屿的数量,https://leetcode.cn/problems/number-of-distinct-islands/,number-of-distinct-islands,深度优先搜索、广度优先搜索、并查集、哈希表、哈希函数,https://algo.itcharge.cn/Solutions/0600-0699/number-of-distinct-islands/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0694.%20%E4%B8%8D%E5%90%8C%E5%B2%9B%E5%B1%BF%E7%9A%84%E6%95%B0%E9%87%8F.md,57.6%,中等,173 -0695,0600-0699,0695. 岛屿的最大面积,岛屿的最大面积,https://leetcode.cn/problems/max-area-of-island/,max-area-of-island,深度优先搜索、广度优先搜索、并查集、数组、矩阵,https://algo.itcharge.cn/Solutions/0600-0699/max-area-of-island/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0695.%20%E5%B2%9B%E5%B1%BF%E7%9A%84%E6%9C%80%E5%A4%A7%E9%9D%A2%E7%A7%AF.md,68.0%,中等,2524 -0696,0600-0699,0696. 计数二进制子串,计数二进制子串,https://leetcode.cn/problems/count-binary-substrings/,count-binary-substrings,双指针、字符串,https://algo.itcharge.cn/Solutions/0600-0699/count-binary-substrings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0696.%20%E8%AE%A1%E6%95%B0%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%AD%90%E4%B8%B2.md,63.7%,简单,630 -0697,0600-0699,0697. 数组的度,数组的度,https://leetcode.cn/problems/degree-of-an-array/,degree-of-an-array,数组、哈希表,https://algo.itcharge.cn/Solutions/0600-0699/degree-of-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0697.%20%E6%95%B0%E7%BB%84%E7%9A%84%E5%BA%A6.md,59.3%,简单,1136 -0698,0600-0699,0698. 划分为k个相等的子集,划分为k个相等的子集,https://leetcode.cn/problems/partition-to-k-equal-sum-subsets/,partition-to-k-equal-sum-subsets,位运算、记忆化搜索、数组、动态规划、回溯、状态压缩,https://algo.itcharge.cn/Solutions/0600-0699/partition-to-k-equal-sum-subsets/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0698.%20%E5%88%92%E5%88%86%E4%B8%BAk%E4%B8%AA%E7%9B%B8%E7%AD%89%E7%9A%84%E5%AD%90%E9%9B%86.md,42.1%,中等,1398 -0699,0600-0699,0699. 掉落的方块,掉落的方块,https://leetcode.cn/problems/falling-squares/,falling-squares,线段树、数组、有序集合,https://algo.itcharge.cn/Solutions/0600-0699/falling-squares/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0699.%20%E6%8E%89%E8%90%BD%E7%9A%84%E6%96%B9%E5%9D%97.md,54.8%,困难,240 -0700,0700-0799,0700. 二叉搜索树中的搜索,二叉搜索树中的搜索,https://leetcode.cn/problems/search-in-a-binary-search-tree/,search-in-a-binary-search-tree,树、二叉搜索树、二叉树,https://algo.itcharge.cn/Solutions/0700-0799/search-in-a-binary-search-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0700.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E6%90%9C%E7%B4%A2.md,77.6%,简单,1861 -0701,0700-0799,0701. 二叉搜索树中的插入操作,二叉搜索树中的插入操作,https://leetcode.cn/problems/insert-into-a-binary-search-tree/,insert-into-a-binary-search-tree,树、二叉搜索树、二叉树,https://algo.itcharge.cn/Solutions/0700-0799/insert-into-a-binary-search-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0701.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E6%8F%92%E5%85%A5%E6%93%8D%E4%BD%9C.md,70.8%,中等,1364 -0702,0700-0799,0702. 搜索长度未知的有序数组,搜索长度未知的有序数组,https://leetcode.cn/problems/search-in-a-sorted-array-of-unknown-size/,search-in-a-sorted-array-of-unknown-size,数组、二分查找、交互,https://algo.itcharge.cn/Solutions/0700-0799/search-in-a-sorted-array-of-unknown-size/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0702.%20%E6%90%9C%E7%B4%A2%E9%95%BF%E5%BA%A6%E6%9C%AA%E7%9F%A5%E7%9A%84%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84.md,74.8%,中等,121 -0703,0700-0799,0703. 数据流中的第 K 大元素,数据流中的第 K 大元素,https://leetcode.cn/problems/kth-largest-element-in-a-stream/,kth-largest-element-in-a-stream,树、设计、二叉搜索树、二叉树、数据流、堆（优先队列）,https://algo.itcharge.cn/Solutions/0700-0799/kth-largest-element-in-a-stream/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0703.%20%E6%95%B0%E6%8D%AE%E6%B5%81%E4%B8%AD%E7%9A%84%E7%AC%AC%20K%20%E5%A4%A7%E5%85%83%E7%B4%A0.md,52.5%,简单,805 -0704,0700-0799,0704. 二分查找,二分查找,https://leetcode.cn/problems/binary-search/,binary-search,数组、二分查找,https://algo.itcharge.cn/Solutions/0700-0799/binary-search/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0704.%20%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE.md,54.5%,简单,4941 -0705,0700-0799,0705. 设计哈希集合,设计哈希集合,https://leetcode.cn/problems/design-hashset/,design-hashset,设计、数组、哈希表、链表、哈希函数,https://algo.itcharge.cn/Solutions/0700-0799/design-hashset/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0705.%20%E8%AE%BE%E8%AE%A1%E5%93%88%E5%B8%8C%E9%9B%86%E5%90%88.md,63.3%,简单,620 -0706,0700-0799,0706. 设计哈希映射,设计哈希映射,https://leetcode.cn/problems/design-hashmap/,design-hashmap,设计、数组、哈希表、链表、哈希函数,https://algo.itcharge.cn/Solutions/0700-0799/design-hashmap/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0706.%20%E8%AE%BE%E8%AE%A1%E5%93%88%E5%B8%8C%E6%98%A0%E5%B0%84.md,63.6%,简单,600 -0707,0700-0799,0707. 设计链表,设计链表,https://leetcode.cn/problems/design-linked-list/,design-linked-list,设计、链表,https://algo.itcharge.cn/Solutions/0700-0799/design-linked-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0707.%20%E8%AE%BE%E8%AE%A1%E9%93%BE%E8%A1%A8.md,34.7%,中等,1405 -0708,0700-0799,0708. 循环有序列表的插入,循环有序列表的插入,https://leetcode.cn/problems/insert-into-a-sorted-circular-linked-list/,insert-into-a-sorted-circular-linked-list,链表,https://algo.itcharge.cn/Solutions/0700-0799/insert-into-a-sorted-circular-linked-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0708.%20%E5%BE%AA%E7%8E%AF%E6%9C%89%E5%BA%8F%E5%88%97%E8%A1%A8%E7%9A%84%E6%8F%92%E5%85%A5.md,37.7%,中等,98 -0709,0700-0799,0709. 转换成小写字母,转换成小写字母,https://leetcode.cn/problems/to-lower-case/,to-lower-case,字符串,https://algo.itcharge.cn/Solutions/0700-0799/to-lower-case/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0709.%20%E8%BD%AC%E6%8D%A2%E6%88%90%E5%B0%8F%E5%86%99%E5%AD%97%E6%AF%8D.md,76.8%,简单,916 -0710,0700-0799,0710. 黑名单中的随机数,黑名单中的随机数,https://leetcode.cn/problems/random-pick-with-blacklist/,random-pick-with-blacklist,数组、哈希表、数学、二分查找、排序、随机化,https://algo.itcharge.cn/Solutions/0700-0799/random-pick-with-blacklist/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0710.%20%E9%BB%91%E5%90%8D%E5%8D%95%E4%B8%AD%E7%9A%84%E9%9A%8F%E6%9C%BA%E6%95%B0.md,43.7%,困难,436 -0711,0700-0799,0711. 不同岛屿的数量 II,不同岛屿的数量 II,https://leetcode.cn/problems/number-of-distinct-islands-ii/,number-of-distinct-islands-ii,深度优先搜索、广度优先搜索、并查集、哈希表、哈希函数,https://algo.itcharge.cn/Solutions/0700-0799/number-of-distinct-islands-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0711.%20%E4%B8%8D%E5%90%8C%E5%B2%9B%E5%B1%BF%E7%9A%84%E6%95%B0%E9%87%8F%20II.md,56.0%,困难,47 -0712,0700-0799,0712. 两个字符串的最小ASCII删除和,两个字符串的最小ASCII删除和,https://leetcode.cn/problems/minimum-ascii-delete-sum-for-two-strings/,minimum-ascii-delete-sum-for-two-strings,字符串、动态规划,https://algo.itcharge.cn/Solutions/0700-0799/minimum-ascii-delete-sum-for-two-strings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0712.%20%E4%B8%A4%E4%B8%AA%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%9C%80%E5%B0%8FASCII%E5%88%A0%E9%99%A4%E5%92%8C.md,68.9%,中等,334 -0713,0700-0799,0713. 乘积小于 K 的子数组,乘积小于 K 的子数组,https://leetcode.cn/problems/subarray-product-less-than-k/,subarray-product-less-than-k,数组、滑动窗口,https://algo.itcharge.cn/Solutions/0700-0799/subarray-product-less-than-k/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0713.%20%E4%B9%98%E7%A7%AF%E5%B0%8F%E4%BA%8E%20K%20%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md,49.6%,中等,899 -0714,0700-0799,0714. 买卖股票的最佳时机含手续费,买卖股票的最佳时机含手续费,https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/,best-time-to-buy-and-sell-stock-with-transaction-fee,贪心、数组,https://algo.itcharge.cn/Solutions/0700-0799/best-time-to-buy-and-sell-stock-with-transaction-fee/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0714.%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA%E5%90%AB%E6%89%8B%E7%BB%AD%E8%B4%B9.md,75.2%,中等,1269 -0715,0700-0799,0715. Range 模块,Range 模块,https://leetcode.cn/problems/range-module/,range-module,设计、线段树、有序集合,https://algo.itcharge.cn/Solutions/0700-0799/range-module/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0715.%20Range%20%E6%A8%A1%E5%9D%97.md,52.9%,困难,207 -0716,0700-0799,0716. 最大栈,最大栈,https://leetcode.cn/problems/max-stack/,max-stack,栈、设计、链表、双向链表、有序集合,https://algo.itcharge.cn/Solutions/0700-0799/max-stack/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0716.%20%E6%9C%80%E5%A4%A7%E6%A0%88.md,44.3%,困难,109 -0717,0700-0799,0717. 1 比特与 2 比特字符,1 比特与 2 比特字符,https://leetcode.cn/problems/1-bit-and-2-bit-characters/,1-bit-and-2-bit-characters,数组,https://algo.itcharge.cn/Solutions/0700-0799/1-bit-and-2-bit-characters/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0717.%201%20%E6%AF%94%E7%89%B9%E4%B8%8E%202%20%E6%AF%94%E7%89%B9%E5%AD%97%E7%AC%A6.md,55.3%,简单,827 -0718,0700-0799,0718. 最长重复子数组,最长重复子数组,https://leetcode.cn/problems/maximum-length-of-repeated-subarray/,maximum-length-of-repeated-subarray,数组、二分查找、动态规划、滑动窗口、哈希函数、滚动哈希,https://algo.itcharge.cn/Solutions/0700-0799/maximum-length-of-repeated-subarray/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0718.%20%E6%9C%80%E9%95%BF%E9%87%8D%E5%A4%8D%E5%AD%90%E6%95%B0%E7%BB%84.md,56.9%,中等,1059 -0719,0700-0799,0719. 找出第 K 小的数对距离,找出第 K 小的数对距离,https://leetcode.cn/problems/find-k-th-smallest-pair-distance/,find-k-th-smallest-pair-distance,数组、双指针、二分查找、排序,https://algo.itcharge.cn/Solutions/0700-0799/find-k-th-smallest-pair-distance/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0719.%20%E6%89%BE%E5%87%BA%E7%AC%AC%20K%20%E5%B0%8F%E7%9A%84%E6%95%B0%E5%AF%B9%E8%B7%9D%E7%A6%BB.md,46.7%,困难,273 -0720,0700-0799,0720. 词典中最长的单词,词典中最长的单词,https://leetcode.cn/problems/longest-word-in-dictionary/,longest-word-in-dictionary,字典树、数组、哈希表、字符串、排序,https://algo.itcharge.cn/Solutions/0700-0799/longest-word-in-dictionary/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0720.%20%E8%AF%8D%E5%85%B8%E4%B8%AD%E6%9C%80%E9%95%BF%E7%9A%84%E5%8D%95%E8%AF%8D.md,51.9%,中等,711 -0721,0700-0799,0721. 账户合并,账户合并,https://leetcode.cn/problems/accounts-merge/,accounts-merge,深度优先搜索、广度优先搜索、并查集、数组、字符串,https://algo.itcharge.cn/Solutions/0700-0799/accounts-merge/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0721.%20%E8%B4%A6%E6%88%B7%E5%90%88%E5%B9%B6.md,48.2%,中等,441 -0722,0700-0799,0722. 删除注释,删除注释,https://leetcode.cn/problems/remove-comments/,remove-comments,数组、字符串,https://algo.itcharge.cn/Solutions/0700-0799/remove-comments/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0722.%20%E5%88%A0%E9%99%A4%E6%B3%A8%E9%87%8A.md,34.2%,中等,104 -0723,0700-0799,0723. 粉碎糖果,粉碎糖果,https://leetcode.cn/problems/candy-crush/,candy-crush,数组、双指针、矩阵、模拟,https://algo.itcharge.cn/Solutions/0700-0799/candy-crush/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0723.%20%E7%B2%89%E7%A2%8E%E7%B3%96%E6%9E%9C.md,73.9%,中等,61 -0724,0700-0799,0724. 寻找数组的中心下标,寻找数组的中心下标,https://leetcode.cn/problems/find-pivot-index/,find-pivot-index,数组、前缀和,https://algo.itcharge.cn/Solutions/0700-0799/find-pivot-index/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0724.%20%E5%AF%BB%E6%89%BE%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%AD%E5%BF%83%E4%B8%8B%E6%A0%87.md,51.5%,简单,1549 -0725,0700-0799,0725. 分隔链表,分隔链表,https://leetcode.cn/problems/split-linked-list-in-parts/,split-linked-list-in-parts,链表,https://algo.itcharge.cn/Solutions/0700-0799/split-linked-list-in-parts/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0725.%20%E5%88%86%E9%9A%94%E9%93%BE%E8%A1%A8.md,60.5%,中等,748 -0726,0700-0799,0726. 原子的数量,原子的数量,https://leetcode.cn/problems/number-of-atoms/,number-of-atoms,栈、哈希表、字符串、排序,https://algo.itcharge.cn/Solutions/0700-0799/number-of-atoms/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0726.%20%E5%8E%9F%E5%AD%90%E7%9A%84%E6%95%B0%E9%87%8F.md,55.2%,困难,476 -0727,0700-0799,0727. 最小窗口子序列,最小窗口子序列,https://leetcode.cn/problems/minimum-window-subsequence/,minimum-window-subsequence,字符串、动态规划、滑动窗口,https://algo.itcharge.cn/Solutions/0700-0799/minimum-window-subsequence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0727.%20%E6%9C%80%E5%B0%8F%E7%AA%97%E5%8F%A3%E5%AD%90%E5%BA%8F%E5%88%97.md,42.4%,困难,81 -0728,0700-0799,0728. 自除数,自除数,https://leetcode.cn/problems/self-dividing-numbers/,self-dividing-numbers,数学,https://algo.itcharge.cn/Solutions/0700-0799/self-dividing-numbers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0728.%20%E8%87%AA%E9%99%A4%E6%95%B0.md,77.2%,简单,753 -0729,0700-0799,0729. 我的日程安排表 I,我的日程安排表 I,https://leetcode.cn/problems/my-calendar-i/,my-calendar-i,设计、线段树、二分查找、有序集合,https://algo.itcharge.cn/Solutions/0700-0799/my-calendar-i/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0729.%20%E6%88%91%E7%9A%84%E6%97%A5%E7%A8%8B%E5%AE%89%E6%8E%92%E8%A1%A8%20I.md,58.4%,中等,442 -0730,0700-0799,0730. 统计不同回文子序列,统计不同回文子序列,https://leetcode.cn/problems/count-different-palindromic-subsequences/,count-different-palindromic-subsequences,字符串、动态规划,https://algo.itcharge.cn/Solutions/0700-0799/count-different-palindromic-subsequences/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0730.%20%E7%BB%9F%E8%AE%A1%E4%B8%8D%E5%90%8C%E5%9B%9E%E6%96%87%E5%AD%90%E5%BA%8F%E5%88%97.md,64.2%,困难,127 -0731,0700-0799,0731. 我的日程安排表 II,我的日程安排表 II,https://leetcode.cn/problems/my-calendar-ii/,my-calendar-ii,设计、线段树、二分查找、有序集合,https://algo.itcharge.cn/Solutions/0700-0799/my-calendar-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0731.%20%E6%88%91%E7%9A%84%E6%97%A5%E7%A8%8B%E5%AE%89%E6%8E%92%E8%A1%A8%20II.md,62.7%,中等,239 -0732,0700-0799,0732. 我的日程安排表 III,我的日程安排表 III,https://leetcode.cn/problems/my-calendar-iii/,my-calendar-iii,设计、线段树、二分查找、有序集合,https://algo.itcharge.cn/Solutions/0700-0799/my-calendar-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0732.%20%E6%88%91%E7%9A%84%E6%97%A5%E7%A8%8B%E5%AE%89%E6%8E%92%E8%A1%A8%20III.md,71.5%,困难,241 -0733,0700-0799,0733. 图像渲染,图像渲染,https://leetcode.cn/problems/flood-fill/,flood-fill,深度优先搜索、广度优先搜索、数组、矩阵,https://algo.itcharge.cn/Solutions/0700-0799/flood-fill/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0733.%20%E5%9B%BE%E5%83%8F%E6%B8%B2%E6%9F%93.md,58.7%,简单,1298 -0734,0700-0799,0734. 句子相似性,句子相似性,https://leetcode.cn/problems/sentence-similarity/,sentence-similarity,数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/0700-0799/sentence-similarity/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0734.%20%E5%8F%A5%E5%AD%90%E7%9B%B8%E4%BC%BC%E6%80%A7.md,46.7%,简单,76 -0735,0700-0799,0735. 行星碰撞,行星碰撞,https://leetcode.cn/problems/asteroid-collision/,asteroid-collision,栈、数组、模拟,https://algo.itcharge.cn/Solutions/0700-0799/asteroid-collision/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0735.%20%E8%A1%8C%E6%98%9F%E7%A2%B0%E6%92%9E.md,42.9%,中等,827 -0736,0700-0799,0736. Lisp 语法解析,Lisp 语法解析,https://leetcode.cn/problems/parse-lisp-expression/,parse-lisp-expression,栈、递归、哈希表、字符串,https://algo.itcharge.cn/Solutions/0700-0799/parse-lisp-expression/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0736.%20Lisp%20%E8%AF%AD%E6%B3%95%E8%A7%A3%E6%9E%90.md,66.4%,困难,156 -0737,0700-0799,0737. 句子相似性 II,句子相似性 II,https://leetcode.cn/problems/sentence-similarity-ii/,sentence-similarity-ii,深度优先搜索、广度优先搜索、并查集、数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/0700-0799/sentence-similarity-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0737.%20%E5%8F%A5%E5%AD%90%E7%9B%B8%E4%BC%BC%E6%80%A7%20II.md,48.4%,中等,110 -0738,0700-0799,0738. 单调递增的数字,单调递增的数字,https://leetcode.cn/problems/monotone-increasing-digits/,monotone-increasing-digits,贪心、数学,https://algo.itcharge.cn/Solutions/0700-0799/monotone-increasing-digits/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0738.%20%E5%8D%95%E8%B0%83%E9%80%92%E5%A2%9E%E7%9A%84%E6%95%B0%E5%AD%97.md,50.3%,中等,957 -0739,0700-0799,0739. 每日温度,每日温度,https://leetcode.cn/problems/daily-temperatures/,daily-temperatures,栈、数组、单调栈,https://algo.itcharge.cn/Solutions/0700-0799/daily-temperatures/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0739.%20%E6%AF%8F%E6%97%A5%E6%B8%A9%E5%BA%A6.md,68.9%,中等,2682 -0740,0700-0799,0740. 删除并获得点数,删除并获得点数,https://leetcode.cn/problems/delete-and-earn/,delete-and-earn,数组、哈希表、动态规划,https://algo.itcharge.cn/Solutions/0700-0799/delete-and-earn/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0740.%20%E5%88%A0%E9%99%A4%E5%B9%B6%E8%8E%B7%E5%BE%97%E7%82%B9%E6%95%B0.md,62.0%,中等,976 -0741,0700-0799,0741. 摘樱桃,摘樱桃,https://leetcode.cn/problems/cherry-pickup/,cherry-pickup,数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/0700-0799/cherry-pickup/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0741.%20%E6%91%98%E6%A8%B1%E6%A1%83.md,50.5%,困难,144 -0742,0700-0799,0742. 二叉树最近的叶节点,二叉树最近的叶节点,https://leetcode.cn/problems/closest-leaf-in-a-binary-tree/,closest-leaf-in-a-binary-tree,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0700-0799/closest-leaf-in-a-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0742.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E6%9C%80%E8%BF%91%E7%9A%84%E5%8F%B6%E8%8A%82%E7%82%B9.md,48.9%,中等,81 -0743,0700-0799,0743. 网络延迟时间,网络延迟时间,https://leetcode.cn/problems/network-delay-time/,network-delay-time,深度优先搜索、广度优先搜索、图、最短路、堆（优先队列）,https://algo.itcharge.cn/Solutions/0700-0799/network-delay-time/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0743.%20%E7%BD%91%E7%BB%9C%E5%BB%B6%E8%BF%9F%E6%97%B6%E9%97%B4.md,55.6%,中等,874 -0744,0700-0799,0744. 寻找比目标字母大的最小字母,寻找比目标字母大的最小字母,https://leetcode.cn/problems/find-smallest-letter-greater-than-target/,find-smallest-letter-greater-than-target,数组、二分查找,https://algo.itcharge.cn/Solutions/0700-0799/find-smallest-letter-greater-than-target/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0744.%20%E5%AF%BB%E6%89%BE%E6%AF%94%E7%9B%AE%E6%A0%87%E5%AD%97%E6%AF%8D%E5%A4%A7%E7%9A%84%E6%9C%80%E5%B0%8F%E5%AD%97%E6%AF%8D.md,48.3%,简单,990 -0745,0700-0799,0745. 前缀和后缀搜索,前缀和后缀搜索,https://leetcode.cn/problems/prefix-and-suffix-search/,prefix-and-suffix-search,设计、字典树、哈希表、字符串,https://algo.itcharge.cn/Solutions/0700-0799/prefix-and-suffix-search/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0745.%20%E5%89%8D%E7%BC%80%E5%92%8C%E5%90%8E%E7%BC%80%E6%90%9C%E7%B4%A2.md,43.9%,困难,256 -0746,0700-0799,0746. 使用最小花费爬楼梯,使用最小花费爬楼梯,https://leetcode.cn/problems/min-cost-climbing-stairs/,min-cost-climbing-stairs,数组、动态规划,https://algo.itcharge.cn/Solutions/0700-0799/min-cost-climbing-stairs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0746.%20%E4%BD%BF%E7%94%A8%E6%9C%80%E5%B0%8F%E8%8A%B1%E8%B4%B9%E7%88%AC%E6%A5%BC%E6%A2%AF.md,64.7%,简单,2409 -0747,0700-0799,0747. 至少是其他数字两倍的最大数,至少是其他数字两倍的最大数,https://leetcode.cn/problems/largest-number-at-least-twice-of-others/,largest-number-at-least-twice-of-others,数组、排序,https://algo.itcharge.cn/Solutions/0700-0799/largest-number-at-least-twice-of-others/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0747.%20%E8%87%B3%E5%B0%91%E6%98%AF%E5%85%B6%E4%BB%96%E6%95%B0%E5%AD%97%E4%B8%A4%E5%80%8D%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0.md,46.3%,简单,936 -0748,0700-0799,0748. 最短补全词,最短补全词,https://leetcode.cn/problems/shortest-completing-word/,shortest-completing-word,数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/0700-0799/shortest-completing-word/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0748.%20%E6%9C%80%E7%9F%AD%E8%A1%A5%E5%85%A8%E8%AF%8D.md,66.7%,简单,572 -0749,0700-0799,0749. 隔离病毒,隔离病毒,https://leetcode.cn/problems/contain-virus/,contain-virus,深度优先搜索、广度优先搜索、数组、矩阵、模拟,https://algo.itcharge.cn/Solutions/0700-0799/contain-virus/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0749.%20%E9%9A%94%E7%A6%BB%E7%97%85%E6%AF%92.md,69.1%,困难,140 -0750,0700-0799,0750. 角矩形的数量,角矩形的数量,https://leetcode.cn/problems/number-of-corner-rectangles/,number-of-corner-rectangles,数组、数学、动态规划、矩阵,https://algo.itcharge.cn/Solutions/0700-0799/number-of-corner-rectangles/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0750.%20%E8%A7%92%E7%9F%A9%E5%BD%A2%E7%9A%84%E6%95%B0%E9%87%8F.md,73.1%,中等,61 -0751,0700-0799,0751. IP 到 CIDR,IP 到 CIDR,https://leetcode.cn/problems/ip-to-cidr/,ip-to-cidr,位运算、字符串,https://algo.itcharge.cn/Solutions/0700-0799/ip-to-cidr/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0751.%20IP%20%E5%88%B0%20CIDR.md,48.3%,中等,38 -0752,0700-0799,0752. 打开转盘锁,打开转盘锁,https://leetcode.cn/problems/open-the-lock/,open-the-lock,广度优先搜索、数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/0700-0799/open-the-lock/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0752.%20%E6%89%93%E5%BC%80%E8%BD%AC%E7%9B%98%E9%94%81.md,52.7%,中等,1214 -0753,0700-0799,0753. 破解保险箱,破解保险箱,https://leetcode.cn/problems/cracking-the-safe/,cracking-the-safe,深度优先搜索、图、欧拉回路,https://algo.itcharge.cn/Solutions/0700-0799/cracking-the-safe/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0753.%20%E7%A0%B4%E8%A7%A3%E4%BF%9D%E9%99%A9%E7%AE%B1.md,74.9%,困难,152 -0754,0700-0799,0754. 到达终点数字,到达终点数字,https://leetcode.cn/problems/reach-a-number/,reach-a-number,数学、二分查找,https://algo.itcharge.cn/Solutions/0700-0799/reach-a-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0754.%20%E5%88%B0%E8%BE%BE%E7%BB%88%E7%82%B9%E6%95%B0%E5%AD%97.md,51.4%,中等,404 -0755,0700-0799,0755. 倒水,倒水,https://leetcode.cn/problems/pour-water/,pour-water,数组、模拟,https://algo.itcharge.cn/Solutions/0700-0799/pour-water/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0755.%20%E5%80%92%E6%B0%B4.md,48.2%,中等,43 -0756,0700-0799,0756. 金字塔转换矩阵,金字塔转换矩阵,https://leetcode.cn/problems/pyramid-transition-matrix/,pyramid-transition-matrix,位运算、深度优先搜索、广度优先搜索,https://algo.itcharge.cn/Solutions/0700-0799/pyramid-transition-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0756.%20%E9%87%91%E5%AD%97%E5%A1%94%E8%BD%AC%E6%8D%A2%E7%9F%A9%E9%98%B5.md,52.2%,中等,104 -0757,0700-0799,0757. 设置交集大小至少为2,设置交集大小至少为2,https://leetcode.cn/problems/set-intersection-size-at-least-two/,set-intersection-size-at-least-two,贪心、数组、排序,https://algo.itcharge.cn/Solutions/0700-0799/set-intersection-size-at-least-two/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0757.%20%E8%AE%BE%E7%BD%AE%E4%BA%A4%E9%9B%86%E5%A4%A7%E5%B0%8F%E8%87%B3%E5%B0%91%E4%B8%BA2.md,56.1%,困难,196 -0758,0700-0799,0758. 字符串中的加粗单词,字符串中的加粗单词,https://leetcode.cn/problems/bold-words-in-string/,bold-words-in-string,字典树、数组、哈希表、字符串、字符串匹配,https://algo.itcharge.cn/Solutions/0700-0799/bold-words-in-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0758.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%8A%A0%E7%B2%97%E5%8D%95%E8%AF%8D.md,48.3%,中等,85 -0759,0700-0799,0759. 员工空闲时间,员工空闲时间,https://leetcode.cn/problems/employee-free-time/,employee-free-time,数组、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/0700-0799/employee-free-time/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0759.%20%E5%91%98%E5%B7%A5%E7%A9%BA%E9%97%B2%E6%97%B6%E9%97%B4.md,70.2%,困难,77 -0760,0700-0799,0760. 找出变位映射,找出变位映射,https://leetcode.cn/problems/find-anagram-mappings/,find-anagram-mappings,数组、哈希表,https://algo.itcharge.cn/Solutions/0700-0799/find-anagram-mappings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0760.%20%E6%89%BE%E5%87%BA%E5%8F%98%E4%BD%8D%E6%98%A0%E5%B0%84.md,84.4%,简单,131 -0761,0700-0799,0761. 特殊的二进制序列,特殊的二进制序列,https://leetcode.cn/problems/special-binary-string/,special-binary-string,递归、字符串,https://algo.itcharge.cn/Solutions/0700-0799/special-binary-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0761.%20%E7%89%B9%E6%AE%8A%E7%9A%84%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%BA%8F%E5%88%97.md,75.2%,困难,150 -0762,0700-0799,0762. 二进制表示中质数个计算置位,二进制表示中质数个计算置位,https://leetcode.cn/problems/prime-number-of-set-bits-in-binary-representation/,prime-number-of-set-bits-in-binary-representation,位运算、数学,https://algo.itcharge.cn/Solutions/0700-0799/prime-number-of-set-bits-in-binary-representation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0762.%20%E4%BA%8C%E8%BF%9B%E5%88%B6%E8%A1%A8%E7%A4%BA%E4%B8%AD%E8%B4%A8%E6%95%B0%E4%B8%AA%E8%AE%A1%E7%AE%97%E7%BD%AE%E4%BD%8D.md,75.3%,简单,497 -0763,0700-0799,0763. 划分字母区间,划分字母区间,https://leetcode.cn/problems/partition-labels/,partition-labels,贪心、哈希表、双指针、字符串,https://algo.itcharge.cn/Solutions/0700-0799/partition-labels/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0763.%20%E5%88%92%E5%88%86%E5%AD%97%E6%AF%8D%E5%8C%BA%E9%97%B4.md,76.8%,中等,1613 -0764,0700-0799,0764. 最大加号标志,最大加号标志,https://leetcode.cn/problems/largest-plus-sign/,largest-plus-sign,数组、动态规划,https://algo.itcharge.cn/Solutions/0700-0799/largest-plus-sign/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0764.%20%E6%9C%80%E5%A4%A7%E5%8A%A0%E5%8F%B7%E6%A0%87%E5%BF%97.md,54.2%,中等,346 -0765,0700-0799,0765. 情侣牵手,情侣牵手,https://leetcode.cn/problems/couples-holding-hands/,couples-holding-hands,贪心、深度优先搜索、广度优先搜索、并查集、图,https://algo.itcharge.cn/Solutions/0700-0799/couples-holding-hands/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0765.%20%E6%83%85%E4%BE%A3%E7%89%B5%E6%89%8B.md,65.9%,困难,549 -0766,0700-0799,0766. 托普利茨矩阵,托普利茨矩阵,https://leetcode.cn/problems/toeplitz-matrix/,toeplitz-matrix,数组、矩阵,https://algo.itcharge.cn/Solutions/0700-0799/toeplitz-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0766.%20%E6%89%98%E6%99%AE%E5%88%A9%E8%8C%A8%E7%9F%A9%E9%98%B5.md,70.3%,简单,772 -0767,0700-0799,0767. 重构字符串,重构字符串,https://leetcode.cn/problems/reorganize-string/,reorganize-string,贪心、哈希表、字符串、计数、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/0700-0799/reorganize-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0767.%20%E9%87%8D%E6%9E%84%E5%AD%97%E7%AC%A6%E4%B8%B2.md,48.4%,中等,620 -0768,0700-0799,0768. 最多能完成排序的块 II,最多能完成排序的块 II,https://leetcode.cn/problems/max-chunks-to-make-sorted-ii/,max-chunks-to-make-sorted-ii,栈、贪心、数组、排序、单调栈,https://algo.itcharge.cn/Solutions/0700-0799/max-chunks-to-make-sorted-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0768.%20%E6%9C%80%E5%A4%9A%E8%83%BD%E5%AE%8C%E6%88%90%E6%8E%92%E5%BA%8F%E7%9A%84%E5%9D%97%20II.md,58.7%,困难,386 -0769,0700-0799,0769. 最多能完成排序的块,最多能完成排序的块,https://leetcode.cn/problems/max-chunks-to-make-sorted/,max-chunks-to-make-sorted,栈、贪心、数组、排序、单调栈,https://algo.itcharge.cn/Solutions/0700-0799/max-chunks-to-make-sorted/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0769.%20%E6%9C%80%E5%A4%9A%E8%83%BD%E5%AE%8C%E6%88%90%E6%8E%92%E5%BA%8F%E7%9A%84%E5%9D%97.md,59.2%,中等,752 -0770,0700-0799,0770. 基本计算器 IV,基本计算器 IV,https://leetcode.cn/problems/basic-calculator-iv/,basic-calculator-iv,栈、递归、哈希表、数学、字符串,https://algo.itcharge.cn/Solutions/0700-0799/basic-calculator-iv/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0770.%20%E5%9F%BA%E6%9C%AC%E8%AE%A1%E7%AE%97%E5%99%A8%20IV.md,56.0%,困难,40 -0771,0700-0799,0771. 宝石与石头,宝石与石头,https://leetcode.cn/problems/jewels-and-stones/,jewels-and-stones,哈希表、字符串,https://algo.itcharge.cn/Solutions/0700-0799/jewels-and-stones/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0771.%20%E5%AE%9D%E7%9F%B3%E4%B8%8E%E7%9F%B3%E5%A4%B4.md,85.1%,简单,1437 -0772,0700-0799,0772. 基本计算器 III,基本计算器 III,https://leetcode.cn/problems/basic-calculator-iii/,basic-calculator-iii,栈、递归、数学、字符串,https://algo.itcharge.cn/Solutions/0700-0799/basic-calculator-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0772.%20%E5%9F%BA%E6%9C%AC%E8%AE%A1%E7%AE%97%E5%99%A8%20III.md,53.0%,困难,203 -0773,0700-0799,0773. 滑动谜题,滑动谜题,https://leetcode.cn/problems/sliding-puzzle/,sliding-puzzle,广度优先搜索、数组、矩阵,https://algo.itcharge.cn/Solutions/0700-0799/sliding-puzzle/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0773.%20%E6%BB%91%E5%8A%A8%E8%B0%9C%E9%A2%98.md,70.2%,困难,501 -0774,0700-0799,0774. 最小化去加油站的最大距离,最小化去加油站的最大距离,https://leetcode.cn/problems/minimize-max-distance-to-gas-station/,minimize-max-distance-to-gas-station,数组、二分查找,https://algo.itcharge.cn/Solutions/0700-0799/minimize-max-distance-to-gas-station/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0774.%20%E6%9C%80%E5%B0%8F%E5%8C%96%E5%8E%BB%E5%8A%A0%E6%B2%B9%E7%AB%99%E7%9A%84%E6%9C%80%E5%A4%A7%E8%B7%9D%E7%A6%BB.md,63.9%,困难,39 -0775,0700-0799,0775. 全局倒置与局部倒置,全局倒置与局部倒置,https://leetcode.cn/problems/global-and-local-inversions/,global-and-local-inversions,数组、数学,https://algo.itcharge.cn/Solutions/0700-0799/global-and-local-inversions/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0775.%20%E5%85%A8%E5%B1%80%E5%80%92%E7%BD%AE%E4%B8%8E%E5%B1%80%E9%83%A8%E5%80%92%E7%BD%AE.md,49.4%,中等,418 -0776,0700-0799,0776. 拆分二叉搜索树,拆分二叉搜索树,https://leetcode.cn/problems/split-bst/,split-bst,树、二叉搜索树、递归、二叉树,https://algo.itcharge.cn/Solutions/0700-0799/split-bst/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0776.%20%E6%8B%86%E5%88%86%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md,59.8%,中等,53 -0777,0700-0799,0777. 在LR字符串中交换相邻字符,在LR字符串中交换相邻字符,https://leetcode.cn/problems/swap-adjacent-in-lr-string/,swap-adjacent-in-lr-string,双指针、字符串,https://algo.itcharge.cn/Solutions/0700-0799/swap-adjacent-in-lr-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0777.%20%E5%9C%A8LR%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E4%BA%A4%E6%8D%A2%E7%9B%B8%E9%82%BB%E5%AD%97%E7%AC%A6.md,38.4%,中等,305 -0778,0700-0799,0778. 水位上升的泳池中游泳,水位上升的泳池中游泳,https://leetcode.cn/problems/swim-in-rising-water/,swim-in-rising-water,深度优先搜索、广度优先搜索、并查集、数组、二分查找、矩阵、堆（优先队列）,https://algo.itcharge.cn/Solutions/0700-0799/swim-in-rising-water/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0778.%20%E6%B0%B4%E4%BD%8D%E4%B8%8A%E5%8D%87%E7%9A%84%E6%B3%B3%E6%B1%A0%E4%B8%AD%E6%B8%B8%E6%B3%B3.md,59.0%,困难,436 -0779,0700-0799,0779. 第K个语法符号,第K个语法符号,https://leetcode.cn/problems/k-th-symbol-in-grammar/,k-th-symbol-in-grammar,位运算、递归、数学,https://algo.itcharge.cn/Solutions/0700-0799/k-th-symbol-in-grammar/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0779.%20%E7%AC%ACK%E4%B8%AA%E8%AF%AD%E6%B3%95%E7%AC%A6%E5%8F%B7.md,49.7%,中等,751 -0780,0700-0799,0780. 到达终点,到达终点,https://leetcode.cn/problems/reaching-points/,reaching-points,数学,https://algo.itcharge.cn/Solutions/0700-0799/reaching-points/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0780.%20%E5%88%B0%E8%BE%BE%E7%BB%88%E7%82%B9.md,37.6%,困难,266 -0781,0700-0799,0781. 森林中的兔子,森林中的兔子,https://leetcode.cn/problems/rabbits-in-forest/,rabbits-in-forest,贪心、数组、哈希表、数学,https://algo.itcharge.cn/Solutions/0700-0799/rabbits-in-forest/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0781.%20%E6%A3%AE%E6%9E%97%E4%B8%AD%E7%9A%84%E5%85%94%E5%AD%90.md,58.9%,中等,795 -0782,0700-0799,0782. 变为棋盘,变为棋盘,https://leetcode.cn/problems/transform-to-chessboard/,transform-to-chessboard,位运算、数组、数学、矩阵,https://algo.itcharge.cn/Solutions/0700-0799/transform-to-chessboard/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0782.%20%E5%8F%98%E4%B8%BA%E6%A3%8B%E7%9B%98.md,59.7%,困难,149 -0783,0700-0799,0783. 二叉搜索树节点最小距离,二叉搜索树节点最小距离,https://leetcode.cn/problems/minimum-distance-between-bst-nodes/,minimum-distance-between-bst-nodes,树、深度优先搜索、广度优先搜索、二叉搜索树、二叉树,https://algo.itcharge.cn/Solutions/0700-0799/minimum-distance-between-bst-nodes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0783.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E8%8A%82%E7%82%B9%E6%9C%80%E5%B0%8F%E8%B7%9D%E7%A6%BB.md,60.1%,简单,830 -0784,0700-0799,0784. 字母大小写全排列,字母大小写全排列,https://leetcode.cn/problems/letter-case-permutation/,letter-case-permutation,位运算、字符串、回溯,https://algo.itcharge.cn/Solutions/0700-0799/letter-case-permutation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0784.%20%E5%AD%97%E6%AF%8D%E5%A4%A7%E5%B0%8F%E5%86%99%E5%85%A8%E6%8E%92%E5%88%97.md,72.6%,中等,1186 -0785,0700-0799,0785. 判断二分图,判断二分图,https://leetcode.cn/problems/is-graph-bipartite/,is-graph-bipartite,深度优先搜索、广度优先搜索、并查集、图,https://algo.itcharge.cn/Solutions/0700-0799/is-graph-bipartite/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0785.%20%E5%88%A4%E6%96%AD%E4%BA%8C%E5%88%86%E5%9B%BE.md,54.6%,中等,1468 -0786,0700-0799,0786. 第 K 个最小的素数分数,第 K 个最小的素数分数,https://leetcode.cn/problems/k-th-smallest-prime-fraction/,k-th-smallest-prime-fraction,数组、二分查找、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/0700-0799/k-th-smallest-prime-fraction/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0786.%20%E7%AC%AC%20K%20%E4%B8%AA%E6%9C%80%E5%B0%8F%E7%9A%84%E7%B4%A0%E6%95%B0%E5%88%86%E6%95%B0.md,67.6%,中等,318 -0787,0700-0799,0787. K 站中转内最便宜的航班,K 站中转内最便宜的航班,https://leetcode.cn/problems/cheapest-flights-within-k-stops/,cheapest-flights-within-k-stops,深度优先搜索、广度优先搜索、图、动态规划、最短路、堆（优先队列）,https://algo.itcharge.cn/Solutions/0700-0799/cheapest-flights-within-k-stops/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0787.%20K%20%E7%AB%99%E4%B8%AD%E8%BD%AC%E5%86%85%E6%9C%80%E4%BE%BF%E5%AE%9C%E7%9A%84%E8%88%AA%E7%8F%AD.md,39.7%,中等,667 -0788,0700-0799,0788. 旋转数字,旋转数字,https://leetcode.cn/problems/rotated-digits/,rotated-digits,数学、动态规划,https://algo.itcharge.cn/Solutions/0700-0799/rotated-digits/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0788.%20%E6%97%8B%E8%BD%AC%E6%95%B0%E5%AD%97.md,66.2%,中等,517 -0789,0700-0799,0789. 逃脱阻碍者,逃脱阻碍者,https://leetcode.cn/problems/escape-the-ghosts/,escape-the-ghosts,数组、数学,https://algo.itcharge.cn/Solutions/0700-0799/escape-the-ghosts/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0789.%20%E9%80%83%E8%84%B1%E9%98%BB%E7%A2%8D%E8%80%85.md,68.5%,中等,326 -0790,0700-0799,0790. 多米诺和托米诺平铺,多米诺和托米诺平铺,https://leetcode.cn/problems/domino-and-tromino-tiling/,domino-and-tromino-tiling,动态规划,https://algo.itcharge.cn/Solutions/0700-0799/domino-and-tromino-tiling/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0790.%20%E5%A4%9A%E7%B1%B3%E8%AF%BA%E5%92%8C%E6%89%98%E7%B1%B3%E8%AF%BA%E5%B9%B3%E9%93%BA.md,55.8%,中等,284 -0791,0700-0799,0791. 自定义字符串排序,自定义字符串排序,https://leetcode.cn/problems/custom-sort-string/,custom-sort-string,哈希表、字符串、排序,https://algo.itcharge.cn/Solutions/0700-0799/custom-sort-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0791.%20%E8%87%AA%E5%AE%9A%E4%B9%89%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%8E%92%E5%BA%8F.md,74.2%,中等,599 -0792,0700-0799,0792. 匹配子序列的单词数,匹配子序列的单词数,https://leetcode.cn/problems/number-of-matching-subsequences/,number-of-matching-subsequences,字典树、哈希表、字符串、排序,https://algo.itcharge.cn/Solutions/0700-0799/number-of-matching-subsequences/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0792.%20%E5%8C%B9%E9%85%8D%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E5%8D%95%E8%AF%8D%E6%95%B0.md,51.0%,中等,447 -0793,0700-0799,0793. 阶乘函数后 K 个零,阶乘函数后 K 个零,https://leetcode.cn/problems/preimage-size-of-factorial-zeroes-function/,preimage-size-of-factorial-zeroes-function,数学、二分查找,https://algo.itcharge.cn/Solutions/0700-0799/preimage-size-of-factorial-zeroes-function/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0793.%20%E9%98%B6%E4%B9%98%E5%87%BD%E6%95%B0%E5%90%8E%20K%20%E4%B8%AA%E9%9B%B6.md,48.7%,困难,289 -0794,0700-0799,0794. 有效的井字游戏,有效的井字游戏,https://leetcode.cn/problems/valid-tic-tac-toe-state/,valid-tic-tac-toe-state,数组、字符串,https://algo.itcharge.cn/Solutions/0700-0799/valid-tic-tac-toe-state/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0794.%20%E6%9C%89%E6%95%88%E7%9A%84%E4%BA%95%E5%AD%97%E6%B8%B8%E6%88%8F.md,38.6%,中等,497 -0795,0700-0799,0795. 区间子数组个数,区间子数组个数,https://leetcode.cn/problems/number-of-subarrays-with-bounded-maximum/,number-of-subarrays-with-bounded-maximum,数组、双指针,https://algo.itcharge.cn/Solutions/0700-0799/number-of-subarrays-with-bounded-maximum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0795.%20%E5%8C%BA%E9%97%B4%E5%AD%90%E6%95%B0%E7%BB%84%E4%B8%AA%E6%95%B0.md,57.8%,中等,351 -0796,0700-0799,0796. 旋转字符串,旋转字符串,https://leetcode.cn/problems/rotate-string/,rotate-string,字符串、字符串匹配,https://algo.itcharge.cn/Solutions/0700-0799/rotate-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0796.%20%E6%97%8B%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2.md,63.3%,简单,899 -0797,0700-0799,0797. 所有可能的路径,所有可能的路径,https://leetcode.cn/problems/all-paths-from-source-to-target/,all-paths-from-source-to-target,深度优先搜索、广度优先搜索、图、回溯,https://algo.itcharge.cn/Solutions/0700-0799/all-paths-from-source-to-target/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0797.%20%E6%89%80%E6%9C%89%E5%8F%AF%E8%83%BD%E7%9A%84%E8%B7%AF%E5%BE%84.md,78.9%,中等,1854 -0798,0700-0799,0798. 得分最高的最小轮调,得分最高的最小轮调,https://leetcode.cn/problems/smallest-rotation-with-highest-score/,smallest-rotation-with-highest-score,数组、前缀和,https://algo.itcharge.cn/Solutions/0700-0799/smallest-rotation-with-highest-score/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0798.%20%E5%BE%97%E5%88%86%E6%9C%80%E9%AB%98%E7%9A%84%E6%9C%80%E5%B0%8F%E8%BD%AE%E8%B0%83.md,61.6%,困难,226 -0799,0700-0799,0799. 香槟塔,香槟塔,https://leetcode.cn/problems/champagne-tower/,champagne-tower,动态规划,https://algo.itcharge.cn/Solutions/0700-0799/champagne-tower/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0799.%20%E9%A6%99%E6%A7%9F%E5%A1%94.md,53.0%,中等,311 -0800,0800-0899,0800. 相似 RGB 颜色,相似 RGB 颜色,https://leetcode.cn/problems/similar-rgb-color/,similar-rgb-color,数学、字符串、枚举,https://algo.itcharge.cn/Solutions/0800-0899/similar-rgb-color/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0800.%20%E7%9B%B8%E4%BC%BC%20RGB%20%E9%A2%9C%E8%89%B2.md,70.2%,简单,56 -0801,0800-0899,0801. 使序列递增的最小交换次数,使序列递增的最小交换次数,https://leetcode.cn/problems/minimum-swaps-to-make-sequences-increasing/,minimum-swaps-to-make-sequences-increasing,数组、动态规划,https://algo.itcharge.cn/Solutions/0800-0899/minimum-swaps-to-make-sequences-increasing/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0801.%20%E4%BD%BF%E5%BA%8F%E5%88%97%E9%80%92%E5%A2%9E%E7%9A%84%E6%9C%80%E5%B0%8F%E4%BA%A4%E6%8D%A2%E6%AC%A1%E6%95%B0.md,50.6%,困难,316 -0802,0800-0899,0802. 找到最终的安全状态,找到最终的安全状态,https://leetcode.cn/problems/find-eventual-safe-states/,find-eventual-safe-states,深度优先搜索、广度优先搜索、图、拓扑排序,https://algo.itcharge.cn/Solutions/0800-0899/find-eventual-safe-states/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0802.%20%E6%89%BE%E5%88%B0%E6%9C%80%E7%BB%88%E7%9A%84%E5%AE%89%E5%85%A8%E7%8A%B6%E6%80%81.md,59.2%,中等,465 -0803,0800-0899,0803. 打砖块,打砖块,https://leetcode.cn/problems/bricks-falling-when-hit/,bricks-falling-when-hit,并查集、数组、矩阵,https://algo.itcharge.cn/Solutions/0800-0899/bricks-falling-when-hit/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0803.%20%E6%89%93%E7%A0%96%E5%9D%97.md,47.0%,困难,153 -0804,0800-0899,0804. 唯一摩尔斯密码词,唯一摩尔斯密码词,https://leetcode.cn/problems/unique-morse-code-words/,unique-morse-code-words,数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/0800-0899/unique-morse-code-words/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0804.%20%E5%94%AF%E4%B8%80%E6%91%A9%E5%B0%94%E6%96%AF%E5%AF%86%E7%A0%81%E8%AF%8D.md,82.2%,简单,842 -0805,0800-0899,0805. 数组的均值分割,数组的均值分割,https://leetcode.cn/problems/split-array-with-same-average/,split-array-with-same-average,位运算、数组、数学、动态规划、状态压缩,https://algo.itcharge.cn/Solutions/0800-0899/split-array-with-same-average/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0805.%20%E6%95%B0%E7%BB%84%E7%9A%84%E5%9D%87%E5%80%BC%E5%88%86%E5%89%B2.md,43.0%,困难,190 -0806,0800-0899,0806. 写字符串需要的行数,写字符串需要的行数,https://leetcode.cn/problems/number-of-lines-to-write-string/,number-of-lines-to-write-string,数组、字符串,https://algo.itcharge.cn/Solutions/0800-0899/number-of-lines-to-write-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0806.%20%E5%86%99%E5%AD%97%E7%AC%A6%E4%B8%B2%E9%9C%80%E8%A6%81%E7%9A%84%E8%A1%8C%E6%95%B0.md,68.4%,简单,642 -0807,0800-0899,0807. 保持城市天际线,保持城市天际线,https://leetcode.cn/problems/max-increase-to-keep-city-skyline/,max-increase-to-keep-city-skyline,贪心、数组、矩阵,https://algo.itcharge.cn/Solutions/0800-0899/max-increase-to-keep-city-skyline/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0807.%20%E4%BF%9D%E6%8C%81%E5%9F%8E%E5%B8%82%E5%A4%A9%E9%99%85%E7%BA%BF.md,88.1%,中等,759 -0808,0800-0899,0808. 分汤,分汤,https://leetcode.cn/problems/soup-servings/,soup-servings,数学、动态规划、概率与统计,https://algo.itcharge.cn/Solutions/0800-0899/soup-servings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0808.%20%E5%88%86%E6%B1%A4.md,58.8%,中等,166 -0809,0800-0899,0809. 情感丰富的文字,情感丰富的文字,https://leetcode.cn/problems/expressive-words/,expressive-words,数组、双指针、字符串,https://algo.itcharge.cn/Solutions/0800-0899/expressive-words/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0809.%20%E6%83%85%E6%84%9F%E4%B8%B0%E5%AF%8C%E7%9A%84%E6%96%87%E5%AD%97.md,48.9%,中等,370 -0810,0800-0899,0810. 黑板异或游戏,黑板异或游戏,https://leetcode.cn/problems/chalkboard-xor-game/,chalkboard-xor-game,位运算、脑筋急转弯、数组、数学、博弈,https://algo.itcharge.cn/Solutions/0800-0899/chalkboard-xor-game/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0810.%20%E9%BB%91%E6%9D%BF%E5%BC%82%E6%88%96%E6%B8%B8%E6%88%8F.md,72.5%,困难,154 -0811,0800-0899,0811. 子域名访问计数,子域名访问计数,https://leetcode.cn/problems/subdomain-visit-count/,subdomain-visit-count,数组、哈希表、字符串、计数,https://algo.itcharge.cn/Solutions/0800-0899/subdomain-visit-count/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0811.%20%E5%AD%90%E5%9F%9F%E5%90%8D%E8%AE%BF%E9%97%AE%E8%AE%A1%E6%95%B0.md,76.7%,中等,565 -0812,0800-0899,0812. 最大三角形面积,最大三角形面积,https://leetcode.cn/problems/largest-triangle-area/,largest-triangle-area,几何、数组、数学,https://algo.itcharge.cn/Solutions/0800-0899/largest-triangle-area/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0812.%20%E6%9C%80%E5%A4%A7%E4%B8%89%E8%A7%92%E5%BD%A2%E9%9D%A2%E7%A7%AF.md,68.2%,简单,325 -0813,0800-0899,0813. 最大平均值和的分组,最大平均值和的分组,https://leetcode.cn/problems/largest-sum-of-averages/,largest-sum-of-averages,数组、动态规划、前缀和,https://algo.itcharge.cn/Solutions/0800-0899/largest-sum-of-averages/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0813.%20%E6%9C%80%E5%A4%A7%E5%B9%B3%E5%9D%87%E5%80%BC%E5%92%8C%E7%9A%84%E5%88%86%E7%BB%84.md,61.7%,中等,270 -0814,0800-0899,0814. 二叉树剪枝,二叉树剪枝,https://leetcode.cn/problems/binary-tree-pruning/,binary-tree-pruning,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0800-0899/binary-tree-pruning/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0814.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E5%89%AA%E6%9E%9D.md,72.6%,中等,796 -0815,0800-0899,0815. 公交路线,公交路线,https://leetcode.cn/problems/bus-routes/,bus-routes,广度优先搜索、数组、哈希表,https://algo.itcharge.cn/Solutions/0800-0899/bus-routes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0815.%20%E5%85%AC%E4%BA%A4%E8%B7%AF%E7%BA%BF.md,44.4%,困难,412 -0816,0800-0899,0816. 模糊坐标,模糊坐标,https://leetcode.cn/problems/ambiguous-coordinates/,ambiguous-coordinates,字符串、回溯,https://algo.itcharge.cn/Solutions/0800-0899/ambiguous-coordinates/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0816.%20%E6%A8%A1%E7%B3%8A%E5%9D%90%E6%A0%87.md,62.6%,中等,391 -0817,0800-0899,0817. 链表组件,链表组件,https://leetcode.cn/problems/linked-list-components/,linked-list-components,数组、哈希表、链表,https://algo.itcharge.cn/Solutions/0800-0899/linked-list-components/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0817.%20%E9%93%BE%E8%A1%A8%E7%BB%84%E4%BB%B6.md,61.4%,中等,586 -0818,0800-0899,0818. 赛车,赛车,https://leetcode.cn/problems/race-car/,race-car,动态规划,https://algo.itcharge.cn/Solutions/0800-0899/race-car/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0818.%20%E8%B5%9B%E8%BD%A6.md,44.9%,困难,69 -0819,0800-0899,0819. 最常见的单词,最常见的单词,https://leetcode.cn/problems/most-common-word/,most-common-word,哈希表、字符串、计数,https://algo.itcharge.cn/Solutions/0800-0899/most-common-word/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0819.%20%E6%9C%80%E5%B8%B8%E8%A7%81%E7%9A%84%E5%8D%95%E8%AF%8D.md,45.6%,简单,728 -0820,0800-0899,0820. 单词的压缩编码,单词的压缩编码,https://leetcode.cn/problems/short-encoding-of-words/,short-encoding-of-words,字典树、数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/0800-0899/short-encoding-of-words/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0820.%20%E5%8D%95%E8%AF%8D%E7%9A%84%E5%8E%8B%E7%BC%A9%E7%BC%96%E7%A0%81.md,52.1%,中等,736 -0821,0800-0899,0821. 字符的最短距离,字符的最短距离,https://leetcode.cn/problems/shortest-distance-to-a-character/,shortest-distance-to-a-character,数组、双指针、字符串,https://algo.itcharge.cn/Solutions/0800-0899/shortest-distance-to-a-character/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0821.%20%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E7%9F%AD%E8%B7%9D%E7%A6%BB.md,72.9%,简单,997 -0822,0800-0899,0822. 翻转卡片游戏,翻转卡片游戏,https://leetcode.cn/problems/card-flipping-game/,card-flipping-game,数组、哈希表,https://algo.itcharge.cn/Solutions/0800-0899/card-flipping-game/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0822.%20%E7%BF%BB%E8%BD%AC%E5%8D%A1%E7%89%87%E6%B8%B8%E6%88%8F.md,51.6%,中等,68 -0823,0800-0899,0823. 带因子的二叉树,带因子的二叉树,https://leetcode.cn/problems/binary-trees-with-factors/,binary-trees-with-factors,数组、哈希表、动态规划,https://algo.itcharge.cn/Solutions/0800-0899/binary-trees-with-factors/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0823.%20%E5%B8%A6%E5%9B%A0%E5%AD%90%E7%9A%84%E4%BA%8C%E5%8F%89%E6%A0%91.md,43.5%,中等,82 -0824,0800-0899,0824. 山羊拉丁文,山羊拉丁文,https://leetcode.cn/problems/goat-latin/,goat-latin,字符串,https://algo.itcharge.cn/Solutions/0800-0899/goat-latin/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0824.%20%E5%B1%B1%E7%BE%8A%E6%8B%89%E4%B8%81%E6%96%87.md,65.1%,简单,747 -0825,0800-0899,0825. 适龄的朋友,适龄的朋友,https://leetcode.cn/problems/friends-of-appropriate-ages/,friends-of-appropriate-ages,数组、双指针、二分查找、排序,https://algo.itcharge.cn/Solutions/0800-0899/friends-of-appropriate-ages/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0825.%20%E9%80%82%E9%BE%84%E7%9A%84%E6%9C%8B%E5%8F%8B.md,45.4%,中等,361 -0826,0800-0899,0826. 安排工作以达到最大收益,安排工作以达到最大收益,https://leetcode.cn/problems/most-profit-assigning-work/,most-profit-assigning-work,贪心、数组、双指针、二分查找、排序,https://algo.itcharge.cn/Solutions/0800-0899/most-profit-assigning-work/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0826.%20%E5%AE%89%E6%8E%92%E5%B7%A5%E4%BD%9C%E4%BB%A5%E8%BE%BE%E5%88%B0%E6%9C%80%E5%A4%A7%E6%94%B6%E7%9B%8A.md,42.6%,中等,228 -0827,0800-0899,0827. 最大人工岛,最大人工岛,https://leetcode.cn/problems/making-a-large-island/,making-a-large-island,深度优先搜索、广度优先搜索、并查集、数组、矩阵,https://algo.itcharge.cn/Solutions/0800-0899/making-a-large-island/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0827.%20%E6%9C%80%E5%A4%A7%E4%BA%BA%E5%B7%A5%E5%B2%9B.md,47.1%,困难,538 -0828,0800-0899,0828. 统计子串中的唯一字符,统计子串中的唯一字符,https://leetcode.cn/problems/count-unique-characters-of-all-substrings-of-a-given-string/,count-unique-characters-of-all-substrings-of-a-given-string,哈希表、字符串、动态规划,https://algo.itcharge.cn/Solutions/0800-0899/count-unique-characters-of-all-substrings-of-a-given-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0828.%20%E7%BB%9F%E8%AE%A1%E5%AD%90%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%94%AF%E4%B8%80%E5%AD%97%E7%AC%A6.md,65.6%,困难,310 -0829,0800-0899,0829. 连续整数求和,连续整数求和,https://leetcode.cn/problems/consecutive-numbers-sum/,consecutive-numbers-sum,数学、枚举,https://algo.itcharge.cn/Solutions/0800-0899/consecutive-numbers-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0829.%20%E8%BF%9E%E7%BB%AD%E6%95%B4%E6%95%B0%E6%B1%82%E5%92%8C.md,46.3%,困难,377 -0830,0800-0899,0830. 较大分组的位置,较大分组的位置,https://leetcode.cn/problems/positions-of-large-groups/,positions-of-large-groups,字符串,https://algo.itcharge.cn/Solutions/0800-0899/positions-of-large-groups/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0830.%20%E8%BE%83%E5%A4%A7%E5%88%86%E7%BB%84%E7%9A%84%E4%BD%8D%E7%BD%AE.md,54.1%,简单,699 -0831,0800-0899,0831. 隐藏个人信息,隐藏个人信息,https://leetcode.cn/problems/masking-personal-information/,masking-personal-information,字符串,https://algo.itcharge.cn/Solutions/0800-0899/masking-personal-information/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0831.%20%E9%9A%90%E8%97%8F%E4%B8%AA%E4%BA%BA%E4%BF%A1%E6%81%AF.md,53.8%,中等,276 -0832,0800-0899,0832. 翻转图像,翻转图像,https://leetcode.cn/problems/flipping-an-image/,flipping-an-image,数组、双指针、矩阵、模拟,https://algo.itcharge.cn/Solutions/0800-0899/flipping-an-image/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0832.%20%E7%BF%BB%E8%BD%AC%E5%9B%BE%E5%83%8F.md,79.5%,简单,1123 -0833,0800-0899,0833. 字符串中的查找与替换,字符串中的查找与替换,https://leetcode.cn/problems/find-and-replace-in-string/,find-and-replace-in-string,数组、字符串、排序,https://algo.itcharge.cn/Solutions/0800-0899/find-and-replace-in-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0833.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E6%9F%A5%E6%89%BE%E4%B8%8E%E6%9B%BF%E6%8D%A2.md,44.0%,中等,135 -0834,0800-0899,0834. 树中距离之和,树中距离之和,https://leetcode.cn/problems/sum-of-distances-in-tree/,sum-of-distances-in-tree,树、深度优先搜索、图、动态规划,https://algo.itcharge.cn/Solutions/0800-0899/sum-of-distances-in-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0834.%20%E6%A0%91%E4%B8%AD%E8%B7%9D%E7%A6%BB%E4%B9%8B%E5%92%8C.md,54.4%,困难,179 -0835,0800-0899,0835. 图像重叠,图像重叠,https://leetcode.cn/problems/image-overlap/,image-overlap,数组、矩阵,https://algo.itcharge.cn/Solutions/0800-0899/image-overlap/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0835.%20%E5%9B%BE%E5%83%8F%E9%87%8D%E5%8F%A0.md,58.2%,中等,73 -0836,0800-0899,0836. 矩形重叠,矩形重叠,https://leetcode.cn/problems/rectangle-overlap/,rectangle-overlap,几何、数学,https://algo.itcharge.cn/Solutions/0800-0899/rectangle-overlap/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0836.%20%E7%9F%A9%E5%BD%A2%E9%87%8D%E5%8F%A0.md,49.0%,简单,776 -0837,0800-0899,0837. 新 21 点,新 21 点,https://leetcode.cn/problems/new-21-game/,new-21-game,数学、动态规划、滑动窗口、概率与统计,https://algo.itcharge.cn/Solutions/0800-0899/new-21-game/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0837.%20%E6%96%B0%2021%20%E7%82%B9.md,39.8%,中等,273 -0838,0800-0899,0838. 推多米诺,推多米诺,https://leetcode.cn/problems/push-dominoes/,push-dominoes,双指针、字符串、动态规划,https://algo.itcharge.cn/Solutions/0800-0899/push-dominoes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0838.%20%E6%8E%A8%E5%A4%9A%E7%B1%B3%E8%AF%BA.md,55.6%,中等,559 -0839,0800-0899,0839. 相似字符串组,相似字符串组,https://leetcode.cn/problems/similar-string-groups/,similar-string-groups,深度优先搜索、广度优先搜索、并查集、数组、字符串,https://algo.itcharge.cn/Solutions/0800-0899/similar-string-groups/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0839.%20%E7%9B%B8%E4%BC%BC%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%BB%84.md,58.8%,困难,332 -0840,0800-0899,0840. 矩阵中的幻方,矩阵中的幻方,https://leetcode.cn/problems/magic-squares-in-grid/,magic-squares-in-grid,数组、数学、矩阵,https://algo.itcharge.cn/Solutions/0800-0899/magic-squares-in-grid/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0840.%20%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E5%B9%BB%E6%96%B9.md,36.6%,中等,148 -0841,0800-0899,0841. 钥匙和房间,钥匙和房间,https://leetcode.cn/problems/keys-and-rooms/,keys-and-rooms,深度优先搜索、广度优先搜索、图,https://algo.itcharge.cn/Solutions/0800-0899/keys-and-rooms/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0841.%20%E9%92%A5%E5%8C%99%E5%92%8C%E6%88%BF%E9%97%B4.md,67.9%,中等,812 -0842,0800-0899,0842. 将数组拆分成斐波那契序列,将数组拆分成斐波那契序列,https://leetcode.cn/problems/split-array-into-fibonacci-sequence/,split-array-into-fibonacci-sequence,字符串、回溯,https://algo.itcharge.cn/Solutions/0800-0899/split-array-into-fibonacci-sequence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0842.%20%E5%B0%86%E6%95%B0%E7%BB%84%E6%8B%86%E5%88%86%E6%88%90%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E5%BA%8F%E5%88%97.md,48.3%,中等,381 -0843,0800-0899,0843. 猜猜这个单词,猜猜这个单词,https://leetcode.cn/problems/guess-the-word/,guess-the-word,数组、数学、字符串、博弈、交互,https://algo.itcharge.cn/Solutions/0800-0899/guess-the-word/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0843.%20%E7%8C%9C%E7%8C%9C%E8%BF%99%E4%B8%AA%E5%8D%95%E8%AF%8D.md,36.7%,困难,65 -0844,0800-0899,0844. 比较含退格的字符串,比较含退格的字符串,https://leetcode.cn/problems/backspace-string-compare/,backspace-string-compare,栈、双指针、字符串、模拟,https://algo.itcharge.cn/Solutions/0800-0899/backspace-string-compare/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0844.%20%E6%AF%94%E8%BE%83%E5%90%AB%E9%80%80%E6%A0%BC%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2.md,47.9%,简单,1897 -0845,0800-0899,0845. 数组中的最长山脉,数组中的最长山脉,https://leetcode.cn/problems/longest-mountain-in-array/,longest-mountain-in-array,数组、双指针、动态规划、枚举,https://algo.itcharge.cn/Solutions/0800-0899/longest-mountain-in-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0845.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9C%80%E9%95%BF%E5%B1%B1%E8%84%89.md,42.3%,中等,712 -0846,0800-0899,0846. 一手顺子,一手顺子,https://leetcode.cn/problems/hand-of-straights/,hand-of-straights,贪心、数组、哈希表、排序,https://algo.itcharge.cn/Solutions/0800-0899/hand-of-straights/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0846.%20%E4%B8%80%E6%89%8B%E9%A1%BA%E5%AD%90.md,57.2%,中等,537 -0847,0800-0899,0847. 访问所有节点的最短路径,访问所有节点的最短路径,https://leetcode.cn/problems/shortest-path-visiting-all-nodes/,shortest-path-visiting-all-nodes,位运算、广度优先搜索、图、动态规划、状态压缩,https://algo.itcharge.cn/Solutions/0800-0899/shortest-path-visiting-all-nodes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0847.%20%E8%AE%BF%E9%97%AE%E6%89%80%E6%9C%89%E8%8A%82%E7%82%B9%E7%9A%84%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84.md,67.6%,困难,231 -0848,0800-0899,0848. 字母移位,字母移位,https://leetcode.cn/problems/shifting-letters/,shifting-letters,数组、字符串,https://algo.itcharge.cn/Solutions/0800-0899/shifting-letters/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0848.%20%E5%AD%97%E6%AF%8D%E7%A7%BB%E4%BD%8D.md,46.1%,中等,151 -0849,0800-0899,0849. 到最近的人的最大距离,到最近的人的最大距离,https://leetcode.cn/problems/maximize-distance-to-closest-person/,maximize-distance-to-closest-person,数组,https://algo.itcharge.cn/Solutions/0800-0899/maximize-distance-to-closest-person/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0849.%20%E5%88%B0%E6%9C%80%E8%BF%91%E7%9A%84%E4%BA%BA%E7%9A%84%E6%9C%80%E5%A4%A7%E8%B7%9D%E7%A6%BB.md,44.2%,中等,267 -0850,0800-0899,0850. 矩形面积 II,矩形面积 II,https://leetcode.cn/problems/rectangle-area-ii/,rectangle-area-ii,线段树、数组、有序集合、扫描线,https://algo.itcharge.cn/Solutions/0800-0899/rectangle-area-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0850.%20%E7%9F%A9%E5%BD%A2%E9%9D%A2%E7%A7%AF%20II.md,62.9%,困难,179 -0851,0800-0899,0851. 喧闹和富有,喧闹和富有,https://leetcode.cn/problems/loud-and-rich/,loud-and-rich,深度优先搜索、图、拓扑排序、数组,https://algo.itcharge.cn/Solutions/0800-0899/loud-and-rich/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0851.%20%E5%96%A7%E9%97%B9%E5%92%8C%E5%AF%8C%E6%9C%89.md,63.1%,中等,331 -0852,0800-0899,0852. 山脉数组的峰顶索引,山脉数组的峰顶索引,https://leetcode.cn/problems/peak-index-in-a-mountain-array/,peak-index-in-a-mountain-array,数组、二分查找,https://algo.itcharge.cn/Solutions/0800-0899/peak-index-in-a-mountain-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0852.%20%E5%B1%B1%E8%84%89%E6%95%B0%E7%BB%84%E7%9A%84%E5%B3%B0%E9%A1%B6%E7%B4%A2%E5%BC%95.md,68.7%,中等,1144 -0853,0800-0899,0853. 车队,车队,https://leetcode.cn/problems/car-fleet/,car-fleet,栈、数组、排序、单调栈,https://algo.itcharge.cn/Solutions/0800-0899/car-fleet/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0853.%20%E8%BD%A6%E9%98%9F.md,41.3%,中等,205 -0854,0800-0899,0854. 相似度为 K 的字符串,相似度为 K 的字符串,https://leetcode.cn/problems/k-similar-strings/,k-similar-strings,广度优先搜索、字符串,https://algo.itcharge.cn/Solutions/0800-0899/k-similar-strings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0854.%20%E7%9B%B8%E4%BC%BC%E5%BA%A6%E4%B8%BA%20K%20%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2.md,46.8%,困难,248 -0855,0800-0899,0855. 考场就座,考场就座,https://leetcode.cn/problems/exam-room/,exam-room,设计、有序集合、堆（优先队列）,https://algo.itcharge.cn/Solutions/0800-0899/exam-room/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0855.%20%E8%80%83%E5%9C%BA%E5%B0%B1%E5%BA%A7.md,47.7%,中等,214 -0856,0800-0899,0856. 括号的分数,括号的分数,https://leetcode.cn/problems/score-of-parentheses/,score-of-parentheses,栈、字符串,https://algo.itcharge.cn/Solutions/0800-0899/score-of-parentheses/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0856.%20%E6%8B%AC%E5%8F%B7%E7%9A%84%E5%88%86%E6%95%B0.md,68.4%,中等,708 -0857,0800-0899,0857. 雇佣 K 名工人的最低成本,雇佣 K 名工人的最低成本,https://leetcode.cn/problems/minimum-cost-to-hire-k-workers/,minimum-cost-to-hire-k-workers,贪心、数组、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/0800-0899/minimum-cost-to-hire-k-workers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0857.%20%E9%9B%87%E4%BD%A3%20K%20%E5%90%8D%E5%B7%A5%E4%BA%BA%E7%9A%84%E6%9C%80%E4%BD%8E%E6%88%90%E6%9C%AC.md,63.6%,困难,216 -0858,0800-0899,0858. 镜面反射,镜面反射,https://leetcode.cn/problems/mirror-reflection/,mirror-reflection,几何、数学、数论,https://algo.itcharge.cn/Solutions/0800-0899/mirror-reflection/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0858.%20%E9%95%9C%E9%9D%A2%E5%8F%8D%E5%B0%84.md,57.5%,中等,80 -0859,0800-0899,0859. 亲密字符串,亲密字符串,https://leetcode.cn/problems/buddy-strings/,buddy-strings,哈希表、字符串,https://algo.itcharge.cn/Solutions/0800-0899/buddy-strings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0859.%20%E4%BA%B2%E5%AF%86%E5%AD%97%E7%AC%A6%E4%B8%B2.md,34.5%,简单,889 -0860,0800-0899,0860. 柠檬水找零,柠檬水找零,https://leetcode.cn/problems/lemonade-change/,lemonade-change,贪心、数组,https://algo.itcharge.cn/Solutions/0800-0899/lemonade-change/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0860.%20%E6%9F%A0%E6%AA%AC%E6%B0%B4%E6%89%BE%E9%9B%B6.md,58.6%,简单,1307 -0861,0800-0899,0861. 翻转矩阵后的得分,翻转矩阵后的得分,https://leetcode.cn/problems/score-after-flipping-matrix/,score-after-flipping-matrix,贪心、位运算、数组、矩阵,https://algo.itcharge.cn/Solutions/0800-0899/score-after-flipping-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0861.%20%E7%BF%BB%E8%BD%AC%E7%9F%A9%E9%98%B5%E5%90%8E%E7%9A%84%E5%BE%97%E5%88%86.md,80.8%,中等,520 -0862,0800-0899,0862. 和至少为 K 的最短子数组,和至少为 K 的最短子数组,https://leetcode.cn/problems/shortest-subarray-with-sum-at-least-k/,shortest-subarray-with-sum-at-least-k,队列、数组、二分查找、前缀和、滑动窗口、单调队列、堆（优先队列）,https://algo.itcharge.cn/Solutions/0800-0899/shortest-subarray-with-sum-at-least-k/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0862.%20%E5%92%8C%E8%87%B3%E5%B0%91%E4%B8%BA%20K%20%E7%9A%84%E6%9C%80%E7%9F%AD%E5%AD%90%E6%95%B0%E7%BB%84.md,26.5%,困难,383 -0863,0800-0899,0863. 二叉树中所有距离为 K 的结点,二叉树中所有距离为 K 的结点,https://leetcode.cn/problems/all-nodes-distance-k-in-binary-tree/,all-nodes-distance-k-in-binary-tree,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0800-0899/all-nodes-distance-k-in-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0863.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E6%89%80%E6%9C%89%E8%B7%9D%E7%A6%BB%E4%B8%BA%20K%20%E7%9A%84%E7%BB%93%E7%82%B9.md,61.4%,中等,756 -0864,0800-0899,0864. 获取所有钥匙的最短路径,获取所有钥匙的最短路径,https://leetcode.cn/problems/shortest-path-to-get-all-keys/,shortest-path-to-get-all-keys,位运算、广度优先搜索、数组、矩阵,https://algo.itcharge.cn/Solutions/0800-0899/shortest-path-to-get-all-keys/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0864.%20%E8%8E%B7%E5%8F%96%E6%89%80%E6%9C%89%E9%92%A5%E5%8C%99%E7%9A%84%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84.md,59.5%,困难,245 -0865,0800-0899,0865. 具有所有最深节点的最小子树,具有所有最深节点的最小子树,https://leetcode.cn/problems/smallest-subtree-with-all-the-deepest-nodes/,smallest-subtree-with-all-the-deepest-nodes,树、深度优先搜索、广度优先搜索、哈希表、二叉树,https://algo.itcharge.cn/Solutions/0800-0899/smallest-subtree-with-all-the-deepest-nodes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0865.%20%E5%85%B7%E6%9C%89%E6%89%80%E6%9C%89%E6%9C%80%E6%B7%B1%E8%8A%82%E7%82%B9%E7%9A%84%E6%9C%80%E5%B0%8F%E5%AD%90%E6%A0%91.md,68.9%,中等,225 -0866,0800-0899,0866. 回文素数,回文素数,https://leetcode.cn/problems/prime-palindrome/,prime-palindrome,数学,https://algo.itcharge.cn/Solutions/0800-0899/prime-palindrome/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0866.%20%E5%9B%9E%E6%96%87%E7%B4%A0%E6%95%B0.md,23.8%,中等,128 -0867,0800-0899,0867. 转置矩阵,转置矩阵,https://leetcode.cn/problems/transpose-matrix/,transpose-matrix,数组、矩阵、模拟,https://algo.itcharge.cn/Solutions/0800-0899/transpose-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0867.%20%E8%BD%AC%E7%BD%AE%E7%9F%A9%E9%98%B5.md,66.8%,简单,871 -0868,0800-0899,0868. 二进制间距,二进制间距,https://leetcode.cn/problems/binary-gap/,binary-gap,位运算,https://algo.itcharge.cn/Solutions/0800-0899/binary-gap/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0868.%20%E4%BA%8C%E8%BF%9B%E5%88%B6%E9%97%B4%E8%B7%9D.md,69.4%,简单,693 -0869,0800-0899,0869. 重新排序得到 2 的幂,重新排序得到 2 的幂,https://leetcode.cn/problems/reordered-power-of-2/,reordered-power-of-2,数学、计数、枚举、排序,https://algo.itcharge.cn/Solutions/0800-0899/reordered-power-of-2/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0869.%20%E9%87%8D%E6%96%B0%E6%8E%92%E5%BA%8F%E5%BE%97%E5%88%B0%202%20%E7%9A%84%E5%B9%82.md,63.6%,中等,532 -0870,0800-0899,0870. 优势洗牌,优势洗牌,https://leetcode.cn/problems/advantage-shuffle/,advantage-shuffle,贪心、数组、双指针、排序,https://algo.itcharge.cn/Solutions/0800-0899/advantage-shuffle/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0870.%20%E4%BC%98%E5%8A%BF%E6%B4%97%E7%89%8C.md,50.4%,中等,756 -0871,0800-0899,0871. 最低加油次数,最低加油次数,https://leetcode.cn/problems/minimum-number-of-refueling-stops/,minimum-number-of-refueling-stops,贪心、数组、动态规划、堆（优先队列）,https://algo.itcharge.cn/Solutions/0800-0899/minimum-number-of-refueling-stops/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0871.%20%E6%9C%80%E4%BD%8E%E5%8A%A0%E6%B2%B9%E6%AC%A1%E6%95%B0.md,43.2%,困难,367 -0872,0800-0899,0872. 叶子相似的树,叶子相似的树,https://leetcode.cn/problems/leaf-similar-trees/,leaf-similar-trees,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0800-0899/leaf-similar-trees/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0872.%20%E5%8F%B6%E5%AD%90%E7%9B%B8%E4%BC%BC%E7%9A%84%E6%A0%91.md,65.0%,简单,883 -0873,0800-0899,0873. 最长的斐波那契子序列的长度,最长的斐波那契子序列的长度,https://leetcode.cn/problems/length-of-longest-fibonacci-subsequence/,length-of-longest-fibonacci-subsequence,数组、哈希表、动态规划,https://algo.itcharge.cn/Solutions/0800-0899/length-of-longest-fibonacci-subsequence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0873.%20%E6%9C%80%E9%95%BF%E7%9A%84%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E9%95%BF%E5%BA%A6.md,56.3%,中等,381 -0874,0800-0899,0874. 模拟行走机器人,模拟行走机器人,https://leetcode.cn/problems/walking-robot-simulation/,walking-robot-simulation,数组、模拟,https://algo.itcharge.cn/Solutions/0800-0899/walking-robot-simulation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0874.%20%E6%A8%A1%E6%8B%9F%E8%A1%8C%E8%B5%B0%E6%9C%BA%E5%99%A8%E4%BA%BA.md,43.1%,中等,341 -0875,0800-0899,0875. 爱吃香蕉的珂珂,爱吃香蕉的珂珂,https://leetcode.cn/problems/koko-eating-bananas/,koko-eating-bananas,数组、二分查找,https://algo.itcharge.cn/Solutions/0800-0899/koko-eating-bananas/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0875.%20%E7%88%B1%E5%90%83%E9%A6%99%E8%95%89%E7%9A%84%E7%8F%82%E7%8F%82.md,49.5%,中等,971 -0876,0800-0899,0876. 链表的中间结点,链表的中间结点,https://leetcode.cn/problems/middle-of-the-linked-list/,middle-of-the-linked-list,链表、双指针,https://algo.itcharge.cn/Solutions/0800-0899/middle-of-the-linked-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0876.%20%E9%93%BE%E8%A1%A8%E7%9A%84%E4%B8%AD%E9%97%B4%E7%BB%93%E7%82%B9.md,70.2%,简单,3542 -0877,0800-0899,0877. 石子游戏,石子游戏,https://leetcode.cn/problems/stone-game/,stone-game,数组、数学、动态规划、博弈,https://algo.itcharge.cn/Solutions/0800-0899/stone-game/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0877.%20%E7%9F%B3%E5%AD%90%E6%B8%B8%E6%88%8F.md,76.5%,中等,664 -0878,0800-0899,0878. 第 N 个神奇数字,第 N 个神奇数字,https://leetcode.cn/problems/nth-magical-number/,nth-magical-number,数学、二分查找,https://algo.itcharge.cn/Solutions/0800-0899/nth-magical-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0878.%20%E7%AC%AC%20N%20%E4%B8%AA%E7%A5%9E%E5%A5%87%E6%95%B0%E5%AD%97.md,40.0%,困难,226 -0879,0800-0899,0879. 盈利计划,盈利计划,https://leetcode.cn/problems/profitable-schemes/,profitable-schemes,数组、动态规划,https://algo.itcharge.cn/Solutions/0800-0899/profitable-schemes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0879.%20%E7%9B%88%E5%88%A9%E8%AE%A1%E5%88%92.md,54.7%,困难,233 -0880,0800-0899,0880. 索引处的解码字符串,索引处的解码字符串,https://leetcode.cn/problems/decoded-string-at-index/,decoded-string-at-index,栈、字符串,https://algo.itcharge.cn/Solutions/0800-0899/decoded-string-at-index/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0880.%20%E7%B4%A2%E5%BC%95%E5%A4%84%E7%9A%84%E8%A7%A3%E7%A0%81%E5%AD%97%E7%AC%A6%E4%B8%B2.md,26.9%,中等,113 -0881,0800-0899,0881. 救生艇,救生艇,https://leetcode.cn/problems/boats-to-save-people/,boats-to-save-people,贪心、数组、双指针、排序,https://algo.itcharge.cn/Solutions/0800-0899/boats-to-save-people/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0881.%20%E6%95%91%E7%94%9F%E8%89%87.md,53.7%,中等,754 -0882,0800-0899,0882. 细分图中的可到达节点,细分图中的可到达节点,https://leetcode.cn/problems/reachable-nodes-in-subdivided-graph/,reachable-nodes-in-subdivided-graph,图、最短路、堆（优先队列）,https://algo.itcharge.cn/Solutions/0800-0899/reachable-nodes-in-subdivided-graph/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0882.%20%E7%BB%86%E5%88%86%E5%9B%BE%E4%B8%AD%E7%9A%84%E5%8F%AF%E5%88%B0%E8%BE%BE%E8%8A%82%E7%82%B9.md,64.1%,困难,141 -0883,0800-0899,0883. 三维形体投影面积,三维形体投影面积,https://leetcode.cn/problems/projection-area-of-3d-shapes/,projection-area-of-3d-shapes,几何、数组、数学、矩阵,https://algo.itcharge.cn/Solutions/0800-0899/projection-area-of-3d-shapes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0883.%20%E4%B8%89%E7%BB%B4%E5%BD%A2%E4%BD%93%E6%8A%95%E5%BD%B1%E9%9D%A2%E7%A7%AF.md,76.4%,简单,566 -0884,0800-0899,0884. 两句话中的不常见单词,两句话中的不常见单词,https://leetcode.cn/problems/uncommon-words-from-two-sentences/,uncommon-words-from-two-sentences,哈希表、字符串,https://algo.itcharge.cn/Solutions/0800-0899/uncommon-words-from-two-sentences/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0884.%20%E4%B8%A4%E5%8F%A5%E8%AF%9D%E4%B8%AD%E7%9A%84%E4%B8%8D%E5%B8%B8%E8%A7%81%E5%8D%95%E8%AF%8D.md,71.2%,简单,640 -0885,0800-0899,0885. 螺旋矩阵 III,螺旋矩阵 III,https://leetcode.cn/problems/spiral-matrix-iii/,spiral-matrix-iii,数组、矩阵、模拟,https://algo.itcharge.cn/Solutions/0800-0899/spiral-matrix-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0885.%20%E8%9E%BA%E6%97%8B%E7%9F%A9%E9%98%B5%20III.md,71.2%,中等,132 -0886,0800-0899,0886. 可能的二分法,可能的二分法,https://leetcode.cn/problems/possible-bipartition/,possible-bipartition,深度优先搜索、广度优先搜索、并查集、图,https://algo.itcharge.cn/Solutions/0800-0899/possible-bipartition/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0886.%20%E5%8F%AF%E8%83%BD%E7%9A%84%E4%BA%8C%E5%88%86%E6%B3%95.md,52.1%,中等,614 -0887,0800-0899,0887. 鸡蛋掉落,鸡蛋掉落,https://leetcode.cn/problems/super-egg-drop/,super-egg-drop,数学、二分查找、动态规划,https://algo.itcharge.cn/Solutions/0800-0899/super-egg-drop/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0887.%20%E9%B8%A1%E8%9B%8B%E6%8E%89%E8%90%BD.md,30.6%,困难,468 -0888,0800-0899,0888. 公平的糖果交换,公平的糖果交换,https://leetcode.cn/problems/fair-candy-swap/,fair-candy-swap,数组、哈希表、二分查找、排序,https://algo.itcharge.cn/Solutions/0800-0899/fair-candy-swap/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0888.%20%E5%85%AC%E5%B9%B3%E7%9A%84%E7%B3%96%E6%9E%9C%E4%BA%A4%E6%8D%A2.md,63.6%,简单,598 -0889,0800-0899,0889. 根据前序和后序遍历构造二叉树,根据前序和后序遍历构造二叉树,https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-postorder-traversal/,construct-binary-tree-from-preorder-and-postorder-traversal,树、数组、哈希表、分治、二叉树,https://algo.itcharge.cn/Solutions/0800-0899/construct-binary-tree-from-preorder-and-postorder-traversal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0889.%20%E6%A0%B9%E6%8D%AE%E5%89%8D%E5%BA%8F%E5%92%8C%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86%E6%9E%84%E9%80%A0%E4%BA%8C%E5%8F%89%E6%A0%91.md,68.0%,中等,362 -0890,0800-0899,0890. 查找和替换模式,查找和替换模式,https://leetcode.cn/problems/find-and-replace-pattern/,find-and-replace-pattern,数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/0800-0899/find-and-replace-pattern/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0890.%20%E6%9F%A5%E6%89%BE%E5%92%8C%E6%9B%BF%E6%8D%A2%E6%A8%A1%E5%BC%8F.md,78.6%,中等,474 -0891,0800-0899,0891. 子序列宽度之和,子序列宽度之和,https://leetcode.cn/problems/sum-of-subsequence-widths/,sum-of-subsequence-widths,数组、数学、排序,https://algo.itcharge.cn/Solutions/0800-0899/sum-of-subsequence-widths/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0891.%20%E5%AD%90%E5%BA%8F%E5%88%97%E5%AE%BD%E5%BA%A6%E4%B9%8B%E5%92%8C.md,46.5%,困难,200 -0892,0800-0899,0892. 三维形体的表面积,三维形体的表面积,https://leetcode.cn/problems/surface-area-of-3d-shapes/,surface-area-of-3d-shapes,几何、数组、数学、矩阵,https://algo.itcharge.cn/Solutions/0800-0899/surface-area-of-3d-shapes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0892.%20%E4%B8%89%E7%BB%B4%E5%BD%A2%E4%BD%93%E7%9A%84%E8%A1%A8%E9%9D%A2%E7%A7%AF.md,64.4%,简单,776 -0893,0800-0899,0893. 特殊等价字符串组,特殊等价字符串组,https://leetcode.cn/problems/groups-of-special-equivalent-strings/,groups-of-special-equivalent-strings,数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/0800-0899/groups-of-special-equivalent-strings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0893.%20%E7%89%B9%E6%AE%8A%E7%AD%89%E4%BB%B7%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%BB%84.md,73.0%,中等,142 -0894,0800-0899,0894. 所有可能的真二叉树,所有可能的真二叉树,https://leetcode.cn/problems/all-possible-full-binary-trees/,all-possible-full-binary-trees,树、递归、记忆化搜索、动态规划、二叉树,https://algo.itcharge.cn/Solutions/0800-0899/all-possible-full-binary-trees/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0894.%20%E6%89%80%E6%9C%89%E5%8F%AF%E8%83%BD%E7%9A%84%E7%9C%9F%E4%BA%8C%E5%8F%89%E6%A0%91.md,77.6%,中等,197 -0895,0800-0899,0895. 最大频率栈,最大频率栈,https://leetcode.cn/problems/maximum-frequency-stack/,maximum-frequency-stack,栈、设计、哈希表、有序集合,https://algo.itcharge.cn/Solutions/0800-0899/maximum-frequency-stack/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0895.%20%E6%9C%80%E5%A4%A7%E9%A2%91%E7%8E%87%E6%A0%88.md,64.4%,困难,322 -0896,0800-0899,0896. 单调数列,单调数列,https://leetcode.cn/problems/monotonic-array/,monotonic-array,数组,https://algo.itcharge.cn/Solutions/0800-0899/monotonic-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0896.%20%E5%8D%95%E8%B0%83%E6%95%B0%E5%88%97.md,57.0%,简单,979 -0897,0800-0899,0897. 递增顺序搜索树,递增顺序搜索树,https://leetcode.cn/problems/increasing-order-search-tree/,increasing-order-search-tree,栈、树、深度优先搜索、二叉搜索树、二叉树,https://algo.itcharge.cn/Solutions/0800-0899/increasing-order-search-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0897.%20%E9%80%92%E5%A2%9E%E9%A1%BA%E5%BA%8F%E6%90%9C%E7%B4%A2%E6%A0%91.md,74.1%,简单,895 -0898,0800-0899,0898. 子数组按位或操作,子数组按位或操作,https://leetcode.cn/problems/bitwise-ors-of-subarrays/,bitwise-ors-of-subarrays,位运算、数组、动态规划,https://algo.itcharge.cn/Solutions/0800-0899/bitwise-ors-of-subarrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0898.%20%E5%AD%90%E6%95%B0%E7%BB%84%E6%8C%89%E4%BD%8D%E6%88%96%E6%93%8D%E4%BD%9C.md,39.1%,中等,62 -0899,0800-0899,0899. 有序队列,有序队列,https://leetcode.cn/problems/orderly-queue/,orderly-queue,数学、字符串、排序,https://algo.itcharge.cn/Solutions/0800-0899/orderly-queue/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0899.%20%E6%9C%89%E5%BA%8F%E9%98%9F%E5%88%97.md,64.2%,困难,278 -0900,0900-0999,0900. RLE 迭代器,RLE 迭代器,https://leetcode.cn/problems/rle-iterator/,rle-iterator,设计、数组、计数、迭代器,https://algo.itcharge.cn/Solutions/0900-0999/rle-iterator/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0900.%20RLE%20%E8%BF%AD%E4%BB%A3%E5%99%A8.md,51.3%,中等,87 -0901,0900-0999,0901. 股票价格跨度,股票价格跨度,https://leetcode.cn/problems/online-stock-span/,online-stock-span,栈、设计、数据流、单调栈,https://algo.itcharge.cn/Solutions/0900-0999/online-stock-span/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0901.%20%E8%82%A1%E7%A5%A8%E4%BB%B7%E6%A0%BC%E8%B7%A8%E5%BA%A6.md,62.3%,中等,662 -0902,0900-0999,0902. 最大为 N 的数字组合,最大为 N 的数字组合,https://leetcode.cn/problems/numbers-at-most-n-given-digit-set/,numbers-at-most-n-given-digit-set,数组、数学、字符串、二分查找、动态规划,https://algo.itcharge.cn/Solutions/0900-0999/numbers-at-most-n-given-digit-set/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0902.%20%E6%9C%80%E5%A4%A7%E4%B8%BA%20N%20%E7%9A%84%E6%95%B0%E5%AD%97%E7%BB%84%E5%90%88.md,46.2%,困难,397 -0903,0900-0999,0903. DI 序列的有效排列,DI 序列的有效排列,https://leetcode.cn/problems/valid-permutations-for-di-sequence/,valid-permutations-for-di-sequence,字符串、动态规划、前缀和,https://algo.itcharge.cn/Solutions/0900-0999/valid-permutations-for-di-sequence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0903.%20DI%20%E5%BA%8F%E5%88%97%E7%9A%84%E6%9C%89%E6%95%88%E6%8E%92%E5%88%97.md,56.4%,困难,64 -0904,0900-0999,0904. 水果成篮,水果成篮,https://leetcode.cn/problems/fruit-into-baskets/,fruit-into-baskets,数组、哈希表、滑动窗口,https://algo.itcharge.cn/Solutions/0900-0999/fruit-into-baskets/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0904.%20%E6%B0%B4%E6%9E%9C%E6%88%90%E7%AF%AE.md,44.8%,中等,1444 -0905,0900-0999,0905. 按奇偶排序数组,按奇偶排序数组,https://leetcode.cn/problems/sort-array-by-parity/,sort-array-by-parity,数组、双指针、排序,https://algo.itcharge.cn/Solutions/0900-0999/sort-array-by-parity/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0905.%20%E6%8C%89%E5%A5%87%E5%81%B6%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md,71.0%,简单,1444 -0906,0900-0999,0906. 超级回文数,超级回文数,https://leetcode.cn/problems/super-palindromes/,super-palindromes,数学、枚举,https://algo.itcharge.cn/Solutions/0900-0999/super-palindromes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0906.%20%E8%B6%85%E7%BA%A7%E5%9B%9E%E6%96%87%E6%95%B0.md,31.8%,困难,79 -0907,0900-0999,0907. 子数组的最小值之和,子数组的最小值之和,https://leetcode.cn/problems/sum-of-subarray-minimums/,sum-of-subarray-minimums,栈、数组、动态规划、单调栈,https://algo.itcharge.cn/Solutions/0900-0999/sum-of-subarray-minimums/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0907.%20%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%B0%8F%E5%80%BC%E4%B9%8B%E5%92%8C.md,38.3%,中等,438 -0908,0900-0999,0908. 最小差值 I,最小差值 I,https://leetcode.cn/problems/smallest-range-i/,smallest-range-i,数组、数学,https://algo.itcharge.cn/Solutions/0900-0999/smallest-range-i/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0908.%20%E6%9C%80%E5%B0%8F%E5%B7%AE%E5%80%BC%20I.md,74.4%,简单,581 -0909,0900-0999,0909. 蛇梯棋,蛇梯棋,https://leetcode.cn/problems/snakes-and-ladders/,snakes-and-ladders,广度优先搜索、数组、矩阵,https://algo.itcharge.cn/Solutions/0900-0999/snakes-and-ladders/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0909.%20%E8%9B%87%E6%A2%AF%E6%A3%8B.md,45.8%,中等,222 -0910,0900-0999,0910. 最小差值 II,最小差值 II,https://leetcode.cn/problems/smallest-range-ii/,smallest-range-ii,贪心、数组、数学、排序,https://algo.itcharge.cn/Solutions/0900-0999/smallest-range-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0910.%20%E6%9C%80%E5%B0%8F%E5%B7%AE%E5%80%BC%20II.md,35.6%,中等,123 -0911,0900-0999,0911. 在线选举,在线选举,https://leetcode.cn/problems/online-election/,online-election,设计、数组、哈希表、二分查找,https://algo.itcharge.cn/Solutions/0900-0999/online-election/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0911.%20%E5%9C%A8%E7%BA%BF%E9%80%89%E4%B8%BE.md,53.8%,中等,367 -0912,0900-0999,0912. 排序数组,排序数组,https://leetcode.cn/problems/sort-an-array/,sort-an-array,数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序,https://algo.itcharge.cn/Solutions/0900-0999/sort-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0912.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md,51.8%,中等,2119 -0913,0900-0999,0913. 猫和老鼠,猫和老鼠,https://leetcode.cn/problems/cat-and-mouse/,cat-and-mouse,图、拓扑排序、记忆化搜索、数学、动态规划、博弈,https://algo.itcharge.cn/Solutions/0900-0999/cat-and-mouse/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0913.%20%E7%8C%AB%E5%92%8C%E8%80%81%E9%BC%A0.md,54.0%,困难,140 -0914,0900-0999,0914. 卡牌分组,卡牌分组,https://leetcode.cn/problems/x-of-a-kind-in-a-deck-of-cards/,x-of-a-kind-in-a-deck-of-cards,数组、哈希表、数学、计数、数论,https://algo.itcharge.cn/Solutions/0900-0999/x-of-a-kind-in-a-deck-of-cards/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0914.%20%E5%8D%A1%E7%89%8C%E5%88%86%E7%BB%84.md,37.5%,简单,745 -0915,0900-0999,0915. 分割数组,分割数组,https://leetcode.cn/problems/partition-array-into-disjoint-intervals/,partition-array-into-disjoint-intervals,数组,https://algo.itcharge.cn/Solutions/0900-0999/partition-array-into-disjoint-intervals/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0915.%20%E5%88%86%E5%89%B2%E6%95%B0%E7%BB%84.md,50.1%,中等,560 -0916,0900-0999,0916. 单词子集,单词子集,https://leetcode.cn/problems/word-subsets/,word-subsets,数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/0900-0999/word-subsets/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0916.%20%E5%8D%95%E8%AF%8D%E5%AD%90%E9%9B%86.md,46.2%,中等,119 -0917,0900-0999,0917. 仅仅反转字母,仅仅反转字母,https://leetcode.cn/problems/reverse-only-letters/,reverse-only-letters,双指针、字符串,https://algo.itcharge.cn/Solutions/0900-0999/reverse-only-letters/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0917.%20%E4%BB%85%E4%BB%85%E5%8F%8D%E8%BD%AC%E5%AD%97%E6%AF%8D.md,59.4%,简单,1067 -0918,0900-0999,0918. 环形子数组的最大和,环形子数组的最大和,https://leetcode.cn/problems/maximum-sum-circular-subarray/,maximum-sum-circular-subarray,队列、数组、分治、动态规划、单调队列,https://algo.itcharge.cn/Solutions/0900-0999/maximum-sum-circular-subarray/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0918.%20%E7%8E%AF%E5%BD%A2%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%92%8C.md,37.8%,中等,509 -0919,0900-0999,0919. 完全二叉树插入器,完全二叉树插入器,https://leetcode.cn/problems/complete-binary-tree-inserter/,complete-binary-tree-inserter,树、广度优先搜索、设计、二叉树,https://algo.itcharge.cn/Solutions/0900-0999/complete-binary-tree-inserter/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0919.%20%E5%AE%8C%E5%85%A8%E4%BA%8C%E5%8F%89%E6%A0%91%E6%8F%92%E5%85%A5%E5%99%A8.md,66.9%,中等,414 -0920,0900-0999,0920. 播放列表的数量,播放列表的数量,https://leetcode.cn/problems/number-of-music-playlists/,number-of-music-playlists,数学、动态规划、组合数学,https://algo.itcharge.cn/Solutions/0900-0999/number-of-music-playlists/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0920.%20%E6%92%AD%E6%94%BE%E5%88%97%E8%A1%A8%E7%9A%84%E6%95%B0%E9%87%8F.md,52.2%,困难,41 -0921,0900-0999,0921. 使括号有效的最少添加,使括号有效的最少添加,https://leetcode.cn/problems/minimum-add-to-make-parentheses-valid/,minimum-add-to-make-parentheses-valid,栈、贪心、字符串,https://algo.itcharge.cn/Solutions/0900-0999/minimum-add-to-make-parentheses-valid/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0921.%20%E4%BD%BF%E6%8B%AC%E5%8F%B7%E6%9C%89%E6%95%88%E7%9A%84%E6%9C%80%E5%B0%91%E6%B7%BB%E5%8A%A0.md,73.0%,中等,916 -0922,0900-0999,0922. 按奇偶排序数组 II,按奇偶排序数组 II,https://leetcode.cn/problems/sort-array-by-parity-ii/,sort-array-by-parity-ii,数组、双指针、排序,https://algo.itcharge.cn/Solutions/0900-0999/sort-array-by-parity-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0922.%20%E6%8C%89%E5%A5%87%E5%81%B6%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%20II.md,71.3%,简单,1069 -0923,0900-0999,0923. 三数之和的多种可能,三数之和的多种可能,https://leetcode.cn/problems/3sum-with-multiplicity/,3sum-with-multiplicity,数组、哈希表、双指针、计数、排序,https://algo.itcharge.cn/Solutions/0900-0999/3sum-with-multiplicity/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0923.%20%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C%E7%9A%84%E5%A4%9A%E7%A7%8D%E5%8F%AF%E8%83%BD.md,36.9%,中等,120 -0924,0900-0999,0924. 尽量减少恶意软件的传播,尽量减少恶意软件的传播,https://leetcode.cn/problems/minimize-malware-spread/,minimize-malware-spread,深度优先搜索、广度优先搜索、并查集、数组、矩阵,https://algo.itcharge.cn/Solutions/0900-0999/minimize-malware-spread/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0924.%20%E5%B0%BD%E9%87%8F%E5%87%8F%E5%B0%91%E6%81%B6%E6%84%8F%E8%BD%AF%E4%BB%B6%E7%9A%84%E4%BC%A0%E6%92%AD.md,35.8%,困难,148 -0925,0900-0999,0925. 长按键入,长按键入,https://leetcode.cn/problems/long-pressed-name/,long-pressed-name,双指针、字符串,https://algo.itcharge.cn/Solutions/0900-0999/long-pressed-name/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0925.%20%E9%95%BF%E6%8C%89%E9%94%AE%E5%85%A5.md,37.5%,简单,828 -0926,0900-0999,0926. 将字符串翻转到单调递增,将字符串翻转到单调递增,https://leetcode.cn/problems/flip-string-to-monotone-increasing/,flip-string-to-monotone-increasing,字符串、动态规划,https://algo.itcharge.cn/Solutions/0900-0999/flip-string-to-monotone-increasing/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0926.%20%E5%B0%86%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%BF%BB%E8%BD%AC%E5%88%B0%E5%8D%95%E8%B0%83%E9%80%92%E5%A2%9E.md,63.5%,中等,518 -0927,0900-0999,0927. 三等分,三等分,https://leetcode.cn/problems/three-equal-parts/,three-equal-parts,数组、数学,https://algo.itcharge.cn/Solutions/0900-0999/three-equal-parts/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0927.%20%E4%B8%89%E7%AD%89%E5%88%86.md,43.9%,困难,365 -0928,0900-0999,0928. 尽量减少恶意软件的传播 II,尽量减少恶意软件的传播 II,https://leetcode.cn/problems/minimize-malware-spread-ii/,minimize-malware-spread-ii,深度优先搜索、广度优先搜索、并查集、数组、矩阵,https://algo.itcharge.cn/Solutions/0900-0999/minimize-malware-spread-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0928.%20%E5%B0%BD%E9%87%8F%E5%87%8F%E5%B0%91%E6%81%B6%E6%84%8F%E8%BD%AF%E4%BB%B6%E7%9A%84%E4%BC%A0%E6%92%AD%20II.md,43.7%,困难,74 -0929,0900-0999,0929. 独特的电子邮件地址,独特的电子邮件地址,https://leetcode.cn/problems/unique-email-addresses/,unique-email-addresses,数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/0900-0999/unique-email-addresses/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0929.%20%E7%8B%AC%E7%89%B9%E7%9A%84%E7%94%B5%E5%AD%90%E9%82%AE%E4%BB%B6%E5%9C%B0%E5%9D%80.md,68.6%,简单,539 -0930,0900-0999,0930. 和相同的二元子数组,和相同的二元子数组,https://leetcode.cn/problems/binary-subarrays-with-sum/,binary-subarrays-with-sum,数组、哈希表、前缀和、滑动窗口,https://algo.itcharge.cn/Solutions/0900-0999/binary-subarrays-with-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0930.%20%E5%92%8C%E7%9B%B8%E5%90%8C%E7%9A%84%E4%BA%8C%E5%85%83%E5%AD%90%E6%95%B0%E7%BB%84.md,55.1%,中等,438 -0931,0900-0999,0931. 下降路径最小和,下降路径最小和,https://leetcode.cn/problems/minimum-falling-path-sum/,minimum-falling-path-sum,数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/0900-0999/minimum-falling-path-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0931.%20%E4%B8%8B%E9%99%8D%E8%B7%AF%E5%BE%84%E6%9C%80%E5%B0%8F%E5%92%8C.md,67.1%,中等,1052 -0932,0900-0999,0932. 漂亮数组,漂亮数组,https://leetcode.cn/problems/beautiful-array/,beautiful-array,数组、数学、分治,https://algo.itcharge.cn/Solutions/0900-0999/beautiful-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0932.%20%E6%BC%82%E4%BA%AE%E6%95%B0%E7%BB%84.md,65.6%,中等,130 -0933,0900-0999,0933. 最近的请求次数,最近的请求次数,https://leetcode.cn/problems/number-of-recent-calls/,number-of-recent-calls,设计、队列、数据流,https://algo.itcharge.cn/Solutions/0900-0999/number-of-recent-calls/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0933.%20%E6%9C%80%E8%BF%91%E7%9A%84%E8%AF%B7%E6%B1%82%E6%AC%A1%E6%95%B0.md,76.8%,简单,835 -0934,0900-0999,0934. 最短的桥,最短的桥,https://leetcode.cn/problems/shortest-bridge/,shortest-bridge,深度优先搜索、广度优先搜索、数组、矩阵,https://algo.itcharge.cn/Solutions/0900-0999/shortest-bridge/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0934.%20%E6%9C%80%E7%9F%AD%E7%9A%84%E6%A1%A5.md,52.4%,中等,730 -0935,0900-0999,0935. 骑士拨号器,骑士拨号器,https://leetcode.cn/problems/knight-dialer/,knight-dialer,动态规划,https://algo.itcharge.cn/Solutions/0900-0999/knight-dialer/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0935.%20%E9%AA%91%E5%A3%AB%E6%8B%A8%E5%8F%B7%E5%99%A8.md,51.5%,中等,130 -0936,0900-0999,0936. 戳印序列,戳印序列,https://leetcode.cn/problems/stamping-the-sequence/,stamping-the-sequence,栈、贪心、队列、字符串,https://algo.itcharge.cn/Solutions/0900-0999/stamping-the-sequence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0936.%20%E6%88%B3%E5%8D%B0%E5%BA%8F%E5%88%97.md,42.3%,困难,39 -0937,0900-0999,0937. 重新排列日志文件,重新排列日志文件,https://leetcode.cn/problems/reorder-data-in-log-files/,reorder-data-in-log-files,数组、字符串、排序,https://algo.itcharge.cn/Solutions/0900-0999/reorder-data-in-log-files/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0937.%20%E9%87%8D%E6%96%B0%E6%8E%92%E5%88%97%E6%97%A5%E5%BF%97%E6%96%87%E4%BB%B6.md,63.5%,中等,504 -0938,0900-0999,0938. 二叉搜索树的范围和,二叉搜索树的范围和,https://leetcode.cn/problems/range-sum-of-bst/,range-sum-of-bst,树、深度优先搜索、二叉搜索树、二叉树,https://algo.itcharge.cn/Solutions/0900-0999/range-sum-of-bst/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0938.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E8%8C%83%E5%9B%B4%E5%92%8C.md,82.1%,简单,999 -0939,0900-0999,0939. 最小面积矩形,最小面积矩形,https://leetcode.cn/problems/minimum-area-rectangle/,minimum-area-rectangle,几何、数组、哈希表、数学、排序,https://algo.itcharge.cn/Solutions/0900-0999/minimum-area-rectangle/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0939.%20%E6%9C%80%E5%B0%8F%E9%9D%A2%E7%A7%AF%E7%9F%A9%E5%BD%A2.md,48.4%,中等,104 -0940,0900-0999,0940. 不同的子序列 II,不同的子序列 II,https://leetcode.cn/problems/distinct-subsequences-ii/,distinct-subsequences-ii,字符串、动态规划,https://algo.itcharge.cn/Solutions/0900-0999/distinct-subsequences-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0940.%20%E4%B8%8D%E5%90%8C%E7%9A%84%E5%AD%90%E5%BA%8F%E5%88%97%20II.md,53.5%,困难,283 -0941,0900-0999,0941. 有效的山脉数组,有效的山脉数组,https://leetcode.cn/problems/valid-mountain-array/,valid-mountain-array,数组,https://algo.itcharge.cn/Solutions/0900-0999/valid-mountain-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0941.%20%E6%9C%89%E6%95%88%E7%9A%84%E5%B1%B1%E8%84%89%E6%95%B0%E7%BB%84.md,39.5%,简单,805 -0942,0900-0999,0942. 增减字符串匹配,增减字符串匹配,https://leetcode.cn/problems/di-string-match/,di-string-match,贪心、数组、双指针、字符串,https://algo.itcharge.cn/Solutions/0900-0999/di-string-match/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0942.%20%E5%A2%9E%E5%87%8F%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%8C%B9%E9%85%8D.md,77.2%,简单,794 -0943,0900-0999,0943. 最短超级串,最短超级串,https://leetcode.cn/problems/find-the-shortest-superstring/,find-the-shortest-superstring,位运算、数组、字符串、动态规划、状态压缩,https://algo.itcharge.cn/Solutions/0900-0999/find-the-shortest-superstring/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0943.%20%E6%9C%80%E7%9F%AD%E8%B6%85%E7%BA%A7%E4%B8%B2.md,47.2%,困难,76 -0944,0900-0999,0944. 删列造序,删列造序,https://leetcode.cn/problems/delete-columns-to-make-sorted/,delete-columns-to-make-sorted,数组、字符串,https://algo.itcharge.cn/Solutions/0900-0999/delete-columns-to-make-sorted/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0944.%20%E5%88%A0%E5%88%97%E9%80%A0%E5%BA%8F.md,69.0%,简单,504 -0945,0900-0999,0945. 使数组唯一的最小增量,使数组唯一的最小增量,https://leetcode.cn/problems/minimum-increment-to-make-array-unique/,minimum-increment-to-make-array-unique,贪心、数组、计数、排序,https://algo.itcharge.cn/Solutions/0900-0999/minimum-increment-to-make-array-unique/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0945.%20%E4%BD%BF%E6%95%B0%E7%BB%84%E5%94%AF%E4%B8%80%E7%9A%84%E6%9C%80%E5%B0%8F%E5%A2%9E%E9%87%8F.md,47.9%,中等,619 -0946,0900-0999,0946. 验证栈序列,验证栈序列,https://leetcode.cn/problems/validate-stack-sequences/,validate-stack-sequences,栈、数组、模拟,https://algo.itcharge.cn/Solutions/0900-0999/validate-stack-sequences/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0946.%20%E9%AA%8C%E8%AF%81%E6%A0%88%E5%BA%8F%E5%88%97.md,66.6%,中等,851 -0947,0900-0999,0947. 移除最多的同行或同列石头,移除最多的同行或同列石头,https://leetcode.cn/problems/most-stones-removed-with-same-row-or-column/,most-stones-removed-with-same-row-or-column,深度优先搜索、并查集、图,https://algo.itcharge.cn/Solutions/0900-0999/most-stones-removed-with-same-row-or-column/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0947.%20%E7%A7%BB%E9%99%A4%E6%9C%80%E5%A4%9A%E7%9A%84%E5%90%8C%E8%A1%8C%E6%88%96%E5%90%8C%E5%88%97%E7%9F%B3%E5%A4%B4.md,61.6%,中等,426 -0948,0900-0999,0948. 令牌放置,令牌放置,https://leetcode.cn/problems/bag-of-tokens/,bag-of-tokens,贪心、数组、双指针、排序,https://algo.itcharge.cn/Solutions/0900-0999/bag-of-tokens/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0948.%20%E4%BB%A4%E7%89%8C%E6%94%BE%E7%BD%AE.md,40.5%,中等,157 -0949,0900-0999,0949. 给定数字能组成的最大时间,给定数字能组成的最大时间,https://leetcode.cn/problems/largest-time-for-given-digits/,largest-time-for-given-digits,字符串、枚举,https://algo.itcharge.cn/Solutions/0900-0999/largest-time-for-given-digits/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0949.%20%E7%BB%99%E5%AE%9A%E6%95%B0%E5%AD%97%E8%83%BD%E7%BB%84%E6%88%90%E7%9A%84%E6%9C%80%E5%A4%A7%E6%97%B6%E9%97%B4.md,37.9%,中等,184 -0950,0900-0999,0950. 按递增顺序显示卡牌,按递增顺序显示卡牌,https://leetcode.cn/problems/reveal-cards-in-increasing-order/,reveal-cards-in-increasing-order,队列、数组、排序、模拟,https://algo.itcharge.cn/Solutions/0900-0999/reveal-cards-in-increasing-order/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0950.%20%E6%8C%89%E9%80%92%E5%A2%9E%E9%A1%BA%E5%BA%8F%E6%98%BE%E7%A4%BA%E5%8D%A1%E7%89%8C.md,78.6%,中等,233 -0951,0900-0999,0951. 翻转等价二叉树,翻转等价二叉树,https://leetcode.cn/problems/flip-equivalent-binary-trees/,flip-equivalent-binary-trees,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0900-0999/flip-equivalent-binary-trees/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0951.%20%E7%BF%BB%E8%BD%AC%E7%AD%89%E4%BB%B7%E4%BA%8C%E5%8F%89%E6%A0%91.md,66.8%,中等,253 -0952,0900-0999,0952. 按公因数计算最大组件大小,按公因数计算最大组件大小,https://leetcode.cn/problems/largest-component-size-by-common-factor/,largest-component-size-by-common-factor,并查集、数组、数学、数论,https://algo.itcharge.cn/Solutions/0900-0999/largest-component-size-by-common-factor/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0952.%20%E6%8C%89%E5%85%AC%E5%9B%A0%E6%95%B0%E8%AE%A1%E7%AE%97%E6%9C%80%E5%A4%A7%E7%BB%84%E4%BB%B6%E5%A4%A7%E5%B0%8F.md,51.1%,困难,184 -0953,0900-0999,0953. 验证外星语词典,验证外星语词典,https://leetcode.cn/problems/verifying-an-alien-dictionary/,verifying-an-alien-dictionary,数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/0900-0999/verifying-an-alien-dictionary/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0953.%20%E9%AA%8C%E8%AF%81%E5%A4%96%E6%98%9F%E8%AF%AD%E8%AF%8D%E5%85%B8.md,57.7%,简单,699 -0954,0900-0999,0954. 二倍数对数组,二倍数对数组,https://leetcode.cn/problems/array-of-doubled-pairs/,array-of-doubled-pairs,贪心、数组、哈希表、排序,https://algo.itcharge.cn/Solutions/0900-0999/array-of-doubled-pairs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0954.%20%E4%BA%8C%E5%80%8D%E6%95%B0%E5%AF%B9%E6%95%B0%E7%BB%84.md,39.1%,中等,478 -0955,0900-0999,0955. 删列造序 II,删列造序 II,https://leetcode.cn/problems/delete-columns-to-make-sorted-ii/,delete-columns-to-make-sorted-ii,贪心、数组、字符串,https://algo.itcharge.cn/Solutions/0900-0999/delete-columns-to-make-sorted-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0955.%20%E5%88%A0%E5%88%97%E9%80%A0%E5%BA%8F%20II.md,35.5%,中等,90 -0956,0900-0999,0956. 最高的广告牌,最高的广告牌,https://leetcode.cn/problems/tallest-billboard/,tallest-billboard,数组、动态规划,https://algo.itcharge.cn/Solutions/0900-0999/tallest-billboard/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0956.%20%E6%9C%80%E9%AB%98%E7%9A%84%E5%B9%BF%E5%91%8A%E7%89%8C.md,46.4%,困难,78 -0957,0900-0999,0957. N 天后的牢房,N 天后的牢房,https://leetcode.cn/problems/prison-cells-after-n-days/,prison-cells-after-n-days,位运算、数组、哈希表、数学,https://algo.itcharge.cn/Solutions/0900-0999/prison-cells-after-n-days/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0957.%20N%20%E5%A4%A9%E5%90%8E%E7%9A%84%E7%89%A2%E6%88%BF.md,37.0%,中等,189 -0958,0900-0999,0958. 二叉树的完全性检验,二叉树的完全性检验,https://leetcode.cn/problems/check-completeness-of-a-binary-tree/,check-completeness-of-a-binary-tree,树、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0900-0999/check-completeness-of-a-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0958.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%AE%8C%E5%85%A8%E6%80%A7%E6%A3%80%E9%AA%8C.md,54.5%,中等,459 -0959,0900-0999,0959. 由斜杠划分区域,由斜杠划分区域,https://leetcode.cn/problems/regions-cut-by-slashes/,regions-cut-by-slashes,深度优先搜索、广度优先搜索、并查集、图,https://algo.itcharge.cn/Solutions/0900-0999/regions-cut-by-slashes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0959.%20%E7%94%B1%E6%96%9C%E6%9D%A0%E5%88%92%E5%88%86%E5%8C%BA%E5%9F%9F.md,74.3%,中等,354 -0960,0900-0999,0960. 删列造序 III,删列造序 III,https://leetcode.cn/problems/delete-columns-to-make-sorted-iii/,delete-columns-to-make-sorted-iii,数组、字符串、动态规划,https://algo.itcharge.cn/Solutions/0900-0999/delete-columns-to-make-sorted-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0960.%20%E5%88%A0%E5%88%97%E9%80%A0%E5%BA%8F%20III.md,59.0%,困难,61 -0961,0900-0999,0961. 在长度 2N 的数组中找出重复 N 次的元素,在长度 2N 的数组中找出重复 N 次的元素,https://leetcode.cn/problems/n-repeated-element-in-size-2n-array/,n-repeated-element-in-size-2n-array,数组、哈希表,https://algo.itcharge.cn/Solutions/0900-0999/n-repeated-element-in-size-2n-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0961.%20%E5%9C%A8%E9%95%BF%E5%BA%A6%202N%20%E7%9A%84%E6%95%B0%E7%BB%84%E4%B8%AD%E6%89%BE%E5%87%BA%E9%87%8D%E5%A4%8D%20N%20%E6%AC%A1%E7%9A%84%E5%85%83%E7%B4%A0.md,70.2%,简单,726 -0962,0900-0999,0962. 最大宽度坡,最大宽度坡,https://leetcode.cn/problems/maximum-width-ramp/,maximum-width-ramp,栈、数组、单调栈,https://algo.itcharge.cn/Solutions/0900-0999/maximum-width-ramp/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0962.%20%E6%9C%80%E5%A4%A7%E5%AE%BD%E5%BA%A6%E5%9D%A1.md,47.4%,中等,227 -0963,0900-0999,0963. 最小面积矩形 II,最小面积矩形 II,https://leetcode.cn/problems/minimum-area-rectangle-ii/,minimum-area-rectangle-ii,几何、数组、数学,https://algo.itcharge.cn/Solutions/0900-0999/minimum-area-rectangle-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0963.%20%E6%9C%80%E5%B0%8F%E9%9D%A2%E7%A7%AF%E7%9F%A9%E5%BD%A2%20II.md,51.1%,中等,52 -0964,0900-0999,0964. 表示数字的最少运算符,表示数字的最少运算符,https://leetcode.cn/problems/least-operators-to-express-number/,least-operators-to-express-number,记忆化搜索、数学、动态规划,https://algo.itcharge.cn/Solutions/0900-0999/least-operators-to-express-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0964.%20%E8%A1%A8%E7%A4%BA%E6%95%B0%E5%AD%97%E7%9A%84%E6%9C%80%E5%B0%91%E8%BF%90%E7%AE%97%E7%AC%A6.md,46.6%,困难,40 -0965,0900-0999,0965. 单值二叉树,单值二叉树,https://leetcode.cn/problems/univalued-binary-tree/,univalued-binary-tree,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0900-0999/univalued-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0965.%20%E5%8D%95%E5%80%BC%E4%BA%8C%E5%8F%89%E6%A0%91.md,70.7%,简单,881 -0966,0900-0999,0966. 元音拼写检查器,元音拼写检查器,https://leetcode.cn/problems/vowel-spellchecker/,vowel-spellchecker,数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/0900-0999/vowel-spellchecker/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0966.%20%E5%85%83%E9%9F%B3%E6%8B%BC%E5%86%99%E6%A3%80%E6%9F%A5%E5%99%A8.md,43.0%,中等,69 -0967,0900-0999,0967. 连续差相同的数字,连续差相同的数字,https://leetcode.cn/problems/numbers-with-same-consecutive-differences/,numbers-with-same-consecutive-differences,广度优先搜索、回溯,https://algo.itcharge.cn/Solutions/0900-0999/numbers-with-same-consecutive-differences/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0967.%20%E8%BF%9E%E7%BB%AD%E5%B7%AE%E7%9B%B8%E5%90%8C%E7%9A%84%E6%95%B0%E5%AD%97.md,50.5%,中等,237 -0968,0900-0999,0968. 监控二叉树,监控二叉树,https://leetcode.cn/problems/binary-tree-cameras/,binary-tree-cameras,树、深度优先搜索、动态规划、二叉树,https://algo.itcharge.cn/Solutions/0900-0999/binary-tree-cameras/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0968.%20%E7%9B%91%E6%8E%A7%E4%BA%8C%E5%8F%89%E6%A0%91.md,52.3%,困难,618 -0969,0900-0999,0969. 煎饼排序,煎饼排序,https://leetcode.cn/problems/pancake-sorting/,pancake-sorting,贪心、数组、双指针、排序,https://algo.itcharge.cn/Solutions/0900-0999/pancake-sorting/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0969.%20%E7%85%8E%E9%A5%BC%E6%8E%92%E5%BA%8F.md,67.5%,中等,684 -0970,0900-0999,0970. 强整数,强整数,https://leetcode.cn/problems/powerful-integers/,powerful-integers,哈希表、数学,https://algo.itcharge.cn/Solutions/0900-0999/powerful-integers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0970.%20%E5%BC%BA%E6%95%B4%E6%95%B0.md,47.0%,中等,307 -0971,0900-0999,0971. 翻转二叉树以匹配先序遍历,翻转二叉树以匹配先序遍历,https://leetcode.cn/problems/flip-binary-tree-to-match-preorder-traversal/,flip-binary-tree-to-match-preorder-traversal,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0900-0999/flip-binary-tree-to-match-preorder-traversal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0971.%20%E7%BF%BB%E8%BD%AC%E4%BA%8C%E5%8F%89%E6%A0%91%E4%BB%A5%E5%8C%B9%E9%85%8D%E5%85%88%E5%BA%8F%E9%81%8D%E5%8E%86.md,45.5%,中等,164 -0972,0900-0999,0972. 相等的有理数,相等的有理数,https://leetcode.cn/problems/equal-rational-numbers/,equal-rational-numbers,数学、字符串,https://algo.itcharge.cn/Solutions/0900-0999/equal-rational-numbers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0972.%20%E7%9B%B8%E7%AD%89%E7%9A%84%E6%9C%89%E7%90%86%E6%95%B0.md,41.5%,困难,53 -0973,0900-0999,0973. 最接近原点的 K 个点,最接近原点的 K 个点,https://leetcode.cn/problems/k-closest-points-to-origin/,k-closest-points-to-origin,几何、数组、数学、分治、快速选择、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/0900-0999/k-closest-points-to-origin/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0973.%20%E6%9C%80%E6%8E%A5%E8%BF%91%E5%8E%9F%E7%82%B9%E7%9A%84%20K%20%E4%B8%AA%E7%82%B9.md,65.2%,中等,823 -0974,0900-0999,0974. 和可被 K 整除的子数组,和可被 K 整除的子数组,https://leetcode.cn/problems/subarray-sums-divisible-by-k/,subarray-sums-divisible-by-k,数组、哈希表、前缀和,https://algo.itcharge.cn/Solutions/0900-0999/subarray-sums-divisible-by-k/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0974.%20%E5%92%8C%E5%8F%AF%E8%A2%AB%20K%20%E6%95%B4%E9%99%A4%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md,47.9%,中等,540 -0975,0900-0999,0975. 奇偶跳,奇偶跳,https://leetcode.cn/problems/odd-even-jump/,odd-even-jump,栈、数组、动态规划、有序集合、单调栈,https://algo.itcharge.cn/Solutions/0900-0999/odd-even-jump/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0975.%20%E5%A5%87%E5%81%B6%E8%B7%B3.md,47.8%,困难,90 -0976,0900-0999,0976. 三角形的最大周长,三角形的最大周长,https://leetcode.cn/problems/largest-perimeter-triangle/,largest-perimeter-triangle,贪心、数组、数学、排序,https://algo.itcharge.cn/Solutions/0900-0999/largest-perimeter-triangle/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0976.%20%E4%B8%89%E8%A7%92%E5%BD%A2%E7%9A%84%E6%9C%80%E5%A4%A7%E5%91%A8%E9%95%BF.md,57.5%,简单,842 -0977,0900-0999,0977. 有序数组的平方,有序数组的平方,https://leetcode.cn/problems/squares-of-a-sorted-array/,squares-of-a-sorted-array,数组、双指针、排序,https://algo.itcharge.cn/Solutions/0900-0999/squares-of-a-sorted-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0977.%20%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E7%9A%84%E5%B9%B3%E6%96%B9.md,68.0%,简单,3385 -0978,0900-0999,0978. 最长湍流子数组,最长湍流子数组,https://leetcode.cn/problems/longest-turbulent-subarray/,longest-turbulent-subarray,数组、动态规划、滑动窗口,https://algo.itcharge.cn/Solutions/0900-0999/longest-turbulent-subarray/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0978.%20%E6%9C%80%E9%95%BF%E6%B9%8D%E6%B5%81%E5%AD%90%E6%95%B0%E7%BB%84.md,47.5%,中等,690 -0979,0900-0999,0979. 在二叉树中分配硬币,在二叉树中分配硬币,https://leetcode.cn/problems/distribute-coins-in-binary-tree/,distribute-coins-in-binary-tree,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0900-0999/distribute-coins-in-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0979.%20%E5%9C%A8%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E5%88%86%E9%85%8D%E7%A1%AC%E5%B8%81.md,72.4%,中等,204 -0980,0900-0999,0980. 不同路径 III,不同路径 III,https://leetcode.cn/problems/unique-paths-iii/,unique-paths-iii,位运算、数组、回溯、矩阵,https://algo.itcharge.cn/Solutions/0900-0999/unique-paths-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0980.%20%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84%20III.md,74.1%,困难,307 -0981,0900-0999,0981. 基于时间的键值存储,基于时间的键值存储,https://leetcode.cn/problems/time-based-key-value-store/,time-based-key-value-store,设计、哈希表、字符串、二分查找,https://algo.itcharge.cn/Solutions/0900-0999/time-based-key-value-store/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0981.%20%E5%9F%BA%E4%BA%8E%E6%97%B6%E9%97%B4%E7%9A%84%E9%94%AE%E5%80%BC%E5%AD%98%E5%82%A8.md,52.9%,中等,388 -0982,0900-0999,0982. 按位与为零的三元组,按位与为零的三元组,https://leetcode.cn/problems/triples-with-bitwise-and-equal-to-zero/,triples-with-bitwise-and-equal-to-zero,位运算、数组、哈希表,https://algo.itcharge.cn/Solutions/0900-0999/triples-with-bitwise-and-equal-to-zero/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0982.%20%E6%8C%89%E4%BD%8D%E4%B8%8E%E4%B8%BA%E9%9B%B6%E7%9A%84%E4%B8%89%E5%85%83%E7%BB%84.md,67.3%,困难,151 -0983,0900-0999,0983. 最低票价,最低票价,https://leetcode.cn/problems/minimum-cost-for-tickets/,minimum-cost-for-tickets,数组、动态规划,https://algo.itcharge.cn/Solutions/0900-0999/minimum-cost-for-tickets/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0983.%20%E6%9C%80%E4%BD%8E%E7%A5%A8%E4%BB%B7.md,63.5%,中等,545 -0984,0900-0999,0984. 不含 AAA 或 BBB 的字符串,不含 AAA 或 BBB 的字符串,https://leetcode.cn/problems/string-without-aaa-or-bbb/,string-without-aaa-or-bbb,贪心、字符串,https://algo.itcharge.cn/Solutions/0900-0999/string-without-aaa-or-bbb/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0984.%20%E4%B8%8D%E5%90%AB%20AAA%20%E6%88%96%20BBB%20%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2.md,43.4%,中等,217 -0985,0900-0999,0985. 查询后的偶数和,查询后的偶数和,https://leetcode.cn/problems/sum-of-even-numbers-after-queries/,sum-of-even-numbers-after-queries,数组、模拟,https://algo.itcharge.cn/Solutions/0900-0999/sum-of-even-numbers-after-queries/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0985.%20%E6%9F%A5%E8%AF%A2%E5%90%8E%E7%9A%84%E5%81%B6%E6%95%B0%E5%92%8C.md,61.1%,中等,225 -0986,0900-0999,0986. 区间列表的交集,区间列表的交集,https://leetcode.cn/problems/interval-list-intersections/,interval-list-intersections,数组、双指针,https://algo.itcharge.cn/Solutions/0900-0999/interval-list-intersections/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0986.%20%E5%8C%BA%E9%97%B4%E5%88%97%E8%A1%A8%E7%9A%84%E4%BA%A4%E9%9B%86.md,68.5%,中等,590 -0987,0900-0999,0987. 二叉树的垂序遍历,二叉树的垂序遍历,https://leetcode.cn/problems/vertical-order-traversal-of-a-binary-tree/,vertical-order-traversal-of-a-binary-tree,树、深度优先搜索、广度优先搜索、哈希表、二叉树,https://algo.itcharge.cn/Solutions/0900-0999/vertical-order-traversal-of-a-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0987.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%9E%82%E5%BA%8F%E9%81%8D%E5%8E%86.md,53.8%,困难,513 -0988,0900-0999,0988. 从叶结点开始的最小字符串,从叶结点开始的最小字符串,https://leetcode.cn/problems/smallest-string-starting-from-leaf/,smallest-string-starting-from-leaf,树、深度优先搜索、字符串、二叉树,https://algo.itcharge.cn/Solutions/0900-0999/smallest-string-starting-from-leaf/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0988.%20%E4%BB%8E%E5%8F%B6%E7%BB%93%E7%82%B9%E5%BC%80%E5%A7%8B%E7%9A%84%E6%9C%80%E5%B0%8F%E5%AD%97%E7%AC%A6%E4%B8%B2.md,51.1%,中等,193 -0989,0900-0999,0989. 数组形式的整数加法,数组形式的整数加法,https://leetcode.cn/problems/add-to-array-form-of-integer/,add-to-array-form-of-integer,数组、数学,https://algo.itcharge.cn/Solutions/0900-0999/add-to-array-form-of-integer/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0989.%20%E6%95%B0%E7%BB%84%E5%BD%A2%E5%BC%8F%E7%9A%84%E6%95%B4%E6%95%B0%E5%8A%A0%E6%B3%95.md,46.0%,简单,787 -0990,0900-0999,0990. 等式方程的可满足性,等式方程的可满足性,https://leetcode.cn/problems/satisfiability-of-equality-equations/,satisfiability-of-equality-equations,并查集、图、数组、字符串,https://algo.itcharge.cn/Solutions/0900-0999/satisfiability-of-equality-equations/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0990.%20%E7%AD%89%E5%BC%8F%E6%96%B9%E7%A8%8B%E7%9A%84%E5%8F%AF%E6%BB%A1%E8%B6%B3%E6%80%A7.md,53.4%,中等,898 -0991,0900-0999,0991. 坏了的计算器,坏了的计算器,https://leetcode.cn/problems/broken-calculator/,broken-calculator,贪心、数学,https://algo.itcharge.cn/Solutions/0900-0999/broken-calculator/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0991.%20%E5%9D%8F%E4%BA%86%E7%9A%84%E8%AE%A1%E7%AE%97%E5%99%A8.md,52.3%,中等,145 -0992,0900-0999,0992. K 个不同整数的子数组,K 个不同整数的子数组,https://leetcode.cn/problems/subarrays-with-k-different-integers/,subarrays-with-k-different-integers,数组、哈希表、计数、滑动窗口,https://algo.itcharge.cn/Solutions/0900-0999/subarrays-with-k-different-integers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0992.%20K%20%E4%B8%AA%E4%B8%8D%E5%90%8C%E6%95%B4%E6%95%B0%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md,47.5%,困难,336 -0993,0900-0999,0993. 二叉树的堂兄弟节点,二叉树的堂兄弟节点,https://leetcode.cn/problems/cousins-in-binary-tree/,cousins-in-binary-tree,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/0900-0999/cousins-in-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0993.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%A0%82%E5%85%84%E5%BC%9F%E8%8A%82%E7%82%B9.md,55.8%,简单,1010 -0994,0900-0999,0994. 腐烂的橘子,腐烂的橘子,https://leetcode.cn/problems/rotting-oranges/,rotting-oranges,广度优先搜索、数组、矩阵,https://algo.itcharge.cn/Solutions/0900-0999/rotting-oranges/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0994.%20%E8%85%90%E7%83%82%E7%9A%84%E6%A9%98%E5%AD%90.md,51.0%,中等,2107 -0995,0900-0999,0995. K 连续位的最小翻转次数,K 连续位的最小翻转次数,https://leetcode.cn/problems/minimum-number-of-k-consecutive-bit-flips/,minimum-number-of-k-consecutive-bit-flips,位运算、队列、数组、前缀和、滑动窗口,https://algo.itcharge.cn/Solutions/0900-0999/minimum-number-of-k-consecutive-bit-flips/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0995.%20K%20%E8%BF%9E%E7%BB%AD%E4%BD%8D%E7%9A%84%E6%9C%80%E5%B0%8F%E7%BF%BB%E8%BD%AC%E6%AC%A1%E6%95%B0.md,53.9%,困难,287 -0996,0900-0999,0996. 正方形数组的数目,正方形数组的数目,https://leetcode.cn/problems/number-of-squareful-arrays/,number-of-squareful-arrays,位运算、数组、数学、动态规划、回溯、状态压缩,https://algo.itcharge.cn/Solutions/0900-0999/number-of-squareful-arrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0996.%20%E6%AD%A3%E6%96%B9%E5%BD%A2%E6%95%B0%E7%BB%84%E7%9A%84%E6%95%B0%E7%9B%AE.md,50.4%,困难,138 -0997,0900-0999,0997. 找到小镇的法官,找到小镇的法官,https://leetcode.cn/problems/find-the-town-judge/,find-the-town-judge,图、数组、哈希表,https://algo.itcharge.cn/Solutions/0900-0999/find-the-town-judge/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0997.%20%E6%89%BE%E5%88%B0%E5%B0%8F%E9%95%87%E7%9A%84%E6%B3%95%E5%AE%98.md,51.9%,简单,863 -0998,0900-0999,0998. 最大二叉树 II,最大二叉树 II,https://leetcode.cn/problems/maximum-binary-tree-ii/,maximum-binary-tree-ii,树、二叉树,https://algo.itcharge.cn/Solutions/0900-0999/maximum-binary-tree-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0998.%20%E6%9C%80%E5%A4%A7%E4%BA%8C%E5%8F%89%E6%A0%91%20II.md,68.7%,中等,437 -0999,0900-0999,0999. 可以被一步捕获的棋子数,可以被一步捕获的棋子数,https://leetcode.cn/problems/available-captures-for-rook/,available-captures-for-rook,数组、矩阵、模拟,https://algo.itcharge.cn/Solutions/0900-0999/available-captures-for-rook/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0999.%20%E5%8F%AF%E4%BB%A5%E8%A2%AB%E4%B8%80%E6%AD%A5%E6%8D%95%E8%8E%B7%E7%9A%84%E6%A3%8B%E5%AD%90%E6%95%B0.md,69.3%,简单,639 -1000,1000-1099,1000. 合并石头的最低成本,合并石头的最低成本,https://leetcode.cn/problems/minimum-cost-to-merge-stones/,minimum-cost-to-merge-stones,数组、动态规划、前缀和,https://algo.itcharge.cn/Solutions/1000-1099/minimum-cost-to-merge-stones/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1000.%20%E5%90%88%E5%B9%B6%E7%9F%B3%E5%A4%B4%E7%9A%84%E6%9C%80%E4%BD%8E%E6%88%90%E6%9C%AC.md,53.6%,困难,110 -1001,1000-1099,1001. 网格照明,网格照明,https://leetcode.cn/problems/grid-illumination/,grid-illumination,数组、哈希表,https://algo.itcharge.cn/Solutions/1000-1099/grid-illumination/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1001.%20%E7%BD%91%E6%A0%BC%E7%85%A7%E6%98%8E.md,44.9%,困难,283 -1002,1000-1099,1002. 查找共用字符,查找共用字符,https://leetcode.cn/problems/find-common-characters/,find-common-characters,数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/1000-1099/find-common-characters/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1002.%20%E6%9F%A5%E6%89%BE%E5%85%B1%E7%94%A8%E5%AD%97%E7%AC%A6.md,70.6%,简单,842 -1003,1000-1099,1003. 检查替换后的词是否有效,检查替换后的词是否有效,https://leetcode.cn/problems/check-if-word-is-valid-after-substitutions/,check-if-word-is-valid-after-substitutions,栈、字符串,https://algo.itcharge.cn/Solutions/1000-1099/check-if-word-is-valid-after-substitutions/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1003.%20%E6%A3%80%E6%9F%A5%E6%9B%BF%E6%8D%A2%E5%90%8E%E7%9A%84%E8%AF%8D%E6%98%AF%E5%90%A6%E6%9C%89%E6%95%88.md,63.6%,中等,442 -1004,1000-1099,1004. 最大连续1的个数 III,最大连续1的个数 III,https://leetcode.cn/problems/max-consecutive-ones-iii/,max-consecutive-ones-iii,数组、二分查找、前缀和、滑动窗口,https://algo.itcharge.cn/Solutions/1000-1099/max-consecutive-ones-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1004.%20%E6%9C%80%E5%A4%A7%E8%BF%9E%E7%BB%AD1%E7%9A%84%E4%B8%AA%E6%95%B0%20III.md,59.5%,中等,1101 -1005,1000-1099,1005. K 次取反后最大化的数组和,K 次取反后最大化的数组和,https://leetcode.cn/problems/maximize-sum-of-array-after-k-negations/,maximize-sum-of-array-after-k-negations,贪心、数组、排序,https://algo.itcharge.cn/Solutions/1000-1099/maximize-sum-of-array-after-k-negations/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1005.%20K%20%E6%AC%A1%E5%8F%96%E5%8F%8D%E5%90%8E%E6%9C%80%E5%A4%A7%E5%8C%96%E7%9A%84%E6%95%B0%E7%BB%84%E5%92%8C.md,50.8%,简单,1493 -1006,1000-1099,1006. 笨阶乘,笨阶乘,https://leetcode.cn/problems/clumsy-factorial/,clumsy-factorial,栈、数学、模拟,https://algo.itcharge.cn/Solutions/1000-1099/clumsy-factorial/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1006.%20%E7%AC%A8%E9%98%B6%E4%B9%98.md,62.7%,中等,667 -1007,1000-1099,1007. 行相等的最少多米诺旋转,行相等的最少多米诺旋转,https://leetcode.cn/problems/minimum-domino-rotations-for-equal-row/,minimum-domino-rotations-for-equal-row,贪心、数组,https://algo.itcharge.cn/Solutions/1000-1099/minimum-domino-rotations-for-equal-row/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1007.%20%E8%A1%8C%E7%9B%B8%E7%AD%89%E7%9A%84%E6%9C%80%E5%B0%91%E5%A4%9A%E7%B1%B3%E8%AF%BA%E6%97%8B%E8%BD%AC.md,47.8%,中等,125 -1008,1000-1099,1008. 前序遍历构造二叉搜索树,前序遍历构造二叉搜索树,https://leetcode.cn/problems/construct-binary-search-tree-from-preorder-traversal/,construct-binary-search-tree-from-preorder-traversal,栈、树、二叉搜索树、数组、二叉树、单调栈,https://algo.itcharge.cn/Solutions/1000-1099/construct-binary-search-tree-from-preorder-traversal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1008.%20%E5%89%8D%E5%BA%8F%E9%81%8D%E5%8E%86%E6%9E%84%E9%80%A0%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md,71.8%,中等,392 -1009,1000-1099,1009. 十进制整数的反码,十进制整数的反码,https://leetcode.cn/problems/complement-of-base-10-integer/,complement-of-base-10-integer,位运算,https://algo.itcharge.cn/Solutions/1000-1099/complement-of-base-10-integer/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1009.%20%E5%8D%81%E8%BF%9B%E5%88%B6%E6%95%B4%E6%95%B0%E7%9A%84%E5%8F%8D%E7%A0%81.md,58.6%,简单,340 -1010,1000-1099,1010. 总持续时间可被 60 整除的歌曲,总持续时间可被 60 整除的歌曲,https://leetcode.cn/problems/pairs-of-songs-with-total-durations-divisible-by-60/,pairs-of-songs-with-total-durations-divisible-by-60,数组、哈希表、计数,https://algo.itcharge.cn/Solutions/1000-1099/pairs-of-songs-with-total-durations-divisible-by-60/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1010.%20%E6%80%BB%E6%8C%81%E7%BB%AD%E6%97%B6%E9%97%B4%E5%8F%AF%E8%A2%AB%2060%20%E6%95%B4%E9%99%A4%E7%9A%84%E6%AD%8C%E6%9B%B2.md,49.6%,中等,487 -1011,1000-1099,1011. 在 D 天内送达包裹的能力,在 D 天内送达包裹的能力,https://leetcode.cn/problems/capacity-to-ship-packages-within-d-days/,capacity-to-ship-packages-within-d-days,数组、二分查找,https://algo.itcharge.cn/Solutions/1000-1099/capacity-to-ship-packages-within-d-days/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1011.%20%E5%9C%A8%20D%20%E5%A4%A9%E5%86%85%E9%80%81%E8%BE%BE%E5%8C%85%E8%A3%B9%E7%9A%84%E8%83%BD%E5%8A%9B.md,62.0%,中等,857 -1012,1000-1099,1012. 至少有 1 位重复的数字,至少有 1 位重复的数字,https://leetcode.cn/problems/numbers-with-repeated-digits/,numbers-with-repeated-digits,数学、动态规划,https://algo.itcharge.cn/Solutions/1000-1099/numbers-with-repeated-digits/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1012.%20%E8%87%B3%E5%B0%91%E6%9C%89%201%20%E4%BD%8D%E9%87%8D%E5%A4%8D%E7%9A%84%E6%95%B0%E5%AD%97.md,52.4%,困难,189 -1013,1000-1099,1013. 将数组分成和相等的三个部分,将数组分成和相等的三个部分,https://leetcode.cn/problems/partition-array-into-three-parts-with-equal-sum/,partition-array-into-three-parts-with-equal-sum,贪心、数组,https://algo.itcharge.cn/Solutions/1000-1099/partition-array-into-three-parts-with-equal-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1013.%20%E5%B0%86%E6%95%B0%E7%BB%84%E5%88%86%E6%88%90%E5%92%8C%E7%9B%B8%E7%AD%89%E7%9A%84%E4%B8%89%E4%B8%AA%E9%83%A8%E5%88%86.md,38.5%,简单,1048 -1014,1000-1099,1014. 最佳观光组合,最佳观光组合,https://leetcode.cn/problems/best-sightseeing-pair/,best-sightseeing-pair,数组、动态规划,https://algo.itcharge.cn/Solutions/1000-1099/best-sightseeing-pair/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1014.%20%E6%9C%80%E4%BD%B3%E8%A7%82%E5%85%89%E7%BB%84%E5%90%88.md,57.1%,中等,719 -1015,1000-1099,1015. 可被 K 整除的最小整数,可被 K 整除的最小整数,https://leetcode.cn/problems/smallest-integer-divisible-by-k/,smallest-integer-divisible-by-k,哈希表、数学,https://algo.itcharge.cn/Solutions/1000-1099/smallest-integer-divisible-by-k/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1015.%20%E5%8F%AF%E8%A2%AB%20K%20%E6%95%B4%E9%99%A4%E7%9A%84%E6%9C%80%E5%B0%8F%E6%95%B4%E6%95%B0.md,46.6%,中等,170 -1016,1000-1099,1016. 子串能表示从 1 到 N 数字的二进制串,子串能表示从 1 到 N 数字的二进制串,https://leetcode.cn/problems/binary-string-with-substrings-representing-1-to-n/,binary-string-with-substrings-representing-1-to-n,字符串,https://algo.itcharge.cn/Solutions/1000-1099/binary-string-with-substrings-representing-1-to-n/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1016.%20%E5%AD%90%E4%B8%B2%E8%83%BD%E8%A1%A8%E7%A4%BA%E4%BB%8E%201%20%E5%88%B0%20N%20%E6%95%B0%E5%AD%97%E7%9A%84%E4%BA%8C%E8%BF%9B%E5%88%B6%E4%B8%B2.md,63.3%,中等,268 -1017,1000-1099,1017. 负二进制转换,负二进制转换,https://leetcode.cn/problems/convert-to-base-2/,convert-to-base-2,数学,https://algo.itcharge.cn/Solutions/1000-1099/convert-to-base-2/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1017.%20%E8%B4%9F%E4%BA%8C%E8%BF%9B%E5%88%B6%E8%BD%AC%E6%8D%A2.md,65.0%,中等,255 -1018,1000-1099,1018. 可被 5 整除的二进制前缀,可被 5 整除的二进制前缀,https://leetcode.cn/problems/binary-prefix-divisible-by-5/,binary-prefix-divisible-by-5,数组,https://algo.itcharge.cn/Solutions/1000-1099/binary-prefix-divisible-by-5/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1018.%20%E5%8F%AF%E8%A2%AB%205%20%E6%95%B4%E9%99%A4%E7%9A%84%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%89%8D%E7%BC%80.md,50.6%,简单,450 -1019,1000-1099,1019. 链表中的下一个更大节点,链表中的下一个更大节点,https://leetcode.cn/problems/next-greater-node-in-linked-list/,next-greater-node-in-linked-list,栈、数组、链表、单调栈,https://algo.itcharge.cn/Solutions/1000-1099/next-greater-node-in-linked-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1019.%20%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%9B%B4%E5%A4%A7%E8%8A%82%E7%82%B9.md,64.2%,中等,654 -1020,1000-1099,1020. 飞地的数量,飞地的数量,https://leetcode.cn/problems/number-of-enclaves/,number-of-enclaves,深度优先搜索、广度优先搜索、并查集、数组、矩阵,https://algo.itcharge.cn/Solutions/1000-1099/number-of-enclaves/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1020.%20%E9%A3%9E%E5%9C%B0%E7%9A%84%E6%95%B0%E9%87%8F.md,62.3%,中等,836 -1021,1000-1099,1021. 删除最外层的括号,删除最外层的括号,https://leetcode.cn/problems/remove-outermost-parentheses/,remove-outermost-parentheses,栈、字符串,https://algo.itcharge.cn/Solutions/1000-1099/remove-outermost-parentheses/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1021.%20%E5%88%A0%E9%99%A4%E6%9C%80%E5%A4%96%E5%B1%82%E7%9A%84%E6%8B%AC%E5%8F%B7.md,81.4%,简单,1078 -1022,1000-1099,1022. 从根到叶的二进制数之和,从根到叶的二进制数之和,https://leetcode.cn/problems/sum-of-root-to-leaf-binary-numbers/,sum-of-root-to-leaf-binary-numbers,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/1000-1099/sum-of-root-to-leaf-binary-numbers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1022.%20%E4%BB%8E%E6%A0%B9%E5%88%B0%E5%8F%B6%E7%9A%84%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%95%B0%E4%B9%8B%E5%92%8C.md,74.8%,简单,654 -1023,1000-1099,1023. 驼峰式匹配,驼峰式匹配,https://leetcode.cn/problems/camelcase-matching/,camelcase-matching,字典树、双指针、字符串、字符串匹配,https://algo.itcharge.cn/Solutions/1000-1099/camelcase-matching/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1023.%20%E9%A9%BC%E5%B3%B0%E5%BC%8F%E5%8C%B9%E9%85%8D.md,64.6%,中等,475 -1024,1000-1099,1024. 视频拼接,视频拼接,https://leetcode.cn/problems/video-stitching/,video-stitching,贪心、数组、动态规划,https://algo.itcharge.cn/Solutions/1000-1099/video-stitching/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1024.%20%E8%A7%86%E9%A2%91%E6%8B%BC%E6%8E%A5.md,53.1%,中等,547 -1025,1000-1099,1025. 除数博弈,除数博弈,https://leetcode.cn/problems/divisor-game/,divisor-game,脑筋急转弯、数学、动态规划、博弈,https://algo.itcharge.cn/Solutions/1000-1099/divisor-game/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1025.%20%E9%99%A4%E6%95%B0%E5%8D%9A%E5%BC%88.md,70.7%,简单,796 -1026,1000-1099,1026. 节点与其祖先之间的最大差值,节点与其祖先之间的最大差值,https://leetcode.cn/problems/maximum-difference-between-node-and-ancestor/,maximum-difference-between-node-and-ancestor,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/1000-1099/maximum-difference-between-node-and-ancestor/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1026.%20%E8%8A%82%E7%82%B9%E4%B8%8E%E5%85%B6%E7%A5%96%E5%85%88%E4%B9%8B%E9%97%B4%E7%9A%84%E6%9C%80%E5%A4%A7%E5%B7%AE%E5%80%BC.md,75.2%,中等,478 -1027,1000-1099,1027. 最长等差数列,最长等差数列,https://leetcode.cn/problems/longest-arithmetic-subsequence/,longest-arithmetic-subsequence,数组、哈希表、二分查找、动态规划,https://algo.itcharge.cn/Solutions/1000-1099/longest-arithmetic-subsequence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1027.%20%E6%9C%80%E9%95%BF%E7%AD%89%E5%B7%AE%E6%95%B0%E5%88%97.md,49.4%,中等,317 -1028,1000-1099,1028. 从先序遍历还原二叉树,从先序遍历还原二叉树,https://leetcode.cn/problems/recover-a-tree-from-preorder-traversal/,recover-a-tree-from-preorder-traversal,树、深度优先搜索、字符串、二叉树,https://algo.itcharge.cn/Solutions/1000-1099/recover-a-tree-from-preorder-traversal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1028.%20%E4%BB%8E%E5%85%88%E5%BA%8F%E9%81%8D%E5%8E%86%E8%BF%98%E5%8E%9F%E4%BA%8C%E5%8F%89%E6%A0%91.md,72.9%,困难,535 -1029,1000-1099,1029. 两地调度,两地调度,https://leetcode.cn/problems/two-city-scheduling/,two-city-scheduling,贪心、数组、排序,https://algo.itcharge.cn/Solutions/1000-1099/two-city-scheduling/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1029.%20%E4%B8%A4%E5%9C%B0%E8%B0%83%E5%BA%A6.md,68.8%,中等,279 -1030,1000-1099,1030. 距离顺序排列矩阵单元格,距离顺序排列矩阵单元格,https://leetcode.cn/problems/matrix-cells-in-distance-order/,matrix-cells-in-distance-order,几何、数组、数学、矩阵、排序,https://algo.itcharge.cn/Solutions/1000-1099/matrix-cells-in-distance-order/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1030.%20%E8%B7%9D%E7%A6%BB%E9%A1%BA%E5%BA%8F%E6%8E%92%E5%88%97%E7%9F%A9%E9%98%B5%E5%8D%95%E5%85%83%E6%A0%BC.md,70.6%,简单,527 -1031,1000-1099,1031. 两个非重叠子数组的最大和,两个非重叠子数组的最大和,https://leetcode.cn/problems/maximum-sum-of-two-non-overlapping-subarrays/,maximum-sum-of-two-non-overlapping-subarrays,数组、动态规划、滑动窗口,https://algo.itcharge.cn/Solutions/1000-1099/maximum-sum-of-two-non-overlapping-subarrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1031.%20%E4%B8%A4%E4%B8%AA%E9%9D%9E%E9%87%8D%E5%8F%A0%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%92%8C.md,65.6%,中等,303 -1032,1000-1099,1032. 字符流,字符流,https://leetcode.cn/problems/stream-of-characters/,stream-of-characters,设计、字典树、数组、字符串、数据流,https://algo.itcharge.cn/Solutions/1000-1099/stream-of-characters/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1032.%20%E5%AD%97%E7%AC%A6%E6%B5%81.md,56.6%,困难,259 -1033,1000-1099,1033. 移动石子直到连续,移动石子直到连续,https://leetcode.cn/problems/moving-stones-until-consecutive/,moving-stones-until-consecutive,脑筋急转弯、数学,https://algo.itcharge.cn/Solutions/1000-1099/moving-stones-until-consecutive/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1033.%20%E7%A7%BB%E5%8A%A8%E7%9F%B3%E5%AD%90%E7%9B%B4%E5%88%B0%E8%BF%9E%E7%BB%AD.md,49.3%,中等,301 -1034,1000-1099,1034. 边界着色,边界着色,https://leetcode.cn/problems/coloring-a-border/,coloring-a-border,深度优先搜索、广度优先搜索、数组、矩阵,https://algo.itcharge.cn/Solutions/1000-1099/coloring-a-border/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1034.%20%E8%BE%B9%E7%95%8C%E7%9D%80%E8%89%B2.md,55.1%,中等,534 -1035,1000-1099,1035. 不相交的线,不相交的线,https://leetcode.cn/problems/uncrossed-lines/,uncrossed-lines,数组、动态规划,https://algo.itcharge.cn/Solutions/1000-1099/uncrossed-lines/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1035.%20%E4%B8%8D%E7%9B%B8%E4%BA%A4%E7%9A%84%E7%BA%BF.md,70.3%,中等,611 -1036,1000-1099,1036. 逃离大迷宫,逃离大迷宫,https://leetcode.cn/problems/escape-a-large-maze/,escape-a-large-maze,深度优先搜索、广度优先搜索、数组、哈希表,https://algo.itcharge.cn/Solutions/1000-1099/escape-a-large-maze/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1036.%20%E9%80%83%E7%A6%BB%E5%A4%A7%E8%BF%B7%E5%AE%AB.md,46.8%,困难,218 -1037,1000-1099,1037. 有效的回旋镖,有效的回旋镖,https://leetcode.cn/problems/valid-boomerang/,valid-boomerang,几何、数组、数学,https://algo.itcharge.cn/Solutions/1000-1099/valid-boomerang/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1037.%20%E6%9C%89%E6%95%88%E7%9A%84%E5%9B%9E%E6%97%8B%E9%95%96.md,48.5%,简单,424 -1038,1000-1099,1038. 从二叉搜索树到更大和树,从二叉搜索树到更大和树,https://leetcode.cn/problems/binary-search-tree-to-greater-sum-tree/,binary-search-tree-to-greater-sum-tree,树、深度优先搜索、二叉搜索树、二叉树,https://algo.itcharge.cn/Solutions/1000-1099/binary-search-tree-to-greater-sum-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1038.%20%E4%BB%8E%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E5%88%B0%E6%9B%B4%E5%A4%A7%E5%92%8C%E6%A0%91.md,81.3%,中等,530 -1039,1000-1099,1039. 多边形三角剖分的最低得分,多边形三角剖分的最低得分,https://leetcode.cn/problems/minimum-score-triangulation-of-polygon/,minimum-score-triangulation-of-polygon,数组、动态规划,https://algo.itcharge.cn/Solutions/1000-1099/minimum-score-triangulation-of-polygon/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1039.%20%E5%A4%9A%E8%BE%B9%E5%BD%A2%E4%B8%89%E8%A7%92%E5%89%96%E5%88%86%E7%9A%84%E6%9C%80%E4%BD%8E%E5%BE%97%E5%88%86.md,64.5%,中等,149 -1040,1000-1099,1040. 移动石子直到连续 II,移动石子直到连续 II,https://leetcode.cn/problems/moving-stones-until-consecutive-ii/,moving-stones-until-consecutive-ii,数组、数学、双指针、排序,https://algo.itcharge.cn/Solutions/1000-1099/moving-stones-until-consecutive-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1040.%20%E7%A7%BB%E5%8A%A8%E7%9F%B3%E5%AD%90%E7%9B%B4%E5%88%B0%E8%BF%9E%E7%BB%AD%20II.md,66.2%,中等,94 -1041,1000-1099,1041. 困于环中的机器人,困于环中的机器人,https://leetcode.cn/problems/robot-bounded-in-circle/,robot-bounded-in-circle,数学、字符串、模拟,https://algo.itcharge.cn/Solutions/1000-1099/robot-bounded-in-circle/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1041.%20%E5%9B%B0%E4%BA%8E%E7%8E%AF%E4%B8%AD%E7%9A%84%E6%9C%BA%E5%99%A8%E4%BA%BA.md,57.0%,中等,431 -1042,1000-1099,1042. 不邻接植花,不邻接植花,https://leetcode.cn/problems/flower-planting-with-no-adjacent/,flower-planting-with-no-adjacent,深度优先搜索、广度优先搜索、图,https://algo.itcharge.cn/Solutions/1000-1099/flower-planting-with-no-adjacent/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1042.%20%E4%B8%8D%E9%82%BB%E6%8E%A5%E6%A4%8D%E8%8A%B1.md,61.1%,中等,342 -1043,1000-1099,1043. 分隔数组以得到最大和,分隔数组以得到最大和,https://leetcode.cn/problems/partition-array-for-maximum-sum/,partition-array-for-maximum-sum,数组、动态规划,https://algo.itcharge.cn/Solutions/1000-1099/partition-array-for-maximum-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1043.%20%E5%88%86%E9%9A%94%E6%95%B0%E7%BB%84%E4%BB%A5%E5%BE%97%E5%88%B0%E6%9C%80%E5%A4%A7%E5%92%8C.md,75.5%,中等,297 -1044,1000-1099,1044. 最长重复子串,最长重复子串,https://leetcode.cn/problems/longest-duplicate-substring/,longest-duplicate-substring,字符串、二分查找、后缀数组、滑动窗口、哈希函数、滚动哈希,https://algo.itcharge.cn/Solutions/1000-1099/longest-duplicate-substring/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1044.%20%E6%9C%80%E9%95%BF%E9%87%8D%E5%A4%8D%E5%AD%90%E4%B8%B2.md,35.4%,困难,239 -1045,1000-1099,1045. 买下所有产品的客户,买下所有产品的客户,https://leetcode.cn/problems/customers-who-bought-all-products/,customers-who-bought-all-products,数据库,https://algo.itcharge.cn/Solutions/1000-1099/customers-who-bought-all-products/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1045.%20%E4%B9%B0%E4%B8%8B%E6%89%80%E6%9C%89%E4%BA%A7%E5%93%81%E7%9A%84%E5%AE%A2%E6%88%B7.md,61.6%,中等,202 -1046,1000-1099,1046. 最后一块石头的重量,最后一块石头的重量,https://leetcode.cn/problems/last-stone-weight/,last-stone-weight,数组、堆（优先队列）,https://algo.itcharge.cn/Solutions/1000-1099/last-stone-weight/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1046.%20%E6%9C%80%E5%90%8E%E4%B8%80%E5%9D%97%E7%9F%B3%E5%A4%B4%E7%9A%84%E9%87%8D%E9%87%8F.md,65.6%,简单,1214 -1047,1000-1099,1047. 删除字符串中的所有相邻重复项,删除字符串中的所有相邻重复项,https://leetcode.cn/problems/remove-all-adjacent-duplicates-in-string/,remove-all-adjacent-duplicates-in-string,栈、字符串,https://algo.itcharge.cn/Solutions/1000-1099/remove-all-adjacent-duplicates-in-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1047.%20%E5%88%A0%E9%99%A4%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E6%89%80%E6%9C%89%E7%9B%B8%E9%82%BB%E9%87%8D%E5%A4%8D%E9%A1%B9.md,72.4%,简单,1615 -1048,1000-1099,1048. 最长字符串链,最长字符串链,https://leetcode.cn/problems/longest-string-chain/,longest-string-chain,数组、哈希表、双指针、字符串、动态规划,https://algo.itcharge.cn/Solutions/1000-1099/longest-string-chain/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1048.%20%E6%9C%80%E9%95%BF%E5%AD%97%E7%AC%A6%E4%B8%B2%E9%93%BE.md,55.8%,中等,399 -1049,1000-1099,1049. 最后一块石头的重量 II,最后一块石头的重量 II,https://leetcode.cn/problems/last-stone-weight-ii/,last-stone-weight-ii,数组、动态规划,https://algo.itcharge.cn/Solutions/1000-1099/last-stone-weight-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1049.%20%E6%9C%80%E5%90%8E%E4%B8%80%E5%9D%97%E7%9F%B3%E5%A4%B4%E7%9A%84%E9%87%8D%E9%87%8F%20II.md,69.2%,中等,840 -1050,1000-1099,1050. 合作过至少三次的演员和导演,合作过至少三次的演员和导演,https://leetcode.cn/problems/actors-and-directors-who-cooperated-at-least-three-times/,actors-and-directors-who-cooperated-at-least-three-times,数据库,https://algo.itcharge.cn/Solutions/1000-1099/actors-and-directors-who-cooperated-at-least-three-times/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1050.%20%E5%90%88%E4%BD%9C%E8%BF%87%E8%87%B3%E5%B0%91%E4%B8%89%E6%AC%A1%E7%9A%84%E6%BC%94%E5%91%98%E5%92%8C%E5%AF%BC%E6%BC%94.md,76.8%,简单,207 -1051,1000-1099,1051. 高度检查器,高度检查器,https://leetcode.cn/problems/height-checker/,height-checker,数组、计数排序、排序,https://algo.itcharge.cn/Solutions/1000-1099/height-checker/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1051.%20%E9%AB%98%E5%BA%A6%E6%A3%80%E6%9F%A5%E5%99%A8.md,80.1%,简单,685 -1052,1000-1099,1052. 爱生气的书店老板,爱生气的书店老板,https://leetcode.cn/problems/grumpy-bookstore-owner/,grumpy-bookstore-owner,数组、滑动窗口,https://algo.itcharge.cn/Solutions/1000-1099/grumpy-bookstore-owner/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1052.%20%E7%88%B1%E7%94%9F%E6%B0%94%E7%9A%84%E4%B9%A6%E5%BA%97%E8%80%81%E6%9D%BF.md,58.0%,中等,909 -1053,1000-1099,1053. 交换一次的先前排列,交换一次的先前排列,https://leetcode.cn/problems/previous-permutation-with-one-swap/,previous-permutation-with-one-swap,贪心、数组,https://algo.itcharge.cn/Solutions/1000-1099/previous-permutation-with-one-swap/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1053.%20%E4%BA%A4%E6%8D%A2%E4%B8%80%E6%AC%A1%E7%9A%84%E5%85%88%E5%89%8D%E6%8E%92%E5%88%97.md,48.3%,中等,302 -1054,1000-1099,1054. 距离相等的条形码,距离相等的条形码,https://leetcode.cn/problems/distant-barcodes/,distant-barcodes,贪心、数组、哈希表、计数、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/1000-1099/distant-barcodes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1054.%20%E8%B7%9D%E7%A6%BB%E7%9B%B8%E7%AD%89%E7%9A%84%E6%9D%A1%E5%BD%A2%E7%A0%81.md,44.8%,中等,312 -1055,1000-1099,1055. 形成字符串的最短路径,形成字符串的最短路径,https://leetcode.cn/problems/shortest-way-to-form-string/,shortest-way-to-form-string,贪心、双指针、字符串,https://algo.itcharge.cn/Solutions/1000-1099/shortest-way-to-form-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1055.%20%E5%BD%A2%E6%88%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84.md,60.5%,中等,150 -1056,1000-1099,1056. 易混淆数,易混淆数,https://leetcode.cn/problems/confusing-number/,confusing-number,数学,https://algo.itcharge.cn/Solutions/1000-1099/confusing-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1056.%20%E6%98%93%E6%B7%B7%E6%B7%86%E6%95%B0.md,43.6%,简单,120 -1057,1000-1099,1057. 校园自行车分配,校园自行车分配,https://leetcode.cn/problems/campus-bikes/,campus-bikes,贪心、数组、排序,https://algo.itcharge.cn/Solutions/1000-1099/campus-bikes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1057.%20%E6%A0%A1%E5%9B%AD%E8%87%AA%E8%A1%8C%E8%BD%A6%E5%88%86%E9%85%8D.md,51.0%,中等,59 -1058,1000-1099,1058. 最小化舍入误差以满足目标,最小化舍入误差以满足目标,https://leetcode.cn/problems/minimize-rounding-error-to-meet-target/,minimize-rounding-error-to-meet-target,贪心、数组、数学、字符串,https://algo.itcharge.cn/Solutions/1000-1099/minimize-rounding-error-to-meet-target/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1058.%20%E6%9C%80%E5%B0%8F%E5%8C%96%E8%88%8D%E5%85%A5%E8%AF%AF%E5%B7%AE%E4%BB%A5%E6%BB%A1%E8%B6%B3%E7%9B%AE%E6%A0%87.md,37.4%,中等,50 -1059,1000-1099,1059. 从始点到终点的所有路径,从始点到终点的所有路径,https://leetcode.cn/problems/all-paths-from-source-lead-to-destination/,all-paths-from-source-lead-to-destination,深度优先搜索、图,https://algo.itcharge.cn/Solutions/1000-1099/all-paths-from-source-lead-to-destination/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1059.%20%E4%BB%8E%E5%A7%8B%E7%82%B9%E5%88%B0%E7%BB%88%E7%82%B9%E7%9A%84%E6%89%80%E6%9C%89%E8%B7%AF%E5%BE%84.md,35.8%,中等,57 -1060,1000-1099,1060. 有序数组中的缺失元素,有序数组中的缺失元素,https://leetcode.cn/problems/missing-element-in-sorted-array/,missing-element-in-sorted-array,数组、二分查找,https://algo.itcharge.cn/Solutions/1000-1099/missing-element-in-sorted-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1060.%20%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E7%BC%BA%E5%A4%B1%E5%85%83%E7%B4%A0.md,54.7%,中等,158 -1061,1000-1099,1061. 按字典序排列最小的等效字符串,按字典序排列最小的等效字符串,https://leetcode.cn/problems/lexicographically-smallest-equivalent-string/,lexicographically-smallest-equivalent-string,并查集、字符串,https://algo.itcharge.cn/Solutions/1000-1099/lexicographically-smallest-equivalent-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1061.%20%E6%8C%89%E5%AD%97%E5%85%B8%E5%BA%8F%E6%8E%92%E5%88%97%E6%9C%80%E5%B0%8F%E7%9A%84%E7%AD%89%E6%95%88%E5%AD%97%E7%AC%A6%E4%B8%B2.md,64.7%,中等,119 -1062,1000-1099,1062. 最长重复子串,最长重复子串,https://leetcode.cn/problems/longest-repeating-substring/,longest-repeating-substring,字符串、二分查找、动态规划、后缀数组、哈希函数、滚动哈希,https://algo.itcharge.cn/Solutions/1000-1099/longest-repeating-substring/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1062.%20%E6%9C%80%E9%95%BF%E9%87%8D%E5%A4%8D%E5%AD%90%E4%B8%B2.md,56.9%,中等,87 -1063,1000-1099,1063. 有效子数组的数目,有效子数组的数目,https://leetcode.cn/problems/number-of-valid-subarrays/,number-of-valid-subarrays,栈、数组、单调栈,https://algo.itcharge.cn/Solutions/1000-1099/number-of-valid-subarrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1063.%20%E6%9C%89%E6%95%88%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%95%B0%E7%9B%AE.md,73.8%,困难,61 -1064,1000-1099,1064. 不动点,不动点,https://leetcode.cn/problems/fixed-point/,fixed-point,数组、二分查找,https://algo.itcharge.cn/Solutions/1000-1099/fixed-point/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1064.%20%E4%B8%8D%E5%8A%A8%E7%82%B9.md,64.8%,简单,105 -1065,1000-1099,1065. 字符串的索引对,字符串的索引对,https://leetcode.cn/problems/index-pairs-of-a-string/,index-pairs-of-a-string,字典树、数组、字符串、排序,https://algo.itcharge.cn/Solutions/1000-1099/index-pairs-of-a-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1065.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E7%B4%A2%E5%BC%95%E5%AF%B9.md,56.5%,简单,110 -1066,1000-1099,1066. 校园自行车分配 II,校园自行车分配 II,https://leetcode.cn/problems/campus-bikes-ii/,campus-bikes-ii,位运算、数组、动态规划、回溯、状态压缩,https://algo.itcharge.cn/Solutions/1000-1099/campus-bikes-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1066.%20%E6%A0%A1%E5%9B%AD%E8%87%AA%E8%A1%8C%E8%BD%A6%E5%88%86%E9%85%8D%20II.md,51.3%,中等,71 -1067,1000-1099,1067. 范围内的数字计数,范围内的数字计数,https://leetcode.cn/problems/digit-count-in-range/,digit-count-in-range,数学、动态规划,https://algo.itcharge.cn/Solutions/1000-1099/digit-count-in-range/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1067.%20%E8%8C%83%E5%9B%B4%E5%86%85%E7%9A%84%E6%95%B0%E5%AD%97%E8%AE%A1%E6%95%B0.md,48.3%,困难,51 -1068,1000-1099,1068. 产品销售分析 I,产品销售分析 I,https://leetcode.cn/problems/product-sales-analysis-i/,product-sales-analysis-i,数据库,https://algo.itcharge.cn/Solutions/1000-1099/product-sales-analysis-i/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1068.%20%E4%BA%A7%E5%93%81%E9%94%80%E5%94%AE%E5%88%86%E6%9E%90%20I.md,86.7%,简单,112 -1069,1000-1099,1069. 产品销售分析 II,产品销售分析 II,https://leetcode.cn/problems/product-sales-analysis-ii/,product-sales-analysis-ii,数据库,https://algo.itcharge.cn/Solutions/1000-1099/product-sales-analysis-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1069.%20%E4%BA%A7%E5%93%81%E9%94%80%E5%94%AE%E5%88%86%E6%9E%90%20II.md,81.8%,简单,85 -1070,1000-1099,1070. 产品销售分析 III,产品销售分析 III,https://leetcode.cn/problems/product-sales-analysis-iii/,product-sales-analysis-iii,数据库,https://algo.itcharge.cn/Solutions/1000-1099/product-sales-analysis-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1070.%20%E4%BA%A7%E5%93%81%E9%94%80%E5%94%AE%E5%88%86%E6%9E%90%20III.md,48.0%,中等,106 -1071,1000-1099,1071. 字符串的最大公因子,字符串的最大公因子,https://leetcode.cn/problems/greatest-common-divisor-of-strings/,greatest-common-divisor-of-strings,数学、字符串,https://algo.itcharge.cn/Solutions/1000-1099/greatest-common-divisor-of-strings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1071.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%9C%80%E5%A4%A7%E5%85%AC%E5%9B%A0%E5%AD%90.md,57.9%,简单,818 -1072,1000-1099,1072. 按列翻转得到最大值等行数,按列翻转得到最大值等行数,https://leetcode.cn/problems/flip-columns-for-maximum-number-of-equal-rows/,flip-columns-for-maximum-number-of-equal-rows,数组、哈希表、矩阵,https://algo.itcharge.cn/Solutions/1000-1099/flip-columns-for-maximum-number-of-equal-rows/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1072.%20%E6%8C%89%E5%88%97%E7%BF%BB%E8%BD%AC%E5%BE%97%E5%88%B0%E6%9C%80%E5%A4%A7%E5%80%BC%E7%AD%89%E8%A1%8C%E6%95%B0.md,71.4%,中等,206 -1073,1000-1099,1073. 负二进制数相加,负二进制数相加,https://leetcode.cn/problems/adding-two-negabinary-numbers/,adding-two-negabinary-numbers,数组、数学,https://algo.itcharge.cn/Solutions/1000-1099/adding-two-negabinary-numbers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1073.%20%E8%B4%9F%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%95%B0%E7%9B%B8%E5%8A%A0.md,41.6%,中等,193 -1074,1000-1099,1074. 元素和为目标值的子矩阵数量,元素和为目标值的子矩阵数量,https://leetcode.cn/problems/number-of-submatrices-that-sum-to-target/,number-of-submatrices-that-sum-to-target,数组、哈希表、矩阵、前缀和,https://algo.itcharge.cn/Solutions/1000-1099/number-of-submatrices-that-sum-to-target/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1074.%20%E5%85%83%E7%B4%A0%E5%92%8C%E4%B8%BA%E7%9B%AE%E6%A0%87%E5%80%BC%E7%9A%84%E5%AD%90%E7%9F%A9%E9%98%B5%E6%95%B0%E9%87%8F.md,67.4%,困难,223 -1075,1000-1099,1075. 项目员工 I,项目员工 I,https://leetcode.cn/problems/project-employees-i/,project-employees-i,数据库,https://algo.itcharge.cn/Solutions/1000-1099/project-employees-i/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1075.%20%E9%A1%B9%E7%9B%AE%E5%91%98%E5%B7%A5%20I.md,70.2%,简单,132 -1076,1000-1099,1076. 项目员工II,项目员工II,https://leetcode.cn/problems/project-employees-ii/,project-employees-ii,数据库,https://algo.itcharge.cn/Solutions/1000-1099/project-employees-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1076.%20%E9%A1%B9%E7%9B%AE%E5%91%98%E5%B7%A5II.md,49.4%,简单,132 -1077,1000-1099,1077. 项目员工 III,项目员工 III,https://leetcode.cn/problems/project-employees-iii/,project-employees-iii,数据库,https://algo.itcharge.cn/Solutions/1000-1099/project-employees-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1077.%20%E9%A1%B9%E7%9B%AE%E5%91%98%E5%B7%A5%20III.md,72.3%,中等,147 -1078,1000-1099,1078. Bigram 分词,Bigram 分词,https://leetcode.cn/problems/occurrences-after-bigram/,occurrences-after-bigram,字符串,https://algo.itcharge.cn/Solutions/1000-1099/occurrences-after-bigram/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1078.%20Bigram%20%E5%88%86%E8%AF%8D.md,65.2%,简单,521 -1079,1000-1099,1079. 活字印刷,活字印刷,https://leetcode.cn/problems/letter-tile-possibilities/,letter-tile-possibilities,哈希表、字符串、回溯、计数,https://algo.itcharge.cn/Solutions/1000-1099/letter-tile-possibilities/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1079.%20%E6%B4%BB%E5%AD%97%E5%8D%B0%E5%88%B7.md,79.1%,中等,405 -1080,1000-1099,1080. 根到叶路径上的不足节点,根到叶路径上的不足节点,https://leetcode.cn/problems/insufficient-nodes-in-root-to-leaf-paths/,insufficient-nodes-in-root-to-leaf-paths,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/1000-1099/insufficient-nodes-in-root-to-leaf-paths/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1080.%20%E6%A0%B9%E5%88%B0%E5%8F%B6%E8%B7%AF%E5%BE%84%E4%B8%8A%E7%9A%84%E4%B8%8D%E8%B6%B3%E8%8A%82%E7%82%B9.md,61.4%,中等,271 -1081,1000-1099,1081. 不同字符的最小子序列,不同字符的最小子序列,https://leetcode.cn/problems/smallest-subsequence-of-distinct-characters/,smallest-subsequence-of-distinct-characters,栈、贪心、字符串、单调栈,https://algo.itcharge.cn/Solutions/1000-1099/smallest-subsequence-of-distinct-characters/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1081.%20%E4%B8%8D%E5%90%8C%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E5%B0%8F%E5%AD%90%E5%BA%8F%E5%88%97.md,58.4%,中等,241 -1082,1000-1099,1082. 销售分析 I,销售分析 I,https://leetcode.cn/problems/sales-analysis-i/,sales-analysis-i,数据库,https://algo.itcharge.cn/Solutions/1000-1099/sales-analysis-i/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1082.%20%E9%94%80%E5%94%AE%E5%88%86%E6%9E%90%20I.md,76.6%,简单,139 -1083,1000-1099,1083. 销售分析 II,销售分析 II,https://leetcode.cn/problems/sales-analysis-ii/,sales-analysis-ii,数据库,https://algo.itcharge.cn/Solutions/1000-1099/sales-analysis-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1083.%20%E9%94%80%E5%94%AE%E5%88%86%E6%9E%90%20II.md,53.0%,简单,156 -1084,1000-1099,1084. 销售分析III,销售分析III,https://leetcode.cn/problems/sales-analysis-iii/,sales-analysis-iii,数据库,https://algo.itcharge.cn/Solutions/1000-1099/sales-analysis-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1084.%20%E9%94%80%E5%94%AE%E5%88%86%E6%9E%90III.md,52.2%,简单,351 -1085,1000-1099,1085. 最小元素各数位之和,最小元素各数位之和,https://leetcode.cn/problems/sum-of-digits-in-the-minimum-number/,sum-of-digits-in-the-minimum-number,数组、数学,https://algo.itcharge.cn/Solutions/1000-1099/sum-of-digits-in-the-minimum-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1085.%20%E6%9C%80%E5%B0%8F%E5%85%83%E7%B4%A0%E5%90%84%E6%95%B0%E4%BD%8D%E4%B9%8B%E5%92%8C.md,77.9%,简单,110 -1086,1000-1099,1086. 前五科的均分,前五科的均分,https://leetcode.cn/problems/high-five/,high-five,数组、哈希表、排序,https://algo.itcharge.cn/Solutions/1000-1099/high-five/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1086.%20%E5%89%8D%E4%BA%94%E7%A7%91%E7%9A%84%E5%9D%87%E5%88%86.md,67.7%,简单,120 -1087,1000-1099,1087. 花括号展开,花括号展开,https://leetcode.cn/problems/brace-expansion/,brace-expansion,广度优先搜索、字符串、回溯,https://algo.itcharge.cn/Solutions/1000-1099/brace-expansion/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1087.%20%E8%8A%B1%E6%8B%AC%E5%8F%B7%E5%B1%95%E5%BC%80.md,56.8%,中等,89 -1088,1000-1099,1088. 易混淆数 II,易混淆数 II,https://leetcode.cn/problems/confusing-number-ii/,confusing-number-ii,数学、回溯,https://algo.itcharge.cn/Solutions/1000-1099/confusing-number-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1088.%20%E6%98%93%E6%B7%B7%E6%B7%86%E6%95%B0%20II.md,49.9%,困难,50 -1089,1000-1099,1089. 复写零,复写零,https://leetcode.cn/problems/duplicate-zeros/,duplicate-zeros,数组、双指针,https://algo.itcharge.cn/Solutions/1000-1099/duplicate-zeros/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1089.%20%E5%A4%8D%E5%86%99%E9%9B%B6.md,60.1%,简单,762 -1090,1000-1099,1090. 受标签影响的最大值,受标签影响的最大值,https://leetcode.cn/problems/largest-values-from-labels/,largest-values-from-labels,贪心、数组、哈希表、计数、排序,https://algo.itcharge.cn/Solutions/1000-1099/largest-values-from-labels/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1090.%20%E5%8F%97%E6%A0%87%E7%AD%BE%E5%BD%B1%E5%93%8D%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md,66.9%,中等,313 -1091,1000-1099,1091. 二进制矩阵中的最短路径,二进制矩阵中的最短路径,https://leetcode.cn/problems/shortest-path-in-binary-matrix/,shortest-path-in-binary-matrix,广度优先搜索、数组、矩阵,https://algo.itcharge.cn/Solutions/1000-1099/shortest-path-in-binary-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1091.%20%E4%BA%8C%E8%BF%9B%E5%88%B6%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84.md,40.4%,中等,736 -1092,1000-1099,1092. 最短公共超序列,最短公共超序列,https://leetcode.cn/problems/shortest-common-supersequence/,shortest-common-supersequence,字符串、动态规划,https://algo.itcharge.cn/Solutions/1000-1099/shortest-common-supersequence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1092.%20%E6%9C%80%E7%9F%AD%E5%85%AC%E5%85%B1%E8%B6%85%E5%BA%8F%E5%88%97.md,58.5%,困难,172 -1093,1000-1099,1093. 大样本统计,大样本统计,https://leetcode.cn/problems/statistics-from-a-large-sample/,statistics-from-a-large-sample,数组、数学、概率与统计,https://algo.itcharge.cn/Solutions/1000-1099/statistics-from-a-large-sample/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1093.%20%E5%A4%A7%E6%A0%B7%E6%9C%AC%E7%BB%9F%E8%AE%A1.md,41.9%,中等,206 -1094,1000-1099,1094. 拼车,拼车,https://leetcode.cn/problems/car-pooling/,car-pooling,数组、前缀和、排序、模拟、堆（优先队列）,https://algo.itcharge.cn/Solutions/1000-1099/car-pooling/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1094.%20%E6%8B%BC%E8%BD%A6.md,51.8%,中等,1350 -1095,1000-1099,1095. 山脉数组中查找目标值,山脉数组中查找目标值,https://leetcode.cn/problems/find-in-mountain-array/,find-in-mountain-array,数组、二分查找、交互,https://algo.itcharge.cn/Solutions/1000-1099/find-in-mountain-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1095.%20%E5%B1%B1%E8%84%89%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9F%A5%E6%89%BE%E7%9B%AE%E6%A0%87%E5%80%BC.md,37.7%,困难,470 -1096,1000-1099,1096. 花括号展开 II,花括号展开 II,https://leetcode.cn/problems/brace-expansion-ii/,brace-expansion-ii,栈、广度优先搜索、字符串、回溯,https://algo.itcharge.cn/Solutions/1000-1099/brace-expansion-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1096.%20%E8%8A%B1%E6%8B%AC%E5%8F%B7%E5%B1%95%E5%BC%80%20II.md,73.5%,困难,155 -1097,1000-1099,1097. 游戏玩法分析 V,游戏玩法分析 V,https://leetcode.cn/problems/game-play-analysis-v/,game-play-analysis-v,数据库,https://algo.itcharge.cn/Solutions/1000-1099/game-play-analysis-v/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1097.%20%E6%B8%B8%E6%88%8F%E7%8E%A9%E6%B3%95%E5%88%86%E6%9E%90%20V.md,52.4%,困难,169 -1098,1000-1099,1098. 小众书籍,小众书籍,https://leetcode.cn/problems/unpopular-books/,unpopular-books,数据库,https://algo.itcharge.cn/Solutions/1000-1099/unpopular-books/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1098.%20%E5%B0%8F%E4%BC%97%E4%B9%A6%E7%B1%8D.md,47.1%,中等,135 -1099,1000-1099,1099. 小于 K 的两数之和,小于 K 的两数之和,https://leetcode.cn/problems/two-sum-less-than-k/,two-sum-less-than-k,数组、双指针、二分查找、排序,https://algo.itcharge.cn/Solutions/1000-1099/two-sum-less-than-k/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1099.%20%E5%B0%8F%E4%BA%8E%20K%20%E7%9A%84%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C.md,59.8%,简单,145 -1100,1100-1199,1100. 长度为 K 的无重复字符子串,长度为 K 的无重复字符子串,https://leetcode.cn/problems/find-k-length-substrings-with-no-repeated-characters/,find-k-length-substrings-with-no-repeated-characters,哈希表、字符串、滑动窗口,https://algo.itcharge.cn/Solutions/1100-1199/find-k-length-substrings-with-no-repeated-characters/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1100.%20%E9%95%BF%E5%BA%A6%E4%B8%BA%20K%20%E7%9A%84%E6%97%A0%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E5%AD%90%E4%B8%B2.md,69.8%,中等,180 -1101,1100-1199,1101. 彼此熟识的最早时间,彼此熟识的最早时间,https://leetcode.cn/problems/the-earliest-moment-when-everyone-become-friends/,the-earliest-moment-when-everyone-become-friends,并查集、数组,https://algo.itcharge.cn/Solutions/1100-1199/the-earliest-moment-when-everyone-become-friends/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1101.%20%E5%BD%BC%E6%AD%A4%E7%86%9F%E8%AF%86%E7%9A%84%E6%9C%80%E6%97%A9%E6%97%B6%E9%97%B4.md,68.8%,中等,108 -1102,1100-1199,1102. 得分最高的路径,得分最高的路径,https://leetcode.cn/problems/path-with-maximum-minimum-value/,path-with-maximum-minimum-value,深度优先搜索、广度优先搜索、并查集、数组、矩阵、堆（优先队列）,https://algo.itcharge.cn/Solutions/1100-1199/path-with-maximum-minimum-value/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1102.%20%E5%BE%97%E5%88%86%E6%9C%80%E9%AB%98%E7%9A%84%E8%B7%AF%E5%BE%84.md,40.2%,中等,112 -1103,1100-1199,1103. 分糖果 II,分糖果 II,https://leetcode.cn/problems/distribute-candies-to-people/,distribute-candies-to-people,数学、模拟,https://algo.itcharge.cn/Solutions/1100-1199/distribute-candies-to-people/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1103.%20%E5%88%86%E7%B3%96%E6%9E%9C%20II.md,63.7%,简单,1236 -1104,1100-1199,1104. 二叉树寻路,二叉树寻路,https://leetcode.cn/problems/path-in-zigzag-labelled-binary-tree/,path-in-zigzag-labelled-binary-tree,树、数学、二叉树,https://algo.itcharge.cn/Solutions/1100-1199/path-in-zigzag-labelled-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1104.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E5%AF%BB%E8%B7%AF.md,75.9%,中等,777 -1105,1100-1199,1105. 填充书架,填充书架,https://leetcode.cn/problems/filling-bookcase-shelves/,filling-bookcase-shelves,数组、动态规划,https://algo.itcharge.cn/Solutions/1100-1199/filling-bookcase-shelves/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1105.%20%E5%A1%AB%E5%85%85%E4%B9%A6%E6%9E%B6.md,67.2%,中等,207 -1106,1100-1199,1106. 解析布尔表达式,解析布尔表达式,https://leetcode.cn/problems/parsing-a-boolean-expression/,parsing-a-boolean-expression,栈、递归、字符串,https://algo.itcharge.cn/Solutions/1100-1199/parsing-a-boolean-expression/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1106.%20%E8%A7%A3%E6%9E%90%E5%B8%83%E5%B0%94%E8%A1%A8%E8%BE%BE%E5%BC%8F.md,68.5%,困难,572 -1107,1100-1199,1107. 每日新用户统计,每日新用户统计,https://leetcode.cn/problems/new-users-daily-count/,new-users-daily-count,数据库,https://algo.itcharge.cn/Solutions/1100-1199/new-users-daily-count/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1107.%20%E6%AF%8F%E6%97%A5%E6%96%B0%E7%94%A8%E6%88%B7%E7%BB%9F%E8%AE%A1.md,41.2%,中等,135 -1108,1100-1199,1108. IP 地址无效化,IP 地址无效化,https://leetcode.cn/problems/defanging-an-ip-address/,defanging-an-ip-address,字符串,https://algo.itcharge.cn/Solutions/1100-1199/defanging-an-ip-address/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1108.%20IP%20%E5%9C%B0%E5%9D%80%E6%97%A0%E6%95%88%E5%8C%96.md,85.4%,简单,1011 -1109,1100-1199,1109. 航班预订统计,航班预订统计,https://leetcode.cn/problems/corporate-flight-bookings/,corporate-flight-bookings,数组、前缀和,https://algo.itcharge.cn/Solutions/1100-1199/corporate-flight-bookings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1109.%20%E8%88%AA%E7%8F%AD%E9%A2%84%E8%AE%A2%E7%BB%9F%E8%AE%A1.md,63.6%,中等,1625 -1110,1100-1199,1110. 删点成林,删点成林,https://leetcode.cn/problems/delete-nodes-and-return-forest/,delete-nodes-and-return-forest,树、深度优先搜索、数组、哈希表、二叉树,https://algo.itcharge.cn/Solutions/1100-1199/delete-nodes-and-return-forest/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1110.%20%E5%88%A0%E7%82%B9%E6%88%90%E6%9E%97.md,69.4%,中等,511 -1111,1100-1199,1111. 有效括号的嵌套深度,有效括号的嵌套深度,https://leetcode.cn/problems/maximum-nesting-depth-of-two-valid-parentheses-strings/,maximum-nesting-depth-of-two-valid-parentheses-strings,栈、字符串,https://algo.itcharge.cn/Solutions/1100-1199/maximum-nesting-depth-of-two-valid-parentheses-strings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1111.%20%E6%9C%89%E6%95%88%E6%8B%AC%E5%8F%B7%E7%9A%84%E5%B5%8C%E5%A5%97%E6%B7%B1%E5%BA%A6.md,76.8%,中等,446 -1112,1100-1199,1112. 每位学生的最高成绩,每位学生的最高成绩,https://leetcode.cn/problems/highest-grade-for-each-student/,highest-grade-for-each-student,数据库,https://algo.itcharge.cn/Solutions/1100-1199/highest-grade-for-each-student/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1112.%20%E6%AF%8F%E4%BD%8D%E5%AD%A6%E7%94%9F%E7%9A%84%E6%9C%80%E9%AB%98%E6%88%90%E7%BB%A9.md,65.9%,中等,168 -1113,1100-1199,1113. 报告的记录,报告的记录,https://leetcode.cn/problems/reported-posts/,reported-posts,数据库,https://algo.itcharge.cn/Solutions/1100-1199/reported-posts/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1113.%20%E6%8A%A5%E5%91%8A%E7%9A%84%E8%AE%B0%E5%BD%95.md,53.4%,简单,75 -1114,1100-1199,1114. 按序打印,按序打印,https://leetcode.cn/problems/print-in-order/,print-in-order,多线程,https://algo.itcharge.cn/Solutions/1100-1199/print-in-order/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1114.%20%E6%8C%89%E5%BA%8F%E6%89%93%E5%8D%B0.md,65.2%,简单,744 -1115,1100-1199,1115. 交替打印 FooBar,交替打印 FooBar,https://leetcode.cn/problems/print-foobar-alternately/,print-foobar-alternately,多线程,https://algo.itcharge.cn/Solutions/1100-1199/print-foobar-alternately/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1115.%20%E4%BA%A4%E6%9B%BF%E6%89%93%E5%8D%B0%20FooBar.md,57.0%,中等,607 -1116,1100-1199,1116. 打印零与奇偶数,打印零与奇偶数,https://leetcode.cn/problems/print-zero-even-odd/,print-zero-even-odd,多线程,https://algo.itcharge.cn/Solutions/1100-1199/print-zero-even-odd/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1116.%20%E6%89%93%E5%8D%B0%E9%9B%B6%E4%B8%8E%E5%A5%87%E5%81%B6%E6%95%B0.md,54.3%,中等,460 -1117,1100-1199,1117. H2O 生成,H2O 生成,https://leetcode.cn/problems/building-h2o/,building-h2o,多线程,https://algo.itcharge.cn/Solutions/1100-1199/building-h2o/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1117.%20H2O%20%E7%94%9F%E6%88%90.md,53.9%,中等,334 -1118,1100-1199,1118. 一月有多少天,一月有多少天,https://leetcode.cn/problems/number-of-days-in-a-month/,number-of-days-in-a-month,数学,https://algo.itcharge.cn/Solutions/1100-1199/number-of-days-in-a-month/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1118.%20%E4%B8%80%E6%9C%88%E6%9C%89%E5%A4%9A%E5%B0%91%E5%A4%A9.md,64.9%,简单,68 -1119,1100-1199,1119. 删去字符串中的元音,删去字符串中的元音,https://leetcode.cn/problems/remove-vowels-from-a-string/,remove-vowels-from-a-string,字符串,https://algo.itcharge.cn/Solutions/1100-1199/remove-vowels-from-a-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1119.%20%E5%88%A0%E5%8E%BB%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%85%83%E9%9F%B3.md,87.2%,简单,184 -1120,1100-1199,1120. 子树的最大平均值,子树的最大平均值,https://leetcode.cn/problems/maximum-average-subtree/,maximum-average-subtree,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/1100-1199/maximum-average-subtree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1120.%20%E5%AD%90%E6%A0%91%E7%9A%84%E6%9C%80%E5%A4%A7%E5%B9%B3%E5%9D%87%E5%80%BC.md,62.9%,中等,82 -1121,1100-1199,1121. 将数组分成几个递增序列,将数组分成几个递增序列,https://leetcode.cn/problems/divide-array-into-increasing-sequences/,divide-array-into-increasing-sequences,贪心、数组,https://algo.itcharge.cn/Solutions/1100-1199/divide-array-into-increasing-sequences/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1121.%20%E5%B0%86%E6%95%B0%E7%BB%84%E5%88%86%E6%88%90%E5%87%A0%E4%B8%AA%E9%80%92%E5%A2%9E%E5%BA%8F%E5%88%97.md,60.6%,困难,27 -1122,1100-1199,1122. 数组的相对排序,数组的相对排序,https://leetcode.cn/problems/relative-sort-array/,relative-sort-array,数组、哈希表、计数排序、排序,https://algo.itcharge.cn/Solutions/1100-1199/relative-sort-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1122.%20%E6%95%B0%E7%BB%84%E7%9A%84%E7%9B%B8%E5%AF%B9%E6%8E%92%E5%BA%8F.md,70.5%,简单,1118 -1123,1100-1199,1123. 最深叶节点的最近公共祖先,最深叶节点的最近公共祖先,https://leetcode.cn/problems/lowest-common-ancestor-of-deepest-leaves/,lowest-common-ancestor-of-deepest-leaves,树、深度优先搜索、广度优先搜索、哈希表、二叉树,https://algo.itcharge.cn/Solutions/1100-1199/lowest-common-ancestor-of-deepest-leaves/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1123.%20%E6%9C%80%E6%B7%B1%E5%8F%B6%E8%8A%82%E7%82%B9%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88.md,71.8%,中等,171 -1124,1100-1199,1124. 表现良好的最长时间段,表现良好的最长时间段,https://leetcode.cn/problems/longest-well-performing-interval/,longest-well-performing-interval,栈、数组、哈希表、前缀和、单调栈,https://algo.itcharge.cn/Solutions/1100-1199/longest-well-performing-interval/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1124.%20%E8%A1%A8%E7%8E%B0%E8%89%AF%E5%A5%BD%E7%9A%84%E6%9C%80%E9%95%BF%E6%97%B6%E9%97%B4%E6%AE%B5.md,39.2%,中等,371 -1125,1100-1199,1125. 最小的必要团队,最小的必要团队,https://leetcode.cn/problems/smallest-sufficient-team/,smallest-sufficient-team,位运算、数组、动态规划、状态压缩,https://algo.itcharge.cn/Solutions/1100-1199/smallest-sufficient-team/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1125.%20%E6%9C%80%E5%B0%8F%E7%9A%84%E5%BF%85%E8%A6%81%E5%9B%A2%E9%98%9F.md,61.1%,困难,151 -1126,1100-1199,1126. 查询活跃业务,查询活跃业务,https://leetcode.cn/problems/active-businesses/,active-businesses,数据库,https://algo.itcharge.cn/Solutions/1100-1199/active-businesses/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1126.%20%E6%9F%A5%E8%AF%A2%E6%B4%BB%E8%B7%83%E4%B8%9A%E5%8A%A1.md,68.1%,中等,150 -1127,1100-1199,1127. 用户购买平台,用户购买平台,https://leetcode.cn/problems/user-purchase-platform/,user-purchase-platform,数据库,https://algo.itcharge.cn/Solutions/1100-1199/user-purchase-platform/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1127.%20%E7%94%A8%E6%88%B7%E8%B4%AD%E4%B9%B0%E5%B9%B3%E5%8F%B0.md,43.0%,困难,108 -1128,1100-1199,1128. 等价多米诺骨牌对的数量,等价多米诺骨牌对的数量,https://leetcode.cn/problems/number-of-equivalent-domino-pairs/,number-of-equivalent-domino-pairs,数组、哈希表、计数,https://algo.itcharge.cn/Solutions/1100-1199/number-of-equivalent-domino-pairs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1128.%20%E7%AD%89%E4%BB%B7%E5%A4%9A%E7%B1%B3%E8%AF%BA%E9%AA%A8%E7%89%8C%E5%AF%B9%E7%9A%84%E6%95%B0%E9%87%8F.md,54.1%,简单,547 -1129,1100-1199,1129. 颜色交替的最短路径,颜色交替的最短路径,https://leetcode.cn/problems/shortest-path-with-alternating-colors/,shortest-path-with-alternating-colors,广度优先搜索、图,https://algo.itcharge.cn/Solutions/1100-1199/shortest-path-with-alternating-colors/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1129.%20%E9%A2%9C%E8%89%B2%E4%BA%A4%E6%9B%BF%E7%9A%84%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84.md,48.7%,中等,400 -1130,1100-1199,1130. 叶值的最小代价生成树,叶值的最小代价生成树,https://leetcode.cn/problems/minimum-cost-tree-from-leaf-values/,minimum-cost-tree-from-leaf-values,栈、贪心、数组、动态规划、单调栈,https://algo.itcharge.cn/Solutions/1100-1199/minimum-cost-tree-from-leaf-values/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1130.%20%E5%8F%B6%E5%80%BC%E7%9A%84%E6%9C%80%E5%B0%8F%E4%BB%A3%E4%BB%B7%E7%94%9F%E6%88%90%E6%A0%91.md,70.8%,中等,253 -1131,1100-1199,1131. 绝对值表达式的最大值,绝对值表达式的最大值,https://leetcode.cn/problems/maximum-of-absolute-value-expression/,maximum-of-absolute-value-expression,数组、数学,https://algo.itcharge.cn/Solutions/1100-1199/maximum-of-absolute-value-expression/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1131.%20%E7%BB%9D%E5%AF%B9%E5%80%BC%E8%A1%A8%E8%BE%BE%E5%BC%8F%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md,47.5%,中等,69 -1132,1100-1199,1132. 报告的记录 II,报告的记录 II,https://leetcode.cn/problems/reported-posts-ii/,reported-posts-ii,数据库,https://algo.itcharge.cn/Solutions/1100-1199/reported-posts-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1132.%20%E6%8A%A5%E5%91%8A%E7%9A%84%E8%AE%B0%E5%BD%95%20II.md,38.6%,中等,79 -1133,1100-1199,1133. 最大唯一数,最大唯一数,https://leetcode.cn/problems/largest-unique-number/,largest-unique-number,数组、哈希表、排序,https://algo.itcharge.cn/Solutions/1100-1199/largest-unique-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1133.%20%E6%9C%80%E5%A4%A7%E5%94%AF%E4%B8%80%E6%95%B0.md,65.6%,简单,104 -1134,1100-1199,1134. 阿姆斯特朗数,阿姆斯特朗数,https://leetcode.cn/problems/armstrong-number/,armstrong-number,数学,https://algo.itcharge.cn/Solutions/1100-1199/armstrong-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1134.%20%E9%98%BF%E5%A7%86%E6%96%AF%E7%89%B9%E6%9C%97%E6%95%B0.md,77.4%,简单,78 -1135,1100-1199,1135. 最低成本联通所有城市,最低成本联通所有城市,https://leetcode.cn/problems/connecting-cities-with-minimum-cost/,connecting-cities-with-minimum-cost,并查集、图、最小生成树、堆（优先队列）,https://algo.itcharge.cn/Solutions/1100-1199/connecting-cities-with-minimum-cost/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1135.%20%E6%9C%80%E4%BD%8E%E6%88%90%E6%9C%AC%E8%81%94%E9%80%9A%E6%89%80%E6%9C%89%E5%9F%8E%E5%B8%82.md,57.9%,中等,152 -1136,1100-1199,1136. 并行课程,并行课程,https://leetcode.cn/problems/parallel-courses/,parallel-courses,图、拓扑排序,https://algo.itcharge.cn/Solutions/1100-1199/parallel-courses/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1136.%20%E5%B9%B6%E8%A1%8C%E8%AF%BE%E7%A8%8B.md,60.3%,中等,102 -1137,1100-1199,1137. 第 N 个泰波那契数,第 N 个泰波那契数,https://leetcode.cn/problems/n-th-tribonacci-number/,n-th-tribonacci-number,记忆化搜索、数学、动态规划,https://algo.itcharge.cn/Solutions/1100-1199/n-th-tribonacci-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1137.%20%E7%AC%AC%20N%20%E4%B8%AA%E6%B3%B0%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0.md,61.0%,简单,1439 -1138,1100-1199,1138. 字母板上的路径,字母板上的路径,https://leetcode.cn/problems/alphabet-board-path/,alphabet-board-path,哈希表、字符串,https://algo.itcharge.cn/Solutions/1100-1199/alphabet-board-path/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1138.%20%E5%AD%97%E6%AF%8D%E6%9D%BF%E4%B8%8A%E7%9A%84%E8%B7%AF%E5%BE%84.md,51.8%,中等,440 -1139,1100-1199,1139. 最大的以 1 为边界的正方形,最大的以 1 为边界的正方形,https://leetcode.cn/problems/largest-1-bordered-square/,largest-1-bordered-square,数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/1100-1199/largest-1-bordered-square/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1139.%20%E6%9C%80%E5%A4%A7%E7%9A%84%E4%BB%A5%201%20%E4%B8%BA%E8%BE%B9%E7%95%8C%E7%9A%84%E6%AD%A3%E6%96%B9%E5%BD%A2.md,56.1%,中等,372 -1140,1100-1199,1140. 石子游戏 II,石子游戏 II,https://leetcode.cn/problems/stone-game-ii/,stone-game-ii,数组、数学、动态规划、博弈,https://algo.itcharge.cn/Solutions/1100-1199/stone-game-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1140.%20%E7%9F%B3%E5%AD%90%E6%B8%B8%E6%88%8F%20II.md,70.4%,中等,221 -1141,1100-1199,1141. 查询近30天活跃用户数,查询近30天活跃用户数,https://leetcode.cn/problems/user-activity-for-the-past-30-days-i/,user-activity-for-the-past-30-days-i,数据库,https://algo.itcharge.cn/Solutions/1100-1199/user-activity-for-the-past-30-days-i/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1141.%20%E6%9F%A5%E8%AF%A2%E8%BF%9130%E5%A4%A9%E6%B4%BB%E8%B7%83%E7%94%A8%E6%88%B7%E6%95%B0.md,44.9%,简单,321 -1142,1100-1199,1142. 过去30天的用户活动 II,过去30天的用户活动 II,https://leetcode.cn/problems/user-activity-for-the-past-30-days-ii/,user-activity-for-the-past-30-days-ii,数据库,https://algo.itcharge.cn/Solutions/1100-1199/user-activity-for-the-past-30-days-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1142.%20%E8%BF%87%E5%8E%BB30%E5%A4%A9%E7%9A%84%E7%94%A8%E6%88%B7%E6%B4%BB%E5%8A%A8%20II.md,37.2%,简单,72 -1143,1100-1199,1143. 最长公共子序列,最长公共子序列,https://leetcode.cn/problems/longest-common-subsequence/,longest-common-subsequence,字符串、动态规划,https://algo.itcharge.cn/Solutions/1100-1199/longest-common-subsequence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1143.%20%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%AD%90%E5%BA%8F%E5%88%97.md,64.9%,中等,1882 -1144,1100-1199,1144. 递减元素使数组呈锯齿状,递减元素使数组呈锯齿状,https://leetcode.cn/problems/decrease-elements-to-make-array-zigzag/,decrease-elements-to-make-array-zigzag,贪心、数组,https://algo.itcharge.cn/Solutions/1100-1199/decrease-elements-to-make-array-zigzag/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1144.%20%E9%80%92%E5%87%8F%E5%85%83%E7%B4%A0%E4%BD%BF%E6%95%B0%E7%BB%84%E5%91%88%E9%94%AF%E9%BD%BF%E7%8A%B6.md,50.5%,中等,339 -1145,1100-1199,1145. 二叉树着色游戏,二叉树着色游戏,https://leetcode.cn/problems/binary-tree-coloring-game/,binary-tree-coloring-game,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/1100-1199/binary-tree-coloring-game/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1145.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9D%80%E8%89%B2%E6%B8%B8%E6%88%8F.md,55.4%,中等,382 -1146,1100-1199,1146. 快照数组,快照数组,https://leetcode.cn/problems/snapshot-array/,snapshot-array,设计、数组、哈希表、二分查找,https://algo.itcharge.cn/Solutions/1100-1199/snapshot-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1146.%20%E5%BF%AB%E7%85%A7%E6%95%B0%E7%BB%84.md,33.5%,中等,118 -1147,1100-1199,1147. 段式回文,段式回文,https://leetcode.cn/problems/longest-chunked-palindrome-decomposition/,longest-chunked-palindrome-decomposition,贪心、双指针、字符串、动态规划、哈希函数、滚动哈希,https://algo.itcharge.cn/Solutions/1100-1199/longest-chunked-palindrome-decomposition/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1147.%20%E6%AE%B5%E5%BC%8F%E5%9B%9E%E6%96%87.md,59.0%,困难,361 -1148,1100-1199,1148. 文章浏览 I,文章浏览 I,https://leetcode.cn/problems/article-views-i/,article-views-i,数据库,https://algo.itcharge.cn/Solutions/1100-1199/article-views-i/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1148.%20%E6%96%87%E7%AB%A0%E6%B5%8F%E8%A7%88%20I.md,71.4%,简单,189 -1149,1100-1199,1149. 文章浏览 II,文章浏览 II,https://leetcode.cn/problems/article-views-ii/,article-views-ii,数据库,https://algo.itcharge.cn/Solutions/1100-1199/article-views-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1149.%20%E6%96%87%E7%AB%A0%E6%B5%8F%E8%A7%88%20II.md,44.5%,中等,76 -1150,1100-1199,1150. 检查一个数是否在数组中占绝大多数,检查一个数是否在数组中占绝大多数,https://leetcode.cn/problems/check-if-a-number-is-majority-element-in-a-sorted-array/,check-if-a-number-is-majority-element-in-a-sorted-array,数组、二分查找,https://algo.itcharge.cn/Solutions/1100-1199/check-if-a-number-is-majority-element-in-a-sorted-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1150.%20%E6%A3%80%E6%9F%A5%E4%B8%80%E4%B8%AA%E6%95%B0%E6%98%AF%E5%90%A6%E5%9C%A8%E6%95%B0%E7%BB%84%E4%B8%AD%E5%8D%A0%E7%BB%9D%E5%A4%A7%E5%A4%9A%E6%95%B0.md,59.5%,简单,128 -1151,1100-1199,1151. 最少交换次数来组合所有的 1,最少交换次数来组合所有的 1,https://leetcode.cn/problems/minimum-swaps-to-group-all-1s-together/,minimum-swaps-to-group-all-1s-together,数组、滑动窗口,https://algo.itcharge.cn/Solutions/1100-1199/minimum-swaps-to-group-all-1s-together/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1151.%20%E6%9C%80%E5%B0%91%E4%BA%A4%E6%8D%A2%E6%AC%A1%E6%95%B0%E6%9D%A5%E7%BB%84%E5%90%88%E6%89%80%E6%9C%89%E7%9A%84%201.md,52.8%,中等,139 -1152,1100-1199,1152. 用户网站访问行为分析,用户网站访问行为分析,https://leetcode.cn/problems/analyze-user-website-visit-pattern/,analyze-user-website-visit-pattern,数组、哈希表、排序,https://algo.itcharge.cn/Solutions/1100-1199/analyze-user-website-visit-pattern/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1152.%20%E7%94%A8%E6%88%B7%E7%BD%91%E7%AB%99%E8%AE%BF%E9%97%AE%E8%A1%8C%E4%B8%BA%E5%88%86%E6%9E%90.md,41.5%,中等,58 -1153,1100-1199,1153. 字符串转化,字符串转化,https://leetcode.cn/problems/string-transforms-into-another-string/,string-transforms-into-another-string,哈希表、字符串,https://algo.itcharge.cn/Solutions/1100-1199/string-transforms-into-another-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1153.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%BD%AC%E5%8C%96.md,37.8%,困难,31 -1154,1100-1199,1154. 一年中的第几天,一年中的第几天,https://leetcode.cn/problems/day-of-the-year/,day-of-the-year,数学、字符串,https://algo.itcharge.cn/Solutions/1100-1199/day-of-the-year/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1154.%20%E4%B8%80%E5%B9%B4%E4%B8%AD%E7%9A%84%E7%AC%AC%E5%87%A0%E5%A4%A9.md,62.5%,简单,643 -1155,1100-1199,1155. 掷骰子等于目标和的方法数,掷骰子等于目标和的方法数,https://leetcode.cn/problems/number-of-dice-rolls-with-target-sum/,number-of-dice-rolls-with-target-sum,动态规划,https://algo.itcharge.cn/Solutions/1100-1199/number-of-dice-rolls-with-target-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1155.%20%E6%8E%B7%E9%AA%B0%E5%AD%90%E7%AD%89%E4%BA%8E%E7%9B%AE%E6%A0%87%E5%92%8C%E7%9A%84%E6%96%B9%E6%B3%95%E6%95%B0.md,50.9%,中等,204 -1156,1100-1199,1156. 单字符重复子串的最大长度,单字符重复子串的最大长度,https://leetcode.cn/problems/swap-for-longest-repeated-character-substring/,swap-for-longest-repeated-character-substring,哈希表、字符串、滑动窗口,https://algo.itcharge.cn/Solutions/1100-1199/swap-for-longest-repeated-character-substring/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1156.%20%E5%8D%95%E5%AD%97%E7%AC%A6%E9%87%8D%E5%A4%8D%E5%AD%90%E4%B8%B2%E7%9A%84%E6%9C%80%E5%A4%A7%E9%95%BF%E5%BA%A6.md,51.3%,中等,297 -1157,1100-1199,1157. 子数组中占绝大多数的元素,子数组中占绝大多数的元素,https://leetcode.cn/problems/online-majority-element-in-subarray/,online-majority-element-in-subarray,设计、树状数组、线段树、数组、二分查找,https://algo.itcharge.cn/Solutions/1100-1199/online-majority-element-in-subarray/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1157.%20%E5%AD%90%E6%95%B0%E7%BB%84%E4%B8%AD%E5%8D%A0%E7%BB%9D%E5%A4%A7%E5%A4%9A%E6%95%B0%E7%9A%84%E5%85%83%E7%B4%A0.md,46.2%,困难,126 -1158,1100-1199,1158. 市场分析 I,市场分析 I,https://leetcode.cn/problems/market-analysis-i/,market-analysis-i,数据库,https://algo.itcharge.cn/Solutions/1100-1199/market-analysis-i/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1158.%20%E5%B8%82%E5%9C%BA%E5%88%86%E6%9E%90%20I.md,54.5%,中等,271 -1159,1100-1199,1159. 市场分析 II,市场分析 II,https://leetcode.cn/problems/market-analysis-ii/,market-analysis-ii,数据库,https://algo.itcharge.cn/Solutions/1100-1199/market-analysis-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1159.%20%E5%B8%82%E5%9C%BA%E5%88%86%E6%9E%90%20II.md,50.6%,困难,123 -1160,1100-1199,1160. 拼写单词,拼写单词,https://leetcode.cn/problems/find-words-that-can-be-formed-by-characters/,find-words-that-can-be-formed-by-characters,数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/1100-1199/find-words-that-can-be-formed-by-characters/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1160.%20%E6%8B%BC%E5%86%99%E5%8D%95%E8%AF%8D.md,68.2%,简单,1065 -1161,1100-1199,1161. 最大层内元素和,最大层内元素和,https://leetcode.cn/problems/maximum-level-sum-of-a-binary-tree/,maximum-level-sum-of-a-binary-tree,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/1100-1199/maximum-level-sum-of-a-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1161.%20%E6%9C%80%E5%A4%A7%E5%B1%82%E5%86%85%E5%85%83%E7%B4%A0%E5%92%8C.md,66.1%,中等,508 -1162,1100-1199,1162. 地图分析,地图分析,https://leetcode.cn/problems/as-far-from-land-as-possible/,as-far-from-land-as-possible,广度优先搜索、数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/1100-1199/as-far-from-land-as-possible/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1162.%20%E5%9C%B0%E5%9B%BE%E5%88%86%E6%9E%90.md,46.7%,中等,669 -1163,1100-1199,1163. 按字典序排在最后的子串,按字典序排在最后的子串,https://leetcode.cn/problems/last-substring-in-lexicographical-order/,last-substring-in-lexicographical-order,双指针、字符串,https://algo.itcharge.cn/Solutions/1100-1199/last-substring-in-lexicographical-order/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1163.%20%E6%8C%89%E5%AD%97%E5%85%B8%E5%BA%8F%E6%8E%92%E5%9C%A8%E6%9C%80%E5%90%8E%E7%9A%84%E5%AD%90%E4%B8%B2.md,35.2%,困难,238 -1164,1100-1199,1164. 指定日期的产品价格,指定日期的产品价格,https://leetcode.cn/problems/product-price-at-a-given-date/,product-price-at-a-given-date,数据库,https://algo.itcharge.cn/Solutions/1100-1199/product-price-at-a-given-date/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1164.%20%E6%8C%87%E5%AE%9A%E6%97%A5%E6%9C%9F%E7%9A%84%E4%BA%A7%E5%93%81%E4%BB%B7%E6%A0%BC.md,58.4%,中等,188 -1165,1100-1199,1165. 单行键盘,单行键盘,https://leetcode.cn/problems/single-row-keyboard/,single-row-keyboard,哈希表、字符串,https://algo.itcharge.cn/Solutions/1100-1199/single-row-keyboard/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1165.%20%E5%8D%95%E8%A1%8C%E9%94%AE%E7%9B%98.md,84.0%,简单,156 -1166,1100-1199,1166. 设计文件系统,设计文件系统,https://leetcode.cn/problems/design-file-system/,design-file-system,设计、字典树、哈希表、字符串,https://algo.itcharge.cn/Solutions/1100-1199/design-file-system/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1166.%20%E8%AE%BE%E8%AE%A1%E6%96%87%E4%BB%B6%E7%B3%BB%E7%BB%9F.md,49.7%,中等,87 -1167,1100-1199,1167. 连接棒材的最低费用,连接棒材的最低费用,https://leetcode.cn/problems/minimum-cost-to-connect-sticks/,minimum-cost-to-connect-sticks,贪心、数组、堆（优先队列）,https://algo.itcharge.cn/Solutions/1100-1199/minimum-cost-to-connect-sticks/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1167.%20%E8%BF%9E%E6%8E%A5%E6%A3%92%E6%9D%90%E7%9A%84%E6%9C%80%E4%BD%8E%E8%B4%B9%E7%94%A8.md,51.2%,中等,54 -1168,1100-1199,1168. 水资源分配优化,水资源分配优化,https://leetcode.cn/problems/optimize-water-distribution-in-a-village/,optimize-water-distribution-in-a-village,并查集、图、最小生成树,https://algo.itcharge.cn/Solutions/1100-1199/optimize-water-distribution-in-a-village/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1168.%20%E6%B0%B4%E8%B5%84%E6%BA%90%E5%88%86%E9%85%8D%E4%BC%98%E5%8C%96.md,62.5%,困难,55 -1169,1100-1199,1169. 查询无效交易,查询无效交易,https://leetcode.cn/problems/invalid-transactions/,invalid-transactions,数组、哈希表、字符串、排序,https://algo.itcharge.cn/Solutions/1100-1199/invalid-transactions/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1169.%20%E6%9F%A5%E8%AF%A2%E6%97%A0%E6%95%88%E4%BA%A4%E6%98%93.md,33.0%,中等,112 -1170,1100-1199,1170. 比较字符串最小字母出现频次,比较字符串最小字母出现频次,https://leetcode.cn/problems/compare-strings-by-frequency-of-the-smallest-character/,compare-strings-by-frequency-of-the-smallest-character,数组、哈希表、字符串、二分查找、排序,https://algo.itcharge.cn/Solutions/1100-1199/compare-strings-by-frequency-of-the-smallest-character/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1170.%20%E6%AF%94%E8%BE%83%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%9C%80%E5%B0%8F%E5%AD%97%E6%AF%8D%E5%87%BA%E7%8E%B0%E9%A2%91%E6%AC%A1.md,66.3%,中等,432 -1171,1100-1199,1171. 从链表中删去总和值为零的连续节点,从链表中删去总和值为零的连续节点,https://leetcode.cn/problems/remove-zero-sum-consecutive-nodes-from-linked-list/,remove-zero-sum-consecutive-nodes-from-linked-list,哈希表、链表,https://algo.itcharge.cn/Solutions/1100-1199/remove-zero-sum-consecutive-nodes-from-linked-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1171.%20%E4%BB%8E%E9%93%BE%E8%A1%A8%E4%B8%AD%E5%88%A0%E5%8E%BB%E6%80%BB%E5%92%8C%E5%80%BC%E4%B8%BA%E9%9B%B6%E7%9A%84%E8%BF%9E%E7%BB%AD%E8%8A%82%E7%82%B9.md,53.1%,中等,332 -1172,1100-1199,1172. 餐盘栈,餐盘栈,https://leetcode.cn/problems/dinner-plate-stacks/,dinner-plate-stacks,栈、设计、哈希表、堆（优先队列）,https://algo.itcharge.cn/Solutions/1100-1199/dinner-plate-stacks/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1172.%20%E9%A4%90%E7%9B%98%E6%A0%88.md,40.0%,困难,158 -1173,1100-1199,1173. 即时食物配送 I,即时食物配送 I,https://leetcode.cn/problems/immediate-food-delivery-i/,immediate-food-delivery-i,数据库,https://algo.itcharge.cn/Solutions/1100-1199/immediate-food-delivery-i/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1173.%20%E5%8D%B3%E6%97%B6%E9%A3%9F%E7%89%A9%E9%85%8D%E9%80%81%20I.md,76.5%,简单,140 -1174,1100-1199,1174. 即时食物配送 II,即时食物配送 II,https://leetcode.cn/problems/immediate-food-delivery-ii/,immediate-food-delivery-ii,数据库,https://algo.itcharge.cn/Solutions/1100-1199/immediate-food-delivery-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1174.%20%E5%8D%B3%E6%97%B6%E9%A3%9F%E7%89%A9%E9%85%8D%E9%80%81%20II.md,61.9%,中等,118 -1175,1100-1199,1175. 质数排列,质数排列,https://leetcode.cn/problems/prime-arrangements/,prime-arrangements,数学,https://algo.itcharge.cn/Solutions/1100-1199/prime-arrangements/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1175.%20%E8%B4%A8%E6%95%B0%E6%8E%92%E5%88%97.md,56.3%,简单,381 -1176,1100-1199,1176. 健身计划评估,健身计划评估,https://leetcode.cn/problems/diet-plan-performance/,diet-plan-performance,数组、滑动窗口,https://algo.itcharge.cn/Solutions/1100-1199/diet-plan-performance/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1176.%20%E5%81%A5%E8%BA%AB%E8%AE%A1%E5%88%92%E8%AF%84%E4%BC%B0.md,48.5%,简单,96 -1177,1100-1199,1177. 构建回文串检测,构建回文串检测,https://leetcode.cn/problems/can-make-palindrome-from-substring/,can-make-palindrome-from-substring,位运算、数组、哈希表、字符串、前缀和,https://algo.itcharge.cn/Solutions/1100-1199/can-make-palindrome-from-substring/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1177.%20%E6%9E%84%E5%BB%BA%E5%9B%9E%E6%96%87%E4%B8%B2%E6%A3%80%E6%B5%8B.md,41.9%,中等,242 -1178,1100-1199,1178. 猜字谜,猜字谜,https://leetcode.cn/problems/number-of-valid-words-for-each-puzzle/,number-of-valid-words-for-each-puzzle,位运算、字典树、数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/1100-1199/number-of-valid-words-for-each-puzzle/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1178.%20%E7%8C%9C%E5%AD%97%E8%B0%9C.md,46.7%,困难,201 -1179,1100-1199,1179. 重新格式化部门表,重新格式化部门表,https://leetcode.cn/problems/reformat-department-table/,reformat-department-table,数据库,https://algo.itcharge.cn/Solutions/1100-1199/reformat-department-table/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1179.%20%E9%87%8D%E6%96%B0%E6%A0%BC%E5%BC%8F%E5%8C%96%E9%83%A8%E9%97%A8%E8%A1%A8.md,64.8%,简单,272 -1180,1100-1199,1180. 统计只含单一字母的子串,统计只含单一字母的子串,https://leetcode.cn/problems/count-substrings-with-only-one-distinct-letter/,count-substrings-with-only-one-distinct-letter,数学、字符串,https://algo.itcharge.cn/Solutions/1100-1199/count-substrings-with-only-one-distinct-letter/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1180.%20%E7%BB%9F%E8%AE%A1%E5%8F%AA%E5%90%AB%E5%8D%95%E4%B8%80%E5%AD%97%E6%AF%8D%E7%9A%84%E5%AD%90%E4%B8%B2.md,78.1%,简单,107 -1181,1100-1199,1181. 前后拼接,前后拼接,https://leetcode.cn/problems/before-and-after-puzzle/,before-and-after-puzzle,数组、哈希表、字符串、排序,https://algo.itcharge.cn/Solutions/1100-1199/before-and-after-puzzle/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1181.%20%E5%89%8D%E5%90%8E%E6%8B%BC%E6%8E%A5.md,39.8%,中等,37 -1182,1100-1199,1182. 与目标颜色间的最短距离,与目标颜色间的最短距离,https://leetcode.cn/problems/shortest-distance-to-target-color/,shortest-distance-to-target-color,数组、二分查找、动态规划,https://algo.itcharge.cn/Solutions/1100-1199/shortest-distance-to-target-color/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1182.%20%E4%B8%8E%E7%9B%AE%E6%A0%87%E9%A2%9C%E8%89%B2%E9%97%B4%E7%9A%84%E6%9C%80%E7%9F%AD%E8%B7%9D%E7%A6%BB.md,47.7%,中等,99 -1183,1100-1199,1183. 矩阵中 1 的最大数量,矩阵中 1 的最大数量,https://leetcode.cn/problems/maximum-number-of-ones/,maximum-number-of-ones,贪心、堆（优先队列）,https://algo.itcharge.cn/Solutions/1100-1199/maximum-number-of-ones/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1183.%20%E7%9F%A9%E9%98%B5%E4%B8%AD%201%20%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E9%87%8F.md,62.5%,困难,28 -1184,1100-1199,1184. 公交站间的距离,公交站间的距离,https://leetcode.cn/problems/distance-between-bus-stops/,distance-between-bus-stops,数组,https://algo.itcharge.cn/Solutions/1100-1199/distance-between-bus-stops/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1184.%20%E5%85%AC%E4%BA%A4%E7%AB%99%E9%97%B4%E7%9A%84%E8%B7%9D%E7%A6%BB.md,61.8%,简单,622 -1185,1100-1199,1185. 一周中的第几天,一周中的第几天,https://leetcode.cn/problems/day-of-the-week/,day-of-the-week,数学,https://algo.itcharge.cn/Solutions/1100-1199/day-of-the-week/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1185.%20%E4%B8%80%E5%91%A8%E4%B8%AD%E7%9A%84%E7%AC%AC%E5%87%A0%E5%A4%A9.md,62.2%,简单,532 -1186,1100-1199,1186. 删除一次得到子数组最大和,删除一次得到子数组最大和,https://leetcode.cn/problems/maximum-subarray-sum-with-one-deletion/,maximum-subarray-sum-with-one-deletion,数组、动态规划,https://algo.itcharge.cn/Solutions/1100-1199/maximum-subarray-sum-with-one-deletion/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1186.%20%E5%88%A0%E9%99%A4%E4%B8%80%E6%AC%A1%E5%BE%97%E5%88%B0%E5%AD%90%E6%95%B0%E7%BB%84%E6%9C%80%E5%A4%A7%E5%92%8C.md,48.1%,中等,262 -1187,1100-1199,1187. 使数组严格递增,使数组严格递增,https://leetcode.cn/problems/make-array-strictly-increasing/,make-array-strictly-increasing,数组、二分查找、动态规划、排序,https://algo.itcharge.cn/Solutions/1100-1199/make-array-strictly-increasing/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1187.%20%E4%BD%BF%E6%95%B0%E7%BB%84%E4%B8%A5%E6%A0%BC%E9%80%92%E5%A2%9E.md,59.8%,困难,113 -1188,1100-1199,1188. 设计有限阻塞队列,设计有限阻塞队列,https://leetcode.cn/problems/design-bounded-blocking-queue/,design-bounded-blocking-queue,多线程,https://algo.itcharge.cn/Solutions/1100-1199/design-bounded-blocking-queue/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1188.%20%E8%AE%BE%E8%AE%A1%E6%9C%89%E9%99%90%E9%98%BB%E5%A1%9E%E9%98%9F%E5%88%97.md,70.2%,中等,89 -1189,1100-1199,1189. “气球” 的最大数量,“气球” 的最大数量,https://leetcode.cn/problems/maximum-number-of-balloons/,maximum-number-of-balloons,哈希表、字符串、计数,https://algo.itcharge.cn/Solutions/1100-1199/maximum-number-of-balloons/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1189.%20%E2%80%9C%E6%B0%94%E7%90%83%E2%80%9D%20%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E9%87%8F.md,68.3%,简单,815 -1190,1100-1199,1190. 反转每对括号间的子串,反转每对括号间的子串,https://leetcode.cn/problems/reverse-substrings-between-each-pair-of-parentheses/,reverse-substrings-between-each-pair-of-parentheses,栈、字符串,https://algo.itcharge.cn/Solutions/1100-1199/reverse-substrings-between-each-pair-of-parentheses/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1190.%20%E5%8F%8D%E8%BD%AC%E6%AF%8F%E5%AF%B9%E6%8B%AC%E5%8F%B7%E9%97%B4%E7%9A%84%E5%AD%90%E4%B8%B2.md,64.8%,中等,752 -1191,1100-1199,1191. K 次串联后最大子数组之和,K 次串联后最大子数组之和,https://leetcode.cn/problems/k-concatenation-maximum-sum/,k-concatenation-maximum-sum,数组、动态规划,https://algo.itcharge.cn/Solutions/1100-1199/k-concatenation-maximum-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1191.%20K%20%E6%AC%A1%E4%B8%B2%E8%81%94%E5%90%8E%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84%E4%B9%8B%E5%92%8C.md,27.0%,中等,135 -1192,1100-1199,1192. 查找集群内的关键连接,查找集群内的关键连接,https://leetcode.cn/problems/critical-connections-in-a-network/,critical-connections-in-a-network,深度优先搜索、图、双连通分量,https://algo.itcharge.cn/Solutions/1100-1199/critical-connections-in-a-network/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1192.%20%E6%9F%A5%E6%89%BE%E9%9B%86%E7%BE%A4%E5%86%85%E7%9A%84%E5%85%B3%E9%94%AE%E8%BF%9E%E6%8E%A5.md,54.3%,困难,112 -1193,1100-1199,1193. 每月交易 I,每月交易 I,https://leetcode.cn/problems/monthly-transactions-i/,monthly-transactions-i,数据库,https://algo.itcharge.cn/Solutions/1100-1199/monthly-transactions-i/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1193.%20%E6%AF%8F%E6%9C%88%E4%BA%A4%E6%98%93%20I.md,60.9%,中等,155 -1194,1100-1199,1194. 锦标赛优胜者,锦标赛优胜者,https://leetcode.cn/problems/tournament-winners/,tournament-winners,数据库,https://algo.itcharge.cn/Solutions/1100-1199/tournament-winners/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1194.%20%E9%94%A6%E6%A0%87%E8%B5%9B%E4%BC%98%E8%83%9C%E8%80%85.md,51.0%,困难,99 -1195,1100-1199,1195. 交替打印字符串,交替打印字符串,https://leetcode.cn/problems/fizz-buzz-multithreaded/,fizz-buzz-multithreaded,多线程,https://algo.itcharge.cn/Solutions/1100-1199/fizz-buzz-multithreaded/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1195.%20%E4%BA%A4%E6%9B%BF%E6%89%93%E5%8D%B0%E5%AD%97%E7%AC%A6%E4%B8%B2.md,65.0%,中等,359 -1196,1100-1199,1196. 最多可以买到的苹果数量,最多可以买到的苹果数量,https://leetcode.cn/problems/how-many-apples-can-you-put-into-the-basket/,how-many-apples-can-you-put-into-the-basket,贪心、数组、排序,https://algo.itcharge.cn/Solutions/1100-1199/how-many-apples-can-you-put-into-the-basket/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1196.%20%E6%9C%80%E5%A4%9A%E5%8F%AF%E4%BB%A5%E4%B9%B0%E5%88%B0%E7%9A%84%E8%8B%B9%E6%9E%9C%E6%95%B0%E9%87%8F.md,68.2%,简单,82 -1197,1100-1199,1197. 进击的骑士,进击的骑士,https://leetcode.cn/problems/minimum-knight-moves/,minimum-knight-moves,广度优先搜索,https://algo.itcharge.cn/Solutions/1100-1199/minimum-knight-moves/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1197.%20%E8%BF%9B%E5%87%BB%E7%9A%84%E9%AA%91%E5%A3%AB.md,39.2%,中等,88 -1198,1100-1199,1198. 找出所有行中最小公共元素,找出所有行中最小公共元素,https://leetcode.cn/problems/find-smallest-common-element-in-all-rows/,find-smallest-common-element-in-all-rows,数组、哈希表、二分查找、计数、矩阵,https://algo.itcharge.cn/Solutions/1100-1199/find-smallest-common-element-in-all-rows/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1198.%20%E6%89%BE%E5%87%BA%E6%89%80%E6%9C%89%E8%A1%8C%E4%B8%AD%E6%9C%80%E5%B0%8F%E5%85%AC%E5%85%B1%E5%85%83%E7%B4%A0.md,73.9%,中等,94 -1199,1100-1199,1199. 建造街区的最短时间,建造街区的最短时间,https://leetcode.cn/problems/minimum-time-to-build-blocks/,minimum-time-to-build-blocks,贪心、数学、堆（优先队列）,https://algo.itcharge.cn/Solutions/1100-1199/minimum-time-to-build-blocks/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1199.%20%E5%BB%BA%E9%80%A0%E8%A1%97%E5%8C%BA%E7%9A%84%E6%9C%80%E7%9F%AD%E6%97%B6%E9%97%B4.md,47.3%,困难,31 -1200,1200-1299,1200. 最小绝对差,最小绝对差,https://leetcode.cn/problems/minimum-absolute-difference/,minimum-absolute-difference,数组、排序,https://algo.itcharge.cn/Solutions/1200-1299/minimum-absolute-difference/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1200.%20%E6%9C%80%E5%B0%8F%E7%BB%9D%E5%AF%B9%E5%B7%AE.md,72.5%,简单,629 -1201,1200-1299,1201. 丑数 III,丑数 III,https://leetcode.cn/problems/ugly-number-iii/,ugly-number-iii,数学、二分查找、数论,https://algo.itcharge.cn/Solutions/1200-1299/ugly-number-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1201.%20%E4%B8%91%E6%95%B0%20III.md,28.5%,中等,156 -1202,1200-1299,1202. 交换字符串中的元素,交换字符串中的元素,https://leetcode.cn/problems/smallest-string-with-swaps/,smallest-string-with-swaps,深度优先搜索、广度优先搜索、并查集、哈希表、字符串,https://algo.itcharge.cn/Solutions/1200-1299/smallest-string-with-swaps/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1202.%20%E4%BA%A4%E6%8D%A2%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%85%83%E7%B4%A0.md,51.3%,中等,371 -1203,1200-1299,1203. 项目管理,项目管理,https://leetcode.cn/problems/sort-items-by-groups-respecting-dependencies/,sort-items-by-groups-respecting-dependencies,深度优先搜索、广度优先搜索、图、拓扑排序,https://algo.itcharge.cn/Solutions/1200-1299/sort-items-by-groups-respecting-dependencies/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1203.%20%E9%A1%B9%E7%9B%AE%E7%AE%A1%E7%90%86.md,60.8%,困难,175 -1204,1200-1299,1204. 最后一个能进入电梯的人,最后一个能进入电梯的人,https://leetcode.cn/problems/last-person-to-fit-in-the-bus/,last-person-to-fit-in-the-bus,数据库,https://algo.itcharge.cn/Solutions/1200-1299/last-person-to-fit-in-the-bus/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1204.%20%E6%9C%80%E5%90%8E%E4%B8%80%E4%B8%AA%E8%83%BD%E8%BF%9B%E5%85%A5%E7%94%B5%E6%A2%AF%E7%9A%84%E4%BA%BA.md,74.0%,中等,132 -1205,1200-1299,1205. 每月交易II,每月交易II,https://leetcode.cn/problems/monthly-transactions-ii/,monthly-transactions-ii,数据库,https://algo.itcharge.cn/Solutions/1200-1299/monthly-transactions-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1205.%20%E6%AF%8F%E6%9C%88%E4%BA%A4%E6%98%93II.md,45.7%,中等,109 -1206,1200-1299,1206. 设计跳表,设计跳表,https://leetcode.cn/problems/design-skiplist/,design-skiplist,设计、链表,https://algo.itcharge.cn/Solutions/1200-1299/design-skiplist/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1206.%20%E8%AE%BE%E8%AE%A1%E8%B7%B3%E8%A1%A8.md,68.3%,困难,251 -1207,1200-1299,1207. 独一无二的出现次数,独一无二的出现次数,https://leetcode.cn/problems/unique-number-of-occurrences/,unique-number-of-occurrences,数组、哈希表,https://algo.itcharge.cn/Solutions/1200-1299/unique-number-of-occurrences/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1207.%20%E7%8B%AC%E4%B8%80%E6%97%A0%E4%BA%8C%E7%9A%84%E5%87%BA%E7%8E%B0%E6%AC%A1%E6%95%B0.md,72.8%,简单,1078 -1208,1200-1299,1208. 尽可能使字符串相等,尽可能使字符串相等,https://leetcode.cn/problems/get-equal-substrings-within-budget/,get-equal-substrings-within-budget,字符串、二分查找、前缀和、滑动窗口,https://algo.itcharge.cn/Solutions/1200-1299/get-equal-substrings-within-budget/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1208.%20%E5%B0%BD%E5%8F%AF%E8%83%BD%E4%BD%BF%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E7%AD%89.md,50.0%,中等,773 -1209,1200-1299,1209. 删除字符串中的所有相邻重复项 II,删除字符串中的所有相邻重复项 II,https://leetcode.cn/problems/remove-all-adjacent-duplicates-in-string-ii/,remove-all-adjacent-duplicates-in-string-ii,栈、字符串,https://algo.itcharge.cn/Solutions/1200-1299/remove-all-adjacent-duplicates-in-string-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1209.%20%E5%88%A0%E9%99%A4%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E6%89%80%E6%9C%89%E7%9B%B8%E9%82%BB%E9%87%8D%E5%A4%8D%E9%A1%B9%20II.md,50.8%,中等,231 -1210,1200-1299,1210. 穿过迷宫的最少移动次数,穿过迷宫的最少移动次数,https://leetcode.cn/problems/minimum-moves-to-reach-target-with-rotations/,minimum-moves-to-reach-target-with-rotations,广度优先搜索、数组、矩阵,https://algo.itcharge.cn/Solutions/1200-1299/minimum-moves-to-reach-target-with-rotations/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1210.%20%E7%A9%BF%E8%BF%87%E8%BF%B7%E5%AE%AB%E7%9A%84%E6%9C%80%E5%B0%91%E7%A7%BB%E5%8A%A8%E6%AC%A1%E6%95%B0.md,64.3%,困难,181 -1211,1200-1299,1211. 查询结果的质量和占比,查询结果的质量和占比,https://leetcode.cn/problems/queries-quality-and-percentage/,queries-quality-and-percentage,数据库,https://algo.itcharge.cn/Solutions/1200-1299/queries-quality-and-percentage/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1211.%20%E6%9F%A5%E8%AF%A2%E7%BB%93%E6%9E%9C%E7%9A%84%E8%B4%A8%E9%87%8F%E5%92%8C%E5%8D%A0%E6%AF%94.md,67.3%,简单,146 -1212,1200-1299,1212. 查询球队积分,查询球队积分,https://leetcode.cn/problems/team-scores-in-football-tournament/,team-scores-in-football-tournament,数据库,https://algo.itcharge.cn/Solutions/1200-1299/team-scores-in-football-tournament/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1212.%20%E6%9F%A5%E8%AF%A2%E7%90%83%E9%98%9F%E7%A7%AF%E5%88%86.md,51.4%,中等,165 -1213,1200-1299,1213. 三个有序数组的交集,三个有序数组的交集,https://leetcode.cn/problems/intersection-of-three-sorted-arrays/,intersection-of-three-sorted-arrays,数组、哈希表、二分查找、计数,https://algo.itcharge.cn/Solutions/1200-1299/intersection-of-three-sorted-arrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1213.%20%E4%B8%89%E4%B8%AA%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E7%9A%84%E4%BA%A4%E9%9B%86.md,78.3%,简单,184 -1214,1200-1299,1214. 查找两棵二叉搜索树之和,查找两棵二叉搜索树之和,https://leetcode.cn/problems/two-sum-bsts/,two-sum-bsts,栈、树、深度优先搜索、二叉搜索树、双指针、二分查找、二叉树,https://algo.itcharge.cn/Solutions/1200-1299/two-sum-bsts/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1214.%20%E6%9F%A5%E6%89%BE%E4%B8%A4%E6%A3%B5%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B9%8B%E5%92%8C.md,65.9%,中等,100 -1215,1200-1299,1215. 步进数,步进数,https://leetcode.cn/problems/stepping-numbers/,stepping-numbers,广度优先搜索、回溯,https://algo.itcharge.cn/Solutions/1200-1299/stepping-numbers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1215.%20%E6%AD%A5%E8%BF%9B%E6%95%B0.md,43.3%,中等,54 -1216,1200-1299,1216. 验证回文字符串 III,验证回文字符串 III,https://leetcode.cn/problems/valid-palindrome-iii/,valid-palindrome-iii,字符串、动态规划,https://algo.itcharge.cn/Solutions/1200-1299/valid-palindrome-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1216.%20%E9%AA%8C%E8%AF%81%E5%9B%9E%E6%96%87%E5%AD%97%E7%AC%A6%E4%B8%B2%20III.md,57.8%,困难,57 -1217,1200-1299,1217. 玩筹码,玩筹码,https://leetcode.cn/problems/minimum-cost-to-move-chips-to-the-same-position/,minimum-cost-to-move-chips-to-the-same-position,贪心、数组、数学,https://algo.itcharge.cn/Solutions/1200-1299/minimum-cost-to-move-chips-to-the-same-position/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1217.%20%E7%8E%A9%E7%AD%B9%E7%A0%81.md,74.6%,简单,750 -1218,1200-1299,1218. 最长定差子序列,最长定差子序列,https://leetcode.cn/problems/longest-arithmetic-subsequence-of-given-difference/,longest-arithmetic-subsequence-of-given-difference,数组、哈希表、动态规划,https://algo.itcharge.cn/Solutions/1200-1299/longest-arithmetic-subsequence-of-given-difference/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1218.%20%E6%9C%80%E9%95%BF%E5%AE%9A%E5%B7%AE%E5%AD%90%E5%BA%8F%E5%88%97.md,51.6%,中等,421 -1219,1200-1299,1219. 黄金矿工,黄金矿工,https://leetcode.cn/problems/path-with-maximum-gold/,path-with-maximum-gold,数组、回溯、矩阵,https://algo.itcharge.cn/Solutions/1200-1299/path-with-maximum-gold/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1219.%20%E9%BB%84%E9%87%91%E7%9F%BF%E5%B7%A5.md,69.1%,中等,525 -1220,1200-1299,1220. 统计元音字母序列的数目,统计元音字母序列的数目,https://leetcode.cn/problems/count-vowels-permutation/,count-vowels-permutation,动态规划,https://algo.itcharge.cn/Solutions/1200-1299/count-vowels-permutation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1220.%20%E7%BB%9F%E8%AE%A1%E5%85%83%E9%9F%B3%E5%AD%97%E6%AF%8D%E5%BA%8F%E5%88%97%E7%9A%84%E6%95%B0%E7%9B%AE.md,60.7%,困难,380 -1221,1200-1299,1221. 分割平衡字符串,分割平衡字符串,https://leetcode.cn/problems/split-a-string-in-balanced-strings/,split-a-string-in-balanced-strings,贪心、字符串、计数,https://algo.itcharge.cn/Solutions/1200-1299/split-a-string-in-balanced-strings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1221.%20%E5%88%86%E5%89%B2%E5%B9%B3%E8%A1%A1%E5%AD%97%E7%AC%A6%E4%B8%B2.md,85.0%,简单,1363 -1222,1200-1299,1222. 可以攻击国王的皇后,可以攻击国王的皇后,https://leetcode.cn/problems/queens-that-can-attack-the-king/,queens-that-can-attack-the-king,数组、矩阵、模拟,https://algo.itcharge.cn/Solutions/1200-1299/queens-that-can-attack-the-king/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1222.%20%E5%8F%AF%E4%BB%A5%E6%94%BB%E5%87%BB%E5%9B%BD%E7%8E%8B%E7%9A%84%E7%9A%87%E5%90%8E.md,69.4%,中等,200 -1223,1200-1299,1223. 掷骰子模拟,掷骰子模拟,https://leetcode.cn/problems/dice-roll-simulation/,dice-roll-simulation,数组、动态规划,https://algo.itcharge.cn/Solutions/1200-1299/dice-roll-simulation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1223.%20%E6%8E%B7%E9%AA%B0%E5%AD%90%E6%A8%A1%E6%8B%9F.md,61.9%,困难,186 -1224,1200-1299,1224. 最大相等频率,最大相等频率,https://leetcode.cn/problems/maximum-equal-frequency/,maximum-equal-frequency,数组、哈希表,https://algo.itcharge.cn/Solutions/1200-1299/maximum-equal-frequency/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1224.%20%E6%9C%80%E5%A4%A7%E7%9B%B8%E7%AD%89%E9%A2%91%E7%8E%87.md,43.6%,困难,297 -1225,1200-1299,1225. 报告系统状态的连续日期,报告系统状态的连续日期,https://leetcode.cn/problems/report-contiguous-dates/,report-contiguous-dates,数据库,https://algo.itcharge.cn/Solutions/1200-1299/report-contiguous-dates/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1225.%20%E6%8A%A5%E5%91%8A%E7%B3%BB%E7%BB%9F%E7%8A%B6%E6%80%81%E7%9A%84%E8%BF%9E%E7%BB%AD%E6%97%A5%E6%9C%9F.md,53.5%,困难,136 -1226,1200-1299,1226. 哲学家进餐,哲学家进餐,https://leetcode.cn/problems/the-dining-philosophers/,the-dining-philosophers,多线程,https://algo.itcharge.cn/Solutions/1200-1299/the-dining-philosophers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1226.%20%E5%93%B2%E5%AD%A6%E5%AE%B6%E8%BF%9B%E9%A4%90.md,59.4%,中等,183 -1227,1200-1299,1227. 飞机座位分配概率,飞机座位分配概率,https://leetcode.cn/problems/airplane-seat-assignment-probability/,airplane-seat-assignment-probability,脑筋急转弯、数学、动态规划、概率与统计,https://algo.itcharge.cn/Solutions/1200-1299/airplane-seat-assignment-probability/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1227.%20%E9%A3%9E%E6%9C%BA%E5%BA%A7%E4%BD%8D%E5%88%86%E9%85%8D%E6%A6%82%E7%8E%87.md,67.0%,中等,191 -1228,1200-1299,1228. 等差数列中缺失的数字,等差数列中缺失的数字,https://leetcode.cn/problems/missing-number-in-arithmetic-progression/,missing-number-in-arithmetic-progression,数组、数学,https://algo.itcharge.cn/Solutions/1200-1299/missing-number-in-arithmetic-progression/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1228.%20%E7%AD%89%E5%B7%AE%E6%95%B0%E5%88%97%E4%B8%AD%E7%BC%BA%E5%A4%B1%E7%9A%84%E6%95%B0%E5%AD%97.md,53.9%,简单,82 -1229,1200-1299,1229. 安排会议日程,安排会议日程,https://leetcode.cn/problems/meeting-scheduler/,meeting-scheduler,数组、双指针、排序,https://algo.itcharge.cn/Solutions/1200-1299/meeting-scheduler/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1229.%20%E5%AE%89%E6%8E%92%E4%BC%9A%E8%AE%AE%E6%97%A5%E7%A8%8B.md,46.5%,中等,123 -1230,1200-1299,1230. 抛掷硬币,抛掷硬币,https://leetcode.cn/problems/toss-strange-coins/,toss-strange-coins,数学、动态规划、概率与统计,https://algo.itcharge.cn/Solutions/1200-1299/toss-strange-coins/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1230.%20%E6%8A%9B%E6%8E%B7%E7%A1%AC%E5%B8%81.md,54.3%,中等,115 -1231,1200-1299,1231. 分享巧克力,分享巧克力,https://leetcode.cn/problems/divide-chocolate/,divide-chocolate,数组、二分查找,https://algo.itcharge.cn/Solutions/1200-1299/divide-chocolate/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1231.%20%E5%88%86%E4%BA%AB%E5%B7%A7%E5%85%8B%E5%8A%9B.md,58.9%,困难,103 -1232,1200-1299,1232. 缀点成线,缀点成线,https://leetcode.cn/problems/check-if-it-is-a-straight-line/,check-if-it-is-a-straight-line,几何、数组、数学,https://algo.itcharge.cn/Solutions/1200-1299/check-if-it-is-a-straight-line/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1232.%20%E7%BC%80%E7%82%B9%E6%88%90%E7%BA%BF.md,45.5%,简单,602 -1233,1200-1299,1233. 删除子文件夹,删除子文件夹,https://leetcode.cn/problems/remove-sub-folders-from-the-filesystem/,remove-sub-folders-from-the-filesystem,字典树、数组、字符串,https://algo.itcharge.cn/Solutions/1200-1299/remove-sub-folders-from-the-filesystem/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1233.%20%E5%88%A0%E9%99%A4%E5%AD%90%E6%96%87%E4%BB%B6%E5%A4%B9.md,61.5%,中等,451 -1234,1200-1299,1234. 替换子串得到平衡字符串,替换子串得到平衡字符串,https://leetcode.cn/problems/replace-the-substring-for-balanced-string/,replace-the-substring-for-balanced-string,字符串、滑动窗口,https://algo.itcharge.cn/Solutions/1200-1299/replace-the-substring-for-balanced-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1234.%20%E6%9B%BF%E6%8D%A2%E5%AD%90%E4%B8%B2%E5%BE%97%E5%88%B0%E5%B9%B3%E8%A1%A1%E5%AD%97%E7%AC%A6%E4%B8%B2.md,44.9%,中等,323 -1235,1200-1299,1235. 规划兼职工作,规划兼职工作,https://leetcode.cn/problems/maximum-profit-in-job-scheduling/,maximum-profit-in-job-scheduling,数组、二分查找、动态规划、排序,https://algo.itcharge.cn/Solutions/1200-1299/maximum-profit-in-job-scheduling/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1235.%20%E8%A7%84%E5%88%92%E5%85%BC%E8%81%8C%E5%B7%A5%E4%BD%9C.md,57.8%,困难,380 -1236,1200-1299,1236. 网络爬虫,网络爬虫,https://leetcode.cn/problems/web-crawler/,web-crawler,深度优先搜索、广度优先搜索、字符串、交互,https://algo.itcharge.cn/Solutions/1200-1299/web-crawler/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1236.%20%E7%BD%91%E7%BB%9C%E7%88%AC%E8%99%AB.md,57.3%,中等,42 -1237,1200-1299,1237. 找出给定方程的正整数解,找出给定方程的正整数解,https://leetcode.cn/problems/find-positive-integer-solution-for-a-given-equation/,find-positive-integer-solution-for-a-given-equation,数学、双指针、二分查找、交互,https://algo.itcharge.cn/Solutions/1200-1299/find-positive-integer-solution-for-a-given-equation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1237.%20%E6%89%BE%E5%87%BA%E7%BB%99%E5%AE%9A%E6%96%B9%E7%A8%8B%E7%9A%84%E6%AD%A3%E6%95%B4%E6%95%B0%E8%A7%A3.md,78.2%,中等,316 -1238,1200-1299,1238. 循环码排列,循环码排列,https://leetcode.cn/problems/circular-permutation-in-binary-representation/,circular-permutation-in-binary-representation,位运算、数学、回溯,https://algo.itcharge.cn/Solutions/1200-1299/circular-permutation-in-binary-representation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1238.%20%E5%BE%AA%E7%8E%AF%E7%A0%81%E6%8E%92%E5%88%97.md,77.5%,中等,226 -1239,1200-1299,1239. 串联字符串的最大长度,串联字符串的最大长度,https://leetcode.cn/problems/maximum-length-of-a-concatenated-string-with-unique-characters/,maximum-length-of-a-concatenated-string-with-unique-characters,位运算、数组、字符串、回溯,https://algo.itcharge.cn/Solutions/1200-1299/maximum-length-of-a-concatenated-string-with-unique-characters/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1239.%20%E4%B8%B2%E8%81%94%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%9C%80%E5%A4%A7%E9%95%BF%E5%BA%A6.md,49.1%,中等,451 -1240,1200-1299,1240. 铺瓷砖,铺瓷砖,https://leetcode.cn/problems/tiling-a-rectangle-with-the-fewest-squares/,tiling-a-rectangle-with-the-fewest-squares,回溯,https://algo.itcharge.cn/Solutions/1200-1299/tiling-a-rectangle-with-the-fewest-squares/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1240.%20%E9%93%BA%E7%93%B7%E7%A0%96.md,65.7%,困难,112 -1241,1200-1299,1241. 每个帖子的评论数,每个帖子的评论数,https://leetcode.cn/problems/number-of-comments-per-post/,number-of-comments-per-post,数据库,https://algo.itcharge.cn/Solutions/1200-1299/number-of-comments-per-post/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1241.%20%E6%AF%8F%E4%B8%AA%E5%B8%96%E5%AD%90%E7%9A%84%E8%AF%84%E8%AE%BA%E6%95%B0.md,59.7%,简单,94 -1242,1200-1299,1242. 多线程网页爬虫,多线程网页爬虫,https://leetcode.cn/problems/web-crawler-multithreaded/,web-crawler-multithreaded,深度优先搜索、广度优先搜索、多线程,https://algo.itcharge.cn/Solutions/1200-1299/web-crawler-multithreaded/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1242.%20%E5%A4%9A%E7%BA%BF%E7%A8%8B%E7%BD%91%E9%A1%B5%E7%88%AC%E8%99%AB.md,48.2%,中等,28 -1243,1200-1299,1243. 数组变换,数组变换,https://leetcode.cn/problems/array-transformation/,array-transformation,数组、模拟,https://algo.itcharge.cn/Solutions/1200-1299/array-transformation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1243.%20%E6%95%B0%E7%BB%84%E5%8F%98%E6%8D%A2.md,53.8%,简单,86 -1244,1200-1299,1244. 力扣排行榜,力扣排行榜,https://leetcode.cn/problems/design-a-leaderboard/,design-a-leaderboard,设计、哈希表、排序,https://algo.itcharge.cn/Solutions/1200-1299/design-a-leaderboard/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1244.%20%E5%8A%9B%E6%89%A3%E6%8E%92%E8%A1%8C%E6%A6%9C.md,63.5%,中等,69 -1245,1200-1299,1245. 树的直径,树的直径,https://leetcode.cn/problems/tree-diameter/,tree-diameter,树、深度优先搜索、广度优先搜索、图、拓扑排序,https://algo.itcharge.cn/Solutions/1200-1299/tree-diameter/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1245.%20%E6%A0%91%E7%9A%84%E7%9B%B4%E5%BE%84.md,54.4%,中等,116 -1246,1200-1299,1246. 删除回文子数组,删除回文子数组,https://leetcode.cn/problems/palindrome-removal/,palindrome-removal,数组、动态规划,https://algo.itcharge.cn/Solutions/1200-1299/palindrome-removal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1246.%20%E5%88%A0%E9%99%A4%E5%9B%9E%E6%96%87%E5%AD%90%E6%95%B0%E7%BB%84.md,50.3%,困难,61 -1247,1200-1299,1247. 交换字符使得字符串相同,交换字符使得字符串相同,https://leetcode.cn/problems/minimum-swaps-to-make-strings-equal/,minimum-swaps-to-make-strings-equal,贪心、数学、字符串,https://algo.itcharge.cn/Solutions/1200-1299/minimum-swaps-to-make-strings-equal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1247.%20%E4%BA%A4%E6%8D%A2%E5%AD%97%E7%AC%A6%E4%BD%BF%E5%BE%97%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E5%90%8C.md,69.1%,中等,441 -1248,1200-1299,1248. 统计「优美子数组」,统计「优美子数组」,https://leetcode.cn/problems/count-number-of-nice-subarrays/,count-number-of-nice-subarrays,数组、哈希表、数学、滑动窗口,https://algo.itcharge.cn/Solutions/1200-1299/count-number-of-nice-subarrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1248.%20%E7%BB%9F%E8%AE%A1%E3%80%8C%E4%BC%98%E7%BE%8E%E5%AD%90%E6%95%B0%E7%BB%84%E3%80%8D.md,57.9%,中等,637 -1249,1200-1299,1249. 移除无效的括号,移除无效的括号,https://leetcode.cn/problems/minimum-remove-to-make-valid-parentheses/,minimum-remove-to-make-valid-parentheses,栈、字符串,https://algo.itcharge.cn/Solutions/1200-1299/minimum-remove-to-make-valid-parentheses/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1249.%20%E7%A7%BB%E9%99%A4%E6%97%A0%E6%95%88%E7%9A%84%E6%8B%AC%E5%8F%B7.md,59.4%,中等,561 -1250,1200-1299,1250. 检查「好数组」,检查「好数组」,https://leetcode.cn/problems/check-if-it-is-a-good-array/,check-if-it-is-a-good-array,数组、数学、数论,https://algo.itcharge.cn/Solutions/1200-1299/check-if-it-is-a-good-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1250.%20%E6%A3%80%E6%9F%A5%E3%80%8C%E5%A5%BD%E6%95%B0%E7%BB%84%E3%80%8D.md,71.0%,困难,153 -1251,1200-1299,1251. 平均售价,平均售价,https://leetcode.cn/problems/average-selling-price/,average-selling-price,数据库,https://algo.itcharge.cn/Solutions/1200-1299/average-selling-price/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1251.%20%E5%B9%B3%E5%9D%87%E5%94%AE%E4%BB%B7.md,75.3%,简单,203 -1252,1200-1299,1252. 奇数值单元格的数目,奇数值单元格的数目,https://leetcode.cn/problems/cells-with-odd-values-in-a-matrix/,cells-with-odd-values-in-a-matrix,数组、数学、模拟,https://algo.itcharge.cn/Solutions/1200-1299/cells-with-odd-values-in-a-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1252.%20%E5%A5%87%E6%95%B0%E5%80%BC%E5%8D%95%E5%85%83%E6%A0%BC%E7%9A%84%E6%95%B0%E7%9B%AE.md,79.6%,简单,657 -1253,1200-1299,1253. 重构 2 行二进制矩阵,重构 2 行二进制矩阵,https://leetcode.cn/problems/reconstruct-a-2-row-binary-matrix/,reconstruct-a-2-row-binary-matrix,贪心、数组、矩阵,https://algo.itcharge.cn/Solutions/1200-1299/reconstruct-a-2-row-binary-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1253.%20%E9%87%8D%E6%9E%84%202%20%E8%A1%8C%E4%BA%8C%E8%BF%9B%E5%88%B6%E7%9F%A9%E9%98%B5.md,40.8%,中等,124 -1254,1200-1299,1254. 统计封闭岛屿的数目,统计封闭岛屿的数目,https://leetcode.cn/problems/number-of-closed-islands/,number-of-closed-islands,深度优先搜索、广度优先搜索、并查集、数组、矩阵,https://algo.itcharge.cn/Solutions/1200-1299/number-of-closed-islands/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1254.%20%E7%BB%9F%E8%AE%A1%E5%B0%81%E9%97%AD%E5%B2%9B%E5%B1%BF%E7%9A%84%E6%95%B0%E7%9B%AE.md,64.2%,中等,810 -1255,1200-1299,1255. 得分最高的单词集合,得分最高的单词集合,https://leetcode.cn/problems/maximum-score-words-formed-by-letters/,maximum-score-words-formed-by-letters,位运算、数组、字符串、动态规划、回溯、状态压缩,https://algo.itcharge.cn/Solutions/1200-1299/maximum-score-words-formed-by-letters/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1255.%20%E5%BE%97%E5%88%86%E6%9C%80%E9%AB%98%E7%9A%84%E5%8D%95%E8%AF%8D%E9%9B%86%E5%90%88.md,79.9%,困难,246 -1256,1200-1299,1256. 加密数字,加密数字,https://leetcode.cn/problems/encode-number/,encode-number,位运算、数学、字符串,https://algo.itcharge.cn/Solutions/1200-1299/encode-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1256.%20%E5%8A%A0%E5%AF%86%E6%95%B0%E5%AD%97.md,68.7%,中等,55 -1257,1200-1299,1257. 最小公共区域,最小公共区域,https://leetcode.cn/problems/smallest-common-region/,smallest-common-region,树、深度优先搜索、广度优先搜索、数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/1200-1299/smallest-common-region/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1257.%20%E6%9C%80%E5%B0%8F%E5%85%AC%E5%85%B1%E5%8C%BA%E5%9F%9F.md,59.1%,中等,68 -1258,1200-1299,1258. 近义词句子,近义词句子,https://leetcode.cn/problems/synonymous-sentences/,synonymous-sentences,并查集、数组、哈希表、字符串、回溯,https://algo.itcharge.cn/Solutions/1200-1299/synonymous-sentences/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1258.%20%E8%BF%91%E4%B9%89%E8%AF%8D%E5%8F%A5%E5%AD%90.md,59.2%,中等,78 -1259,1200-1299,1259. 不相交的握手,不相交的握手,https://leetcode.cn/problems/handshakes-that-dont-cross/,handshakes-that-dont-cross,数学、动态规划,https://algo.itcharge.cn/Solutions/1200-1299/handshakes-that-dont-cross/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1259.%20%E4%B8%8D%E7%9B%B8%E4%BA%A4%E7%9A%84%E6%8F%A1%E6%89%8B.md,53.2%,困难,68 -1260,1200-1299,1260. 二维网格迁移,二维网格迁移,https://leetcode.cn/problems/shift-2d-grid/,shift-2d-grid,数组、矩阵、模拟,https://algo.itcharge.cn/Solutions/1200-1299/shift-2d-grid/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1260.%20%E4%BA%8C%E7%BB%B4%E7%BD%91%E6%A0%BC%E8%BF%81%E7%A7%BB.md,65.4%,简单,667 -1261,1200-1299,1261. 在受污染的二叉树中查找元素,在受污染的二叉树中查找元素,https://leetcode.cn/problems/find-elements-in-a-contaminated-binary-tree/,find-elements-in-a-contaminated-binary-tree,树、深度优先搜索、广度优先搜索、设计、哈希表、二叉树,https://algo.itcharge.cn/Solutions/1200-1299/find-elements-in-a-contaminated-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1261.%20%E5%9C%A8%E5%8F%97%E6%B1%A1%E6%9F%93%E7%9A%84%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E6%9F%A5%E6%89%BE%E5%85%83%E7%B4%A0.md,73.5%,中等,168 -1262,1200-1299,1262. 可被三整除的最大和,可被三整除的最大和,https://leetcode.cn/problems/greatest-sum-divisible-by-three/,greatest-sum-divisible-by-three,贪心、数组、动态规划、排序,https://algo.itcharge.cn/Solutions/1200-1299/greatest-sum-divisible-by-three/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1262.%20%E5%8F%AF%E8%A2%AB%E4%B8%89%E6%95%B4%E9%99%A4%E7%9A%84%E6%9C%80%E5%A4%A7%E5%92%8C.md,56.3%,中等,416 -1263,1200-1299,1263. 推箱子,推箱子,https://leetcode.cn/problems/minimum-moves-to-move-a-box-to-their-target-location/,minimum-moves-to-move-a-box-to-their-target-location,广度优先搜索、数组、矩阵、堆（优先队列）,https://algo.itcharge.cn/Solutions/1200-1299/minimum-moves-to-move-a-box-to-their-target-location/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1263.%20%E6%8E%A8%E7%AE%B1%E5%AD%90.md,54.3%,困难,156 -1264,1200-1299,1264. 页面推荐,页面推荐,https://leetcode.cn/problems/page-recommendations/,page-recommendations,数据库,https://algo.itcharge.cn/Solutions/1200-1299/page-recommendations/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1264.%20%E9%A1%B5%E9%9D%A2%E6%8E%A8%E8%8D%90.md,57.0%,中等,163 -1265,1200-1299,1265. 逆序打印不可变链表,逆序打印不可变链表,https://leetcode.cn/problems/print-immutable-linked-list-in-reverse/,print-immutable-linked-list-in-reverse,栈、递归、链表、双指针,https://algo.itcharge.cn/Solutions/1200-1299/print-immutable-linked-list-in-reverse/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1265.%20%E9%80%86%E5%BA%8F%E6%89%93%E5%8D%B0%E4%B8%8D%E5%8F%AF%E5%8F%98%E9%93%BE%E8%A1%A8.md,90.7%,中等,101 -1266,1200-1299,1266. 访问所有点的最小时间,访问所有点的最小时间,https://leetcode.cn/problems/minimum-time-visiting-all-points/,minimum-time-visiting-all-points,几何、数组、数学,https://algo.itcharge.cn/Solutions/1200-1299/minimum-time-visiting-all-points/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1266.%20%E8%AE%BF%E9%97%AE%E6%89%80%E6%9C%89%E7%82%B9%E7%9A%84%E6%9C%80%E5%B0%8F%E6%97%B6%E9%97%B4.md,82.8%,简单,533 -1267,1200-1299,1267. 统计参与通信的服务器,统计参与通信的服务器,https://leetcode.cn/problems/count-servers-that-communicate/,count-servers-that-communicate,深度优先搜索、广度优先搜索、并查集、数组、计数、矩阵,https://algo.itcharge.cn/Solutions/1200-1299/count-servers-that-communicate/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1267.%20%E7%BB%9F%E8%AE%A1%E5%8F%82%E4%B8%8E%E9%80%9A%E4%BF%A1%E7%9A%84%E6%9C%8D%E5%8A%A1%E5%99%A8.md,61.9%,中等,206 -1268,1200-1299,1268. 搜索推荐系统,搜索推荐系统,https://leetcode.cn/problems/search-suggestions-system/,search-suggestions-system,字典树、数组、字符串,https://algo.itcharge.cn/Solutions/1200-1299/search-suggestions-system/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1268.%20%E6%90%9C%E7%B4%A2%E6%8E%A8%E8%8D%90%E7%B3%BB%E7%BB%9F.md,59.5%,中等,244 -1269,1200-1299,1269. 停在原地的方案数,停在原地的方案数,https://leetcode.cn/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps/,number-of-ways-to-stay-in-the-same-place-after-some-steps,动态规划,https://algo.itcharge.cn/Solutions/1200-1299/number-of-ways-to-stay-in-the-same-place-after-some-steps/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1269.%20%E5%81%9C%E5%9C%A8%E5%8E%9F%E5%9C%B0%E7%9A%84%E6%96%B9%E6%A1%88%E6%95%B0.md,49.0%,困难,350 -1270,1200-1299,1270. 向公司CEO汇报工作的所有人,向公司CEO汇报工作的所有人,https://leetcode.cn/problems/all-people-report-to-the-given-manager/,all-people-report-to-the-given-manager,数据库,https://algo.itcharge.cn/Solutions/1200-1299/all-people-report-to-the-given-manager/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1270.%20%E5%90%91%E5%85%AC%E5%8F%B8CEO%E6%B1%87%E6%8A%A5%E5%B7%A5%E4%BD%9C%E7%9A%84%E6%89%80%E6%9C%89%E4%BA%BA.md,79.7%,中等,135 -1271,1200-1299,1271. 十六进制魔术数字,十六进制魔术数字,https://leetcode.cn/problems/hexspeak/,hexspeak,数学、字符串,https://algo.itcharge.cn/Solutions/1200-1299/hexspeak/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1271.%20%E5%8D%81%E5%85%AD%E8%BF%9B%E5%88%B6%E9%AD%94%E6%9C%AF%E6%95%B0%E5%AD%97.md,52.4%,简单,67 -1272,1200-1299,1272. 删除区间,删除区间,https://leetcode.cn/problems/remove-interval/,remove-interval,数组,https://algo.itcharge.cn/Solutions/1200-1299/remove-interval/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1272.%20%E5%88%A0%E9%99%A4%E5%8C%BA%E9%97%B4.md,56.8%,中等,51 -1273,1200-1299,1273. 删除树节点,删除树节点,https://leetcode.cn/problems/delete-tree-nodes/,delete-tree-nodes,树、深度优先搜索、广度优先搜索,https://algo.itcharge.cn/Solutions/1200-1299/delete-tree-nodes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1273.%20%E5%88%A0%E9%99%A4%E6%A0%91%E8%8A%82%E7%82%B9.md,57.1%,中等,70 -1274,1200-1299,1274. 矩形内船只的数目,矩形内船只的数目,https://leetcode.cn/problems/number-of-ships-in-a-rectangle/,number-of-ships-in-a-rectangle,数组、分治、交互,https://algo.itcharge.cn/Solutions/1200-1299/number-of-ships-in-a-rectangle/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1274.%20%E7%9F%A9%E5%BD%A2%E5%86%85%E8%88%B9%E5%8F%AA%E7%9A%84%E6%95%B0%E7%9B%AE.md,64.9%,困难,36 -1275,1200-1299,1275. 找出井字棋的获胜者,找出井字棋的获胜者,https://leetcode.cn/problems/find-winner-on-a-tic-tac-toe-game/,find-winner-on-a-tic-tac-toe-game,数组、哈希表、矩阵、模拟,https://algo.itcharge.cn/Solutions/1200-1299/find-winner-on-a-tic-tac-toe-game/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1275.%20%E6%89%BE%E5%87%BA%E4%BA%95%E5%AD%97%E6%A3%8B%E7%9A%84%E8%8E%B7%E8%83%9C%E8%80%85.md,55.1%,简单,241 -1276,1200-1299,1276. 不浪费原料的汉堡制作方案,不浪费原料的汉堡制作方案,https://leetcode.cn/problems/number-of-burgers-with-no-waste-of-ingredients/,number-of-burgers-with-no-waste-of-ingredients,数学,https://algo.itcharge.cn/Solutions/1200-1299/number-of-burgers-with-no-waste-of-ingredients/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1276.%20%E4%B8%8D%E6%B5%AA%E8%B4%B9%E5%8E%9F%E6%96%99%E7%9A%84%E6%B1%89%E5%A0%A1%E5%88%B6%E4%BD%9C%E6%96%B9%E6%A1%88.md,50.3%,中等,132 -1277,1200-1299,1277. 统计全为 1 的正方形子矩阵,统计全为 1 的正方形子矩阵,https://leetcode.cn/problems/count-square-submatrices-with-all-ones/,count-square-submatrices-with-all-ones,数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/1200-1299/count-square-submatrices-with-all-ones/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1277.%20%E7%BB%9F%E8%AE%A1%E5%85%A8%E4%B8%BA%201%20%E7%9A%84%E6%AD%A3%E6%96%B9%E5%BD%A2%E5%AD%90%E7%9F%A9%E9%98%B5.md,73.5%,中等,345 -1278,1200-1299,1278. 分割回文串 III,分割回文串 III,https://leetcode.cn/problems/palindrome-partitioning-iii/,palindrome-partitioning-iii,字符串、动态规划,https://algo.itcharge.cn/Solutions/1200-1299/palindrome-partitioning-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1278.%20%E5%88%86%E5%89%B2%E5%9B%9E%E6%96%87%E4%B8%B2%20III.md,62.2%,困难,97 -1279,1200-1299,1279. 红绿灯路口,红绿灯路口,https://leetcode.cn/problems/traffic-light-controlled-intersection/,traffic-light-controlled-intersection,多线程,https://algo.itcharge.cn/Solutions/1200-1299/traffic-light-controlled-intersection/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1279.%20%E7%BA%A2%E7%BB%BF%E7%81%AF%E8%B7%AF%E5%8F%A3.md,57.6%,简单,28 -1280,1200-1299,1280. 学生们参加各科测试的次数,学生们参加各科测试的次数,https://leetcode.cn/problems/students-and-examinations/,students-and-examinations,数据库,https://algo.itcharge.cn/Solutions/1200-1299/students-and-examinations/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1280.%20%E5%AD%A6%E7%94%9F%E4%BB%AC%E5%8F%82%E5%8A%A0%E5%90%84%E7%A7%91%E6%B5%8B%E8%AF%95%E7%9A%84%E6%AC%A1%E6%95%B0.md,49.6%,简单,157 -1281,1200-1299,1281. 整数的各位积和之差,整数的各位积和之差,https://leetcode.cn/problems/subtract-the-product-and-sum-of-digits-of-an-integer/,subtract-the-product-and-sum-of-digits-of-an-integer,数学,https://algo.itcharge.cn/Solutions/1200-1299/subtract-the-product-and-sum-of-digits-of-an-integer/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1281.%20%E6%95%B4%E6%95%B0%E7%9A%84%E5%90%84%E4%BD%8D%E7%A7%AF%E5%92%8C%E4%B9%8B%E5%B7%AE.md,83.2%,简单,929 -1282,1200-1299,1282. 用户分组,用户分组,https://leetcode.cn/problems/group-the-people-given-the-group-size-they-belong-to/,group-the-people-given-the-group-size-they-belong-to,数组、哈希表,https://algo.itcharge.cn/Solutions/1200-1299/group-the-people-given-the-group-size-they-belong-to/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1282.%20%E7%94%A8%E6%88%B7%E5%88%86%E7%BB%84.md,86.5%,中等,803 -1283,1200-1299,1283. 使结果不超过阈值的最小除数,使结果不超过阈值的最小除数,https://leetcode.cn/problems/find-the-smallest-divisor-given-a-threshold/,find-the-smallest-divisor-given-a-threshold,数组、二分查找,https://algo.itcharge.cn/Solutions/1200-1299/find-the-smallest-divisor-given-a-threshold/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1283.%20%E4%BD%BF%E7%BB%93%E6%9E%9C%E4%B8%8D%E8%B6%85%E8%BF%87%E9%98%88%E5%80%BC%E7%9A%84%E6%9C%80%E5%B0%8F%E9%99%A4%E6%95%B0.md,49.1%,中等,190 -1284,1200-1299,1284. 转化为全零矩阵的最少反转次数,转化为全零矩阵的最少反转次数,https://leetcode.cn/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/,minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix,位运算、广度优先搜索、数组、矩阵,https://algo.itcharge.cn/Solutions/1200-1299/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1284.%20%E8%BD%AC%E5%8C%96%E4%B8%BA%E5%85%A8%E9%9B%B6%E7%9F%A9%E9%98%B5%E7%9A%84%E6%9C%80%E5%B0%91%E5%8F%8D%E8%BD%AC%E6%AC%A1%E6%95%B0.md,68.2%,困难,98 -1285,1200-1299,1285. 找到连续区间的开始和结束数字,找到连续区间的开始和结束数字,https://leetcode.cn/problems/find-the-start-and-end-number-of-continuous-ranges/,find-the-start-and-end-number-of-continuous-ranges,数据库,https://algo.itcharge.cn/Solutions/1200-1299/find-the-start-and-end-number-of-continuous-ranges/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1285.%20%E6%89%BE%E5%88%B0%E8%BF%9E%E7%BB%AD%E5%8C%BA%E9%97%B4%E7%9A%84%E5%BC%80%E5%A7%8B%E5%92%8C%E7%BB%93%E6%9D%9F%E6%95%B0%E5%AD%97.md,80.9%,中等,113 -1286,1200-1299,1286. 字母组合迭代器,字母组合迭代器,https://leetcode.cn/problems/iterator-for-combination/,iterator-for-combination,设计、字符串、回溯、迭代器,https://algo.itcharge.cn/Solutions/1200-1299/iterator-for-combination/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1286.%20%E5%AD%97%E6%AF%8D%E7%BB%84%E5%90%88%E8%BF%AD%E4%BB%A3%E5%99%A8.md,65.1%,中等,144 -1287,1200-1299,1287. 有序数组中出现次数超过25%的元素,有序数组中出现次数超过25%的元素,https://leetcode.cn/problems/element-appearing-more-than-25-in-sorted-array/,element-appearing-more-than-25-in-sorted-array,数组,https://algo.itcharge.cn/Solutions/1200-1299/element-appearing-more-than-25-in-sorted-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1287.%20%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E5%87%BA%E7%8E%B0%E6%AC%A1%E6%95%B0%E8%B6%85%E8%BF%8725%25%E7%9A%84%E5%85%83%E7%B4%A0.md,58.8%,简单,344 -1288,1200-1299,1288. 删除被覆盖区间,删除被覆盖区间,https://leetcode.cn/problems/remove-covered-intervals/,remove-covered-intervals,数组、排序,https://algo.itcharge.cn/Solutions/1200-1299/remove-covered-intervals/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1288.%20%E5%88%A0%E9%99%A4%E8%A2%AB%E8%A6%86%E7%9B%96%E5%8C%BA%E9%97%B4.md,56.0%,中等,291 -1289,1200-1299,1289. 下降路径最小和 II,下降路径最小和 II,https://leetcode.cn/problems/minimum-falling-path-sum-ii/,minimum-falling-path-sum-ii,数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/1200-1299/minimum-falling-path-sum-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1289.%20%E4%B8%8B%E9%99%8D%E8%B7%AF%E5%BE%84%E6%9C%80%E5%B0%8F%E5%92%8C%20%20II.md,58.4%,困难,181 -1290,1200-1299,1290. 二进制链表转整数,二进制链表转整数,https://leetcode.cn/problems/convert-binary-number-in-a-linked-list-to-integer/,convert-binary-number-in-a-linked-list-to-integer,链表、数学,https://algo.itcharge.cn/Solutions/1200-1299/convert-binary-number-in-a-linked-list-to-integer/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1290.%20%E4%BA%8C%E8%BF%9B%E5%88%B6%E9%93%BE%E8%A1%A8%E8%BD%AC%E6%95%B4%E6%95%B0.md,80.5%,简单,986 -1291,1200-1299,1291. 顺次数,顺次数,https://leetcode.cn/problems/sequential-digits/,sequential-digits,枚举,https://algo.itcharge.cn/Solutions/1200-1299/sequential-digits/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1291.%20%E9%A1%BA%E6%AC%A1%E6%95%B0.md,53.5%,中等,219 -1292,1200-1299,1292. 元素和小于等于阈值的正方形的最大边长,元素和小于等于阈值的正方形的最大边长,https://leetcode.cn/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold/,maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold,数组、二分查找、矩阵、前缀和,https://algo.itcharge.cn/Solutions/1200-1299/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1292.%20%E5%85%83%E7%B4%A0%E5%92%8C%E5%B0%8F%E4%BA%8E%E7%AD%89%E4%BA%8E%E9%98%88%E5%80%BC%E7%9A%84%E6%AD%A3%E6%96%B9%E5%BD%A2%E7%9A%84%E6%9C%80%E5%A4%A7%E8%BE%B9%E9%95%BF.md,50.7%,中等,161 -1293,1200-1299,1293. 网格中的最短路径,网格中的最短路径,https://leetcode.cn/problems/shortest-path-in-a-grid-with-obstacles-elimination/,shortest-path-in-a-grid-with-obstacles-elimination,广度优先搜索、数组、矩阵,https://algo.itcharge.cn/Solutions/1200-1299/shortest-path-in-a-grid-with-obstacles-elimination/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1293.%20%E7%BD%91%E6%A0%BC%E4%B8%AD%E7%9A%84%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84.md,38.3%,困难,198 -1294,1200-1299,1294. 不同国家的天气类型,不同国家的天气类型,https://leetcode.cn/problems/weather-type-in-each-country/,weather-type-in-each-country,数据库,https://algo.itcharge.cn/Solutions/1200-1299/weather-type-in-each-country/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1294.%20%E4%B8%8D%E5%90%8C%E5%9B%BD%E5%AE%B6%E7%9A%84%E5%A4%A9%E6%B0%94%E7%B1%BB%E5%9E%8B.md,65.5%,简单,132 -1295,1200-1299,1295. 统计位数为偶数的数字,统计位数为偶数的数字,https://leetcode.cn/problems/find-numbers-with-even-number-of-digits/,find-numbers-with-even-number-of-digits,数组,https://algo.itcharge.cn/Solutions/1200-1299/find-numbers-with-even-number-of-digits/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1295.%20%E7%BB%9F%E8%AE%A1%E4%BD%8D%E6%95%B0%E4%B8%BA%E5%81%B6%E6%95%B0%E7%9A%84%E6%95%B0%E5%AD%97.md,80.1%,简单,770 -1296,1200-1299,1296. 划分数组为连续数字的集合,划分数组为连续数字的集合,https://leetcode.cn/problems/divide-array-in-sets-of-k-consecutive-numbers/,divide-array-in-sets-of-k-consecutive-numbers,贪心、数组、哈希表、排序,https://algo.itcharge.cn/Solutions/1200-1299/divide-array-in-sets-of-k-consecutive-numbers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1296.%20%E5%88%92%E5%88%86%E6%95%B0%E7%BB%84%E4%B8%BA%E8%BF%9E%E7%BB%AD%E6%95%B0%E5%AD%97%E7%9A%84%E9%9B%86%E5%90%88.md,49.1%,中等,169 -1297,1200-1299,1297. 子串的最大出现次数,子串的最大出现次数,https://leetcode.cn/problems/maximum-number-of-occurrences-of-a-substring/,maximum-number-of-occurrences-of-a-substring,哈希表、字符串、滑动窗口,https://algo.itcharge.cn/Solutions/1200-1299/maximum-number-of-occurrences-of-a-substring/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1297.%20%E5%AD%90%E4%B8%B2%E7%9A%84%E6%9C%80%E5%A4%A7%E5%87%BA%E7%8E%B0%E6%AC%A1%E6%95%B0.md,48.3%,中等,127 -1298,1200-1299,1298. 你能从盒子里获得的最大糖果数,你能从盒子里获得的最大糖果数,https://leetcode.cn/problems/maximum-candies-you-can-get-from-boxes/,maximum-candies-you-can-get-from-boxes,广度优先搜索、图、数组,https://algo.itcharge.cn/Solutions/1200-1299/maximum-candies-you-can-get-from-boxes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1298.%20%E4%BD%A0%E8%83%BD%E4%BB%8E%E7%9B%92%E5%AD%90%E9%87%8C%E8%8E%B7%E5%BE%97%E7%9A%84%E6%9C%80%E5%A4%A7%E7%B3%96%E6%9E%9C%E6%95%B0.md,59.9%,困难,119 -1299,1200-1299,1299. 将每个元素替换为右侧最大元素,将每个元素替换为右侧最大元素,https://leetcode.cn/problems/replace-elements-with-greatest-element-on-right-side/,replace-elements-with-greatest-element-on-right-side,数组,https://algo.itcharge.cn/Solutions/1200-1299/replace-elements-with-greatest-element-on-right-side/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1299.%20%E5%B0%86%E6%AF%8F%E4%B8%AA%E5%85%83%E7%B4%A0%E6%9B%BF%E6%8D%A2%E4%B8%BA%E5%8F%B3%E4%BE%A7%E6%9C%80%E5%A4%A7%E5%85%83%E7%B4%A0.md,77.0%,简单,562 -1300,1300-1399,1300. 转变数组后最接近目标值的数组和,转变数组后最接近目标值的数组和,https://leetcode.cn/problems/sum-of-mutated-array-closest-to-target/,sum-of-mutated-array-closest-to-target,数组、二分查找、排序,https://algo.itcharge.cn/Solutions/1300-1399/sum-of-mutated-array-closest-to-target/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1300.%20%E8%BD%AC%E5%8F%98%E6%95%B0%E7%BB%84%E5%90%8E%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9B%AE%E6%A0%87%E5%80%BC%E7%9A%84%E6%95%B0%E7%BB%84%E5%92%8C.md,46.8%,中等,452 -1301,1300-1399,1301. 最大得分的路径数目,最大得分的路径数目,https://leetcode.cn/problems/number-of-paths-with-max-score/,number-of-paths-with-max-score,数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/1300-1399/number-of-paths-with-max-score/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1301.%20%E6%9C%80%E5%A4%A7%E5%BE%97%E5%88%86%E7%9A%84%E8%B7%AF%E5%BE%84%E6%95%B0%E7%9B%AE.md,37.7%,困难,148 -1302,1300-1399,1302. 层数最深叶子节点的和,层数最深叶子节点的和,https://leetcode.cn/problems/deepest-leaves-sum/,deepest-leaves-sum,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/1300-1399/deepest-leaves-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1302.%20%E5%B1%82%E6%95%B0%E6%9C%80%E6%B7%B1%E5%8F%B6%E5%AD%90%E8%8A%82%E7%82%B9%E7%9A%84%E5%92%8C.md,85.5%,中等,774 -1303,1300-1399,1303. 求团队人数,求团队人数,https://leetcode.cn/problems/find-the-team-size/,find-the-team-size,数据库,https://algo.itcharge.cn/Solutions/1300-1399/find-the-team-size/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1303.%20%E6%B1%82%E5%9B%A2%E9%98%9F%E4%BA%BA%E6%95%B0.md,82.5%,简单,167 -1304,1300-1399,1304. 和为零的 N 个不同整数,和为零的 N 个不同整数,https://leetcode.cn/problems/find-n-unique-integers-sum-up-to-zero/,find-n-unique-integers-sum-up-to-zero,数组、数学,https://algo.itcharge.cn/Solutions/1300-1399/find-n-unique-integers-sum-up-to-zero/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1304.%20%E5%92%8C%E4%B8%BA%E9%9B%B6%E7%9A%84%20N%20%E4%B8%AA%E4%B8%8D%E5%90%8C%E6%95%B4%E6%95%B0.md,70.3%,简单,488 -1305,1300-1399,1305. 两棵二叉搜索树中的所有元素,两棵二叉搜索树中的所有元素,https://leetcode.cn/problems/all-elements-in-two-binary-search-trees/,all-elements-in-two-binary-search-trees,树、深度优先搜索、二叉搜索树、二叉树、排序,https://algo.itcharge.cn/Solutions/1300-1399/all-elements-in-two-binary-search-trees/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1305.%20%E4%B8%A4%E6%A3%B5%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E6%89%80%E6%9C%89%E5%85%83%E7%B4%A0.md,78.0%,中等,693 -1306,1300-1399,1306. 跳跃游戏 III,跳跃游戏 III,https://leetcode.cn/problems/jump-game-iii/,jump-game-iii,深度优先搜索、广度优先搜索、数组,https://algo.itcharge.cn/Solutions/1300-1399/jump-game-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1306.%20%E8%B7%B3%E8%B7%83%E6%B8%B8%E6%88%8F%20III.md,58.2%,中等,450 -1307,1300-1399,1307. 口算难题,口算难题,https://leetcode.cn/problems/verbal-arithmetic-puzzle/,verbal-arithmetic-puzzle,数组、数学、字符串、回溯,https://algo.itcharge.cn/Solutions/1300-1399/verbal-arithmetic-puzzle/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1307.%20%E5%8F%A3%E7%AE%97%E9%9A%BE%E9%A2%98.md,34.7%,困难,73 -1308,1300-1399,1308. 不同性别每日分数总计,不同性别每日分数总计,https://leetcode.cn/problems/running-total-for-different-genders/,running-total-for-different-genders,数据库,https://algo.itcharge.cn/Solutions/1300-1399/running-total-for-different-genders/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1308.%20%E4%B8%8D%E5%90%8C%E6%80%A7%E5%88%AB%E6%AF%8F%E6%97%A5%E5%88%86%E6%95%B0%E6%80%BB%E8%AE%A1.md,73.6%,中等,102 -1309,1300-1399,1309. 解码字母到整数映射,解码字母到整数映射,https://leetcode.cn/problems/decrypt-string-from-alphabet-to-integer-mapping/,decrypt-string-from-alphabet-to-integer-mapping,字符串,https://algo.itcharge.cn/Solutions/1300-1399/decrypt-string-from-alphabet-to-integer-mapping/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1309.%20%E8%A7%A3%E7%A0%81%E5%AD%97%E6%AF%8D%E5%88%B0%E6%95%B4%E6%95%B0%E6%98%A0%E5%B0%84.md,76.8%,简单,485 -1310,1300-1399,1310. 子数组异或查询,子数组异或查询,https://leetcode.cn/problems/xor-queries-of-a-subarray/,xor-queries-of-a-subarray,位运算、数组、前缀和,https://algo.itcharge.cn/Solutions/1300-1399/xor-queries-of-a-subarray/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1310.%20%E5%AD%90%E6%95%B0%E7%BB%84%E5%BC%82%E6%88%96%E6%9F%A5%E8%AF%A2.md,72.0%,中等,558 -1311,1300-1399,1311. 获取你好友已观看的视频,获取你好友已观看的视频,https://leetcode.cn/problems/get-watched-videos-by-your-friends/,get-watched-videos-by-your-friends,广度优先搜索、图、数组、哈希表、排序,https://algo.itcharge.cn/Solutions/1300-1399/get-watched-videos-by-your-friends/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1311.%20%E8%8E%B7%E5%8F%96%E4%BD%A0%E5%A5%BD%E5%8F%8B%E5%B7%B2%E8%A7%82%E7%9C%8B%E7%9A%84%E8%A7%86%E9%A2%91.md,40.0%,中等,118 -1312,1300-1399,1312. 让字符串成为回文串的最少插入次数,让字符串成为回文串的最少插入次数,https://leetcode.cn/problems/minimum-insertion-steps-to-make-a-string-palindrome/,minimum-insertion-steps-to-make-a-string-palindrome,字符串、动态规划,https://algo.itcharge.cn/Solutions/1300-1399/minimum-insertion-steps-to-make-a-string-palindrome/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1312.%20%E8%AE%A9%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%88%90%E4%B8%BA%E5%9B%9E%E6%96%87%E4%B8%B2%E7%9A%84%E6%9C%80%E5%B0%91%E6%8F%92%E5%85%A5%E6%AC%A1%E6%95%B0.md,69.1%,困难,254 -1313,1300-1399,1313. 解压缩编码列表,解压缩编码列表,https://leetcode.cn/problems/decompress-run-length-encoded-list/,decompress-run-length-encoded-list,数组,https://algo.itcharge.cn/Solutions/1300-1399/decompress-run-length-encoded-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1313.%20%E8%A7%A3%E5%8E%8B%E7%BC%A9%E7%BC%96%E7%A0%81%E5%88%97%E8%A1%A8.md,83.2%,简单,647 -1314,1300-1399,1314. 矩阵区域和,矩阵区域和,https://leetcode.cn/problems/matrix-block-sum/,matrix-block-sum,数组、矩阵、前缀和,https://algo.itcharge.cn/Solutions/1300-1399/matrix-block-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1314.%20%E7%9F%A9%E9%98%B5%E5%8C%BA%E5%9F%9F%E5%92%8C.md,75.5%,中等,375 -1315,1300-1399,1315. 祖父节点值为偶数的节点和,祖父节点值为偶数的节点和,https://leetcode.cn/problems/sum-of-nodes-with-even-valued-grandparent/,sum-of-nodes-with-even-valued-grandparent,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/1300-1399/sum-of-nodes-with-even-valued-grandparent/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1315.%20%E7%A5%96%E7%88%B6%E8%8A%82%E7%82%B9%E5%80%BC%E4%B8%BA%E5%81%B6%E6%95%B0%E7%9A%84%E8%8A%82%E7%82%B9%E5%92%8C.md,81.6%,中等,377 -1316,1300-1399,1316. 不同的循环子字符串,不同的循环子字符串,https://leetcode.cn/problems/distinct-echo-substrings/,distinct-echo-substrings,字典树、字符串、哈希函数、滚动哈希,https://algo.itcharge.cn/Solutions/1300-1399/distinct-echo-substrings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1316.%20%E4%B8%8D%E5%90%8C%E7%9A%84%E5%BE%AA%E7%8E%AF%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md,48.3%,困难,88 -1317,1300-1399,1317. 将整数转换为两个无零整数的和,将整数转换为两个无零整数的和,https://leetcode.cn/problems/convert-integer-to-the-sum-of-two-no-zero-integers/,convert-integer-to-the-sum-of-two-no-zero-integers,数学,https://algo.itcharge.cn/Solutions/1300-1399/convert-integer-to-the-sum-of-two-no-zero-integers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1317.%20%E5%B0%86%E6%95%B4%E6%95%B0%E8%BD%AC%E6%8D%A2%E4%B8%BA%E4%B8%A4%E4%B8%AA%E6%97%A0%E9%9B%B6%E6%95%B4%E6%95%B0%E7%9A%84%E5%92%8C.md,61.9%,简单,258 -1318,1300-1399,1318. 或运算的最小翻转次数,或运算的最小翻转次数,https://leetcode.cn/problems/minimum-flips-to-make-a-or-b-equal-to-c/,minimum-flips-to-make-a-or-b-equal-to-c,位运算,https://algo.itcharge.cn/Solutions/1300-1399/minimum-flips-to-make-a-or-b-equal-to-c/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1318.%20%E6%88%96%E8%BF%90%E7%AE%97%E7%9A%84%E6%9C%80%E5%B0%8F%E7%BF%BB%E8%BD%AC%E6%AC%A1%E6%95%B0.md,66.8%,中等,177 -1319,1300-1399,1319. 连通网络的操作次数,连通网络的操作次数,https://leetcode.cn/problems/number-of-operations-to-make-network-connected/,number-of-operations-to-make-network-connected,深度优先搜索、广度优先搜索、并查集、图,https://algo.itcharge.cn/Solutions/1300-1399/number-of-operations-to-make-network-connected/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1319.%20%E8%BF%9E%E9%80%9A%E7%BD%91%E7%BB%9C%E7%9A%84%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0.md,62.4%,中等,687 -1320,1300-1399,1320. 二指输入的的最小距离,二指输入的的最小距离,https://leetcode.cn/problems/minimum-distance-to-type-a-word-using-two-fingers/,minimum-distance-to-type-a-word-using-two-fingers,字符串、动态规划,https://algo.itcharge.cn/Solutions/1300-1399/minimum-distance-to-type-a-word-using-two-fingers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1320.%20%E4%BA%8C%E6%8C%87%E8%BE%93%E5%85%A5%E7%9A%84%E7%9A%84%E6%9C%80%E5%B0%8F%E8%B7%9D%E7%A6%BB.md,60.6%,困难,79 -1321,1300-1399,1321. 餐馆营业额变化增长,餐馆营业额变化增长,https://leetcode.cn/problems/restaurant-growth/,restaurant-growth,数据库,https://algo.itcharge.cn/Solutions/1300-1399/restaurant-growth/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1321.%20%E9%A4%90%E9%A6%86%E8%90%A5%E4%B8%9A%E9%A2%9D%E5%8F%98%E5%8C%96%E5%A2%9E%E9%95%BF.md,61.9%,中等,172 -1322,1300-1399,1322. 广告效果,广告效果,https://leetcode.cn/problems/ads-performance/,ads-performance,数据库,https://algo.itcharge.cn/Solutions/1300-1399/ads-performance/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1322.%20%E5%B9%BF%E5%91%8A%E6%95%88%E6%9E%9C.md,59.6%,简单,86 -1323,1300-1399,1323. 6 和 9 组成的最大数字,6 和 9 组成的最大数字,https://leetcode.cn/problems/maximum-69-number/,maximum-69-number,贪心、数学,https://algo.itcharge.cn/Solutions/1300-1399/maximum-69-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1323.%206%20%E5%92%8C%209%20%E7%BB%84%E6%88%90%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E5%AD%97.md,75.0%,简单,639 -1324,1300-1399,1324. 竖直打印单词,竖直打印单词,https://leetcode.cn/problems/print-words-vertically/,print-words-vertically,数组、字符串、模拟,https://algo.itcharge.cn/Solutions/1300-1399/print-words-vertically/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1324.%20%E7%AB%96%E7%9B%B4%E6%89%93%E5%8D%B0%E5%8D%95%E8%AF%8D.md,59.2%,中等,179 -1325,1300-1399,1325. 删除给定值的叶子节点,删除给定值的叶子节点,https://leetcode.cn/problems/delete-leaves-with-a-given-value/,delete-leaves-with-a-given-value,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/1300-1399/delete-leaves-with-a-given-value/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1325.%20%E5%88%A0%E9%99%A4%E7%BB%99%E5%AE%9A%E5%80%BC%E7%9A%84%E5%8F%B6%E5%AD%90%E8%8A%82%E7%82%B9.md,73.3%,中等,265 -1326,1300-1399,1326. 灌溉花园的最少水龙头数目,灌溉花园的最少水龙头数目,https://leetcode.cn/problems/minimum-number-of-taps-to-open-to-water-a-garden/,minimum-number-of-taps-to-open-to-water-a-garden,贪心、数组、动态规划,https://algo.itcharge.cn/Solutions/1300-1399/minimum-number-of-taps-to-open-to-water-a-garden/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1326.%20%E7%81%8C%E6%BA%89%E8%8A%B1%E5%9B%AD%E7%9A%84%E6%9C%80%E5%B0%91%E6%B0%B4%E9%BE%99%E5%A4%B4%E6%95%B0%E7%9B%AE.md,54.2%,困难,262 -1327,1300-1399,1327. 列出指定时间段内所有的下单产品,列出指定时间段内所有的下单产品,https://leetcode.cn/problems/list-the-products-ordered-in-a-period/,list-the-products-ordered-in-a-period,数据库,https://algo.itcharge.cn/Solutions/1300-1399/list-the-products-ordered-in-a-period/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1327.%20%E5%88%97%E5%87%BA%E6%8C%87%E5%AE%9A%E6%97%B6%E9%97%B4%E6%AE%B5%E5%86%85%E6%89%80%E6%9C%89%E7%9A%84%E4%B8%8B%E5%8D%95%E4%BA%A7%E5%93%81.md,69.5%,简单,92 -1328,1300-1399,1328. 破坏回文串,破坏回文串,https://leetcode.cn/problems/break-a-palindrome/,break-a-palindrome,贪心、字符串,https://algo.itcharge.cn/Solutions/1300-1399/break-a-palindrome/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1328.%20%E7%A0%B4%E5%9D%8F%E5%9B%9E%E6%96%87%E4%B8%B2.md,47.0%,中等,170 -1329,1300-1399,1329. 将矩阵按对角线排序,将矩阵按对角线排序,https://leetcode.cn/problems/sort-the-matrix-diagonally/,sort-the-matrix-diagonally,数组、矩阵、排序,https://algo.itcharge.cn/Solutions/1300-1399/sort-the-matrix-diagonally/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1329.%20%E5%B0%86%E7%9F%A9%E9%98%B5%E6%8C%89%E5%AF%B9%E8%A7%92%E7%BA%BF%E6%8E%92%E5%BA%8F.md,77.8%,中等,240 -1330,1300-1399,1330. 翻转子数组得到最大的数组值,翻转子数组得到最大的数组值,https://leetcode.cn/problems/reverse-subarray-to-maximize-array-value/,reverse-subarray-to-maximize-array-value,贪心、数组、数学,https://algo.itcharge.cn/Solutions/1300-1399/reverse-subarray-to-maximize-array-value/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1330.%20%E7%BF%BB%E8%BD%AC%E5%AD%90%E6%95%B0%E7%BB%84%E5%BE%97%E5%88%B0%E6%9C%80%E5%A4%A7%E7%9A%84%E6%95%B0%E7%BB%84%E5%80%BC.md,57.7%,困难,81 -1331,1300-1399,1331. 数组序号转换,数组序号转换,https://leetcode.cn/problems/rank-transform-of-an-array/,rank-transform-of-an-array,数组、哈希表、排序,https://algo.itcharge.cn/Solutions/1300-1399/rank-transform-of-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1331.%20%E6%95%B0%E7%BB%84%E5%BA%8F%E5%8F%B7%E8%BD%AC%E6%8D%A2.md,60.4%,简单,529 -1332,1300-1399,1332. 删除回文子序列,删除回文子序列,https://leetcode.cn/problems/remove-palindromic-subsequences/,remove-palindromic-subsequences,双指针、字符串,https://algo.itcharge.cn/Solutions/1300-1399/remove-palindromic-subsequences/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1332.%20%E5%88%A0%E9%99%A4%E5%9B%9E%E6%96%87%E5%AD%90%E5%BA%8F%E5%88%97.md,77.7%,简单,379 -1333,1300-1399,1333. 餐厅过滤器,餐厅过滤器,https://leetcode.cn/problems/filter-restaurants-by-vegan-friendly-price-and-distance/,filter-restaurants-by-vegan-friendly-price-and-distance,数组、排序,https://algo.itcharge.cn/Solutions/1300-1399/filter-restaurants-by-vegan-friendly-price-and-distance/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1333.%20%E9%A4%90%E5%8E%85%E8%BF%87%E6%BB%A4%E5%99%A8.md,56.7%,中等,166 -1334,1300-1399,1334. 阈值距离内邻居最少的城市,阈值距离内邻居最少的城市,https://leetcode.cn/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/,find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance,图、动态规划、最短路,https://algo.itcharge.cn/Solutions/1300-1399/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1334.%20%E9%98%88%E5%80%BC%E8%B7%9D%E7%A6%BB%E5%86%85%E9%82%BB%E5%B1%85%E6%9C%80%E5%B0%91%E7%9A%84%E5%9F%8E%E5%B8%82.md,52.7%,中等,168 -1335,1300-1399,1335. 工作计划的最低难度,工作计划的最低难度,https://leetcode.cn/problems/minimum-difficulty-of-a-job-schedule/,minimum-difficulty-of-a-job-schedule,数组、动态规划,https://algo.itcharge.cn/Solutions/1300-1399/minimum-difficulty-of-a-job-schedule/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1335.%20%E5%B7%A5%E4%BD%9C%E8%AE%A1%E5%88%92%E7%9A%84%E6%9C%80%E4%BD%8E%E9%9A%BE%E5%BA%A6.md,66.7%,困难,175 -1336,1300-1399,1336. 每次访问的交易次数,每次访问的交易次数,https://leetcode.cn/problems/number-of-transactions-per-visit/,number-of-transactions-per-visit,数据库,https://algo.itcharge.cn/Solutions/1300-1399/number-of-transactions-per-visit/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1336.%20%E6%AF%8F%E6%AC%A1%E8%AE%BF%E9%97%AE%E7%9A%84%E4%BA%A4%E6%98%93%E6%AC%A1%E6%95%B0.md,45.5%,困难,81 -1337,1300-1399,1337. 矩阵中战斗力最弱的 K 行,矩阵中战斗力最弱的 K 行,https://leetcode.cn/problems/the-k-weakest-rows-in-a-matrix/,the-k-weakest-rows-in-a-matrix,数组、二分查找、矩阵、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/1300-1399/the-k-weakest-rows-in-a-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1337.%20%E7%9F%A9%E9%98%B5%E4%B8%AD%E6%88%98%E6%96%97%E5%8A%9B%E6%9C%80%E5%BC%B1%E7%9A%84%20K%20%E8%A1%8C.md,68.6%,简单,909 -1338,1300-1399,1338. 数组大小减半,数组大小减半,https://leetcode.cn/problems/reduce-array-size-to-the-half/,reduce-array-size-to-the-half,贪心、数组、哈希表、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/1300-1399/reduce-array-size-to-the-half/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1338.%20%E6%95%B0%E7%BB%84%E5%A4%A7%E5%B0%8F%E5%87%8F%E5%8D%8A.md,64.9%,中等,186 -1339,1300-1399,1339. 分裂二叉树的最大乘积,分裂二叉树的最大乘积,https://leetcode.cn/problems/maximum-product-of-splitted-binary-tree/,maximum-product-of-splitted-binary-tree,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/1300-1399/maximum-product-of-splitted-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1339.%20%E5%88%86%E8%A3%82%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%A4%A7%E4%B9%98%E7%A7%AF.md,41.5%,中等,189 -1340,1300-1399,1340. 跳跃游戏 V,跳跃游戏 V,https://leetcode.cn/problems/jump-game-v/,jump-game-v,数组、动态规划、排序,https://algo.itcharge.cn/Solutions/1300-1399/jump-game-v/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1340.%20%E8%B7%B3%E8%B7%83%E6%B8%B8%E6%88%8F%20V.md,59.3%,困难,136 -1341,1300-1399,1341. 电影评分,电影评分,https://leetcode.cn/problems/movie-rating/,movie-rating,数据库,https://algo.itcharge.cn/Solutions/1300-1399/movie-rating/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1341.%20%E7%94%B5%E5%BD%B1%E8%AF%84%E5%88%86.md,40.5%,中等,121 -1342,1300-1399,1342. 将数字变成 0 的操作次数,将数字变成 0 的操作次数,https://leetcode.cn/problems/number-of-steps-to-reduce-a-number-to-zero/,number-of-steps-to-reduce-a-number-to-zero,位运算、数学,https://algo.itcharge.cn/Solutions/1300-1399/number-of-steps-to-reduce-a-number-to-zero/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1342.%20%E5%B0%86%E6%95%B0%E5%AD%97%E5%8F%98%E6%88%90%200%20%E7%9A%84%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0.md,76.0%,简单,1576 -1343,1300-1399,1343. 大小为 K 且平均值大于等于阈值的子数组数目,大小为 K 且平均值大于等于阈值的子数组数目,https://leetcode.cn/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/,number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold,数组、滑动窗口,https://algo.itcharge.cn/Solutions/1300-1399/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1343.%20%E5%A4%A7%E5%B0%8F%E4%B8%BA%20K%20%E4%B8%94%E5%B9%B3%E5%9D%87%E5%80%BC%E5%A4%A7%E4%BA%8E%E7%AD%89%E4%BA%8E%E9%98%88%E5%80%BC%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84%E6%95%B0%E7%9B%AE.md,57.4%,中等,303 -1344,1300-1399,1344. 时钟指针的夹角,时钟指针的夹角,https://leetcode.cn/problems/angle-between-hands-of-a-clock/,angle-between-hands-of-a-clock,数学,https://algo.itcharge.cn/Solutions/1300-1399/angle-between-hands-of-a-clock/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1344.%20%E6%97%B6%E9%92%9F%E6%8C%87%E9%92%88%E7%9A%84%E5%A4%B9%E8%A7%92.md,60.2%,中等,179 -1345,1300-1399,1345. 跳跃游戏 IV,跳跃游戏 IV,https://leetcode.cn/problems/jump-game-iv/,jump-game-iv,广度优先搜索、数组、哈希表,https://algo.itcharge.cn/Solutions/1300-1399/jump-game-iv/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1345.%20%E8%B7%B3%E8%B7%83%E6%B8%B8%E6%88%8F%20IV.md,45.7%,困难,312 -1346,1300-1399,1346. 检查整数及其两倍数是否存在,检查整数及其两倍数是否存在,https://leetcode.cn/problems/check-if-n-and-its-double-exist/,check-if-n-and-its-double-exist,数组、哈希表、双指针、二分查找、排序,https://algo.itcharge.cn/Solutions/1300-1399/check-if-n-and-its-double-exist/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1346.%20%E6%A3%80%E6%9F%A5%E6%95%B4%E6%95%B0%E5%8F%8A%E5%85%B6%E4%B8%A4%E5%80%8D%E6%95%B0%E6%98%AF%E5%90%A6%E5%AD%98%E5%9C%A8.md,42.0%,简单,545 -1347,1300-1399,1347. 制造字母异位词的最小步骤数,制造字母异位词的最小步骤数,https://leetcode.cn/problems/minimum-number-of-steps-to-make-two-strings-anagram/,minimum-number-of-steps-to-make-two-strings-anagram,哈希表、字符串、计数,https://algo.itcharge.cn/Solutions/1300-1399/minimum-number-of-steps-to-make-two-strings-anagram/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1347.%20%E5%88%B6%E9%80%A0%E5%AD%97%E6%AF%8D%E5%BC%82%E4%BD%8D%E8%AF%8D%E7%9A%84%E6%9C%80%E5%B0%8F%E6%AD%A5%E9%AA%A4%E6%95%B0.md,76.1%,中等,175 -1348,1300-1399,1348. 推文计数,推文计数,https://leetcode.cn/problems/tweet-counts-per-frequency/,tweet-counts-per-frequency,设计、哈希表、二分查找、有序集合、排序,https://algo.itcharge.cn/Solutions/1300-1399/tweet-counts-per-frequency/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1348.%20%E6%8E%A8%E6%96%87%E8%AE%A1%E6%95%B0.md,35.0%,中等,80 -1349,1300-1399,1349. 参加考试的最大学生数,参加考试的最大学生数,https://leetcode.cn/problems/maximum-students-taking-exam/,maximum-students-taking-exam,位运算、数组、动态规划、状态压缩、矩阵,https://algo.itcharge.cn/Solutions/1300-1399/maximum-students-taking-exam/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1349.%20%E5%8F%82%E5%8A%A0%E8%80%83%E8%AF%95%E7%9A%84%E6%9C%80%E5%A4%A7%E5%AD%A6%E7%94%9F%E6%95%B0.md,54.3%,困难,138 -1350,1300-1399,1350. 院系无效的学生,院系无效的学生,https://leetcode.cn/problems/students-with-invalid-departments/,students-with-invalid-departments,数据库,https://algo.itcharge.cn/Solutions/1300-1399/students-with-invalid-departments/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1350.%20%E9%99%A2%E7%B3%BB%E6%97%A0%E6%95%88%E7%9A%84%E5%AD%A6%E7%94%9F.md,85.0%,简单,106 -1351,1300-1399,1351. 统计有序矩阵中的负数,统计有序矩阵中的负数,https://leetcode.cn/problems/count-negative-numbers-in-a-sorted-matrix/,count-negative-numbers-in-a-sorted-matrix,数组、二分查找、矩阵,https://algo.itcharge.cn/Solutions/1300-1399/count-negative-numbers-in-a-sorted-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1351.%20%E7%BB%9F%E8%AE%A1%E6%9C%89%E5%BA%8F%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E8%B4%9F%E6%95%B0.md,74.2%,简单,797 -1352,1300-1399,1352. 最后 K 个数的乘积,最后 K 个数的乘积,https://leetcode.cn/problems/product-of-the-last-k-numbers/,product-of-the-last-k-numbers,设计、队列、数组、数学、数据流,https://algo.itcharge.cn/Solutions/1300-1399/product-of-the-last-k-numbers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1352.%20%E6%9C%80%E5%90%8E%20K%20%E4%B8%AA%E6%95%B0%E7%9A%84%E4%B9%98%E7%A7%AF.md,48.4%,中等,130 -1353,1300-1399,1353. 最多可以参加的会议数目,最多可以参加的会议数目,https://leetcode.cn/problems/maximum-number-of-events-that-can-be-attended/,maximum-number-of-events-that-can-be-attended,贪心、数组、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/1300-1399/maximum-number-of-events-that-can-be-attended/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1353.%20%E6%9C%80%E5%A4%9A%E5%8F%AF%E4%BB%A5%E5%8F%82%E5%8A%A0%E7%9A%84%E4%BC%9A%E8%AE%AE%E6%95%B0%E7%9B%AE.md,29.5%,中等,213 -1354,1300-1399,1354. 多次求和构造目标数组,多次求和构造目标数组,https://leetcode.cn/problems/construct-target-array-with-multiple-sums/,construct-target-array-with-multiple-sums,数组、堆（优先队列）,https://algo.itcharge.cn/Solutions/1300-1399/construct-target-array-with-multiple-sums/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1354.%20%E5%A4%9A%E6%AC%A1%E6%B1%82%E5%92%8C%E6%9E%84%E9%80%A0%E7%9B%AE%E6%A0%87%E6%95%B0%E7%BB%84.md,29.0%,困难,93 -1355,1300-1399,1355. 活动参与者,活动参与者,https://leetcode.cn/problems/activity-participants/,activity-participants,数据库,https://algo.itcharge.cn/Solutions/1300-1399/activity-participants/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1355.%20%E6%B4%BB%E5%8A%A8%E5%8F%82%E4%B8%8E%E8%80%85.md,66.8%,中等,86 -1356,1300-1399,1356. 根据数字二进制下 1 的数目排序,根据数字二进制下 1 的数目排序,https://leetcode.cn/problems/sort-integers-by-the-number-of-1-bits/,sort-integers-by-the-number-of-1-bits,位运算、数组、计数、排序,https://algo.itcharge.cn/Solutions/1300-1399/sort-integers-by-the-number-of-1-bits/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1356.%20%E6%A0%B9%E6%8D%AE%E6%95%B0%E5%AD%97%E4%BA%8C%E8%BF%9B%E5%88%B6%E4%B8%8B%201%20%E7%9A%84%E6%95%B0%E7%9B%AE%E6%8E%92%E5%BA%8F.md,73.5%,简单,686 -1357,1300-1399,1357. 每隔 n 个顾客打折,每隔 n 个顾客打折,https://leetcode.cn/problems/apply-discount-every-n-orders/,apply-discount-every-n-orders,设计、数组、哈希表,https://algo.itcharge.cn/Solutions/1300-1399/apply-discount-every-n-orders/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1357.%20%E6%AF%8F%E9%9A%94%20n%20%E4%B8%AA%E9%A1%BE%E5%AE%A2%E6%89%93%E6%8A%98.md,54.5%,中等,71 -1358,1300-1399,1358. 包含所有三种字符的子字符串数目,包含所有三种字符的子字符串数目,https://leetcode.cn/problems/number-of-substrings-containing-all-three-characters/,number-of-substrings-containing-all-three-characters,哈希表、字符串、滑动窗口,https://algo.itcharge.cn/Solutions/1300-1399/number-of-substrings-containing-all-three-characters/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1358.%20%E5%8C%85%E5%90%AB%E6%89%80%E6%9C%89%E4%B8%89%E7%A7%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%95%B0%E7%9B%AE.md,52.9%,中等,184 -1359,1300-1399,1359. 有效的快递序列数目,有效的快递序列数目,https://leetcode.cn/problems/count-all-valid-pickup-and-delivery-options/,count-all-valid-pickup-and-delivery-options,数学、动态规划、组合数学,https://algo.itcharge.cn/Solutions/1300-1399/count-all-valid-pickup-and-delivery-options/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1359.%20%E6%9C%89%E6%95%88%E7%9A%84%E5%BF%AB%E9%80%92%E5%BA%8F%E5%88%97%E6%95%B0%E7%9B%AE.md,58.4%,困难,122 -1360,1300-1399,1360. 日期之间隔几天,日期之间隔几天,https://leetcode.cn/problems/number-of-days-between-two-dates/,number-of-days-between-two-dates,数学、字符串,https://algo.itcharge.cn/Solutions/1300-1399/number-of-days-between-two-dates/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1360.%20%E6%97%A5%E6%9C%9F%E4%B9%8B%E9%97%B4%E9%9A%94%E5%87%A0%E5%A4%A9.md,51.1%,简单,239 -1361,1300-1399,1361. 验证二叉树,验证二叉树,https://leetcode.cn/problems/validate-binary-tree-nodes/,validate-binary-tree-nodes,树、深度优先搜索、广度优先搜索、并查集、图、二叉树,https://algo.itcharge.cn/Solutions/1300-1399/validate-binary-tree-nodes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1361.%20%E9%AA%8C%E8%AF%81%E4%BA%8C%E5%8F%89%E6%A0%91.md,39.9%,中等,302 -1362,1300-1399,1362. 最接近的因数,最接近的因数,https://leetcode.cn/problems/closest-divisors/,closest-divisors,数学,https://algo.itcharge.cn/Solutions/1300-1399/closest-divisors/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1362.%20%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9A%84%E5%9B%A0%E6%95%B0.md,54.7%,中等,97 -1363,1300-1399,1363. 形成三的最大倍数,形成三的最大倍数,https://leetcode.cn/problems/largest-multiple-of-three/,largest-multiple-of-three,贪心、数组、动态规划,https://algo.itcharge.cn/Solutions/1300-1399/largest-multiple-of-three/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1363.%20%E5%BD%A2%E6%88%90%E4%B8%89%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%8D%E6%95%B0.md,35.9%,困难,134 -1364,1300-1399,1364. 顾客的可信联系人数量,顾客的可信联系人数量,https://leetcode.cn/problems/number-of-trusted-contacts-of-a-customer/,number-of-trusted-contacts-of-a-customer,数据库,https://algo.itcharge.cn/Solutions/1300-1399/number-of-trusted-contacts-of-a-customer/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1364.%20%E9%A1%BE%E5%AE%A2%E7%9A%84%E5%8F%AF%E4%BF%A1%E8%81%94%E7%B3%BB%E4%BA%BA%E6%95%B0%E9%87%8F.md,68.3%,中等,90 -1365,1300-1399,1365. 有多少小于当前数字的数字,有多少小于当前数字的数字,https://leetcode.cn/problems/how-many-numbers-are-smaller-than-the-current-number/,how-many-numbers-are-smaller-than-the-current-number,数组、哈希表、计数、排序,https://algo.itcharge.cn/Solutions/1300-1399/how-many-numbers-are-smaller-than-the-current-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1365.%20%E6%9C%89%E5%A4%9A%E5%B0%91%E5%B0%8F%E4%BA%8E%E5%BD%93%E5%89%8D%E6%95%B0%E5%AD%97%E7%9A%84%E6%95%B0%E5%AD%97.md,82.4%,简单,1313 -1366,1300-1399,1366. 通过投票对团队排名,通过投票对团队排名,https://leetcode.cn/problems/rank-teams-by-votes/,rank-teams-by-votes,数组、哈希表、字符串、计数、排序,https://algo.itcharge.cn/Solutions/1300-1399/rank-teams-by-votes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1366.%20%E9%80%9A%E8%BF%87%E6%8A%95%E7%A5%A8%E5%AF%B9%E5%9B%A2%E9%98%9F%E6%8E%92%E5%90%8D.md,51.1%,中等,213 -1367,1300-1399,1367. 二叉树中的链表,二叉树中的链表,https://leetcode.cn/problems/linked-list-in-binary-tree/,linked-list-in-binary-tree,树、深度优先搜索、广度优先搜索、链表、二叉树,https://algo.itcharge.cn/Solutions/1300-1399/linked-list-in-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1367.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E7%9A%84%E9%93%BE%E8%A1%A8.md,43.7%,中等,354 -1368,1300-1399,1368. 使网格图至少有一条有效路径的最小代价,使网格图至少有一条有效路径的最小代价,https://leetcode.cn/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/,minimum-cost-to-make-at-least-one-valid-path-in-a-grid,广度优先搜索、图、数组、矩阵、最短路、堆（优先队列）,https://algo.itcharge.cn/Solutions/1300-1399/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1368.%20%E4%BD%BF%E7%BD%91%E6%A0%BC%E5%9B%BE%E8%87%B3%E5%B0%91%E6%9C%89%E4%B8%80%E6%9D%A1%E6%9C%89%E6%95%88%E8%B7%AF%E5%BE%84%E7%9A%84%E6%9C%80%E5%B0%8F%E4%BB%A3%E4%BB%B7.md,59.6%,困难,153 -1369,1300-1399,1369. 获取最近第二次的活动,获取最近第二次的活动,https://leetcode.cn/problems/get-the-second-most-recent-activity/,get-the-second-most-recent-activity,数据库,https://algo.itcharge.cn/Solutions/1300-1399/get-the-second-most-recent-activity/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1369.%20%E8%8E%B7%E5%8F%96%E6%9C%80%E8%BF%91%E7%AC%AC%E4%BA%8C%E6%AC%A1%E7%9A%84%E6%B4%BB%E5%8A%A8.md,61.6%,困难,84 -1370,1300-1399,1370. 上升下降字符串,上升下降字符串,https://leetcode.cn/problems/increasing-decreasing-string/,increasing-decreasing-string,哈希表、字符串、计数,https://algo.itcharge.cn/Solutions/1300-1399/increasing-decreasing-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1370.%20%E4%B8%8A%E5%8D%87%E4%B8%8B%E9%99%8D%E5%AD%97%E7%AC%A6%E4%B8%B2.md,79.0%,简单,670 -1371,1300-1399,1371. 每个元音包含偶数次的最长子字符串,每个元音包含偶数次的最长子字符串,https://leetcode.cn/problems/find-the-longest-substring-containing-vowels-in-even-counts/,find-the-longest-substring-containing-vowels-in-even-counts,位运算、哈希表、字符串、前缀和,https://algo.itcharge.cn/Solutions/1300-1399/find-the-longest-substring-containing-vowels-in-even-counts/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1371.%20%E6%AF%8F%E4%B8%AA%E5%85%83%E9%9F%B3%E5%8C%85%E5%90%AB%E5%81%B6%E6%95%B0%E6%AC%A1%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md,59.1%,中等,325 -1372,1300-1399,1372. 二叉树中的最长交错路径,二叉树中的最长交错路径,https://leetcode.cn/problems/longest-zigzag-path-in-a-binary-tree/,longest-zigzag-path-in-a-binary-tree,树、深度优先搜索、动态规划、二叉树,https://algo.itcharge.cn/Solutions/1300-1399/longest-zigzag-path-in-a-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1372.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E7%9A%84%E6%9C%80%E9%95%BF%E4%BA%A4%E9%94%99%E8%B7%AF%E5%BE%84.md,54.7%,中等,264 -1373,1300-1399,1373. 二叉搜索子树的最大键值和,二叉搜索子树的最大键值和,https://leetcode.cn/problems/maximum-sum-bst-in-binary-tree/,maximum-sum-bst-in-binary-tree,树、深度优先搜索、二叉搜索树、动态规划、二叉树,https://algo.itcharge.cn/Solutions/1300-1399/maximum-sum-bst-in-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1373.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E5%AD%90%E6%A0%91%E7%9A%84%E6%9C%80%E5%A4%A7%E9%94%AE%E5%80%BC%E5%92%8C.md,47.8%,困难,410 -1374,1300-1399,1374. 生成每种字符都是奇数个的字符串,生成每种字符都是奇数个的字符串,https://leetcode.cn/problems/generate-a-string-with-characters-that-have-odd-counts/,generate-a-string-with-characters-that-have-odd-counts,字符串,https://algo.itcharge.cn/Solutions/1300-1399/generate-a-string-with-characters-that-have-odd-counts/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1374.%20%E7%94%9F%E6%88%90%E6%AF%8F%E7%A7%8D%E5%AD%97%E7%AC%A6%E9%83%BD%E6%98%AF%E5%A5%87%E6%95%B0%E4%B8%AA%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2.md,77.7%,简单,551 -1375,1300-1399,1375. 二进制字符串前缀一致的次数,二进制字符串前缀一致的次数,https://leetcode.cn/problems/number-of-times-binary-string-is-prefix-aligned/,number-of-times-binary-string-is-prefix-aligned,数组,https://algo.itcharge.cn/Solutions/1300-1399/number-of-times-binary-string-is-prefix-aligned/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1375.%20%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%89%8D%E7%BC%80%E4%B8%80%E8%87%B4%E7%9A%84%E6%AC%A1%E6%95%B0.md,68.1%,中等,423 -1376,1300-1399,1376. 通知所有员工所需的时间,通知所有员工所需的时间,https://leetcode.cn/problems/time-needed-to-inform-all-employees/,time-needed-to-inform-all-employees,树、深度优先搜索、广度优先搜索,https://algo.itcharge.cn/Solutions/1300-1399/time-needed-to-inform-all-employees/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1376.%20%E9%80%9A%E7%9F%A5%E6%89%80%E6%9C%89%E5%91%98%E5%B7%A5%E6%89%80%E9%9C%80%E7%9A%84%E6%97%B6%E9%97%B4.md,60.2%,中等,431 -1377,1300-1399,1377. T 秒后青蛙的位置,T 秒后青蛙的位置,https://leetcode.cn/problems/frog-position-after-t-seconds/,frog-position-after-t-seconds,树、深度优先搜索、广度优先搜索、图,https://algo.itcharge.cn/Solutions/1300-1399/frog-position-after-t-seconds/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1377.%20T%20%E7%A7%92%E5%90%8E%E9%9D%92%E8%9B%99%E7%9A%84%E4%BD%8D%E7%BD%AE.md,42.7%,困难,273 -1378,1300-1399,1378. 使用唯一标识码替换员工ID,使用唯一标识码替换员工ID,https://leetcode.cn/problems/replace-employee-id-with-the-unique-identifier/,replace-employee-id-with-the-unique-identifier,数据库,https://algo.itcharge.cn/Solutions/1300-1399/replace-employee-id-with-the-unique-identifier/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1378.%20%E4%BD%BF%E7%94%A8%E5%94%AF%E4%B8%80%E6%A0%87%E8%AF%86%E7%A0%81%E6%9B%BF%E6%8D%A2%E5%91%98%E5%B7%A5ID.md,85.7%,简单,105 -1379,1300-1399,1379. 找出克隆二叉树中的相同节点,找出克隆二叉树中的相同节点,https://leetcode.cn/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/,find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/1300-1399/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1379.%20%E6%89%BE%E5%87%BA%E5%85%8B%E9%9A%86%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E7%9A%84%E7%9B%B8%E5%90%8C%E8%8A%82%E7%82%B9.md,83.3%,简单,248 -1380,1300-1399,1380. 矩阵中的幸运数,矩阵中的幸运数,https://leetcode.cn/problems/lucky-numbers-in-a-matrix/,lucky-numbers-in-a-matrix,数组、矩阵,https://algo.itcharge.cn/Solutions/1300-1399/lucky-numbers-in-a-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1380.%20%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E5%B9%B8%E8%BF%90%E6%95%B0.md,76.4%,简单,758 -1381,1300-1399,1381. 设计一个支持增量操作的栈,设计一个支持增量操作的栈,https://leetcode.cn/problems/design-a-stack-with-increment-operation/,design-a-stack-with-increment-operation,栈、设计、数组,https://algo.itcharge.cn/Solutions/1300-1399/design-a-stack-with-increment-operation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1381.%20%E8%AE%BE%E8%AE%A1%E4%B8%80%E4%B8%AA%E6%94%AF%E6%8C%81%E5%A2%9E%E9%87%8F%E6%93%8D%E4%BD%9C%E7%9A%84%E6%A0%88.md,72.4%,中等,230 -1382,1300-1399,1382. 将二叉搜索树变平衡,将二叉搜索树变平衡,https://leetcode.cn/problems/balance-a-binary-search-tree/,balance-a-binary-search-tree,贪心、树、深度优先搜索、二叉搜索树、分治、二叉树,https://algo.itcharge.cn/Solutions/1300-1399/balance-a-binary-search-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1382.%20%E5%B0%86%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E5%8F%98%E5%B9%B3%E8%A1%A1.md,73.6%,中等,300 -1383,1300-1399,1383. 最大的团队表现值,最大的团队表现值,https://leetcode.cn/problems/maximum-performance-of-a-team/,maximum-performance-of-a-team,贪心、数组、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/1300-1399/maximum-performance-of-a-team/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1383.%20%E6%9C%80%E5%A4%A7%E7%9A%84%E5%9B%A2%E9%98%9F%E8%A1%A8%E7%8E%B0%E5%80%BC.md,35.3%,困难,128 -1384,1300-1399,1384. 按年度列出销售总额,按年度列出销售总额,https://leetcode.cn/problems/total-sales-amount-by-year/,total-sales-amount-by-year,数据库,https://algo.itcharge.cn/Solutions/1300-1399/total-sales-amount-by-year/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1384.%20%E6%8C%89%E5%B9%B4%E5%BA%A6%E5%88%97%E5%87%BA%E9%94%80%E5%94%AE%E6%80%BB%E9%A2%9D.md,57.7%,困难,101 -1385,1300-1399,1385. 两个数组间的距离值,两个数组间的距离值,https://leetcode.cn/problems/find-the-distance-value-between-two-arrays/,find-the-distance-value-between-two-arrays,数组、双指针、二分查找、排序,https://algo.itcharge.cn/Solutions/1300-1399/find-the-distance-value-between-two-arrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1385.%20%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E9%97%B4%E7%9A%84%E8%B7%9D%E7%A6%BB%E5%80%BC.md,64.1%,简单,511 -1386,1300-1399,1386. 安排电影院座位,安排电影院座位,https://leetcode.cn/problems/cinema-seat-allocation/,cinema-seat-allocation,贪心、位运算、数组、哈希表,https://algo.itcharge.cn/Solutions/1300-1399/cinema-seat-allocation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1386.%20%E5%AE%89%E6%8E%92%E7%94%B5%E5%BD%B1%E9%99%A2%E5%BA%A7%E4%BD%8D.md,35.5%,中等,175 -1387,1300-1399,1387. 将整数按权重排序,将整数按权重排序,https://leetcode.cn/problems/sort-integers-by-the-power-value/,sort-integers-by-the-power-value,记忆化搜索、动态规划、排序,https://algo.itcharge.cn/Solutions/1300-1399/sort-integers-by-the-power-value/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1387.%20%E5%B0%86%E6%95%B4%E6%95%B0%E6%8C%89%E6%9D%83%E9%87%8D%E6%8E%92%E5%BA%8F.md,69.5%,中等,268 -1388,1300-1399,1388. 3n 块披萨,3n 块披萨,https://leetcode.cn/problems/pizza-with-3n-slices/,pizza-with-3n-slices,贪心、数组、动态规划、堆（优先队列）,https://algo.itcharge.cn/Solutions/1300-1399/pizza-with-3n-slices/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1388.%203n%20%E5%9D%97%E6%8A%AB%E8%90%A8.md,56.5%,困难,76 -1389,1300-1399,1389. 按既定顺序创建目标数组,按既定顺序创建目标数组,https://leetcode.cn/problems/create-target-array-in-the-given-order/,create-target-array-in-the-given-order,数组、模拟,https://algo.itcharge.cn/Solutions/1300-1399/create-target-array-in-the-given-order/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1389.%20%E6%8C%89%E6%97%A2%E5%AE%9A%E9%A1%BA%E5%BA%8F%E5%88%9B%E5%BB%BA%E7%9B%AE%E6%A0%87%E6%95%B0%E7%BB%84.md,83.0%,简单,582 -1390,1300-1399,1390. 四因数,四因数,https://leetcode.cn/problems/four-divisors/,four-divisors,数组、数学,https://algo.itcharge.cn/Solutions/1300-1399/four-divisors/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1390.%20%E5%9B%9B%E5%9B%A0%E6%95%B0.md,38.9%,中等,146 -1391,1300-1399,1391. 检查网格中是否存在有效路径,检查网格中是否存在有效路径,https://leetcode.cn/problems/check-if-there-is-a-valid-path-in-a-grid/,check-if-there-is-a-valid-path-in-a-grid,深度优先搜索、广度优先搜索、并查集、数组、矩阵,https://algo.itcharge.cn/Solutions/1300-1399/check-if-there-is-a-valid-path-in-a-grid/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1391.%20%E6%A3%80%E6%9F%A5%E7%BD%91%E6%A0%BC%E4%B8%AD%E6%98%AF%E5%90%A6%E5%AD%98%E5%9C%A8%E6%9C%89%E6%95%88%E8%B7%AF%E5%BE%84.md,42.0%,中等,266 -1392,1300-1399,1392. 最长快乐前缀,最长快乐前缀,https://leetcode.cn/problems/longest-happy-prefix/,longest-happy-prefix,字符串、字符串匹配、哈希函数、滚动哈希,https://algo.itcharge.cn/Solutions/1300-1399/longest-happy-prefix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1392.%20%E6%9C%80%E9%95%BF%E5%BF%AB%E4%B9%90%E5%89%8D%E7%BC%80.md,44.6%,困难,232 -1393,1300-1399,1393. 股票的资本损益,股票的资本损益,https://leetcode.cn/problems/capital-gainloss/,capital-gainloss,数据库,https://algo.itcharge.cn/Solutions/1300-1399/capital-gainloss/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1393.%20%E8%82%A1%E7%A5%A8%E7%9A%84%E8%B5%84%E6%9C%AC%E6%8D%9F%E7%9B%8A.md,83.8%,中等,260 -1394,1300-1399,1394. 找出数组中的幸运数,找出数组中的幸运数,https://leetcode.cn/problems/find-lucky-integer-in-an-array/,find-lucky-integer-in-an-array,数组、哈希表、计数,https://algo.itcharge.cn/Solutions/1300-1399/find-lucky-integer-in-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1394.%20%E6%89%BE%E5%87%BA%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E5%B9%B8%E8%BF%90%E6%95%B0.md,65.6%,简单,430 -1395,1300-1399,1395. 统计作战单位数,统计作战单位数,https://leetcode.cn/problems/count-number-of-teams/,count-number-of-teams,树状数组、数组、动态规划,https://algo.itcharge.cn/Solutions/1300-1399/count-number-of-teams/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1395.%20%E7%BB%9F%E8%AE%A1%E4%BD%9C%E6%88%98%E5%8D%95%E4%BD%8D%E6%95%B0.md,71.3%,中等,294 -1396,1300-1399,1396. 设计地铁系统,设计地铁系统,https://leetcode.cn/problems/design-underground-system/,design-underground-system,设计、哈希表、字符串,https://algo.itcharge.cn/Solutions/1300-1399/design-underground-system/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1396.%20%E8%AE%BE%E8%AE%A1%E5%9C%B0%E9%93%81%E7%B3%BB%E7%BB%9F.md,41.9%,中等,266 -1397,1300-1399,1397. 找到所有好字符串,找到所有好字符串,https://leetcode.cn/problems/find-all-good-strings/,find-all-good-strings,字符串、动态规划、字符串匹配,https://algo.itcharge.cn/Solutions/1300-1399/find-all-good-strings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1397.%20%E6%89%BE%E5%88%B0%E6%89%80%E6%9C%89%E5%A5%BD%E5%AD%97%E7%AC%A6%E4%B8%B2.md,43.8%,困难,67 -1398,1300-1399,1398. 购买了产品 A 和产品 B 却没有购买产品 C 的顾客,购买了产品 A 和产品 B 却没有购买产品 C 的顾客,https://leetcode.cn/problems/customers-who-bought-products-a-and-b-but-not-c/,customers-who-bought-products-a-and-b-but-not-c,数据库,https://algo.itcharge.cn/Solutions/1300-1399/customers-who-bought-products-a-and-b-but-not-c/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1398.%20%E8%B4%AD%E4%B9%B0%E4%BA%86%E4%BA%A7%E5%93%81%20A%20%E5%92%8C%E4%BA%A7%E5%93%81%20B%20%E5%8D%B4%E6%B2%A1%E6%9C%89%E8%B4%AD%E4%B9%B0%E4%BA%A7%E5%93%81%20C%20%E7%9A%84%E9%A1%BE%E5%AE%A2.md,72.2%,中等,145 -1399,1300-1399,1399. 统计最大组的数目,统计最大组的数目,https://leetcode.cn/problems/count-largest-group/,count-largest-group,哈希表、数学,https://algo.itcharge.cn/Solutions/1300-1399/count-largest-group/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1399.%20%E7%BB%9F%E8%AE%A1%E6%9C%80%E5%A4%A7%E7%BB%84%E7%9A%84%E6%95%B0%E7%9B%AE.md,67.0%,简单,211 -1400,1400-1499,1400. 构造 K 个回文字符串,构造 K 个回文字符串,https://leetcode.cn/problems/construct-k-palindrome-strings/,construct-k-palindrome-strings,贪心、哈希表、字符串、计数,https://algo.itcharge.cn/Solutions/1400-1499/construct-k-palindrome-strings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1400.%20%E6%9E%84%E9%80%A0%20K%20%E4%B8%AA%E5%9B%9E%E6%96%87%E5%AD%97%E7%AC%A6%E4%B8%B2.md,61.3%,中等,151 -1401,1400-1499,1401. 圆和矩形是否有重叠,圆和矩形是否有重叠,https://leetcode.cn/problems/circle-and-rectangle-overlapping/,circle-and-rectangle-overlapping,几何、数学,https://algo.itcharge.cn/Solutions/1400-1499/circle-and-rectangle-overlapping/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1401.%20%E5%9C%86%E5%92%8C%E7%9F%A9%E5%BD%A2%E6%98%AF%E5%90%A6%E6%9C%89%E9%87%8D%E5%8F%A0.md,51.7%,中等,251 -1402,1400-1499,1402. 做菜顺序,做菜顺序,https://leetcode.cn/problems/reducing-dishes/,reducing-dishes,贪心、数组、动态规划、排序,https://algo.itcharge.cn/Solutions/1400-1499/reducing-dishes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1402.%20%E5%81%9A%E8%8F%9C%E9%A1%BA%E5%BA%8F.md,76.1%,困难,244 -1403,1400-1499,1403. 非递增顺序的最小子序列,非递增顺序的最小子序列,https://leetcode.cn/problems/minimum-subsequence-in-non-increasing-order/,minimum-subsequence-in-non-increasing-order,贪心、数组、排序,https://algo.itcharge.cn/Solutions/1400-1499/minimum-subsequence-in-non-increasing-order/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1403.%20%E9%9D%9E%E9%80%92%E5%A2%9E%E9%A1%BA%E5%BA%8F%E7%9A%84%E6%9C%80%E5%B0%8F%E5%AD%90%E5%BA%8F%E5%88%97.md,73.3%,简单,756 -1404,1400-1499,1404. 将二进制表示减到 1 的步骤数,将二进制表示减到 1 的步骤数,https://leetcode.cn/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one/,number-of-steps-to-reduce-a-number-in-binary-representation-to-one,位运算、字符串,https://algo.itcharge.cn/Solutions/1400-1499/number-of-steps-to-reduce-a-number-in-binary-representation-to-one/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1404.%20%E5%B0%86%E4%BA%8C%E8%BF%9B%E5%88%B6%E8%A1%A8%E7%A4%BA%E5%87%8F%E5%88%B0%201%20%E7%9A%84%E6%AD%A5%E9%AA%A4%E6%95%B0.md,50.9%,中等,198 -1405,1400-1499,1405. 最长快乐字符串,最长快乐字符串,https://leetcode.cn/problems/longest-happy-string/,longest-happy-string,贪心、字符串、堆（优先队列）,https://algo.itcharge.cn/Solutions/1400-1499/longest-happy-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1405.%20%E6%9C%80%E9%95%BF%E5%BF%AB%E4%B9%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md,63.6%,中等,521 -1406,1400-1499,1406. 石子游戏 III,石子游戏 III,https://leetcode.cn/problems/stone-game-iii/,stone-game-iii,数组、数学、动态规划、博弈,https://algo.itcharge.cn/Solutions/1400-1499/stone-game-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1406.%20%E7%9F%B3%E5%AD%90%E6%B8%B8%E6%88%8F%20III.md,59.2%,困难,124 -1407,1400-1499,1407. 排名靠前的旅行者,排名靠前的旅行者,https://leetcode.cn/problems/top-travellers/,top-travellers,数据库,https://algo.itcharge.cn/Solutions/1400-1499/top-travellers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1407.%20%E6%8E%92%E5%90%8D%E9%9D%A0%E5%89%8D%E7%9A%84%E6%97%85%E8%A1%8C%E8%80%85.md,56.8%,简单,265 -1408,1400-1499,1408. 数组中的字符串匹配,数组中的字符串匹配,https://leetcode.cn/problems/string-matching-in-an-array/,string-matching-in-an-array,数组、字符串、字符串匹配,https://algo.itcharge.cn/Solutions/1400-1499/string-matching-in-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1408.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%8C%B9%E9%85%8D.md,64.4%,简单,558 -1409,1400-1499,1409. 查询带键的排列,查询带键的排列,https://leetcode.cn/problems/queries-on-a-permutation-with-key/,queries-on-a-permutation-with-key,树状数组、数组、模拟,https://algo.itcharge.cn/Solutions/1400-1499/queries-on-a-permutation-with-key/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1409.%20%E6%9F%A5%E8%AF%A2%E5%B8%A6%E9%94%AE%E7%9A%84%E6%8E%92%E5%88%97.md,81.4%,中等,197 -1410,1400-1499,1410. HTML 实体解析器,HTML 实体解析器,https://leetcode.cn/problems/html-entity-parser/,html-entity-parser,哈希表、字符串,https://algo.itcharge.cn/Solutions/1400-1499/html-entity-parser/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1410.%20HTML%20%E5%AE%9E%E4%BD%93%E8%A7%A3%E6%9E%90%E5%99%A8.md,47.0%,中等,143 -1411,1400-1499,1411. 给 N x 3 网格图涂色的方案数,给 N x 3 网格图涂色的方案数,https://leetcode.cn/problems/number-of-ways-to-paint-n-3-grid/,number-of-ways-to-paint-n-3-grid,动态规划,https://algo.itcharge.cn/Solutions/1400-1499/number-of-ways-to-paint-n-3-grid/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1411.%20%E7%BB%99%20N%20x%203%20%E7%BD%91%E6%A0%BC%E5%9B%BE%E6%B6%82%E8%89%B2%E7%9A%84%E6%96%B9%E6%A1%88%E6%95%B0.md,57.2%,困难,168 -1412,1400-1499,1412. 查找成绩处于中游的学生,查找成绩处于中游的学生,https://leetcode.cn/problems/find-the-quiet-students-in-all-exams/,find-the-quiet-students-in-all-exams,数据库,https://algo.itcharge.cn/Solutions/1400-1499/find-the-quiet-students-in-all-exams/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1412.%20%E6%9F%A5%E6%89%BE%E6%88%90%E7%BB%A9%E5%A4%84%E4%BA%8E%E4%B8%AD%E6%B8%B8%E7%9A%84%E5%AD%A6%E7%94%9F.md,54.4%,困难,121 -1413,1400-1499,1413. 逐步求和得到正数的最小值,逐步求和得到正数的最小值,https://leetcode.cn/problems/minimum-value-to-get-positive-step-by-step-sum/,minimum-value-to-get-positive-step-by-step-sum,数组、前缀和,https://algo.itcharge.cn/Solutions/1400-1499/minimum-value-to-get-positive-step-by-step-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1413.%20%E9%80%90%E6%AD%A5%E6%B1%82%E5%92%8C%E5%BE%97%E5%88%B0%E6%AD%A3%E6%95%B0%E7%9A%84%E6%9C%80%E5%B0%8F%E5%80%BC.md,73.0%,简单,701 -1414,1400-1499,1414. 和为 K 的最少斐波那契数字数目,和为 K 的最少斐波那契数字数目,https://leetcode.cn/problems/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k/,find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k,贪心、数学,https://algo.itcharge.cn/Solutions/1400-1499/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1414.%20%E5%92%8C%E4%B8%BA%20K%20%E7%9A%84%E6%9C%80%E5%B0%91%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0%E5%AD%97%E6%95%B0%E7%9B%AE.md,70.4%,中等,456 -1415,1400-1499,1415. 长度为 n 的开心字符串中字典序第 k 小的字符串,长度为 n 的开心字符串中字典序第 k 小的字符串,https://leetcode.cn/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/,the-k-th-lexicographical-string-of-all-happy-strings-of-length-n,字符串、回溯,https://algo.itcharge.cn/Solutions/1400-1499/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1415.%20%E9%95%BF%E5%BA%A6%E4%B8%BA%20n%20%E7%9A%84%E5%BC%80%E5%BF%83%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E5%AD%97%E5%85%B8%E5%BA%8F%E7%AC%AC%20k%20%E5%B0%8F%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2.md,68.6%,中等,238 -1416,1400-1499,1416. 恢复数组,恢复数组,https://leetcode.cn/problems/restore-the-array/,restore-the-array,字符串、动态规划,https://algo.itcharge.cn/Solutions/1400-1499/restore-the-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1416.%20%E6%81%A2%E5%A4%8D%E6%95%B0%E7%BB%84.md,42.7%,困难,81 -1417,1400-1499,1417. 重新格式化字符串,重新格式化字符串,https://leetcode.cn/problems/reformat-the-string/,reformat-the-string,字符串,https://algo.itcharge.cn/Solutions/1400-1499/reformat-the-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1417.%20%E9%87%8D%E6%96%B0%E6%A0%BC%E5%BC%8F%E5%8C%96%E5%AD%97%E7%AC%A6%E4%B8%B2.md,55.2%,简单,623 -1418,1400-1499,1418. 点菜展示表,点菜展示表,https://leetcode.cn/problems/display-table-of-food-orders-in-a-restaurant/,display-table-of-food-orders-in-a-restaurant,数组、哈希表、字符串、有序集合、排序,https://algo.itcharge.cn/Solutions/1400-1499/display-table-of-food-orders-in-a-restaurant/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1418.%20%E7%82%B9%E8%8F%9C%E5%B1%95%E7%A4%BA%E8%A1%A8.md,73.1%,中等,454 -1419,1400-1499,1419. 数青蛙,数青蛙,https://leetcode.cn/problems/minimum-number-of-frogs-croaking/,minimum-number-of-frogs-croaking,字符串、计数,https://algo.itcharge.cn/Solutions/1400-1499/minimum-number-of-frogs-croaking/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1419.%20%E6%95%B0%E9%9D%92%E8%9B%99.md,50.2%,中等,438 -1420,1400-1499,1420. 生成数组,生成数组,https://leetcode.cn/problems/build-array-where-you-can-find-the-maximum-exactly-k-comparisons/,build-array-where-you-can-find-the-maximum-exactly-k-comparisons,动态规划、前缀和,https://algo.itcharge.cn/Solutions/1400-1499/build-array-where-you-can-find-the-maximum-exactly-k-comparisons/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1420.%20%E7%94%9F%E6%88%90%E6%95%B0%E7%BB%84.md,63.6%,困难,68 -1421,1400-1499,1421. 净现值查询,净现值查询,https://leetcode.cn/problems/npv-queries/,npv-queries,数据库,https://algo.itcharge.cn/Solutions/1400-1499/npv-queries/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1421.%20%E5%87%80%E7%8E%B0%E5%80%BC%E6%9F%A5%E8%AF%A2.md,70.9%,简单,49 -1422,1400-1499,1422. 分割字符串的最大得分,分割字符串的最大得分,https://leetcode.cn/problems/maximum-score-after-splitting-a-string/,maximum-score-after-splitting-a-string,字符串,https://algo.itcharge.cn/Solutions/1400-1499/maximum-score-after-splitting-a-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1422.%20%E5%88%86%E5%89%B2%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%9C%80%E5%A4%A7%E5%BE%97%E5%88%86.md,56.8%,简单,687 -1423,1400-1499,1423. 可获得的最大点数,可获得的最大点数,https://leetcode.cn/problems/maximum-points-you-can-obtain-from-cards/,maximum-points-you-can-obtain-from-cards,数组、前缀和、滑动窗口,https://algo.itcharge.cn/Solutions/1400-1499/maximum-points-you-can-obtain-from-cards/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1423.%20%E5%8F%AF%E8%8E%B7%E5%BE%97%E7%9A%84%E6%9C%80%E5%A4%A7%E7%82%B9%E6%95%B0.md,55.0%,中等,650 -1424,1400-1499,1424. 对角线遍历 II,对角线遍历 II,https://leetcode.cn/problems/diagonal-traverse-ii/,diagonal-traverse-ii,数组、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/1400-1499/diagonal-traverse-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1424.%20%E5%AF%B9%E8%A7%92%E7%BA%BF%E9%81%8D%E5%8E%86%20II.md,42.2%,中等,211 -1425,1400-1499,1425. 带限制的子序列和,带限制的子序列和,https://leetcode.cn/problems/constrained-subsequence-sum/,constrained-subsequence-sum,队列、数组、动态规划、滑动窗口、单调队列、堆（优先队列）,https://algo.itcharge.cn/Solutions/1400-1499/constrained-subsequence-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1425.%20%E5%B8%A6%E9%99%90%E5%88%B6%E7%9A%84%E5%AD%90%E5%BA%8F%E5%88%97%E5%92%8C.md,47.5%,困难,116 -1426,1400-1499,1426. 数元素,数元素,https://leetcode.cn/problems/counting-elements/,counting-elements,数组、哈希表,https://algo.itcharge.cn/Solutions/1400-1499/counting-elements/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1426.%20%E6%95%B0%E5%85%83%E7%B4%A0.md,69.7%,简单,83 -1427,1400-1499,1427. 字符串的左右移,字符串的左右移,https://leetcode.cn/problems/perform-string-shifts/,perform-string-shifts,数组、数学、字符串,https://algo.itcharge.cn/Solutions/1400-1499/perform-string-shifts/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1427.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E5%B7%A6%E5%8F%B3%E7%A7%BB.md,58.7%,简单,131 -1428,1400-1499,1428. 至少有一个 1 的最左端列,至少有一个 1 的最左端列,https://leetcode.cn/problems/leftmost-column-with-at-least-a-one/,leftmost-column-with-at-least-a-one,数组、二分查找、交互、矩阵,https://algo.itcharge.cn/Solutions/1400-1499/leftmost-column-with-at-least-a-one/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1428.%20%E8%87%B3%E5%B0%91%E6%9C%89%E4%B8%80%E4%B8%AA%201%20%E7%9A%84%E6%9C%80%E5%B7%A6%E7%AB%AF%E5%88%97.md,61.4%,中等,38 -1429,1400-1499,1429. 第一个唯一数字,第一个唯一数字,https://leetcode.cn/problems/first-unique-number/,first-unique-number,设计、队列、数组、哈希表、数据流,https://algo.itcharge.cn/Solutions/1400-1499/first-unique-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1429.%20%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%94%AF%E4%B8%80%E6%95%B0%E5%AD%97.md,53.3%,中等,85 -1430,1400-1499,1430. 判断给定的序列是否是二叉树从根到叶的路径,判断给定的序列是否是二叉树从根到叶的路径,https://leetcode.cn/problems/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree/,check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/1400-1499/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1430.%20%E5%88%A4%E6%96%AD%E7%BB%99%E5%AE%9A%E7%9A%84%E5%BA%8F%E5%88%97%E6%98%AF%E5%90%A6%E6%98%AF%E4%BA%8C%E5%8F%89%E6%A0%91%E4%BB%8E%E6%A0%B9%E5%88%B0%E5%8F%B6%E7%9A%84%E8%B7%AF%E5%BE%84.md,54.6%,中等,54 -1431,1400-1499,1431. 拥有最多糖果的孩子,拥有最多糖果的孩子,https://leetcode.cn/problems/kids-with-the-greatest-number-of-candies/,kids-with-the-greatest-number-of-candies,数组,https://algo.itcharge.cn/Solutions/1400-1499/kids-with-the-greatest-number-of-candies/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1431.%20%E6%8B%A5%E6%9C%89%E6%9C%80%E5%A4%9A%E7%B3%96%E6%9E%9C%E7%9A%84%E5%AD%A9%E5%AD%90.md,84.6%,简单,1215 -1432,1400-1499,1432. 改变一个整数能得到的最大差值,改变一个整数能得到的最大差值,https://leetcode.cn/problems/max-difference-you-can-get-from-changing-an-integer/,max-difference-you-can-get-from-changing-an-integer,贪心、数学,https://algo.itcharge.cn/Solutions/1400-1499/max-difference-you-can-get-from-changing-an-integer/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1432.%20%E6%94%B9%E5%8F%98%E4%B8%80%E4%B8%AA%E6%95%B4%E6%95%B0%E8%83%BD%E5%BE%97%E5%88%B0%E7%9A%84%E6%9C%80%E5%A4%A7%E5%B7%AE%E5%80%BC.md,39.9%,中等,137 -1433,1400-1499,1433. 检查一个字符串是否可以打破另一个字符串,检查一个字符串是否可以打破另一个字符串,https://leetcode.cn/problems/check-if-a-string-can-break-another-string/,check-if-a-string-can-break-another-string,贪心、字符串、排序,https://algo.itcharge.cn/Solutions/1400-1499/check-if-a-string-can-break-another-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1433.%20%E6%A3%80%E6%9F%A5%E4%B8%80%E4%B8%AA%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%98%AF%E5%90%A6%E5%8F%AF%E4%BB%A5%E6%89%93%E7%A0%B4%E5%8F%A6%E4%B8%80%E4%B8%AA%E5%AD%97%E7%AC%A6%E4%B8%B2.md,64.7%,中等,148 -1434,1400-1499,1434. 每个人戴不同帽子的方案数,每个人戴不同帽子的方案数,https://leetcode.cn/problems/number-of-ways-to-wear-different-hats-to-each-other/,number-of-ways-to-wear-different-hats-to-each-other,位运算、数组、动态规划、状态压缩,https://algo.itcharge.cn/Solutions/1400-1499/number-of-ways-to-wear-different-hats-to-each-other/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1434.%20%E6%AF%8F%E4%B8%AA%E4%BA%BA%E6%88%B4%E4%B8%8D%E5%90%8C%E5%B8%BD%E5%AD%90%E7%9A%84%E6%96%B9%E6%A1%88%E6%95%B0.md,51.7%,困难,72 -1435,1400-1499,1435. 制作会话柱状图,制作会话柱状图,https://leetcode.cn/problems/create-a-session-bar-chart/,create-a-session-bar-chart,数据库,https://algo.itcharge.cn/Solutions/1400-1499/create-a-session-bar-chart/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1435.%20%E5%88%B6%E4%BD%9C%E4%BC%9A%E8%AF%9D%E6%9F%B1%E7%8A%B6%E5%9B%BE.md,63.7%,简单,62 -1436,1400-1499,1436. 旅行终点站,旅行终点站,https://leetcode.cn/problems/destination-city/,destination-city,哈希表、字符串,https://algo.itcharge.cn/Solutions/1400-1499/destination-city/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1436.%20%E6%97%85%E8%A1%8C%E7%BB%88%E7%82%B9%E7%AB%99.md,81.8%,简单,766 -1437,1400-1499,1437. 是否所有 1 都至少相隔 k 个元素,是否所有 1 都至少相隔 k 个元素,https://leetcode.cn/problems/check-if-all-1s-are-at-least-length-k-places-away/,check-if-all-1s-are-at-least-length-k-places-away,数组,https://algo.itcharge.cn/Solutions/1400-1499/check-if-all-1s-are-at-least-length-k-places-away/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1437.%20%E6%98%AF%E5%90%A6%E6%89%80%E6%9C%89%201%20%E9%83%BD%E8%87%B3%E5%B0%91%E7%9B%B8%E9%9A%94%20k%20%E4%B8%AA%E5%85%83%E7%B4%A0.md,55.6%,简单,260 -1438,1400-1499,1438. 绝对差不超过限制的最长连续子数组,绝对差不超过限制的最长连续子数组,https://leetcode.cn/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/,longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit,队列、数组、有序集合、滑动窗口、单调队列、堆（优先队列）,https://algo.itcharge.cn/Solutions/1400-1499/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1438.%20%E7%BB%9D%E5%AF%B9%E5%B7%AE%E4%B8%8D%E8%B6%85%E8%BF%87%E9%99%90%E5%88%B6%E7%9A%84%E6%9C%80%E9%95%BF%E8%BF%9E%E7%BB%AD%E5%AD%90%E6%95%B0%E7%BB%84.md,49.6%,中等,586 -1439,1400-1499,1439. 有序矩阵中的第 k 个最小数组和,有序矩阵中的第 k 个最小数组和,https://leetcode.cn/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/,find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows,数组、二分查找、矩阵、堆（优先队列）,https://algo.itcharge.cn/Solutions/1400-1499/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1439.%20%E6%9C%89%E5%BA%8F%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E7%AC%AC%20k%20%E4%B8%AA%E6%9C%80%E5%B0%8F%E6%95%B0%E7%BB%84%E5%92%8C.md,66.6%,困难,136 -1440,1400-1499,1440. 计算布尔表达式的值,计算布尔表达式的值,https://leetcode.cn/problems/evaluate-boolean-expression/,evaluate-boolean-expression,数据库,https://algo.itcharge.cn/Solutions/1400-1499/evaluate-boolean-expression/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1440.%20%E8%AE%A1%E7%AE%97%E5%B8%83%E5%B0%94%E8%A1%A8%E8%BE%BE%E5%BC%8F%E7%9A%84%E5%80%BC.md,69.7%,中等,87 -1441,1400-1499,1441. 用栈操作构建数组,用栈操作构建数组,https://leetcode.cn/problems/build-an-array-with-stack-operations/,build-an-array-with-stack-operations,栈、数组、模拟,https://algo.itcharge.cn/Solutions/1400-1499/build-an-array-with-stack-operations/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1441.%20%E7%94%A8%E6%A0%88%E6%93%8D%E4%BD%9C%E6%9E%84%E5%BB%BA%E6%95%B0%E7%BB%84.md,71.5%,中等,899 -1442,1400-1499,1442. 形成两个异或相等数组的三元组数目,形成两个异或相等数组的三元组数目,https://leetcode.cn/problems/count-triplets-that-can-form-two-arrays-of-equal-xor/,count-triplets-that-can-form-two-arrays-of-equal-xor,位运算、数组、哈希表、数学、前缀和,https://algo.itcharge.cn/Solutions/1400-1499/count-triplets-that-can-form-two-arrays-of-equal-xor/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1442.%20%E5%BD%A2%E6%88%90%E4%B8%A4%E4%B8%AA%E5%BC%82%E6%88%96%E7%9B%B8%E7%AD%89%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%89%E5%85%83%E7%BB%84%E6%95%B0%E7%9B%AE.md,79.3%,中等,415 -1443,1400-1499,1443. 收集树上所有苹果的最少时间,收集树上所有苹果的最少时间,https://leetcode.cn/problems/minimum-time-to-collect-all-apples-in-a-tree/,minimum-time-to-collect-all-apples-in-a-tree,树、深度优先搜索、广度优先搜索、哈希表,https://algo.itcharge.cn/Solutions/1400-1499/minimum-time-to-collect-all-apples-in-a-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1443.%20%E6%94%B6%E9%9B%86%E6%A0%91%E4%B8%8A%E6%89%80%E6%9C%89%E8%8B%B9%E6%9E%9C%E7%9A%84%E6%9C%80%E5%B0%91%E6%97%B6%E9%97%B4.md,43.1%,中等,190 -1444,1400-1499,1444. 切披萨的方案数,切披萨的方案数,https://leetcode.cn/problems/number-of-ways-of-cutting-a-pizza/,number-of-ways-of-cutting-a-pizza,记忆化搜索、数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/1400-1499/number-of-ways-of-cutting-a-pizza/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1444.%20%E5%88%87%E6%8A%AB%E8%90%A8%E7%9A%84%E6%96%B9%E6%A1%88%E6%95%B0.md,54.3%,困难,99 -1445,1400-1499,1445. 苹果和桔子,苹果和桔子,https://leetcode.cn/problems/apples-oranges/,apples-oranges,数据库,https://algo.itcharge.cn/Solutions/1400-1499/apples-oranges/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1445.%20%E8%8B%B9%E6%9E%9C%E5%92%8C%E6%A1%94%E5%AD%90.md,84.1%,中等,130 -1446,1400-1499,1446. 连续字符,连续字符,https://leetcode.cn/problems/consecutive-characters/,consecutive-characters,字符串,https://algo.itcharge.cn/Solutions/1400-1499/consecutive-characters/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1446.%20%E8%BF%9E%E7%BB%AD%E5%AD%97%E7%AC%A6.md,60.3%,简单,795 -1447,1400-1499,1447. 最简分数,最简分数,https://leetcode.cn/problems/simplified-fractions/,simplified-fractions,数学、字符串、数论,https://algo.itcharge.cn/Solutions/1400-1499/simplified-fractions/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1447.%20%E6%9C%80%E7%AE%80%E5%88%86%E6%95%B0.md,67.5%,中等,529 -1448,1400-1499,1448. 统计二叉树中好节点的数目,统计二叉树中好节点的数目,https://leetcode.cn/problems/count-good-nodes-in-binary-tree/,count-good-nodes-in-binary-tree,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/1400-1499/count-good-nodes-in-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1448.%20%E7%BB%9F%E8%AE%A1%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E5%A5%BD%E8%8A%82%E7%82%B9%E7%9A%84%E6%95%B0%E7%9B%AE.md,71.6%,中等,316 -1449,1400-1499,1449. 数位成本和为目标值的最大数字,数位成本和为目标值的最大数字,https://leetcode.cn/problems/form-largest-integer-with-digits-that-add-up-to-target/,form-largest-integer-with-digits-that-add-up-to-target,数组、动态规划,https://algo.itcharge.cn/Solutions/1400-1499/form-largest-integer-with-digits-that-add-up-to-target/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1449.%20%E6%95%B0%E4%BD%8D%E6%88%90%E6%9C%AC%E5%92%8C%E4%B8%BA%E7%9B%AE%E6%A0%87%E5%80%BC%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E5%AD%97.md,62.3%,困难,232 -1450,1400-1499,1450. 在既定时间做作业的学生人数,在既定时间做作业的学生人数,https://leetcode.cn/problems/number-of-students-doing-homework-at-a-given-time/,number-of-students-doing-homework-at-a-given-time,数组,https://algo.itcharge.cn/Solutions/1400-1499/number-of-students-doing-homework-at-a-given-time/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1450.%20%E5%9C%A8%E6%97%A2%E5%AE%9A%E6%97%B6%E9%97%B4%E5%81%9A%E4%BD%9C%E4%B8%9A%E7%9A%84%E5%AD%A6%E7%94%9F%E4%BA%BA%E6%95%B0.md,82.4%,简单,687 -1451,1400-1499,1451. 重新排列句子中的单词,重新排列句子中的单词,https://leetcode.cn/problems/rearrange-words-in-a-sentence/,rearrange-words-in-a-sentence,字符串、排序,https://algo.itcharge.cn/Solutions/1400-1499/rearrange-words-in-a-sentence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1451.%20%E9%87%8D%E6%96%B0%E6%8E%92%E5%88%97%E5%8F%A5%E5%AD%90%E4%B8%AD%E7%9A%84%E5%8D%95%E8%AF%8D.md,54.0%,中等,213 -1452,1400-1499,1452. 收藏清单,收藏清单,https://leetcode.cn/problems/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list/,people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list,数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/1400-1499/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1452.%20%E6%94%B6%E8%97%8F%E6%B8%85%E5%8D%95.md,51.1%,中等,121 -1453,1400-1499,1453. 圆形靶内的最大飞镖数量,圆形靶内的最大飞镖数量,https://leetcode.cn/problems/maximum-number-of-darts-inside-of-a-circular-dartboard/,maximum-number-of-darts-inside-of-a-circular-dartboard,几何、数组、数学,https://algo.itcharge.cn/Solutions/1400-1499/maximum-number-of-darts-inside-of-a-circular-dartboard/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1453.%20%E5%9C%86%E5%BD%A2%E9%9D%B6%E5%86%85%E7%9A%84%E6%9C%80%E5%A4%A7%E9%A3%9E%E9%95%96%E6%95%B0%E9%87%8F.md,37.8%,困难,43 -1454,1400-1499,1454. 活跃用户,活跃用户,https://leetcode.cn/problems/active-users/,active-users,数据库,https://algo.itcharge.cn/Solutions/1400-1499/active-users/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1454.%20%E6%B4%BB%E8%B7%83%E7%94%A8%E6%88%B7.md,38.3%,中等,127 -1455,1400-1499,1455. 检查单词是否为句中其他单词的前缀,检查单词是否为句中其他单词的前缀,https://leetcode.cn/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence/,check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence,字符串、字符串匹配,https://algo.itcharge.cn/Solutions/1400-1499/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1455.%20%E6%A3%80%E6%9F%A5%E5%8D%95%E8%AF%8D%E6%98%AF%E5%90%A6%E4%B8%BA%E5%8F%A5%E4%B8%AD%E5%85%B6%E4%BB%96%E5%8D%95%E8%AF%8D%E7%9A%84%E5%89%8D%E7%BC%80.md,64.8%,简单,701 -1456,1400-1499,1456. 定长子串中元音的最大数目,定长子串中元音的最大数目,https://leetcode.cn/problems/maximum-number-of-vowels-in-a-substring-of-given-length/,maximum-number-of-vowels-in-a-substring-of-given-length,字符串、滑动窗口,https://algo.itcharge.cn/Solutions/1400-1499/maximum-number-of-vowels-in-a-substring-of-given-length/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1456.%20%E5%AE%9A%E9%95%BF%E5%AD%90%E4%B8%B2%E4%B8%AD%E5%85%83%E9%9F%B3%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E7%9B%AE.md,54.5%,中等,370 -1457,1400-1499,1457. 二叉树中的伪回文路径,二叉树中的伪回文路径,https://leetcode.cn/problems/pseudo-palindromic-paths-in-a-binary-tree/,pseudo-palindromic-paths-in-a-binary-tree,位运算、树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/1400-1499/pseudo-palindromic-paths-in-a-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1457.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E7%9A%84%E4%BC%AA%E5%9B%9E%E6%96%87%E8%B7%AF%E5%BE%84.md,62.1%,中等,187 -1458,1400-1499,1458. 两个子序列的最大点积,两个子序列的最大点积,https://leetcode.cn/problems/max-dot-product-of-two-subsequences/,max-dot-product-of-two-subsequences,数组、动态规划,https://algo.itcharge.cn/Solutions/1400-1499/max-dot-product-of-two-subsequences/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1458.%20%E4%B8%A4%E4%B8%AA%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E6%9C%80%E5%A4%A7%E7%82%B9%E7%A7%AF.md,46.8%,困难,125 -1459,1400-1499,1459. 矩形面积,矩形面积,https://leetcode.cn/problems/rectangles-area/,rectangles-area,数据库,https://algo.itcharge.cn/Solutions/1400-1499/rectangles-area/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1459.%20%E7%9F%A9%E5%BD%A2%E9%9D%A2%E7%A7%AF.md,62.7%,中等,98 -1460,1400-1499,1460. 通过翻转子数组使两个数组相等,通过翻转子数组使两个数组相等,https://leetcode.cn/problems/make-two-arrays-equal-by-reversing-subarrays/,make-two-arrays-equal-by-reversing-subarrays,数组、哈希表、排序,https://algo.itcharge.cn/Solutions/1400-1499/make-two-arrays-equal-by-reversing-subarrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1460.%20%E9%80%9A%E8%BF%87%E7%BF%BB%E8%BD%AC%E5%AD%90%E6%95%B0%E7%BB%84%E4%BD%BF%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E7%9B%B8%E7%AD%89.md,77.2%,简单,755 -1461,1400-1499,1461. 检查一个字符串是否包含所有长度为 K 的二进制子串,检查一个字符串是否包含所有长度为 K 的二进制子串,https://leetcode.cn/problems/check-if-a-string-contains-all-binary-codes-of-size-k/,check-if-a-string-contains-all-binary-codes-of-size-k,位运算、哈希表、字符串、哈希函数、滚动哈希,https://algo.itcharge.cn/Solutions/1400-1499/check-if-a-string-contains-all-binary-codes-of-size-k/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1461.%20%E6%A3%80%E6%9F%A5%E4%B8%80%E4%B8%AA%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%98%AF%E5%90%A6%E5%8C%85%E5%90%AB%E6%89%80%E6%9C%89%E9%95%BF%E5%BA%A6%E4%B8%BA%20K%20%E7%9A%84%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%AD%90%E4%B8%B2.md,52.6%,中等,132 -1462,1400-1499,1462. 课程表 IV,课程表 IV,https://leetcode.cn/problems/course-schedule-iv/,course-schedule-iv,深度优先搜索、广度优先搜索、图、拓扑排序,https://algo.itcharge.cn/Solutions/1400-1499/course-schedule-iv/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1462.%20%E8%AF%BE%E7%A8%8B%E8%A1%A8%20IV.md,45.8%,中等,220 -1463,1400-1499,1463. 摘樱桃 II,摘樱桃 II,https://leetcode.cn/problems/cherry-pickup-ii/,cherry-pickup-ii,数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/1400-1499/cherry-pickup-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1463.%20%E6%91%98%E6%A8%B1%E6%A1%83%20II.md,62.1%,困难,104 -1464,1400-1499,1464. 数组中两元素的最大乘积,数组中两元素的最大乘积,https://leetcode.cn/problems/maximum-product-of-two-elements-in-an-array/,maximum-product-of-two-elements-in-an-array,数组、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/1400-1499/maximum-product-of-two-elements-in-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1464.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E4%B8%A4%E5%85%83%E7%B4%A0%E7%9A%84%E6%9C%80%E5%A4%A7%E4%B9%98%E7%A7%AF.md,78.6%,简单,859 -1465,1400-1499,1465. 切割后面积最大的蛋糕,切割后面积最大的蛋糕,https://leetcode.cn/problems/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/,maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts,贪心、数组、排序,https://algo.itcharge.cn/Solutions/1400-1499/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1465.%20%E5%88%87%E5%89%B2%E5%90%8E%E9%9D%A2%E7%A7%AF%E6%9C%80%E5%A4%A7%E7%9A%84%E8%9B%8B%E7%B3%95.md,32.8%,中等,106 -1466,1400-1499,1466. 重新规划路线,重新规划路线,https://leetcode.cn/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/,reorder-routes-to-make-all-paths-lead-to-the-city-zero,深度优先搜索、广度优先搜索、图,https://algo.itcharge.cn/Solutions/1400-1499/reorder-routes-to-make-all-paths-lead-to-the-city-zero/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1466.%20%E9%87%8D%E6%96%B0%E8%A7%84%E5%88%92%E8%B7%AF%E7%BA%BF.md,51.1%,中等,231 -1467,1400-1499,1467. 两个盒子中球的颜色数相同的概率,两个盒子中球的颜色数相同的概率,https://leetcode.cn/problems/probability-of-a-two-boxes-having-the-same-number-of-distinct-balls/,probability-of-a-two-boxes-having-the-same-number-of-distinct-balls,数组、数学、动态规划、回溯、组合数学、概率与统计,https://algo.itcharge.cn/Solutions/1400-1499/probability-of-a-two-boxes-having-the-same-number-of-distinct-balls/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1467.%20%E4%B8%A4%E4%B8%AA%E7%9B%92%E5%AD%90%E4%B8%AD%E7%90%83%E7%9A%84%E9%A2%9C%E8%89%B2%E6%95%B0%E7%9B%B8%E5%90%8C%E7%9A%84%E6%A6%82%E7%8E%87.md,63.1%,困难,68 -1468,1400-1499,1468. 计算税后工资,计算税后工资,https://leetcode.cn/problems/calculate-salaries/,calculate-salaries,数据库,https://algo.itcharge.cn/Solutions/1400-1499/calculate-salaries/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1468.%20%E8%AE%A1%E7%AE%97%E7%A8%8E%E5%90%8E%E5%B7%A5%E8%B5%84.md,70.0%,中等,65 -1469,1400-1499,1469. 寻找所有的独生节点,寻找所有的独生节点,https://leetcode.cn/problems/find-all-the-lonely-nodes/,find-all-the-lonely-nodes,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/1400-1499/find-all-the-lonely-nodes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1469.%20%E5%AF%BB%E6%89%BE%E6%89%80%E6%9C%89%E7%9A%84%E7%8B%AC%E7%94%9F%E8%8A%82%E7%82%B9.md,82.2%,简单,138 -1470,1400-1499,1470. 重新排列数组,重新排列数组,https://leetcode.cn/problems/shuffle-the-array/,shuffle-the-array,数组,https://algo.itcharge.cn/Solutions/1400-1499/shuffle-the-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1470.%20%E9%87%8D%E6%96%B0%E6%8E%92%E5%88%97%E6%95%B0%E7%BB%84.md,84.9%,简单,1150 -1471,1400-1499,1471. 数组中的 k 个最强值,数组中的 k 个最强值,https://leetcode.cn/problems/the-k-strongest-values-in-an-array/,the-k-strongest-values-in-an-array,数组、双指针、排序,https://algo.itcharge.cn/Solutions/1400-1499/the-k-strongest-values-in-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1471.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%20k%20%E4%B8%AA%E6%9C%80%E5%BC%BA%E5%80%BC.md,55.5%,中等,144 -1472,1400-1499,1472. 设计浏览器历史记录,设计浏览器历史记录,https://leetcode.cn/problems/design-browser-history/,design-browser-history,栈、设计、数组、链表、数据流、双向链表,https://algo.itcharge.cn/Solutions/1400-1499/design-browser-history/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1472.%20%E8%AE%BE%E8%AE%A1%E6%B5%8F%E8%A7%88%E5%99%A8%E5%8E%86%E5%8F%B2%E8%AE%B0%E5%BD%95.md,61.5%,中等,258 -1473,1400-1499,1473. 粉刷房子 III,粉刷房子 III,https://leetcode.cn/problems/paint-house-iii/,paint-house-iii,数组、动态规划,https://algo.itcharge.cn/Solutions/1400-1499/paint-house-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1473.%20%E7%B2%89%E5%88%B7%E6%88%BF%E5%AD%90%20III.md,66.3%,困难,192 -1474,1400-1499,1474. 删除链表 M 个节点之后的 N 个节点,删除链表 M 个节点之后的 N 个节点,https://leetcode.cn/problems/delete-n-nodes-after-m-nodes-of-a-linked-list/,delete-n-nodes-after-m-nodes-of-a-linked-list,链表,https://algo.itcharge.cn/Solutions/1400-1499/delete-n-nodes-after-m-nodes-of-a-linked-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1474.%20%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%20M%20%E4%B8%AA%E8%8A%82%E7%82%B9%E4%B9%8B%E5%90%8E%E7%9A%84%20N%20%E4%B8%AA%E8%8A%82%E7%82%B9.md,69.0%,简单,105 -1475,1400-1499,1475. 商品折扣后的最终价格,商品折扣后的最终价格,https://leetcode.cn/problems/final-prices-with-a-special-discount-in-a-shop/,final-prices-with-a-special-discount-in-a-shop,栈、数组、单调栈,https://algo.itcharge.cn/Solutions/1400-1499/final-prices-with-a-special-discount-in-a-shop/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1475.%20%E5%95%86%E5%93%81%E6%8A%98%E6%89%A3%E5%90%8E%E7%9A%84%E6%9C%80%E7%BB%88%E4%BB%B7%E6%A0%BC.md,73.3%,简单,858 -1476,1400-1499,1476. 子矩形查询,子矩形查询,https://leetcode.cn/problems/subrectangle-queries/,subrectangle-queries,设计、数组、矩阵,https://algo.itcharge.cn/Solutions/1400-1499/subrectangle-queries/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1476.%20%E5%AD%90%E7%9F%A9%E5%BD%A2%E6%9F%A5%E8%AF%A2.md,86.6%,中等,147 -1477,1400-1499,1477. 找两个和为目标值且不重叠的子数组,找两个和为目标值且不重叠的子数组,https://leetcode.cn/problems/find-two-non-overlapping-sub-arrays-each-with-target-sum/,find-two-non-overlapping-sub-arrays-each-with-target-sum,数组、哈希表、二分查找、动态规划、滑动窗口,https://algo.itcharge.cn/Solutions/1400-1499/find-two-non-overlapping-sub-arrays-each-with-target-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1477.%20%E6%89%BE%E4%B8%A4%E4%B8%AA%E5%92%8C%E4%B8%BA%E7%9B%AE%E6%A0%87%E5%80%BC%E4%B8%94%E4%B8%8D%E9%87%8D%E5%8F%A0%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md,31.2%,中等,146 -1478,1400-1499,1478. 安排邮筒,安排邮筒,https://leetcode.cn/problems/allocate-mailboxes/,allocate-mailboxes,数组、数学、动态规划、排序,https://algo.itcharge.cn/Solutions/1400-1499/allocate-mailboxes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1478.%20%E5%AE%89%E6%8E%92%E9%82%AE%E7%AD%92.md,62.7%,困难,97 -1479,1400-1499,1479. 周内每天的销售情况,周内每天的销售情况,https://leetcode.cn/problems/sales-by-day-of-the-week/,sales-by-day-of-the-week,数据库,https://algo.itcharge.cn/Solutions/1400-1499/sales-by-day-of-the-week/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1479.%20%E5%91%A8%E5%86%85%E6%AF%8F%E5%A4%A9%E7%9A%84%E9%94%80%E5%94%AE%E6%83%85%E5%86%B5.md,55.7%,困难,64 -1480,1400-1499,1480. 一维数组的动态和,一维数组的动态和,https://leetcode.cn/problems/running-sum-of-1d-array/,running-sum-of-1d-array,数组、前缀和,https://algo.itcharge.cn/Solutions/1400-1499/running-sum-of-1d-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1480.%20%E4%B8%80%E7%BB%B4%E6%95%B0%E7%BB%84%E7%9A%84%E5%8A%A8%E6%80%81%E5%92%8C.md,76.5%,简单,2514 -1481,1400-1499,1481. 不同整数的最少数目,不同整数的最少数目,https://leetcode.cn/problems/least-number-of-unique-integers-after-k-removals/,least-number-of-unique-integers-after-k-removals,贪心、数组、哈希表、计数、排序,https://algo.itcharge.cn/Solutions/1400-1499/least-number-of-unique-integers-after-k-removals/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1481.%20%E4%B8%8D%E5%90%8C%E6%95%B4%E6%95%B0%E7%9A%84%E6%9C%80%E5%B0%91%E6%95%B0%E7%9B%AE.md,45.2%,中等,253 -1482,1400-1499,1482. 制作 m 束花所需的最少天数,制作 m 束花所需的最少天数,https://leetcode.cn/problems/minimum-number-of-days-to-make-m-bouquets/,minimum-number-of-days-to-make-m-bouquets,数组、二分查找,https://algo.itcharge.cn/Solutions/1400-1499/minimum-number-of-days-to-make-m-bouquets/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1482.%20%E5%88%B6%E4%BD%9C%20m%20%E6%9D%9F%E8%8A%B1%E6%89%80%E9%9C%80%E7%9A%84%E6%9C%80%E5%B0%91%E5%A4%A9%E6%95%B0.md,56.8%,中等,507 -1483,1400-1499,1483. 树节点的第 K 个祖先,树节点的第 K 个祖先,https://leetcode.cn/problems/kth-ancestor-of-a-tree-node/,kth-ancestor-of-a-tree-node,树、深度优先搜索、广度优先搜索、设计、二分查找,https://algo.itcharge.cn/Solutions/1400-1499/kth-ancestor-of-a-tree-node/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1483.%20%E6%A0%91%E8%8A%82%E7%82%B9%E7%9A%84%E7%AC%AC%20K%20%E4%B8%AA%E7%A5%96%E5%85%88.md,44.9%,困难,157 -1484,1400-1499,1484. 按日期分组销售产品,按日期分组销售产品,https://leetcode.cn/problems/group-sold-products-by-the-date/,group-sold-products-by-the-date,数据库,https://algo.itcharge.cn/Solutions/1400-1499/group-sold-products-by-the-date/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1484.%20%E6%8C%89%E6%97%A5%E6%9C%9F%E5%88%86%E7%BB%84%E9%94%80%E5%94%AE%E4%BA%A7%E5%93%81.md,67.7%,简单,300 -1485,1400-1499,1485. 克隆含随机指针的二叉树,克隆含随机指针的二叉树,https://leetcode.cn/problems/clone-binary-tree-with-random-pointer/,clone-binary-tree-with-random-pointer,树、深度优先搜索、广度优先搜索、哈希表、二叉树,https://algo.itcharge.cn/Solutions/1400-1499/clone-binary-tree-with-random-pointer/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1485.%20%E5%85%8B%E9%9A%86%E5%90%AB%E9%9A%8F%E6%9C%BA%E6%8C%87%E9%92%88%E7%9A%84%E4%BA%8C%E5%8F%89%E6%A0%91.md,78.5%,中等,39 -1486,1400-1499,1486. 数组异或操作,数组异或操作,https://leetcode.cn/problems/xor-operation-in-an-array/,xor-operation-in-an-array,位运算、数学,https://algo.itcharge.cn/Solutions/1400-1499/xor-operation-in-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1486.%20%E6%95%B0%E7%BB%84%E5%BC%82%E6%88%96%E6%93%8D%E4%BD%9C.md,85.5%,简单,796 -1487,1400-1499,1487. 保证文件名唯一,保证文件名唯一,https://leetcode.cn/problems/making-file-names-unique/,making-file-names-unique,数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/1400-1499/making-file-names-unique/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1487.%20%E4%BF%9D%E8%AF%81%E6%96%87%E4%BB%B6%E5%90%8D%E5%94%AF%E4%B8%80.md,41.5%,中等,336 -1488,1400-1499,1488. 避免洪水泛滥,避免洪水泛滥,https://leetcode.cn/problems/avoid-flood-in-the-city/,avoid-flood-in-the-city,贪心、数组、哈希表、二分查找、堆（优先队列）,https://algo.itcharge.cn/Solutions/1400-1499/avoid-flood-in-the-city/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1488.%20%E9%81%BF%E5%85%8D%E6%B4%AA%E6%B0%B4%E6%B3%9B%E6%BB%A5.md,26.3%,中等,172 -1489,1400-1499,1489. 找到最小生成树里的关键边和伪关键边,找到最小生成树里的关键边和伪关键边,https://leetcode.cn/problems/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree/,find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree,并查集、图、最小生成树、排序、强连通分量,https://algo.itcharge.cn/Solutions/1400-1499/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1489.%20%E6%89%BE%E5%88%B0%E6%9C%80%E5%B0%8F%E7%94%9F%E6%88%90%E6%A0%91%E9%87%8C%E7%9A%84%E5%85%B3%E9%94%AE%E8%BE%B9%E5%92%8C%E4%BC%AA%E5%85%B3%E9%94%AE%E8%BE%B9.md,66.5%,困难,150 -1490,1400-1499,1490. 克隆 N 叉树,克隆 N 叉树,https://leetcode.cn/problems/clone-n-ary-tree/,clone-n-ary-tree,树、深度优先搜索、广度优先搜索、哈希表,https://algo.itcharge.cn/Solutions/1400-1499/clone-n-ary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1490.%20%E5%85%8B%E9%9A%86%20N%20%E5%8F%89%E6%A0%91.md,83.6%,中等,51 -1491,1400-1499,1491. 去掉最低工资和最高工资后的工资平均值,去掉最低工资和最高工资后的工资平均值,https://leetcode.cn/problems/average-salary-excluding-the-minimum-and-maximum-salary/,average-salary-excluding-the-minimum-and-maximum-salary,数组、排序,https://algo.itcharge.cn/Solutions/1400-1499/average-salary-excluding-the-minimum-and-maximum-salary/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1491.%20%E5%8E%BB%E6%8E%89%E6%9C%80%E4%BD%8E%E5%B7%A5%E8%B5%84%E5%92%8C%E6%9C%80%E9%AB%98%E5%B7%A5%E8%B5%84%E5%90%8E%E7%9A%84%E5%B7%A5%E8%B5%84%E5%B9%B3%E5%9D%87%E5%80%BC.md,62.7%,简单,700 -1492,1400-1499,1492. n 的第 k 个因子,n 的第 k 个因子,https://leetcode.cn/problems/the-kth-factor-of-n/,the-kth-factor-of-n,数学、数论,https://algo.itcharge.cn/Solutions/1400-1499/the-kth-factor-of-n/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1492.%20n%20%E7%9A%84%E7%AC%AC%20k%20%E4%B8%AA%E5%9B%A0%E5%AD%90.md,60.8%,中等,158 -1493,1400-1499,1493. 删掉一个元素以后全为 1 的最长子数组,删掉一个元素以后全为 1 的最长子数组,https://leetcode.cn/problems/longest-subarray-of-1s-after-deleting-one-element/,longest-subarray-of-1s-after-deleting-one-element,数组、动态规划、滑动窗口,https://algo.itcharge.cn/Solutions/1400-1499/longest-subarray-of-1s-after-deleting-one-element/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1493.%20%E5%88%A0%E6%8E%89%E4%B8%80%E4%B8%AA%E5%85%83%E7%B4%A0%E4%BB%A5%E5%90%8E%E5%85%A8%E4%B8%BA%201%20%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E6%95%B0%E7%BB%84.md,59.5%,中等,318 -1494,1400-1499,1494. 并行课程 II,并行课程 II,https://leetcode.cn/problems/parallel-courses-ii/,parallel-courses-ii,位运算、图、动态规划、状态压缩,https://algo.itcharge.cn/Solutions/1400-1499/parallel-courses-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1494.%20%E5%B9%B6%E8%A1%8C%E8%AF%BE%E7%A8%8B%20II.md,51.8%,困难,99 -1495,1400-1499,1495. 上月播放的儿童适宜电影,上月播放的儿童适宜电影,https://leetcode.cn/problems/friendly-movies-streamed-last-month/,friendly-movies-streamed-last-month,数据库,https://algo.itcharge.cn/Solutions/1400-1499/friendly-movies-streamed-last-month/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1495.%20%E4%B8%8A%E6%9C%88%E6%92%AD%E6%94%BE%E7%9A%84%E5%84%BF%E7%AB%A5%E9%80%82%E5%AE%9C%E7%94%B5%E5%BD%B1.md,53.6%,简单,50 -1496,1400-1499,1496. 判断路径是否相交,判断路径是否相交,https://leetcode.cn/problems/path-crossing/,path-crossing,哈希表、字符串,https://algo.itcharge.cn/Solutions/1400-1499/path-crossing/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1496.%20%E5%88%A4%E6%96%AD%E8%B7%AF%E5%BE%84%E6%98%AF%E5%90%A6%E7%9B%B8%E4%BA%A4.md,53.5%,简单,249 -1497,1400-1499,1497. 检查数组对是否可以被 k 整除,检查数组对是否可以被 k 整除,https://leetcode.cn/problems/check-if-array-pairs-are-divisible-by-k/,check-if-array-pairs-are-divisible-by-k,数组、哈希表、计数,https://algo.itcharge.cn/Solutions/1400-1499/check-if-array-pairs-are-divisible-by-k/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1497.%20%E6%A3%80%E6%9F%A5%E6%95%B0%E7%BB%84%E5%AF%B9%E6%98%AF%E5%90%A6%E5%8F%AF%E4%BB%A5%E8%A2%AB%20k%20%E6%95%B4%E9%99%A4.md,40.1%,中等,151 -1498,1400-1499,1498. 满足条件的子序列数目,满足条件的子序列数目,https://leetcode.cn/problems/number-of-subsequences-that-satisfy-the-given-sum-condition/,number-of-subsequences-that-satisfy-the-given-sum-condition,数组、双指针、二分查找、排序,https://algo.itcharge.cn/Solutions/1400-1499/number-of-subsequences-that-satisfy-the-given-sum-condition/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1498.%20%E6%BB%A1%E8%B6%B3%E6%9D%A1%E4%BB%B6%E7%9A%84%E5%AD%90%E5%BA%8F%E5%88%97%E6%95%B0%E7%9B%AE.md,38.2%,中等,132 -1499,1400-1499,1499. 满足不等式的最大值,满足不等式的最大值,https://leetcode.cn/problems/max-value-of-equation/,max-value-of-equation,队列、数组、滑动窗口、单调队列、堆（优先队列）,https://algo.itcharge.cn/Solutions/1400-1499/max-value-of-equation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1499.%20%E6%BB%A1%E8%B6%B3%E4%B8%8D%E7%AD%89%E5%BC%8F%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md,40.9%,困难,93 -1500,1500-1599,1500. 设计文件分享系统,设计文件分享系统,https://leetcode.cn/problems/design-a-file-sharing-system/,design-a-file-sharing-system,设计、哈希表、数据流、堆（优先队列）,https://algo.itcharge.cn/Solutions/1500-1599/design-a-file-sharing-system/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1500.%20%E8%AE%BE%E8%AE%A1%E6%96%87%E4%BB%B6%E5%88%86%E4%BA%AB%E7%B3%BB%E7%BB%9F.md,29.8%,中等,51 -1501,1500-1599,1501. 可以放心投资的国家,可以放心投资的国家,https://leetcode.cn/problems/countries-you-can-safely-invest-in/,countries-you-can-safely-invest-in,数据库,https://algo.itcharge.cn/Solutions/1500-1599/countries-you-can-safely-invest-in/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1501.%20%E5%8F%AF%E4%BB%A5%E6%94%BE%E5%BF%83%E6%8A%95%E8%B5%84%E7%9A%84%E5%9B%BD%E5%AE%B6.md,58.5%,中等,146 -1502,1500-1599,1502. 判断能否形成等差数列,判断能否形成等差数列,https://leetcode.cn/problems/can-make-arithmetic-progression-from-sequence/,can-make-arithmetic-progression-from-sequence,数组、排序,https://algo.itcharge.cn/Solutions/1500-1599/can-make-arithmetic-progression-from-sequence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1502.%20%E5%88%A4%E6%96%AD%E8%83%BD%E5%90%A6%E5%BD%A2%E6%88%90%E7%AD%89%E5%B7%AE%E6%95%B0%E5%88%97.md,69.4%,简单,593 -1503,1500-1599,1503. 所有蚂蚁掉下来前的最后一刻,所有蚂蚁掉下来前的最后一刻,https://leetcode.cn/problems/last-moment-before-all-ants-fall-out-of-a-plank/,last-moment-before-all-ants-fall-out-of-a-plank,脑筋急转弯、数组、模拟,https://algo.itcharge.cn/Solutions/1500-1599/last-moment-before-all-ants-fall-out-of-a-plank/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1503.%20%E6%89%80%E6%9C%89%E8%9A%82%E8%9A%81%E6%8E%89%E4%B8%8B%E6%9D%A5%E5%89%8D%E7%9A%84%E6%9C%80%E5%90%8E%E4%B8%80%E5%88%BB.md,53.7%,中等,119 -1504,1500-1599,1504. 统计全 1 子矩形,统计全 1 子矩形,https://leetcode.cn/problems/count-submatrices-with-all-ones/,count-submatrices-with-all-ones,栈、数组、动态规划、矩阵、单调栈,https://algo.itcharge.cn/Solutions/1500-1599/count-submatrices-with-all-ones/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1504.%20%E7%BB%9F%E8%AE%A1%E5%85%A8%201%20%E5%AD%90%E7%9F%A9%E5%BD%A2.md,62.4%,中等,173 -1505,1500-1599,1505. 最多 K 次交换相邻数位后得到的最小整数,最多 K 次交换相邻数位后得到的最小整数,https://leetcode.cn/problems/minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits/,minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits,贪心、树状数组、线段树、字符串,https://algo.itcharge.cn/Solutions/1500-1599/minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1505.%20%E6%9C%80%E5%A4%9A%20K%20%E6%AC%A1%E4%BA%A4%E6%8D%A2%E7%9B%B8%E9%82%BB%E6%95%B0%E4%BD%8D%E5%90%8E%E5%BE%97%E5%88%B0%E7%9A%84%E6%9C%80%E5%B0%8F%E6%95%B4%E6%95%B0.md,39.8%,困难,95 -1506,1500-1599,1506. 找到 N 叉树的根节点,找到 N 叉树的根节点,https://leetcode.cn/problems/find-root-of-n-ary-tree/,find-root-of-n-ary-tree,位运算、树、深度优先搜索、哈希表,https://algo.itcharge.cn/Solutions/1500-1599/find-root-of-n-ary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1506.%20%E6%89%BE%E5%88%B0%20N%20%E5%8F%89%E6%A0%91%E7%9A%84%E6%A0%B9%E8%8A%82%E7%82%B9.md,81.4%,中等,32 -1507,1500-1599,1507. 转变日期格式,转变日期格式,https://leetcode.cn/problems/reformat-date/,reformat-date,字符串,https://algo.itcharge.cn/Solutions/1500-1599/reformat-date/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1507.%20%E8%BD%AC%E5%8F%98%E6%97%A5%E6%9C%9F%E6%A0%BC%E5%BC%8F.md,58.9%,简单,211 -1508,1500-1599,1508. 子数组和排序后的区间和,子数组和排序后的区间和,https://leetcode.cn/problems/range-sum-of-sorted-subarray-sums/,range-sum-of-sorted-subarray-sums,数组、双指针、二分查找、排序,https://algo.itcharge.cn/Solutions/1500-1599/range-sum-of-sorted-subarray-sums/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1508.%20%E5%AD%90%E6%95%B0%E7%BB%84%E5%92%8C%E6%8E%92%E5%BA%8F%E5%90%8E%E7%9A%84%E5%8C%BA%E9%97%B4%E5%92%8C.md,57.7%,中等,114 -1509,1500-1599,1509. 三次操作后最大值与最小值的最小差,三次操作后最大值与最小值的最小差,https://leetcode.cn/problems/minimum-difference-between-largest-and-smallest-value-in-three-moves/,minimum-difference-between-largest-and-smallest-value-in-three-moves,贪心、数组、排序,https://algo.itcharge.cn/Solutions/1500-1599/minimum-difference-between-largest-and-smallest-value-in-three-moves/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1509.%20%E4%B8%89%E6%AC%A1%E6%93%8D%E4%BD%9C%E5%90%8E%E6%9C%80%E5%A4%A7%E5%80%BC%E4%B8%8E%E6%9C%80%E5%B0%8F%E5%80%BC%E7%9A%84%E6%9C%80%E5%B0%8F%E5%B7%AE.md,55.5%,中等,139 -1510,1500-1599,1510. 石子游戏 IV,石子游戏 IV,https://leetcode.cn/problems/stone-game-iv/,stone-game-iv,数学、动态规划、博弈,https://algo.itcharge.cn/Solutions/1500-1599/stone-game-iv/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1510.%20%E7%9F%B3%E5%AD%90%E6%B8%B8%E6%88%8F%20IV.md,60.2%,困难,105 -1511,1500-1599,1511. 消费者下单频率,消费者下单频率,https://leetcode.cn/problems/customer-order-frequency/,customer-order-frequency,数据库,https://algo.itcharge.cn/Solutions/1500-1599/customer-order-frequency/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1511.%20%E6%B6%88%E8%B4%B9%E8%80%85%E4%B8%8B%E5%8D%95%E9%A2%91%E7%8E%87.md,68.9%,简单,99 -1512,1500-1599,1512. 好数对的数目,好数对的数目,https://leetcode.cn/problems/number-of-good-pairs/,number-of-good-pairs,数组、哈希表、数学、计数,https://algo.itcharge.cn/Solutions/1500-1599/number-of-good-pairs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1512.%20%E5%A5%BD%E6%95%B0%E5%AF%B9%E7%9A%84%E6%95%B0%E7%9B%AE.md,84.4%,简单,967 -1513,1500-1599,1513. 仅含 1 的子串数,仅含 1 的子串数,https://leetcode.cn/problems/number-of-substrings-with-only-1s/,number-of-substrings-with-only-1s,数学、字符串,https://algo.itcharge.cn/Solutions/1500-1599/number-of-substrings-with-only-1s/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1513.%20%E4%BB%85%E5%90%AB%201%20%E7%9A%84%E5%AD%90%E4%B8%B2%E6%95%B0.md,39.5%,中等,201 -1514,1500-1599,1514. 概率最大的路径,概率最大的路径,https://leetcode.cn/problems/path-with-maximum-probability/,path-with-maximum-probability,图、数组、最短路、堆（优先队列）,https://algo.itcharge.cn/Solutions/1500-1599/path-with-maximum-probability/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1514.%20%E6%A6%82%E7%8E%87%E6%9C%80%E5%A4%A7%E7%9A%84%E8%B7%AF%E5%BE%84.md,40.7%,中等,265 -1515,1500-1599,1515. 服务中心的最佳位置,服务中心的最佳位置,https://leetcode.cn/problems/best-position-for-a-service-centre/,best-position-for-a-service-centre,几何、数学、随机化,https://algo.itcharge.cn/Solutions/1500-1599/best-position-for-a-service-centre/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1515.%20%E6%9C%8D%E5%8A%A1%E4%B8%AD%E5%BF%83%E7%9A%84%E6%9C%80%E4%BD%B3%E4%BD%8D%E7%BD%AE.md,35.2%,困难,72 -1516,1500-1599,1516. 移动 N 叉树的子树,移动 N 叉树的子树,https://leetcode.cn/problems/move-sub-tree-of-n-ary-tree/,move-sub-tree-of-n-ary-tree,树、深度优先搜索,https://algo.itcharge.cn/Solutions/1500-1599/move-sub-tree-of-n-ary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1516.%20%E7%A7%BB%E5%8A%A8%20N%20%E5%8F%89%E6%A0%91%E7%9A%84%E5%AD%90%E6%A0%91.md,55.9%,困难,18 -1517,1500-1599,1517. 查找拥有有效邮箱的用户,查找拥有有效邮箱的用户,https://leetcode.cn/problems/find-users-with-valid-e-mails/,find-users-with-valid-e-mails,数据库,https://algo.itcharge.cn/Solutions/1500-1599/find-users-with-valid-e-mails/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1517.%20%E6%9F%A5%E6%89%BE%E6%8B%A5%E6%9C%89%E6%9C%89%E6%95%88%E9%82%AE%E7%AE%B1%E7%9A%84%E7%94%A8%E6%88%B7.md,50.4%,简单,66 -1518,1500-1599,1518. 换水问题,换水问题,https://leetcode.cn/problems/water-bottles/,water-bottles,数学、模拟,https://algo.itcharge.cn/Solutions/1500-1599/water-bottles/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1518.%20%E6%8D%A2%E6%B0%B4%E9%97%AE%E9%A2%98.md,69.6%,简单,913 -1519,1500-1599,1519. 子树中标签相同的节点数,子树中标签相同的节点数,https://leetcode.cn/problems/number-of-nodes-in-the-sub-tree-with-the-same-label/,number-of-nodes-in-the-sub-tree-with-the-same-label,树、深度优先搜索、广度优先搜索、哈希表、计数,https://algo.itcharge.cn/Solutions/1500-1599/number-of-nodes-in-the-sub-tree-with-the-same-label/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1519.%20%E5%AD%90%E6%A0%91%E4%B8%AD%E6%A0%87%E7%AD%BE%E7%9B%B8%E5%90%8C%E7%9A%84%E8%8A%82%E7%82%B9%E6%95%B0.md,33.2%,中等,150 -1520,1500-1599,1520. 最多的不重叠子字符串,最多的不重叠子字符串,https://leetcode.cn/problems/maximum-number-of-non-overlapping-substrings/,maximum-number-of-non-overlapping-substrings,贪心、字符串,https://algo.itcharge.cn/Solutions/1500-1599/maximum-number-of-non-overlapping-substrings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1520.%20%E6%9C%80%E5%A4%9A%E7%9A%84%E4%B8%8D%E9%87%8D%E5%8F%A0%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md,35.6%,困难,87 -1521,1500-1599,1521. 找到最接近目标值的函数值,找到最接近目标值的函数值,https://leetcode.cn/problems/find-a-value-of-a-mysterious-function-closest-to-target/,find-a-value-of-a-mysterious-function-closest-to-target,位运算、线段树、数组、二分查找,https://algo.itcharge.cn/Solutions/1500-1599/find-a-value-of-a-mysterious-function-closest-to-target/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1521.%20%E6%89%BE%E5%88%B0%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9B%AE%E6%A0%87%E5%80%BC%E7%9A%84%E5%87%BD%E6%95%B0%E5%80%BC.md,43.6%,困难,78 -1522,1500-1599,1522. N 叉树的直径,N 叉树的直径,https://leetcode.cn/problems/diameter-of-n-ary-tree/,diameter-of-n-ary-tree,树、深度优先搜索,https://algo.itcharge.cn/Solutions/1500-1599/diameter-of-n-ary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1522.%20N%20%E5%8F%89%E6%A0%91%E7%9A%84%E7%9B%B4%E5%BE%84.md,71.5%,中等,63 -1523,1500-1599,1523. 在区间范围内统计奇数数目,在区间范围内统计奇数数目,https://leetcode.cn/problems/count-odd-numbers-in-an-interval-range/,count-odd-numbers-in-an-interval-range,数学,https://algo.itcharge.cn/Solutions/1500-1599/count-odd-numbers-in-an-interval-range/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1523.%20%E5%9C%A8%E5%8C%BA%E9%97%B4%E8%8C%83%E5%9B%B4%E5%86%85%E7%BB%9F%E8%AE%A1%E5%A5%87%E6%95%B0%E6%95%B0%E7%9B%AE.md,49.2%,简单,705 -1524,1500-1599,1524. 和为奇数的子数组数目,和为奇数的子数组数目,https://leetcode.cn/problems/number-of-sub-arrays-with-odd-sum/,number-of-sub-arrays-with-odd-sum,数组、数学、动态规划、前缀和,https://algo.itcharge.cn/Solutions/1500-1599/number-of-sub-arrays-with-odd-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1524.%20%E5%92%8C%E4%B8%BA%E5%A5%87%E6%95%B0%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84%E6%95%B0%E7%9B%AE.md,45.7%,中等,167 -1525,1500-1599,1525. 字符串的好分割数目,字符串的好分割数目,https://leetcode.cn/problems/number-of-good-ways-to-split-a-string/,number-of-good-ways-to-split-a-string,位运算、字符串、动态规划,https://algo.itcharge.cn/Solutions/1500-1599/number-of-good-ways-to-split-a-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1525.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E5%A5%BD%E5%88%86%E5%89%B2%E6%95%B0%E7%9B%AE.md,66.1%,中等,159 -1526,1500-1599,1526. 形成目标数组的子数组最少增加次数,形成目标数组的子数组最少增加次数,https://leetcode.cn/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/,minimum-number-of-increments-on-subarrays-to-form-a-target-array,栈、贪心、数组、动态规划、单调栈,https://algo.itcharge.cn/Solutions/1500-1599/minimum-number-of-increments-on-subarrays-to-form-a-target-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1526.%20%E5%BD%A2%E6%88%90%E7%9B%AE%E6%A0%87%E6%95%B0%E7%BB%84%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84%E6%9C%80%E5%B0%91%E5%A2%9E%E5%8A%A0%E6%AC%A1%E6%95%B0.md,65.0%,困难,94 -1527,1500-1599,1527. 患某种疾病的患者,患某种疾病的患者,https://leetcode.cn/problems/patients-with-a-condition/,patients-with-a-condition,数据库,https://algo.itcharge.cn/Solutions/1500-1599/patients-with-a-condition/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1527.%20%E6%82%A3%E6%9F%90%E7%A7%8D%E7%96%BE%E7%97%85%E7%9A%84%E6%82%A3%E8%80%85.md,46.7%,简单,264 -1528,1500-1599,1528. 重新排列字符串,重新排列字符串,https://leetcode.cn/problems/shuffle-string/,shuffle-string,数组、字符串,https://algo.itcharge.cn/Solutions/1500-1599/shuffle-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1528.%20%E9%87%8D%E6%96%B0%E6%8E%92%E5%88%97%E5%AD%97%E7%AC%A6%E4%B8%B2.md,78.4%,简单,486 -1529,1500-1599,1529. 最少的后缀翻转次数,最少的后缀翻转次数,https://leetcode.cn/problems/minimum-suffix-flips/,minimum-suffix-flips,贪心、字符串,https://algo.itcharge.cn/Solutions/1500-1599/minimum-suffix-flips/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1529.%20%E6%9C%80%E5%B0%91%E7%9A%84%E5%90%8E%E7%BC%80%E7%BF%BB%E8%BD%AC%E6%AC%A1%E6%95%B0.md,70.3%,中等,182 -1530,1500-1599,1530. 好叶子节点对的数量,好叶子节点对的数量,https://leetcode.cn/problems/number-of-good-leaf-nodes-pairs/,number-of-good-leaf-nodes-pairs,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/1500-1599/number-of-good-leaf-nodes-pairs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1530.%20%E5%A5%BD%E5%8F%B6%E5%AD%90%E8%8A%82%E7%82%B9%E5%AF%B9%E7%9A%84%E6%95%B0%E9%87%8F.md,58.5%,中等,204 -1531,1500-1599,1531. 压缩字符串 II,压缩字符串 II,https://leetcode.cn/problems/string-compression-ii/,string-compression-ii,字符串、动态规划,https://algo.itcharge.cn/Solutions/1500-1599/string-compression-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1531.%20%E5%8E%8B%E7%BC%A9%E5%AD%97%E7%AC%A6%E4%B8%B2%20II.md,38.0%,困难,49 -1532,1500-1599,1532. 最近的三笔订单,最近的三笔订单,https://leetcode.cn/problems/the-most-recent-three-orders/,the-most-recent-three-orders,数据库,https://algo.itcharge.cn/Solutions/1500-1599/the-most-recent-three-orders/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1532.%20%E6%9C%80%E8%BF%91%E7%9A%84%E4%B8%89%E7%AC%94%E8%AE%A2%E5%8D%95.md,63.0%,中等,97 -1533,1500-1599,1533. 找到最大整数的索引,找到最大整数的索引,https://leetcode.cn/problems/find-the-index-of-the-large-integer/,find-the-index-of-the-large-integer,数组、二分查找、交互,https://algo.itcharge.cn/Solutions/1500-1599/find-the-index-of-the-large-integer/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1533.%20%E6%89%BE%E5%88%B0%E6%9C%80%E5%A4%A7%E6%95%B4%E6%95%B0%E7%9A%84%E7%B4%A2%E5%BC%95.md,58.8%,中等,43 -1534,1500-1599,1534. 统计好三元组,统计好三元组,https://leetcode.cn/problems/count-good-triplets/,count-good-triplets,数组、枚举,https://algo.itcharge.cn/Solutions/1500-1599/count-good-triplets/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1534.%20%E7%BB%9F%E8%AE%A1%E5%A5%BD%E4%B8%89%E5%85%83%E7%BB%84.md,77.3%,简单,248 -1535,1500-1599,1535. 找出数组游戏的赢家,找出数组游戏的赢家,https://leetcode.cn/problems/find-the-winner-of-an-array-game/,find-the-winner-of-an-array-game,数组、模拟,https://algo.itcharge.cn/Solutions/1500-1599/find-the-winner-of-an-array-game/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1535.%20%E6%89%BE%E5%87%BA%E6%95%B0%E7%BB%84%E6%B8%B8%E6%88%8F%E7%9A%84%E8%B5%A2%E5%AE%B6.md,46.2%,中等,225 -1536,1500-1599,1536. 排布二进制网格的最少交换次数,排布二进制网格的最少交换次数,https://leetcode.cn/problems/minimum-swaps-to-arrange-a-binary-grid/,minimum-swaps-to-arrange-a-binary-grid,贪心、数组、矩阵,https://algo.itcharge.cn/Solutions/1500-1599/minimum-swaps-to-arrange-a-binary-grid/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1536.%20%E6%8E%92%E5%B8%83%E4%BA%8C%E8%BF%9B%E5%88%B6%E7%BD%91%E6%A0%BC%E7%9A%84%E6%9C%80%E5%B0%91%E4%BA%A4%E6%8D%A2%E6%AC%A1%E6%95%B0.md,46.2%,中等,96 -1537,1500-1599,1537. 最大得分,最大得分,https://leetcode.cn/problems/get-the-maximum-score/,get-the-maximum-score,贪心、数组、双指针、动态规划,https://algo.itcharge.cn/Solutions/1500-1599/get-the-maximum-score/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1537.%20%E6%9C%80%E5%A4%A7%E5%BE%97%E5%88%86.md,40.1%,困难,131 -1538,1500-1599,1538. 找出隐藏数组中出现次数最多的元素,找出隐藏数组中出现次数最多的元素,https://leetcode.cn/problems/guess-the-majority-in-a-hidden-array/,guess-the-majority-in-a-hidden-array,数组、数学、交互,https://algo.itcharge.cn/Solutions/1500-1599/guess-the-majority-in-a-hidden-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1538.%20%E6%89%BE%E5%87%BA%E9%9A%90%E8%97%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E5%87%BA%E7%8E%B0%E6%AC%A1%E6%95%B0%E6%9C%80%E5%A4%9A%E7%9A%84%E5%85%83%E7%B4%A0.md,56.8%,中等,14 -1539,1500-1599,1539. 第 k 个缺失的正整数,第 k 个缺失的正整数,https://leetcode.cn/problems/kth-missing-positive-number/,kth-missing-positive-number,数组、二分查找,https://algo.itcharge.cn/Solutions/1500-1599/kth-missing-positive-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1539.%20%E7%AC%AC%20k%20%E4%B8%AA%E7%BC%BA%E5%A4%B1%E7%9A%84%E6%AD%A3%E6%95%B4%E6%95%B0.md,54.0%,简单,566 -1540,1500-1599,1540. K 次操作转变字符串,K 次操作转变字符串,https://leetcode.cn/problems/can-convert-string-in-k-moves/,can-convert-string-in-k-moves,哈希表、字符串,https://algo.itcharge.cn/Solutions/1500-1599/can-convert-string-in-k-moves/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1540.%20K%20%E6%AC%A1%E6%93%8D%E4%BD%9C%E8%BD%AC%E5%8F%98%E5%AD%97%E7%AC%A6%E4%B8%B2.md,33.4%,中等,112 -1541,1500-1599,1541. 平衡括号字符串的最少插入次数,平衡括号字符串的最少插入次数,https://leetcode.cn/problems/minimum-insertions-to-balance-a-parentheses-string/,minimum-insertions-to-balance-a-parentheses-string,栈、贪心、字符串,https://algo.itcharge.cn/Solutions/1500-1599/minimum-insertions-to-balance-a-parentheses-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1541.%20%E5%B9%B3%E8%A1%A1%E6%8B%AC%E5%8F%B7%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%9C%80%E5%B0%91%E6%8F%92%E5%85%A5%E6%AC%A1%E6%95%B0.md,48.8%,中等,223 -1542,1500-1599,1542. 找出最长的超赞子字符串,找出最长的超赞子字符串,https://leetcode.cn/problems/find-longest-awesome-substring/,find-longest-awesome-substring,位运算、哈希表、字符串,https://algo.itcharge.cn/Solutions/1500-1599/find-longest-awesome-substring/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1542.%20%E6%89%BE%E5%87%BA%E6%9C%80%E9%95%BF%E7%9A%84%E8%B6%85%E8%B5%9E%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md,43.9%,困难,76 -1543,1500-1599,1543. 产品名称格式修复,产品名称格式修复,https://leetcode.cn/problems/fix-product-name-format/,fix-product-name-format,数据库,https://algo.itcharge.cn/Solutions/1500-1599/fix-product-name-format/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1543.%20%E4%BA%A7%E5%93%81%E5%90%8D%E7%A7%B0%E6%A0%BC%E5%BC%8F%E4%BF%AE%E5%A4%8D.md,55.4%,简单,57 -1544,1500-1599,1544. 整理字符串,整理字符串,https://leetcode.cn/problems/make-the-string-great/,make-the-string-great,栈、字符串,https://algo.itcharge.cn/Solutions/1500-1599/make-the-string-great/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1544.%20%E6%95%B4%E7%90%86%E5%AD%97%E7%AC%A6%E4%B8%B2.md,55.9%,简单,452 -1545,1500-1599,1545. 找出第 N 个二进制字符串中的第 K 位,找出第 N 个二进制字符串中的第 K 位,https://leetcode.cn/problems/find-kth-bit-in-nth-binary-string/,find-kth-bit-in-nth-binary-string,递归、字符串,https://algo.itcharge.cn/Solutions/1500-1599/find-kth-bit-in-nth-binary-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1545.%20%E6%89%BE%E5%87%BA%E7%AC%AC%20N%20%E4%B8%AA%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E7%AC%AC%20K%20%E4%BD%8D.md,59.0%,中等,189 -1546,1500-1599,1546. 和为目标值且不重叠的非空子数组的最大数目,和为目标值且不重叠的非空子数组的最大数目,https://leetcode.cn/problems/maximum-number-of-non-overlapping-subarrays-with-sum-equals-target/,maximum-number-of-non-overlapping-subarrays-with-sum-equals-target,贪心、数组、哈希表、前缀和,https://algo.itcharge.cn/Solutions/1500-1599/maximum-number-of-non-overlapping-subarrays-with-sum-equals-target/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1546.%20%E5%92%8C%E4%B8%BA%E7%9B%AE%E6%A0%87%E5%80%BC%E4%B8%94%E4%B8%8D%E9%87%8D%E5%8F%A0%E7%9A%84%E9%9D%9E%E7%A9%BA%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E7%9B%AE.md,44.8%,中等,110 -1547,1500-1599,1547. 切棍子的最小成本,切棍子的最小成本,https://leetcode.cn/problems/minimum-cost-to-cut-a-stick/,minimum-cost-to-cut-a-stick,数组、动态规划、排序,https://algo.itcharge.cn/Solutions/1500-1599/minimum-cost-to-cut-a-stick/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1547.%20%E5%88%87%E6%A3%8D%E5%AD%90%E7%9A%84%E6%9C%80%E5%B0%8F%E6%88%90%E6%9C%AC.md,56.6%,困难,107 -1548,1500-1599,1548. 图中最相似的路径,图中最相似的路径,https://leetcode.cn/problems/the-most-similar-path-in-a-graph/,the-most-similar-path-in-a-graph,图、动态规划,https://algo.itcharge.cn/Solutions/1500-1599/the-most-similar-path-in-a-graph/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1548.%20%E5%9B%BE%E4%B8%AD%E6%9C%80%E7%9B%B8%E4%BC%BC%E7%9A%84%E8%B7%AF%E5%BE%84.md,68.0%,困难,24 -1549,1500-1599,1549. 每件商品的最新订单,每件商品的最新订单,https://leetcode.cn/problems/the-most-recent-orders-for-each-product/,the-most-recent-orders-for-each-product,数据库,https://algo.itcharge.cn/Solutions/1500-1599/the-most-recent-orders-for-each-product/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1549.%20%E6%AF%8F%E4%BB%B6%E5%95%86%E5%93%81%E7%9A%84%E6%9C%80%E6%96%B0%E8%AE%A2%E5%8D%95.md,67.7%,中等,121 -1550,1500-1599,1550. 存在连续三个奇数的数组,存在连续三个奇数的数组,https://leetcode.cn/problems/three-consecutive-odds/,three-consecutive-odds,数组,https://algo.itcharge.cn/Solutions/1500-1599/three-consecutive-odds/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1550.%20%E5%AD%98%E5%9C%A8%E8%BF%9E%E7%BB%AD%E4%B8%89%E4%B8%AA%E5%A5%87%E6%95%B0%E7%9A%84%E6%95%B0%E7%BB%84.md,65.6%,简单,399 -1551,1500-1599,1551. 使数组中所有元素相等的最小操作数,使数组中所有元素相等的最小操作数,https://leetcode.cn/problems/minimum-operations-to-make-array-equal/,minimum-operations-to-make-array-equal,数学,https://algo.itcharge.cn/Solutions/1500-1599/minimum-operations-to-make-array-equal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1551.%20%E4%BD%BF%E6%95%B0%E7%BB%84%E4%B8%AD%E6%89%80%E6%9C%89%E5%85%83%E7%B4%A0%E7%9B%B8%E7%AD%89%E7%9A%84%E6%9C%80%E5%B0%8F%E6%93%8D%E4%BD%9C%E6%95%B0.md,82.1%,中等,223 -1552,1500-1599,1552. 两球之间的磁力,两球之间的磁力,https://leetcode.cn/problems/magnetic-force-between-two-balls/,magnetic-force-between-two-balls,数组、二分查找、排序,https://algo.itcharge.cn/Solutions/1500-1599/magnetic-force-between-two-balls/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1552.%20%E4%B8%A4%E7%90%83%E4%B9%8B%E9%97%B4%E7%9A%84%E7%A3%81%E5%8A%9B.md,56.8%,中等,226 -1553,1500-1599,1553. 吃掉 N 个橘子的最少天数,吃掉 N 个橘子的最少天数,https://leetcode.cn/problems/minimum-number-of-days-to-eat-n-oranges/,minimum-number-of-days-to-eat-n-oranges,记忆化搜索、动态规划,https://algo.itcharge.cn/Solutions/1500-1599/minimum-number-of-days-to-eat-n-oranges/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1553.%20%E5%90%83%E6%8E%89%20N%20%E4%B8%AA%E6%A9%98%E5%AD%90%E7%9A%84%E6%9C%80%E5%B0%91%E5%A4%A9%E6%95%B0.md,32.4%,困难,150 -1554,1500-1599,1554. 只有一个不同字符的字符串,只有一个不同字符的字符串,https://leetcode.cn/problems/strings-differ-by-one-character/,strings-differ-by-one-character,哈希表、字符串、哈希函数、滚动哈希,https://algo.itcharge.cn/Solutions/1500-1599/strings-differ-by-one-character/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1554.%20%E5%8F%AA%E6%9C%89%E4%B8%80%E4%B8%AA%E4%B8%8D%E5%90%8C%E5%AD%97%E7%AC%A6%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2.md,50.0%,中等,33 -1555,1500-1599,1555. 银行账户概要,银行账户概要,https://leetcode.cn/problems/bank-account-summary/,bank-account-summary,数据库,https://algo.itcharge.cn/Solutions/1500-1599/bank-account-summary/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1555.%20%E9%93%B6%E8%A1%8C%E8%B4%A6%E6%88%B7%E6%A6%82%E8%A6%81.md,44.9%,中等,76 -1556,1500-1599,1556. 千位分隔数,千位分隔数,https://leetcode.cn/problems/thousand-separator/,thousand-separator,字符串,https://algo.itcharge.cn/Solutions/1500-1599/thousand-separator/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1556.%20%E5%8D%83%E4%BD%8D%E5%88%86%E9%9A%94%E6%95%B0.md,56.2%,简单,301 -1557,1500-1599,1557. 可以到达所有点的最少点数目,可以到达所有点的最少点数目,https://leetcode.cn/problems/minimum-number-of-vertices-to-reach-all-nodes/,minimum-number-of-vertices-to-reach-all-nodes,图,https://algo.itcharge.cn/Solutions/1500-1599/minimum-number-of-vertices-to-reach-all-nodes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1557.%20%E5%8F%AF%E4%BB%A5%E5%88%B0%E8%BE%BE%E6%89%80%E6%9C%89%E7%82%B9%E7%9A%84%E6%9C%80%E5%B0%91%E7%82%B9%E6%95%B0%E7%9B%AE.md,81.5%,中等,236 -1558,1500-1599,1558. 得到目标数组的最少函数调用次数,得到目标数组的最少函数调用次数,https://leetcode.cn/problems/minimum-numbers-of-function-calls-to-make-target-array/,minimum-numbers-of-function-calls-to-make-target-array,贪心、位运算、数组,https://algo.itcharge.cn/Solutions/1500-1599/minimum-numbers-of-function-calls-to-make-target-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1558.%20%E5%BE%97%E5%88%B0%E7%9B%AE%E6%A0%87%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%B0%91%E5%87%BD%E6%95%B0%E8%B0%83%E7%94%A8%E6%AC%A1%E6%95%B0.md,63.0%,中等,97 -1559,1500-1599,1559. 二维网格图中探测环,二维网格图中探测环,https://leetcode.cn/problems/detect-cycles-in-2d-grid/,detect-cycles-in-2d-grid,深度优先搜索、广度优先搜索、并查集、数组、矩阵,https://algo.itcharge.cn/Solutions/1500-1599/detect-cycles-in-2d-grid/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1559.%20%E4%BA%8C%E7%BB%B4%E7%BD%91%E6%A0%BC%E5%9B%BE%E4%B8%AD%E6%8E%A2%E6%B5%8B%E7%8E%AF.md,40.6%,中等,115 -1560,1500-1599,1560. 圆形赛道上经过次数最多的扇区,圆形赛道上经过次数最多的扇区,https://leetcode.cn/problems/most-visited-sector-in-a-circular-track/,most-visited-sector-in-a-circular-track,数组、模拟,https://algo.itcharge.cn/Solutions/1500-1599/most-visited-sector-in-a-circular-track/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1560.%20%E5%9C%86%E5%BD%A2%E8%B5%9B%E9%81%93%E4%B8%8A%E7%BB%8F%E8%BF%87%E6%AC%A1%E6%95%B0%E6%9C%80%E5%A4%9A%E7%9A%84%E6%89%87%E5%8C%BA.md,57.4%,简单,131 -1561,1500-1599,1561. 你可以获得的最大硬币数目,你可以获得的最大硬币数目,https://leetcode.cn/problems/maximum-number-of-coins-you-can-get/,maximum-number-of-coins-you-can-get,贪心、数组、数学、博弈、排序,https://algo.itcharge.cn/Solutions/1500-1599/maximum-number-of-coins-you-can-get/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1561.%20%E4%BD%A0%E5%8F%AF%E4%BB%A5%E8%8E%B7%E5%BE%97%E7%9A%84%E6%9C%80%E5%A4%A7%E7%A1%AC%E5%B8%81%E6%95%B0%E7%9B%AE.md,77.8%,中等,250 -1562,1500-1599,1562. 查找大小为 M 的最新分组,查找大小为 M 的最新分组,https://leetcode.cn/problems/find-latest-group-of-size-m/,find-latest-group-of-size-m,数组、二分查找、模拟,https://algo.itcharge.cn/Solutions/1500-1599/find-latest-group-of-size-m/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1562.%20%E6%9F%A5%E6%89%BE%E5%A4%A7%E5%B0%8F%E4%B8%BA%20M%20%E7%9A%84%E6%9C%80%E6%96%B0%E5%88%86%E7%BB%84.md,36.5%,中等,131 -1563,1500-1599,1563. 石子游戏 V,石子游戏 V,https://leetcode.cn/problems/stone-game-v/,stone-game-v,数组、数学、动态规划、博弈,https://algo.itcharge.cn/Solutions/1500-1599/stone-game-v/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1563.%20%E7%9F%B3%E5%AD%90%E6%B8%B8%E6%88%8F%20V.md,39.6%,困难,79 -1564,1500-1599,1564. 把箱子放进仓库里 I,把箱子放进仓库里 I,https://leetcode.cn/problems/put-boxes-into-the-warehouse-i/,put-boxes-into-the-warehouse-i,贪心、数组、排序,https://algo.itcharge.cn/Solutions/1500-1599/put-boxes-into-the-warehouse-i/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1564.%20%E6%8A%8A%E7%AE%B1%E5%AD%90%E6%94%BE%E8%BF%9B%E4%BB%93%E5%BA%93%E9%87%8C%20I.md,57.8%,中等,41 -1565,1500-1599,1565. 按月统计订单数与顾客数,按月统计订单数与顾客数,https://leetcode.cn/problems/unique-orders-and-customers-per-month/,unique-orders-and-customers-per-month,数据库,https://algo.itcharge.cn/Solutions/1500-1599/unique-orders-and-customers-per-month/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1565.%20%E6%8C%89%E6%9C%88%E7%BB%9F%E8%AE%A1%E8%AE%A2%E5%8D%95%E6%95%B0%E4%B8%8E%E9%A1%BE%E5%AE%A2%E6%95%B0.md,73.9%,简单,55 -1566,1500-1599,1566. 重复至少 K 次且长度为 M 的模式,重复至少 K 次且长度为 M 的模式,https://leetcode.cn/problems/detect-pattern-of-length-m-repeated-k-or-more-times/,detect-pattern-of-length-m-repeated-k-or-more-times,数组、枚举,https://algo.itcharge.cn/Solutions/1500-1599/detect-pattern-of-length-m-repeated-k-or-more-times/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1566.%20%E9%87%8D%E5%A4%8D%E8%87%B3%E5%B0%91%20K%20%E6%AC%A1%E4%B8%94%E9%95%BF%E5%BA%A6%E4%B8%BA%20M%20%E7%9A%84%E6%A8%A1%E5%BC%8F.md,44.2%,简单,182 -1567,1500-1599,1567. 乘积为正数的最长子数组长度,乘积为正数的最长子数组长度,https://leetcode.cn/problems/maximum-length-of-subarray-with-positive-product/,maximum-length-of-subarray-with-positive-product,贪心、数组、动态规划,https://algo.itcharge.cn/Solutions/1500-1599/maximum-length-of-subarray-with-positive-product/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1567.%20%E4%B9%98%E7%A7%AF%E4%B8%BA%E6%AD%A3%E6%95%B0%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E6%95%B0%E7%BB%84%E9%95%BF%E5%BA%A6.md,42.7%,中等,462 -1568,1500-1599,1568. 使陆地分离的最少天数,使陆地分离的最少天数,https://leetcode.cn/problems/minimum-number-of-days-to-disconnect-island/,minimum-number-of-days-to-disconnect-island,深度优先搜索、广度优先搜索、数组、矩阵、强连通分量,https://algo.itcharge.cn/Solutions/1500-1599/minimum-number-of-days-to-disconnect-island/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1568.%20%E4%BD%BF%E9%99%86%E5%9C%B0%E5%88%86%E7%A6%BB%E7%9A%84%E6%9C%80%E5%B0%91%E5%A4%A9%E6%95%B0.md,45.0%,困难,82 -1569,1500-1599,1569. 将子数组重新排序得到同一个二叉搜索树的方案数,将子数组重新排序得到同一个二叉搜索树的方案数,https://leetcode.cn/problems/number-of-ways-to-reorder-array-to-get-same-bst/,number-of-ways-to-reorder-array-to-get-same-bst,树、并查集、二叉搜索树、记忆化搜索、数组、数学、分治、动态规划、二叉树、组合数学,https://algo.itcharge.cn/Solutions/1500-1599/number-of-ways-to-reorder-array-to-get-same-bst/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1569.%20%E5%B0%86%E5%AD%90%E6%95%B0%E7%BB%84%E9%87%8D%E6%96%B0%E6%8E%92%E5%BA%8F%E5%BE%97%E5%88%B0%E5%90%8C%E4%B8%80%E4%B8%AA%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E6%96%B9%E6%A1%88%E6%95%B0.md,49.1%,困难,64 -1570,1500-1599,1570. 两个稀疏向量的点积,两个稀疏向量的点积,https://leetcode.cn/problems/dot-product-of-two-sparse-vectors/,dot-product-of-two-sparse-vectors,设计、数组、哈希表、双指针,https://algo.itcharge.cn/Solutions/1500-1599/dot-product-of-two-sparse-vectors/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1570.%20%E4%B8%A4%E4%B8%AA%E7%A8%80%E7%96%8F%E5%90%91%E9%87%8F%E7%9A%84%E7%82%B9%E7%A7%AF.md,88.8%,中等,59 -1571,1500-1599,1571. 仓库经理,仓库经理,https://leetcode.cn/problems/warehouse-manager/,warehouse-manager,数据库,https://algo.itcharge.cn/Solutions/1500-1599/warehouse-manager/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1571.%20%E4%BB%93%E5%BA%93%E7%BB%8F%E7%90%86.md,77.6%,简单,96 -1572,1500-1599,1572. 矩阵对角线元素的和,矩阵对角线元素的和,https://leetcode.cn/problems/matrix-diagonal-sum/,matrix-diagonal-sum,数组、矩阵,https://algo.itcharge.cn/Solutions/1500-1599/matrix-diagonal-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1572.%20%E7%9F%A9%E9%98%B5%E5%AF%B9%E8%A7%92%E7%BA%BF%E5%85%83%E7%B4%A0%E7%9A%84%E5%92%8C.md,80.7%,简单,577 -1573,1500-1599,1573. 分割字符串的方案数,分割字符串的方案数,https://leetcode.cn/problems/number-of-ways-to-split-a-string/,number-of-ways-to-split-a-string,数学、字符串,https://algo.itcharge.cn/Solutions/1500-1599/number-of-ways-to-split-a-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1573.%20%E5%88%86%E5%89%B2%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%96%B9%E6%A1%88%E6%95%B0.md,31.2%,中等,92 -1574,1500-1599,1574. 删除最短的子数组使剩余数组有序,删除最短的子数组使剩余数组有序,https://leetcode.cn/problems/shortest-subarray-to-be-removed-to-make-array-sorted/,shortest-subarray-to-be-removed-to-make-array-sorted,栈、数组、双指针、二分查找、单调栈,https://algo.itcharge.cn/Solutions/1500-1599/shortest-subarray-to-be-removed-to-make-array-sorted/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1574.%20%E5%88%A0%E9%99%A4%E6%9C%80%E7%9F%AD%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84%E4%BD%BF%E5%89%A9%E4%BD%99%E6%95%B0%E7%BB%84%E6%9C%89%E5%BA%8F.md,43.2%,中等,288 -1575,1500-1599,1575. 统计所有可行路径,统计所有可行路径,https://leetcode.cn/problems/count-all-possible-routes/,count-all-possible-routes,记忆化搜索、数组、动态规划,https://algo.itcharge.cn/Solutions/1500-1599/count-all-possible-routes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1575.%20%E7%BB%9F%E8%AE%A1%E6%89%80%E6%9C%89%E5%8F%AF%E8%A1%8C%E8%B7%AF%E5%BE%84.md,57.5%,困难,123 -1576,1500-1599,1576. 替换所有的问号,替换所有的问号,https://leetcode.cn/problems/replace-all-s-to-avoid-consecutive-repeating-characters/,replace-all-s-to-avoid-consecutive-repeating-characters,字符串,https://algo.itcharge.cn/Solutions/1500-1599/replace-all-s-to-avoid-consecutive-repeating-characters/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1576.%20%E6%9B%BF%E6%8D%A2%E6%89%80%E6%9C%89%E7%9A%84%E9%97%AE%E5%8F%B7.md,51.0%,简单,649 -1577,1500-1599,1577. 数的平方等于两数乘积的方法数,数的平方等于两数乘积的方法数,https://leetcode.cn/problems/number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers/,number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers,数组、哈希表、数学、双指针,https://algo.itcharge.cn/Solutions/1500-1599/number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1577.%20%E6%95%B0%E7%9A%84%E5%B9%B3%E6%96%B9%E7%AD%89%E4%BA%8E%E4%B8%A4%E6%95%B0%E4%B9%98%E7%A7%AF%E7%9A%84%E6%96%B9%E6%B3%95%E6%95%B0.md,34.6%,中等,108 -1578,1500-1599,1578. 使绳子变成彩色的最短时间,使绳子变成彩色的最短时间,https://leetcode.cn/problems/minimum-time-to-make-rope-colorful/,minimum-time-to-make-rope-colorful,贪心、数组、字符串、动态规划,https://algo.itcharge.cn/Solutions/1500-1599/minimum-time-to-make-rope-colorful/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1578.%20%E4%BD%BF%E7%BB%B3%E5%AD%90%E5%8F%98%E6%88%90%E5%BD%A9%E8%89%B2%E7%9A%84%E6%9C%80%E7%9F%AD%E6%97%B6%E9%97%B4.md,59.7%,中等,265 -1579,1500-1599,1579. 保证图可完全遍历,保证图可完全遍历,https://leetcode.cn/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable/,remove-max-number-of-edges-to-keep-graph-fully-traversable,并查集、图,https://algo.itcharge.cn/Solutions/1500-1599/remove-max-number-of-edges-to-keep-graph-fully-traversable/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1579.%20%E4%BF%9D%E8%AF%81%E5%9B%BE%E5%8F%AF%E5%AE%8C%E5%85%A8%E9%81%8D%E5%8E%86.md,62.1%,困难,329 -1580,1500-1599,1580. 把箱子放进仓库里 II,把箱子放进仓库里 II,https://leetcode.cn/problems/put-boxes-into-the-warehouse-ii/,put-boxes-into-the-warehouse-ii,贪心、数组、排序,https://algo.itcharge.cn/Solutions/1500-1599/put-boxes-into-the-warehouse-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1580.%20%E6%8A%8A%E7%AE%B1%E5%AD%90%E6%94%BE%E8%BF%9B%E4%BB%93%E5%BA%93%E9%87%8C%20II.md,59.5%,中等,31 -1581,1500-1599,1581. 进店却未进行过交易的顾客,进店却未进行过交易的顾客,https://leetcode.cn/problems/customer-who-visited-but-did-not-make-any-transactions/,customer-who-visited-but-did-not-make-any-transactions,数据库,https://algo.itcharge.cn/Solutions/1500-1599/customer-who-visited-but-did-not-make-any-transactions/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1581.%20%E8%BF%9B%E5%BA%97%E5%8D%B4%E6%9C%AA%E8%BF%9B%E8%A1%8C%E8%BF%87%E4%BA%A4%E6%98%93%E7%9A%84%E9%A1%BE%E5%AE%A2.md,79.5%,简单,288 -1582,1500-1599,1582. 二进制矩阵中的特殊位置,二进制矩阵中的特殊位置,https://leetcode.cn/problems/special-positions-in-a-binary-matrix/,special-positions-in-a-binary-matrix,数组、矩阵,https://algo.itcharge.cn/Solutions/1500-1599/special-positions-in-a-binary-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1582.%20%E4%BA%8C%E8%BF%9B%E5%88%B6%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E7%89%B9%E6%AE%8A%E4%BD%8D%E7%BD%AE.md,69.5%,简单,469 -1583,1500-1599,1583. 统计不开心的朋友,统计不开心的朋友,https://leetcode.cn/problems/count-unhappy-friends/,count-unhappy-friends,数组、模拟,https://algo.itcharge.cn/Solutions/1500-1599/count-unhappy-friends/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1583.%20%E7%BB%9F%E8%AE%A1%E4%B8%8D%E5%BC%80%E5%BF%83%E7%9A%84%E6%9C%8B%E5%8F%8B.md,67.9%,中等,256 -1584,1500-1599,1584. 连接所有点的最小费用,连接所有点的最小费用,https://leetcode.cn/problems/min-cost-to-connect-all-points/,min-cost-to-connect-all-points,并查集、图、数组、最小生成树,https://algo.itcharge.cn/Solutions/1500-1599/min-cost-to-connect-all-points/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1584.%20%E8%BF%9E%E6%8E%A5%E6%89%80%E6%9C%89%E7%82%B9%E7%9A%84%E6%9C%80%E5%B0%8F%E8%B4%B9%E7%94%A8.md,65.7%,中等,641 -1585,1500-1599,1585. 检查字符串是否可以通过排序子字符串得到另一个字符串,检查字符串是否可以通过排序子字符串得到另一个字符串,https://leetcode.cn/problems/check-if-string-is-transformable-with-substring-sort-operations/,check-if-string-is-transformable-with-substring-sort-operations,贪心、字符串、排序,https://algo.itcharge.cn/Solutions/1500-1599/check-if-string-is-transformable-with-substring-sort-operations/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1585.%20%E6%A3%80%E6%9F%A5%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%98%AF%E5%90%A6%E5%8F%AF%E4%BB%A5%E9%80%9A%E8%BF%87%E6%8E%92%E5%BA%8F%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%BE%97%E5%88%B0%E5%8F%A6%E4%B8%80%E4%B8%AA%E5%AD%97%E7%AC%A6%E4%B8%B2.md,43.5%,困难,53 -1586,1500-1599,1586. 二叉搜索树迭代器 II,二叉搜索树迭代器 II,https://leetcode.cn/problems/binary-search-tree-iterator-ii/,binary-search-tree-iterator-ii,栈、树、设计、二叉搜索树、二叉树、迭代器,https://algo.itcharge.cn/Solutions/1500-1599/binary-search-tree-iterator-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1586.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E8%BF%AD%E4%BB%A3%E5%99%A8%20II.md,63.0%,中等,40 -1587,1500-1599,1587. 银行账户概要 II,银行账户概要 II,https://leetcode.cn/problems/bank-account-summary-ii/,bank-account-summary-ii,数据库,https://algo.itcharge.cn/Solutions/1500-1599/bank-account-summary-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1587.%20%E9%93%B6%E8%A1%8C%E8%B4%A6%E6%88%B7%E6%A6%82%E8%A6%81%20II.md,80.2%,简单,157 -1588,1500-1599,1588. 所有奇数长度子数组的和,所有奇数长度子数组的和,https://leetcode.cn/problems/sum-of-all-odd-length-subarrays/,sum-of-all-odd-length-subarrays,数组、数学、前缀和,https://algo.itcharge.cn/Solutions/1500-1599/sum-of-all-odd-length-subarrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1588.%20%E6%89%80%E6%9C%89%E5%A5%87%E6%95%B0%E9%95%BF%E5%BA%A6%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E5%92%8C.md,83.2%,简单,985 -1589,1500-1599,1589. 所有排列中的最大和,所有排列中的最大和,https://leetcode.cn/problems/maximum-sum-obtained-of-any-permutation/,maximum-sum-obtained-of-any-permutation,贪心、数组、前缀和、排序,https://algo.itcharge.cn/Solutions/1500-1599/maximum-sum-obtained-of-any-permutation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1589.%20%E6%89%80%E6%9C%89%E6%8E%92%E5%88%97%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E5%92%8C.md,32.4%,中等,96 -1590,1500-1599,1590. 使数组和能被 P 整除,使数组和能被 P 整除,https://leetcode.cn/problems/make-sum-divisible-by-p/,make-sum-divisible-by-p,数组、哈希表、前缀和,https://algo.itcharge.cn/Solutions/1500-1599/make-sum-divisible-by-p/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1590.%20%E4%BD%BF%E6%95%B0%E7%BB%84%E5%92%8C%E8%83%BD%E8%A2%AB%20P%20%E6%95%B4%E9%99%A4.md,36.4%,中等,198 -1591,1500-1599,1591. 奇怪的打印机 II,奇怪的打印机 II,https://leetcode.cn/problems/strange-printer-ii/,strange-printer-ii,图、拓扑排序、数组、矩阵,https://algo.itcharge.cn/Solutions/1500-1599/strange-printer-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1591.%20%E5%A5%87%E6%80%AA%E7%9A%84%E6%89%93%E5%8D%B0%E6%9C%BA%20II.md,63.7%,困难,67 -1592,1500-1599,1592. 重新排列单词间的空格,重新排列单词间的空格,https://leetcode.cn/problems/rearrange-spaces-between-words/,rearrange-spaces-between-words,字符串,https://algo.itcharge.cn/Solutions/1500-1599/rearrange-spaces-between-words/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1592.%20%E9%87%8D%E6%96%B0%E6%8E%92%E5%88%97%E5%8D%95%E8%AF%8D%E9%97%B4%E7%9A%84%E7%A9%BA%E6%A0%BC.md,46.7%,简单,578 -1593,1500-1599,1593. 拆分字符串使唯一子字符串的数目最大,拆分字符串使唯一子字符串的数目最大,https://leetcode.cn/problems/split-a-string-into-the-max-number-of-unique-substrings/,split-a-string-into-the-max-number-of-unique-substrings,哈希表、字符串、回溯,https://algo.itcharge.cn/Solutions/1500-1599/split-a-string-into-the-max-number-of-unique-substrings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1593.%20%E6%8B%86%E5%88%86%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%BD%BF%E5%94%AF%E4%B8%80%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%95%B0%E7%9B%AE%E6%9C%80%E5%A4%A7.md,57.4%,中等,141 -1594,1500-1599,1594. 矩阵的最大非负积,矩阵的最大非负积,https://leetcode.cn/problems/maximum-non-negative-product-in-a-matrix/,maximum-non-negative-product-in-a-matrix,数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/1500-1599/maximum-non-negative-product-in-a-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1594.%20%E7%9F%A9%E9%98%B5%E7%9A%84%E6%9C%80%E5%A4%A7%E9%9D%9E%E8%B4%9F%E7%A7%AF.md,33.7%,中等,132 -1595,1500-1599,1595. 连通两组点的最小成本,连通两组点的最小成本,https://leetcode.cn/problems/minimum-cost-to-connect-two-groups-of-points/,minimum-cost-to-connect-two-groups-of-points,位运算、数组、动态规划、状态压缩、矩阵,https://algo.itcharge.cn/Solutions/1500-1599/minimum-cost-to-connect-two-groups-of-points/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1595.%20%E8%BF%9E%E9%80%9A%E4%B8%A4%E7%BB%84%E7%82%B9%E7%9A%84%E6%9C%80%E5%B0%8F%E6%88%90%E6%9C%AC.md,65.8%,困难,88 -1596,1500-1599,1596. 每位顾客最经常订购的商品,每位顾客最经常订购的商品,https://leetcode.cn/problems/the-most-frequently-ordered-products-for-each-customer/,the-most-frequently-ordered-products-for-each-customer,数据库,https://algo.itcharge.cn/Solutions/1500-1599/the-most-frequently-ordered-products-for-each-customer/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1596.%20%E6%AF%8F%E4%BD%8D%E9%A1%BE%E5%AE%A2%E6%9C%80%E7%BB%8F%E5%B8%B8%E8%AE%A2%E8%B4%AD%E7%9A%84%E5%95%86%E5%93%81.md,73.3%,中等,92 -1597,1500-1599,1597. 根据中缀表达式构造二叉表达式树,根据中缀表达式构造二叉表达式树,https://leetcode.cn/problems/build-binary-expression-tree-from-infix-expression/,build-binary-expression-tree-from-infix-expression,栈、树、字符串、二叉树,https://algo.itcharge.cn/Solutions/1500-1599/build-binary-expression-tree-from-infix-expression/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1597.%20%E6%A0%B9%E6%8D%AE%E4%B8%AD%E7%BC%80%E8%A1%A8%E8%BE%BE%E5%BC%8F%E6%9E%84%E9%80%A0%E4%BA%8C%E5%8F%89%E8%A1%A8%E8%BE%BE%E5%BC%8F%E6%A0%91.md,68.4%,困难,33 -1598,1500-1599,1598. 文件夹操作日志搜集器,文件夹操作日志搜集器,https://leetcode.cn/problems/crawler-log-folder/,crawler-log-folder,栈、数组、字符串,https://algo.itcharge.cn/Solutions/1500-1599/crawler-log-folder/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1598.%20%E6%96%87%E4%BB%B6%E5%A4%B9%E6%93%8D%E4%BD%9C%E6%97%A5%E5%BF%97%E6%90%9C%E9%9B%86%E5%99%A8.md,69.5%,简单,560 -1599,1500-1599,1599. 经营摩天轮的最大利润,经营摩天轮的最大利润,https://leetcode.cn/problems/maximum-profit-of-operating-a-centennial-wheel/,maximum-profit-of-operating-a-centennial-wheel,数组、模拟,https://algo.itcharge.cn/Solutions/1500-1599/maximum-profit-of-operating-a-centennial-wheel/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1599.%20%E7%BB%8F%E8%90%A5%E6%91%A9%E5%A4%A9%E8%BD%AE%E7%9A%84%E6%9C%80%E5%A4%A7%E5%88%A9%E6%B6%A6.md,51.5%,中等,269 -1600,1600-1699,1600. 王位继承顺序,王位继承顺序,https://leetcode.cn/problems/throne-inheritance/,throne-inheritance,树、深度优先搜索、设计、哈希表,https://algo.itcharge.cn/Solutions/1600-1699/throne-inheritance/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1600.%20%E7%8E%8B%E4%BD%8D%E7%BB%A7%E6%89%BF%E9%A1%BA%E5%BA%8F.md,65.6%,中等,235 -1601,1600-1699,1601. 最多可达成的换楼请求数目,最多可达成的换楼请求数目,https://leetcode.cn/problems/maximum-number-of-achievable-transfer-requests/,maximum-number-of-achievable-transfer-requests,位运算、数组、回溯、枚举,https://algo.itcharge.cn/Solutions/1600-1699/maximum-number-of-achievable-transfer-requests/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1601.%20%E6%9C%80%E5%A4%9A%E5%8F%AF%E8%BE%BE%E6%88%90%E7%9A%84%E6%8D%A2%E6%A5%BC%E8%AF%B7%E6%B1%82%E6%95%B0%E7%9B%AE.md,61.8%,困难,243 -1602,1600-1699,1602. 找到二叉树中最近的右侧节点,找到二叉树中最近的右侧节点,https://leetcode.cn/problems/find-nearest-right-node-in-binary-tree/,find-nearest-right-node-in-binary-tree,树、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/1600-1699/find-nearest-right-node-in-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1602.%20%E6%89%BE%E5%88%B0%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E6%9C%80%E8%BF%91%E7%9A%84%E5%8F%B3%E4%BE%A7%E8%8A%82%E7%82%B9.md,74.6%,中等,60 -1603,1600-1699,1603. 设计停车系统,设计停车系统,https://leetcode.cn/problems/design-parking-system/,design-parking-system,设计、计数、模拟,https://algo.itcharge.cn/Solutions/1600-1699/design-parking-system/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1603.%20%E8%AE%BE%E8%AE%A1%E5%81%9C%E8%BD%A6%E7%B3%BB%E7%BB%9F.md,83.8%,简单,586 -1604,1600-1699,1604. 警告一小时内使用相同员工卡大于等于三次的人,警告一小时内使用相同员工卡大于等于三次的人,https://leetcode.cn/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/,alert-using-same-key-card-three-or-more-times-in-a-one-hour-period,数组、哈希表、字符串、排序,https://algo.itcharge.cn/Solutions/1600-1699/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1604.%20%E8%AD%A6%E5%91%8A%E4%B8%80%E5%B0%8F%E6%97%B6%E5%86%85%E4%BD%BF%E7%94%A8%E7%9B%B8%E5%90%8C%E5%91%98%E5%B7%A5%E5%8D%A1%E5%A4%A7%E4%BA%8E%E7%AD%89%E4%BA%8E%E4%B8%89%E6%AC%A1%E7%9A%84%E4%BA%BA.md,50.4%,中等,346 -1605,1600-1699,1605. 给定行和列的和求可行矩阵,给定行和列的和求可行矩阵,https://leetcode.cn/problems/find-valid-matrix-given-row-and-column-sums/,find-valid-matrix-given-row-and-column-sums,贪心、数组、矩阵,https://algo.itcharge.cn/Solutions/1600-1699/find-valid-matrix-given-row-and-column-sums/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1605.%20%E7%BB%99%E5%AE%9A%E8%A1%8C%E5%92%8C%E5%88%97%E7%9A%84%E5%92%8C%E6%B1%82%E5%8F%AF%E8%A1%8C%E7%9F%A9%E9%98%B5.md,80.9%,中等,273 -1606,1600-1699,1606. 找到处理最多请求的服务器,找到处理最多请求的服务器,https://leetcode.cn/problems/find-servers-that-handled-most-number-of-requests/,find-servers-that-handled-most-number-of-requests,贪心、数组、有序集合、堆（优先队列）,https://algo.itcharge.cn/Solutions/1600-1699/find-servers-that-handled-most-number-of-requests/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1606.%20%E6%89%BE%E5%88%B0%E5%A4%84%E7%90%86%E6%9C%80%E5%A4%9A%E8%AF%B7%E6%B1%82%E7%9A%84%E6%9C%8D%E5%8A%A1%E5%99%A8.md,48.4%,困难,204 -1607,1600-1699,1607. 没有卖出的卖家,没有卖出的卖家,https://leetcode.cn/problems/sellers-with-no-sales/,sellers-with-no-sales,数据库,https://algo.itcharge.cn/Solutions/1600-1699/sellers-with-no-sales/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1607.%20%E6%B2%A1%E6%9C%89%E5%8D%96%E5%87%BA%E7%9A%84%E5%8D%96%E5%AE%B6.md,54.4%,简单,91 -1608,1600-1699,1608. 特殊数组的特征值,特殊数组的特征值,https://leetcode.cn/problems/special-array-with-x-elements-greater-than-or-equal-x/,special-array-with-x-elements-greater-than-or-equal-x,数组、二分查找、排序,https://algo.itcharge.cn/Solutions/1600-1699/special-array-with-x-elements-greater-than-or-equal-x/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1608.%20%E7%89%B9%E6%AE%8A%E6%95%B0%E7%BB%84%E7%9A%84%E7%89%B9%E5%BE%81%E5%80%BC.md,61.4%,简单,808 -1609,1600-1699,1609. 奇偶树,奇偶树,https://leetcode.cn/problems/even-odd-tree/,even-odd-tree,树、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/1600-1699/even-odd-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1609.%20%E5%A5%87%E5%81%B6%E6%A0%91.md,58.1%,中等,502 -1610,1600-1699,1610. 可见点的最大数目,可见点的最大数目,https://leetcode.cn/problems/maximum-number-of-visible-points/,maximum-number-of-visible-points,几何、数组、数学、排序、滑动窗口,https://algo.itcharge.cn/Solutions/1600-1699/maximum-number-of-visible-points/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1610.%20%E5%8F%AF%E8%A7%81%E7%82%B9%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E7%9B%AE.md,44.4%,困难,161 -1611,1600-1699,1611. 使整数变为 0 的最少操作次数,使整数变为 0 的最少操作次数,https://leetcode.cn/problems/minimum-one-bit-operations-to-make-integers-zero/,minimum-one-bit-operations-to-make-integers-zero,位运算、记忆化搜索、动态规划,https://algo.itcharge.cn/Solutions/1600-1699/minimum-one-bit-operations-to-make-integers-zero/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1611.%20%E4%BD%BF%E6%95%B4%E6%95%B0%E5%8F%98%E4%B8%BA%200%20%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0.md,61.1%,困难,73 -1612,1600-1699,1612. 检查两棵二叉表达式树是否等价,检查两棵二叉表达式树是否等价,https://leetcode.cn/problems/check-if-two-expression-trees-are-equivalent/,check-if-two-expression-trees-are-equivalent,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/1600-1699/check-if-two-expression-trees-are-equivalent/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1612.%20%E6%A3%80%E6%9F%A5%E4%B8%A4%E6%A3%B5%E4%BA%8C%E5%8F%89%E8%A1%A8%E8%BE%BE%E5%BC%8F%E6%A0%91%E6%98%AF%E5%90%A6%E7%AD%89%E4%BB%B7.md,74.3%,中等,35 -1613,1600-1699,1613. 找到遗失的ID,找到遗失的ID,https://leetcode.cn/problems/find-the-missing-ids/,find-the-missing-ids,数据库,https://algo.itcharge.cn/Solutions/1600-1699/find-the-missing-ids/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1613.%20%E6%89%BE%E5%88%B0%E9%81%97%E5%A4%B1%E7%9A%84ID.md,72.8%,中等,67 -1614,1600-1699,1614. 括号的最大嵌套深度,括号的最大嵌套深度,https://leetcode.cn/problems/maximum-nesting-depth-of-the-parentheses/,maximum-nesting-depth-of-the-parentheses,栈、字符串,https://algo.itcharge.cn/Solutions/1600-1699/maximum-nesting-depth-of-the-parentheses/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1614.%20%E6%8B%AC%E5%8F%B7%E7%9A%84%E6%9C%80%E5%A4%A7%E5%B5%8C%E5%A5%97%E6%B7%B1%E5%BA%A6.md,82.4%,简单,835 -1615,1600-1699,1615. 最大网络秩,最大网络秩,https://leetcode.cn/problems/maximal-network-rank/,maximal-network-rank,图,https://algo.itcharge.cn/Solutions/1600-1699/maximal-network-rank/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1615.%20%E6%9C%80%E5%A4%A7%E7%BD%91%E7%BB%9C%E7%A7%A9.md,60.1%,中等,293 -1616,1600-1699,1616. 分割两个字符串得到回文串,分割两个字符串得到回文串,https://leetcode.cn/problems/split-two-strings-to-make-palindrome/,split-two-strings-to-make-palindrome,双指针、字符串,https://algo.itcharge.cn/Solutions/1600-1699/split-two-strings-to-make-palindrome/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1616.%20%E5%88%86%E5%89%B2%E4%B8%A4%E4%B8%AA%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%BE%97%E5%88%B0%E5%9B%9E%E6%96%87%E4%B8%B2.md,37.6%,中等,261 -1617,1600-1699,1617. 统计子树中城市之间最大距离,统计子树中城市之间最大距离,https://leetcode.cn/problems/count-subtrees-with-max-distance-between-cities/,count-subtrees-with-max-distance-between-cities,位运算、树、动态规划、状态压缩、枚举,https://algo.itcharge.cn/Solutions/1600-1699/count-subtrees-with-max-distance-between-cities/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1617.%20%E7%BB%9F%E8%AE%A1%E5%AD%90%E6%A0%91%E4%B8%AD%E5%9F%8E%E5%B8%82%E4%B9%8B%E9%97%B4%E6%9C%80%E5%A4%A7%E8%B7%9D%E7%A6%BB.md,79.2%,困难,100 -1618,1600-1699,1618. 找出适应屏幕的最大字号,找出适应屏幕的最大字号,https://leetcode.cn/problems/maximum-font-to-fit-a-sentence-in-a-screen/,maximum-font-to-fit-a-sentence-in-a-screen,数组、字符串、二分查找、交互,https://algo.itcharge.cn/Solutions/1600-1699/maximum-font-to-fit-a-sentence-in-a-screen/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1618.%20%E6%89%BE%E5%87%BA%E9%80%82%E5%BA%94%E5%B1%8F%E5%B9%95%E7%9A%84%E6%9C%80%E5%A4%A7%E5%AD%97%E5%8F%B7.md,62.5%,中等,27 -1619,1600-1699,1619. 删除某些元素后的数组均值,删除某些元素后的数组均值,https://leetcode.cn/problems/mean-of-array-after-removing-some-elements/,mean-of-array-after-removing-some-elements,数组、排序,https://algo.itcharge.cn/Solutions/1600-1699/mean-of-array-after-removing-some-elements/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1619.%20%E5%88%A0%E9%99%A4%E6%9F%90%E4%BA%9B%E5%85%83%E7%B4%A0%E5%90%8E%E7%9A%84%E6%95%B0%E7%BB%84%E5%9D%87%E5%80%BC.md,71.8%,简单,450 -1620,1600-1699,1620. 网络信号最好的坐标,网络信号最好的坐标,https://leetcode.cn/problems/coordinate-with-maximum-network-quality/,coordinate-with-maximum-network-quality,数组、枚举,https://algo.itcharge.cn/Solutions/1600-1699/coordinate-with-maximum-network-quality/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1620.%20%E7%BD%91%E7%BB%9C%E4%BF%A1%E5%8F%B7%E6%9C%80%E5%A5%BD%E7%9A%84%E5%9D%90%E6%A0%87.md,46.1%,中等,282 -1621,1600-1699,1621. 大小为 K 的不重叠线段的数目,大小为 K 的不重叠线段的数目,https://leetcode.cn/problems/number-of-sets-of-k-non-overlapping-line-segments/,number-of-sets-of-k-non-overlapping-line-segments,数学、动态规划,https://algo.itcharge.cn/Solutions/1600-1699/number-of-sets-of-k-non-overlapping-line-segments/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1621.%20%E5%A4%A7%E5%B0%8F%E4%B8%BA%20K%20%E7%9A%84%E4%B8%8D%E9%87%8D%E5%8F%A0%E7%BA%BF%E6%AE%B5%E7%9A%84%E6%95%B0%E7%9B%AE.md,48.0%,中等,55 -1622,1600-1699,1622. 奇妙序列,奇妙序列,https://leetcode.cn/problems/fancy-sequence/,fancy-sequence,设计、线段树、数学,https://algo.itcharge.cn/Solutions/1600-1699/fancy-sequence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1622.%20%E5%A5%87%E5%A6%99%E5%BA%8F%E5%88%97.md,17.2%,困难,106 -1623,1600-1699,1623. 三人国家代表队,三人国家代表队,https://leetcode.cn/problems/all-valid-triplets-that-can-represent-a-country/,all-valid-triplets-that-can-represent-a-country,数据库,https://algo.itcharge.cn/Solutions/1600-1699/all-valid-triplets-that-can-represent-a-country/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1623.%20%E4%B8%89%E4%BA%BA%E5%9B%BD%E5%AE%B6%E4%BB%A3%E8%A1%A8%E9%98%9F.md,78.5%,简单,61 -1624,1600-1699,1624. 两个相同字符之间的最长子字符串,两个相同字符之间的最长子字符串,https://leetcode.cn/problems/largest-substring-between-two-equal-characters/,largest-substring-between-two-equal-characters,哈希表、字符串,https://algo.itcharge.cn/Solutions/1600-1699/largest-substring-between-two-equal-characters/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1624.%20%E4%B8%A4%E4%B8%AA%E7%9B%B8%E5%90%8C%E5%AD%97%E7%AC%A6%E4%B9%8B%E9%97%B4%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md,64.4%,简单,693 -1625,1600-1699,1625. 执行操作后字典序最小的字符串,执行操作后字典序最小的字符串,https://leetcode.cn/problems/lexicographically-smallest-string-after-applying-operations/,lexicographically-smallest-string-after-applying-operations,广度优先搜索、字符串,https://algo.itcharge.cn/Solutions/1600-1699/lexicographically-smallest-string-after-applying-operations/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1625.%20%E6%89%A7%E8%A1%8C%E6%93%8D%E4%BD%9C%E5%90%8E%E5%AD%97%E5%85%B8%E5%BA%8F%E6%9C%80%E5%B0%8F%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2.md,66.7%,中等,150 -1626,1600-1699,1626. 无矛盾的最佳球队,无矛盾的最佳球队,https://leetcode.cn/problems/best-team-with-no-conflicts/,best-team-with-no-conflicts,数组、动态规划、排序,https://algo.itcharge.cn/Solutions/1600-1699/best-team-with-no-conflicts/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1626.%20%E6%97%A0%E7%9F%9B%E7%9B%BE%E7%9A%84%E6%9C%80%E4%BD%B3%E7%90%83%E9%98%9F.md,53.7%,中等,248 -1627,1600-1699,1627. 带阈值的图连通性,带阈值的图连通性,https://leetcode.cn/problems/graph-connectivity-with-threshold/,graph-connectivity-with-threshold,并查集、数组、数学,https://algo.itcharge.cn/Solutions/1600-1699/graph-connectivity-with-threshold/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1627.%20%E5%B8%A6%E9%98%88%E5%80%BC%E7%9A%84%E5%9B%BE%E8%BF%9E%E9%80%9A%E6%80%A7.md,42.2%,困难,65 -1628,1600-1699,1628. 设计带解析函数的表达式树,设计带解析函数的表达式树,https://leetcode.cn/problems/design-an-expression-tree-with-evaluate-function/,design-an-expression-tree-with-evaluate-function,栈、树、设计、数学、二叉树,https://algo.itcharge.cn/Solutions/1600-1699/design-an-expression-tree-with-evaluate-function/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1628.%20%E8%AE%BE%E8%AE%A1%E5%B8%A6%E8%A7%A3%E6%9E%90%E5%87%BD%E6%95%B0%E7%9A%84%E8%A1%A8%E8%BE%BE%E5%BC%8F%E6%A0%91.md,82.4%,中等,34 -1629,1600-1699,1629. 按键持续时间最长的键,按键持续时间最长的键,https://leetcode.cn/problems/slowest-key/,slowest-key,数组、字符串,https://algo.itcharge.cn/Solutions/1600-1699/slowest-key/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1629.%20%E6%8C%89%E9%94%AE%E6%8C%81%E7%BB%AD%E6%97%B6%E9%97%B4%E6%9C%80%E9%95%BF%E7%9A%84%E9%94%AE.md,55.8%,简单,446 -1630,1600-1699,1630. 等差子数组,等差子数组,https://leetcode.cn/problems/arithmetic-subarrays/,arithmetic-subarrays,数组、排序,https://algo.itcharge.cn/Solutions/1600-1699/arithmetic-subarrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1630.%20%E7%AD%89%E5%B7%AE%E5%AD%90%E6%95%B0%E7%BB%84.md,76.1%,中等,447 -1631,1600-1699,1631. 最小体力消耗路径,最小体力消耗路径,https://leetcode.cn/problems/path-with-minimum-effort/,path-with-minimum-effort,深度优先搜索、广度优先搜索、并查集、数组、二分查找、矩阵、堆（优先队列）,https://algo.itcharge.cn/Solutions/1600-1699/path-with-minimum-effort/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1631.%20%E6%9C%80%E5%B0%8F%E4%BD%93%E5%8A%9B%E6%B6%88%E8%80%97%E8%B7%AF%E5%BE%84.md,50.9%,中等,443 -1632,1600-1699,1632. 矩阵转换后的秩,矩阵转换后的秩,https://leetcode.cn/problems/rank-transform-of-a-matrix/,rank-transform-of-a-matrix,贪心、并查集、图、拓扑排序、数组、矩阵,https://algo.itcharge.cn/Solutions/1600-1699/rank-transform-of-a-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1632.%20%E7%9F%A9%E9%98%B5%E8%BD%AC%E6%8D%A2%E5%90%8E%E7%9A%84%E7%A7%A9.md,57.5%,困难,97 -1633,1600-1699,1633. 各赛事的用户注册率,各赛事的用户注册率,https://leetcode.cn/problems/percentage-of-users-attended-a-contest/,percentage-of-users-attended-a-contest,数据库,https://algo.itcharge.cn/Solutions/1600-1699/percentage-of-users-attended-a-contest/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1633.%20%E5%90%84%E8%B5%9B%E4%BA%8B%E7%9A%84%E7%94%A8%E6%88%B7%E6%B3%A8%E5%86%8C%E7%8E%87.md,62.7%,简单,102 -1634,1600-1699,1634. 求两个多项式链表的和,求两个多项式链表的和,https://leetcode.cn/problems/add-two-polynomials-represented-as-linked-lists/,add-two-polynomials-represented-as-linked-lists,链表、数学、双指针,https://algo.itcharge.cn/Solutions/1600-1699/add-two-polynomials-represented-as-linked-lists/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1634.%20%E6%B1%82%E4%B8%A4%E4%B8%AA%E5%A4%9A%E9%A1%B9%E5%BC%8F%E9%93%BE%E8%A1%A8%E7%9A%84%E5%92%8C.md,60.1%,中等,56 -1635,1600-1699,1635. Hopper 公司查询 I,Hopper 公司查询 I,https://leetcode.cn/problems/hopper-company-queries-i/,hopper-company-queries-i,数据库,https://algo.itcharge.cn/Solutions/1600-1699/hopper-company-queries-i/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1635.%20Hopper%20%E5%85%AC%E5%8F%B8%E6%9F%A5%E8%AF%A2%20I.md,49.1%,困难,54 -1636,1600-1699,1636. 按照频率将数组升序排序,按照频率将数组升序排序,https://leetcode.cn/problems/sort-array-by-increasing-frequency/,sort-array-by-increasing-frequency,数组、哈希表、排序,https://algo.itcharge.cn/Solutions/1600-1699/sort-array-by-increasing-frequency/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1636.%20%E6%8C%89%E7%85%A7%E9%A2%91%E7%8E%87%E5%B0%86%E6%95%B0%E7%BB%84%E5%8D%87%E5%BA%8F%E6%8E%92%E5%BA%8F.md,74.8%,简单,609 -1637,1600-1699,1637. 两点之间不包含任何点的最宽垂直区域,两点之间不包含任何点的最宽垂直区域,https://leetcode.cn/problems/widest-vertical-area-between-two-points-containing-no-points/,widest-vertical-area-between-two-points-containing-no-points,数组、排序,https://algo.itcharge.cn/Solutions/1600-1699/widest-vertical-area-between-two-points-containing-no-points/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1637.%20%E4%B8%A4%E7%82%B9%E4%B9%8B%E9%97%B4%E4%B8%8D%E5%8C%85%E5%90%AB%E4%BB%BB%E4%BD%95%E7%82%B9%E7%9A%84%E6%9C%80%E5%AE%BD%E5%9E%82%E7%9B%B4%E5%8C%BA%E5%9F%9F.md,84.3%,中等,274 -1638,1600-1699,1638. 统计只差一个字符的子串数目,统计只差一个字符的子串数目,https://leetcode.cn/problems/count-substrings-that-differ-by-one-character/,count-substrings-that-differ-by-one-character,哈希表、字符串、动态规划,https://algo.itcharge.cn/Solutions/1600-1699/count-substrings-that-differ-by-one-character/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1638.%20%E7%BB%9F%E8%AE%A1%E5%8F%AA%E5%B7%AE%E4%B8%80%E4%B8%AA%E5%AD%97%E7%AC%A6%E7%9A%84%E5%AD%90%E4%B8%B2%E6%95%B0%E7%9B%AE.md,77.6%,中等,194 -1639,1600-1699,1639. 通过给定词典构造目标字符串的方案数,通过给定词典构造目标字符串的方案数,https://leetcode.cn/problems/number-of-ways-to-form-a-target-string-given-a-dictionary/,number-of-ways-to-form-a-target-string-given-a-dictionary,数组、字符串、动态规划,https://algo.itcharge.cn/Solutions/1600-1699/number-of-ways-to-form-a-target-string-given-a-dictionary/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1639.%20%E9%80%9A%E8%BF%87%E7%BB%99%E5%AE%9A%E8%AF%8D%E5%85%B8%E6%9E%84%E9%80%A0%E7%9B%AE%E6%A0%87%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%96%B9%E6%A1%88%E6%95%B0.md,46.9%,困难,55 -1640,1600-1699,1640. 能否连接形成数组,能否连接形成数组,https://leetcode.cn/problems/check-array-formation-through-concatenation/,check-array-formation-through-concatenation,数组、哈希表,https://algo.itcharge.cn/Solutions/1600-1699/check-array-formation-through-concatenation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1640.%20%E8%83%BD%E5%90%A6%E8%BF%9E%E6%8E%A5%E5%BD%A2%E6%88%90%E6%95%B0%E7%BB%84.md,60.9%,简单,660 -1641,1600-1699,1641. 统计字典序元音字符串的数目,统计字典序元音字符串的数目,https://leetcode.cn/problems/count-sorted-vowel-strings/,count-sorted-vowel-strings,数学、动态规划、组合数学,https://algo.itcharge.cn/Solutions/1600-1699/count-sorted-vowel-strings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1641.%20%E7%BB%9F%E8%AE%A1%E5%AD%97%E5%85%B8%E5%BA%8F%E5%85%83%E9%9F%B3%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%95%B0%E7%9B%AE.md,82.4%,中等,598 -1642,1600-1699,1642. 可以到达的最远建筑,可以到达的最远建筑,https://leetcode.cn/problems/furthest-building-you-can-reach/,furthest-building-you-can-reach,贪心、数组、堆（优先队列）,https://algo.itcharge.cn/Solutions/1600-1699/furthest-building-you-can-reach/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1642.%20%E5%8F%AF%E4%BB%A5%E5%88%B0%E8%BE%BE%E7%9A%84%E6%9C%80%E8%BF%9C%E5%BB%BA%E7%AD%91.md,45.3%,中等,171 -1643,1600-1699,1643. 第 K 条最小指令,第 K 条最小指令,https://leetcode.cn/problems/kth-smallest-instructions/,kth-smallest-instructions,数组、数学、动态规划、组合数学,https://algo.itcharge.cn/Solutions/1600-1699/kth-smallest-instructions/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1643.%20%E7%AC%AC%20K%20%E6%9D%A1%E6%9C%80%E5%B0%8F%E6%8C%87%E4%BB%A4.md,48.0%,困难,78 -1644,1600-1699,1644. 二叉树的最近公共祖先 II,二叉树的最近公共祖先 II,https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree-ii/,lowest-common-ancestor-of-a-binary-tree-ii,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/1600-1699/lowest-common-ancestor-of-a-binary-tree-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1644.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88%20II.md,56.0%,中等,56 -1645,1600-1699,1645. 1645.Hopper 公司查询 II,1645.Hopper 公司查询 II,https://leetcode.cn/problems/hopper-company-queries-ii/,hopper-company-queries-ii,数据库,https://algo.itcharge.cn/Solutions/1600-1699/hopper-company-queries-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1645.%201645.Hopper%20%E5%85%AC%E5%8F%B8%E6%9F%A5%E8%AF%A2%20II.md,41.8%,困难,37 -1646,1600-1699,1646. 获取生成数组中的最大值,获取生成数组中的最大值,https://leetcode.cn/problems/get-maximum-in-generated-array/,get-maximum-in-generated-array,数组、动态规划、模拟,https://algo.itcharge.cn/Solutions/1600-1699/get-maximum-in-generated-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1646.%20%E8%8E%B7%E5%8F%96%E7%94%9F%E6%88%90%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md,51.9%,简单,503 -1647,1600-1699,1647. 字符频次唯一的最小删除次数,字符频次唯一的最小删除次数,https://leetcode.cn/problems/minimum-deletions-to-make-character-frequencies-unique/,minimum-deletions-to-make-character-frequencies-unique,贪心、哈希表、字符串、排序,https://algo.itcharge.cn/Solutions/1600-1699/minimum-deletions-to-make-character-frequencies-unique/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1647.%20%E5%AD%97%E7%AC%A6%E9%A2%91%E6%AC%A1%E5%94%AF%E4%B8%80%E7%9A%84%E6%9C%80%E5%B0%8F%E5%88%A0%E9%99%A4%E6%AC%A1%E6%95%B0.md,54.5%,中等,186 -1648,1600-1699,1648. 销售价值减少的颜色球,销售价值减少的颜色球,https://leetcode.cn/problems/sell-diminishing-valued-colored-balls/,sell-diminishing-valued-colored-balls,贪心、数组、数学、二分查找、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/1600-1699/sell-diminishing-valued-colored-balls/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1648.%20%E9%94%80%E5%94%AE%E4%BB%B7%E5%80%BC%E5%87%8F%E5%B0%91%E7%9A%84%E9%A2%9C%E8%89%B2%E7%90%83.md,31.6%,中等,147 -1649,1600-1699,1649. 通过指令创建有序数组,通过指令创建有序数组,https://leetcode.cn/problems/create-sorted-array-through-instructions/,create-sorted-array-through-instructions,树状数组、线段树、数组、二分查找、分治、有序集合、归并排序,https://algo.itcharge.cn/Solutions/1600-1699/create-sorted-array-through-instructions/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1649.%20%E9%80%9A%E8%BF%87%E6%8C%87%E4%BB%A4%E5%88%9B%E5%BB%BA%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84.md,49.3%,困难,98 -1650,1600-1699,1650. 二叉树的最近公共祖先 III,二叉树的最近公共祖先 III,https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree-iii/,lowest-common-ancestor-of-a-binary-tree-iii,树、哈希表、二叉树,https://algo.itcharge.cn/Solutions/1600-1699/lowest-common-ancestor-of-a-binary-tree-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1650.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88%20III.md,80.0%,中等,66 -1651,1600-1699,1651. Hopper 公司查询 III,Hopper 公司查询 III,https://leetcode.cn/problems/hopper-company-queries-iii/,hopper-company-queries-iii,数据库,https://algo.itcharge.cn/Solutions/1600-1699/hopper-company-queries-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1651.%20Hopper%20%E5%85%AC%E5%8F%B8%E6%9F%A5%E8%AF%A2%20III.md,64.0%,困难,37 -1652,1600-1699,1652. 拆炸弹,拆炸弹,https://leetcode.cn/problems/defuse-the-bomb/,defuse-the-bomb,数组,https://algo.itcharge.cn/Solutions/1600-1699/defuse-the-bomb/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1652.%20%E6%8B%86%E7%82%B8%E5%BC%B9.md,66.4%,简单,608 -1653,1600-1699,1653. 使字符串平衡的最少删除次数,使字符串平衡的最少删除次数,https://leetcode.cn/problems/minimum-deletions-to-make-string-balanced/,minimum-deletions-to-make-string-balanced,栈、字符串、动态规划,https://algo.itcharge.cn/Solutions/1600-1699/minimum-deletions-to-make-string-balanced/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1653.%20%E4%BD%BF%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%B9%B3%E8%A1%A1%E7%9A%84%E6%9C%80%E5%B0%91%E5%88%A0%E9%99%A4%E6%AC%A1%E6%95%B0.md,61.0%,中等,355 -1654,1600-1699,1654. 到家的最少跳跃次数,到家的最少跳跃次数,https://leetcode.cn/problems/minimum-jumps-to-reach-home/,minimum-jumps-to-reach-home,广度优先搜索、数组、动态规划,https://algo.itcharge.cn/Solutions/1600-1699/minimum-jumps-to-reach-home/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1654.%20%E5%88%B0%E5%AE%B6%E7%9A%84%E6%9C%80%E5%B0%91%E8%B7%B3%E8%B7%83%E6%AC%A1%E6%95%B0.md,31.2%,中等,116 -1655,1600-1699,1655. 分配重复整数,分配重复整数,https://leetcode.cn/problems/distribute-repeating-integers/,distribute-repeating-integers,位运算、数组、动态规划、回溯、状态压缩,https://algo.itcharge.cn/Solutions/1600-1699/distribute-repeating-integers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1655.%20%E5%88%86%E9%85%8D%E9%87%8D%E5%A4%8D%E6%95%B4%E6%95%B0.md,39.5%,困难,62 -1656,1600-1699,1656. 设计有序流,设计有序流,https://leetcode.cn/problems/design-an-ordered-stream/,design-an-ordered-stream,设计、数组、哈希表、数据流,https://algo.itcharge.cn/Solutions/1600-1699/design-an-ordered-stream/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1656.%20%E8%AE%BE%E8%AE%A1%E6%9C%89%E5%BA%8F%E6%B5%81.md,84.1%,简单,368 -1657,1600-1699,1657. 确定两个字符串是否接近,确定两个字符串是否接近,https://leetcode.cn/problems/determine-if-two-strings-are-close/,determine-if-two-strings-are-close,哈希表、字符串、排序,https://algo.itcharge.cn/Solutions/1600-1699/determine-if-two-strings-are-close/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1657.%20%E7%A1%AE%E5%AE%9A%E4%B8%A4%E4%B8%AA%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%98%AF%E5%90%A6%E6%8E%A5%E8%BF%91.md,47.1%,中等,165 -1658,1600-1699,1658. 将 x 减到 0 的最小操作数,将 x 减到 0 的最小操作数,https://leetcode.cn/problems/minimum-operations-to-reduce-x-to-zero/,minimum-operations-to-reduce-x-to-zero,数组、哈希表、二分查找、前缀和、滑动窗口,https://algo.itcharge.cn/Solutions/1600-1699/minimum-operations-to-reduce-x-to-zero/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1658.%20%E5%B0%86%20x%20%E5%87%8F%E5%88%B0%200%20%E7%9A%84%E6%9C%80%E5%B0%8F%E6%93%8D%E4%BD%9C%E6%95%B0.md,39.2%,中等,440 -1659,1600-1699,1659. 最大化网格幸福感,最大化网格幸福感,https://leetcode.cn/problems/maximize-grid-happiness/,maximize-grid-happiness,位运算、记忆化搜索、动态规划、状态压缩,https://algo.itcharge.cn/Solutions/1600-1699/maximize-grid-happiness/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1659.%20%E6%9C%80%E5%A4%A7%E5%8C%96%E7%BD%91%E6%A0%BC%E5%B9%B8%E7%A6%8F%E6%84%9F.md,64.7%,困难,67 -1660,1600-1699,1660. 纠正二叉树,纠正二叉树,https://leetcode.cn/problems/correct-a-binary-tree/,correct-a-binary-tree,树、深度优先搜索、广度优先搜索、哈希表、二叉树,https://algo.itcharge.cn/Solutions/1600-1699/correct-a-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1660.%20%E7%BA%A0%E6%AD%A3%E4%BA%8C%E5%8F%89%E6%A0%91.md,76.2%,中等,36 -1661,1600-1699,1661. 每台机器的进程平均运行时间,每台机器的进程平均运行时间,https://leetcode.cn/problems/average-time-of-process-per-machine/,average-time-of-process-per-machine,数据库,https://algo.itcharge.cn/Solutions/1600-1699/average-time-of-process-per-machine/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1661.%20%E6%AF%8F%E5%8F%B0%E6%9C%BA%E5%99%A8%E7%9A%84%E8%BF%9B%E7%A8%8B%E5%B9%B3%E5%9D%87%E8%BF%90%E8%A1%8C%E6%97%B6%E9%97%B4.md,72.6%,简单,131 -1662,1600-1699,1662. 检查两个字符串数组是否相等,检查两个字符串数组是否相等,https://leetcode.cn/problems/check-if-two-string-arrays-are-equivalent/,check-if-two-string-arrays-are-equivalent,数组、字符串,https://algo.itcharge.cn/Solutions/1600-1699/check-if-two-string-arrays-are-equivalent/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1662.%20%E6%A3%80%E6%9F%A5%E4%B8%A4%E4%B8%AA%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%95%B0%E7%BB%84%E6%98%AF%E5%90%A6%E7%9B%B8%E7%AD%89.md,81.0%,简单,710 -1663,1600-1699,1663. 具有给定数值的最小字符串,具有给定数值的最小字符串,https://leetcode.cn/problems/smallest-string-with-a-given-numeric-value/,smallest-string-with-a-given-numeric-value,贪心、字符串,https://algo.itcharge.cn/Solutions/1600-1699/smallest-string-with-a-given-numeric-value/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1663.%20%E5%85%B7%E6%9C%89%E7%BB%99%E5%AE%9A%E6%95%B0%E5%80%BC%E7%9A%84%E6%9C%80%E5%B0%8F%E5%AD%97%E7%AC%A6%E4%B8%B2.md,65.1%,中等,349 -1664,1600-1699,1664. 生成平衡数组的方案数,生成平衡数组的方案数,https://leetcode.cn/problems/ways-to-make-a-fair-array/,ways-to-make-a-fair-array,数组、动态规划,https://algo.itcharge.cn/Solutions/1600-1699/ways-to-make-a-fair-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1664.%20%E7%94%9F%E6%88%90%E5%B9%B3%E8%A1%A1%E6%95%B0%E7%BB%84%E7%9A%84%E6%96%B9%E6%A1%88%E6%95%B0.md,66.5%,中等,399 -1665,1600-1699,1665. 完成所有任务的最少初始能量,完成所有任务的最少初始能量,https://leetcode.cn/problems/minimum-initial-energy-to-finish-tasks/,minimum-initial-energy-to-finish-tasks,贪心、数组、排序,https://algo.itcharge.cn/Solutions/1600-1699/minimum-initial-energy-to-finish-tasks/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1665.%20%E5%AE%8C%E6%88%90%E6%89%80%E6%9C%89%E4%BB%BB%E5%8A%A1%E7%9A%84%E6%9C%80%E5%B0%91%E5%88%9D%E5%A7%8B%E8%83%BD%E9%87%8F.md,65.4%,困难,124 -1666,1600-1699,1666. 改变二叉树的根节点,改变二叉树的根节点,https://leetcode.cn/problems/change-the-root-of-a-binary-tree/,change-the-root-of-a-binary-tree,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/1600-1699/change-the-root-of-a-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1666.%20%E6%94%B9%E5%8F%98%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%A0%B9%E8%8A%82%E7%82%B9.md,66.8%,中等,24 -1667,1600-1699,1667. 修复表中的名字,修复表中的名字,https://leetcode.cn/problems/fix-names-in-a-table/,fix-names-in-a-table,数据库,https://algo.itcharge.cn/Solutions/1600-1699/fix-names-in-a-table/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1667.%20%E4%BF%AE%E5%A4%8D%E8%A1%A8%E4%B8%AD%E7%9A%84%E5%90%8D%E5%AD%97.md,63.6%,简单,282 -1668,1600-1699,1668. 最大重复子字符串,最大重复子字符串,https://leetcode.cn/problems/maximum-repeating-substring/,maximum-repeating-substring,字符串、字符串匹配,https://algo.itcharge.cn/Solutions/1600-1699/maximum-repeating-substring/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1668.%20%E6%9C%80%E5%A4%A7%E9%87%8D%E5%A4%8D%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md,47.0%,简单,588 -1669,1600-1699,1669. 合并两个链表,合并两个链表,https://leetcode.cn/problems/merge-in-between-linked-lists/,merge-in-between-linked-lists,链表,https://algo.itcharge.cn/Solutions/1600-1699/merge-in-between-linked-lists/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1669.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E9%93%BE%E8%A1%A8.md,77.3%,中等,626 -1670,1600-1699,1670. 设计前中后队列,设计前中后队列,https://leetcode.cn/problems/design-front-middle-back-queue/,design-front-middle-back-queue,设计、队列、数组、链表、数据流,https://algo.itcharge.cn/Solutions/1600-1699/design-front-middle-back-queue/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1670.%20%E8%AE%BE%E8%AE%A1%E5%89%8D%E4%B8%AD%E5%90%8E%E9%98%9F%E5%88%97.md,52.0%,中等,145 -1671,1600-1699,1671. 得到山形数组的最少删除次数,得到山形数组的最少删除次数,https://leetcode.cn/problems/minimum-number-of-removals-to-make-mountain-array/,minimum-number-of-removals-to-make-mountain-array,贪心、数组、二分查找、动态规划,https://algo.itcharge.cn/Solutions/1600-1699/minimum-number-of-removals-to-make-mountain-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1671.%20%E5%BE%97%E5%88%B0%E5%B1%B1%E5%BD%A2%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%B0%91%E5%88%A0%E9%99%A4%E6%AC%A1%E6%95%B0.md,46.7%,困难,75 -1672,1600-1699,1672. 最富有客户的资产总量,最富有客户的资产总量,https://leetcode.cn/problems/richest-customer-wealth/,richest-customer-wealth,数组、矩阵,https://algo.itcharge.cn/Solutions/1600-1699/richest-customer-wealth/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1672.%20%E6%9C%80%E5%AF%8C%E6%9C%89%E5%AE%A2%E6%88%B7%E7%9A%84%E8%B5%84%E4%BA%A7%E6%80%BB%E9%87%8F.md,83.7%,简单,1370 -1673,1600-1699,1673. 找出最具竞争力的子序列,找出最具竞争力的子序列,https://leetcode.cn/problems/find-the-most-competitive-subsequence/,find-the-most-competitive-subsequence,栈、贪心、数组、单调栈,https://algo.itcharge.cn/Solutions/1600-1699/find-the-most-competitive-subsequence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1673.%20%E6%89%BE%E5%87%BA%E6%9C%80%E5%85%B7%E7%AB%9E%E4%BA%89%E5%8A%9B%E7%9A%84%E5%AD%90%E5%BA%8F%E5%88%97.md,39.5%,中等,226 -1674,1600-1699,1674. 使数组互补的最少操作次数,使数组互补的最少操作次数,https://leetcode.cn/problems/minimum-moves-to-make-array-complementary/,minimum-moves-to-make-array-complementary,数组、哈希表、前缀和,https://algo.itcharge.cn/Solutions/1600-1699/minimum-moves-to-make-array-complementary/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1674.%20%E4%BD%BF%E6%95%B0%E7%BB%84%E4%BA%92%E8%A1%A5%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0.md,41.9%,中等,81 -1675,1600-1699,1675. 数组的最小偏移量,数组的最小偏移量,https://leetcode.cn/problems/minimize-deviation-in-array/,minimize-deviation-in-array,贪心、数组、有序集合、堆（优先队列）,https://algo.itcharge.cn/Solutions/1600-1699/minimize-deviation-in-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1675.%20%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%B0%8F%E5%81%8F%E7%A7%BB%E9%87%8F.md,45.6%,困难,71 -1676,1600-1699,1676. 二叉树的最近公共祖先 IV,二叉树的最近公共祖先 IV,https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree-iv/,lowest-common-ancestor-of-a-binary-tree-iv,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/1600-1699/lowest-common-ancestor-of-a-binary-tree-iv/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1676.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88%20IV.md,79.9%,中等,53 -1677,1600-1699,1677. 发票中的产品金额,发票中的产品金额,https://leetcode.cn/problems/products-worth-over-invoices/,products-worth-over-invoices,数据库,https://algo.itcharge.cn/Solutions/1600-1699/products-worth-over-invoices/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1677.%20%E5%8F%91%E7%A5%A8%E4%B8%AD%E7%9A%84%E4%BA%A7%E5%93%81%E9%87%91%E9%A2%9D.md,35.3%,简单,54 -1678,1600-1699,1678. 设计 Goal 解析器,设计 Goal 解析器,https://leetcode.cn/problems/goal-parser-interpretation/,goal-parser-interpretation,字符串,https://algo.itcharge.cn/Solutions/1600-1699/goal-parser-interpretation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1678.%20%E8%AE%BE%E8%AE%A1%20Goal%20%E8%A7%A3%E6%9E%90%E5%99%A8.md,86.1%,简单,766 -1679,1600-1699,1679. K 和数对的最大数目,K 和数对的最大数目,https://leetcode.cn/problems/max-number-of-k-sum-pairs/,max-number-of-k-sum-pairs,数组、哈希表、双指针、排序,https://algo.itcharge.cn/Solutions/1600-1699/max-number-of-k-sum-pairs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1679.%20K%20%E5%92%8C%E6%95%B0%E5%AF%B9%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E7%9B%AE.md,54.0%,中等,220 -1680,1600-1699,1680. 连接连续二进制数字,连接连续二进制数字,https://leetcode.cn/problems/concatenation-of-consecutive-binary-numbers/,concatenation-of-consecutive-binary-numbers,位运算、数学、模拟,https://algo.itcharge.cn/Solutions/1600-1699/concatenation-of-consecutive-binary-numbers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1680.%20%E8%BF%9E%E6%8E%A5%E8%BF%9E%E7%BB%AD%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%95%B0%E5%AD%97.md,49.9%,中等,92 -1681,1600-1699,1681. 最小不兼容性,最小不兼容性,https://leetcode.cn/problems/minimum-incompatibility/,minimum-incompatibility,位运算、数组、动态规划、状态压缩,https://algo.itcharge.cn/Solutions/1600-1699/minimum-incompatibility/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1681.%20%E6%9C%80%E5%B0%8F%E4%B8%8D%E5%85%BC%E5%AE%B9%E6%80%A7.md,54.9%,困难,99 -1682,1600-1699,1682. 最长回文子序列 II,最长回文子序列 II,https://leetcode.cn/problems/longest-palindromic-subsequence-ii/,longest-palindromic-subsequence-ii,字符串、动态规划,https://algo.itcharge.cn/Solutions/1600-1699/longest-palindromic-subsequence-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1682.%20%E6%9C%80%E9%95%BF%E5%9B%9E%E6%96%87%E5%AD%90%E5%BA%8F%E5%88%97%20II.md,57.2%,中等,42 -1683,1600-1699,1683. 无效的推文,无效的推文,https://leetcode.cn/problems/invalid-tweets/,invalid-tweets,数据库,https://algo.itcharge.cn/Solutions/1600-1699/invalid-tweets/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1683.%20%E6%97%A0%E6%95%88%E7%9A%84%E6%8E%A8%E6%96%87.md,87.4%,简单,72 -1684,1600-1699,1684. 统计一致字符串的数目,统计一致字符串的数目,https://leetcode.cn/problems/count-the-number-of-consistent-strings/,count-the-number-of-consistent-strings,位运算、数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/1600-1699/count-the-number-of-consistent-strings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1684.%20%E7%BB%9F%E8%AE%A1%E4%B8%80%E8%87%B4%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%95%B0%E7%9B%AE.md,85.2%,简单,840 -1685,1600-1699,1685. 有序数组中差绝对值之和,有序数组中差绝对值之和,https://leetcode.cn/problems/sum-of-absolute-differences-in-a-sorted-array/,sum-of-absolute-differences-in-a-sorted-array,数组、数学、前缀和,https://algo.itcharge.cn/Solutions/1600-1699/sum-of-absolute-differences-in-a-sorted-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1685.%20%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E5%B7%AE%E7%BB%9D%E5%AF%B9%E5%80%BC%E4%B9%8B%E5%92%8C.md,64.9%,中等,171 -1686,1600-1699,1686. 石子游戏 VI,石子游戏 VI,https://leetcode.cn/problems/stone-game-vi/,stone-game-vi,贪心、数组、数学、博弈、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/1600-1699/stone-game-vi/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1686.%20%E7%9F%B3%E5%AD%90%E6%B8%B8%E6%88%8F%20VI.md,50.1%,中等,79 -1687,1600-1699,1687. 从仓库到码头运输箱子,从仓库到码头运输箱子,https://leetcode.cn/problems/delivering-boxes-from-storage-to-ports/,delivering-boxes-from-storage-to-ports,线段树、队列、数组、动态规划、前缀和、单调队列、堆（优先队列）,https://algo.itcharge.cn/Solutions/1600-1699/delivering-boxes-from-storage-to-ports/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1687.%20%E4%BB%8E%E4%BB%93%E5%BA%93%E5%88%B0%E7%A0%81%E5%A4%B4%E8%BF%90%E8%BE%93%E7%AE%B1%E5%AD%90.md,58.8%,困难,99 -1688,1600-1699,1688. 比赛中的配对次数,比赛中的配对次数,https://leetcode.cn/problems/count-of-matches-in-tournament/,count-of-matches-in-tournament,数学、模拟,https://algo.itcharge.cn/Solutions/1600-1699/count-of-matches-in-tournament/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1688.%20%E6%AF%94%E8%B5%9B%E4%B8%AD%E7%9A%84%E9%85%8D%E5%AF%B9%E6%AC%A1%E6%95%B0.md,83.8%,简单,643 -1689,1600-1699,1689. 十-二进制数的最少数目,十-二进制数的最少数目,https://leetcode.cn/problems/partitioning-into-minimum-number-of-deci-binary-numbers/,partitioning-into-minimum-number-of-deci-binary-numbers,贪心、字符串,https://algo.itcharge.cn/Solutions/1600-1699/partitioning-into-minimum-number-of-deci-binary-numbers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1689.%20%E5%8D%81-%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%95%B0%E7%9A%84%E6%9C%80%E5%B0%91%E6%95%B0%E7%9B%AE.md,86.6%,中等,298 -1690,1600-1699,1690. 石子游戏 VII,石子游戏 VII,https://leetcode.cn/problems/stone-game-vii/,stone-game-vii,数组、数学、动态规划、博弈,https://algo.itcharge.cn/Solutions/1600-1699/stone-game-vii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1690.%20%E7%9F%B3%E5%AD%90%E6%B8%B8%E6%88%8F%20VII.md,55.7%,中等,135 -1691,1600-1699,1691. 堆叠长方体的最大高度,堆叠长方体的最大高度,https://leetcode.cn/problems/maximum-height-by-stacking-cuboids/,maximum-height-by-stacking-cuboids,数组、动态规划、排序,https://algo.itcharge.cn/Solutions/1600-1699/maximum-height-by-stacking-cuboids/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1691.%20%E5%A0%86%E5%8F%A0%E9%95%BF%E6%96%B9%E4%BD%93%E7%9A%84%E6%9C%80%E5%A4%A7%E9%AB%98%E5%BA%A6.md,65.0%,困难,176 -1692,1600-1699,1692. 计算分配糖果的不同方式,计算分配糖果的不同方式,https://leetcode.cn/problems/count-ways-to-distribute-candies/,count-ways-to-distribute-candies,动态规划,https://algo.itcharge.cn/Solutions/1600-1699/count-ways-to-distribute-candies/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1692.%20%E8%AE%A1%E7%AE%97%E5%88%86%E9%85%8D%E7%B3%96%E6%9E%9C%E7%9A%84%E4%B8%8D%E5%90%8C%E6%96%B9%E5%BC%8F.md,66.1%,困难,25 -1693,1600-1699,1693. 每天的领导和合伙人,每天的领导和合伙人,https://leetcode.cn/problems/daily-leads-and-partners/,daily-leads-and-partners,数据库,https://algo.itcharge.cn/Solutions/1600-1699/daily-leads-and-partners/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1693.%20%E6%AF%8F%E5%A4%A9%E7%9A%84%E9%A2%86%E5%AF%BC%E5%92%8C%E5%90%88%E4%BC%99%E4%BA%BA.md,82.0%,简单,168 -1694,1600-1699,1694. 重新格式化电话号码,重新格式化电话号码,https://leetcode.cn/problems/reformat-phone-number/,reformat-phone-number,字符串,https://algo.itcharge.cn/Solutions/1600-1699/reformat-phone-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1694.%20%E9%87%8D%E6%96%B0%E6%A0%BC%E5%BC%8F%E5%8C%96%E7%94%B5%E8%AF%9D%E5%8F%B7%E7%A0%81.md,66.1%,简单,566 -1695,1600-1699,1695. 删除子数组的最大得分,删除子数组的最大得分,https://leetcode.cn/problems/maximum-erasure-value/,maximum-erasure-value,数组、哈希表、滑动窗口,https://algo.itcharge.cn/Solutions/1600-1699/maximum-erasure-value/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1695.%20%E5%88%A0%E9%99%A4%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%BE%97%E5%88%86.md,51.9%,中等,228 -1696,1600-1699,1696. 跳跃游戏 VI,跳跃游戏 VI,https://leetcode.cn/problems/jump-game-vi/,jump-game-vi,队列、数组、动态规划、滑动窗口、单调队列、堆（优先队列）,https://algo.itcharge.cn/Solutions/1600-1699/jump-game-vi/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1696.%20%E8%B7%B3%E8%B7%83%E6%B8%B8%E6%88%8F%20VI.md,40.2%,中等,193 -1697,1600-1699,1697. 检查边长度限制的路径是否存在,检查边长度限制的路径是否存在,https://leetcode.cn/problems/checking-existence-of-edge-length-limited-paths/,checking-existence-of-edge-length-limited-paths,并查集、图、数组、排序,https://algo.itcharge.cn/Solutions/1600-1699/checking-existence-of-edge-length-limited-paths/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1697.%20%E6%A3%80%E6%9F%A5%E8%BE%B9%E9%95%BF%E5%BA%A6%E9%99%90%E5%88%B6%E7%9A%84%E8%B7%AF%E5%BE%84%E6%98%AF%E5%90%A6%E5%AD%98%E5%9C%A8.md,64.9%,困难,163 -1698,1600-1699,1698. 字符串的不同子字符串个数,字符串的不同子字符串个数,https://leetcode.cn/problems/number-of-distinct-substrings-in-a-string/,number-of-distinct-substrings-in-a-string,字典树、字符串、后缀数组、哈希函数、滚动哈希,https://algo.itcharge.cn/Solutions/1600-1699/number-of-distinct-substrings-in-a-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1698.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E4%B8%8D%E5%90%8C%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AA%E6%95%B0.md,55.2%,中等,28 -1699,1600-1699,1699. 两人之间的通话次数,两人之间的通话次数,https://leetcode.cn/problems/number-of-calls-between-two-persons/,number-of-calls-between-two-persons,数据库,https://algo.itcharge.cn/Solutions/1600-1699/number-of-calls-between-two-persons/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1699.%20%E4%B8%A4%E4%BA%BA%E4%B9%8B%E9%97%B4%E7%9A%84%E9%80%9A%E8%AF%9D%E6%AC%A1%E6%95%B0.md,76.4%,中等,124 -1700,1700-1799,1700. 无法吃午餐的学生数量,无法吃午餐的学生数量,https://leetcode.cn/problems/number-of-students-unable-to-eat-lunch/,number-of-students-unable-to-eat-lunch,栈、队列、数组、模拟,https://algo.itcharge.cn/Solutions/1700-1799/number-of-students-unable-to-eat-lunch/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1700.%20%E6%97%A0%E6%B3%95%E5%90%83%E5%8D%88%E9%A4%90%E7%9A%84%E5%AD%A6%E7%94%9F%E6%95%B0%E9%87%8F.md,73.2%,简单,764 -1701,1700-1799,1701. 平均等待时间,平均等待时间,https://leetcode.cn/problems/average-waiting-time/,average-waiting-time,数组、模拟,https://algo.itcharge.cn/Solutions/1700-1799/average-waiting-time/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1701.%20%E5%B9%B3%E5%9D%87%E7%AD%89%E5%BE%85%E6%97%B6%E9%97%B4.md,60.5%,中等,145 -1702,1700-1799,1702. 修改后的最大二进制字符串,修改后的最大二进制字符串,https://leetcode.cn/problems/maximum-binary-string-after-change/,maximum-binary-string-after-change,贪心、字符串,https://algo.itcharge.cn/Solutions/1700-1799/maximum-binary-string-after-change/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1702.%20%E4%BF%AE%E6%94%B9%E5%90%8E%E7%9A%84%E6%9C%80%E5%A4%A7%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%AD%97%E7%AC%A6%E4%B8%B2.md,48.3%,中等,99 -1703,1700-1799,1703. 得到连续 K 个 1 的最少相邻交换次数,得到连续 K 个 1 的最少相邻交换次数,https://leetcode.cn/problems/minimum-adjacent-swaps-for-k-consecutive-ones/,minimum-adjacent-swaps-for-k-consecutive-ones,贪心、数组、前缀和、滑动窗口,https://algo.itcharge.cn/Solutions/1700-1799/minimum-adjacent-swaps-for-k-consecutive-ones/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1703.%20%E5%BE%97%E5%88%B0%E8%BF%9E%E7%BB%AD%20K%20%E4%B8%AA%201%20%E7%9A%84%E6%9C%80%E5%B0%91%E7%9B%B8%E9%82%BB%E4%BA%A4%E6%8D%A2%E6%AC%A1%E6%95%B0.md,56.6%,困难,87 -1704,1700-1799,1704. 判断字符串的两半是否相似,判断字符串的两半是否相似,https://leetcode.cn/problems/determine-if-string-halves-are-alike/,determine-if-string-halves-are-alike,字符串、计数,https://algo.itcharge.cn/Solutions/1700-1799/determine-if-string-halves-are-alike/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1704.%20%E5%88%A4%E6%96%AD%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E4%B8%A4%E5%8D%8A%E6%98%AF%E5%90%A6%E7%9B%B8%E4%BC%BC.md,78.4%,简单,569 -1705,1700-1799,1705. 吃苹果的最大数目,吃苹果的最大数目,https://leetcode.cn/problems/maximum-number-of-eaten-apples/,maximum-number-of-eaten-apples,贪心、数组、堆（优先队列）,https://algo.itcharge.cn/Solutions/1700-1799/maximum-number-of-eaten-apples/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1705.%20%E5%90%83%E8%8B%B9%E6%9E%9C%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E7%9B%AE.md,45.4%,中等,394 -1706,1700-1799,1706. 球会落何处,球会落何处,https://leetcode.cn/problems/where-will-the-ball-fall/,where-will-the-ball-fall,深度优先搜索、数组、动态规划、矩阵、模拟,https://algo.itcharge.cn/Solutions/1700-1799/where-will-the-ball-fall/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1706.%20%E7%90%83%E4%BC%9A%E8%90%BD%E4%BD%95%E5%A4%84.md,69.1%,中等,692 -1707,1700-1799,1707. 与数组中元素的最大异或值,与数组中元素的最大异或值,https://leetcode.cn/problems/maximum-xor-with-an-element-from-array/,maximum-xor-with-an-element-from-array,位运算、字典树、数组,https://algo.itcharge.cn/Solutions/1700-1799/maximum-xor-with-an-element-from-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1707.%20%E4%B8%8E%E6%95%B0%E7%BB%84%E4%B8%AD%E5%85%83%E7%B4%A0%E7%9A%84%E6%9C%80%E5%A4%A7%E5%BC%82%E6%88%96%E5%80%BC.md,50.9%,困难,176 -1708,1700-1799,1708. 长度为 K 的最大子数组,长度为 K 的最大子数组,https://leetcode.cn/problems/largest-subarray-length-k/,largest-subarray-length-k,贪心、数组,https://algo.itcharge.cn/Solutions/1700-1799/largest-subarray-length-k/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1708.%20%E9%95%BF%E5%BA%A6%E4%B8%BA%20K%20%E7%9A%84%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84.md,66.9%,简单,52 -1709,1700-1799,1709. 访问日期之间最大的空档期,访问日期之间最大的空档期,https://leetcode.cn/problems/biggest-window-between-visits/,biggest-window-between-visits,数据库,https://algo.itcharge.cn/Solutions/1700-1799/biggest-window-between-visits/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1709.%20%E8%AE%BF%E9%97%AE%E6%97%A5%E6%9C%9F%E4%B9%8B%E9%97%B4%E6%9C%80%E5%A4%A7%E7%9A%84%E7%A9%BA%E6%A1%A3%E6%9C%9F.md,69.0%,中等,82 -1710,1700-1799,1710. 卡车上的最大单元数,卡车上的最大单元数,https://leetcode.cn/problems/maximum-units-on-a-truck/,maximum-units-on-a-truck,贪心、数组、排序,https://algo.itcharge.cn/Solutions/1700-1799/maximum-units-on-a-truck/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1710.%20%E5%8D%A1%E8%BD%A6%E4%B8%8A%E7%9A%84%E6%9C%80%E5%A4%A7%E5%8D%95%E5%85%83%E6%95%B0.md,73.4%,简单,583 -1711,1700-1799,1711. 大餐计数,大餐计数,https://leetcode.cn/problems/count-good-meals/,count-good-meals,数组、哈希表,https://algo.itcharge.cn/Solutions/1700-1799/count-good-meals/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1711.%20%E5%A4%A7%E9%A4%90%E8%AE%A1%E6%95%B0.md,36.0%,中等,389 -1712,1700-1799,1712. 将数组分成三个子数组的方案数,将数组分成三个子数组的方案数,https://leetcode.cn/problems/ways-to-split-array-into-three-subarrays/,ways-to-split-array-into-three-subarrays,数组、双指针、二分查找、前缀和,https://algo.itcharge.cn/Solutions/1700-1799/ways-to-split-array-into-three-subarrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1712.%20%E5%B0%86%E6%95%B0%E7%BB%84%E5%88%86%E6%88%90%E4%B8%89%E4%B8%AA%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%96%B9%E6%A1%88%E6%95%B0.md,28.5%,中等,175 -1713,1700-1799,1713. 得到子序列的最少操作次数,得到子序列的最少操作次数,https://leetcode.cn/problems/minimum-operations-to-make-a-subsequence/,minimum-operations-to-make-a-subsequence,贪心、数组、哈希表、二分查找,https://algo.itcharge.cn/Solutions/1700-1799/minimum-operations-to-make-a-subsequence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1713.%20%E5%BE%97%E5%88%B0%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0.md,49.9%,困难,198 -1714,1700-1799,1714. 数组中特殊等间距元素的和,数组中特殊等间距元素的和,https://leetcode.cn/problems/sum-of-special-evenly-spaced-elements-in-array/,sum-of-special-evenly-spaced-elements-in-array,数组、动态规划,https://algo.itcharge.cn/Solutions/1700-1799/sum-of-special-evenly-spaced-elements-in-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1714.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%89%B9%E6%AE%8A%E7%AD%89%E9%97%B4%E8%B7%9D%E5%85%83%E7%B4%A0%E7%9A%84%E5%92%8C.md,59.6%,困难,14 -1715,1700-1799,1715. 苹果和橘子的个数,苹果和橘子的个数,https://leetcode.cn/problems/count-apples-and-oranges/,count-apples-and-oranges,数据库,https://algo.itcharge.cn/Solutions/1700-1799/count-apples-and-oranges/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1715.%20%E8%8B%B9%E6%9E%9C%E5%92%8C%E6%A9%98%E5%AD%90%E7%9A%84%E4%B8%AA%E6%95%B0.md,71.7%,中等,57 -1716,1700-1799,1716. 计算力扣银行的钱,计算力扣银行的钱,https://leetcode.cn/problems/calculate-money-in-leetcode-bank/,calculate-money-in-leetcode-bank,数学,https://algo.itcharge.cn/Solutions/1700-1799/calculate-money-in-leetcode-bank/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1716.%20%E8%AE%A1%E7%AE%97%E5%8A%9B%E6%89%A3%E9%93%B6%E8%A1%8C%E7%9A%84%E9%92%B1.md,69.1%,简单,748 -1717,1700-1799,1717. 删除子字符串的最大得分,删除子字符串的最大得分,https://leetcode.cn/problems/maximum-score-from-removing-substrings/,maximum-score-from-removing-substrings,栈、贪心、字符串,https://algo.itcharge.cn/Solutions/1700-1799/maximum-score-from-removing-substrings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1717.%20%E5%88%A0%E9%99%A4%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%9C%80%E5%A4%A7%E5%BE%97%E5%88%86.md,46.1%,中等,85 -1718,1700-1799,1718. 构建字典序最大的可行序列,构建字典序最大的可行序列,https://leetcode.cn/problems/construct-the-lexicographically-largest-valid-sequence/,construct-the-lexicographically-largest-valid-sequence,数组、回溯,https://algo.itcharge.cn/Solutions/1700-1799/construct-the-lexicographically-largest-valid-sequence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1718.%20%E6%9E%84%E5%BB%BA%E5%AD%97%E5%85%B8%E5%BA%8F%E6%9C%80%E5%A4%A7%E7%9A%84%E5%8F%AF%E8%A1%8C%E5%BA%8F%E5%88%97.md,50.9%,中等,79 -1719,1700-1799,1719. 重构一棵树的方案数,重构一棵树的方案数,https://leetcode.cn/problems/number-of-ways-to-reconstruct-a-tree/,number-of-ways-to-reconstruct-a-tree,树、图,https://algo.itcharge.cn/Solutions/1700-1799/number-of-ways-to-reconstruct-a-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1719.%20%E9%87%8D%E6%9E%84%E4%B8%80%E6%A3%B5%E6%A0%91%E7%9A%84%E6%96%B9%E6%A1%88%E6%95%B0.md,69.0%,困难,93 -1720,1700-1799,1720. 解码异或后的数组,解码异或后的数组,https://leetcode.cn/problems/decode-xored-array/,decode-xored-array,位运算、数组,https://algo.itcharge.cn/Solutions/1700-1799/decode-xored-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1720.%20%E8%A7%A3%E7%A0%81%E5%BC%82%E6%88%96%E5%90%8E%E7%9A%84%E6%95%B0%E7%BB%84.md,86.0%,简单,598 -1721,1700-1799,1721. 交换链表中的节点,交换链表中的节点,https://leetcode.cn/problems/swapping-nodes-in-a-linked-list/,swapping-nodes-in-a-linked-list,链表、双指针,https://algo.itcharge.cn/Solutions/1700-1799/swapping-nodes-in-a-linked-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1721.%20%E4%BA%A4%E6%8D%A2%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E8%8A%82%E7%82%B9.md,63.8%,中等,301 -1722,1700-1799,1722. 执行交换操作后的最小汉明距离,执行交换操作后的最小汉明距离,https://leetcode.cn/problems/minimize-hamming-distance-after-swap-operations/,minimize-hamming-distance-after-swap-operations,深度优先搜索、并查集、数组,https://algo.itcharge.cn/Solutions/1700-1799/minimize-hamming-distance-after-swap-operations/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1722.%20%E6%89%A7%E8%A1%8C%E4%BA%A4%E6%8D%A2%E6%93%8D%E4%BD%9C%E5%90%8E%E7%9A%84%E6%9C%80%E5%B0%8F%E6%B1%89%E6%98%8E%E8%B7%9D%E7%A6%BB.md,51.0%,中等,149 -1723,1700-1799,1723. 完成所有工作的最短时间,完成所有工作的最短时间,https://leetcode.cn/problems/find-minimum-time-to-finish-all-jobs/,find-minimum-time-to-finish-all-jobs,位运算、数组、动态规划、回溯、状态压缩,https://algo.itcharge.cn/Solutions/1700-1799/find-minimum-time-to-finish-all-jobs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1723.%20%E5%AE%8C%E6%88%90%E6%89%80%E6%9C%89%E5%B7%A5%E4%BD%9C%E7%9A%84%E6%9C%80%E7%9F%AD%E6%97%B6%E9%97%B4.md,50.9%,困难,223 -1724,1700-1799,1724. 检查边长度限制的路径是否存在 II,检查边长度限制的路径是否存在 II,https://leetcode.cn/problems/checking-existence-of-edge-length-limited-paths-ii/,checking-existence-of-edge-length-limited-paths-ii,并查集、图、最小生成树,https://algo.itcharge.cn/Solutions/1700-1799/checking-existence-of-edge-length-limited-paths-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1724.%20%E6%A3%80%E6%9F%A5%E8%BE%B9%E9%95%BF%E5%BA%A6%E9%99%90%E5%88%B6%E7%9A%84%E8%B7%AF%E5%BE%84%E6%98%AF%E5%90%A6%E5%AD%98%E5%9C%A8%20II.md,58.5%,困难,22 -1725,1700-1799,1725. 可以形成最大正方形的矩形数目,可以形成最大正方形的矩形数目,https://leetcode.cn/problems/number-of-rectangles-that-can-form-the-largest-square/,number-of-rectangles-that-can-form-the-largest-square,数组,https://algo.itcharge.cn/Solutions/1700-1799/number-of-rectangles-that-can-form-the-largest-square/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1725.%20%E5%8F%AF%E4%BB%A5%E5%BD%A2%E6%88%90%E6%9C%80%E5%A4%A7%E6%AD%A3%E6%96%B9%E5%BD%A2%E7%9A%84%E7%9F%A9%E5%BD%A2%E6%95%B0%E7%9B%AE.md,82.8%,简单,485 -1726,1700-1799,1726. 同积元组,同积元组,https://leetcode.cn/problems/tuple-with-same-product/,tuple-with-same-product,数组、哈希表,https://algo.itcharge.cn/Solutions/1700-1799/tuple-with-same-product/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1726.%20%E5%90%8C%E7%A7%AF%E5%85%83%E7%BB%84.md,52.2%,中等,143 -1727,1700-1799,1727. 重新排列后的最大子矩阵,重新排列后的最大子矩阵,https://leetcode.cn/problems/largest-submatrix-with-rearrangements/,largest-submatrix-with-rearrangements,贪心、数组、矩阵、排序,https://algo.itcharge.cn/Solutions/1700-1799/largest-submatrix-with-rearrangements/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1727.%20%E9%87%8D%E6%96%B0%E6%8E%92%E5%88%97%E5%90%8E%E7%9A%84%E6%9C%80%E5%A4%A7%E5%AD%90%E7%9F%A9%E9%98%B5.md,59.2%,中等,94 -1728,1700-1799,1728. 猫和老鼠 II,猫和老鼠 II,https://leetcode.cn/problems/cat-and-mouse-ii/,cat-and-mouse-ii,图、拓扑排序、记忆化搜索、数组、数学、动态规划、博弈、矩阵,https://algo.itcharge.cn/Solutions/1700-1799/cat-and-mouse-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1728.%20%E7%8C%AB%E5%92%8C%E8%80%81%E9%BC%A0%20II.md,64.1%,困难,83 -1729,1700-1799,1729. 求关注者的数量,求关注者的数量,https://leetcode.cn/problems/find-followers-count/,find-followers-count,数据库,https://algo.itcharge.cn/Solutions/1700-1799/find-followers-count/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1729.%20%E6%B1%82%E5%85%B3%E6%B3%A8%E8%80%85%E7%9A%84%E6%95%B0%E9%87%8F.md,61.6%,简单,138 -1730,1700-1799,1730. 获取食物的最短路径,获取食物的最短路径,https://leetcode.cn/problems/shortest-path-to-get-food/,shortest-path-to-get-food,广度优先搜索、数组、矩阵,https://algo.itcharge.cn/Solutions/1700-1799/shortest-path-to-get-food/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1730.%20%E8%8E%B7%E5%8F%96%E9%A3%9F%E7%89%A9%E7%9A%84%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84.md,52.7%,中等,41 -1731,1700-1799,1731. 每位经理的下属员工数量,每位经理的下属员工数量,https://leetcode.cn/problems/the-number-of-employees-which-report-to-each-employee/,the-number-of-employees-which-report-to-each-employee,数据库,https://algo.itcharge.cn/Solutions/1700-1799/the-number-of-employees-which-report-to-each-employee/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1731.%20%E6%AF%8F%E4%BD%8D%E7%BB%8F%E7%90%86%E7%9A%84%E4%B8%8B%E5%B1%9E%E5%91%98%E5%B7%A5%E6%95%B0%E9%87%8F.md,47.0%,简单,103 -1732,1700-1799,1732. 找到最高海拔,找到最高海拔,https://leetcode.cn/problems/find-the-highest-altitude/,find-the-highest-altitude,数组、前缀和,https://algo.itcharge.cn/Solutions/1700-1799/find-the-highest-altitude/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1732.%20%E6%89%BE%E5%88%B0%E6%9C%80%E9%AB%98%E6%B5%B7%E6%8B%94.md,81.3%,简单,556 -1733,1700-1799,1733. 需要教语言的最少人数,需要教语言的最少人数,https://leetcode.cn/problems/minimum-number-of-people-to-teach/,minimum-number-of-people-to-teach,贪心、数组,https://algo.itcharge.cn/Solutions/1700-1799/minimum-number-of-people-to-teach/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1733.%20%E9%9C%80%E8%A6%81%E6%95%99%E8%AF%AD%E8%A8%80%E7%9A%84%E6%9C%80%E5%B0%91%E4%BA%BA%E6%95%B0.md,48.5%,中等,76 -1734,1700-1799,1734. 解码异或后的排列,解码异或后的排列,https://leetcode.cn/problems/decode-xored-permutation/,decode-xored-permutation,位运算、数组,https://algo.itcharge.cn/Solutions/1700-1799/decode-xored-permutation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1734.%20%E8%A7%A3%E7%A0%81%E5%BC%82%E6%88%96%E5%90%8E%E7%9A%84%E6%8E%92%E5%88%97.md,72.4%,中等,385 -1735,1700-1799,1735. 生成乘积数组的方案数,生成乘积数组的方案数,https://leetcode.cn/problems/count-ways-to-make-array-with-product/,count-ways-to-make-array-with-product,数组、数学、动态规划、组合数学、数论,https://algo.itcharge.cn/Solutions/1700-1799/count-ways-to-make-array-with-product/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1735.%20%E7%94%9F%E6%88%90%E4%B9%98%E7%A7%AF%E6%95%B0%E7%BB%84%E7%9A%84%E6%96%B9%E6%A1%88%E6%95%B0.md,52.2%,困难,50 -1736,1700-1799,1736. 替换隐藏数字得到的最晚时间,替换隐藏数字得到的最晚时间,https://leetcode.cn/problems/latest-time-by-replacing-hidden-digits/,latest-time-by-replacing-hidden-digits,贪心、字符串,https://algo.itcharge.cn/Solutions/1700-1799/latest-time-by-replacing-hidden-digits/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1736.%20%E6%9B%BF%E6%8D%A2%E9%9A%90%E8%97%8F%E6%95%B0%E5%AD%97%E5%BE%97%E5%88%B0%E7%9A%84%E6%9C%80%E6%99%9A%E6%97%B6%E9%97%B4.md,44.5%,简单,421 -1737,1700-1799,1737. 满足三条件之一需改变的最少字符数,满足三条件之一需改变的最少字符数,https://leetcode.cn/problems/change-minimum-characters-to-satisfy-one-of-three-conditions/,change-minimum-characters-to-satisfy-one-of-three-conditions,哈希表、字符串、计数、前缀和,https://algo.itcharge.cn/Solutions/1700-1799/change-minimum-characters-to-satisfy-one-of-three-conditions/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1737.%20%E6%BB%A1%E8%B6%B3%E4%B8%89%E6%9D%A1%E4%BB%B6%E4%B9%8B%E4%B8%80%E9%9C%80%E6%94%B9%E5%8F%98%E7%9A%84%E6%9C%80%E5%B0%91%E5%AD%97%E7%AC%A6%E6%95%B0.md,35.8%,中等,130 -1738,1700-1799,1738. 找出第 K 大的异或坐标值,找出第 K 大的异或坐标值,https://leetcode.cn/problems/find-kth-largest-xor-coordinate-value/,find-kth-largest-xor-coordinate-value,位运算、数组、分治、矩阵、前缀和、快速选择、堆（优先队列）,https://algo.itcharge.cn/Solutions/1700-1799/find-kth-largest-xor-coordinate-value/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1738.%20%E6%89%BE%E5%87%BA%E7%AC%AC%20K%20%E5%A4%A7%E7%9A%84%E5%BC%82%E6%88%96%E5%9D%90%E6%A0%87%E5%80%BC.md,65.1%,中等,431 -1739,1700-1799,1739. 放置盒子,放置盒子,https://leetcode.cn/problems/building-boxes/,building-boxes,贪心、数学、二分查找,https://algo.itcharge.cn/Solutions/1700-1799/building-boxes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1739.%20%E6%94%BE%E7%BD%AE%E7%9B%92%E5%AD%90.md,64.4%,困难,133 -1740,1700-1799,1740. 找到二叉树中的距离,找到二叉树中的距离,https://leetcode.cn/problems/find-distance-in-a-binary-tree/,find-distance-in-a-binary-tree,树、深度优先搜索、广度优先搜索、哈希表、二叉树,https://algo.itcharge.cn/Solutions/1700-1799/find-distance-in-a-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1740.%20%E6%89%BE%E5%88%B0%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E7%9A%84%E8%B7%9D%E7%A6%BB.md,67.1%,中等,55 -1741,1700-1799,1741. 查找每个员工花费的总时间,查找每个员工花费的总时间,https://leetcode.cn/problems/find-total-time-spent-by-each-employee/,find-total-time-spent-by-each-employee,数据库,https://algo.itcharge.cn/Solutions/1700-1799/find-total-time-spent-by-each-employee/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1741.%20%E6%9F%A5%E6%89%BE%E6%AF%8F%E4%B8%AA%E5%91%98%E5%B7%A5%E8%8A%B1%E8%B4%B9%E7%9A%84%E6%80%BB%E6%97%B6%E9%97%B4.md,84.6%,简单,177 -1742,1700-1799,1742. 盒子中小球的最大数量,盒子中小球的最大数量,https://leetcode.cn/problems/maximum-number-of-balls-in-a-box/,maximum-number-of-balls-in-a-box,哈希表、数学、计数,https://algo.itcharge.cn/Solutions/1700-1799/maximum-number-of-balls-in-a-box/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1742.%20%E7%9B%92%E5%AD%90%E4%B8%AD%E5%B0%8F%E7%90%83%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E9%87%8F.md,75.8%,简单,390 -1743,1700-1799,1743. 从相邻元素对还原数组,从相邻元素对还原数组,https://leetcode.cn/problems/restore-the-array-from-adjacent-pairs/,restore-the-array-from-adjacent-pairs,数组、哈希表,https://algo.itcharge.cn/Solutions/1700-1799/restore-the-array-from-adjacent-pairs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1743.%20%E4%BB%8E%E7%9B%B8%E9%82%BB%E5%85%83%E7%B4%A0%E5%AF%B9%E8%BF%98%E5%8E%9F%E6%95%B0%E7%BB%84.md,69.6%,中等,357 -1744,1700-1799,1744. 你能在你最喜欢的那天吃到你最喜欢的糖果吗？,你能在你最喜欢的那天吃到你最喜欢的糖果吗？,https://leetcode.cn/problems/can-you-eat-your-favorite-candy-on-your-favorite-day/,can-you-eat-your-favorite-candy-on-your-favorite-day,数组、前缀和,https://algo.itcharge.cn/Solutions/1700-1799/can-you-eat-your-favorite-candy-on-your-favorite-day/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1744.%20%E4%BD%A0%E8%83%BD%E5%9C%A8%E4%BD%A0%E6%9C%80%E5%96%9C%E6%AC%A2%E7%9A%84%E9%82%A3%E5%A4%A9%E5%90%83%E5%88%B0%E4%BD%A0%E6%9C%80%E5%96%9C%E6%AC%A2%E7%9A%84%E7%B3%96%E6%9E%9C%E5%90%97%EF%BC%9F.md,36.4%,中等,392 -1745,1700-1799,1745. 回文串分割 IV,回文串分割 IV,https://leetcode.cn/problems/palindrome-partitioning-iv/,palindrome-partitioning-iv,字符串、动态规划,https://algo.itcharge.cn/Solutions/1700-1799/palindrome-partitioning-iv/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1745.%20%E5%9B%9E%E6%96%87%E4%B8%B2%E5%88%86%E5%89%B2%20IV.md,50.6%,困难,108 -1746,1700-1799,1746. 经过一次操作后的最大子数组和,经过一次操作后的最大子数组和,https://leetcode.cn/problems/maximum-subarray-sum-after-one-operation/,maximum-subarray-sum-after-one-operation,数组、动态规划,https://algo.itcharge.cn/Solutions/1700-1799/maximum-subarray-sum-after-one-operation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1746.%20%E7%BB%8F%E8%BF%87%E4%B8%80%E6%AC%A1%E6%93%8D%E4%BD%9C%E5%90%8E%E7%9A%84%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84%E5%92%8C.md,60.6%,中等,77 -1747,1700-1799,1747. 应该被禁止的 Leetflex 账户,应该被禁止的 Leetflex 账户,https://leetcode.cn/problems/leetflex-banned-accounts/,leetflex-banned-accounts,数据库,https://algo.itcharge.cn/Solutions/1700-1799/leetflex-banned-accounts/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1747.%20%E5%BA%94%E8%AF%A5%E8%A2%AB%E7%A6%81%E6%AD%A2%E7%9A%84%20Leetflex%20%E8%B4%A6%E6%88%B7.md,65.5%,中等,87 -1748,1700-1799,1748. 唯一元素的和,唯一元素的和,https://leetcode.cn/problems/sum-of-unique-elements/,sum-of-unique-elements,数组、哈希表、计数,https://algo.itcharge.cn/Solutions/1700-1799/sum-of-unique-elements/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1748.%20%E5%94%AF%E4%B8%80%E5%85%83%E7%B4%A0%E7%9A%84%E5%92%8C.md,76.8%,简单,645 -1749,1700-1799,1749. 任意子数组和的绝对值的最大值,任意子数组和的绝对值的最大值,https://leetcode.cn/problems/maximum-absolute-sum-of-any-subarray/,maximum-absolute-sum-of-any-subarray,数组、动态规划,https://algo.itcharge.cn/Solutions/1700-1799/maximum-absolute-sum-of-any-subarray/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1749.%20%E4%BB%BB%E6%84%8F%E5%AD%90%E6%95%B0%E7%BB%84%E5%92%8C%E7%9A%84%E7%BB%9D%E5%AF%B9%E5%80%BC%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md,54.4%,中等,147 -1750,1700-1799,1750. 删除字符串两端相同字符后的最短长度,删除字符串两端相同字符后的最短长度,https://leetcode.cn/problems/minimum-length-of-string-after-deleting-similar-ends/,minimum-length-of-string-after-deleting-similar-ends,双指针、字符串,https://algo.itcharge.cn/Solutions/1700-1799/minimum-length-of-string-after-deleting-similar-ends/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1750.%20%E5%88%A0%E9%99%A4%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%A4%E7%AB%AF%E7%9B%B8%E5%90%8C%E5%AD%97%E7%AC%A6%E5%90%8E%E7%9A%84%E6%9C%80%E7%9F%AD%E9%95%BF%E5%BA%A6.md,50.6%,中等,294 -1751,1700-1799,1751. 最多可以参加的会议数目 II,最多可以参加的会议数目 II,https://leetcode.cn/problems/maximum-number-of-events-that-can-be-attended-ii/,maximum-number-of-events-that-can-be-attended-ii,数组、二分查找、动态规划、排序,https://algo.itcharge.cn/Solutions/1700-1799/maximum-number-of-events-that-can-be-attended-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1751.%20%E6%9C%80%E5%A4%9A%E5%8F%AF%E4%BB%A5%E5%8F%82%E5%8A%A0%E7%9A%84%E4%BC%9A%E8%AE%AE%E6%95%B0%E7%9B%AE%20II.md,54.2%,困难,90 -1752,1700-1799,1752. 检查数组是否经排序和轮转得到,检查数组是否经排序和轮转得到,https://leetcode.cn/problems/check-if-array-is-sorted-and-rotated/,check-if-array-is-sorted-and-rotated,数组,https://algo.itcharge.cn/Solutions/1700-1799/check-if-array-is-sorted-and-rotated/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1752.%20%E6%A3%80%E6%9F%A5%E6%95%B0%E7%BB%84%E6%98%AF%E5%90%A6%E7%BB%8F%E6%8E%92%E5%BA%8F%E5%92%8C%E8%BD%AE%E8%BD%AC%E5%BE%97%E5%88%B0.md,58.1%,简单,409 -1753,1700-1799,1753. 移除石子的最大得分,移除石子的最大得分,https://leetcode.cn/problems/maximum-score-from-removing-stones/,maximum-score-from-removing-stones,贪心、数学、堆（优先队列）,https://algo.itcharge.cn/Solutions/1700-1799/maximum-score-from-removing-stones/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1753.%20%E7%A7%BB%E9%99%A4%E7%9F%B3%E5%AD%90%E7%9A%84%E6%9C%80%E5%A4%A7%E5%BE%97%E5%88%86.md,70.7%,中等,336 -1754,1700-1799,1754. 构造字典序最大的合并字符串,构造字典序最大的合并字符串,https://leetcode.cn/problems/largest-merge-of-two-strings/,largest-merge-of-two-strings,贪心、双指针、字符串,https://algo.itcharge.cn/Solutions/1700-1799/largest-merge-of-two-strings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1754.%20%E6%9E%84%E9%80%A0%E5%AD%97%E5%85%B8%E5%BA%8F%E6%9C%80%E5%A4%A7%E7%9A%84%E5%90%88%E5%B9%B6%E5%AD%97%E7%AC%A6%E4%B8%B2.md,56.3%,中等,209 -1755,1700-1799,1755. 最接近目标值的子序列和,最接近目标值的子序列和,https://leetcode.cn/problems/closest-subsequence-sum/,closest-subsequence-sum,位运算、数组、双指针、动态规划、状态压缩,https://algo.itcharge.cn/Solutions/1700-1799/closest-subsequence-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1755.%20%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9B%AE%E6%A0%87%E5%80%BC%E7%9A%84%E5%AD%90%E5%BA%8F%E5%88%97%E5%92%8C.md,45.0%,困难,91 -1756,1700-1799,1756. 设计最近使用（MRU）队列,设计最近使用（MRU）队列,https://leetcode.cn/problems/design-most-recently-used-queue/,design-most-recently-used-queue,栈、设计、树状数组、数组、哈希表、有序集合,https://algo.itcharge.cn/Solutions/1700-1799/design-most-recently-used-queue/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1756.%20%E8%AE%BE%E8%AE%A1%E6%9C%80%E8%BF%91%E4%BD%BF%E7%94%A8%EF%BC%88MRU%EF%BC%89%E9%98%9F%E5%88%97.md,82.0%,中等,34 -1757,1700-1799,1757. 可回收且低脂的产品,可回收且低脂的产品,https://leetcode.cn/problems/recyclable-and-low-fat-products/,recyclable-and-low-fat-products,数据库,https://algo.itcharge.cn/Solutions/1700-1799/recyclable-and-low-fat-products/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1757.%20%E5%8F%AF%E5%9B%9E%E6%94%B6%E4%B8%94%E4%BD%8E%E8%84%82%E7%9A%84%E4%BA%A7%E5%93%81.md,87.7%,简单,279 -1758,1700-1799,1758. 生成交替二进制字符串的最少操作数,生成交替二进制字符串的最少操作数,https://leetcode.cn/problems/minimum-changes-to-make-alternating-binary-string/,minimum-changes-to-make-alternating-binary-string,字符串,https://algo.itcharge.cn/Solutions/1700-1799/minimum-changes-to-make-alternating-binary-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1758.%20%E7%94%9F%E6%88%90%E4%BA%A4%E6%9B%BF%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%95%B0.md,69.7%,简单,451 -1759,1700-1799,1759. 统计同质子字符串的数目,统计同质子字符串的数目,https://leetcode.cn/problems/count-number-of-homogenous-substrings/,count-number-of-homogenous-substrings,数学、字符串,https://algo.itcharge.cn/Solutions/1700-1799/count-number-of-homogenous-substrings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1759.%20%E7%BB%9F%E8%AE%A1%E5%90%8C%E8%B4%A8%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%95%B0%E7%9B%AE.md,51.1%,中等,272 -1760,1700-1799,1760. 袋子里最少数目的球,袋子里最少数目的球,https://leetcode.cn/problems/minimum-limit-of-balls-in-a-bag/,minimum-limit-of-balls-in-a-bag,数组、二分查找,https://algo.itcharge.cn/Solutions/1700-1799/minimum-limit-of-balls-in-a-bag/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1760.%20%E8%A2%8B%E5%AD%90%E9%87%8C%E6%9C%80%E5%B0%91%E6%95%B0%E7%9B%AE%E7%9A%84%E7%90%83.md,64.1%,中等,280 -1761,1700-1799,1761. 一个图中连通三元组的最小度数,一个图中连通三元组的最小度数,https://leetcode.cn/problems/minimum-degree-of-a-connected-trio-in-a-graph/,minimum-degree-of-a-connected-trio-in-a-graph,图,https://algo.itcharge.cn/Solutions/1700-1799/minimum-degree-of-a-connected-trio-in-a-graph/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1761.%20%E4%B8%80%E4%B8%AA%E5%9B%BE%E4%B8%AD%E8%BF%9E%E9%80%9A%E4%B8%89%E5%85%83%E7%BB%84%E7%9A%84%E6%9C%80%E5%B0%8F%E5%BA%A6%E6%95%B0.md,46.1%,困难,52 -1762,1700-1799,1762. 能看到海景的建筑物,能看到海景的建筑物,https://leetcode.cn/problems/buildings-with-an-ocean-view/,buildings-with-an-ocean-view,栈、数组、单调栈,https://algo.itcharge.cn/Solutions/1700-1799/buildings-with-an-ocean-view/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1762.%20%E8%83%BD%E7%9C%8B%E5%88%B0%E6%B5%B7%E6%99%AF%E7%9A%84%E5%BB%BA%E7%AD%91%E7%89%A9.md,71.4%,中等,47 -1763,1700-1799,1763. 最长的美好子字符串,最长的美好子字符串,https://leetcode.cn/problems/longest-nice-substring/,longest-nice-substring,位运算、哈希表、字符串、分治、滑动窗口,https://algo.itcharge.cn/Solutions/1700-1799/longest-nice-substring/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1763.%20%E6%9C%80%E9%95%BF%E7%9A%84%E7%BE%8E%E5%A5%BD%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md,67.2%,简单,307 -1764,1700-1799,1764. 通过连接另一个数组的子数组得到一个数组,通过连接另一个数组的子数组得到一个数组,https://leetcode.cn/problems/form-array-by-concatenating-subarrays-of-another-array/,form-array-by-concatenating-subarrays-of-another-array,贪心、数组、字符串匹配,https://algo.itcharge.cn/Solutions/1700-1799/form-array-by-concatenating-subarrays-of-another-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1764.%20%E9%80%9A%E8%BF%87%E8%BF%9E%E6%8E%A5%E5%8F%A6%E4%B8%80%E4%B8%AA%E6%95%B0%E7%BB%84%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84%E5%BE%97%E5%88%B0%E4%B8%80%E4%B8%AA%E6%95%B0%E7%BB%84.md,55.7%,中等,258 -1765,1700-1799,1765. 地图中的最高点,地图中的最高点,https://leetcode.cn/problems/map-of-highest-peak/,map-of-highest-peak,广度优先搜索、数组、矩阵,https://algo.itcharge.cn/Solutions/1700-1799/map-of-highest-peak/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1765.%20%E5%9C%B0%E5%9B%BE%E4%B8%AD%E7%9A%84%E6%9C%80%E9%AB%98%E7%82%B9.md,66.4%,中等,328 -1766,1700-1799,1766. 互质树,互质树,https://leetcode.cn/problems/tree-of-coprimes/,tree-of-coprimes,树、深度优先搜索、广度优先搜索、数学,https://algo.itcharge.cn/Solutions/1700-1799/tree-of-coprimes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1766.%20%E4%BA%92%E8%B4%A8%E6%A0%91.md,40.2%,困难,47 -1767,1700-1799,1767. 寻找没有被执行的任务对,寻找没有被执行的任务对,https://leetcode.cn/problems/find-the-subtasks-that-did-not-execute/,find-the-subtasks-that-did-not-execute,数据库,https://algo.itcharge.cn/Solutions/1700-1799/find-the-subtasks-that-did-not-execute/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1767.%20%E5%AF%BB%E6%89%BE%E6%B2%A1%E6%9C%89%E8%A2%AB%E6%89%A7%E8%A1%8C%E7%9A%84%E4%BB%BB%E5%8A%A1%E5%AF%B9.md,80.2%,困难,61 -1768,1700-1799,1768. 交替合并字符串,交替合并字符串,https://leetcode.cn/problems/merge-strings-alternately/,merge-strings-alternately,双指针、字符串,https://algo.itcharge.cn/Solutions/1700-1799/merge-strings-alternately/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1768.%20%E4%BA%A4%E6%9B%BF%E5%90%88%E5%B9%B6%E5%AD%97%E7%AC%A6%E4%B8%B2.md,76.6%,简单,824 -1769,1700-1799,1769. 移动所有球到每个盒子所需的最小操作数,移动所有球到每个盒子所需的最小操作数,https://leetcode.cn/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/,minimum-number-of-operations-to-move-all-balls-to-each-box,数组、字符串,https://algo.itcharge.cn/Solutions/1700-1799/minimum-number-of-operations-to-move-all-balls-to-each-box/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1769.%20%E7%A7%BB%E5%8A%A8%E6%89%80%E6%9C%89%E7%90%83%E5%88%B0%E6%AF%8F%E4%B8%AA%E7%9B%92%E5%AD%90%E6%89%80%E9%9C%80%E7%9A%84%E6%9C%80%E5%B0%8F%E6%93%8D%E4%BD%9C%E6%95%B0.md,87.9%,中等,562 -1770,1700-1799,1770. 执行乘法运算的最大分数,执行乘法运算的最大分数,https://leetcode.cn/problems/maximum-score-from-performing-multiplication-operations/,maximum-score-from-performing-multiplication-operations,数组、动态规划,https://algo.itcharge.cn/Solutions/1700-1799/maximum-score-from-performing-multiplication-operations/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1770.%20%E6%89%A7%E8%A1%8C%E4%B9%98%E6%B3%95%E8%BF%90%E7%AE%97%E7%9A%84%E6%9C%80%E5%A4%A7%E5%88%86%E6%95%B0.md,39.6%,困难,131 -1771,1700-1799,1771. 由子序列构造的最长回文串的长度,由子序列构造的最长回文串的长度,https://leetcode.cn/problems/maximize-palindrome-length-from-subsequences/,maximize-palindrome-length-from-subsequences,字符串、动态规划,https://algo.itcharge.cn/Solutions/1700-1799/maximize-palindrome-length-from-subsequences/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1771.%20%E7%94%B1%E5%AD%90%E5%BA%8F%E5%88%97%E6%9E%84%E9%80%A0%E7%9A%84%E6%9C%80%E9%95%BF%E5%9B%9E%E6%96%87%E4%B8%B2%E7%9A%84%E9%95%BF%E5%BA%A6.md,38.4%,困难,64 -1772,1700-1799,1772. 按受欢迎程度排列功能,按受欢迎程度排列功能,https://leetcode.cn/problems/sort-features-by-popularity/,sort-features-by-popularity,数组、哈希表、字符串、排序,https://algo.itcharge.cn/Solutions/1700-1799/sort-features-by-popularity/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1772.%20%E6%8C%89%E5%8F%97%E6%AC%A2%E8%BF%8E%E7%A8%8B%E5%BA%A6%E6%8E%92%E5%88%97%E5%8A%9F%E8%83%BD.md,47.2%,中等,21 -1773,1700-1799,1773. 统计匹配检索规则的物品数量,统计匹配检索规则的物品数量,https://leetcode.cn/problems/count-items-matching-a-rule/,count-items-matching-a-rule,数组、字符串,https://algo.itcharge.cn/Solutions/1700-1799/count-items-matching-a-rule/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1773.%20%E7%BB%9F%E8%AE%A1%E5%8C%B9%E9%85%8D%E6%A3%80%E7%B4%A2%E8%A7%84%E5%88%99%E7%9A%84%E7%89%A9%E5%93%81%E6%95%B0%E9%87%8F.md,86.5%,简单,507 -1774,1700-1799,1774. 最接近目标价格的甜点成本,最接近目标价格的甜点成本,https://leetcode.cn/problems/closest-dessert-cost/,closest-dessert-cost,数组、动态规划、回溯,https://algo.itcharge.cn/Solutions/1700-1799/closest-dessert-cost/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1774.%20%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9B%AE%E6%A0%87%E4%BB%B7%E6%A0%BC%E7%9A%84%E7%94%9C%E7%82%B9%E6%88%90%E6%9C%AC.md,57.5%,中等,304 -1775,1700-1799,1775. 通过最少操作次数使数组的和相等,通过最少操作次数使数组的和相等,https://leetcode.cn/problems/equal-sum-arrays-with-minimum-number-of-operations/,equal-sum-arrays-with-minimum-number-of-operations,贪心、数组、哈希表、计数,https://algo.itcharge.cn/Solutions/1700-1799/equal-sum-arrays-with-minimum-number-of-operations/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1775.%20%E9%80%9A%E8%BF%87%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0%E4%BD%BF%E6%95%B0%E7%BB%84%E7%9A%84%E5%92%8C%E7%9B%B8%E7%AD%89.md,56.4%,中等,361 -1776,1700-1799,1776. 车队 II,车队 II,https://leetcode.cn/problems/car-fleet-ii/,car-fleet-ii,栈、数组、数学、单调栈、堆（优先队列）,https://algo.itcharge.cn/Solutions/1700-1799/car-fleet-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1776.%20%E8%BD%A6%E9%98%9F%20II.md,48.5%,困难,65 -1777,1700-1799,1777. 每家商店的产品价格,每家商店的产品价格,https://leetcode.cn/problems/products-price-for-each-store/,products-price-for-each-store,数据库,https://algo.itcharge.cn/Solutions/1700-1799/products-price-for-each-store/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1777.%20%E6%AF%8F%E5%AE%B6%E5%95%86%E5%BA%97%E7%9A%84%E4%BA%A7%E5%93%81%E4%BB%B7%E6%A0%BC.md,78.3%,简单,85 -1778,1700-1799,1778. 未知网格中的最短路径,未知网格中的最短路径,https://leetcode.cn/problems/shortest-path-in-a-hidden-grid/,shortest-path-in-a-hidden-grid,深度优先搜索、广度优先搜索、图、交互,https://algo.itcharge.cn/Solutions/1700-1799/shortest-path-in-a-hidden-grid/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1778.%20%E6%9C%AA%E7%9F%A5%E7%BD%91%E6%A0%BC%E4%B8%AD%E7%9A%84%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84.md,48.1%,中等,16 -1779,1700-1799,1779. 找到最近的有相同 X 或 Y 坐标的点,找到最近的有相同 X 或 Y 坐标的点,https://leetcode.cn/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate/,find-nearest-point-that-has-the-same-x-or-y-coordinate,数组,https://algo.itcharge.cn/Solutions/1700-1799/find-nearest-point-that-has-the-same-x-or-y-coordinate/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1779.%20%E6%89%BE%E5%88%B0%E6%9C%80%E8%BF%91%E7%9A%84%E6%9C%89%E7%9B%B8%E5%90%8C%20X%20%E6%88%96%20Y%20%E5%9D%90%E6%A0%87%E7%9A%84%E7%82%B9.md,69.0%,简单,547 -1780,1700-1799,1780. 判断一个数字是否可以表示成三的幂的和,判断一个数字是否可以表示成三的幂的和,https://leetcode.cn/problems/check-if-number-is-a-sum-of-powers-of-three/,check-if-number-is-a-sum-of-powers-of-three,数学,https://algo.itcharge.cn/Solutions/1700-1799/check-if-number-is-a-sum-of-powers-of-three/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1780.%20%E5%88%A4%E6%96%AD%E4%B8%80%E4%B8%AA%E6%95%B0%E5%AD%97%E6%98%AF%E5%90%A6%E5%8F%AF%E4%BB%A5%E8%A1%A8%E7%A4%BA%E6%88%90%E4%B8%89%E7%9A%84%E5%B9%82%E7%9A%84%E5%92%8C.md,74.8%,中等,503 -1781,1700-1799,1781. 所有子字符串美丽值之和,所有子字符串美丽值之和,https://leetcode.cn/problems/sum-of-beauty-of-all-substrings/,sum-of-beauty-of-all-substrings,哈希表、字符串、计数,https://algo.itcharge.cn/Solutions/1700-1799/sum-of-beauty-of-all-substrings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1781.%20%E6%89%80%E6%9C%89%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%BE%8E%E4%B8%BD%E5%80%BC%E4%B9%8B%E5%92%8C.md,66.5%,中等,226 -1782,1700-1799,1782. 统计点对的数目,统计点对的数目,https://leetcode.cn/problems/count-pairs-of-nodes/,count-pairs-of-nodes,图、双指针、二分查找,https://algo.itcharge.cn/Solutions/1700-1799/count-pairs-of-nodes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1782.%20%E7%BB%9F%E8%AE%A1%E7%82%B9%E5%AF%B9%E7%9A%84%E6%95%B0%E7%9B%AE.md,35.7%,困难,52 -1783,1700-1799,1783. 大满贯数量,大满贯数量,https://leetcode.cn/problems/grand-slam-titles/,grand-slam-titles,数据库,https://algo.itcharge.cn/Solutions/1700-1799/grand-slam-titles/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1783.%20%E5%A4%A7%E6%BB%A1%E8%B4%AF%E6%95%B0%E9%87%8F.md,80.5%,中等,86 -1784,1700-1799,1784. 检查二进制字符串字段,检查二进制字符串字段,https://leetcode.cn/problems/check-if-binary-string-has-at-most-one-segment-of-ones/,check-if-binary-string-has-at-most-one-segment-of-ones,字符串,https://algo.itcharge.cn/Solutions/1700-1799/check-if-binary-string-has-at-most-one-segment-of-ones/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1784.%20%E6%A3%80%E6%9F%A5%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%AD%97%E6%AE%B5.md,59.5%,简单,541 -1785,1700-1799,1785. 构成特定和需要添加的最少元素,构成特定和需要添加的最少元素,https://leetcode.cn/problems/minimum-elements-to-add-to-form-a-given-sum/,minimum-elements-to-add-to-form-a-given-sum,贪心、数组,https://algo.itcharge.cn/Solutions/1700-1799/minimum-elements-to-add-to-form-a-given-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1785.%20%E6%9E%84%E6%88%90%E7%89%B9%E5%AE%9A%E5%92%8C%E9%9C%80%E8%A6%81%E6%B7%BB%E5%8A%A0%E7%9A%84%E6%9C%80%E5%B0%91%E5%85%83%E7%B4%A0.md,43.5%,中等,292 -1786,1700-1799,1786. 从第一个节点出发到最后一个节点的受限路径数,从第一个节点出发到最后一个节点的受限路径数,https://leetcode.cn/problems/number-of-restricted-paths-from-first-to-last-node/,number-of-restricted-paths-from-first-to-last-node,图、拓扑排序、动态规划、最短路、堆（优先队列）,https://algo.itcharge.cn/Solutions/1700-1799/number-of-restricted-paths-from-first-to-last-node/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1786.%20%E4%BB%8E%E7%AC%AC%E4%B8%80%E4%B8%AA%E8%8A%82%E7%82%B9%E5%87%BA%E5%8F%91%E5%88%B0%E6%9C%80%E5%90%8E%E4%B8%80%E4%B8%AA%E8%8A%82%E7%82%B9%E7%9A%84%E5%8F%97%E9%99%90%E8%B7%AF%E5%BE%84%E6%95%B0.md,36.4%,中等,133 -1787,1700-1799,1787. 使所有区间的异或结果为零,使所有区间的异或结果为零,https://leetcode.cn/problems/make-the-xor-of-all-segments-equal-to-zero/,make-the-xor-of-all-segments-equal-to-zero,位运算、数组、动态规划,https://algo.itcharge.cn/Solutions/1700-1799/make-the-xor-of-all-segments-equal-to-zero/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1787.%20%E4%BD%BF%E6%89%80%E6%9C%89%E5%8C%BA%E9%97%B4%E7%9A%84%E5%BC%82%E6%88%96%E7%BB%93%E6%9E%9C%E4%B8%BA%E9%9B%B6.md,64.3%,困难,66 -1788,1700-1799,1788. 最大化花园的美观度,最大化花园的美观度,https://leetcode.cn/problems/maximize-the-beauty-of-the-garden/,maximize-the-beauty-of-the-garden,贪心、数组、前缀和,https://algo.itcharge.cn/Solutions/1700-1799/maximize-the-beauty-of-the-garden/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1788.%20%E6%9C%80%E5%A4%A7%E5%8C%96%E8%8A%B1%E5%9B%AD%E7%9A%84%E7%BE%8E%E8%A7%82%E5%BA%A6.md,65.5%,困难,32 -1789,1700-1799,1789. 员工的直属部门,员工的直属部门,https://leetcode.cn/problems/primary-department-for-each-employee/,primary-department-for-each-employee,数据库,https://algo.itcharge.cn/Solutions/1700-1799/primary-department-for-each-employee/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1789.%20%E5%91%98%E5%B7%A5%E7%9A%84%E7%9B%B4%E5%B1%9E%E9%83%A8%E9%97%A8.md,71.7%,简单,81 -1790,1700-1799,1790. 仅执行一次字符串交换能否使两个字符串相等,仅执行一次字符串交换能否使两个字符串相等,https://leetcode.cn/problems/check-if-one-string-swap-can-make-strings-equal/,check-if-one-string-swap-can-make-strings-equal,哈希表、字符串、计数,https://algo.itcharge.cn/Solutions/1700-1799/check-if-one-string-swap-can-make-strings-equal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1790.%20%E4%BB%85%E6%89%A7%E8%A1%8C%E4%B8%80%E6%AC%A1%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%BA%A4%E6%8D%A2%E8%83%BD%E5%90%A6%E4%BD%BF%E4%B8%A4%E4%B8%AA%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E7%AD%89.md,52.5%,简单,868 -1791,1700-1799,1791. 找出星型图的中心节点,找出星型图的中心节点,https://leetcode.cn/problems/find-center-of-star-graph/,find-center-of-star-graph,图,https://algo.itcharge.cn/Solutions/1700-1799/find-center-of-star-graph/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1791.%20%E6%89%BE%E5%87%BA%E6%98%9F%E5%9E%8B%E5%9B%BE%E7%9A%84%E4%B8%AD%E5%BF%83%E8%8A%82%E7%82%B9.md,83.1%,简单,507 -1792,1700-1799,1792. 最大平均通过率,最大平均通过率,https://leetcode.cn/problems/maximum-average-pass-ratio/,maximum-average-pass-ratio,贪心、数组、堆（优先队列）,https://algo.itcharge.cn/Solutions/1700-1799/maximum-average-pass-ratio/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1792.%20%E6%9C%80%E5%A4%A7%E5%B9%B3%E5%9D%87%E9%80%9A%E8%BF%87%E7%8E%87.md,58.8%,中等,255 -1793,1700-1799,1793. 好子数组的最大分数,好子数组的最大分数,https://leetcode.cn/problems/maximum-score-of-a-good-subarray/,maximum-score-of-a-good-subarray,栈、数组、双指针、二分查找、单调栈,https://algo.itcharge.cn/Solutions/1700-1799/maximum-score-of-a-good-subarray/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1793.%20%E5%A5%BD%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%88%86%E6%95%B0.md,45.5%,困难,129 -1794,1700-1799,1794. 统计距离最小的子串对个数,统计距离最小的子串对个数,https://leetcode.cn/problems/count-pairs-of-equal-substrings-with-minimum-difference/,count-pairs-of-equal-substrings-with-minimum-difference,贪心、哈希表、字符串,https://algo.itcharge.cn/Solutions/1700-1799/count-pairs-of-equal-substrings-with-minimum-difference/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1794.%20%E7%BB%9F%E8%AE%A1%E8%B7%9D%E7%A6%BB%E6%9C%80%E5%B0%8F%E7%9A%84%E5%AD%90%E4%B8%B2%E5%AF%B9%E4%B8%AA%E6%95%B0.md,55.3%,中等,13 -1795,1700-1799,1795. 每个产品在不同商店的价格,每个产品在不同商店的价格,https://leetcode.cn/problems/rearrange-products-table/,rearrange-products-table,数据库,https://algo.itcharge.cn/Solutions/1700-1799/rearrange-products-table/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1795.%20%E6%AF%8F%E4%B8%AA%E4%BA%A7%E5%93%81%E5%9C%A8%E4%B8%8D%E5%90%8C%E5%95%86%E5%BA%97%E7%9A%84%E4%BB%B7%E6%A0%BC.md,78.2%,简单,178 -1796,1700-1799,1796. 字符串中第二大的数字,字符串中第二大的数字,https://leetcode.cn/problems/second-largest-digit-in-a-string/,second-largest-digit-in-a-string,哈希表、字符串,https://algo.itcharge.cn/Solutions/1700-1799/second-largest-digit-in-a-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1796.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%AC%AC%E4%BA%8C%E5%A4%A7%E7%9A%84%E6%95%B0%E5%AD%97.md,54.9%,简单,456 -1797,1700-1799,1797. 设计一个验证系统,设计一个验证系统,https://leetcode.cn/problems/design-authentication-manager/,design-authentication-manager,设计、哈希表,https://algo.itcharge.cn/Solutions/1700-1799/design-authentication-manager/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1797.%20%E8%AE%BE%E8%AE%A1%E4%B8%80%E4%B8%AA%E9%AA%8C%E8%AF%81%E7%B3%BB%E7%BB%9F.md,65.0%,中等,347 -1798,1700-1799,1798. 你能构造出连续值的最大数目,你能构造出连续值的最大数目,https://leetcode.cn/problems/maximum-number-of-consecutive-values-you-can-make/,maximum-number-of-consecutive-values-you-can-make,贪心、数组,https://algo.itcharge.cn/Solutions/1700-1799/maximum-number-of-consecutive-values-you-can-make/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1798.%20%E4%BD%A0%E8%83%BD%E6%9E%84%E9%80%A0%E5%87%BA%E8%BF%9E%E7%BB%AD%E5%80%BC%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E7%9B%AE.md,71.0%,中等,242 -1799,1700-1799,1799. N 次操作后的最大分数和,N 次操作后的最大分数和,https://leetcode.cn/problems/maximize-score-after-n-operations/,maximize-score-after-n-operations,位运算、数组、数学、动态规划、回溯、状态压缩、数论,https://algo.itcharge.cn/Solutions/1700-1799/maximize-score-after-n-operations/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1799.%20N%20%E6%AC%A1%E6%93%8D%E4%BD%9C%E5%90%8E%E7%9A%84%E6%9C%80%E5%A4%A7%E5%88%86%E6%95%B0%E5%92%8C.md,65.7%,困难,164 -1800,1800-1899,1800. 最大升序子数组和,最大升序子数组和,https://leetcode.cn/problems/maximum-ascending-subarray-sum/,maximum-ascending-subarray-sum,数组,https://algo.itcharge.cn/Solutions/1800-1899/maximum-ascending-subarray-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1800.%20%E6%9C%80%E5%A4%A7%E5%8D%87%E5%BA%8F%E5%AD%90%E6%95%B0%E7%BB%84%E5%92%8C.md,68.7%,简单,640 -1801,1800-1899,1801. 积压订单中的订单总数,积压订单中的订单总数,https://leetcode.cn/problems/number-of-orders-in-the-backlog/,number-of-orders-in-the-backlog,数组、模拟、堆（优先队列）,https://algo.itcharge.cn/Solutions/1800-1899/number-of-orders-in-the-backlog/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1801.%20%E7%A7%AF%E5%8E%8B%E8%AE%A2%E5%8D%95%E4%B8%AD%E7%9A%84%E8%AE%A2%E5%8D%95%E6%80%BB%E6%95%B0.md,53.2%,中等,299 -1802,1800-1899,1802. 有界数组中指定下标处的最大值,有界数组中指定下标处的最大值,https://leetcode.cn/problems/maximum-value-at-a-given-index-in-a-bounded-array/,maximum-value-at-a-given-index-in-a-bounded-array,贪心、二分查找,https://algo.itcharge.cn/Solutions/1800-1899/maximum-value-at-a-given-index-in-a-bounded-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1802.%20%E6%9C%89%E7%95%8C%E6%95%B0%E7%BB%84%E4%B8%AD%E6%8C%87%E5%AE%9A%E4%B8%8B%E6%A0%87%E5%A4%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md,38.1%,中等,382 -1803,1800-1899,1803. 统计异或值在范围内的数对有多少,统计异或值在范围内的数对有多少,https://leetcode.cn/problems/count-pairs-with-xor-in-a-range/,count-pairs-with-xor-in-a-range,位运算、字典树、数组,https://algo.itcharge.cn/Solutions/1800-1899/count-pairs-with-xor-in-a-range/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1803.%20%E7%BB%9F%E8%AE%A1%E5%BC%82%E6%88%96%E5%80%BC%E5%9C%A8%E8%8C%83%E5%9B%B4%E5%86%85%E7%9A%84%E6%95%B0%E5%AF%B9%E6%9C%89%E5%A4%9A%E5%B0%91.md,56.3%,困难,156 -1804,1800-1899,1804. 实现 Trie （前缀树） II,实现 Trie （前缀树） II,https://leetcode.cn/problems/implement-trie-ii-prefix-tree/,implement-trie-ii-prefix-tree,设计、字典树、哈希表、字符串,https://algo.itcharge.cn/Solutions/1800-1899/implement-trie-ii-prefix-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1804.%20%E5%AE%9E%E7%8E%B0%20Trie%20%EF%BC%88%E5%89%8D%E7%BC%80%E6%A0%91%EF%BC%89%20II.md,57.1%,中等,60 -1805,1800-1899,1805. 字符串中不同整数的数目,字符串中不同整数的数目,https://leetcode.cn/problems/number-of-different-integers-in-a-string/,number-of-different-integers-in-a-string,哈希表、字符串,https://algo.itcharge.cn/Solutions/1800-1899/number-of-different-integers-in-a-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1805.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E4%B8%8D%E5%90%8C%E6%95%B4%E6%95%B0%E7%9A%84%E6%95%B0%E7%9B%AE.md,43.2%,简单,552 -1806,1800-1899,1806. 还原排列的最少操作步数,还原排列的最少操作步数,https://leetcode.cn/problems/minimum-number-of-operations-to-reinitialize-a-permutation/,minimum-number-of-operations-to-reinitialize-a-permutation,数组、数学、模拟,https://algo.itcharge.cn/Solutions/1800-1899/minimum-number-of-operations-to-reinitialize-a-permutation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1806.%20%E8%BF%98%E5%8E%9F%E6%8E%92%E5%88%97%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AD%A5%E6%95%B0.md,76.7%,中等,304 -1807,1800-1899,1807. 替换字符串中的括号内容,替换字符串中的括号内容,https://leetcode.cn/problems/evaluate-the-bracket-pairs-of-a-string/,evaluate-the-bracket-pairs-of-a-string,数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/1800-1899/evaluate-the-bracket-pairs-of-a-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1807.%20%E6%9B%BF%E6%8D%A2%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E6%8B%AC%E5%8F%B7%E5%86%85%E5%AE%B9.md,67.5%,中等,435 -1808,1800-1899,1808. 好因子的最大数目,好因子的最大数目,https://leetcode.cn/problems/maximize-number-of-nice-divisors/,maximize-number-of-nice-divisors,递归、数学,https://algo.itcharge.cn/Solutions/1800-1899/maximize-number-of-nice-divisors/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1808.%20%E5%A5%BD%E5%9B%A0%E5%AD%90%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E7%9B%AE.md,28.6%,困难,61 -1809,1800-1899,1809. 没有广告的剧集,没有广告的剧集,https://leetcode.cn/problems/ad-free-sessions/,ad-free-sessions,数据库,https://algo.itcharge.cn/Solutions/1800-1899/ad-free-sessions/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1809.%20%E6%B2%A1%E6%9C%89%E5%B9%BF%E5%91%8A%E7%9A%84%E5%89%A7%E9%9B%86.md,61.0%,简单,51 -1810,1800-1899,1810. 隐藏网格下的最小消耗路径,隐藏网格下的最小消耗路径,https://leetcode.cn/problems/minimum-path-cost-in-a-hidden-grid/,minimum-path-cost-in-a-hidden-grid,深度优先搜索、广度优先搜索、图、交互、堆（优先队列）,https://algo.itcharge.cn/Solutions/1800-1899/minimum-path-cost-in-a-hidden-grid/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1810.%20%E9%9A%90%E8%97%8F%E7%BD%91%E6%A0%BC%E4%B8%8B%E7%9A%84%E6%9C%80%E5%B0%8F%E6%B6%88%E8%80%97%E8%B7%AF%E5%BE%84.md,62.7%,中等,10 -1811,1800-1899,1811. 寻找面试候选人,寻找面试候选人,https://leetcode.cn/problems/find-interview-candidates/,find-interview-candidates,数据库,https://algo.itcharge.cn/Solutions/1800-1899/find-interview-candidates/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1811.%20%E5%AF%BB%E6%89%BE%E9%9D%A2%E8%AF%95%E5%80%99%E9%80%89%E4%BA%BA.md,63.7%,中等,54 -1812,1800-1899,1812. 判断国际象棋棋盘中一个格子的颜色,判断国际象棋棋盘中一个格子的颜色,https://leetcode.cn/problems/determine-color-of-a-chessboard-square/,determine-color-of-a-chessboard-square,数学、字符串,https://algo.itcharge.cn/Solutions/1800-1899/determine-color-of-a-chessboard-square/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1812.%20%E5%88%A4%E6%96%AD%E5%9B%BD%E9%99%85%E8%B1%A1%E6%A3%8B%E6%A3%8B%E7%9B%98%E4%B8%AD%E4%B8%80%E4%B8%AA%E6%A0%BC%E5%AD%90%E7%9A%84%E9%A2%9C%E8%89%B2.md,81.8%,简单,700 -1813,1800-1899,1813. 句子相似性 III,句子相似性 III,https://leetcode.cn/problems/sentence-similarity-iii/,sentence-similarity-iii,数组、双指针、字符串,https://algo.itcharge.cn/Solutions/1800-1899/sentence-similarity-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1813.%20%E5%8F%A5%E5%AD%90%E7%9B%B8%E4%BC%BC%E6%80%A7%20III.md,41.6%,中等,333 -1814,1800-1899,1814. 统计一个数组中好对子的数目,统计一个数组中好对子的数目,https://leetcode.cn/problems/count-nice-pairs-in-an-array/,count-nice-pairs-in-an-array,数组、哈希表、数学、计数,https://algo.itcharge.cn/Solutions/1800-1899/count-nice-pairs-in-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1814.%20%E7%BB%9F%E8%AE%A1%E4%B8%80%E4%B8%AA%E6%95%B0%E7%BB%84%E4%B8%AD%E5%A5%BD%E5%AF%B9%E5%AD%90%E7%9A%84%E6%95%B0%E7%9B%AE.md,47.1%,中等,314 -1815,1800-1899,1815. 得到新鲜甜甜圈的最多组数,得到新鲜甜甜圈的最多组数,https://leetcode.cn/problems/maximum-number-of-groups-getting-fresh-donuts/,maximum-number-of-groups-getting-fresh-donuts,位运算、记忆化搜索、数组、动态规划、状态压缩,https://algo.itcharge.cn/Solutions/1800-1899/maximum-number-of-groups-getting-fresh-donuts/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1815.%20%E5%BE%97%E5%88%B0%E6%96%B0%E9%B2%9C%E7%94%9C%E7%94%9C%E5%9C%88%E7%9A%84%E6%9C%80%E5%A4%9A%E7%BB%84%E6%95%B0.md,53.4%,困难,93 -1816,1800-1899,1816. 截断句子,截断句子,https://leetcode.cn/problems/truncate-sentence/,truncate-sentence,数组、字符串,https://algo.itcharge.cn/Solutions/1800-1899/truncate-sentence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1816.%20%E6%88%AA%E6%96%AD%E5%8F%A5%E5%AD%90.md,72.4%,简单,738 -1817,1800-1899,1817. 查找用户活跃分钟数,查找用户活跃分钟数,https://leetcode.cn/problems/finding-the-users-active-minutes/,finding-the-users-active-minutes,数组、哈希表,https://algo.itcharge.cn/Solutions/1800-1899/finding-the-users-active-minutes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1817.%20%E6%9F%A5%E6%89%BE%E7%94%A8%E6%88%B7%E6%B4%BB%E8%B7%83%E5%88%86%E9%92%9F%E6%95%B0.md,79.4%,中等,315 -1818,1800-1899,1818. 绝对差值和,绝对差值和,https://leetcode.cn/problems/minimum-absolute-sum-difference/,minimum-absolute-sum-difference,数组、二分查找、有序集合、排序,https://algo.itcharge.cn/Solutions/1800-1899/minimum-absolute-sum-difference/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1818.%20%E7%BB%9D%E5%AF%B9%E5%B7%AE%E5%80%BC%E5%92%8C.md,37.6%,中等,393 -1819,1800-1899,1819. 序列中不同最大公约数的数目,序列中不同最大公约数的数目,https://leetcode.cn/problems/number-of-different-subsequences-gcds/,number-of-different-subsequences-gcds,数组、数学、计数、数论,https://algo.itcharge.cn/Solutions/1800-1899/number-of-different-subsequences-gcds/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1819.%20%E5%BA%8F%E5%88%97%E4%B8%AD%E4%B8%8D%E5%90%8C%E6%9C%80%E5%A4%A7%E5%85%AC%E7%BA%A6%E6%95%B0%E7%9A%84%E6%95%B0%E7%9B%AE.md,63.3%,困难,108 -1820,1800-1899,1820. 最多邀请的个数,最多邀请的个数,https://leetcode.cn/problems/maximum-number-of-accepted-invitations/,maximum-number-of-accepted-invitations,数组、回溯、矩阵,https://algo.itcharge.cn/Solutions/1800-1899/maximum-number-of-accepted-invitations/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1820.%20%E6%9C%80%E5%A4%9A%E9%82%80%E8%AF%B7%E7%9A%84%E4%B8%AA%E6%95%B0.md,47.7%,中等,17 -1821,1800-1899,1821. 寻找今年具有正收入的客户,寻找今年具有正收入的客户,https://leetcode.cn/problems/find-customers-with-positive-revenue-this-year/,find-customers-with-positive-revenue-this-year,数据库,https://algo.itcharge.cn/Solutions/1800-1899/find-customers-with-positive-revenue-this-year/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1821.%20%E5%AF%BB%E6%89%BE%E4%BB%8A%E5%B9%B4%E5%85%B7%E6%9C%89%E6%AD%A3%E6%94%B6%E5%85%A5%E7%9A%84%E5%AE%A2%E6%88%B7.md,88.5%,简单,45 -1822,1800-1899,1822. 数组元素积的符号,数组元素积的符号,https://leetcode.cn/problems/sign-of-the-product-of-an-array/,sign-of-the-product-of-an-array,数组、数学,https://algo.itcharge.cn/Solutions/1800-1899/sign-of-the-product-of-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1822.%20%E6%95%B0%E7%BB%84%E5%85%83%E7%B4%A0%E7%A7%AF%E7%9A%84%E7%AC%A6%E5%8F%B7.md,71.7%,简单,732 -1823,1800-1899,1823. 找出游戏的获胜者,找出游戏的获胜者,https://leetcode.cn/problems/find-the-winner-of-the-circular-game/,find-the-winner-of-the-circular-game,递归、队列、数组、数学、模拟,https://algo.itcharge.cn/Solutions/1800-1899/find-the-winner-of-the-circular-game/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1823.%20%E6%89%BE%E5%87%BA%E6%B8%B8%E6%88%8F%E7%9A%84%E8%8E%B7%E8%83%9C%E8%80%85.md,78.5%,中等,578 -1824,1800-1899,1824. 最少侧跳次数,最少侧跳次数,https://leetcode.cn/problems/minimum-sideway-jumps/,minimum-sideway-jumps,贪心、数组、动态规划,https://algo.itcharge.cn/Solutions/1800-1899/minimum-sideway-jumps/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1824.%20%E6%9C%80%E5%B0%91%E4%BE%A7%E8%B7%B3%E6%AC%A1%E6%95%B0.md,68.4%,中等,332 -1825,1800-1899,1825. 求出 MK 平均值,求出 MK 平均值,https://leetcode.cn/problems/finding-mk-average/,finding-mk-average,设计、队列、数据流、有序集合、堆（优先队列）,https://algo.itcharge.cn/Solutions/1800-1899/finding-mk-average/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1825.%20%E6%B1%82%E5%87%BA%20MK%20%E5%B9%B3%E5%9D%87%E5%80%BC.md,43.4%,困难,190 -1826,1800-1899,1826. 有缺陷的传感器,有缺陷的传感器,https://leetcode.cn/problems/faulty-sensor/,faulty-sensor,数组、双指针,https://algo.itcharge.cn/Solutions/1800-1899/faulty-sensor/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1826.%20%E6%9C%89%E7%BC%BA%E9%99%B7%E7%9A%84%E4%BC%A0%E6%84%9F%E5%99%A8.md,41.7%,简单,40 -1827,1800-1899,1827. 最少操作使数组递增,最少操作使数组递增,https://leetcode.cn/problems/minimum-operations-to-make-the-array-increasing/,minimum-operations-to-make-the-array-increasing,贪心、数组,https://algo.itcharge.cn/Solutions/1800-1899/minimum-operations-to-make-the-array-increasing/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1827.%20%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E4%BD%BF%E6%95%B0%E7%BB%84%E9%80%92%E5%A2%9E.md,81.4%,简单,418 -1828,1800-1899,1828. 统计一个圆中点的数目,统计一个圆中点的数目,https://leetcode.cn/problems/queries-on-number-of-points-inside-a-circle/,queries-on-number-of-points-inside-a-circle,几何、数组、数学,https://algo.itcharge.cn/Solutions/1800-1899/queries-on-number-of-points-inside-a-circle/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1828.%20%E7%BB%9F%E8%AE%A1%E4%B8%80%E4%B8%AA%E5%9C%86%E4%B8%AD%E7%82%B9%E7%9A%84%E6%95%B0%E7%9B%AE.md,88.5%,中等,323 -1829,1800-1899,1829. 每个查询的最大异或值,每个查询的最大异或值,https://leetcode.cn/problems/maximum-xor-for-each-query/,maximum-xor-for-each-query,位运算、数组、前缀和,https://algo.itcharge.cn/Solutions/1800-1899/maximum-xor-for-each-query/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1829.%20%E6%AF%8F%E4%B8%AA%E6%9F%A5%E8%AF%A2%E7%9A%84%E6%9C%80%E5%A4%A7%E5%BC%82%E6%88%96%E5%80%BC.md,72.1%,中等,118 -1830,1800-1899,1830. 使字符串有序的最少操作次数,使字符串有序的最少操作次数,https://leetcode.cn/problems/minimum-number-of-operations-to-make-string-sorted/,minimum-number-of-operations-to-make-string-sorted,数学、字符串、组合数学,https://algo.itcharge.cn/Solutions/1800-1899/minimum-number-of-operations-to-make-string-sorted/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1830.%20%E4%BD%BF%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%9C%89%E5%BA%8F%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0.md,53.1%,困难,31 -1831,1800-1899,1831. 每天的最大交易,每天的最大交易,https://leetcode.cn/problems/maximum-transaction-each-day/,maximum-transaction-each-day,数据库,https://algo.itcharge.cn/Solutions/1800-1899/maximum-transaction-each-day/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1831.%20%E6%AF%8F%E5%A4%A9%E7%9A%84%E6%9C%80%E5%A4%A7%E4%BA%A4%E6%98%93.md,78.1%,中等,67 -1832,1800-1899,1832. 判断句子是否为全字母句,判断句子是否为全字母句,https://leetcode.cn/problems/check-if-the-sentence-is-pangram/,check-if-the-sentence-is-pangram,哈希表、字符串,https://algo.itcharge.cn/Solutions/1800-1899/check-if-the-sentence-is-pangram/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1832.%20%E5%88%A4%E6%96%AD%E5%8F%A5%E5%AD%90%E6%98%AF%E5%90%A6%E4%B8%BA%E5%85%A8%E5%AD%97%E6%AF%8D%E5%8F%A5.md,84.8%,简单,612 -1833,1800-1899,1833. 雪糕的最大数量,雪糕的最大数量,https://leetcode.cn/problems/maximum-ice-cream-bars/,maximum-ice-cream-bars,贪心、数组、排序,https://algo.itcharge.cn/Solutions/1800-1899/maximum-ice-cream-bars/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1833.%20%E9%9B%AA%E7%B3%95%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E9%87%8F.md,68.1%,中等,466 -1834,1800-1899,1834. 单线程 CPU,单线程 CPU,https://leetcode.cn/problems/single-threaded-cpu/,single-threaded-cpu,数组、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/1800-1899/single-threaded-cpu/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1834.%20%E5%8D%95%E7%BA%BF%E7%A8%8B%20CPU.md,37.9%,中等,179 -1835,1800-1899,1835. 所有数对按位与结果的异或和,所有数对按位与结果的异或和,https://leetcode.cn/problems/find-xor-sum-of-all-pairs-bitwise-and/,find-xor-sum-of-all-pairs-bitwise-and,位运算、数组、数学,https://algo.itcharge.cn/Solutions/1800-1899/find-xor-sum-of-all-pairs-bitwise-and/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1835.%20%E6%89%80%E6%9C%89%E6%95%B0%E5%AF%B9%E6%8C%89%E4%BD%8D%E4%B8%8E%E7%BB%93%E6%9E%9C%E7%9A%84%E5%BC%82%E6%88%96%E5%92%8C.md,56.0%,困难,77 -1836,1800-1899,1836. 从未排序的链表中移除重复元素,从未排序的链表中移除重复元素,https://leetcode.cn/problems/remove-duplicates-from-an-unsorted-linked-list/,remove-duplicates-from-an-unsorted-linked-list,哈希表、链表,https://algo.itcharge.cn/Solutions/1800-1899/remove-duplicates-from-an-unsorted-linked-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1836.%20%E4%BB%8E%E6%9C%AA%E6%8E%92%E5%BA%8F%E7%9A%84%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%A7%BB%E9%99%A4%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0.md,73.0%,中等,60 -1837,1800-1899,1837. K 进制表示下的各位数字总和,K 进制表示下的各位数字总和,https://leetcode.cn/problems/sum-of-digits-in-base-k/,sum-of-digits-in-base-k,数学,https://algo.itcharge.cn/Solutions/1800-1899/sum-of-digits-in-base-k/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1837.%20K%20%E8%BF%9B%E5%88%B6%E8%A1%A8%E7%A4%BA%E4%B8%8B%E7%9A%84%E5%90%84%E4%BD%8D%E6%95%B0%E5%AD%97%E6%80%BB%E5%92%8C.md,79.3%,简单,173 -1838,1800-1899,1838. 最高频元素的频数,最高频元素的频数,https://leetcode.cn/problems/frequency-of-the-most-frequent-element/,frequency-of-the-most-frequent-element,贪心、数组、二分查找、前缀和、排序、滑动窗口,https://algo.itcharge.cn/Solutions/1800-1899/frequency-of-the-most-frequent-element/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1838.%20%E6%9C%80%E9%AB%98%E9%A2%91%E5%85%83%E7%B4%A0%E7%9A%84%E9%A2%91%E6%95%B0.md,43.1%,中等,381 -1839,1800-1899,1839. 所有元音按顺序排布的最长子字符串,所有元音按顺序排布的最长子字符串,https://leetcode.cn/problems/longest-substring-of-all-vowels-in-order/,longest-substring-of-all-vowels-in-order,字符串、滑动窗口,https://algo.itcharge.cn/Solutions/1800-1899/longest-substring-of-all-vowels-in-order/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1839.%20%E6%89%80%E6%9C%89%E5%85%83%E9%9F%B3%E6%8C%89%E9%A1%BA%E5%BA%8F%E6%8E%92%E5%B8%83%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md,49.1%,中等,208 -1840,1800-1899,1840. 最高建筑高度,最高建筑高度,https://leetcode.cn/problems/maximum-building-height/,maximum-building-height,数组、数学,https://algo.itcharge.cn/Solutions/1800-1899/maximum-building-height/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1840.%20%E6%9C%80%E9%AB%98%E5%BB%BA%E7%AD%91%E9%AB%98%E5%BA%A6.md,39.4%,困难,63 -1841,1800-1899,1841. 联赛信息统计,联赛信息统计,https://leetcode.cn/problems/league-statistics/,league-statistics,数据库,https://algo.itcharge.cn/Solutions/1800-1899/league-statistics/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1841.%20%E8%81%94%E8%B5%9B%E4%BF%A1%E6%81%AF%E7%BB%9F%E8%AE%A1.md,52.6%,中等,64 -1842,1800-1899,1842. 下个由相同数字构成的回文串,下个由相同数字构成的回文串,https://leetcode.cn/problems/next-palindrome-using-same-digits/,next-palindrome-using-same-digits,双指针、字符串,https://algo.itcharge.cn/Solutions/1800-1899/next-palindrome-using-same-digits/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1842.%20%E4%B8%8B%E4%B8%AA%E7%94%B1%E7%9B%B8%E5%90%8C%E6%95%B0%E5%AD%97%E6%9E%84%E6%88%90%E7%9A%84%E5%9B%9E%E6%96%87%E4%B8%B2.md,55.7%,困难,19 -1843,1800-1899,1843. 可疑银行账户,可疑银行账户,https://leetcode.cn/problems/suspicious-bank-accounts/,suspicious-bank-accounts,数据库,https://algo.itcharge.cn/Solutions/1800-1899/suspicious-bank-accounts/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1843.%20%E5%8F%AF%E7%96%91%E9%93%B6%E8%A1%8C%E8%B4%A6%E6%88%B7.md,43.8%,中等,46 -1844,1800-1899,1844. 将所有数字用字符替换,将所有数字用字符替换,https://leetcode.cn/problems/replace-all-digits-with-characters/,replace-all-digits-with-characters,字符串,https://algo.itcharge.cn/Solutions/1800-1899/replace-all-digits-with-characters/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1844.%20%E5%B0%86%E6%89%80%E6%9C%89%E6%95%B0%E5%AD%97%E7%94%A8%E5%AD%97%E7%AC%A6%E6%9B%BF%E6%8D%A2.md,78.6%,简单,214 -1845,1800-1899,1845. 座位预约管理系统,座位预约管理系统,https://leetcode.cn/problems/seat-reservation-manager/,seat-reservation-manager,设计、堆（优先队列）,https://algo.itcharge.cn/Solutions/1800-1899/seat-reservation-manager/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1845.%20%E5%BA%A7%E4%BD%8D%E9%A2%84%E7%BA%A6%E7%AE%A1%E7%90%86%E7%B3%BB%E7%BB%9F.md,48.1%,中等,166 -1846,1800-1899,1846. 减小和重新排列数组后的最大元素,减小和重新排列数组后的最大元素,https://leetcode.cn/problems/maximum-element-after-decreasing-and-rearranging/,maximum-element-after-decreasing-and-rearranging,贪心、数组、排序,https://algo.itcharge.cn/Solutions/1800-1899/maximum-element-after-decreasing-and-rearranging/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1846.%20%E5%87%8F%E5%B0%8F%E5%92%8C%E9%87%8D%E6%96%B0%E6%8E%92%E5%88%97%E6%95%B0%E7%BB%84%E5%90%8E%E7%9A%84%E6%9C%80%E5%A4%A7%E5%85%83%E7%B4%A0.md,63.1%,中等,415 -1847,1800-1899,1847. 最近的房间,最近的房间,https://leetcode.cn/problems/closest-room/,closest-room,数组、二分查找、排序,https://algo.itcharge.cn/Solutions/1800-1899/closest-room/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1847.%20%E6%9C%80%E8%BF%91%E7%9A%84%E6%88%BF%E9%97%B4.md,39.9%,困难,75 -1848,1800-1899,1848. 到目标元素的最小距离,到目标元素的最小距离,https://leetcode.cn/problems/minimum-distance-to-the-target-element/,minimum-distance-to-the-target-element,数组,https://algo.itcharge.cn/Solutions/1800-1899/minimum-distance-to-the-target-element/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1848.%20%E5%88%B0%E7%9B%AE%E6%A0%87%E5%85%83%E7%B4%A0%E7%9A%84%E6%9C%80%E5%B0%8F%E8%B7%9D%E7%A6%BB.md,66.2%,简单,183 -1849,1800-1899,1849. 将字符串拆分为递减的连续值,将字符串拆分为递减的连续值,https://leetcode.cn/problems/splitting-a-string-into-descending-consecutive-values/,splitting-a-string-into-descending-consecutive-values,字符串、回溯,https://algo.itcharge.cn/Solutions/1800-1899/splitting-a-string-into-descending-consecutive-values/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1849.%20%E5%B0%86%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%8B%86%E5%88%86%E4%B8%BA%E9%80%92%E5%87%8F%E7%9A%84%E8%BF%9E%E7%BB%AD%E5%80%BC.md,33.2%,中等,138 -1850,1800-1899,1850. 邻位交换的最小次数,邻位交换的最小次数,https://leetcode.cn/problems/minimum-adjacent-swaps-to-reach-the-kth-smallest-number/,minimum-adjacent-swaps-to-reach-the-kth-smallest-number,贪心、双指针、字符串,https://algo.itcharge.cn/Solutions/1800-1899/minimum-adjacent-swaps-to-reach-the-kth-smallest-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1850.%20%E9%82%BB%E4%BD%8D%E4%BA%A4%E6%8D%A2%E7%9A%84%E6%9C%80%E5%B0%8F%E6%AC%A1%E6%95%B0.md,62.7%,中等,69 -1851,1800-1899,1851. 包含每个查询的最小区间,包含每个查询的最小区间,https://leetcode.cn/problems/minimum-interval-to-include-each-query/,minimum-interval-to-include-each-query,数组、二分查找、排序、扫描线、堆（优先队列）,https://algo.itcharge.cn/Solutions/1800-1899/minimum-interval-to-include-each-query/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1851.%20%E5%8C%85%E5%90%AB%E6%AF%8F%E4%B8%AA%E6%9F%A5%E8%AF%A2%E7%9A%84%E6%9C%80%E5%B0%8F%E5%8C%BA%E9%97%B4.md,44.1%,困难,81 -1852,1800-1899,1852. 每个子数组的数字种类数,每个子数组的数字种类数,https://leetcode.cn/problems/distinct-numbers-in-each-subarray/,distinct-numbers-in-each-subarray,数组、哈希表、滑动窗口,https://algo.itcharge.cn/Solutions/1800-1899/distinct-numbers-in-each-subarray/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1852.%20%E6%AF%8F%E4%B8%AA%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%95%B0%E5%AD%97%E7%A7%8D%E7%B1%BB%E6%95%B0.md,59.4%,中等,21 -1853,1800-1899,1853. 转换日期格式,转换日期格式,https://leetcode.cn/problems/convert-date-format/,convert-date-format,数据库,https://algo.itcharge.cn/Solutions/1800-1899/convert-date-format/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1853.%20%E8%BD%AC%E6%8D%A2%E6%97%A5%E6%9C%9F%E6%A0%BC%E5%BC%8F.md,62.8%,简单,31 -1854,1800-1899,1854. 人口最多的年份,人口最多的年份,https://leetcode.cn/problems/maximum-population-year/,maximum-population-year,数组、计数,https://algo.itcharge.cn/Solutions/1800-1899/maximum-population-year/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1854.%20%E4%BA%BA%E5%8F%A3%E6%9C%80%E5%A4%9A%E7%9A%84%E5%B9%B4%E4%BB%BD.md,72.3%,简单,224 -1855,1800-1899,1855. 下标对中的最大距离,下标对中的最大距离,https://leetcode.cn/problems/maximum-distance-between-a-pair-of-values/,maximum-distance-between-a-pair-of-values,贪心、数组、双指针、二分查找,https://algo.itcharge.cn/Solutions/1800-1899/maximum-distance-between-a-pair-of-values/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1855.%20%E4%B8%8B%E6%A0%87%E5%AF%B9%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E8%B7%9D%E7%A6%BB.md,59.4%,中等,243 -1856,1800-1899,1856. 子数组最小乘积的最大值,子数组最小乘积的最大值,https://leetcode.cn/problems/maximum-subarray-min-product/,maximum-subarray-min-product,栈、数组、前缀和、单调栈,https://algo.itcharge.cn/Solutions/1800-1899/maximum-subarray-min-product/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1856.%20%E5%AD%90%E6%95%B0%E7%BB%84%E6%9C%80%E5%B0%8F%E4%B9%98%E7%A7%AF%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md,37.5%,中等,145 -1857,1800-1899,1857. 有向图中最大颜色值,有向图中最大颜色值,https://leetcode.cn/problems/largest-color-value-in-a-directed-graph/,largest-color-value-in-a-directed-graph,图、拓扑排序、记忆化搜索、哈希表、动态规划、计数,https://algo.itcharge.cn/Solutions/1800-1899/largest-color-value-in-a-directed-graph/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1857.%20%E6%9C%89%E5%90%91%E5%9B%BE%E4%B8%AD%E6%9C%80%E5%A4%A7%E9%A2%9C%E8%89%B2%E5%80%BC.md,49.0%,困难,66 -1858,1800-1899,1858. 包含所有前缀的最长单词,包含所有前缀的最长单词,https://leetcode.cn/problems/longest-word-with-all-prefixes/,longest-word-with-all-prefixes,深度优先搜索、字典树,https://algo.itcharge.cn/Solutions/1800-1899/longest-word-with-all-prefixes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1858.%20%E5%8C%85%E5%90%AB%E6%89%80%E6%9C%89%E5%89%8D%E7%BC%80%E7%9A%84%E6%9C%80%E9%95%BF%E5%8D%95%E8%AF%8D.md,66.0%,中等,45 -1859,1800-1899,1859. 将句子排序,将句子排序,https://leetcode.cn/problems/sorting-the-sentence/,sorting-the-sentence,字符串、排序,https://algo.itcharge.cn/Solutions/1800-1899/sorting-the-sentence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1859.%20%E5%B0%86%E5%8F%A5%E5%AD%90%E6%8E%92%E5%BA%8F.md,72.8%,简单,321 -1860,1800-1899,1860. 增长的内存泄露,增长的内存泄露,https://leetcode.cn/problems/incremental-memory-leak/,incremental-memory-leak,模拟,https://algo.itcharge.cn/Solutions/1800-1899/incremental-memory-leak/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1860.%20%E5%A2%9E%E9%95%BF%E7%9A%84%E5%86%85%E5%AD%98%E6%B3%84%E9%9C%B2.md,76.0%,中等,124 -1861,1800-1899,1861. 旋转盒子,旋转盒子,https://leetcode.cn/problems/rotating-the-box/,rotating-the-box,数组、双指针、矩阵,https://algo.itcharge.cn/Solutions/1800-1899/rotating-the-box/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1861.%20%E6%97%8B%E8%BD%AC%E7%9B%92%E5%AD%90.md,63.4%,中等,114 -1862,1800-1899,1862. 向下取整数对和,向下取整数对和,https://leetcode.cn/problems/sum-of-floored-pairs/,sum-of-floored-pairs,数组、数学、二分查找、前缀和,https://algo.itcharge.cn/Solutions/1800-1899/sum-of-floored-pairs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1862.%20%E5%90%91%E4%B8%8B%E5%8F%96%E6%95%B4%E6%95%B0%E5%AF%B9%E5%92%8C.md,34.7%,困难,64 -1863,1800-1899,1863. 找出所有子集的异或总和再求和,找出所有子集的异或总和再求和,https://leetcode.cn/problems/sum-of-all-subset-xor-totals/,sum-of-all-subset-xor-totals,位运算、数组、数学、回溯、组合数学,https://algo.itcharge.cn/Solutions/1800-1899/sum-of-all-subset-xor-totals/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1863.%20%E6%89%BE%E5%87%BA%E6%89%80%E6%9C%89%E5%AD%90%E9%9B%86%E7%9A%84%E5%BC%82%E6%88%96%E6%80%BB%E5%92%8C%E5%86%8D%E6%B1%82%E5%92%8C.md,84.0%,简单,270 -1864,1800-1899,1864. 构成交替字符串需要的最小交换次数,构成交替字符串需要的最小交换次数,https://leetcode.cn/problems/minimum-number-of-swaps-to-make-the-binary-string-alternating/,minimum-number-of-swaps-to-make-the-binary-string-alternating,贪心、字符串,https://algo.itcharge.cn/Solutions/1800-1899/minimum-number-of-swaps-to-make-the-binary-string-alternating/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1864.%20%E6%9E%84%E6%88%90%E4%BA%A4%E6%9B%BF%E5%AD%97%E7%AC%A6%E4%B8%B2%E9%9C%80%E8%A6%81%E7%9A%84%E6%9C%80%E5%B0%8F%E4%BA%A4%E6%8D%A2%E6%AC%A1%E6%95%B0.md,40.8%,中等,158 -1865,1800-1899,1865. 找出和为指定值的下标对,找出和为指定值的下标对,https://leetcode.cn/problems/finding-pairs-with-a-certain-sum/,finding-pairs-with-a-certain-sum,设计、数组、哈希表,https://algo.itcharge.cn/Solutions/1800-1899/finding-pairs-with-a-certain-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1865.%20%E6%89%BE%E5%87%BA%E5%92%8C%E4%B8%BA%E6%8C%87%E5%AE%9A%E5%80%BC%E7%9A%84%E4%B8%8B%E6%A0%87%E5%AF%B9.md,50.9%,中等,86 -1866,1800-1899,1866. 恰有 K 根木棍可以看到的排列数目,恰有 K 根木棍可以看到的排列数目,https://leetcode.cn/problems/number-of-ways-to-rearrange-sticks-with-k-sticks-visible/,number-of-ways-to-rearrange-sticks-with-k-sticks-visible,数学、动态规划、组合数学,https://algo.itcharge.cn/Solutions/1800-1899/number-of-ways-to-rearrange-sticks-with-k-sticks-visible/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1866.%20%E6%81%B0%E6%9C%89%20K%20%E6%A0%B9%E6%9C%A8%E6%A3%8D%E5%8F%AF%E4%BB%A5%E7%9C%8B%E5%88%B0%E7%9A%84%E6%8E%92%E5%88%97%E6%95%B0%E7%9B%AE.md,61.9%,困难,73 -1867,1800-1899,1867. 最大数量高于平均水平的订单,最大数量高于平均水平的订单,https://leetcode.cn/problems/orders-with-maximum-quantity-above-average/,orders-with-maximum-quantity-above-average,数据库,https://algo.itcharge.cn/Solutions/1800-1899/orders-with-maximum-quantity-above-average/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1867.%20%E6%9C%80%E5%A4%A7%E6%95%B0%E9%87%8F%E9%AB%98%E4%BA%8E%E5%B9%B3%E5%9D%87%E6%B0%B4%E5%B9%B3%E7%9A%84%E8%AE%A2%E5%8D%95.md,68.0%,中等,58 -1868,1800-1899,1868. 两个行程编码数组的积,两个行程编码数组的积,https://leetcode.cn/problems/product-of-two-run-length-encoded-arrays/,product-of-two-run-length-encoded-arrays,数组、双指针,https://algo.itcharge.cn/Solutions/1800-1899/product-of-two-run-length-encoded-arrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1868.%20%E4%B8%A4%E4%B8%AA%E8%A1%8C%E7%A8%8B%E7%BC%96%E7%A0%81%E6%95%B0%E7%BB%84%E7%9A%84%E7%A7%AF.md,48.8%,中等,50 -1869,1800-1899,1869. 哪种连续子字符串更长,哪种连续子字符串更长,https://leetcode.cn/problems/longer-contiguous-segments-of-ones-than-zeros/,longer-contiguous-segments-of-ones-than-zeros,字符串,https://algo.itcharge.cn/Solutions/1800-1899/longer-contiguous-segments-of-ones-than-zeros/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1869.%20%E5%93%AA%E7%A7%8D%E8%BF%9E%E7%BB%AD%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%9B%B4%E9%95%BF.md,70.6%,简单,260 -1870,1800-1899,1870. 准时到达的列车最小时速,准时到达的列车最小时速,https://leetcode.cn/problems/minimum-speed-to-arrive-on-time/,minimum-speed-to-arrive-on-time,数组、二分查找,https://algo.itcharge.cn/Solutions/1800-1899/minimum-speed-to-arrive-on-time/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1870.%20%E5%87%86%E6%97%B6%E5%88%B0%E8%BE%BE%E7%9A%84%E5%88%97%E8%BD%A6%E6%9C%80%E5%B0%8F%E6%97%B6%E9%80%9F.md,42.2%,中等,142 -1871,1800-1899,1871. 跳跃游戏 VII,跳跃游戏 VII,https://leetcode.cn/problems/jump-game-vii/,jump-game-vii,双指针、字符串、前缀和,https://algo.itcharge.cn/Solutions/1800-1899/jump-game-vii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1871.%20%E8%B7%B3%E8%B7%83%E6%B8%B8%E6%88%8F%20VII.md,28.3%,中等,180 -1872,1800-1899,1872. 石子游戏 VIII,石子游戏 VIII,https://leetcode.cn/problems/stone-game-viii/,stone-game-viii,数组、数学、动态规划、博弈、前缀和,https://algo.itcharge.cn/Solutions/1800-1899/stone-game-viii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1872.%20%E7%9F%B3%E5%AD%90%E6%B8%B8%E6%88%8F%20VIII.md,61.2%,困难,46 -1873,1800-1899,1873. 计算特殊奖金,计算特殊奖金,https://leetcode.cn/problems/calculate-special-bonus/,calculate-special-bonus,数据库,https://algo.itcharge.cn/Solutions/1800-1899/calculate-special-bonus/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1873.%20%E8%AE%A1%E7%AE%97%E7%89%B9%E6%AE%8A%E5%A5%96%E9%87%91.md,62.7%,简单,393 -1874,1800-1899,1874. 两个数组的最小乘积和,两个数组的最小乘积和,https://leetcode.cn/problems/minimize-product-sum-of-two-arrays/,minimize-product-sum-of-two-arrays,贪心、数组、排序,https://algo.itcharge.cn/Solutions/1800-1899/minimize-product-sum-of-two-arrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1874.%20%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%B0%8F%E4%B9%98%E7%A7%AF%E5%92%8C.md,86.5%,中等,37 -1875,1800-1899,1875. 将工资相同的雇员分组,将工资相同的雇员分组,https://leetcode.cn/problems/group-employees-of-the-same-salary/,group-employees-of-the-same-salary,数据库,https://algo.itcharge.cn/Solutions/1800-1899/group-employees-of-the-same-salary/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1875.%20%E5%B0%86%E5%B7%A5%E8%B5%84%E7%9B%B8%E5%90%8C%E7%9A%84%E9%9B%87%E5%91%98%E5%88%86%E7%BB%84.md,64.4%,中等,45 -1876,1800-1899,1876. 长度为三且各字符不同的子字符串,长度为三且各字符不同的子字符串,https://leetcode.cn/problems/substrings-of-size-three-with-distinct-characters/,substrings-of-size-three-with-distinct-characters,哈希表、字符串、计数、滑动窗口,https://algo.itcharge.cn/Solutions/1800-1899/substrings-of-size-three-with-distinct-characters/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1876.%20%E9%95%BF%E5%BA%A6%E4%B8%BA%E4%B8%89%E4%B8%94%E5%90%84%E5%AD%97%E7%AC%A6%E4%B8%8D%E5%90%8C%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md,70.4%,简单,258 -1877,1800-1899,1877. 数组中最大数对和的最小值,数组中最大数对和的最小值,https://leetcode.cn/problems/minimize-maximum-pair-sum-in-array/,minimize-maximum-pair-sum-in-array,贪心、数组、双指针、排序,https://algo.itcharge.cn/Solutions/1800-1899/minimize-maximum-pair-sum-in-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1877.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9C%80%E5%A4%A7%E6%95%B0%E5%AF%B9%E5%92%8C%E7%9A%84%E6%9C%80%E5%B0%8F%E5%80%BC.md,81.2%,中等,484 -1878,1800-1899,1878. 矩阵中最大的三个菱形和,矩阵中最大的三个菱形和,https://leetcode.cn/problems/get-biggest-three-rhombus-sums-in-a-grid/,get-biggest-three-rhombus-sums-in-a-grid,数组、数学、矩阵、前缀和、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/1800-1899/get-biggest-three-rhombus-sums-in-a-grid/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1878.%20%E7%9F%A9%E9%98%B5%E4%B8%AD%E6%9C%80%E5%A4%A7%E7%9A%84%E4%B8%89%E4%B8%AA%E8%8F%B1%E5%BD%A2%E5%92%8C.md,45.5%,中等,75 -1879,1800-1899,1879. 两个数组最小的异或值之和,两个数组最小的异或值之和,https://leetcode.cn/problems/minimum-xor-sum-of-two-arrays/,minimum-xor-sum-of-two-arrays,位运算、数组、动态规划、状态压缩,https://algo.itcharge.cn/Solutions/1800-1899/minimum-xor-sum-of-two-arrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1879.%20%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E6%9C%80%E5%B0%8F%E7%9A%84%E5%BC%82%E6%88%96%E5%80%BC%E4%B9%8B%E5%92%8C.md,49.8%,困难,70 -1880,1800-1899,1880. 检查某单词是否等于两单词之和,检查某单词是否等于两单词之和,https://leetcode.cn/problems/check-if-word-equals-summation-of-two-words/,check-if-word-equals-summation-of-two-words,字符串,https://algo.itcharge.cn/Solutions/1800-1899/check-if-word-equals-summation-of-two-words/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1880.%20%E6%A3%80%E6%9F%A5%E6%9F%90%E5%8D%95%E8%AF%8D%E6%98%AF%E5%90%A6%E7%AD%89%E4%BA%8E%E4%B8%A4%E5%8D%95%E8%AF%8D%E4%B9%8B%E5%92%8C.md,76.3%,简单,210 -1881,1800-1899,1881. 插入后的最大值,插入后的最大值,https://leetcode.cn/problems/maximum-value-after-insertion/,maximum-value-after-insertion,贪心、字符串,https://algo.itcharge.cn/Solutions/1800-1899/maximum-value-after-insertion/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1881.%20%E6%8F%92%E5%85%A5%E5%90%8E%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md,37.7%,中等,100 -1882,1800-1899,1882. 使用服务器处理任务,使用服务器处理任务,https://leetcode.cn/problems/process-tasks-using-servers/,process-tasks-using-servers,数组、堆（优先队列）,https://algo.itcharge.cn/Solutions/1800-1899/process-tasks-using-servers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1882.%20%E4%BD%BF%E7%94%A8%E6%9C%8D%E5%8A%A1%E5%99%A8%E5%A4%84%E7%90%86%E4%BB%BB%E5%8A%A1.md,30.8%,中等,146 -1883,1800-1899,1883. 准时抵达会议现场的最小跳过休息次数,准时抵达会议现场的最小跳过休息次数,https://leetcode.cn/problems/minimum-skips-to-arrive-at-meeting-on-time/,minimum-skips-to-arrive-at-meeting-on-time,数组、动态规划,https://algo.itcharge.cn/Solutions/1800-1899/minimum-skips-to-arrive-at-meeting-on-time/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1883.%20%E5%87%86%E6%97%B6%E6%8A%B5%E8%BE%BE%E4%BC%9A%E8%AE%AE%E7%8E%B0%E5%9C%BA%E7%9A%84%E6%9C%80%E5%B0%8F%E8%B7%B3%E8%BF%87%E4%BC%91%E6%81%AF%E6%AC%A1%E6%95%B0.md,40.2%,困难,39 -1884,1800-1899,1884. 鸡蛋掉落-两枚鸡蛋,鸡蛋掉落-两枚鸡蛋,https://leetcode.cn/problems/egg-drop-with-2-eggs-and-n-floors/,egg-drop-with-2-eggs-and-n-floors,数学、动态规划,https://algo.itcharge.cn/Solutions/1800-1899/egg-drop-with-2-eggs-and-n-floors/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1884.%20%E9%B8%A1%E8%9B%8B%E6%8E%89%E8%90%BD-%E4%B8%A4%E6%9E%9A%E9%B8%A1%E8%9B%8B.md,70.4%,中等,111 -1885,1800-1899,1885. 统计数对,统计数对,https://leetcode.cn/problems/count-pairs-in-two-arrays/,count-pairs-in-two-arrays,数组、二分查找、排序,https://algo.itcharge.cn/Solutions/1800-1899/count-pairs-in-two-arrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1885.%20%E7%BB%9F%E8%AE%A1%E6%95%B0%E5%AF%B9.md,59.0%,中等,29 -1886,1800-1899,1886. 判断矩阵经轮转后是否一致,判断矩阵经轮转后是否一致,https://leetcode.cn/problems/determine-whether-matrix-can-be-obtained-by-rotation/,determine-whether-matrix-can-be-obtained-by-rotation,数组、矩阵,https://algo.itcharge.cn/Solutions/1800-1899/determine-whether-matrix-can-be-obtained-by-rotation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1886.%20%E5%88%A4%E6%96%AD%E7%9F%A9%E9%98%B5%E7%BB%8F%E8%BD%AE%E8%BD%AC%E5%90%8E%E6%98%AF%E5%90%A6%E4%B8%80%E8%87%B4.md,59.4%,简单,172 -1887,1800-1899,1887. 使数组元素相等的减少操作次数,使数组元素相等的减少操作次数,https://leetcode.cn/problems/reduction-operations-to-make-the-array-elements-equal/,reduction-operations-to-make-the-array-elements-equal,数组、排序,https://algo.itcharge.cn/Solutions/1800-1899/reduction-operations-to-make-the-array-elements-equal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1887.%20%E4%BD%BF%E6%95%B0%E7%BB%84%E5%85%83%E7%B4%A0%E7%9B%B8%E7%AD%89%E7%9A%84%E5%87%8F%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0.md,65.6%,中等,112 -1888,1800-1899,1888. 使二进制字符串字符交替的最少反转次数,使二进制字符串字符交替的最少反转次数,https://leetcode.cn/problems/minimum-number-of-flips-to-make-the-binary-string-alternating/,minimum-number-of-flips-to-make-the-binary-string-alternating,贪心、字符串、动态规划、滑动窗口,https://algo.itcharge.cn/Solutions/1800-1899/minimum-number-of-flips-to-make-the-binary-string-alternating/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1888.%20%E4%BD%BF%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%AD%97%E7%AC%A6%E4%BA%A4%E6%9B%BF%E7%9A%84%E6%9C%80%E5%B0%91%E5%8F%8D%E8%BD%AC%E6%AC%A1%E6%95%B0.md,36.5%,中等,94 -1889,1800-1899,1889. 装包裹的最小浪费空间,装包裹的最小浪费空间,https://leetcode.cn/problems/minimum-space-wasted-from-packaging/,minimum-space-wasted-from-packaging,数组、二分查找、前缀和、排序,https://algo.itcharge.cn/Solutions/1800-1899/minimum-space-wasted-from-packaging/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1889.%20%E8%A3%85%E5%8C%85%E8%A3%B9%E7%9A%84%E6%9C%80%E5%B0%8F%E6%B5%AA%E8%B4%B9%E7%A9%BA%E9%97%B4.md,29.6%,困难,67 -1890,1800-1899,1890. 2020年最后一次登录,2020年最后一次登录,https://leetcode.cn/problems/the-latest-login-in-2020/,the-latest-login-in-2020,数据库,https://algo.itcharge.cn/Solutions/1800-1899/the-latest-login-in-2020/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1890.%202020%E5%B9%B4%E6%9C%80%E5%90%8E%E4%B8%80%E6%AC%A1%E7%99%BB%E5%BD%95.md,70.0%,简单,199 -1891,1800-1899,1891. 割绳子,割绳子,https://leetcode.cn/problems/cutting-ribbons/,cutting-ribbons,数组、二分查找,https://algo.itcharge.cn/Solutions/1800-1899/cutting-ribbons/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1891.%20%E5%89%B2%E7%BB%B3%E5%AD%90.md,42.1%,中等,50 -1892,1800-1899,1892. 页面推荐Ⅱ,页面推荐Ⅱ,https://leetcode.cn/problems/page-recommendations-ii/,page-recommendations-ii,数据库,https://algo.itcharge.cn/Solutions/1800-1899/page-recommendations-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1892.%20%E9%A1%B5%E9%9D%A2%E6%8E%A8%E8%8D%90%E2%85%A1.md,37.6%,困难,34 -1893,1800-1899,1893. 检查是否区域内所有整数都被覆盖,检查是否区域内所有整数都被覆盖,https://leetcode.cn/problems/check-if-all-the-integers-in-a-range-are-covered/,check-if-all-the-integers-in-a-range-are-covered,数组、哈希表、前缀和,https://algo.itcharge.cn/Solutions/1800-1899/check-if-all-the-integers-in-a-range-are-covered/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1893.%20%E6%A3%80%E6%9F%A5%E6%98%AF%E5%90%A6%E5%8C%BA%E5%9F%9F%E5%86%85%E6%89%80%E6%9C%89%E6%95%B4%E6%95%B0%E9%83%BD%E8%A2%AB%E8%A6%86%E7%9B%96.md,58.9%,简单,530 -1894,1800-1899,1894. 找到需要补充粉笔的学生编号,找到需要补充粉笔的学生编号,https://leetcode.cn/problems/find-the-student-that-will-replace-the-chalk/,find-the-student-that-will-replace-the-chalk,数组、二分查找、前缀和、模拟,https://algo.itcharge.cn/Solutions/1800-1899/find-the-student-that-will-replace-the-chalk/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1894.%20%E6%89%BE%E5%88%B0%E9%9C%80%E8%A6%81%E8%A1%A5%E5%85%85%E7%B2%89%E7%AC%94%E7%9A%84%E5%AD%A6%E7%94%9F%E7%BC%96%E5%8F%B7.md,45.8%,中等,619 -1895,1800-1899,1895. 最大的幻方,最大的幻方,https://leetcode.cn/problems/largest-magic-square/,largest-magic-square,数组、矩阵、前缀和,https://algo.itcharge.cn/Solutions/1800-1899/largest-magic-square/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1895.%20%E6%9C%80%E5%A4%A7%E7%9A%84%E5%B9%BB%E6%96%B9.md,56.3%,中等,62 -1896,1800-1899,1896. 反转表达式值的最少操作次数,反转表达式值的最少操作次数,https://leetcode.cn/problems/minimum-cost-to-change-the-final-value-of-expression/,minimum-cost-to-change-the-final-value-of-expression,栈、数学、字符串、动态规划,https://algo.itcharge.cn/Solutions/1800-1899/minimum-cost-to-change-the-final-value-of-expression/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1896.%20%E5%8F%8D%E8%BD%AC%E8%A1%A8%E8%BE%BE%E5%BC%8F%E5%80%BC%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0.md,51.5%,困难,36 -1897,1800-1899,1897. 重新分配字符使所有字符串都相等,重新分配字符使所有字符串都相等,https://leetcode.cn/problems/redistribute-characters-to-make-all-strings-equal/,redistribute-characters-to-make-all-strings-equal,哈希表、字符串、计数,https://algo.itcharge.cn/Solutions/1800-1899/redistribute-characters-to-make-all-strings-equal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1897.%20%E9%87%8D%E6%96%B0%E5%88%86%E9%85%8D%E5%AD%97%E7%AC%A6%E4%BD%BF%E6%89%80%E6%9C%89%E5%AD%97%E7%AC%A6%E4%B8%B2%E9%83%BD%E7%9B%B8%E7%AD%89.md,55.2%,简单,143 -1898,1800-1899,1898. 可移除字符的最大数目,可移除字符的最大数目,https://leetcode.cn/problems/maximum-number-of-removable-characters/,maximum-number-of-removable-characters,数组、字符串、二分查找,https://algo.itcharge.cn/Solutions/1800-1899/maximum-number-of-removable-characters/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1898.%20%E5%8F%AF%E7%A7%BB%E9%99%A4%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E7%9B%AE.md,38.0%,中等,119 -1899,1800-1899,1899. 合并若干三元组以形成目标三元组,合并若干三元组以形成目标三元组,https://leetcode.cn/problems/merge-triplets-to-form-target-triplet/,merge-triplets-to-form-target-triplet,贪心、数组,https://algo.itcharge.cn/Solutions/1800-1899/merge-triplets-to-form-target-triplet/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1899.%20%E5%90%88%E5%B9%B6%E8%8B%A5%E5%B9%B2%E4%B8%89%E5%85%83%E7%BB%84%E4%BB%A5%E5%BD%A2%E6%88%90%E7%9B%AE%E6%A0%87%E4%B8%89%E5%85%83%E7%BB%84.md,65.3%,中等,84 -1900,1900-1999,1900. 最佳运动员的比拼回合,最佳运动员的比拼回合,https://leetcode.cn/problems/the-earliest-and-latest-rounds-where-players-compete/,the-earliest-and-latest-rounds-where-players-compete,记忆化搜索、动态规划,https://algo.itcharge.cn/Solutions/1900-1999/the-earliest-and-latest-rounds-where-players-compete/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1900.%20%E6%9C%80%E4%BD%B3%E8%BF%90%E5%8A%A8%E5%91%98%E7%9A%84%E6%AF%94%E6%8B%BC%E5%9B%9E%E5%90%88.md,45.8%,困难,46 -1901,1900-1999,1901. 寻找峰值 II,寻找峰值 II,https://leetcode.cn/problems/find-a-peak-element-ii/,find-a-peak-element-ii,数组、二分查找、矩阵,https://algo.itcharge.cn/Solutions/1900-1999/find-a-peak-element-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1901.%20%E5%AF%BB%E6%89%BE%E5%B3%B0%E5%80%BC%20II.md,58.9%,中等,130 -1902,1900-1999,1902. 给定二叉搜索树的插入顺序求深度,给定二叉搜索树的插入顺序求深度,https://leetcode.cn/problems/depth-of-bst-given-insertion-order/,depth-of-bst-given-insertion-order,树、二叉搜索树、二叉树、有序集合,https://algo.itcharge.cn/Solutions/1900-1999/depth-of-bst-given-insertion-order/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1902.%20%E7%BB%99%E5%AE%9A%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E6%8F%92%E5%85%A5%E9%A1%BA%E5%BA%8F%E6%B1%82%E6%B7%B1%E5%BA%A6.md,50.9%,中等,14 -1903,1900-1999,1903. 字符串中的最大奇数,字符串中的最大奇数,https://leetcode.cn/problems/largest-odd-number-in-string/,largest-odd-number-in-string,贪心、数学、字符串,https://algo.itcharge.cn/Solutions/1900-1999/largest-odd-number-in-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1903.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E5%A5%87%E6%95%B0.md,60.5%,简单,206 -1904,1900-1999,1904. 你完成的完整对局数,你完成的完整对局数,https://leetcode.cn/problems/the-number-of-full-rounds-you-have-played/,the-number-of-full-rounds-you-have-played,数学、字符串,https://algo.itcharge.cn/Solutions/1900-1999/the-number-of-full-rounds-you-have-played/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1904.%20%E4%BD%A0%E5%AE%8C%E6%88%90%E7%9A%84%E5%AE%8C%E6%95%B4%E5%AF%B9%E5%B1%80%E6%95%B0.md,31.4%,中等,106 -1905,1900-1999,1905. 统计子岛屿,统计子岛屿,https://leetcode.cn/problems/count-sub-islands/,count-sub-islands,深度优先搜索、广度优先搜索、并查集、数组、矩阵,https://algo.itcharge.cn/Solutions/1900-1999/count-sub-islands/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1905.%20%E7%BB%9F%E8%AE%A1%E5%AD%90%E5%B2%9B%E5%B1%BF.md,67.2%,中等,419 -1906,1900-1999,1906. 查询差绝对值的最小值,查询差绝对值的最小值,https://leetcode.cn/problems/minimum-absolute-difference-queries/,minimum-absolute-difference-queries,数组、哈希表,https://algo.itcharge.cn/Solutions/1900-1999/minimum-absolute-difference-queries/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1906.%20%E6%9F%A5%E8%AF%A2%E5%B7%AE%E7%BB%9D%E5%AF%B9%E5%80%BC%E7%9A%84%E6%9C%80%E5%B0%8F%E5%80%BC.md,44.9%,中等,73 -1907,1900-1999,1907. 按分类统计薪水,按分类统计薪水,https://leetcode.cn/problems/count-salary-categories/,count-salary-categories,数据库,https://algo.itcharge.cn/Solutions/1900-1999/count-salary-categories/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1907.%20%E6%8C%89%E5%88%86%E7%B1%BB%E7%BB%9F%E8%AE%A1%E8%96%AA%E6%B0%B4.md,63.6%,中等,60 -1908,1900-1999,1908. Nim 游戏 II,Nim 游戏 II,https://leetcode.cn/problems/game-of-nim/,game-of-nim,位运算、脑筋急转弯、数组、数学、动态规划、博弈,https://algo.itcharge.cn/Solutions/1900-1999/game-of-nim/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1908.%20Nim%20%E6%B8%B8%E6%88%8F%20II.md,62.3%,中等,19 -1909,1900-1999,1909. 删除一个元素使数组严格递增,删除一个元素使数组严格递增,https://leetcode.cn/problems/remove-one-element-to-make-the-array-strictly-increasing/,remove-one-element-to-make-the-array-strictly-increasing,数组,https://algo.itcharge.cn/Solutions/1900-1999/remove-one-element-to-make-the-array-strictly-increasing/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1909.%20%E5%88%A0%E9%99%A4%E4%B8%80%E4%B8%AA%E5%85%83%E7%B4%A0%E4%BD%BF%E6%95%B0%E7%BB%84%E4%B8%A5%E6%A0%BC%E9%80%92%E5%A2%9E.md,30.0%,简单,173 -1910,1900-1999,1910. 删除一个字符串中所有出现的给定子字符串,删除一个字符串中所有出现的给定子字符串,https://leetcode.cn/problems/remove-all-occurrences-of-a-substring/,remove-all-occurrences-of-a-substring,字符串,https://algo.itcharge.cn/Solutions/1900-1999/remove-all-occurrences-of-a-substring/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1910.%20%E5%88%A0%E9%99%A4%E4%B8%80%E4%B8%AA%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E6%89%80%E6%9C%89%E5%87%BA%E7%8E%B0%E7%9A%84%E7%BB%99%E5%AE%9A%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md,66.5%,中等,122 -1911,1900-1999,1911. 最大子序列交替和,最大子序列交替和,https://leetcode.cn/problems/maximum-alternating-subsequence-sum/,maximum-alternating-subsequence-sum,数组、动态规划,https://algo.itcharge.cn/Solutions/1900-1999/maximum-alternating-subsequence-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1911.%20%E6%9C%80%E5%A4%A7%E5%AD%90%E5%BA%8F%E5%88%97%E4%BA%A4%E6%9B%BF%E5%92%8C.md,59.1%,中等,119 -1912,1900-1999,1912. 设计电影租借系统,设计电影租借系统,https://leetcode.cn/problems/design-movie-rental-system/,design-movie-rental-system,设计、数组、哈希表、有序集合、堆（优先队列）,https://algo.itcharge.cn/Solutions/1900-1999/design-movie-rental-system/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1912.%20%E8%AE%BE%E8%AE%A1%E7%94%B5%E5%BD%B1%E7%A7%9F%E5%80%9F%E7%B3%BB%E7%BB%9F.md,24.1%,困难,84 -1913,1900-1999,1913. 两个数对之间的最大乘积差,两个数对之间的最大乘积差,https://leetcode.cn/problems/maximum-product-difference-between-two-pairs/,maximum-product-difference-between-two-pairs,数组、排序,https://algo.itcharge.cn/Solutions/1900-1999/maximum-product-difference-between-two-pairs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1913.%20%E4%B8%A4%E4%B8%AA%E6%95%B0%E5%AF%B9%E4%B9%8B%E9%97%B4%E7%9A%84%E6%9C%80%E5%A4%A7%E4%B9%98%E7%A7%AF%E5%B7%AE.md,81.5%,简单,238 -1914,1900-1999,1914. 循环轮转矩阵,循环轮转矩阵,https://leetcode.cn/problems/cyclically-rotating-a-grid/,cyclically-rotating-a-grid,数组、矩阵、模拟,https://algo.itcharge.cn/Solutions/1900-1999/cyclically-rotating-a-grid/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1914.%20%E5%BE%AA%E7%8E%AF%E8%BD%AE%E8%BD%AC%E7%9F%A9%E9%98%B5.md,46.5%,中等,100 -1915,1900-1999,1915. 最美子字符串的数目,最美子字符串的数目,https://leetcode.cn/problems/number-of-wonderful-substrings/,number-of-wonderful-substrings,位运算、哈希表、字符串、前缀和,https://algo.itcharge.cn/Solutions/1900-1999/number-of-wonderful-substrings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1915.%20%E6%9C%80%E7%BE%8E%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%95%B0%E7%9B%AE.md,44.7%,中等,83 -1916,1900-1999,1916. 统计为蚁群构筑房间的不同顺序,统计为蚁群构筑房间的不同顺序,https://leetcode.cn/problems/count-ways-to-build-rooms-in-an-ant-colony/,count-ways-to-build-rooms-in-an-ant-colony,树、图、拓扑排序、数学、动态规划、组合数学,https://algo.itcharge.cn/Solutions/1900-1999/count-ways-to-build-rooms-in-an-ant-colony/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1916.%20%E7%BB%9F%E8%AE%A1%E4%B8%BA%E8%9A%81%E7%BE%A4%E6%9E%84%E7%AD%91%E6%88%BF%E9%97%B4%E7%9A%84%E4%B8%8D%E5%90%8C%E9%A1%BA%E5%BA%8F.md,55.5%,困难,32 -1917,1900-1999,1917. Leetcodify 好友推荐,Leetcodify 好友推荐,https://leetcode.cn/problems/leetcodify-friends-recommendations/,leetcodify-friends-recommendations,数据库,https://algo.itcharge.cn/Solutions/1900-1999/leetcodify-friends-recommendations/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1917.%20Leetcodify%20%E5%A5%BD%E5%8F%8B%E6%8E%A8%E8%8D%90.md,31.6%,困难,30 -1918,1900-1999,1918. 第 K 小的子数组和·,第 K 小的子数组和·,https://leetcode.cn/problems/kth-smallest-subarray-sum/,kth-smallest-subarray-sum,数组、二分查找、滑动窗口,https://algo.itcharge.cn/Solutions/1900-1999/kth-smallest-subarray-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1918.%20%E7%AC%AC%20K%20%E5%B0%8F%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84%E5%92%8C%C2%B7.md,48.0%,中等,11 -1919,1900-1999,1919. 兴趣相同的朋友,兴趣相同的朋友,https://leetcode.cn/problems/leetcodify-similar-friends/,leetcodify-similar-friends,数据库,https://algo.itcharge.cn/Solutions/1900-1999/leetcodify-similar-friends/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1919.%20%E5%85%B4%E8%B6%A3%E7%9B%B8%E5%90%8C%E7%9A%84%E6%9C%8B%E5%8F%8B.md,43.3%,困难,39 -1920,1900-1999,1920. 基于排列构建数组,基于排列构建数组,https://leetcode.cn/problems/build-array-from-permutation/,build-array-from-permutation,数组、模拟,https://algo.itcharge.cn/Solutions/1900-1999/build-array-from-permutation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1920.%20%E5%9F%BA%E4%BA%8E%E6%8E%92%E5%88%97%E6%9E%84%E5%BB%BA%E6%95%B0%E7%BB%84.md,86.6%,简单,316 -1921,1900-1999,1921. 消灭怪物的最大数量,消灭怪物的最大数量,https://leetcode.cn/problems/eliminate-maximum-number-of-monsters/,eliminate-maximum-number-of-monsters,贪心、数组、排序,https://algo.itcharge.cn/Solutions/1900-1999/eliminate-maximum-number-of-monsters/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1921.%20%E6%B6%88%E7%81%AD%E6%80%AA%E7%89%A9%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E9%87%8F.md,37.0%,中等,124 -1922,1900-1999,1922. 统计好数字的数目,统计好数字的数目,https://leetcode.cn/problems/count-good-numbers/,count-good-numbers,递归、数学,https://algo.itcharge.cn/Solutions/1900-1999/count-good-numbers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1922.%20%E7%BB%9F%E8%AE%A1%E5%A5%BD%E6%95%B0%E5%AD%97%E7%9A%84%E6%95%B0%E7%9B%AE.md,36.2%,中等,104 -1923,1900-1999,1923. 最长公共子路径,最长公共子路径,https://leetcode.cn/problems/longest-common-subpath/,longest-common-subpath,数组、二分查找、后缀数组、哈希函数、滚动哈希,https://algo.itcharge.cn/Solutions/1900-1999/longest-common-subpath/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1923.%20%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%AD%90%E8%B7%AF%E5%BE%84.md,26.9%,困难,48 -1924,1900-1999,1924. 安装栅栏 II,安装栅栏 II,https://leetcode.cn/problems/erect-the-fence-ii/,erect-the-fence-ii,几何、数组、数学,https://algo.itcharge.cn/Solutions/1900-1999/erect-the-fence-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1924.%20%E5%AE%89%E8%A3%85%E6%A0%85%E6%A0%8F%20II.md,46.4%,困难,11 -1925,1900-1999,1925. 统计平方和三元组的数目,统计平方和三元组的数目,https://leetcode.cn/problems/count-square-sum-triples/,count-square-sum-triples,数学、枚举,https://algo.itcharge.cn/Solutions/1900-1999/count-square-sum-triples/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1925.%20%E7%BB%9F%E8%AE%A1%E5%B9%B3%E6%96%B9%E5%92%8C%E4%B8%89%E5%85%83%E7%BB%84%E7%9A%84%E6%95%B0%E7%9B%AE.md,69.6%,简单,144 -1926,1900-1999,1926. 迷宫中离入口最近的出口,迷宫中离入口最近的出口,https://leetcode.cn/problems/nearest-exit-from-entrance-in-maze/,nearest-exit-from-entrance-in-maze,广度优先搜索、数组、矩阵,https://algo.itcharge.cn/Solutions/1900-1999/nearest-exit-from-entrance-in-maze/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1926.%20%E8%BF%B7%E5%AE%AB%E4%B8%AD%E7%A6%BB%E5%85%A5%E5%8F%A3%E6%9C%80%E8%BF%91%E7%9A%84%E5%87%BA%E5%8F%A3.md,39.5%,中等,189 -1927,1900-1999,1927. 求和游戏,求和游戏,https://leetcode.cn/problems/sum-game/,sum-game,贪心、数学、博弈,https://algo.itcharge.cn/Solutions/1900-1999/sum-game/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1927.%20%E6%B1%82%E5%92%8C%E6%B8%B8%E6%88%8F.md,43.6%,中等,67 -1928,1900-1999,1928. 规定时间内到达终点的最小花费,规定时间内到达终点的最小花费,https://leetcode.cn/problems/minimum-cost-to-reach-destination-in-time/,minimum-cost-to-reach-destination-in-time,图、动态规划,https://algo.itcharge.cn/Solutions/1900-1999/minimum-cost-to-reach-destination-in-time/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1928.%20%E8%A7%84%E5%AE%9A%E6%97%B6%E9%97%B4%E5%86%85%E5%88%B0%E8%BE%BE%E7%BB%88%E7%82%B9%E7%9A%84%E6%9C%80%E5%B0%8F%E8%8A%B1%E8%B4%B9.md,45.9%,困难,84 -1929,1900-1999,1929. 数组串联,数组串联,https://leetcode.cn/problems/concatenation-of-array/,concatenation-of-array,数组,https://algo.itcharge.cn/Solutions/1900-1999/concatenation-of-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1929.%20%E6%95%B0%E7%BB%84%E4%B8%B2%E8%81%94.md,86.2%,简单,347 -1930,1900-1999,1930. 长度为 3 的不同回文子序列,长度为 3 的不同回文子序列,https://leetcode.cn/problems/unique-length-3-palindromic-subsequences/,unique-length-3-palindromic-subsequences,哈希表、字符串、前缀和,https://algo.itcharge.cn/Solutions/1900-1999/unique-length-3-palindromic-subsequences/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1930.%20%E9%95%BF%E5%BA%A6%E4%B8%BA%203%20%E7%9A%84%E4%B8%8D%E5%90%8C%E5%9B%9E%E6%96%87%E5%AD%90%E5%BA%8F%E5%88%97.md,51.6%,中等,153 -1931,1900-1999,1931. 用三种不同颜色为网格涂色,用三种不同颜色为网格涂色,https://leetcode.cn/problems/painting-a-grid-with-three-different-colors/,painting-a-grid-with-three-different-colors,动态规划,https://algo.itcharge.cn/Solutions/1900-1999/painting-a-grid-with-three-different-colors/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1931.%20%E7%94%A8%E4%B8%89%E7%A7%8D%E4%B8%8D%E5%90%8C%E9%A2%9C%E8%89%B2%E4%B8%BA%E7%BD%91%E6%A0%BC%E6%B6%82%E8%89%B2.md,59.3%,困难,93 -1932,1900-1999,1932. 合并多棵二叉搜索树,合并多棵二叉搜索树,https://leetcode.cn/problems/merge-bsts-to-create-single-bst/,merge-bsts-to-create-single-bst,树、深度优先搜索、哈希表、二分查找、二叉树,https://algo.itcharge.cn/Solutions/1900-1999/merge-bsts-to-create-single-bst/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1932.%20%E5%90%88%E5%B9%B6%E5%A4%9A%E6%A3%B5%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md,33.3%,困难,54 -1933,1900-1999,1933. 判断字符串是否可分解为值均等的子串,判断字符串是否可分解为值均等的子串,https://leetcode.cn/problems/check-if-string-is-decomposable-into-value-equal-substrings/,check-if-string-is-decomposable-into-value-equal-substrings,字符串,https://algo.itcharge.cn/Solutions/1900-1999/check-if-string-is-decomposable-into-value-equal-substrings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1933.%20%E5%88%A4%E6%96%AD%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%98%AF%E5%90%A6%E5%8F%AF%E5%88%86%E8%A7%A3%E4%B8%BA%E5%80%BC%E5%9D%87%E7%AD%89%E7%9A%84%E5%AD%90%E4%B8%B2.md,49.3%,简单,42 -1934,1900-1999,1934. 确认率,确认率,https://leetcode.cn/problems/confirmation-rate/,confirmation-rate,数据库,https://algo.itcharge.cn/Solutions/1900-1999/confirmation-rate/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1934.%20%E7%A1%AE%E8%AE%A4%E7%8E%87.md,67.8%,中等,63 -1935,1900-1999,1935. 可以输入的最大单词数,可以输入的最大单词数,https://leetcode.cn/problems/maximum-number-of-words-you-can-type/,maximum-number-of-words-you-can-type,哈希表、字符串,https://algo.itcharge.cn/Solutions/1900-1999/maximum-number-of-words-you-can-type/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1935.%20%E5%8F%AF%E4%BB%A5%E8%BE%93%E5%85%A5%E7%9A%84%E6%9C%80%E5%A4%A7%E5%8D%95%E8%AF%8D%E6%95%B0.md,70.9%,简单,233 -1936,1900-1999,1936. 新增的最少台阶数,新增的最少台阶数,https://leetcode.cn/problems/add-minimum-number-of-rungs/,add-minimum-number-of-rungs,贪心、数组,https://algo.itcharge.cn/Solutions/1900-1999/add-minimum-number-of-rungs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1936.%20%E6%96%B0%E5%A2%9E%E7%9A%84%E6%9C%80%E5%B0%91%E5%8F%B0%E9%98%B6%E6%95%B0.md,46.3%,中等,118 -1937,1900-1999,1937. 扣分后的最大得分,扣分后的最大得分,https://leetcode.cn/problems/maximum-number-of-points-with-cost/,maximum-number-of-points-with-cost,数组、动态规划,https://algo.itcharge.cn/Solutions/1900-1999/maximum-number-of-points-with-cost/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1937.%20%E6%89%A3%E5%88%86%E5%90%8E%E7%9A%84%E6%9C%80%E5%A4%A7%E5%BE%97%E5%88%86.md,28.9%,中等,91 -1938,1900-1999,1938. 查询最大基因差,查询最大基因差,https://leetcode.cn/problems/maximum-genetic-difference-query/,maximum-genetic-difference-query,位运算、字典树、数组,https://algo.itcharge.cn/Solutions/1900-1999/maximum-genetic-difference-query/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1938.%20%E6%9F%A5%E8%AF%A2%E6%9C%80%E5%A4%A7%E5%9F%BA%E5%9B%A0%E5%B7%AE.md,40.2%,困难,51 -1939,1900-1999,1939. 主动请求确认消息的用户,主动请求确认消息的用户,https://leetcode.cn/problems/users-that-actively-request-confirmation-messages/,users-that-actively-request-confirmation-messages,数据库,https://algo.itcharge.cn/Solutions/1900-1999/users-that-actively-request-confirmation-messages/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1939.%20%E4%B8%BB%E5%8A%A8%E8%AF%B7%E6%B1%82%E7%A1%AE%E8%AE%A4%E6%B6%88%E6%81%AF%E7%9A%84%E7%94%A8%E6%88%B7.md,59.8%,简单,28 -1940,1900-1999,1940. 排序数组之间的最长公共子序列,排序数组之间的最长公共子序列,https://leetcode.cn/problems/longest-common-subsequence-between-sorted-arrays/,longest-common-subsequence-between-sorted-arrays,数组、哈希表、计数,https://algo.itcharge.cn/Solutions/1900-1999/longest-common-subsequence-between-sorted-arrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1940.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B9%8B%E9%97%B4%E7%9A%84%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%AD%90%E5%BA%8F%E5%88%97.md,74.1%,中等,40 -1941,1900-1999,1941. 检查是否所有字符出现次数相同,检查是否所有字符出现次数相同,https://leetcode.cn/problems/check-if-all-characters-have-equal-number-of-occurrences/,check-if-all-characters-have-equal-number-of-occurrences,哈希表、字符串、计数,https://algo.itcharge.cn/Solutions/1900-1999/check-if-all-characters-have-equal-number-of-occurrences/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1941.%20%E6%A3%80%E6%9F%A5%E6%98%AF%E5%90%A6%E6%89%80%E6%9C%89%E5%AD%97%E7%AC%A6%E5%87%BA%E7%8E%B0%E6%AC%A1%E6%95%B0%E7%9B%B8%E5%90%8C.md,73.6%,简单,193 -1942,1900-1999,1942. 最小未被占据椅子的编号,最小未被占据椅子的编号,https://leetcode.cn/problems/the-number-of-the-smallest-unoccupied-chair/,the-number-of-the-smallest-unoccupied-chair,数组、有序集合、堆（优先队列）,https://algo.itcharge.cn/Solutions/1900-1999/the-number-of-the-smallest-unoccupied-chair/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1942.%20%E6%9C%80%E5%B0%8F%E6%9C%AA%E8%A2%AB%E5%8D%A0%E6%8D%AE%E6%A4%85%E5%AD%90%E7%9A%84%E7%BC%96%E5%8F%B7.md,41.9%,中等,110 -1943,1900-1999,1943. 描述绘画结果,描述绘画结果,https://leetcode.cn/problems/describe-the-painting/,describe-the-painting,数组、前缀和,https://algo.itcharge.cn/Solutions/1900-1999/describe-the-painting/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1943.%20%E6%8F%8F%E8%BF%B0%E7%BB%98%E7%94%BB%E7%BB%93%E6%9E%9C.md,43.9%,中等,75 -1944,1900-1999,1944. 队列中可以看到的人数,队列中可以看到的人数,https://leetcode.cn/problems/number-of-visible-people-in-a-queue/,number-of-visible-people-in-a-queue,栈、数组、单调栈,https://algo.itcharge.cn/Solutions/1900-1999/number-of-visible-people-in-a-queue/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1944.%20%E9%98%9F%E5%88%97%E4%B8%AD%E5%8F%AF%E4%BB%A5%E7%9C%8B%E5%88%B0%E7%9A%84%E4%BA%BA%E6%95%B0.md,63.4%,困难,112 -1945,1900-1999,1945. 字符串转化后的各位数字之和,字符串转化后的各位数字之和,https://leetcode.cn/problems/sum-of-digits-of-string-after-convert/,sum-of-digits-of-string-after-convert,字符串、模拟,https://algo.itcharge.cn/Solutions/1900-1999/sum-of-digits-of-string-after-convert/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1945.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%BD%AC%E5%8C%96%E5%90%8E%E7%9A%84%E5%90%84%E4%BD%8D%E6%95%B0%E5%AD%97%E4%B9%8B%E5%92%8C.md,70.4%,简单,379 -1946,1900-1999,1946. 子字符串突变后可能得到的最大整数,子字符串突变后可能得到的最大整数,https://leetcode.cn/problems/largest-number-after-mutating-substring/,largest-number-after-mutating-substring,贪心、数组、字符串,https://algo.itcharge.cn/Solutions/1900-1999/largest-number-after-mutating-substring/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1946.%20%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%AA%81%E5%8F%98%E5%90%8E%E5%8F%AF%E8%83%BD%E5%BE%97%E5%88%B0%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B4%E6%95%B0.md,32.2%,中等,113 -1947,1900-1999,1947. 最大兼容性评分和,最大兼容性评分和,https://leetcode.cn/problems/maximum-compatibility-score-sum/,maximum-compatibility-score-sum,位运算、数组、动态规划、回溯、状态压缩,https://algo.itcharge.cn/Solutions/1900-1999/maximum-compatibility-score-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1947.%20%E6%9C%80%E5%A4%A7%E5%85%BC%E5%AE%B9%E6%80%A7%E8%AF%84%E5%88%86%E5%92%8C.md,58.0%,中等,128 -1948,1900-1999,1948. 删除系统中的重复文件夹,删除系统中的重复文件夹,https://leetcode.cn/problems/delete-duplicate-folders-in-system/,delete-duplicate-folders-in-system,字典树、数组、哈希表、字符串、哈希函数,https://algo.itcharge.cn/Solutions/1900-1999/delete-duplicate-folders-in-system/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1948.%20%E5%88%A0%E9%99%A4%E7%B3%BB%E7%BB%9F%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E6%96%87%E4%BB%B6%E5%A4%B9.md,54.4%,困难,29 -1949,1900-1999,1949. 坚定的友谊,坚定的友谊,https://leetcode.cn/problems/strong-friendship/,strong-friendship,数据库,https://algo.itcharge.cn/Solutions/1900-1999/strong-friendship/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1949.%20%E5%9D%9A%E5%AE%9A%E7%9A%84%E5%8F%8B%E8%B0%8A.md,52.1%,中等,48 -1950,1900-1999,1950. 所有子数组最小值中的最大值,所有子数组最小值中的最大值,https://leetcode.cn/problems/maximum-of-minimum-values-in-all-subarrays/,maximum-of-minimum-values-in-all-subarrays,栈、数组、单调栈,https://algo.itcharge.cn/Solutions/1900-1999/maximum-of-minimum-values-in-all-subarrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1950.%20%E6%89%80%E6%9C%89%E5%AD%90%E6%95%B0%E7%BB%84%E6%9C%80%E5%B0%8F%E5%80%BC%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md,51.3%,中等,16 -1951,1900-1999,1951. 查询具有最多共同关注者的所有两两结对组,查询具有最多共同关注者的所有两两结对组,https://leetcode.cn/problems/all-the-pairs-with-the-maximum-number-of-common-followers/,all-the-pairs-with-the-maximum-number-of-common-followers,数据库,https://algo.itcharge.cn/Solutions/1900-1999/all-the-pairs-with-the-maximum-number-of-common-followers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1951.%20%E6%9F%A5%E8%AF%A2%E5%85%B7%E6%9C%89%E6%9C%80%E5%A4%9A%E5%85%B1%E5%90%8C%E5%85%B3%E6%B3%A8%E8%80%85%E7%9A%84%E6%89%80%E6%9C%89%E4%B8%A4%E4%B8%A4%E7%BB%93%E5%AF%B9%E7%BB%84.md,65.2%,中等,53 -1952,1900-1999,1952. 三除数,三除数,https://leetcode.cn/problems/three-divisors/,three-divisors,数学,https://algo.itcharge.cn/Solutions/1900-1999/three-divisors/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1952.%20%E4%B8%89%E9%99%A4%E6%95%B0.md,54.8%,简单,175 -1953,1900-1999,1953. 你可以工作的最大周数,你可以工作的最大周数,https://leetcode.cn/problems/maximum-number-of-weeks-for-which-you-can-work/,maximum-number-of-weeks-for-which-you-can-work,贪心、数组,https://algo.itcharge.cn/Solutions/1900-1999/maximum-number-of-weeks-for-which-you-can-work/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1953.%20%E4%BD%A0%E5%8F%AF%E4%BB%A5%E5%B7%A5%E4%BD%9C%E7%9A%84%E6%9C%80%E5%A4%A7%E5%91%A8%E6%95%B0.md,37.2%,中等,114 -1954,1900-1999,1954. 收集足够苹果的最小花园周长,收集足够苹果的最小花园周长,https://leetcode.cn/problems/minimum-garden-perimeter-to-collect-enough-apples/,minimum-garden-perimeter-to-collect-enough-apples,数学、二分查找,https://algo.itcharge.cn/Solutions/1900-1999/minimum-garden-perimeter-to-collect-enough-apples/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1954.%20%E6%94%B6%E9%9B%86%E8%B6%B3%E5%A4%9F%E8%8B%B9%E6%9E%9C%E7%9A%84%E6%9C%80%E5%B0%8F%E8%8A%B1%E5%9B%AD%E5%91%A8%E9%95%BF.md,49.7%,中等,93 -1955,1900-1999,1955. 统计特殊子序列的数目,统计特殊子序列的数目,https://leetcode.cn/problems/count-number-of-special-subsequences/,count-number-of-special-subsequences,数组、动态规划,https://algo.itcharge.cn/Solutions/1900-1999/count-number-of-special-subsequences/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1955.%20%E7%BB%9F%E8%AE%A1%E7%89%B9%E6%AE%8A%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E6%95%B0%E7%9B%AE.md,52.5%,困难,60 -1956,1900-1999,1956. 感染 K 种病毒所需的最短时间,感染 K 种病毒所需的最短时间,https://leetcode.cn/problems/minimum-time-for-k-virus-variants-to-spread/,minimum-time-for-k-virus-variants-to-spread,几何、数组、数学、二分查找、枚举,https://algo.itcharge.cn/Solutions/1900-1999/minimum-time-for-k-virus-variants-to-spread/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1956.%20%E6%84%9F%E6%9F%93%20K%20%E7%A7%8D%E7%97%85%E6%AF%92%E6%89%80%E9%9C%80%E7%9A%84%E6%9C%80%E7%9F%AD%E6%97%B6%E9%97%B4.md,38.0%,困难,15 -1957,1900-1999,1957. 删除字符使字符串变好,删除字符使字符串变好,https://leetcode.cn/problems/delete-characters-to-make-fancy-string/,delete-characters-to-make-fancy-string,字符串,https://algo.itcharge.cn/Solutions/1900-1999/delete-characters-to-make-fancy-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1957.%20%E5%88%A0%E9%99%A4%E5%AD%97%E7%AC%A6%E4%BD%BF%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%8F%98%E5%A5%BD.md,60.0%,简单,141 -1958,1900-1999,1958. 检查操作是否合法,检查操作是否合法,https://leetcode.cn/problems/check-if-move-is-legal/,check-if-move-is-legal,数组、枚举、矩阵,https://algo.itcharge.cn/Solutions/1900-1999/check-if-move-is-legal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1958.%20%E6%A3%80%E6%9F%A5%E6%93%8D%E4%BD%9C%E6%98%AF%E5%90%A6%E5%90%88%E6%B3%95.md,44.7%,中等,65 -1959,1900-1999,1959. K 次调整数组大小浪费的最小总空间,K 次调整数组大小浪费的最小总空间,https://leetcode.cn/problems/minimum-total-space-wasted-with-k-resizing-operations/,minimum-total-space-wasted-with-k-resizing-operations,数组、动态规划,https://algo.itcharge.cn/Solutions/1900-1999/minimum-total-space-wasted-with-k-resizing-operations/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1959.%20K%20%E6%AC%A1%E8%B0%83%E6%95%B4%E6%95%B0%E7%BB%84%E5%A4%A7%E5%B0%8F%E6%B5%AA%E8%B4%B9%E7%9A%84%E6%9C%80%E5%B0%8F%E6%80%BB%E7%A9%BA%E9%97%B4.md,45.9%,中等,51 -1960,1900-1999,1960. 两个回文子字符串长度的最大乘积,两个回文子字符串长度的最大乘积,https://leetcode.cn/problems/maximum-product-of-the-length-of-two-palindromic-substrings/,maximum-product-of-the-length-of-two-palindromic-substrings,字符串、哈希函数、滚动哈希,https://algo.itcharge.cn/Solutions/1900-1999/maximum-product-of-the-length-of-two-palindromic-substrings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1960.%20%E4%B8%A4%E4%B8%AA%E5%9B%9E%E6%96%87%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E9%95%BF%E5%BA%A6%E7%9A%84%E6%9C%80%E5%A4%A7%E4%B9%98%E7%A7%AF.md,32.3%,困难,37 -1961,1900-1999,1961. 检查字符串是否为数组前缀,检查字符串是否为数组前缀,https://leetcode.cn/problems/check-if-string-is-a-prefix-of-array/,check-if-string-is-a-prefix-of-array,数组、字符串,https://algo.itcharge.cn/Solutions/1900-1999/check-if-string-is-a-prefix-of-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1961.%20%E6%A3%80%E6%9F%A5%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%98%AF%E5%90%A6%E4%B8%BA%E6%95%B0%E7%BB%84%E5%89%8D%E7%BC%80.md,52.7%,简单,152 -1962,1900-1999,1962. 移除石子使总数最小,移除石子使总数最小,https://leetcode.cn/problems/remove-stones-to-minimize-the-total/,remove-stones-to-minimize-the-total,数组、堆（优先队列）,https://algo.itcharge.cn/Solutions/1900-1999/remove-stones-to-minimize-the-total/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1962.%20%E7%A7%BB%E9%99%A4%E7%9F%B3%E5%AD%90%E4%BD%BF%E6%80%BB%E6%95%B0%E6%9C%80%E5%B0%8F.md,46.6%,中等,104 -1963,1900-1999,1963. 使字符串平衡的最小交换次数,使字符串平衡的最小交换次数,https://leetcode.cn/problems/minimum-number-of-swaps-to-make-the-string-balanced/,minimum-number-of-swaps-to-make-the-string-balanced,栈、贪心、双指针、字符串,https://algo.itcharge.cn/Solutions/1900-1999/minimum-number-of-swaps-to-make-the-string-balanced/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1963.%20%E4%BD%BF%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%B9%B3%E8%A1%A1%E7%9A%84%E6%9C%80%E5%B0%8F%E4%BA%A4%E6%8D%A2%E6%AC%A1%E6%95%B0.md,64.5%,中等,84 -1964,1900-1999,1964. 找出到每个位置为止最长的有效障碍赛跑路线,找出到每个位置为止最长的有效障碍赛跑路线,https://leetcode.cn/problems/find-the-longest-valid-obstacle-course-at-each-position/,find-the-longest-valid-obstacle-course-at-each-position,树状数组、数组、二分查找,https://algo.itcharge.cn/Solutions/1900-1999/find-the-longest-valid-obstacle-course-at-each-position/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1964.%20%E6%89%BE%E5%87%BA%E5%88%B0%E6%AF%8F%E4%B8%AA%E4%BD%8D%E7%BD%AE%E4%B8%BA%E6%AD%A2%E6%9C%80%E9%95%BF%E7%9A%84%E6%9C%89%E6%95%88%E9%9A%9C%E7%A2%8D%E8%B5%9B%E8%B7%91%E8%B7%AF%E7%BA%BF.md,43.6%,困难,73 -1965,1900-1999,1965. 丢失信息的雇员,丢失信息的雇员,https://leetcode.cn/problems/employees-with-missing-information/,employees-with-missing-information,数据库,https://algo.itcharge.cn/Solutions/1900-1999/employees-with-missing-information/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1965.%20%E4%B8%A2%E5%A4%B1%E4%BF%A1%E6%81%AF%E7%9A%84%E9%9B%87%E5%91%98.md,71.0%,简单,292 -1966,1900-1999,1966. 未排序数组中的可被二分搜索的数,未排序数组中的可被二分搜索的数,https://leetcode.cn/problems/binary-searchable-numbers-in-an-unsorted-array/,binary-searchable-numbers-in-an-unsorted-array,数组、二分查找,https://algo.itcharge.cn/Solutions/1900-1999/binary-searchable-numbers-in-an-unsorted-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1966.%20%E6%9C%AA%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E5%8F%AF%E8%A2%AB%E4%BA%8C%E5%88%86%E6%90%9C%E7%B4%A2%E7%9A%84%E6%95%B0.md,64.4%,中等,10 -1967,1900-1999,1967. 作为子字符串出现在单词中的字符串数目,作为子字符串出现在单词中的字符串数目,https://leetcode.cn/problems/number-of-strings-that-appear-as-substrings-in-word/,number-of-strings-that-appear-as-substrings-in-word,字符串,https://algo.itcharge.cn/Solutions/1900-1999/number-of-strings-that-appear-as-substrings-in-word/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1967.%20%E4%BD%9C%E4%B8%BA%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%87%BA%E7%8E%B0%E5%9C%A8%E5%8D%95%E8%AF%8D%E4%B8%AD%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%95%B0%E7%9B%AE.md,79.3%,简单,159 -1968,1900-1999,1968. 构造元素不等于两相邻元素平均值的数组,构造元素不等于两相邻元素平均值的数组,https://leetcode.cn/problems/array-with-elements-not-equal-to-average-of-neighbors/,array-with-elements-not-equal-to-average-of-neighbors,贪心、数组、排序,https://algo.itcharge.cn/Solutions/1900-1999/array-with-elements-not-equal-to-average-of-neighbors/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1968.%20%E6%9E%84%E9%80%A0%E5%85%83%E7%B4%A0%E4%B8%8D%E7%AD%89%E4%BA%8E%E4%B8%A4%E7%9B%B8%E9%82%BB%E5%85%83%E7%B4%A0%E5%B9%B3%E5%9D%87%E5%80%BC%E7%9A%84%E6%95%B0%E7%BB%84.md,39.2%,中等,97 -1969,1900-1999,1969. 数组元素的最小非零乘积,数组元素的最小非零乘积,https://leetcode.cn/problems/minimum-non-zero-product-of-the-array-elements/,minimum-non-zero-product-of-the-array-elements,贪心、递归、数学,https://algo.itcharge.cn/Solutions/1900-1999/minimum-non-zero-product-of-the-array-elements/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1969.%20%E6%95%B0%E7%BB%84%E5%85%83%E7%B4%A0%E7%9A%84%E6%9C%80%E5%B0%8F%E9%9D%9E%E9%9B%B6%E4%B9%98%E7%A7%AF.md,29.8%,中等,57 -1970,1900-1999,1970. 你能穿过矩阵的最后一天,你能穿过矩阵的最后一天,https://leetcode.cn/problems/last-day-where-you-can-still-cross/,last-day-where-you-can-still-cross,深度优先搜索、广度优先搜索、并查集、数组、二分查找、矩阵,https://algo.itcharge.cn/Solutions/1900-1999/last-day-where-you-can-still-cross/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1970.%20%E4%BD%A0%E8%83%BD%E7%A9%BF%E8%BF%87%E7%9F%A9%E9%98%B5%E7%9A%84%E6%9C%80%E5%90%8E%E4%B8%80%E5%A4%A9.md,50.5%,困难,71 -1971,1900-1999,1971. 寻找图中是否存在路径,寻找图中是否存在路径,https://leetcode.cn/problems/find-if-path-exists-in-graph/,find-if-path-exists-in-graph,深度优先搜索、广度优先搜索、并查集、图,https://algo.itcharge.cn/Solutions/1900-1999/find-if-path-exists-in-graph/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1971.%20%E5%AF%BB%E6%89%BE%E5%9B%BE%E4%B8%AD%E6%98%AF%E5%90%A6%E5%AD%98%E5%9C%A8%E8%B7%AF%E5%BE%84.md,54.2%,简单,316 -1972,1900-1999,1972. 同一天的第一个电话和最后一个电话,同一天的第一个电话和最后一个电话,https://leetcode.cn/problems/first-and-last-call-on-the-same-day/,first-and-last-call-on-the-same-day,数据库,https://algo.itcharge.cn/Solutions/1900-1999/first-and-last-call-on-the-same-day/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1972.%20%E5%90%8C%E4%B8%80%E5%A4%A9%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E7%94%B5%E8%AF%9D%E5%92%8C%E6%9C%80%E5%90%8E%E4%B8%80%E4%B8%AA%E7%94%B5%E8%AF%9D.md,42.5%,困难,46 -1973,1900-1999,1973. 值等于子节点值之和的节点数量,值等于子节点值之和的节点数量,https://leetcode.cn/problems/count-nodes-equal-to-sum-of-descendants/,count-nodes-equal-to-sum-of-descendants,树、深度优先搜索、二叉搜索树、二叉树,https://algo.itcharge.cn/Solutions/1900-1999/count-nodes-equal-to-sum-of-descendants/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1973.%20%E5%80%BC%E7%AD%89%E4%BA%8E%E5%AD%90%E8%8A%82%E7%82%B9%E5%80%BC%E4%B9%8B%E5%92%8C%E7%9A%84%E8%8A%82%E7%82%B9%E6%95%B0%E9%87%8F.md,60.2%,中等,21 -1974,1900-1999,1974. 使用特殊打字机键入单词的最少时间,使用特殊打字机键入单词的最少时间,https://leetcode.cn/problems/minimum-time-to-type-word-using-special-typewriter/,minimum-time-to-type-word-using-special-typewriter,贪心、字符串,https://algo.itcharge.cn/Solutions/1900-1999/minimum-time-to-type-word-using-special-typewriter/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1974.%20%E4%BD%BF%E7%94%A8%E7%89%B9%E6%AE%8A%E6%89%93%E5%AD%97%E6%9C%BA%E9%94%AE%E5%85%A5%E5%8D%95%E8%AF%8D%E7%9A%84%E6%9C%80%E5%B0%91%E6%97%B6%E9%97%B4.md,71.3%,简单,142 -1975,1900-1999,1975. 最大方阵和,最大方阵和,https://leetcode.cn/problems/maximum-matrix-sum/,maximum-matrix-sum,贪心、数组、矩阵,https://algo.itcharge.cn/Solutions/1900-1999/maximum-matrix-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1975.%20%E6%9C%80%E5%A4%A7%E6%96%B9%E9%98%B5%E5%92%8C.md,41.6%,中等,76 -1976,1900-1999,1976. 到达目的地的方案数,到达目的地的方案数,https://leetcode.cn/problems/number-of-ways-to-arrive-at-destination/,number-of-ways-to-arrive-at-destination,图、拓扑排序、动态规划、最短路,https://algo.itcharge.cn/Solutions/1900-1999/number-of-ways-to-arrive-at-destination/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1976.%20%E5%88%B0%E8%BE%BE%E7%9B%AE%E7%9A%84%E5%9C%B0%E7%9A%84%E6%96%B9%E6%A1%88%E6%95%B0.md,36.5%,中等,107 -1977,1900-1999,1977. 划分数字的方案数,划分数字的方案数,https://leetcode.cn/problems/number-of-ways-to-separate-numbers/,number-of-ways-to-separate-numbers,字符串、动态规划、后缀数组,https://algo.itcharge.cn/Solutions/1900-1999/number-of-ways-to-separate-numbers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1977.%20%E5%88%92%E5%88%86%E6%95%B0%E5%AD%97%E7%9A%84%E6%96%B9%E6%A1%88%E6%95%B0.md,30.1%,困难,28 -1978,1900-1999,1978. 上级经理已离职的公司员工,上级经理已离职的公司员工,https://leetcode.cn/problems/employees-whose-manager-left-the-company/,employees-whose-manager-left-the-company,数据库,https://algo.itcharge.cn/Solutions/1900-1999/employees-whose-manager-left-the-company/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1978.%20%E4%B8%8A%E7%BA%A7%E7%BB%8F%E7%90%86%E5%B7%B2%E7%A6%BB%E8%81%8C%E7%9A%84%E5%85%AC%E5%8F%B8%E5%91%98%E5%B7%A5.md,50.1%,简单,49 -1979,1900-1999,1979. 找出数组的最大公约数,找出数组的最大公约数,https://leetcode.cn/problems/find-greatest-common-divisor-of-array/,find-greatest-common-divisor-of-array,数组、数学、数论,https://algo.itcharge.cn/Solutions/1900-1999/find-greatest-common-divisor-of-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1979.%20%E6%89%BE%E5%87%BA%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%85%AC%E7%BA%A6%E6%95%B0.md,77.1%,简单,272 -1980,1900-1999,1980. 找出不同的二进制字符串,找出不同的二进制字符串,https://leetcode.cn/problems/find-unique-binary-string/,find-unique-binary-string,数组、字符串、回溯,https://algo.itcharge.cn/Solutions/1900-1999/find-unique-binary-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1980.%20%E6%89%BE%E5%87%BA%E4%B8%8D%E5%90%8C%E7%9A%84%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%AD%97%E7%AC%A6%E4%B8%B2.md,59.8%,中等,149 -1981,1900-1999,1981. 最小化目标值与所选元素的差,最小化目标值与所选元素的差,https://leetcode.cn/problems/minimize-the-difference-between-target-and-chosen-elements/,minimize-the-difference-between-target-and-chosen-elements,数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/1900-1999/minimize-the-difference-between-target-and-chosen-elements/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1981.%20%E6%9C%80%E5%B0%8F%E5%8C%96%E7%9B%AE%E6%A0%87%E5%80%BC%E4%B8%8E%E6%89%80%E9%80%89%E5%85%83%E7%B4%A0%E7%9A%84%E5%B7%AE.md,33.2%,中等,108 -1982,1900-1999,1982. 从子集的和还原数组,从子集的和还原数组,https://leetcode.cn/problems/find-array-given-subset-sums/,find-array-given-subset-sums,数组、分治,https://algo.itcharge.cn/Solutions/1900-1999/find-array-given-subset-sums/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1982.%20%E4%BB%8E%E5%AD%90%E9%9B%86%E7%9A%84%E5%92%8C%E8%BF%98%E5%8E%9F%E6%95%B0%E7%BB%84.md,48.4%,困难,28 -1983,1900-1999,1983. 范围和相等的最宽索引对,范围和相等的最宽索引对,https://leetcode.cn/problems/widest-pair-of-indices-with-equal-range-sum/,widest-pair-of-indices-with-equal-range-sum,数组、哈希表、前缀和,https://algo.itcharge.cn/Solutions/1900-1999/widest-pair-of-indices-with-equal-range-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1983.%20%E8%8C%83%E5%9B%B4%E5%92%8C%E7%9B%B8%E7%AD%89%E7%9A%84%E6%9C%80%E5%AE%BD%E7%B4%A2%E5%BC%95%E5%AF%B9.md,47.7%,中等,13 -1984,1900-1999,1984. 学生分数的最小差值,学生分数的最小差值,https://leetcode.cn/problems/minimum-difference-between-highest-and-lowest-of-k-scores/,minimum-difference-between-highest-and-lowest-of-k-scores,数组、排序、滑动窗口,https://algo.itcharge.cn/Solutions/1900-1999/minimum-difference-between-highest-and-lowest-of-k-scores/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1984.%20%E5%AD%A6%E7%94%9F%E5%88%86%E6%95%B0%E7%9A%84%E6%9C%80%E5%B0%8F%E5%B7%AE%E5%80%BC.md,61.8%,简单,549 -1985,1900-1999,1985. 找出数组中的第 K 大整数,找出数组中的第 K 大整数,https://leetcode.cn/problems/find-the-kth-largest-integer-in-the-array/,find-the-kth-largest-integer-in-the-array,数组、字符串、分治、快速选择、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/1900-1999/find-the-kth-largest-integer-in-the-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1985.%20%E6%89%BE%E5%87%BA%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E7%AC%AC%20K%20%E5%A4%A7%E6%95%B4%E6%95%B0.md,42.1%,中等,152 -1986,1900-1999,1986. 完成任务的最少工作时间段,完成任务的最少工作时间段,https://leetcode.cn/problems/minimum-number-of-work-sessions-to-finish-the-tasks/,minimum-number-of-work-sessions-to-finish-the-tasks,位运算、数组、动态规划、回溯、状态压缩,https://algo.itcharge.cn/Solutions/1900-1999/minimum-number-of-work-sessions-to-finish-the-tasks/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1986.%20%E5%AE%8C%E6%88%90%E4%BB%BB%E5%8A%A1%E7%9A%84%E6%9C%80%E5%B0%91%E5%B7%A5%E4%BD%9C%E6%97%B6%E9%97%B4%E6%AE%B5.md,33.0%,中等,118 -1987,1900-1999,1987. 不同的好子序列数目,不同的好子序列数目,https://leetcode.cn/problems/number-of-unique-good-subsequences/,number-of-unique-good-subsequences,字符串、动态规划,https://algo.itcharge.cn/Solutions/1900-1999/number-of-unique-good-subsequences/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1987.%20%E4%B8%8D%E5%90%8C%E7%9A%84%E5%A5%BD%E5%AD%90%E5%BA%8F%E5%88%97%E6%95%B0%E7%9B%AE.md,50.3%,困难,42 -1988,1900-1999,1988. 找出每所学校的最低分数要求,找出每所学校的最低分数要求,https://leetcode.cn/problems/find-cutoff-score-for-each-school/,find-cutoff-score-for-each-school,数据库,https://algo.itcharge.cn/Solutions/1900-1999/find-cutoff-score-for-each-school/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1988.%20%E6%89%BE%E5%87%BA%E6%AF%8F%E6%89%80%E5%AD%A6%E6%A0%A1%E7%9A%84%E6%9C%80%E4%BD%8E%E5%88%86%E6%95%B0%E8%A6%81%E6%B1%82.md,64.5%,中等,60 -1989,1900-1999,1989. 捉迷藏中可捕获的最大人数,捉迷藏中可捕获的最大人数,https://leetcode.cn/problems/maximum-number-of-people-that-can-be-caught-in-tag/,maximum-number-of-people-that-can-be-caught-in-tag,贪心、数组,https://algo.itcharge.cn/Solutions/1900-1999/maximum-number-of-people-that-can-be-caught-in-tag/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1989.%20%E6%8D%89%E8%BF%B7%E8%97%8F%E4%B8%AD%E5%8F%AF%E6%8D%95%E8%8E%B7%E7%9A%84%E6%9C%80%E5%A4%A7%E4%BA%BA%E6%95%B0.md,55.8%,中等,14 -1990,1900-1999,1990. 统计实验的数量,统计实验的数量,https://leetcode.cn/problems/count-the-number-of-experiments/,count-the-number-of-experiments,数据库,https://algo.itcharge.cn/Solutions/1900-1999/count-the-number-of-experiments/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1990.%20%E7%BB%9F%E8%AE%A1%E5%AE%9E%E9%AA%8C%E7%9A%84%E6%95%B0%E9%87%8F.md,47.0%,中等,28 -1991,1900-1999,1991. 找到数组的中间位置,找到数组的中间位置,https://leetcode.cn/problems/find-the-middle-index-in-array/,find-the-middle-index-in-array,数组、前缀和,https://algo.itcharge.cn/Solutions/1900-1999/find-the-middle-index-in-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1991.%20%E6%89%BE%E5%88%B0%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%AD%E9%97%B4%E4%BD%8D%E7%BD%AE.md,63.8%,简单,297 -1992,1900-1999,1992. 找到所有的农场组,找到所有的农场组,https://leetcode.cn/problems/find-all-groups-of-farmland/,find-all-groups-of-farmland,深度优先搜索、广度优先搜索、数组、矩阵,https://algo.itcharge.cn/Solutions/1900-1999/find-all-groups-of-farmland/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1992.%20%E6%89%BE%E5%88%B0%E6%89%80%E6%9C%89%E7%9A%84%E5%86%9C%E5%9C%BA%E7%BB%84.md,61.2%,中等,117 -1993,1900-1999,1993. 树上的操作,树上的操作,https://leetcode.cn/problems/operations-on-tree/,operations-on-tree,树、深度优先搜索、广度优先搜索、设计、哈希表,https://algo.itcharge.cn/Solutions/1900-1999/operations-on-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1993.%20%E6%A0%91%E4%B8%8A%E7%9A%84%E6%93%8D%E4%BD%9C.md,39.8%,中等,68 -1994,1900-1999,1994. 好子集的数目,好子集的数目,https://leetcode.cn/problems/the-number-of-good-subsets/,the-number-of-good-subsets,位运算、数组、数学、动态规划、状态压缩,https://algo.itcharge.cn/Solutions/1900-1999/the-number-of-good-subsets/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1994.%20%E5%A5%BD%E5%AD%90%E9%9B%86%E7%9A%84%E6%95%B0%E7%9B%AE.md,56.1%,困难,190 -1995,1900-1999,1995. 统计特殊四元组,统计特殊四元组,https://leetcode.cn/problems/count-special-quadruplets/,count-special-quadruplets,数组、枚举,https://algo.itcharge.cn/Solutions/1900-1999/count-special-quadruplets/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1995.%20%E7%BB%9F%E8%AE%A1%E7%89%B9%E6%AE%8A%E5%9B%9B%E5%85%83%E7%BB%84.md,66.3%,简单,289 -1996,1900-1999,1996. 游戏中弱角色的数量,游戏中弱角色的数量,https://leetcode.cn/problems/the-number-of-weak-characters-in-the-game/,the-number-of-weak-characters-in-the-game,栈、贪心、数组、排序、单调栈,https://algo.itcharge.cn/Solutions/1900-1999/the-number-of-weak-characters-in-the-game/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1996.%20%E6%B8%B8%E6%88%8F%E4%B8%AD%E5%BC%B1%E8%A7%92%E8%89%B2%E7%9A%84%E6%95%B0%E9%87%8F.md,41.5%,中等,308 -1997,1900-1999,1997. 访问完所有房间的第一天,访问完所有房间的第一天,https://leetcode.cn/problems/first-day-where-you-have-been-in-all-the-rooms/,first-day-where-you-have-been-in-all-the-rooms,数组、动态规划,https://algo.itcharge.cn/Solutions/1900-1999/first-day-where-you-have-been-in-all-the-rooms/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1997.%20%E8%AE%BF%E9%97%AE%E5%AE%8C%E6%89%80%E6%9C%89%E6%88%BF%E9%97%B4%E7%9A%84%E7%AC%AC%E4%B8%80%E5%A4%A9.md,35.2%,中等,53 -1998,1900-1999,1998. 数组的最大公因数排序,数组的最大公因数排序,https://leetcode.cn/problems/gcd-sort-of-an-array/,gcd-sort-of-an-array,并查集、数组、数学、数论、排序,https://algo.itcharge.cn/Solutions/1900-1999/gcd-sort-of-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1998.%20%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%85%AC%E5%9B%A0%E6%95%B0%E6%8E%92%E5%BA%8F.md,45.8%,困难,59 -1999,1900-1999,1999. 最小的仅由两个数组成的倍数,最小的仅由两个数组成的倍数,https://leetcode.cn/problems/smallest-greater-multiple-made-of-two-digits/,smallest-greater-multiple-made-of-two-digits,数学、枚举,https://algo.itcharge.cn/Solutions/1900-1999/smallest-greater-multiple-made-of-two-digits/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1999.%20%E6%9C%80%E5%B0%8F%E7%9A%84%E4%BB%85%E7%94%B1%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E6%88%90%E7%9A%84%E5%80%8D%E6%95%B0.md,46.8%,中等,14 -2000,2000-2099,2000. 反转单词前缀,反转单词前缀,https://leetcode.cn/problems/reverse-prefix-of-word/,reverse-prefix-of-word,双指针、字符串,https://algo.itcharge.cn/Solutions/2000-2099/reverse-prefix-of-word/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2000.%20%E5%8F%8D%E8%BD%AC%E5%8D%95%E8%AF%8D%E5%89%8D%E7%BC%80.md,77.4%,简单,479 -2001,2000-2099,2001. 可互换矩形的组数,可互换矩形的组数,https://leetcode.cn/problems/number-of-pairs-of-interchangeable-rectangles/,number-of-pairs-of-interchangeable-rectangles,数组、哈希表、数学、计数、数论,https://algo.itcharge.cn/Solutions/2000-2099/number-of-pairs-of-interchangeable-rectangles/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2001.%20%E5%8F%AF%E4%BA%92%E6%8D%A2%E7%9F%A9%E5%BD%A2%E7%9A%84%E7%BB%84%E6%95%B0.md,38.9%,中等,166 -2002,2000-2099,2002. 两个回文子序列长度的最大乘积,两个回文子序列长度的最大乘积,https://leetcode.cn/problems/maximum-product-of-the-length-of-two-palindromic-subsequences/,maximum-product-of-the-length-of-two-palindromic-subsequences,位运算、字符串、动态规划、回溯、状态压缩,https://algo.itcharge.cn/Solutions/2000-2099/maximum-product-of-the-length-of-two-palindromic-subsequences/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2002.%20%E4%B8%A4%E4%B8%AA%E5%9B%9E%E6%96%87%E5%AD%90%E5%BA%8F%E5%88%97%E9%95%BF%E5%BA%A6%E7%9A%84%E6%9C%80%E5%A4%A7%E4%B9%98%E7%A7%AF.md,60.3%,中等,123 -2003,2000-2099,2003. 每棵子树内缺失的最小基因值,每棵子树内缺失的最小基因值,https://leetcode.cn/problems/smallest-missing-genetic-value-in-each-subtree/,smallest-missing-genetic-value-in-each-subtree,树、深度优先搜索、并查集、动态规划,https://algo.itcharge.cn/Solutions/2000-2099/smallest-missing-genetic-value-in-each-subtree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2003.%20%E6%AF%8F%E6%A3%B5%E5%AD%90%E6%A0%91%E5%86%85%E7%BC%BA%E5%A4%B1%E7%9A%84%E6%9C%80%E5%B0%8F%E5%9F%BA%E5%9B%A0%E5%80%BC.md,43.0%,困难,59 -2004,2000-2099,2004. 职员招聘人数,职员招聘人数,https://leetcode.cn/problems/the-number-of-seniors-and-juniors-to-join-the-company/,the-number-of-seniors-and-juniors-to-join-the-company,数据库,https://algo.itcharge.cn/Solutions/2000-2099/the-number-of-seniors-and-juniors-to-join-the-company/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2004.%20%E8%81%8C%E5%91%98%E6%8B%9B%E8%81%98%E4%BA%BA%E6%95%B0.md,41.9%,困难,32 -2005,2000-2099,2005. 斐波那契树的移除子树游戏,斐波那契树的移除子树游戏,https://leetcode.cn/problems/subtree-removal-game-with-fibonacci-tree/,subtree-removal-game-with-fibonacci-tree,树、数学、动态规划、二叉树、博弈,https://algo.itcharge.cn/Solutions/2000-2099/subtree-removal-game-with-fibonacci-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2005.%20%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%A0%91%E7%9A%84%E7%A7%BB%E9%99%A4%E5%AD%90%E6%A0%91%E6%B8%B8%E6%88%8F.md,50.1%,困难,11 -2006,2000-2099,2006. 差的绝对值为 K 的数对数目,差的绝对值为 K 的数对数目,https://leetcode.cn/problems/count-number-of-pairs-with-absolute-difference-k/,count-number-of-pairs-with-absolute-difference-k,数组、哈希表、计数,https://algo.itcharge.cn/Solutions/2000-2099/count-number-of-pairs-with-absolute-difference-k/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2006.%20%E5%B7%AE%E7%9A%84%E7%BB%9D%E5%AF%B9%E5%80%BC%E4%B8%BA%20K%20%E7%9A%84%E6%95%B0%E5%AF%B9%E6%95%B0%E7%9B%AE.md,83.9%,简单,529 -2007,2000-2099,2007. 从双倍数组中还原原数组,从双倍数组中还原原数组,https://leetcode.cn/problems/find-original-array-from-doubled-array/,find-original-array-from-doubled-array,贪心、数组、哈希表、排序,https://algo.itcharge.cn/Solutions/2000-2099/find-original-array-from-doubled-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2007.%20%E4%BB%8E%E5%8F%8C%E5%80%8D%E6%95%B0%E7%BB%84%E4%B8%AD%E8%BF%98%E5%8E%9F%E5%8E%9F%E6%95%B0%E7%BB%84.md,33.5%,中等,126 -2008,2000-2099,2008. 出租车的最大盈利,出租车的最大盈利,https://leetcode.cn/problems/maximum-earnings-from-taxi/,maximum-earnings-from-taxi,数组、二分查找、动态规划、排序,https://algo.itcharge.cn/Solutions/2000-2099/maximum-earnings-from-taxi/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2008.%20%E5%87%BA%E7%A7%9F%E8%BD%A6%E7%9A%84%E6%9C%80%E5%A4%A7%E7%9B%88%E5%88%A9.md,46.0%,中等,104 -2009,2000-2099,2009. 使数组连续的最少操作数,使数组连续的最少操作数,https://leetcode.cn/problems/minimum-number-of-operations-to-make-array-continuous/,minimum-number-of-operations-to-make-array-continuous,数组、二分查找,https://algo.itcharge.cn/Solutions/2000-2099/minimum-number-of-operations-to-make-array-continuous/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2009.%20%E4%BD%BF%E6%95%B0%E7%BB%84%E8%BF%9E%E7%BB%AD%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%95%B0.md,43.3%,困难,76 -2010,2000-2099,2010. 职员招聘人数 II,职员招聘人数 II,https://leetcode.cn/problems/the-number-of-seniors-and-juniors-to-join-the-company-ii/,the-number-of-seniors-and-juniors-to-join-the-company-ii,数据库,https://algo.itcharge.cn/Solutions/2000-2099/the-number-of-seniors-and-juniors-to-join-the-company-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2010.%20%E8%81%8C%E5%91%98%E6%8B%9B%E8%81%98%E4%BA%BA%E6%95%B0%20II.md,61.1%,困难,45 -2011,2000-2099,2011. 执行操作后的变量值,执行操作后的变量值,https://leetcode.cn/problems/final-value-of-variable-after-performing-operations/,final-value-of-variable-after-performing-operations,数组、字符串、模拟,https://algo.itcharge.cn/Solutions/2000-2099/final-value-of-variable-after-performing-operations/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2011.%20%E6%89%A7%E8%A1%8C%E6%93%8D%E4%BD%9C%E5%90%8E%E7%9A%84%E5%8F%98%E9%87%8F%E5%80%BC.md,86.9%,简单,403 -2012,2000-2099,2012. 数组美丽值求和,数组美丽值求和,https://leetcode.cn/problems/sum-of-beauty-in-the-array/,sum-of-beauty-in-the-array,数组,https://algo.itcharge.cn/Solutions/2000-2099/sum-of-beauty-in-the-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2012.%20%E6%95%B0%E7%BB%84%E7%BE%8E%E4%B8%BD%E5%80%BC%E6%B1%82%E5%92%8C.md,38.9%,中等,104 -2013,2000-2099,2013. 检测正方形,检测正方形,https://leetcode.cn/problems/detect-squares/,detect-squares,设计、数组、哈希表、计数,https://algo.itcharge.cn/Solutions/2000-2099/detect-squares/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2013.%20%E6%A3%80%E6%B5%8B%E6%AD%A3%E6%96%B9%E5%BD%A2.md,56.6%,中等,244 -2014,2000-2099,2014. 重复 K 次的最长子序列,重复 K 次的最长子序列,https://leetcode.cn/problems/longest-subsequence-repeated-k-times/,longest-subsequence-repeated-k-times,贪心、字符串、回溯、计数、枚举,https://algo.itcharge.cn/Solutions/2000-2099/longest-subsequence-repeated-k-times/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2014.%20%E9%87%8D%E5%A4%8D%20K%20%E6%AC%A1%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E5%BA%8F%E5%88%97.md,54.6%,困难,31 -2015,2000-2099,2015. 每段建筑物的平均高度,每段建筑物的平均高度,https://leetcode.cn/problems/average-height-of-buildings-in-each-segment/,average-height-of-buildings-in-each-segment,贪心、数组、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/2000-2099/average-height-of-buildings-in-each-segment/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2015.%20%E6%AF%8F%E6%AE%B5%E5%BB%BA%E7%AD%91%E7%89%A9%E7%9A%84%E5%B9%B3%E5%9D%87%E9%AB%98%E5%BA%A6.md,57.3%,中等,16 -2016,2000-2099,2016. 增量元素之间的最大差值,增量元素之间的最大差值,https://leetcode.cn/problems/maximum-difference-between-increasing-elements/,maximum-difference-between-increasing-elements,数组,https://algo.itcharge.cn/Solutions/2000-2099/maximum-difference-between-increasing-elements/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2016.%20%E5%A2%9E%E9%87%8F%E5%85%83%E7%B4%A0%E4%B9%8B%E9%97%B4%E7%9A%84%E6%9C%80%E5%A4%A7%E5%B7%AE%E5%80%BC.md,59.7%,简单,506 -2017,2000-2099,2017. 网格游戏,网格游戏,https://leetcode.cn/problems/grid-game/,grid-game,数组、矩阵、前缀和,https://algo.itcharge.cn/Solutions/2000-2099/grid-game/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2017.%20%E7%BD%91%E6%A0%BC%E6%B8%B8%E6%88%8F.md,38.5%,中等,127 -2018,2000-2099,2018. 判断单词是否能放入填字游戏内,判断单词是否能放入填字游戏内,https://leetcode.cn/problems/check-if-word-can-be-placed-in-crossword/,check-if-word-can-be-placed-in-crossword,数组、枚举、矩阵,https://algo.itcharge.cn/Solutions/2000-2099/check-if-word-can-be-placed-in-crossword/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2018.%20%E5%88%A4%E6%96%AD%E5%8D%95%E8%AF%8D%E6%98%AF%E5%90%A6%E8%83%BD%E6%94%BE%E5%85%A5%E5%A1%AB%E5%AD%97%E6%B8%B8%E6%88%8F%E5%86%85.md,42.2%,中等,68 -2019,2000-2099,2019. 解出数学表达式的学生分数,解出数学表达式的学生分数,https://leetcode.cn/problems/the-score-of-students-solving-math-expression/,the-score-of-students-solving-math-expression,栈、记忆化搜索、数组、数学、字符串、动态规划,https://algo.itcharge.cn/Solutions/2000-2099/the-score-of-students-solving-math-expression/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2019.%20%E8%A7%A3%E5%87%BA%E6%95%B0%E5%AD%A6%E8%A1%A8%E8%BE%BE%E5%BC%8F%E7%9A%84%E5%AD%A6%E7%94%9F%E5%88%86%E6%95%B0.md,37.6%,困难,45 -2020,2000-2099,2020. 无流量的帐户数,无流量的帐户数,https://leetcode.cn/problems/number-of-accounts-that-did-not-stream/,number-of-accounts-that-did-not-stream,数据库,https://algo.itcharge.cn/Solutions/2000-2099/number-of-accounts-that-did-not-stream/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2020.%20%E6%97%A0%E6%B5%81%E9%87%8F%E7%9A%84%E5%B8%90%E6%88%B7%E6%95%B0.md,70.9%,中等,34 -2021,2000-2099,2021. 街上最亮的位置,街上最亮的位置,https://leetcode.cn/problems/brightest-position-on-street/,brightest-position-on-street,数组、有序集合、前缀和,https://algo.itcharge.cn/Solutions/2000-2099/brightest-position-on-street/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2021.%20%E8%A1%97%E4%B8%8A%E6%9C%80%E4%BA%AE%E7%9A%84%E4%BD%8D%E7%BD%AE.md,63.0%,中等,23 -2022,2000-2099,2022. 将一维数组转变成二维数组,将一维数组转变成二维数组,https://leetcode.cn/problems/convert-1d-array-into-2d-array/,convert-1d-array-into-2d-array,数组、矩阵、模拟,https://algo.itcharge.cn/Solutions/2000-2099/convert-1d-array-into-2d-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2022.%20%E5%B0%86%E4%B8%80%E7%BB%B4%E6%95%B0%E7%BB%84%E8%BD%AC%E5%8F%98%E6%88%90%E4%BA%8C%E7%BB%B4%E6%95%B0%E7%BB%84.md,65.5%,简单,483 -2023,2000-2099,2023. 连接后等于目标字符串的字符串对,连接后等于目标字符串的字符串对,https://leetcode.cn/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target/,number-of-pairs-of-strings-with-concatenation-equal-to-target,数组、字符串,https://algo.itcharge.cn/Solutions/2000-2099/number-of-pairs-of-strings-with-concatenation-equal-to-target/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2023.%20%E8%BF%9E%E6%8E%A5%E5%90%8E%E7%AD%89%E4%BA%8E%E7%9B%AE%E6%A0%87%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%AF%B9.md,74.2%,中等,103 -2024,2000-2099,2024. 考试的最大困扰度,考试的最大困扰度,https://leetcode.cn/problems/maximize-the-confusion-of-an-exam/,maximize-the-confusion-of-an-exam,字符串、二分查找、前缀和、滑动窗口,https://algo.itcharge.cn/Solutions/2000-2099/maximize-the-confusion-of-an-exam/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2024.%20%E8%80%83%E8%AF%95%E7%9A%84%E6%9C%80%E5%A4%A7%E5%9B%B0%E6%89%B0%E5%BA%A6.md,57.3%,中等,441 -2025,2000-2099,2025. 分割数组的最多方案数,分割数组的最多方案数,https://leetcode.cn/problems/maximum-number-of-ways-to-partition-an-array/,maximum-number-of-ways-to-partition-an-array,数组、哈希表、计数、枚举、前缀和,https://algo.itcharge.cn/Solutions/2000-2099/maximum-number-of-ways-to-partition-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2025.%20%E5%88%86%E5%89%B2%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%9A%E6%96%B9%E6%A1%88%E6%95%B0.md,30.4%,困难,63 -2026,2000-2099,2026. 低质量的问题,低质量的问题,https://leetcode.cn/problems/low-quality-problems/,low-quality-problems,数据库,https://algo.itcharge.cn/Solutions/2000-2099/low-quality-problems/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2026.%20%E4%BD%8E%E8%B4%A8%E9%87%8F%E7%9A%84%E9%97%AE%E9%A2%98.md,79.9%,简单,33 -2027,2000-2099,2027. 转换字符串的最少操作次数,转换字符串的最少操作次数,https://leetcode.cn/problems/minimum-moves-to-convert-string/,minimum-moves-to-convert-string,贪心、字符串,https://algo.itcharge.cn/Solutions/2000-2099/minimum-moves-to-convert-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2027.%20%E8%BD%AC%E6%8D%A2%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0.md,67.0%,简单,305 -2028,2000-2099,2028. 找出缺失的观测数据,找出缺失的观测数据,https://leetcode.cn/problems/find-missing-observations/,find-missing-observations,数组、数学、模拟,https://algo.itcharge.cn/Solutions/2000-2099/find-missing-observations/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2028.%20%E6%89%BE%E5%87%BA%E7%BC%BA%E5%A4%B1%E7%9A%84%E8%A7%82%E6%B5%8B%E6%95%B0%E6%8D%AE.md,50.7%,中等,400 -2029,2000-2099,2029. 石子游戏 IX,石子游戏 IX,https://leetcode.cn/problems/stone-game-ix/,stone-game-ix,贪心、数组、数学、计数、博弈,https://algo.itcharge.cn/Solutions/2000-2099/stone-game-ix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2029.%20%E7%9F%B3%E5%AD%90%E6%B8%B8%E6%88%8F%20IX.md,46.9%,中等,198 -2030,2000-2099,2030. 含特定字母的最小子序列,含特定字母的最小子序列,https://leetcode.cn/problems/smallest-k-length-subsequence-with-occurrences-of-a-letter/,smallest-k-length-subsequence-with-occurrences-of-a-letter,栈、贪心、字符串、单调栈,https://algo.itcharge.cn/Solutions/2000-2099/smallest-k-length-subsequence-with-occurrences-of-a-letter/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2030.%20%E5%90%AB%E7%89%B9%E5%AE%9A%E5%AD%97%E6%AF%8D%E7%9A%84%E6%9C%80%E5%B0%8F%E5%AD%90%E5%BA%8F%E5%88%97.md,36.3%,困难,53 -2031,2000-2099,2031. 1 比 0 多的子数组个数,1 比 0 多的子数组个数,https://leetcode.cn/problems/count-subarrays-with-more-ones-than-zeros/,count-subarrays-with-more-ones-than-zeros,树状数组、线段树、数组、二分查找、分治、有序集合、归并排序,https://algo.itcharge.cn/Solutions/2000-2099/count-subarrays-with-more-ones-than-zeros/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2031.%201%20%E6%AF%94%200%20%E5%A4%9A%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84%E4%B8%AA%E6%95%B0.md,55.2%,中等,22 -2032,2000-2099,2032. 至少在两个数组中出现的值,至少在两个数组中出现的值,https://leetcode.cn/problems/two-out-of-three/,two-out-of-three,数组、哈希表,https://algo.itcharge.cn/Solutions/2000-2099/two-out-of-three/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2032.%20%E8%87%B3%E5%B0%91%E5%9C%A8%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E4%B8%AD%E5%87%BA%E7%8E%B0%E7%9A%84%E5%80%BC.md,73.1%,简单,412 -2033,2000-2099,2033. 获取单值网格的最小操作数,获取单值网格的最小操作数,https://leetcode.cn/problems/minimum-operations-to-make-a-uni-value-grid/,minimum-operations-to-make-a-uni-value-grid,数组、数学、矩阵、排序,https://algo.itcharge.cn/Solutions/2000-2099/minimum-operations-to-make-a-uni-value-grid/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2033.%20%E8%8E%B7%E5%8F%96%E5%8D%95%E5%80%BC%E7%BD%91%E6%A0%BC%E7%9A%84%E6%9C%80%E5%B0%8F%E6%93%8D%E4%BD%9C%E6%95%B0.md,43.2%,中等,123 -2034,2000-2099,2034. 股票价格波动,股票价格波动,https://leetcode.cn/problems/stock-price-fluctuation/,stock-price-fluctuation,设计、哈希表、数据流、有序集合、堆（优先队列）,https://algo.itcharge.cn/Solutions/2000-2099/stock-price-fluctuation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2034.%20%E8%82%A1%E7%A5%A8%E4%BB%B7%E6%A0%BC%E6%B3%A2%E5%8A%A8.md,45.8%,中等,244 -2035,2000-2099,2035. 将数组分成两个数组并最小化数组和的差,将数组分成两个数组并最小化数组和的差,https://leetcode.cn/problems/partition-array-into-two-arrays-to-minimize-sum-difference/,partition-array-into-two-arrays-to-minimize-sum-difference,位运算、数组、双指针、二分查找、动态规划、状态压缩、有序集合,https://algo.itcharge.cn/Solutions/2000-2099/partition-array-into-two-arrays-to-minimize-sum-difference/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2035.%20%E5%B0%86%E6%95%B0%E7%BB%84%E5%88%86%E6%88%90%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E5%B9%B6%E6%9C%80%E5%B0%8F%E5%8C%96%E6%95%B0%E7%BB%84%E5%92%8C%E7%9A%84%E5%B7%AE.md,34.7%,困难,71 -2036,2000-2099,2036. 最大交替子数组和,最大交替子数组和,https://leetcode.cn/problems/maximum-alternating-subarray-sum/,maximum-alternating-subarray-sum,数组、动态规划,https://algo.itcharge.cn/Solutions/2000-2099/maximum-alternating-subarray-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2036.%20%E6%9C%80%E5%A4%A7%E4%BA%A4%E6%9B%BF%E5%AD%90%E6%95%B0%E7%BB%84%E5%92%8C.md,42.3%,中等,19 -2037,2000-2099,2037. 使每位学生都有座位的最少移动次数,使每位学生都有座位的最少移动次数,https://leetcode.cn/problems/minimum-number-of-moves-to-seat-everyone/,minimum-number-of-moves-to-seat-everyone,数组、排序,https://algo.itcharge.cn/Solutions/2000-2099/minimum-number-of-moves-to-seat-everyone/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2037.%20%E4%BD%BF%E6%AF%8F%E4%BD%8D%E5%AD%A6%E7%94%9F%E9%83%BD%E6%9C%89%E5%BA%A7%E4%BD%8D%E7%9A%84%E6%9C%80%E5%B0%91%E7%A7%BB%E5%8A%A8%E6%AC%A1%E6%95%B0.md,85.1%,简单,260 -2038,2000-2099,2038. 如果相邻两个颜色均相同则删除当前颜色,如果相邻两个颜色均相同则删除当前颜色,https://leetcode.cn/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color/,remove-colored-pieces-if-both-neighbors-are-the-same-color,贪心、数学、字符串、博弈,https://algo.itcharge.cn/Solutions/2000-2099/remove-colored-pieces-if-both-neighbors-are-the-same-color/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2038.%20%E5%A6%82%E6%9E%9C%E7%9B%B8%E9%82%BB%E4%B8%A4%E4%B8%AA%E9%A2%9C%E8%89%B2%E5%9D%87%E7%9B%B8%E5%90%8C%E5%88%99%E5%88%A0%E9%99%A4%E5%BD%93%E5%89%8D%E9%A2%9C%E8%89%B2.md,63.4%,中等,452 -2039,2000-2099,2039. 网络空闲的时刻,网络空闲的时刻,https://leetcode.cn/problems/the-time-when-the-network-becomes-idle/,the-time-when-the-network-becomes-idle,广度优先搜索、图、数组,https://algo.itcharge.cn/Solutions/2000-2099/the-time-when-the-network-becomes-idle/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2039.%20%E7%BD%91%E7%BB%9C%E7%A9%BA%E9%97%B2%E7%9A%84%E6%97%B6%E5%88%BB.md,55.9%,中等,181 -2040,2000-2099,2040. 两个有序数组的第 K 小乘积,两个有序数组的第 K 小乘积,https://leetcode.cn/problems/kth-smallest-product-of-two-sorted-arrays/,kth-smallest-product-of-two-sorted-arrays,数组、二分查找,https://algo.itcharge.cn/Solutions/2000-2099/kth-smallest-product-of-two-sorted-arrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2040.%20%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E7%9A%84%E7%AC%AC%20K%20%E5%B0%8F%E4%B9%98%E7%A7%AF.md,33.4%,困难,35 -2041,2000-2099,2041. 面试中被录取的候选人,面试中被录取的候选人,https://leetcode.cn/problems/accepted-candidates-from-the-interviews/,accepted-candidates-from-the-interviews,数据库,https://algo.itcharge.cn/Solutions/2000-2099/accepted-candidates-from-the-interviews/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2041.%20%E9%9D%A2%E8%AF%95%E4%B8%AD%E8%A2%AB%E5%BD%95%E5%8F%96%E7%9A%84%E5%80%99%E9%80%89%E4%BA%BA.md,76.3%,中等,29 -2042,2000-2099,2042. 检查句子中的数字是否递增,检查句子中的数字是否递增,https://leetcode.cn/problems/check-if-numbers-are-ascending-in-a-sentence/,check-if-numbers-are-ascending-in-a-sentence,字符串,https://algo.itcharge.cn/Solutions/2000-2099/check-if-numbers-are-ascending-in-a-sentence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2042.%20%E6%A3%80%E6%9F%A5%E5%8F%A5%E5%AD%90%E4%B8%AD%E7%9A%84%E6%95%B0%E5%AD%97%E6%98%AF%E5%90%A6%E9%80%92%E5%A2%9E.md,72.0%,简单,499 -2043,2000-2099,2043. 简易银行系统,简易银行系统,https://leetcode.cn/problems/simple-bank-system/,simple-bank-system,设计、数组、哈希表、模拟,https://algo.itcharge.cn/Solutions/2000-2099/simple-bank-system/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2043.%20%E7%AE%80%E6%98%93%E9%93%B6%E8%A1%8C%E7%B3%BB%E7%BB%9F.md,66.0%,中等,312 -2044,2000-2099,2044. 统计按位或能得到最大值的子集数目,统计按位或能得到最大值的子集数目,https://leetcode.cn/problems/count-number-of-maximum-bitwise-or-subsets/,count-number-of-maximum-bitwise-or-subsets,位运算、数组、回溯,https://algo.itcharge.cn/Solutions/2000-2099/count-number-of-maximum-bitwise-or-subsets/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2044.%20%E7%BB%9F%E8%AE%A1%E6%8C%89%E4%BD%8D%E6%88%96%E8%83%BD%E5%BE%97%E5%88%B0%E6%9C%80%E5%A4%A7%E5%80%BC%E7%9A%84%E5%AD%90%E9%9B%86%E6%95%B0%E7%9B%AE.md,81.8%,中等,400 -2045,2000-2099,2045. 到达目的地的第二短时间,到达目的地的第二短时间,https://leetcode.cn/problems/second-minimum-time-to-reach-destination/,second-minimum-time-to-reach-destination,广度优先搜索、图、最短路,https://algo.itcharge.cn/Solutions/2000-2099/second-minimum-time-to-reach-destination/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2045.%20%E5%88%B0%E8%BE%BE%E7%9B%AE%E7%9A%84%E5%9C%B0%E7%9A%84%E7%AC%AC%E4%BA%8C%E7%9F%AD%E6%97%B6%E9%97%B4.md,53.3%,困难,166 -2046,2000-2099,2046. 给按照绝对值排序的链表排序,给按照绝对值排序的链表排序,https://leetcode.cn/problems/sort-linked-list-already-sorted-using-absolute-values/,sort-linked-list-already-sorted-using-absolute-values,链表、双指针、排序,https://algo.itcharge.cn/Solutions/2000-2099/sort-linked-list-already-sorted-using-absolute-values/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2046.%20%E7%BB%99%E6%8C%89%E7%85%A7%E7%BB%9D%E5%AF%B9%E5%80%BC%E6%8E%92%E5%BA%8F%E7%9A%84%E9%93%BE%E8%A1%A8%E6%8E%92%E5%BA%8F.md,63.9%,中等,32 -2047,2000-2099,2047. 句子中的有效单词数,句子中的有效单词数,https://leetcode.cn/problems/number-of-valid-words-in-a-sentence/,number-of-valid-words-in-a-sentence,字符串,https://algo.itcharge.cn/Solutions/2000-2099/number-of-valid-words-in-a-sentence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2047.%20%E5%8F%A5%E5%AD%90%E4%B8%AD%E7%9A%84%E6%9C%89%E6%95%88%E5%8D%95%E8%AF%8D%E6%95%B0.md,38.6%,简单,434 -2048,2000-2099,2048. 下一个更大的数值平衡数,下一个更大的数值平衡数,https://leetcode.cn/problems/next-greater-numerically-balanced-number/,next-greater-numerically-balanced-number,数学、回溯、枚举,https://algo.itcharge.cn/Solutions/2000-2099/next-greater-numerically-balanced-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2048.%20%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%9B%B4%E5%A4%A7%E7%9A%84%E6%95%B0%E5%80%BC%E5%B9%B3%E8%A1%A1%E6%95%B0.md,45.4%,中等,121 -2049,2000-2099,2049. 统计最高分的节点数目,统计最高分的节点数目,https://leetcode.cn/problems/count-nodes-with-the-highest-score/,count-nodes-with-the-highest-score,树、深度优先搜索、数组、二叉树,https://algo.itcharge.cn/Solutions/2000-2099/count-nodes-with-the-highest-score/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2049.%20%E7%BB%9F%E8%AE%A1%E6%9C%80%E9%AB%98%E5%88%86%E7%9A%84%E8%8A%82%E7%82%B9%E6%95%B0%E7%9B%AE.md,51.8%,中等,315 -2050,2000-2099,2050. 并行课程 III,并行课程 III,https://leetcode.cn/problems/parallel-courses-iii/,parallel-courses-iii,图、拓扑排序、数组、动态规划,https://algo.itcharge.cn/Solutions/2000-2099/parallel-courses-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2050.%20%E5%B9%B6%E8%A1%8C%E8%AF%BE%E7%A8%8B%20III.md,58.5%,困难,108 -2051,2000-2099,2051. 商店中每个成员的级别,商店中每个成员的级别,https://leetcode.cn/problems/the-category-of-each-member-in-the-store/,the-category-of-each-member-in-the-store,数据库,https://algo.itcharge.cn/Solutions/2000-2099/the-category-of-each-member-in-the-store/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2051.%20%E5%95%86%E5%BA%97%E4%B8%AD%E6%AF%8F%E4%B8%AA%E6%88%90%E5%91%98%E7%9A%84%E7%BA%A7%E5%88%AB.md,65.2%,中等,21 -2052,2000-2099,2052. 将句子分隔成行的最低成本,将句子分隔成行的最低成本,https://leetcode.cn/problems/minimum-cost-to-separate-sentence-into-rows/,minimum-cost-to-separate-sentence-into-rows,数组、动态规划,https://algo.itcharge.cn/Solutions/2000-2099/minimum-cost-to-separate-sentence-into-rows/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2052.%20%E5%B0%86%E5%8F%A5%E5%AD%90%E5%88%86%E9%9A%94%E6%88%90%E8%A1%8C%E7%9A%84%E6%9C%80%E4%BD%8E%E6%88%90%E6%9C%AC.md,48.0%,中等,19 -2053,2000-2099,2053. 数组中第 K 个独一无二的字符串,数组中第 K 个独一无二的字符串,https://leetcode.cn/problems/kth-distinct-string-in-an-array/,kth-distinct-string-in-an-array,数组、哈希表、字符串、计数,https://algo.itcharge.cn/Solutions/2000-2099/kth-distinct-string-in-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2053.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%AC%AC%20K%20%E4%B8%AA%E7%8B%AC%E4%B8%80%E6%97%A0%E4%BA%8C%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2.md,71.1%,简单,176 -2054,2000-2099,2054. 两个最好的不重叠活动,两个最好的不重叠活动,https://leetcode.cn/problems/two-best-non-overlapping-events/,two-best-non-overlapping-events,数组、二分查找、动态规划、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/2000-2099/two-best-non-overlapping-events/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2054.%20%E4%B8%A4%E4%B8%AA%E6%9C%80%E5%A5%BD%E7%9A%84%E4%B8%8D%E9%87%8D%E5%8F%A0%E6%B4%BB%E5%8A%A8.md,38.2%,中等,91 -2055,2000-2099,2055. 蜡烛之间的盘子,蜡烛之间的盘子,https://leetcode.cn/problems/plates-between-candles/,plates-between-candles,数组、字符串、二分查找、前缀和,https://algo.itcharge.cn/Solutions/2000-2099/plates-between-candles/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2055.%20%E8%9C%A1%E7%83%9B%E4%B9%8B%E9%97%B4%E7%9A%84%E7%9B%98%E5%AD%90.md,43.4%,中等,438 -2056,2000-2099,2056. 棋盘上有效移动组合的数目,棋盘上有效移动组合的数目,https://leetcode.cn/problems/number-of-valid-move-combinations-on-chessboard/,number-of-valid-move-combinations-on-chessboard,数组、字符串、回溯、模拟,https://algo.itcharge.cn/Solutions/2000-2099/number-of-valid-move-combinations-on-chessboard/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2056.%20%E6%A3%8B%E7%9B%98%E4%B8%8A%E6%9C%89%E6%95%88%E7%A7%BB%E5%8A%A8%E7%BB%84%E5%90%88%E7%9A%84%E6%95%B0%E7%9B%AE.md,58.6%,困难,22 -2057,2000-2099,2057. 值相等的最小索引,值相等的最小索引,https://leetcode.cn/problems/smallest-index-with-equal-value/,smallest-index-with-equal-value,数组,https://algo.itcharge.cn/Solutions/2000-2099/smallest-index-with-equal-value/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2057.%20%E5%80%BC%E7%9B%B8%E7%AD%89%E7%9A%84%E6%9C%80%E5%B0%8F%E7%B4%A2%E5%BC%95.md,75.4%,简单,122 -2058,2000-2099,2058. 找出临界点之间的最小和最大距离,找出临界点之间的最小和最大距离,https://leetcode.cn/problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points/,find-the-minimum-and-maximum-number-of-nodes-between-critical-points,链表,https://algo.itcharge.cn/Solutions/2000-2099/find-the-minimum-and-maximum-number-of-nodes-between-critical-points/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2058.%20%E6%89%BE%E5%87%BA%E4%B8%B4%E7%95%8C%E7%82%B9%E4%B9%8B%E9%97%B4%E7%9A%84%E6%9C%80%E5%B0%8F%E5%92%8C%E6%9C%80%E5%A4%A7%E8%B7%9D%E7%A6%BB.md,56.4%,中等,123 -2059,2000-2099,2059. 转化数字的最小运算数,转化数字的最小运算数,https://leetcode.cn/problems/minimum-operations-to-convert-number/,minimum-operations-to-convert-number,广度优先搜索、数组,https://algo.itcharge.cn/Solutions/2000-2099/minimum-operations-to-convert-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2059.%20%E8%BD%AC%E5%8C%96%E6%95%B0%E5%AD%97%E7%9A%84%E6%9C%80%E5%B0%8F%E8%BF%90%E7%AE%97%E6%95%B0.md,48.1%,中等,123 -2060,2000-2099,2060. 同源字符串检测,同源字符串检测,https://leetcode.cn/problems/check-if-an-original-string-exists-given-two-encoded-strings/,check-if-an-original-string-exists-given-two-encoded-strings,字符串、动态规划,https://algo.itcharge.cn/Solutions/2000-2099/check-if-an-original-string-exists-given-two-encoded-strings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2060.%20%E5%90%8C%E6%BA%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%A3%80%E6%B5%8B.md,40.3%,困难,27 -2061,2000-2099,2061. 扫地机器人清扫过的空间个数,扫地机器人清扫过的空间个数,https://leetcode.cn/problems/number-of-spaces-cleaning-robot-cleaned/,number-of-spaces-cleaning-robot-cleaned,数组、矩阵、模拟,https://algo.itcharge.cn/Solutions/2000-2099/number-of-spaces-cleaning-robot-cleaned/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2061.%20%E6%89%AB%E5%9C%B0%E6%9C%BA%E5%99%A8%E4%BA%BA%E6%B8%85%E6%89%AB%E8%BF%87%E7%9A%84%E7%A9%BA%E9%97%B4%E4%B8%AA%E6%95%B0.md,50.2%,中等,26 -2062,2000-2099,2062. 统计字符串中的元音子字符串,统计字符串中的元音子字符串,https://leetcode.cn/problems/count-vowel-substrings-of-a-string/,count-vowel-substrings-of-a-string,哈希表、字符串,https://algo.itcharge.cn/Solutions/2000-2099/count-vowel-substrings-of-a-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2062.%20%E7%BB%9F%E8%AE%A1%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%85%83%E9%9F%B3%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md,62.8%,简单,157 -2063,2000-2099,2063. 所有子字符串中的元音,所有子字符串中的元音,https://leetcode.cn/problems/vowels-of-all-substrings/,vowels-of-all-substrings,数学、字符串、动态规划、组合数学,https://algo.itcharge.cn/Solutions/2000-2099/vowels-of-all-substrings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2063.%20%E6%89%80%E6%9C%89%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%85%83%E9%9F%B3.md,51.6%,中等,137 -2064,2000-2099,2064. 分配给商店的最多商品的最小值,分配给商店的最多商品的最小值,https://leetcode.cn/problems/minimized-maximum-of-products-distributed-to-any-store/,minimized-maximum-of-products-distributed-to-any-store,数组、二分查找,https://algo.itcharge.cn/Solutions/2000-2099/minimized-maximum-of-products-distributed-to-any-store/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2064.%20%E5%88%86%E9%85%8D%E7%BB%99%E5%95%86%E5%BA%97%E7%9A%84%E6%9C%80%E5%A4%9A%E5%95%86%E5%93%81%E7%9A%84%E6%9C%80%E5%B0%8F%E5%80%BC.md,45.0%,中等,106 -2065,2000-2099,2065. 最大化一张图中的路径价值,最大化一张图中的路径价值,https://leetcode.cn/problems/maximum-path-quality-of-a-graph/,maximum-path-quality-of-a-graph,图、数组、回溯,https://algo.itcharge.cn/Solutions/2000-2099/maximum-path-quality-of-a-graph/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2065.%20%E6%9C%80%E5%A4%A7%E5%8C%96%E4%B8%80%E5%BC%A0%E5%9B%BE%E4%B8%AD%E7%9A%84%E8%B7%AF%E5%BE%84%E4%BB%B7%E5%80%BC.md,54.2%,困难,68 -2066,2000-2099,2066. 账户余额,账户余额,https://leetcode.cn/problems/account-balance/,account-balance,数据库,https://algo.itcharge.cn/Solutions/2000-2099/account-balance/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2066.%20%E8%B4%A6%E6%88%B7%E4%BD%99%E9%A2%9D.md,78.7%,中等,28 -2067,2000-2099,2067. 等计数子串的数量,等计数子串的数量,https://leetcode.cn/problems/number-of-equal-count-substrings/,number-of-equal-count-substrings,字符串、计数、前缀和,https://algo.itcharge.cn/Solutions/2000-2099/number-of-equal-count-substrings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2067.%20%E7%AD%89%E8%AE%A1%E6%95%B0%E5%AD%90%E4%B8%B2%E7%9A%84%E6%95%B0%E9%87%8F.md,54.5%,中等,12 -2068,2000-2099,2068. 检查两个字符串是否几乎相等,检查两个字符串是否几乎相等,https://leetcode.cn/problems/check-whether-two-strings-are-almost-equivalent/,check-whether-two-strings-are-almost-equivalent,哈希表、字符串、计数,https://algo.itcharge.cn/Solutions/2000-2099/check-whether-two-strings-are-almost-equivalent/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2068.%20%E6%A3%80%E6%9F%A5%E4%B8%A4%E4%B8%AA%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%98%AF%E5%90%A6%E5%87%A0%E4%B9%8E%E7%9B%B8%E7%AD%89.md,70.0%,简单,156 -2069,2000-2099,2069. 模拟行走机器人 II,模拟行走机器人 II,https://leetcode.cn/problems/walking-robot-simulation-ii/,walking-robot-simulation-ii,设计、模拟,https://algo.itcharge.cn/Solutions/2000-2099/walking-robot-simulation-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2069.%20%E6%A8%A1%E6%8B%9F%E8%A1%8C%E8%B5%B0%E6%9C%BA%E5%99%A8%E4%BA%BA%20II.md,22.1%,中等,113 -2070,2000-2099,2070. 每一个查询的最大美丽值,每一个查询的最大美丽值,https://leetcode.cn/problems/most-beautiful-item-for-each-query/,most-beautiful-item-for-each-query,数组、二分查找、排序,https://algo.itcharge.cn/Solutions/2000-2099/most-beautiful-item-for-each-query/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2070.%20%E6%AF%8F%E4%B8%80%E4%B8%AA%E6%9F%A5%E8%AF%A2%E7%9A%84%E6%9C%80%E5%A4%A7%E7%BE%8E%E4%B8%BD%E5%80%BC.md,45.1%,中等,117 -2071,2000-2099,2071. 你可以安排的最多任务数目,你可以安排的最多任务数目,https://leetcode.cn/problems/maximum-number-of-tasks-you-can-assign/,maximum-number-of-tasks-you-can-assign,贪心、队列、数组、二分查找、排序、单调队列,https://algo.itcharge.cn/Solutions/2000-2099/maximum-number-of-tasks-you-can-assign/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2071.%20%E4%BD%A0%E5%8F%AF%E4%BB%A5%E5%AE%89%E6%8E%92%E7%9A%84%E6%9C%80%E5%A4%9A%E4%BB%BB%E5%8A%A1%E6%95%B0%E7%9B%AE.md,29.9%,困难,51 -2072,2000-2099,2072. 赢得比赛的大学,赢得比赛的大学,https://leetcode.cn/problems/the-winner-university/,the-winner-university,数据库,https://algo.itcharge.cn/Solutions/2000-2099/the-winner-university/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2072.%20%E8%B5%A2%E5%BE%97%E6%AF%94%E8%B5%9B%E7%9A%84%E5%A4%A7%E5%AD%A6.md,68.9%,简单,31 -2073,2000-2099,2073. 买票需要的时间,买票需要的时间,https://leetcode.cn/problems/time-needed-to-buy-tickets/,time-needed-to-buy-tickets,队列、数组、模拟,https://algo.itcharge.cn/Solutions/2000-2099/time-needed-to-buy-tickets/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2073.%20%E4%B9%B0%E7%A5%A8%E9%9C%80%E8%A6%81%E7%9A%84%E6%97%B6%E9%97%B4.md,61.7%,简单,220 -2074,2000-2099,2074. 反转偶数长度组的节点,反转偶数长度组的节点,https://leetcode.cn/problems/reverse-nodes-in-even-length-groups/,reverse-nodes-in-even-length-groups,链表,https://algo.itcharge.cn/Solutions/2000-2099/reverse-nodes-in-even-length-groups/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2074.%20%E5%8F%8D%E8%BD%AC%E5%81%B6%E6%95%B0%E9%95%BF%E5%BA%A6%E7%BB%84%E7%9A%84%E8%8A%82%E7%82%B9.md,45.7%,中等,158 -2075,2000-2099,2075. 解码斜向换位密码,解码斜向换位密码,https://leetcode.cn/problems/decode-the-slanted-ciphertext/,decode-the-slanted-ciphertext,字符串、模拟,https://algo.itcharge.cn/Solutions/2000-2099/decode-the-slanted-ciphertext/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2075.%20%E8%A7%A3%E7%A0%81%E6%96%9C%E5%90%91%E6%8D%A2%E4%BD%8D%E5%AF%86%E7%A0%81.md,46.9%,中等,86 -2076,2000-2099,2076. 处理含限制条件的好友请求,处理含限制条件的好友请求,https://leetcode.cn/problems/process-restricted-friend-requests/,process-restricted-friend-requests,并查集、图,https://algo.itcharge.cn/Solutions/2000-2099/process-restricted-friend-requests/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2076.%20%E5%A4%84%E7%90%86%E5%90%AB%E9%99%90%E5%88%B6%E6%9D%A1%E4%BB%B6%E7%9A%84%E5%A5%BD%E5%8F%8B%E8%AF%B7%E6%B1%82.md,51.0%,困难,89 -2077,2000-2099,2077. 殊途同归,殊途同归,https://leetcode.cn/problems/paths-in-maze-that-lead-to-same-room/,paths-in-maze-that-lead-to-same-room,图,https://algo.itcharge.cn/Solutions/2000-2099/paths-in-maze-that-lead-to-same-room/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2077.%20%E6%AE%8A%E9%80%94%E5%90%8C%E5%BD%92.md,62.9%,中等,9 -2078,2000-2099,2078. 两栋颜色不同且距离最远的房子,两栋颜色不同且距离最远的房子,https://leetcode.cn/problems/two-furthest-houses-with-different-colors/,two-furthest-houses-with-different-colors,贪心、数组,https://algo.itcharge.cn/Solutions/2000-2099/two-furthest-houses-with-different-colors/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2078.%20%E4%B8%A4%E6%A0%8B%E9%A2%9C%E8%89%B2%E4%B8%8D%E5%90%8C%E4%B8%94%E8%B7%9D%E7%A6%BB%E6%9C%80%E8%BF%9C%E7%9A%84%E6%88%BF%E5%AD%90.md,72.3%,简单,208 -2079,2000-2099,2079. 给植物浇水,给植物浇水,https://leetcode.cn/problems/watering-plants/,watering-plants,数组,https://algo.itcharge.cn/Solutions/2000-2099/watering-plants/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2079.%20%E7%BB%99%E6%A4%8D%E7%89%A9%E6%B5%87%E6%B0%B4.md,77.7%,中等,161 -2080,2000-2099,2080. 区间内查询数字的频率,区间内查询数字的频率,https://leetcode.cn/problems/range-frequency-queries/,range-frequency-queries,设计、线段树、数组、哈希表、二分查找,https://algo.itcharge.cn/Solutions/2000-2099/range-frequency-queries/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2080.%20%E5%8C%BA%E9%97%B4%E5%86%85%E6%9F%A5%E8%AF%A2%E6%95%B0%E5%AD%97%E7%9A%84%E9%A2%91%E7%8E%87.md,31.4%,中等,179 -2081,2000-2099,2081. k 镜像数字的和,k 镜像数字的和,https://leetcode.cn/problems/sum-of-k-mirror-numbers/,sum-of-k-mirror-numbers,数学、枚举,https://algo.itcharge.cn/Solutions/2000-2099/sum-of-k-mirror-numbers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2081.%20k%20%E9%95%9C%E5%83%8F%E6%95%B0%E5%AD%97%E7%9A%84%E5%92%8C.md,43.5%,困难,84 -2082,2000-2099,2082. 富有客户的数量,富有客户的数量,https://leetcode.cn/problems/the-number-of-rich-customers/,the-number-of-rich-customers,数据库,https://algo.itcharge.cn/Solutions/2000-2099/the-number-of-rich-customers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2082.%20%E5%AF%8C%E6%9C%89%E5%AE%A2%E6%88%B7%E7%9A%84%E6%95%B0%E9%87%8F.md,74.1%,简单,25 -2083,2000-2099,2083. 求以相同字母开头和结尾的子串总数,求以相同字母开头和结尾的子串总数,https://leetcode.cn/problems/substrings-that-begin-and-end-with-the-same-letter/,substrings-that-begin-and-end-with-the-same-letter,哈希表、数学、字符串、计数、前缀和,https://algo.itcharge.cn/Solutions/2000-2099/substrings-that-begin-and-end-with-the-same-letter/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2083.%20%E6%B1%82%E4%BB%A5%E7%9B%B8%E5%90%8C%E5%AD%97%E6%AF%8D%E5%BC%80%E5%A4%B4%E5%92%8C%E7%BB%93%E5%B0%BE%E7%9A%84%E5%AD%90%E4%B8%B2%E6%80%BB%E6%95%B0.md,60.9%,中等,16 -2084,2000-2099,2084. 为订单类型为 0 的客户删除类型为 1 的订单,为订单类型为 0 的客户删除类型为 1 的订单,https://leetcode.cn/problems/drop-type-1-orders-for-customers-with-type-0-orders/,drop-type-1-orders-for-customers-with-type-0-orders,数据库,https://algo.itcharge.cn/Solutions/2000-2099/drop-type-1-orders-for-customers-with-type-0-orders/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2084.%20%E4%B8%BA%E8%AE%A2%E5%8D%95%E7%B1%BB%E5%9E%8B%E4%B8%BA%200%20%E7%9A%84%E5%AE%A2%E6%88%B7%E5%88%A0%E9%99%A4%E7%B1%BB%E5%9E%8B%E4%B8%BA%201%20%E7%9A%84%E8%AE%A2%E5%8D%95.md,82.4%,中等,40 -2085,2000-2099,2085. 统计出现过一次的公共字符串,统计出现过一次的公共字符串,https://leetcode.cn/problems/count-common-words-with-one-occurrence/,count-common-words-with-one-occurrence,数组、哈希表、字符串、计数,https://algo.itcharge.cn/Solutions/2000-2099/count-common-words-with-one-occurrence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2085.%20%E7%BB%9F%E8%AE%A1%E5%87%BA%E7%8E%B0%E8%BF%87%E4%B8%80%E6%AC%A1%E7%9A%84%E5%85%AC%E5%85%B1%E5%AD%97%E7%AC%A6%E4%B8%B2.md,71.4%,简单,143 -2086,2000-2099,2086. 从房屋收集雨水需要的最少水桶数,从房屋收集雨水需要的最少水桶数,https://leetcode.cn/problems/minimum-number-of-food-buckets-to-feed-the-hamsters/,minimum-number-of-food-buckets-to-feed-the-hamsters,贪心、字符串、动态规划,https://algo.itcharge.cn/Solutions/2000-2099/minimum-number-of-food-buckets-to-feed-the-hamsters/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2086.%20%E4%BB%8E%E6%88%BF%E5%B1%8B%E6%94%B6%E9%9B%86%E9%9B%A8%E6%B0%B4%E9%9C%80%E8%A6%81%E7%9A%84%E6%9C%80%E5%B0%91%E6%B0%B4%E6%A1%B6%E6%95%B0.md,46.7%,中等,110 -2087,2000-2099,2087. 网格图中机器人回家的最小代价,网格图中机器人回家的最小代价,https://leetcode.cn/problems/minimum-cost-homecoming-of-a-robot-in-a-grid/,minimum-cost-homecoming-of-a-robot-in-a-grid,贪心、数组、矩阵,https://algo.itcharge.cn/Solutions/2000-2099/minimum-cost-homecoming-of-a-robot-in-a-grid/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2087.%20%E7%BD%91%E6%A0%BC%E5%9B%BE%E4%B8%AD%E6%9C%BA%E5%99%A8%E4%BA%BA%E5%9B%9E%E5%AE%B6%E7%9A%84%E6%9C%80%E5%B0%8F%E4%BB%A3%E4%BB%B7.md,50.1%,中等,88 -2088,2000-2099,2088. 统计农场中肥沃金字塔的数目,统计农场中肥沃金字塔的数目,https://leetcode.cn/problems/count-fertile-pyramids-in-a-land/,count-fertile-pyramids-in-a-land,数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/2000-2099/count-fertile-pyramids-in-a-land/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2088.%20%E7%BB%9F%E8%AE%A1%E5%86%9C%E5%9C%BA%E4%B8%AD%E8%82%A5%E6%B2%83%E9%87%91%E5%AD%97%E5%A1%94%E7%9A%84%E6%95%B0%E7%9B%AE.md,63.4%,困难,57 -2089,2000-2099,2089. 找出数组排序后的目标下标,找出数组排序后的目标下标,https://leetcode.cn/problems/find-target-indices-after-sorting-array/,find-target-indices-after-sorting-array,数组、二分查找、排序,https://algo.itcharge.cn/Solutions/2000-2099/find-target-indices-after-sorting-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2089.%20%E6%89%BE%E5%87%BA%E6%95%B0%E7%BB%84%E6%8E%92%E5%BA%8F%E5%90%8E%E7%9A%84%E7%9B%AE%E6%A0%87%E4%B8%8B%E6%A0%87.md,78.6%,简单,241 -2090,2000-2099,2090. 半径为 k 的子数组平均值,半径为 k 的子数组平均值,https://leetcode.cn/problems/k-radius-subarray-averages/,k-radius-subarray-averages,数组、滑动窗口,https://algo.itcharge.cn/Solutions/2000-2099/k-radius-subarray-averages/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2090.%20%E5%8D%8A%E5%BE%84%E4%B8%BA%20k%20%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84%E5%B9%B3%E5%9D%87%E5%80%BC.md,37.5%,中等,120 -2091,2000-2099,2091. 从数组中移除最大值和最小值,从数组中移除最大值和最小值,https://leetcode.cn/problems/removing-minimum-and-maximum-from-array/,removing-minimum-and-maximum-from-array,贪心、数组,https://algo.itcharge.cn/Solutions/2000-2099/removing-minimum-and-maximum-from-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2091.%20%E4%BB%8E%E6%95%B0%E7%BB%84%E4%B8%AD%E7%A7%BB%E9%99%A4%E6%9C%80%E5%A4%A7%E5%80%BC%E5%92%8C%E6%9C%80%E5%B0%8F%E5%80%BC.md,56.6%,中等,150 -2092,2000-2099,2092. 找出知晓秘密的所有专家,找出知晓秘密的所有专家,https://leetcode.cn/problems/find-all-people-with-secret/,find-all-people-with-secret,深度优先搜索、广度优先搜索、并查集、图、排序,https://algo.itcharge.cn/Solutions/2000-2099/find-all-people-with-secret/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2092.%20%E6%89%BE%E5%87%BA%E7%9F%A5%E6%99%93%E7%A7%98%E5%AF%86%E7%9A%84%E6%89%80%E6%9C%89%E4%B8%93%E5%AE%B6.md,29.1%,困难,131 -2093,2000-2099,2093. 前往目标城市的最小费用,前往目标城市的最小费用,https://leetcode.cn/problems/minimum-cost-to-reach-city-with-discounts/,minimum-cost-to-reach-city-with-discounts,图、最短路,https://algo.itcharge.cn/Solutions/2000-2099/minimum-cost-to-reach-city-with-discounts/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2093.%20%E5%89%8D%E5%BE%80%E7%9B%AE%E6%A0%87%E5%9F%8E%E5%B8%82%E7%9A%84%E6%9C%80%E5%B0%8F%E8%B4%B9%E7%94%A8.md,58.9%,中等,20 -2094,2000-2099,2094. 找出 3 位偶数,找出 3 位偶数,https://leetcode.cn/problems/finding-3-digit-even-numbers/,finding-3-digit-even-numbers,数组、哈希表、枚举、排序,https://algo.itcharge.cn/Solutions/2000-2099/finding-3-digit-even-numbers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2094.%20%E6%89%BE%E5%87%BA%203%20%E4%BD%8D%E5%81%B6%E6%95%B0.md,55.8%,简单,188 -2095,2000-2099,2095. 删除链表的中间节点,删除链表的中间节点,https://leetcode.cn/problems/delete-the-middle-node-of-a-linked-list/,delete-the-middle-node-of-a-linked-list,链表、双指针,https://algo.itcharge.cn/Solutions/2000-2099/delete-the-middle-node-of-a-linked-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2095.%20%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E7%9A%84%E4%B8%AD%E9%97%B4%E8%8A%82%E7%82%B9.md,57.5%,中等,222 -2096,2000-2099,2096. 从二叉树一个节点到另一个节点每一步的方向,从二叉树一个节点到另一个节点每一步的方向,https://leetcode.cn/problems/step-by-step-directions-from-a-binary-tree-node-to-another/,step-by-step-directions-from-a-binary-tree-node-to-another,树、深度优先搜索、字符串、二叉树,https://algo.itcharge.cn/Solutions/2000-2099/step-by-step-directions-from-a-binary-tree-node-to-another/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2096.%20%E4%BB%8E%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%80%E4%B8%AA%E8%8A%82%E7%82%B9%E5%88%B0%E5%8F%A6%E4%B8%80%E4%B8%AA%E8%8A%82%E7%82%B9%E6%AF%8F%E4%B8%80%E6%AD%A5%E7%9A%84%E6%96%B9%E5%90%91.md,44.6%,中等,210 -2097,2000-2099,2097. 合法重新排列数对,合法重新排列数对,https://leetcode.cn/problems/valid-arrangement-of-pairs/,valid-arrangement-of-pairs,深度优先搜索、图、欧拉回路,https://algo.itcharge.cn/Solutions/2000-2099/valid-arrangement-of-pairs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2097.%20%E5%90%88%E6%B3%95%E9%87%8D%E6%96%B0%E6%8E%92%E5%88%97%E6%95%B0%E5%AF%B9.md,38.0%,困难,56 -2098,2000-2099,2098. 长度为 K 的最大偶数和子序列,长度为 K 的最大偶数和子序列,https://leetcode.cn/problems/subsequence-of-size-k-with-the-largest-even-sum/,subsequence-of-size-k-with-the-largest-even-sum,贪心、数组、排序,https://algo.itcharge.cn/Solutions/2000-2099/subsequence-of-size-k-with-the-largest-even-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2098.%20%E9%95%BF%E5%BA%A6%E4%B8%BA%20K%20%E7%9A%84%E6%9C%80%E5%A4%A7%E5%81%B6%E6%95%B0%E5%92%8C%E5%AD%90%E5%BA%8F%E5%88%97.md,35.0%,中等,11 -2099,2000-2099,2099. 找到和最大的长度为 K 的子序列,找到和最大的长度为 K 的子序列,https://leetcode.cn/problems/find-subsequence-of-length-k-with-the-largest-sum/,find-subsequence-of-length-k-with-the-largest-sum,数组、哈希表、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/2000-2099/find-subsequence-of-length-k-with-the-largest-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2099.%20%E6%89%BE%E5%88%B0%E5%92%8C%E6%9C%80%E5%A4%A7%E7%9A%84%E9%95%BF%E5%BA%A6%E4%B8%BA%20K%20%E7%9A%84%E5%AD%90%E5%BA%8F%E5%88%97.md,48.5%,简单,189 -2100,2100-2199,2100. 适合打劫银行的日子,适合打劫银行的日子,https://leetcode.cn/problems/find-good-days-to-rob-the-bank/,find-good-days-to-rob-the-bank,数组、动态规划、前缀和,https://algo.itcharge.cn/Solutions/2100-2199/find-good-days-to-rob-the-bank/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2100.%20%E9%80%82%E5%90%88%E6%89%93%E5%8A%AB%E9%93%B6%E8%A1%8C%E7%9A%84%E6%97%A5%E5%AD%90.md,48.7%,中等,433 -2101,2100-2199,2101. 引爆最多的炸弹,引爆最多的炸弹,https://leetcode.cn/problems/detonate-the-maximum-bombs/,detonate-the-maximum-bombs,深度优先搜索、广度优先搜索、图、几何、数组、数学,https://algo.itcharge.cn/Solutions/2100-2199/detonate-the-maximum-bombs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2101.%20%E5%BC%95%E7%88%86%E6%9C%80%E5%A4%9A%E7%9A%84%E7%82%B8%E5%BC%B9.md,39.7%,中等,104 -2102,2100-2199,2102. 序列顺序查询,序列顺序查询,https://leetcode.cn/problems/sequentially-ordinal-rank-tracker/,sequentially-ordinal-rank-tracker,设计、数据流、有序集合、堆（优先队列）,https://algo.itcharge.cn/Solutions/2100-2199/sequentially-ordinal-rank-tracker/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2102.%20%E5%BA%8F%E5%88%97%E9%A1%BA%E5%BA%8F%E6%9F%A5%E8%AF%A2.md,55.9%,困难,87 -2103,2100-2199,2103. 环和杆,环和杆,https://leetcode.cn/problems/rings-and-rods/,rings-and-rods,哈希表、字符串,https://algo.itcharge.cn/Solutions/2100-2199/rings-and-rods/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2103.%20%E7%8E%AF%E5%92%8C%E6%9D%86.md,79.7%,简单,198 -2104,2100-2199,2104. 子数组范围和,子数组范围和,https://leetcode.cn/problems/sum-of-subarray-ranges/,sum-of-subarray-ranges,栈、数组、单调栈,https://algo.itcharge.cn/Solutions/2100-2199/sum-of-subarray-ranges/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2104.%20%E5%AD%90%E6%95%B0%E7%BB%84%E8%8C%83%E5%9B%B4%E5%92%8C.md,62.9%,中等,403 -2105,2100-2199,2105. 给植物浇水 II,给植物浇水 II,https://leetcode.cn/problems/watering-plants-ii/,watering-plants-ii,数组、双指针、模拟,https://algo.itcharge.cn/Solutions/2100-2199/watering-plants-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2105.%20%E7%BB%99%E6%A4%8D%E7%89%A9%E6%B5%87%E6%B0%B4%20II.md,53.0%,中等,143 -2106,2100-2199,2106. 摘水果,摘水果,https://leetcode.cn/problems/maximum-fruits-harvested-after-at-most-k-steps/,maximum-fruits-harvested-after-at-most-k-steps,数组、二分查找、前缀和、滑动窗口,https://algo.itcharge.cn/Solutions/2100-2199/maximum-fruits-harvested-after-at-most-k-steps/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2106.%20%E6%91%98%E6%B0%B4%E6%9E%9C.md,45.1%,困难,202 -2107,2100-2199,2107. 分享 K 个糖果后独特口味的数量,分享 K 个糖果后独特口味的数量,https://leetcode.cn/problems/number-of-unique-flavors-after-sharing-k-candies/,number-of-unique-flavors-after-sharing-k-candies,数组、哈希表、滑动窗口,https://algo.itcharge.cn/Solutions/2100-2199/number-of-unique-flavors-after-sharing-k-candies/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2107.%20%E5%88%86%E4%BA%AB%20K%20%E4%B8%AA%E7%B3%96%E6%9E%9C%E5%90%8E%E7%8B%AC%E7%89%B9%E5%8F%A3%E5%91%B3%E7%9A%84%E6%95%B0%E9%87%8F.md,38.6%,中等,14 -2108,2100-2199,2108. 找出数组中的第一个回文字符串,找出数组中的第一个回文字符串,https://leetcode.cn/problems/find-first-palindromic-string-in-the-array/,find-first-palindromic-string-in-the-array,数组、双指针、字符串,https://algo.itcharge.cn/Solutions/2100-2199/find-first-palindromic-string-in-the-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2108.%20%E6%89%BE%E5%87%BA%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%9B%9E%E6%96%87%E5%AD%97%E7%AC%A6%E4%B8%B2.md,77.5%,简单,210 -2109,2100-2199,2109. 向字符串添加空格,向字符串添加空格,https://leetcode.cn/problems/adding-spaces-to-a-string/,adding-spaces-to-a-string,数组、字符串、模拟,https://algo.itcharge.cn/Solutions/2100-2199/adding-spaces-to-a-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2109.%20%E5%90%91%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%B7%BB%E5%8A%A0%E7%A9%BA%E6%A0%BC.md,61.5%,中等,121 -2110,2100-2199,2110. 股票平滑下跌阶段的数目,股票平滑下跌阶段的数目,https://leetcode.cn/problems/number-of-smooth-descent-periods-of-a-stock/,number-of-smooth-descent-periods-of-a-stock,数组、数学、动态规划,https://algo.itcharge.cn/Solutions/2100-2199/number-of-smooth-descent-periods-of-a-stock/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2110.%20%E8%82%A1%E7%A5%A8%E5%B9%B3%E6%BB%91%E4%B8%8B%E8%B7%8C%E9%98%B6%E6%AE%B5%E7%9A%84%E6%95%B0%E7%9B%AE.md,52.8%,中等,163 -2111,2100-2199,2111. 使数组 K 递增的最少操作次数,使数组 K 递增的最少操作次数,https://leetcode.cn/problems/minimum-operations-to-make-the-array-k-increasing/,minimum-operations-to-make-the-array-k-increasing,数组、二分查找,https://algo.itcharge.cn/Solutions/2100-2199/minimum-operations-to-make-the-array-k-increasing/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2111.%20%E4%BD%BF%E6%95%B0%E7%BB%84%20K%20%E9%80%92%E5%A2%9E%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0.md,35.0%,困难,97 -2112,2100-2199,2112. 最繁忙的机场,最繁忙的机场,https://leetcode.cn/problems/the-airport-with-the-most-traffic/,the-airport-with-the-most-traffic,数据库,https://algo.itcharge.cn/Solutions/2100-2199/the-airport-with-the-most-traffic/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2112.%20%E6%9C%80%E7%B9%81%E5%BF%99%E7%9A%84%E6%9C%BA%E5%9C%BA.md,68.3%,中等,22 -2113,2100-2199,2113. 查询删除和添加元素后的数组,查询删除和添加元素后的数组,https://leetcode.cn/problems/elements-in-array-after-removing-and-replacing-elements/,elements-in-array-after-removing-and-replacing-elements,数组,https://algo.itcharge.cn/Solutions/2100-2199/elements-in-array-after-removing-and-replacing-elements/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2113.%20%E6%9F%A5%E8%AF%A2%E5%88%A0%E9%99%A4%E5%92%8C%E6%B7%BB%E5%8A%A0%E5%85%83%E7%B4%A0%E5%90%8E%E7%9A%84%E6%95%B0%E7%BB%84.md,61.6%,中等,13 -2114,2100-2199,2114. 句子中的最多单词数,句子中的最多单词数,https://leetcode.cn/problems/maximum-number-of-words-found-in-sentences/,maximum-number-of-words-found-in-sentences,数组、字符串,https://algo.itcharge.cn/Solutions/2100-2199/maximum-number-of-words-found-in-sentences/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2114.%20%E5%8F%A5%E5%AD%90%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%9A%E5%8D%95%E8%AF%8D%E6%95%B0.md,85.0%,简单,249 -2115,2100-2199,2115. 从给定原材料中找到所有可以做出的菜,从给定原材料中找到所有可以做出的菜,https://leetcode.cn/problems/find-all-possible-recipes-from-given-supplies/,find-all-possible-recipes-from-given-supplies,图、拓扑排序、数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/2100-2199/find-all-possible-recipes-from-given-supplies/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2115.%20%E4%BB%8E%E7%BB%99%E5%AE%9A%E5%8E%9F%E6%9D%90%E6%96%99%E4%B8%AD%E6%89%BE%E5%88%B0%E6%89%80%E6%9C%89%E5%8F%AF%E4%BB%A5%E5%81%9A%E5%87%BA%E7%9A%84%E8%8F%9C.md,42.4%,中等,120 -2116,2100-2199,2116. 判断一个括号字符串是否有效,判断一个括号字符串是否有效,https://leetcode.cn/problems/check-if-a-parentheses-string-can-be-valid/,check-if-a-parentheses-string-can-be-valid,栈、贪心、字符串,https://algo.itcharge.cn/Solutions/2100-2199/check-if-a-parentheses-string-can-be-valid/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2116.%20%E5%88%A4%E6%96%AD%E4%B8%80%E4%B8%AA%E6%8B%AC%E5%8F%B7%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%98%AF%E5%90%A6%E6%9C%89%E6%95%88.md,32.0%,中等,75 -2117,2100-2199,2117. 一个区间内所有数乘积的缩写,一个区间内所有数乘积的缩写,https://leetcode.cn/problems/abbreviating-the-product-of-a-range/,abbreviating-the-product-of-a-range,数学,https://algo.itcharge.cn/Solutions/2100-2199/abbreviating-the-product-of-a-range/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2117.%20%E4%B8%80%E4%B8%AA%E5%8C%BA%E9%97%B4%E5%86%85%E6%89%80%E6%9C%89%E6%95%B0%E4%B9%98%E7%A7%AF%E7%9A%84%E7%BC%A9%E5%86%99.md,30.8%,困难,27 -2118,2100-2199,2118. 建立方程,建立方程,https://leetcode.cn/problems/build-the-equation/,build-the-equation,数据库,https://algo.itcharge.cn/Solutions/2100-2199/build-the-equation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2118.%20%E5%BB%BA%E7%AB%8B%E6%96%B9%E7%A8%8B.md,54.6%,困难,15 -2119,2100-2199,2119. 反转两次的数字,反转两次的数字,https://leetcode.cn/problems/a-number-after-a-double-reversal/,a-number-after-a-double-reversal,数学,https://algo.itcharge.cn/Solutions/2100-2199/a-number-after-a-double-reversal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2119.%20%E5%8F%8D%E8%BD%AC%E4%B8%A4%E6%AC%A1%E7%9A%84%E6%95%B0%E5%AD%97.md,73.7%,简单,194 -2120,2100-2199,2120. 执行所有后缀指令,执行所有后缀指令,https://leetcode.cn/problems/execution-of-all-suffix-instructions-staying-in-a-grid/,execution-of-all-suffix-instructions-staying-in-a-grid,字符串、模拟,https://algo.itcharge.cn/Solutions/2100-2199/execution-of-all-suffix-instructions-staying-in-a-grid/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2120.%20%E6%89%A7%E8%A1%8C%E6%89%80%E6%9C%89%E5%90%8E%E7%BC%80%E6%8C%87%E4%BB%A4.md,82.5%,中等,124 -2121,2100-2199,2121. 相同元素的间隔之和,相同元素的间隔之和,https://leetcode.cn/problems/intervals-between-identical-elements/,intervals-between-identical-elements,数组、哈希表、前缀和,https://algo.itcharge.cn/Solutions/2100-2199/intervals-between-identical-elements/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2121.%20%E7%9B%B8%E5%90%8C%E5%85%83%E7%B4%A0%E7%9A%84%E9%97%B4%E9%9A%94%E4%B9%8B%E5%92%8C.md,38.6%,中等,163 -2122,2100-2199,2122. 还原原数组,还原原数组,https://leetcode.cn/problems/recover-the-original-array/,recover-the-original-array,数组、哈希表、枚举、排序,https://algo.itcharge.cn/Solutions/2100-2199/recover-the-original-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2122.%20%E8%BF%98%E5%8E%9F%E5%8E%9F%E6%95%B0%E7%BB%84.md,42.0%,困难,69 -2123,2100-2199,2123. 使矩阵中的 1 互不相邻的最小操作数,使矩阵中的 1 互不相邻的最小操作数,https://leetcode.cn/problems/minimum-operations-to-remove-adjacent-ones-in-matrix/,minimum-operations-to-remove-adjacent-ones-in-matrix,图、数组、矩阵,https://algo.itcharge.cn/Solutions/2100-2199/minimum-operations-to-remove-adjacent-ones-in-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2123.%20%E4%BD%BF%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%201%20%E4%BA%92%E4%B8%8D%E7%9B%B8%E9%82%BB%E7%9A%84%E6%9C%80%E5%B0%8F%E6%93%8D%E4%BD%9C%E6%95%B0.md,53.0%,困难,6 -2124,2100-2199,2124. 检查是否所有 A 都在 B 之前,检查是否所有 A 都在 B 之前,https://leetcode.cn/problems/check-if-all-as-appears-before-all-bs/,check-if-all-as-appears-before-all-bs,字符串,https://algo.itcharge.cn/Solutions/2100-2199/check-if-all-as-appears-before-all-bs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2124.%20%E6%A3%80%E6%9F%A5%E6%98%AF%E5%90%A6%E6%89%80%E6%9C%89%20A%20%E9%83%BD%E5%9C%A8%20B%20%E4%B9%8B%E5%89%8D.md,69.4%,简单,213 -2125,2100-2199,2125. 银行中的激光束数量,银行中的激光束数量,https://leetcode.cn/problems/number-of-laser-beams-in-a-bank/,number-of-laser-beams-in-a-bank,数组、数学、字符串、矩阵,https://algo.itcharge.cn/Solutions/2100-2199/number-of-laser-beams-in-a-bank/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2125.%20%E9%93%B6%E8%A1%8C%E4%B8%AD%E7%9A%84%E6%BF%80%E5%85%89%E6%9D%9F%E6%95%B0%E9%87%8F.md,83.1%,中等,128 -2126,2100-2199,2126. 摧毁小行星,摧毁小行星,https://leetcode.cn/problems/destroying-asteroids/,destroying-asteroids,贪心、数组、排序,https://algo.itcharge.cn/Solutions/2100-2199/destroying-asteroids/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2126.%20%E6%91%A7%E6%AF%81%E5%B0%8F%E8%A1%8C%E6%98%9F.md,48.8%,中等,113 -2127,2100-2199,2127. 参加会议的最多员工数,参加会议的最多员工数,https://leetcode.cn/problems/maximum-employees-to-be-invited-to-a-meeting/,maximum-employees-to-be-invited-to-a-meeting,深度优先搜索、图、拓扑排序,https://algo.itcharge.cn/Solutions/2100-2199/maximum-employees-to-be-invited-to-a-meeting/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2127.%20%E5%8F%82%E5%8A%A0%E4%BC%9A%E8%AE%AE%E7%9A%84%E6%9C%80%E5%A4%9A%E5%91%98%E5%B7%A5%E6%95%B0.md,34.1%,困难,68 -2128,2100-2199,2128. 通过翻转行或列来去除所有的 1,通过翻转行或列来去除所有的 1,https://leetcode.cn/problems/remove-all-ones-with-row-and-column-flips/,remove-all-ones-with-row-and-column-flips,位运算、数组、数学、矩阵,https://algo.itcharge.cn/Solutions/2100-2199/remove-all-ones-with-row-and-column-flips/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2128.%20%E9%80%9A%E8%BF%87%E7%BF%BB%E8%BD%AC%E8%A1%8C%E6%88%96%E5%88%97%E6%9D%A5%E5%8E%BB%E9%99%A4%E6%89%80%E6%9C%89%E7%9A%84%201.md,75.5%,中等,15 -2129,2100-2199,2129. 将标题首字母大写,将标题首字母大写,https://leetcode.cn/problems/capitalize-the-title/,capitalize-the-title,字符串,https://algo.itcharge.cn/Solutions/2100-2199/capitalize-the-title/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2129.%20%E5%B0%86%E6%A0%87%E9%A2%98%E9%A6%96%E5%AD%97%E6%AF%8D%E5%A4%A7%E5%86%99.md,60.7%,简单,157 -2130,2100-2199,2130. 链表最大孪生和,链表最大孪生和,https://leetcode.cn/problems/maximum-twin-sum-of-a-linked-list/,maximum-twin-sum-of-a-linked-list,栈、链表、双指针,https://algo.itcharge.cn/Solutions/2100-2199/maximum-twin-sum-of-a-linked-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2130.%20%E9%93%BE%E8%A1%A8%E6%9C%80%E5%A4%A7%E5%AD%AA%E7%94%9F%E5%92%8C.md,80.4%,中等,177 -2131,2100-2199,2131. 连接两字母单词得到的最长回文串,连接两字母单词得到的最长回文串,https://leetcode.cn/problems/longest-palindrome-by-concatenating-two-letter-words/,longest-palindrome-by-concatenating-two-letter-words,贪心、数组、哈希表、字符串、计数,https://algo.itcharge.cn/Solutions/2100-2199/longest-palindrome-by-concatenating-two-letter-words/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2131.%20%E8%BF%9E%E6%8E%A5%E4%B8%A4%E5%AD%97%E6%AF%8D%E5%8D%95%E8%AF%8D%E5%BE%97%E5%88%B0%E7%9A%84%E6%9C%80%E9%95%BF%E5%9B%9E%E6%96%87%E4%B8%B2.md,42.9%,中等,152 -2132,2100-2199,2132. 用邮票贴满网格图,用邮票贴满网格图,https://leetcode.cn/problems/stamping-the-grid/,stamping-the-grid,贪心、数组、矩阵、前缀和,https://algo.itcharge.cn/Solutions/2100-2199/stamping-the-grid/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2132.%20%E7%94%A8%E9%82%AE%E7%A5%A8%E8%B4%B4%E6%BB%A1%E7%BD%91%E6%A0%BC%E5%9B%BE.md,30.7%,困难,67 -2133,2100-2199,2133. 检查是否每一行每一列都包含全部整数,检查是否每一行每一列都包含全部整数,https://leetcode.cn/problems/check-if-every-row-and-column-contains-all-numbers/,check-if-every-row-and-column-contains-all-numbers,数组、哈希表、矩阵,https://algo.itcharge.cn/Solutions/2100-2199/check-if-every-row-and-column-contains-all-numbers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2133.%20%E6%A3%80%E6%9F%A5%E6%98%AF%E5%90%A6%E6%AF%8F%E4%B8%80%E8%A1%8C%E6%AF%8F%E4%B8%80%E5%88%97%E9%83%BD%E5%8C%85%E5%90%AB%E5%85%A8%E9%83%A8%E6%95%B4%E6%95%B0.md,55.7%,简单,160 -2134,2100-2199,2134. 最少交换次数来组合所有的 1 II,最少交换次数来组合所有的 1 II,https://leetcode.cn/problems/minimum-swaps-to-group-all-1s-together-ii/,minimum-swaps-to-group-all-1s-together-ii,数组、滑动窗口,https://algo.itcharge.cn/Solutions/2100-2199/minimum-swaps-to-group-all-1s-together-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2134.%20%E6%9C%80%E5%B0%91%E4%BA%A4%E6%8D%A2%E6%AC%A1%E6%95%B0%E6%9D%A5%E7%BB%84%E5%90%88%E6%89%80%E6%9C%89%E7%9A%84%201%20II.md,48.8%,中等,173 -2135,2100-2199,2135. 统计追加字母可以获得的单词数,统计追加字母可以获得的单词数,https://leetcode.cn/problems/count-words-obtained-after-adding-a-letter/,count-words-obtained-after-adding-a-letter,位运算、数组、哈希表、字符串、排序,https://algo.itcharge.cn/Solutions/2100-2199/count-words-obtained-after-adding-a-letter/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2135.%20%E7%BB%9F%E8%AE%A1%E8%BF%BD%E5%8A%A0%E5%AD%97%E6%AF%8D%E5%8F%AF%E4%BB%A5%E8%8E%B7%E5%BE%97%E7%9A%84%E5%8D%95%E8%AF%8D%E6%95%B0.md,36.1%,中等,106 -2136,2100-2199,2136. 全部开花的最早一天,全部开花的最早一天,https://leetcode.cn/problems/earliest-possible-day-of-full-bloom/,earliest-possible-day-of-full-bloom,贪心、数组、排序,https://algo.itcharge.cn/Solutions/2100-2199/earliest-possible-day-of-full-bloom/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2136.%20%E5%85%A8%E9%83%A8%E5%BC%80%E8%8A%B1%E7%9A%84%E6%9C%80%E6%97%A9%E4%B8%80%E5%A4%A9.md,66.0%,困难,76 -2137,2100-2199,2137. 通过倒水操作让所有的水桶所含水量相等,通过倒水操作让所有的水桶所含水量相等,https://leetcode.cn/problems/pour-water-between-buckets-to-make-water-levels-equal/,pour-water-between-buckets-to-make-water-levels-equal,数组、二分查找,https://algo.itcharge.cn/Solutions/2100-2199/pour-water-between-buckets-to-make-water-levels-equal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2137.%20%E9%80%9A%E8%BF%87%E5%80%92%E6%B0%B4%E6%93%8D%E4%BD%9C%E8%AE%A9%E6%89%80%E6%9C%89%E7%9A%84%E6%B0%B4%E6%A1%B6%E6%89%80%E5%90%AB%E6%B0%B4%E9%87%8F%E7%9B%B8%E7%AD%89.md,64.5%,中等,13 -2138,2100-2199,2138. 将字符串拆分为若干长度为 k 的组,将字符串拆分为若干长度为 k 的组,https://leetcode.cn/problems/divide-a-string-into-groups-of-size-k/,divide-a-string-into-groups-of-size-k,字符串、模拟,https://algo.itcharge.cn/Solutions/2100-2199/divide-a-string-into-groups-of-size-k/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2138.%20%E5%B0%86%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%8B%86%E5%88%86%E4%B8%BA%E8%8B%A5%E5%B9%B2%E9%95%BF%E5%BA%A6%E4%B8%BA%20k%20%E7%9A%84%E7%BB%84.md,66.4%,简单,157 -2139,2100-2199,2139. 得到目标值的最少行动次数,得到目标值的最少行动次数,https://leetcode.cn/problems/minimum-moves-to-reach-target-score/,minimum-moves-to-reach-target-score,贪心、数学,https://algo.itcharge.cn/Solutions/2100-2199/minimum-moves-to-reach-target-score/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2139.%20%E5%BE%97%E5%88%B0%E7%9B%AE%E6%A0%87%E5%80%BC%E7%9A%84%E6%9C%80%E5%B0%91%E8%A1%8C%E5%8A%A8%E6%AC%A1%E6%95%B0.md,51.5%,中等,165 -2140,2100-2199,2140. 解决智力问题,解决智力问题,https://leetcode.cn/problems/solving-questions-with-brainpower/,solving-questions-with-brainpower,数组、动态规划,https://algo.itcharge.cn/Solutions/2100-2199/solving-questions-with-brainpower/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2140.%20%E8%A7%A3%E5%86%B3%E6%99%BA%E5%8A%9B%E9%97%AE%E9%A2%98.md,44.0%,中等,166 -2141,2100-2199,2141. 同时运行 N 台电脑的最长时间,同时运行 N 台电脑的最长时间,https://leetcode.cn/problems/maximum-running-time-of-n-computers/,maximum-running-time-of-n-computers,贪心、数组、二分查找、排序,https://algo.itcharge.cn/Solutions/2100-2199/maximum-running-time-of-n-computers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2141.%20%E5%90%8C%E6%97%B6%E8%BF%90%E8%A1%8C%20N%20%E5%8F%B0%E7%94%B5%E8%84%91%E7%9A%84%E6%9C%80%E9%95%BF%E6%97%B6%E9%97%B4.md,40.5%,困难,84 -2142,2100-2199,2142. 每辆车的乘客人数 I,每辆车的乘客人数 I,https://leetcode.cn/problems/the-number-of-passengers-in-each-bus-i/,the-number-of-passengers-in-each-bus-i,数据库,https://algo.itcharge.cn/Solutions/2100-2199/the-number-of-passengers-in-each-bus-i/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2142.%20%E6%AF%8F%E8%BE%86%E8%BD%A6%E7%9A%84%E4%B9%98%E5%AE%A2%E4%BA%BA%E6%95%B0%20I.md,46.6%,中等,21 -2143,2100-2199,2143. 在两个数组的区间中选取数字,在两个数组的区间中选取数字,https://leetcode.cn/problems/choose-numbers-from-two-arrays-in-range/,choose-numbers-from-two-arrays-in-range,数组、动态规划,https://algo.itcharge.cn/Solutions/2100-2199/choose-numbers-from-two-arrays-in-range/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2143.%20%E5%9C%A8%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E7%9A%84%E5%8C%BA%E9%97%B4%E4%B8%AD%E9%80%89%E5%8F%96%E6%95%B0%E5%AD%97.md,57.1%,困难,11 -2144,2100-2199,2144. 打折购买糖果的最小开销,打折购买糖果的最小开销,https://leetcode.cn/problems/minimum-cost-of-buying-candies-with-discount/,minimum-cost-of-buying-candies-with-discount,贪心、数组、排序,https://algo.itcharge.cn/Solutions/2100-2199/minimum-cost-of-buying-candies-with-discount/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2144.%20%E6%89%93%E6%8A%98%E8%B4%AD%E4%B9%B0%E7%B3%96%E6%9E%9C%E7%9A%84%E6%9C%80%E5%B0%8F%E5%BC%80%E9%94%80.md,66.9%,简单,174 -2145,2100-2199,2145. 统计隐藏数组数目,统计隐藏数组数目,https://leetcode.cn/problems/count-the-hidden-sequences/,count-the-hidden-sequences,数组、前缀和,https://algo.itcharge.cn/Solutions/2100-2199/count-the-hidden-sequences/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2145.%20%E7%BB%9F%E8%AE%A1%E9%9A%90%E8%97%8F%E6%95%B0%E7%BB%84%E6%95%B0%E7%9B%AE.md,35.8%,中等,117 -2146,2100-2199,2146. 价格范围内最高排名的 K 样物品,价格范围内最高排名的 K 样物品,https://leetcode.cn/problems/k-highest-ranked-items-within-a-price-range/,k-highest-ranked-items-within-a-price-range,广度优先搜索、数组、矩阵、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/2100-2199/k-highest-ranked-items-within-a-price-range/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2146.%20%E4%BB%B7%E6%A0%BC%E8%8C%83%E5%9B%B4%E5%86%85%E6%9C%80%E9%AB%98%E6%8E%92%E5%90%8D%E7%9A%84%20K%20%E6%A0%B7%E7%89%A9%E5%93%81.md,40.1%,中等,98 -2147,2100-2199,2147. 分隔长廊的方案数,分隔长廊的方案数,https://leetcode.cn/problems/number-of-ways-to-divide-a-long-corridor/,number-of-ways-to-divide-a-long-corridor,数学、字符串、动态规划,https://algo.itcharge.cn/Solutions/2100-2199/number-of-ways-to-divide-a-long-corridor/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2147.%20%E5%88%86%E9%9A%94%E9%95%BF%E5%BB%8A%E7%9A%84%E6%96%B9%E6%A1%88%E6%95%B0.md,41.5%,困难,89 -2148,2100-2199,2148. 元素计数,元素计数,https://leetcode.cn/problems/count-elements-with-strictly-smaller-and-greater-elements/,count-elements-with-strictly-smaller-and-greater-elements,数组、排序,https://algo.itcharge.cn/Solutions/2100-2199/count-elements-with-strictly-smaller-and-greater-elements/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2148.%20%E5%85%83%E7%B4%A0%E8%AE%A1%E6%95%B0.md,57.8%,简单,166 -2149,2100-2199,2149. 按符号重排数组,按符号重排数组,https://leetcode.cn/problems/rearrange-array-elements-by-sign/,rearrange-array-elements-by-sign,数组、双指针、模拟,https://algo.itcharge.cn/Solutions/2100-2199/rearrange-array-elements-by-sign/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2149.%20%E6%8C%89%E7%AC%A6%E5%8F%B7%E9%87%8D%E6%8E%92%E6%95%B0%E7%BB%84.md,79.7%,中等,130 -2150,2100-2199,2150. 找出数组中的所有孤独数字,找出数组中的所有孤独数字,https://leetcode.cn/problems/find-all-lonely-numbers-in-the-array/,find-all-lonely-numbers-in-the-array,数组、哈希表、计数,https://algo.itcharge.cn/Solutions/2100-2199/find-all-lonely-numbers-in-the-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2150.%20%E6%89%BE%E5%87%BA%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%89%80%E6%9C%89%E5%AD%A4%E7%8B%AC%E6%95%B0%E5%AD%97.md,59.6%,中等,113 -2151,2100-2199,2151. 基于陈述统计最多好人数,基于陈述统计最多好人数,https://leetcode.cn/problems/maximum-good-people-based-on-statements/,maximum-good-people-based-on-statements,位运算、数组、回溯、枚举,https://algo.itcharge.cn/Solutions/2100-2199/maximum-good-people-based-on-statements/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2151.%20%E5%9F%BA%E4%BA%8E%E9%99%88%E8%BF%B0%E7%BB%9F%E8%AE%A1%E6%9C%80%E5%A4%9A%E5%A5%BD%E4%BA%BA%E6%95%B0.md,50.3%,困难,93 -2152,2100-2199,2152. 穿过所有点的所需最少直线数量,穿过所有点的所需最少直线数量,https://leetcode.cn/problems/minimum-number-of-lines-to-cover-points/,minimum-number-of-lines-to-cover-points,位运算、几何、数组、哈希表、数学、动态规划、回溯、状态压缩,https://algo.itcharge.cn/Solutions/2100-2199/minimum-number-of-lines-to-cover-points/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2152.%20%E7%A9%BF%E8%BF%87%E6%89%80%E6%9C%89%E7%82%B9%E7%9A%84%E6%89%80%E9%9C%80%E6%9C%80%E5%B0%91%E7%9B%B4%E7%BA%BF%E6%95%B0%E9%87%8F.md,53.0%,中等,17 -2153,2100-2199,2153. 每辆车的乘客人数 II,每辆车的乘客人数 II,https://leetcode.cn/problems/the-number-of-passengers-in-each-bus-ii/,the-number-of-passengers-in-each-bus-ii,数据库,https://algo.itcharge.cn/Solutions/2100-2199/the-number-of-passengers-in-each-bus-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2153.%20%E6%AF%8F%E8%BE%86%E8%BD%A6%E7%9A%84%E4%B9%98%E5%AE%A2%E4%BA%BA%E6%95%B0%20II.md,44.5%,困难,9 -2154,2100-2199,2154. 将找到的值乘以 2,将找到的值乘以 2,https://leetcode.cn/problems/keep-multiplying-found-values-by-two/,keep-multiplying-found-values-by-two,数组、哈希表、排序、模拟,https://algo.itcharge.cn/Solutions/2100-2199/keep-multiplying-found-values-by-two/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2154.%20%E5%B0%86%E6%89%BE%E5%88%B0%E7%9A%84%E5%80%BC%E4%B9%98%E4%BB%A5%202.md,73.5%,简单,193 -2155,2100-2199,2155. 分组得分最高的所有下标,分组得分最高的所有下标,https://leetcode.cn/problems/all-divisions-with-the-highest-score-of-a-binary-array/,all-divisions-with-the-highest-score-of-a-binary-array,数组,https://algo.itcharge.cn/Solutions/2100-2199/all-divisions-with-the-highest-score-of-a-binary-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2155.%20%E5%88%86%E7%BB%84%E5%BE%97%E5%88%86%E6%9C%80%E9%AB%98%E7%9A%84%E6%89%80%E6%9C%89%E4%B8%8B%E6%A0%87.md,64.6%,中等,118 -2156,2100-2199,2156. 查找给定哈希值的子串,查找给定哈希值的子串,https://leetcode.cn/problems/find-substring-with-given-hash-value/,find-substring-with-given-hash-value,字符串、滑动窗口、哈希函数、滚动哈希,https://algo.itcharge.cn/Solutions/2100-2199/find-substring-with-given-hash-value/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2156.%20%E6%9F%A5%E6%89%BE%E7%BB%99%E5%AE%9A%E5%93%88%E5%B8%8C%E5%80%BC%E7%9A%84%E5%AD%90%E4%B8%B2.md,25.2%,困难,97 -2157,2100-2199,2157. 字符串分组,字符串分组,https://leetcode.cn/problems/groups-of-strings/,groups-of-strings,位运算、并查集、字符串,https://algo.itcharge.cn/Solutions/2100-2199/groups-of-strings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2157.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%88%86%E7%BB%84.md,31.3%,困难,79 -2158,2100-2199,2158. 每天绘制新区域的数量,每天绘制新区域的数量,https://leetcode.cn/problems/amount-of-new-area-painted-each-day/,amount-of-new-area-painted-each-day,线段树、数组、有序集合,https://algo.itcharge.cn/Solutions/2100-2199/amount-of-new-area-painted-each-day/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2158.%20%E6%AF%8F%E5%A4%A9%E7%BB%98%E5%88%B6%E6%96%B0%E5%8C%BA%E5%9F%9F%E7%9A%84%E6%95%B0%E9%87%8F.md,55.3%,困难,19 -2159,2100-2199,2159. 分别排序两列,分别排序两列,https://leetcode.cn/problems/order-two-columns-independently/,order-two-columns-independently,数据库,https://algo.itcharge.cn/Solutions/2100-2199/order-two-columns-independently/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2159.%20%E5%88%86%E5%88%AB%E6%8E%92%E5%BA%8F%E4%B8%A4%E5%88%97.md,61.2%,中等,10 -2160,2100-2199,2160. 拆分数位后四位数字的最小和,拆分数位后四位数字的最小和,https://leetcode.cn/problems/minimum-sum-of-four-digit-number-after-splitting-digits/,minimum-sum-of-four-digit-number-after-splitting-digits,贪心、数学、排序,https://algo.itcharge.cn/Solutions/2100-2199/minimum-sum-of-four-digit-number-after-splitting-digits/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2160.%20%E6%8B%86%E5%88%86%E6%95%B0%E4%BD%8D%E5%90%8E%E5%9B%9B%E4%BD%8D%E6%95%B0%E5%AD%97%E7%9A%84%E6%9C%80%E5%B0%8F%E5%92%8C.md,84.2%,简单,219 -2161,2100-2199,2161. 根据给定数字划分数组,根据给定数字划分数组,https://leetcode.cn/problems/partition-array-according-to-given-pivot/,partition-array-according-to-given-pivot,数组、双指针、模拟,https://algo.itcharge.cn/Solutions/2100-2199/partition-array-according-to-given-pivot/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2161.%20%E6%A0%B9%E6%8D%AE%E7%BB%99%E5%AE%9A%E6%95%B0%E5%AD%97%E5%88%92%E5%88%86%E6%95%B0%E7%BB%84.md,82.5%,中等,120 -2162,2100-2199,2162. 设置时间的最少代价,设置时间的最少代价,https://leetcode.cn/problems/minimum-cost-to-set-cooking-time/,minimum-cost-to-set-cooking-time,数学、枚举,https://algo.itcharge.cn/Solutions/2100-2199/minimum-cost-to-set-cooking-time/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2162.%20%E8%AE%BE%E7%BD%AE%E6%97%B6%E9%97%B4%E7%9A%84%E6%9C%80%E5%B0%91%E4%BB%A3%E4%BB%B7.md,34.3%,中等,82 -2163,2100-2199,2163. 删除元素后和的最小差值,删除元素后和的最小差值,https://leetcode.cn/problems/minimum-difference-in-sums-after-removal-of-elements/,minimum-difference-in-sums-after-removal-of-elements,数组、动态规划、堆（优先队列）,https://algo.itcharge.cn/Solutions/2100-2199/minimum-difference-in-sums-after-removal-of-elements/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2163.%20%E5%88%A0%E9%99%A4%E5%85%83%E7%B4%A0%E5%90%8E%E5%92%8C%E7%9A%84%E6%9C%80%E5%B0%8F%E5%B7%AE%E5%80%BC.md,49.1%,困难,63 -2164,2100-2199,2164. 对奇偶下标分别排序,对奇偶下标分别排序,https://leetcode.cn/problems/sort-even-and-odd-indices-independently/,sort-even-and-odd-indices-independently,数组、排序,https://algo.itcharge.cn/Solutions/2100-2199/sort-even-and-odd-indices-independently/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2164.%20%E5%AF%B9%E5%A5%87%E5%81%B6%E4%B8%8B%E6%A0%87%E5%88%86%E5%88%AB%E6%8E%92%E5%BA%8F.md,68.6%,简单,147 -2165,2100-2199,2165. 重排数字的最小值,重排数字的最小值,https://leetcode.cn/problems/smallest-value-of-the-rearranged-number/,smallest-value-of-the-rearranged-number,数学、排序,https://algo.itcharge.cn/Solutions/2100-2199/smallest-value-of-the-rearranged-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2165.%20%E9%87%8D%E6%8E%92%E6%95%B0%E5%AD%97%E7%9A%84%E6%9C%80%E5%B0%8F%E5%80%BC.md,55.3%,中等,141 -2166,2100-2199,2166. 设计位集,设计位集,https://leetcode.cn/problems/design-bitset/,design-bitset,设计、数组、哈希表,https://algo.itcharge.cn/Solutions/2100-2199/design-bitset/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2166.%20%E8%AE%BE%E8%AE%A1%E4%BD%8D%E9%9B%86.md,30.7%,中等,160 -2167,2100-2199,2167. 移除所有载有违禁货物车厢所需的最少时间,移除所有载有违禁货物车厢所需的最少时间,https://leetcode.cn/problems/minimum-time-to-remove-all-cars-containing-illegal-goods/,minimum-time-to-remove-all-cars-containing-illegal-goods,字符串、动态规划,https://algo.itcharge.cn/Solutions/2100-2199/minimum-time-to-remove-all-cars-containing-illegal-goods/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2167.%20%E7%A7%BB%E9%99%A4%E6%89%80%E6%9C%89%E8%BD%BD%E6%9C%89%E8%BF%9D%E7%A6%81%E8%B4%A7%E7%89%A9%E8%BD%A6%E5%8E%A2%E6%89%80%E9%9C%80%E7%9A%84%E6%9C%80%E5%B0%91%E6%97%B6%E9%97%B4.md,49.2%,困难,79 -2168,2100-2199,2168. 每个数字的频率都相同的独特子字符串的数量,每个数字的频率都相同的独特子字符串的数量,https://leetcode.cn/problems/unique-substrings-with-equal-digit-frequency/,unique-substrings-with-equal-digit-frequency,哈希表、字符串、计数、哈希函数、滚动哈希,https://algo.itcharge.cn/Solutions/2100-2199/unique-substrings-with-equal-digit-frequency/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2168.%20%E6%AF%8F%E4%B8%AA%E6%95%B0%E5%AD%97%E7%9A%84%E9%A2%91%E7%8E%87%E9%83%BD%E7%9B%B8%E5%90%8C%E7%9A%84%E7%8B%AC%E7%89%B9%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%95%B0%E9%87%8F.md,63.2%,中等,15 -2169,2100-2199,2169. 得到 0 的操作数,得到 0 的操作数,https://leetcode.cn/problems/count-operations-to-obtain-zero/,count-operations-to-obtain-zero,数学、模拟,https://algo.itcharge.cn/Solutions/2100-2199/count-operations-to-obtain-zero/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2169.%20%E5%BE%97%E5%88%B0%200%20%E7%9A%84%E6%93%8D%E4%BD%9C%E6%95%B0.md,73.6%,简单,145 -2170,2100-2199,2170. 使数组变成交替数组的最少操作数,使数组变成交替数组的最少操作数,https://leetcode.cn/problems/minimum-operations-to-make-the-array-alternating/,minimum-operations-to-make-the-array-alternating,贪心、数组、哈希表、计数,https://algo.itcharge.cn/Solutions/2100-2199/minimum-operations-to-make-the-array-alternating/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2170.%20%E4%BD%BF%E6%95%B0%E7%BB%84%E5%8F%98%E6%88%90%E4%BA%A4%E6%9B%BF%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%95%B0.md,31.2%,中等,163 -2171,2100-2199,2171. 拿出最少数目的魔法豆,拿出最少数目的魔法豆,https://leetcode.cn/problems/removing-minimum-number-of-magic-beans/,removing-minimum-number-of-magic-beans,数组、前缀和、排序,https://algo.itcharge.cn/Solutions/2100-2199/removing-minimum-number-of-magic-beans/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2171.%20%E6%8B%BF%E5%87%BA%E6%9C%80%E5%B0%91%E6%95%B0%E7%9B%AE%E7%9A%84%E9%AD%94%E6%B3%95%E8%B1%86.md,40.4%,中等,184 -2172,2100-2199,2172. 数组的最大与和,数组的最大与和,https://leetcode.cn/problems/maximum-and-sum-of-array/,maximum-and-sum-of-array,位运算、数组、动态规划、状态压缩,https://algo.itcharge.cn/Solutions/2100-2199/maximum-and-sum-of-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2172.%20%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E4%B8%8E%E5%92%8C.md,50.6%,困难,79 -2173,2100-2199,2173. 最多连胜的次数,最多连胜的次数,https://leetcode.cn/problems/longest-winning-streak/,longest-winning-streak,数据库,https://algo.itcharge.cn/Solutions/2100-2199/longest-winning-streak/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2173.%20%E6%9C%80%E5%A4%9A%E8%BF%9E%E8%83%9C%E7%9A%84%E6%AC%A1%E6%95%B0.md,56.6%,困难,27 -2174,2100-2199,2174. 通过翻转行或列来去除所有的 1 II,通过翻转行或列来去除所有的 1 II,https://leetcode.cn/problems/remove-all-ones-with-row-and-column-flips-ii/,remove-all-ones-with-row-and-column-flips-ii,位运算、广度优先搜索、数组、矩阵,https://algo.itcharge.cn/Solutions/2100-2199/remove-all-ones-with-row-and-column-flips-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2174.%20%E9%80%9A%E8%BF%87%E7%BF%BB%E8%BD%AC%E8%A1%8C%E6%88%96%E5%88%97%E6%9D%A5%E5%8E%BB%E9%99%A4%E6%89%80%E6%9C%89%E7%9A%84%201%20II.md,66.7%,中等,9 -2175,2100-2199,2175. 世界排名的变化,世界排名的变化,https://leetcode.cn/problems/the-change-in-global-rankings/,the-change-in-global-rankings,数据库,https://algo.itcharge.cn/Solutions/2100-2199/the-change-in-global-rankings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2175.%20%E4%B8%96%E7%95%8C%E6%8E%92%E5%90%8D%E7%9A%84%E5%8F%98%E5%8C%96.md,54.8%,中等,12 -2176,2100-2199,2176. 统计数组中相等且可以被整除的数对,统计数组中相等且可以被整除的数对,https://leetcode.cn/problems/count-equal-and-divisible-pairs-in-an-array/,count-equal-and-divisible-pairs-in-an-array,数组,https://algo.itcharge.cn/Solutions/2100-2199/count-equal-and-divisible-pairs-in-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2176.%20%E7%BB%9F%E8%AE%A1%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9B%B8%E7%AD%89%E4%B8%94%E5%8F%AF%E4%BB%A5%E8%A2%AB%E6%95%B4%E9%99%A4%E7%9A%84%E6%95%B0%E5%AF%B9.md,78.8%,简单,123 -2177,2100-2199,2177. 找到和为给定整数的三个连续整数,找到和为给定整数的三个连续整数,https://leetcode.cn/problems/find-three-consecutive-integers-that-sum-to-a-given-number/,find-three-consecutive-integers-that-sum-to-a-given-number,数学、模拟,https://algo.itcharge.cn/Solutions/2100-2199/find-three-consecutive-integers-that-sum-to-a-given-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2177.%20%E6%89%BE%E5%88%B0%E5%92%8C%E4%B8%BA%E7%BB%99%E5%AE%9A%E6%95%B4%E6%95%B0%E7%9A%84%E4%B8%89%E4%B8%AA%E8%BF%9E%E7%BB%AD%E6%95%B4%E6%95%B0.md,70.0%,中等,99 -2178,2100-2199,2178. 拆分成最多数目的正偶数之和,拆分成最多数目的正偶数之和,https://leetcode.cn/problems/maximum-split-of-positive-even-integers/,maximum-split-of-positive-even-integers,贪心、数学、回溯,https://algo.itcharge.cn/Solutions/2100-2199/maximum-split-of-positive-even-integers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2178.%20%E6%8B%86%E5%88%86%E6%88%90%E6%9C%80%E5%A4%9A%E6%95%B0%E7%9B%AE%E7%9A%84%E6%AD%A3%E5%81%B6%E6%95%B0%E4%B9%8B%E5%92%8C.md,56.5%,中等,112 -2179,2100-2199,2179. 统计数组中好三元组数目,统计数组中好三元组数目,https://leetcode.cn/problems/count-good-triplets-in-an-array/,count-good-triplets-in-an-array,树状数组、线段树、数组、二分查找、分治、有序集合、归并排序,https://algo.itcharge.cn/Solutions/2100-2199/count-good-triplets-in-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2179.%20%E7%BB%9F%E8%AE%A1%E6%95%B0%E7%BB%84%E4%B8%AD%E5%A5%BD%E4%B8%89%E5%85%83%E7%BB%84%E6%95%B0%E7%9B%AE.md,37.4%,困难,79 -2180,2100-2199,2180. 统计各位数字之和为偶数的整数个数,统计各位数字之和为偶数的整数个数,https://leetcode.cn/problems/count-integers-with-even-digit-sum/,count-integers-with-even-digit-sum,数学、模拟,https://algo.itcharge.cn/Solutions/2100-2199/count-integers-with-even-digit-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2180.%20%E7%BB%9F%E8%AE%A1%E5%90%84%E4%BD%8D%E6%95%B0%E5%AD%97%E4%B9%8B%E5%92%8C%E4%B8%BA%E5%81%B6%E6%95%B0%E7%9A%84%E6%95%B4%E6%95%B0%E4%B8%AA%E6%95%B0.md,68.0%,简单,377 -2181,2100-2199,2181. 合并零之间的节点,合并零之间的节点,https://leetcode.cn/problems/merge-nodes-in-between-zeros/,merge-nodes-in-between-zeros,链表、模拟,https://algo.itcharge.cn/Solutions/2100-2199/merge-nodes-in-between-zeros/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2181.%20%E5%90%88%E5%B9%B6%E9%9B%B6%E4%B9%8B%E9%97%B4%E7%9A%84%E8%8A%82%E7%82%B9.md,84.7%,中等,211 -2182,2100-2199,2182. 构造限制重复的字符串,构造限制重复的字符串,https://leetcode.cn/problems/construct-string-with-repeat-limit/,construct-string-with-repeat-limit,贪心、字符串、计数、堆（优先队列）,https://algo.itcharge.cn/Solutions/2100-2199/construct-string-with-repeat-limit/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2182.%20%E6%9E%84%E9%80%A0%E9%99%90%E5%88%B6%E9%87%8D%E5%A4%8D%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2.md,48.5%,中等,145 -2183,2100-2199,2183. 统计可以被 K 整除的下标对数目,统计可以被 K 整除的下标对数目,https://leetcode.cn/problems/count-array-pairs-divisible-by-k/,count-array-pairs-divisible-by-k,数组、数学、数论,https://algo.itcharge.cn/Solutions/2100-2199/count-array-pairs-divisible-by-k/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2183.%20%E7%BB%9F%E8%AE%A1%E5%8F%AF%E4%BB%A5%E8%A2%AB%20K%20%E6%95%B4%E9%99%A4%E7%9A%84%E4%B8%8B%E6%A0%87%E5%AF%B9%E6%95%B0%E7%9B%AE.md,28.3%,困难,60 -2184,2100-2199,2184. 建造坚实的砖墙的方法数,建造坚实的砖墙的方法数,https://leetcode.cn/problems/number-of-ways-to-build-sturdy-brick-wall/,number-of-ways-to-build-sturdy-brick-wall,位运算、数组、动态规划、状态压缩,https://algo.itcharge.cn/Solutions/2100-2199/number-of-ways-to-build-sturdy-brick-wall/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2184.%20%E5%BB%BA%E9%80%A0%E5%9D%9A%E5%AE%9E%E7%9A%84%E7%A0%96%E5%A2%99%E7%9A%84%E6%96%B9%E6%B3%95%E6%95%B0.md,55.1%,中等,17 -2185,2100-2199,2185. 统计包含给定前缀的字符串,统计包含给定前缀的字符串,https://leetcode.cn/problems/counting-words-with-a-given-prefix/,counting-words-with-a-given-prefix,数组、字符串,https://algo.itcharge.cn/Solutions/2100-2199/counting-words-with-a-given-prefix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2185.%20%E7%BB%9F%E8%AE%A1%E5%8C%85%E5%90%AB%E7%BB%99%E5%AE%9A%E5%89%8D%E7%BC%80%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2.md,81.6%,简单,381 -2186,2100-2199,2186. 使两字符串互为字母异位词的最少步骤数,使两字符串互为字母异位词的最少步骤数,https://leetcode.cn/problems/minimum-number-of-steps-to-make-two-strings-anagram-ii/,minimum-number-of-steps-to-make-two-strings-anagram-ii,哈希表、字符串、计数,https://algo.itcharge.cn/Solutions/2100-2199/minimum-number-of-steps-to-make-two-strings-anagram-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2186.%20%E4%BD%BF%E4%B8%A4%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%BA%92%E4%B8%BA%E5%AD%97%E6%AF%8D%E5%BC%82%E4%BD%8D%E8%AF%8D%E7%9A%84%E6%9C%80%E5%B0%91%E6%AD%A5%E9%AA%A4%E6%95%B0.md,72.7%,中等,126 -2187,2100-2199,2187. 完成旅途的最少时间,完成旅途的最少时间,https://leetcode.cn/problems/minimum-time-to-complete-trips/,minimum-time-to-complete-trips,数组、二分查找,https://algo.itcharge.cn/Solutions/2100-2199/minimum-time-to-complete-trips/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2187.%20%E5%AE%8C%E6%88%90%E6%97%85%E9%80%94%E7%9A%84%E6%9C%80%E5%B0%91%E6%97%B6%E9%97%B4.md,28.4%,中等,155 -2188,2100-2199,2188. 完成比赛的最少时间,完成比赛的最少时间,https://leetcode.cn/problems/minimum-time-to-finish-the-race/,minimum-time-to-finish-the-race,数组、动态规划,https://algo.itcharge.cn/Solutions/2100-2199/minimum-time-to-finish-the-race/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2188.%20%E5%AE%8C%E6%88%90%E6%AF%94%E8%B5%9B%E7%9A%84%E6%9C%80%E5%B0%91%E6%97%B6%E9%97%B4.md,44.4%,困难,69 -2189,2100-2199,2189. 建造纸牌屋的方法数,建造纸牌屋的方法数,https://leetcode.cn/problems/number-of-ways-to-build-house-of-cards/,number-of-ways-to-build-house-of-cards,数学、动态规划,https://algo.itcharge.cn/Solutions/2100-2199/number-of-ways-to-build-house-of-cards/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2189.%20%E5%BB%BA%E9%80%A0%E7%BA%B8%E7%89%8C%E5%B1%8B%E7%9A%84%E6%96%B9%E6%B3%95%E6%95%B0.md,64.9%,中等,15 -2190,2100-2199,2190. 数组中紧跟 key 之后出现最频繁的数字,数组中紧跟 key 之后出现最频繁的数字,https://leetcode.cn/problems/most-frequent-number-following-key-in-an-array/,most-frequent-number-following-key-in-an-array,数组、哈希表、计数,https://algo.itcharge.cn/Solutions/2100-2199/most-frequent-number-following-key-in-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2190.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%B4%A7%E8%B7%9F%20key%20%E4%B9%8B%E5%90%8E%E5%87%BA%E7%8E%B0%E6%9C%80%E9%A2%91%E7%B9%81%E7%9A%84%E6%95%B0%E5%AD%97.md,58.7%,简单,116 -2191,2100-2199,2191. 将杂乱无章的数字排序,将杂乱无章的数字排序,https://leetcode.cn/problems/sort-the-jumbled-numbers/,sort-the-jumbled-numbers,数组、排序,https://algo.itcharge.cn/Solutions/2100-2199/sort-the-jumbled-numbers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2191.%20%E5%B0%86%E6%9D%82%E4%B9%B1%E6%97%A0%E7%AB%A0%E7%9A%84%E6%95%B0%E5%AD%97%E6%8E%92%E5%BA%8F.md,43.5%,中等,111 -2192,2100-2199,2192. 有向无环图中一个节点的所有祖先,有向无环图中一个节点的所有祖先,https://leetcode.cn/problems/all-ancestors-of-a-node-in-a-directed-acyclic-graph/,all-ancestors-of-a-node-in-a-directed-acyclic-graph,深度优先搜索、广度优先搜索、图、拓扑排序,https://algo.itcharge.cn/Solutions/2100-2199/all-ancestors-of-a-node-in-a-directed-acyclic-graph/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2192.%20%E6%9C%89%E5%90%91%E6%97%A0%E7%8E%AF%E5%9B%BE%E4%B8%AD%E4%B8%80%E4%B8%AA%E8%8A%82%E7%82%B9%E7%9A%84%E6%89%80%E6%9C%89%E7%A5%96%E5%85%88.md,45.1%,中等,114 -2193,2100-2199,2193. 得到回文串的最少操作次数,得到回文串的最少操作次数,https://leetcode.cn/problems/minimum-number-of-moves-to-make-palindrome/,minimum-number-of-moves-to-make-palindrome,贪心、树状数组、双指针、字符串,https://algo.itcharge.cn/Solutions/2100-2199/minimum-number-of-moves-to-make-palindrome/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2193.%20%E5%BE%97%E5%88%B0%E5%9B%9E%E6%96%87%E4%B8%B2%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0.md,49.1%,困难,64 -2194,2100-2199,2194. Excel 表中某个范围内的单元格,Excel 表中某个范围内的单元格,https://leetcode.cn/problems/cells-in-a-range-on-an-excel-sheet/,cells-in-a-range-on-an-excel-sheet,字符串,https://algo.itcharge.cn/Solutions/2100-2199/cells-in-a-range-on-an-excel-sheet/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2194.%20Excel%20%E8%A1%A8%E4%B8%AD%E6%9F%90%E4%B8%AA%E8%8C%83%E5%9B%B4%E5%86%85%E7%9A%84%E5%8D%95%E5%85%83%E6%A0%BC.md,84.2%,简单,150 -2195,2100-2199,2195. 向数组中追加 K 个整数,向数组中追加 K 个整数,https://leetcode.cn/problems/append-k-integers-with-minimal-sum/,append-k-integers-with-minimal-sum,贪心、数组、数学、排序,https://algo.itcharge.cn/Solutions/2100-2199/append-k-integers-with-minimal-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2195.%20%E5%90%91%E6%95%B0%E7%BB%84%E4%B8%AD%E8%BF%BD%E5%8A%A0%20K%20%E4%B8%AA%E6%95%B4%E6%95%B0.md,24.0%,中等,228 -2196,2100-2199,2196. 根据描述创建二叉树,根据描述创建二叉树,https://leetcode.cn/problems/create-binary-tree-from-descriptions/,create-binary-tree-from-descriptions,树、深度优先搜索、广度优先搜索、数组、哈希表、二叉树,https://algo.itcharge.cn/Solutions/2100-2199/create-binary-tree-from-descriptions/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2196.%20%E6%A0%B9%E6%8D%AE%E6%8F%8F%E8%BF%B0%E5%88%9B%E5%BB%BA%E4%BA%8C%E5%8F%89%E6%A0%91.md,72.8%,中等,160 -2197,2100-2199,2197. 替换数组中的非互质数,替换数组中的非互质数,https://leetcode.cn/problems/replace-non-coprime-numbers-in-array/,replace-non-coprime-numbers-in-array,栈、数组、数学、数论,https://algo.itcharge.cn/Solutions/2100-2199/replace-non-coprime-numbers-in-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2197.%20%E6%9B%BF%E6%8D%A2%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%9D%9E%E4%BA%92%E8%B4%A8%E6%95%B0.md,34.7%,困难,91 -2198,2100-2199,2198. 单因数三元组,单因数三元组,https://leetcode.cn/problems/number-of-single-divisor-triplets/,number-of-single-divisor-triplets,数学,https://algo.itcharge.cn/Solutions/2100-2199/number-of-single-divisor-triplets/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2198.%20%E5%8D%95%E5%9B%A0%E6%95%B0%E4%B8%89%E5%85%83%E7%BB%84.md,57.5%,中等,7 -2199,2100-2199,2199. 找到每篇文章的主题,找到每篇文章的主题,https://leetcode.cn/problems/finding-the-topic-of-each-post/,finding-the-topic-of-each-post,数据库,https://algo.itcharge.cn/Solutions/2100-2199/finding-the-topic-of-each-post/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2199.%20%E6%89%BE%E5%88%B0%E6%AF%8F%E7%AF%87%E6%96%87%E7%AB%A0%E7%9A%84%E4%B8%BB%E9%A2%98.md,59.4%,困难,12 -2200,2200-2299,2200. 找出数组中的所有 K 近邻下标,找出数组中的所有 K 近邻下标,https://leetcode.cn/problems/find-all-k-distant-indices-in-an-array/,find-all-k-distant-indices-in-an-array,数组,https://algo.itcharge.cn/Solutions/2200-2299/find-all-k-distant-indices-in-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2200.%20%E6%89%BE%E5%87%BA%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%89%80%E6%9C%89%20K%20%E8%BF%91%E9%82%BB%E4%B8%8B%E6%A0%87.md,53.8%,简单,148 -2201,2200-2299,2201. 统计可以提取的工件,统计可以提取的工件,https://leetcode.cn/problems/count-artifacts-that-can-be-extracted/,count-artifacts-that-can-be-extracted,数组、哈希表、模拟,https://algo.itcharge.cn/Solutions/2200-2299/count-artifacts-that-can-be-extracted/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2201.%20%E7%BB%9F%E8%AE%A1%E5%8F%AF%E4%BB%A5%E6%8F%90%E5%8F%96%E7%9A%84%E5%B7%A5%E4%BB%B6.md,49.4%,中等,138 -2202,2200-2299,2202. K 次操作后最大化顶端元素,K 次操作后最大化顶端元素,https://leetcode.cn/problems/maximize-the-topmost-element-after-k-moves/,maximize-the-topmost-element-after-k-moves,贪心、数组,https://algo.itcharge.cn/Solutions/2200-2299/maximize-the-topmost-element-after-k-moves/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2202.%20K%20%E6%AC%A1%E6%93%8D%E4%BD%9C%E5%90%8E%E6%9C%80%E5%A4%A7%E5%8C%96%E9%A1%B6%E7%AB%AF%E5%85%83%E7%B4%A0.md,21.7%,中等,150 -2203,2200-2299,2203. 得到要求路径的最小带权子图,得到要求路径的最小带权子图,https://leetcode.cn/problems/minimum-weighted-subgraph-with-the-required-paths/,minimum-weighted-subgraph-with-the-required-paths,图、最短路,https://algo.itcharge.cn/Solutions/2200-2299/minimum-weighted-subgraph-with-the-required-paths/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2203.%20%E5%BE%97%E5%88%B0%E8%A6%81%E6%B1%82%E8%B7%AF%E5%BE%84%E7%9A%84%E6%9C%80%E5%B0%8F%E5%B8%A6%E6%9D%83%E5%AD%90%E5%9B%BE.md,37.7%,困难,72 -2204,2200-2299,2204. 无向图中到环的距离,无向图中到环的距离,https://leetcode.cn/problems/distance-to-a-cycle-in-undirected-graph/,distance-to-a-cycle-in-undirected-graph,深度优先搜索、广度优先搜索、并查集、图,https://algo.itcharge.cn/Solutions/2200-2299/distance-to-a-cycle-in-undirected-graph/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2204.%20%E6%97%A0%E5%90%91%E5%9B%BE%E4%B8%AD%E5%88%B0%E7%8E%AF%E7%9A%84%E8%B7%9D%E7%A6%BB.md,75.5%,困难,18 -2205,2200-2299,2205. 有资格享受折扣的用户数量,有资格享受折扣的用户数量,https://leetcode.cn/problems/the-number-of-users-that-are-eligible-for-discount/,the-number-of-users-that-are-eligible-for-discount,数据库,https://algo.itcharge.cn/Solutions/2200-2299/the-number-of-users-that-are-eligible-for-discount/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2205.%20%E6%9C%89%E8%B5%84%E6%A0%BC%E4%BA%AB%E5%8F%97%E6%8A%98%E6%89%A3%E7%9A%84%E7%94%A8%E6%88%B7%E6%95%B0%E9%87%8F.md,44.6%,简单,14 -2206,2200-2299,2206. 将数组划分成相等数对,将数组划分成相等数对,https://leetcode.cn/problems/divide-array-into-equal-pairs/,divide-array-into-equal-pairs,位运算、数组、哈希表、计数,https://algo.itcharge.cn/Solutions/2200-2299/divide-array-into-equal-pairs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2206.%20%E5%B0%86%E6%95%B0%E7%BB%84%E5%88%92%E5%88%86%E6%88%90%E7%9B%B8%E7%AD%89%E6%95%B0%E5%AF%B9.md,73.8%,简单,163 -2207,2200-2299,2207. 字符串中最多数目的子字符串,字符串中最多数目的子字符串,https://leetcode.cn/problems/maximize-number-of-subsequences-in-a-string/,maximize-number-of-subsequences-in-a-string,贪心、字符串、前缀和,https://algo.itcharge.cn/Solutions/2200-2299/maximize-number-of-subsequences-in-a-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2207.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E6%9C%80%E5%A4%9A%E6%95%B0%E7%9B%AE%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md,31.5%,中等,107 -2208,2200-2299,2208. 将数组和减半的最少操作次数,将数组和减半的最少操作次数,https://leetcode.cn/problems/minimum-operations-to-halve-array-sum/,minimum-operations-to-halve-array-sum,贪心、数组、堆（优先队列）,https://algo.itcharge.cn/Solutions/2200-2299/minimum-operations-to-halve-array-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2208.%20%E5%B0%86%E6%95%B0%E7%BB%84%E5%92%8C%E5%87%8F%E5%8D%8A%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0.md,40.9%,中等,99 -2209,2200-2299,2209. 用地毯覆盖后的最少白色砖块,用地毯覆盖后的最少白色砖块,https://leetcode.cn/problems/minimum-white-tiles-after-covering-with-carpets/,minimum-white-tiles-after-covering-with-carpets,字符串、动态规划、前缀和,https://algo.itcharge.cn/Solutions/2200-2299/minimum-white-tiles-after-covering-with-carpets/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2209.%20%E7%94%A8%E5%9C%B0%E6%AF%AF%E8%A6%86%E7%9B%96%E5%90%8E%E7%9A%84%E6%9C%80%E5%B0%91%E7%99%BD%E8%89%B2%E7%A0%96%E5%9D%97.md,39.1%,困难,52 -2210,2200-2299,2210. 统计数组中峰和谷的数量,统计数组中峰和谷的数量,https://leetcode.cn/problems/count-hills-and-valleys-in-an-array/,count-hills-and-valleys-in-an-array,数组,https://algo.itcharge.cn/Solutions/2200-2299/count-hills-and-valleys-in-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2210.%20%E7%BB%9F%E8%AE%A1%E6%95%B0%E7%BB%84%E4%B8%AD%E5%B3%B0%E5%92%8C%E8%B0%B7%E7%9A%84%E6%95%B0%E9%87%8F.md,58.8%,简单,161 -2211,2200-2299,2211. 统计道路上的碰撞次数,统计道路上的碰撞次数,https://leetcode.cn/problems/count-collisions-on-a-road/,count-collisions-on-a-road,栈、字符串,https://algo.itcharge.cn/Solutions/2200-2299/count-collisions-on-a-road/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2211.%20%E7%BB%9F%E8%AE%A1%E9%81%93%E8%B7%AF%E4%B8%8A%E7%9A%84%E7%A2%B0%E6%92%9E%E6%AC%A1%E6%95%B0.md,41.0%,中等,147 -2212,2200-2299,2212. 射箭比赛中的最大得分,射箭比赛中的最大得分,https://leetcode.cn/problems/maximum-points-in-an-archery-competition/,maximum-points-in-an-archery-competition,位运算、递归、数组、枚举,https://algo.itcharge.cn/Solutions/2200-2299/maximum-points-in-an-archery-competition/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2212.%20%E5%B0%84%E7%AE%AD%E6%AF%94%E8%B5%9B%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E5%BE%97%E5%88%86.md,47.8%,中等,166 -2213,2200-2299,2213. 由单个字符重复的最长子字符串,由单个字符重复的最长子字符串,https://leetcode.cn/problems/longest-substring-of-one-repeating-character/,longest-substring-of-one-repeating-character,线段树、数组、字符串、有序集合,https://algo.itcharge.cn/Solutions/2200-2299/longest-substring-of-one-repeating-character/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2213.%20%E7%94%B1%E5%8D%95%E4%B8%AA%E5%AD%97%E7%AC%A6%E9%87%8D%E5%A4%8D%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md,40.6%,困难,86 -2214,2200-2299,2214. 通关游戏所需的最低生命值,通关游戏所需的最低生命值,https://leetcode.cn/problems/minimum-health-to-beat-game/,minimum-health-to-beat-game,贪心、数组、前缀和,https://algo.itcharge.cn/Solutions/2200-2299/minimum-health-to-beat-game/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2214.%20%E9%80%9A%E5%85%B3%E6%B8%B8%E6%88%8F%E6%89%80%E9%9C%80%E7%9A%84%E6%9C%80%E4%BD%8E%E7%94%9F%E5%91%BD%E5%80%BC.md,55.4%,中等,11 -2215,2200-2299,2215. 找出两数组的不同,找出两数组的不同,https://leetcode.cn/problems/find-the-difference-of-two-arrays/,find-the-difference-of-two-arrays,数组、哈希表,https://algo.itcharge.cn/Solutions/2200-2299/find-the-difference-of-two-arrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2215.%20%E6%89%BE%E5%87%BA%E4%B8%A4%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%8D%E5%90%8C.md,66.8%,简单,182 -2216,2200-2299,2216. 美化数组的最少删除数,美化数组的最少删除数,https://leetcode.cn/problems/minimum-deletions-to-make-array-beautiful/,minimum-deletions-to-make-array-beautiful,栈、贪心、数组,https://algo.itcharge.cn/Solutions/2200-2299/minimum-deletions-to-make-array-beautiful/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2216.%20%E7%BE%8E%E5%8C%96%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%B0%91%E5%88%A0%E9%99%A4%E6%95%B0.md,48.6%,中等,171 -2217,2200-2299,2217. 找到指定长度的回文数,找到指定长度的回文数,https://leetcode.cn/problems/find-palindrome-with-fixed-length/,find-palindrome-with-fixed-length,数组、数学,https://algo.itcharge.cn/Solutions/2200-2299/find-palindrome-with-fixed-length/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2217.%20%E6%89%BE%E5%88%B0%E6%8C%87%E5%AE%9A%E9%95%BF%E5%BA%A6%E7%9A%84%E5%9B%9E%E6%96%87%E6%95%B0.md,33.6%,中等,154 -2218,2200-2299,2218. 从栈中取出 K 个硬币的最大面值和,从栈中取出 K 个硬币的最大面值和,https://leetcode.cn/problems/maximum-value-of-k-coins-from-piles/,maximum-value-of-k-coins-from-piles,数组、动态规划、前缀和,https://algo.itcharge.cn/Solutions/2200-2299/maximum-value-of-k-coins-from-piles/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2218.%20%E4%BB%8E%E6%A0%88%E4%B8%AD%E5%8F%96%E5%87%BA%20K%20%E4%B8%AA%E7%A1%AC%E5%B8%81%E7%9A%84%E6%9C%80%E5%A4%A7%E9%9D%A2%E5%80%BC%E5%92%8C.md,55.3%,困难,94 -2219,2200-2299,2219. 数组的最大总分,数组的最大总分,https://leetcode.cn/problems/maximum-sum-score-of-array/,maximum-sum-score-of-array,数组、前缀和,https://algo.itcharge.cn/Solutions/2200-2299/maximum-sum-score-of-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2219.%20%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E6%80%BB%E5%88%86.md,64.0%,中等,17 -2220,2200-2299,2220. 转换数字的最少位翻转次数,转换数字的最少位翻转次数,https://leetcode.cn/problems/minimum-bit-flips-to-convert-number/,minimum-bit-flips-to-convert-number,位运算,https://algo.itcharge.cn/Solutions/2200-2299/minimum-bit-flips-to-convert-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2220.%20%E8%BD%AC%E6%8D%A2%E6%95%B0%E5%AD%97%E7%9A%84%E6%9C%80%E5%B0%91%E4%BD%8D%E7%BF%BB%E8%BD%AC%E6%AC%A1%E6%95%B0.md,82.6%,简单,161 -2221,2200-2299,2221. 数组的三角和,数组的三角和,https://leetcode.cn/problems/find-triangular-sum-of-an-array/,find-triangular-sum-of-an-array,数组、数学、组合数学、模拟,https://algo.itcharge.cn/Solutions/2200-2299/find-triangular-sum-of-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2221.%20%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%89%E8%A7%92%E5%92%8C.md,79.7%,中等,123 -2222,2200-2299,2222. 选择建筑的方案数,选择建筑的方案数,https://leetcode.cn/problems/number-of-ways-to-select-buildings/,number-of-ways-to-select-buildings,字符串、动态规划、前缀和,https://algo.itcharge.cn/Solutions/2200-2299/number-of-ways-to-select-buildings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2222.%20%E9%80%89%E6%8B%A9%E5%BB%BA%E7%AD%91%E7%9A%84%E6%96%B9%E6%A1%88%E6%95%B0.md,49.9%,中等,138 -2223,2200-2299,2223. 构造字符串的总得分和,构造字符串的总得分和,https://leetcode.cn/problems/sum-of-scores-of-built-strings/,sum-of-scores-of-built-strings,字符串、二分查找、字符串匹配、后缀数组、哈希函数、滚动哈希,https://algo.itcharge.cn/Solutions/2200-2299/sum-of-scores-of-built-strings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2223.%20%E6%9E%84%E9%80%A0%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%80%BB%E5%BE%97%E5%88%86%E5%92%8C.md,38.3%,困难,57 -2224,2200-2299,2224. 转化时间需要的最少操作数,转化时间需要的最少操作数,https://leetcode.cn/problems/minimum-number-of-operations-to-convert-time/,minimum-number-of-operations-to-convert-time,贪心、字符串,https://algo.itcharge.cn/Solutions/2200-2299/minimum-number-of-operations-to-convert-time/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2224.%20%E8%BD%AC%E5%8C%96%E6%97%B6%E9%97%B4%E9%9C%80%E8%A6%81%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%95%B0.md,69.4%,简单,162 -2225,2200-2299,2225. 找出输掉零场或一场比赛的玩家,找出输掉零场或一场比赛的玩家,https://leetcode.cn/problems/find-players-with-zero-or-one-losses/,find-players-with-zero-or-one-losses,数组、哈希表、计数、排序,https://algo.itcharge.cn/Solutions/2200-2299/find-players-with-zero-or-one-losses/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2225.%20%E6%89%BE%E5%87%BA%E8%BE%93%E6%8E%89%E9%9B%B6%E5%9C%BA%E6%88%96%E4%B8%80%E5%9C%BA%E6%AF%94%E8%B5%9B%E7%9A%84%E7%8E%A9%E5%AE%B6.md,63.0%,中等,119 -2226,2200-2299,2226. 每个小孩最多能分到多少糖果,每个小孩最多能分到多少糖果,https://leetcode.cn/problems/maximum-candies-allocated-to-k-children/,maximum-candies-allocated-to-k-children,数组、二分查找,https://algo.itcharge.cn/Solutions/2200-2299/maximum-candies-allocated-to-k-children/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2226.%20%E6%AF%8F%E4%B8%AA%E5%B0%8F%E5%AD%A9%E6%9C%80%E5%A4%9A%E8%83%BD%E5%88%86%E5%88%B0%E5%A4%9A%E5%B0%91%E7%B3%96%E6%9E%9C.md,34.1%,中等,182 -2227,2200-2299,2227. 加密解密字符串,加密解密字符串,https://leetcode.cn/problems/encrypt-and-decrypt-strings/,encrypt-and-decrypt-strings,设计、字典树、数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/2200-2299/encrypt-and-decrypt-strings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2227.%20%E5%8A%A0%E5%AF%86%E8%A7%A3%E5%AF%86%E5%AD%97%E7%AC%A6%E4%B8%B2.md,39.5%,困难,89 -2228,2200-2299,2228. 7 天内两次购买的用户,7 天内两次购买的用户,https://leetcode.cn/problems/users-with-two-purchases-within-seven-days/,users-with-two-purchases-within-seven-days,数据库,https://algo.itcharge.cn/Solutions/2200-2299/users-with-two-purchases-within-seven-days/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2228.%207%20%E5%A4%A9%E5%86%85%E4%B8%A4%E6%AC%A1%E8%B4%AD%E4%B9%B0%E7%9A%84%E7%94%A8%E6%88%B7.md,47.2%,中等,19 -2229,2200-2299,2229. 检查数组是否连贯,检查数组是否连贯,https://leetcode.cn/problems/check-if-an-array-is-consecutive/,check-if-an-array-is-consecutive,数组,https://algo.itcharge.cn/Solutions/2200-2299/check-if-an-array-is-consecutive/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2229.%20%E6%A3%80%E6%9F%A5%E6%95%B0%E7%BB%84%E6%98%AF%E5%90%A6%E8%BF%9E%E8%B4%AF.md,69.8%,简单,29 -2230,2200-2299,2230. 查找可享受优惠的用户,查找可享受优惠的用户,https://leetcode.cn/problems/the-users-that-are-eligible-for-discount/,the-users-that-are-eligible-for-discount,数据库,https://algo.itcharge.cn/Solutions/2200-2299/the-users-that-are-eligible-for-discount/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2230.%20%E6%9F%A5%E6%89%BE%E5%8F%AF%E4%BA%AB%E5%8F%97%E4%BC%98%E6%83%A0%E7%9A%84%E7%94%A8%E6%88%B7.md,49.4%,简单,9 -2231,2200-2299,2231. 按奇偶性交换后的最大数字,按奇偶性交换后的最大数字,https://leetcode.cn/problems/largest-number-after-digit-swaps-by-parity/,largest-number-after-digit-swaps-by-parity,排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/2200-2299/largest-number-after-digit-swaps-by-parity/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2231.%20%E6%8C%89%E5%A5%87%E5%81%B6%E6%80%A7%E4%BA%A4%E6%8D%A2%E5%90%8E%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E5%AD%97.md,64.3%,简单,195 -2232,2200-2299,2232. 向表达式添加括号后的最小结果,向表达式添加括号后的最小结果,https://leetcode.cn/problems/minimize-result-by-adding-parentheses-to-expression/,minimize-result-by-adding-parentheses-to-expression,字符串、枚举,https://algo.itcharge.cn/Solutions/2200-2299/minimize-result-by-adding-parentheses-to-expression/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2232.%20%E5%90%91%E8%A1%A8%E8%BE%BE%E5%BC%8F%E6%B7%BB%E5%8A%A0%E6%8B%AC%E5%8F%B7%E5%90%8E%E7%9A%84%E6%9C%80%E5%B0%8F%E7%BB%93%E6%9E%9C.md,61.3%,中等,134 -2233,2200-2299,2233. K 次增加后的最大乘积,K 次增加后的最大乘积,https://leetcode.cn/problems/maximum-product-after-k-increments/,maximum-product-after-k-increments,贪心、数组、堆（优先队列）,https://algo.itcharge.cn/Solutions/2200-2299/maximum-product-after-k-increments/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2233.%20K%20%E6%AC%A1%E5%A2%9E%E5%8A%A0%E5%90%8E%E7%9A%84%E6%9C%80%E5%A4%A7%E4%B9%98%E7%A7%AF.md,36.8%,中等,169 -2234,2200-2299,2234. 花园的最大总美丽值,花园的最大总美丽值,https://leetcode.cn/problems/maximum-total-beauty-of-the-gardens/,maximum-total-beauty-of-the-gardens,贪心、数组、双指针、二分查找、排序,https://algo.itcharge.cn/Solutions/2200-2299/maximum-total-beauty-of-the-gardens/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2234.%20%E8%8A%B1%E5%9B%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E6%80%BB%E7%BE%8E%E4%B8%BD%E5%80%BC.md,28.0%,困难,76 -2235,2200-2299,2235. 两整数相加,两整数相加,https://leetcode.cn/problems/add-two-integers/,add-two-integers,数学,https://algo.itcharge.cn/Solutions/2200-2299/add-two-integers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2235.%20%E4%B8%A4%E6%95%B4%E6%95%B0%E7%9B%B8%E5%8A%A0.md,85.2%,简单,155 -2236,2200-2299,2236. 判断根结点是否等于子结点之和,判断根结点是否等于子结点之和,https://leetcode.cn/problems/root-equals-sum-of-children/,root-equals-sum-of-children,树、二叉树,https://algo.itcharge.cn/Solutions/2200-2299/root-equals-sum-of-children/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2236.%20%E5%88%A4%E6%96%AD%E6%A0%B9%E7%BB%93%E7%82%B9%E6%98%AF%E5%90%A6%E7%AD%89%E4%BA%8E%E5%AD%90%E7%BB%93%E7%82%B9%E4%B9%8B%E5%92%8C.md,85.9%,简单,162 -2237,2200-2299,2237. 计算街道上满足所需亮度的位置数量,计算街道上满足所需亮度的位置数量,https://leetcode.cn/problems/count-positions-on-street-with-required-brightness/,count-positions-on-street-with-required-brightness,数组、前缀和,https://algo.itcharge.cn/Solutions/2200-2299/count-positions-on-street-with-required-brightness/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2237.%20%E8%AE%A1%E7%AE%97%E8%A1%97%E9%81%93%E4%B8%8A%E6%BB%A1%E8%B6%B3%E6%89%80%E9%9C%80%E4%BA%AE%E5%BA%A6%E7%9A%84%E4%BD%8D%E7%BD%AE%E6%95%B0%E9%87%8F.md,74.5%,中等,16 -2238,2200-2299,2238. 司机成为乘客的次数,司机成为乘客的次数,https://leetcode.cn/problems/number-of-times-a-driver-was-a-passenger/,number-of-times-a-driver-was-a-passenger,数据库,https://algo.itcharge.cn/Solutions/2200-2299/number-of-times-a-driver-was-a-passenger/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2238.%20%E5%8F%B8%E6%9C%BA%E6%88%90%E4%B8%BA%E4%B9%98%E5%AE%A2%E7%9A%84%E6%AC%A1%E6%95%B0.md,69.3%,中等,14 -2239,2200-2299,2239. 找到最接近 0 的数字,找到最接近 0 的数字,https://leetcode.cn/problems/find-closest-number-to-zero/,find-closest-number-to-zero,数组,https://algo.itcharge.cn/Solutions/2200-2299/find-closest-number-to-zero/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2239.%20%E6%89%BE%E5%88%B0%E6%9C%80%E6%8E%A5%E8%BF%91%200%20%E7%9A%84%E6%95%B0%E5%AD%97.md,53.5%,简单,138 -2240,2200-2299,2240. 买钢笔和铅笔的方案数,买钢笔和铅笔的方案数,https://leetcode.cn/problems/number-of-ways-to-buy-pens-and-pencils/,number-of-ways-to-buy-pens-and-pencils,数学、枚举,https://algo.itcharge.cn/Solutions/2200-2299/number-of-ways-to-buy-pens-and-pencils/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2240.%20%E4%B9%B0%E9%92%A2%E7%AC%94%E5%92%8C%E9%93%85%E7%AC%94%E7%9A%84%E6%96%B9%E6%A1%88%E6%95%B0.md,57.4%,中等,82 -2241,2200-2299,2241. 设计一个 ATM 机器,设计一个 ATM 机器,https://leetcode.cn/problems/design-an-atm-machine/,design-an-atm-machine,贪心、设计、数组,https://algo.itcharge.cn/Solutions/2200-2299/design-an-atm-machine/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2241.%20%E8%AE%BE%E8%AE%A1%E4%B8%80%E4%B8%AA%20ATM%20%E6%9C%BA%E5%99%A8.md,36.3%,中等,80 -2242,2200-2299,2242. 节点序列的最大得分,节点序列的最大得分,https://leetcode.cn/problems/maximum-score-of-a-node-sequence/,maximum-score-of-a-node-sequence,图、数组、枚举、排序,https://algo.itcharge.cn/Solutions/2200-2299/maximum-score-of-a-node-sequence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2242.%20%E8%8A%82%E7%82%B9%E5%BA%8F%E5%88%97%E7%9A%84%E6%9C%80%E5%A4%A7%E5%BE%97%E5%88%86.md,33.9%,困难,46 -2243,2200-2299,2243. 计算字符串的数字和,计算字符串的数字和,https://leetcode.cn/problems/calculate-digit-sum-of-a-string/,calculate-digit-sum-of-a-string,字符串、模拟,https://algo.itcharge.cn/Solutions/2200-2299/calculate-digit-sum-of-a-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2243.%20%E8%AE%A1%E7%AE%97%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%95%B0%E5%AD%97%E5%92%8C.md,63.5%,简单,164 -2244,2200-2299,2244. 完成所有任务需要的最少轮数,完成所有任务需要的最少轮数,https://leetcode.cn/problems/minimum-rounds-to-complete-all-tasks/,minimum-rounds-to-complete-all-tasks,贪心、数组、哈希表、计数,https://algo.itcharge.cn/Solutions/2200-2299/minimum-rounds-to-complete-all-tasks/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2244.%20%E5%AE%8C%E6%88%90%E6%89%80%E6%9C%89%E4%BB%BB%E5%8A%A1%E9%9C%80%E8%A6%81%E7%9A%84%E6%9C%80%E5%B0%91%E8%BD%AE%E6%95%B0.md,57.1%,中等,160 -2245,2200-2299,2245. 转角路径的乘积中最多能有几个尾随零,转角路径的乘积中最多能有几个尾随零,https://leetcode.cn/problems/maximum-trailing-zeros-in-a-cornered-path/,maximum-trailing-zeros-in-a-cornered-path,数组、矩阵、前缀和,https://algo.itcharge.cn/Solutions/2200-2299/maximum-trailing-zeros-in-a-cornered-path/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2245.%20%E8%BD%AC%E8%A7%92%E8%B7%AF%E5%BE%84%E7%9A%84%E4%B9%98%E7%A7%AF%E4%B8%AD%E6%9C%80%E5%A4%9A%E8%83%BD%E6%9C%89%E5%87%A0%E4%B8%AA%E5%B0%BE%E9%9A%8F%E9%9B%B6.md,36.1%,中等,98 -2246,2200-2299,2246. 相邻字符不同的最长路径,相邻字符不同的最长路径,https://leetcode.cn/problems/longest-path-with-different-adjacent-characters/,longest-path-with-different-adjacent-characters,树、深度优先搜索、图、拓扑排序、数组、字符串,https://algo.itcharge.cn/Solutions/2200-2299/longest-path-with-different-adjacent-characters/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2246.%20%E7%9B%B8%E9%82%BB%E5%AD%97%E7%AC%A6%E4%B8%8D%E5%90%8C%E7%9A%84%E6%9C%80%E9%95%BF%E8%B7%AF%E5%BE%84.md,47.0%,困难,69 -2247,2200-2299,2247. K 条高速公路的最大旅行费用,K 条高速公路的最大旅行费用,https://leetcode.cn/problems/maximum-cost-of-trip-with-k-highways/,maximum-cost-of-trip-with-k-highways,位运算、图、动态规划、状态压缩,https://algo.itcharge.cn/Solutions/2200-2299/maximum-cost-of-trip-with-k-highways/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2247.%20K%20%E6%9D%A1%E9%AB%98%E9%80%9F%E5%85%AC%E8%B7%AF%E7%9A%84%E6%9C%80%E5%A4%A7%E6%97%85%E8%A1%8C%E8%B4%B9%E7%94%A8.md,56.7%,困难,14 -2248,2200-2299,2248. 多个数组求交集,多个数组求交集,https://leetcode.cn/problems/intersection-of-multiple-arrays/,intersection-of-multiple-arrays,数组、哈希表、计数,https://algo.itcharge.cn/Solutions/2200-2299/intersection-of-multiple-arrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2248.%20%E5%A4%9A%E4%B8%AA%E6%95%B0%E7%BB%84%E6%B1%82%E4%BA%A4%E9%9B%86.md,67.1%,简单,193 -2249,2200-2299,2249. 统计圆内格点数目,统计圆内格点数目,https://leetcode.cn/problems/count-lattice-points-inside-a-circle/,count-lattice-points-inside-a-circle,几何、数组、哈希表、数学、枚举,https://algo.itcharge.cn/Solutions/2200-2299/count-lattice-points-inside-a-circle/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2249.%20%E7%BB%9F%E8%AE%A1%E5%9C%86%E5%86%85%E6%A0%BC%E7%82%B9%E6%95%B0%E7%9B%AE.md,53.3%,中等,133 -2250,2200-2299,2250. 统计包含每个点的矩形数目,统计包含每个点的矩形数目,https://leetcode.cn/problems/count-number-of-rectangles-containing-each-point/,count-number-of-rectangles-containing-each-point,树状数组、数组、二分查找、排序,https://algo.itcharge.cn/Solutions/2200-2299/count-number-of-rectangles-containing-each-point/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2250.%20%E7%BB%9F%E8%AE%A1%E5%8C%85%E5%90%AB%E6%AF%8F%E4%B8%AA%E7%82%B9%E7%9A%84%E7%9F%A9%E5%BD%A2%E6%95%B0%E7%9B%AE.md,34.9%,中等,119 -2251,2200-2299,2251. 花期内花的数目,花期内花的数目,https://leetcode.cn/problems/number-of-flowers-in-full-bloom/,number-of-flowers-in-full-bloom,数组、哈希表、二分查找、有序集合、前缀和、排序,https://algo.itcharge.cn/Solutions/2200-2299/number-of-flowers-in-full-bloom/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2251.%20%E8%8A%B1%E6%9C%9F%E5%86%85%E8%8A%B1%E7%9A%84%E6%95%B0%E7%9B%AE.md,49.1%,困难,131 -2252,2200-2299,2252. 表的动态旋转,表的动态旋转,https://leetcode.cn/problems/dynamic-pivoting-of-a-table/,dynamic-pivoting-of-a-table,数据库,https://algo.itcharge.cn/Solutions/2200-2299/dynamic-pivoting-of-a-table/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2252.%20%E8%A1%A8%E7%9A%84%E5%8A%A8%E6%80%81%E6%97%8B%E8%BD%AC.md,57.4%,困难,3 -2253,2200-2299,2253. 动态取消表的旋转,动态取消表的旋转,https://leetcode.cn/problems/dynamic-unpivoting-of-a-table/,dynamic-unpivoting-of-a-table,数据库,https://algo.itcharge.cn/Solutions/2200-2299/dynamic-unpivoting-of-a-table/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2253.%20%E5%8A%A8%E6%80%81%E5%8F%96%E6%B6%88%E8%A1%A8%E7%9A%84%E6%97%8B%E8%BD%AC.md,71.1%,困难,3 -2254,2200-2299,2254. 设计视频共享平台,设计视频共享平台,https://leetcode.cn/problems/design-video-sharing-platform/,design-video-sharing-platform,栈、设计、哈希表、有序集合,https://algo.itcharge.cn/Solutions/2200-2299/design-video-sharing-platform/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2254.%20%E8%AE%BE%E8%AE%A1%E8%A7%86%E9%A2%91%E5%85%B1%E4%BA%AB%E5%B9%B3%E5%8F%B0.md,61.3%,困难,8 -2255,2200-2299,2255. 统计是给定字符串前缀的字符串数目,统计是给定字符串前缀的字符串数目,https://leetcode.cn/problems/count-prefixes-of-a-given-string/,count-prefixes-of-a-given-string,数组、字符串,https://algo.itcharge.cn/Solutions/2200-2299/count-prefixes-of-a-given-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2255.%20%E7%BB%9F%E8%AE%A1%E6%98%AF%E7%BB%99%E5%AE%9A%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%89%8D%E7%BC%80%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%95%B0%E7%9B%AE.md,78.6%,简单,152 -2256,2200-2299,2256. 最小平均差,最小平均差,https://leetcode.cn/problems/minimum-average-difference/,minimum-average-difference,数组、前缀和,https://algo.itcharge.cn/Solutions/2200-2299/minimum-average-difference/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2256.%20%E6%9C%80%E5%B0%8F%E5%B9%B3%E5%9D%87%E5%B7%AE.md,36.8%,中等,80 -2257,2200-2299,2257. 统计网格图中没有被保卫的格子数,统计网格图中没有被保卫的格子数,https://leetcode.cn/problems/count-unguarded-cells-in-the-grid/,count-unguarded-cells-in-the-grid,数组、矩阵、模拟,https://algo.itcharge.cn/Solutions/2200-2299/count-unguarded-cells-in-the-grid/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2257.%20%E7%BB%9F%E8%AE%A1%E7%BD%91%E6%A0%BC%E5%9B%BE%E4%B8%AD%E6%B2%A1%E6%9C%89%E8%A2%AB%E4%BF%9D%E5%8D%AB%E7%9A%84%E6%A0%BC%E5%AD%90%E6%95%B0.md,52.7%,中等,107 -2258,2200-2299,2258. 逃离火灾,逃离火灾,https://leetcode.cn/problems/escape-the-spreading-fire/,escape-the-spreading-fire,广度优先搜索、数组、二分查找、矩阵,https://algo.itcharge.cn/Solutions/2200-2299/escape-the-spreading-fire/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2258.%20%E9%80%83%E7%A6%BB%E7%81%AB%E7%81%BE.md,35.9%,困难,88 -2259,2200-2299,2259. 移除指定数字得到的最大结果,移除指定数字得到的最大结果,https://leetcode.cn/problems/remove-digit-from-number-to-maximize-result/,remove-digit-from-number-to-maximize-result,贪心、字符串、枚举,https://algo.itcharge.cn/Solutions/2200-2299/remove-digit-from-number-to-maximize-result/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2259.%20%E7%A7%BB%E9%99%A4%E6%8C%87%E5%AE%9A%E6%95%B0%E5%AD%97%E5%BE%97%E5%88%B0%E7%9A%84%E6%9C%80%E5%A4%A7%E7%BB%93%E6%9E%9C.md,50.1%,简单,155 -2260,2200-2299,2260. 必须拿起的最小连续卡牌数,必须拿起的最小连续卡牌数,https://leetcode.cn/problems/minimum-consecutive-cards-to-pick-up/,minimum-consecutive-cards-to-pick-up,数组、哈希表、滑动窗口,https://algo.itcharge.cn/Solutions/2200-2299/minimum-consecutive-cards-to-pick-up/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2260.%20%E5%BF%85%E9%A1%BB%E6%8B%BF%E8%B5%B7%E7%9A%84%E6%9C%80%E5%B0%8F%E8%BF%9E%E7%BB%AD%E5%8D%A1%E7%89%8C%E6%95%B0.md,51.2%,中等,153 -2261,2200-2299,2261. 含最多 K 个可整除元素的子数组,含最多 K 个可整除元素的子数组,https://leetcode.cn/problems/k-divisible-elements-subarrays/,k-divisible-elements-subarrays,字典树、数组、哈希表、枚举、哈希函数、滚动哈希,https://algo.itcharge.cn/Solutions/2200-2299/k-divisible-elements-subarrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2261.%20%E5%90%AB%E6%9C%80%E5%A4%9A%20K%20%E4%B8%AA%E5%8F%AF%E6%95%B4%E9%99%A4%E5%85%83%E7%B4%A0%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md,52.9%,中等,132 -2262,2200-2299,2262. 字符串的总引力,字符串的总引力,https://leetcode.cn/problems/total-appeal-of-a-string/,total-appeal-of-a-string,哈希表、字符串、动态规划,https://algo.itcharge.cn/Solutions/2200-2299/total-appeal-of-a-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2262.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%80%BB%E5%BC%95%E5%8A%9B.md,57.5%,困难,121 -2263,2200-2299,2263. 数组变为有序的最小操作次数,数组变为有序的最小操作次数,https://leetcode.cn/problems/make-array-non-decreasing-or-non-increasing/,make-array-non-decreasing-or-non-increasing,贪心、动态规划,https://algo.itcharge.cn/Solutions/2200-2299/make-array-non-decreasing-or-non-increasing/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2263.%20%E6%95%B0%E7%BB%84%E5%8F%98%E4%B8%BA%E6%9C%89%E5%BA%8F%E7%9A%84%E6%9C%80%E5%B0%8F%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0.md,74.0%,困难,15 -2264,2200-2299,2264. 字符串中最大的 3 位相同数字,字符串中最大的 3 位相同数字,https://leetcode.cn/problems/largest-3-same-digit-number-in-string/,largest-3-same-digit-number-in-string,字符串,https://algo.itcharge.cn/Solutions/2200-2299/largest-3-same-digit-number-in-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2264.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E6%9C%80%E5%A4%A7%E7%9A%84%203%20%E4%BD%8D%E7%9B%B8%E5%90%8C%E6%95%B0%E5%AD%97.md,62.0%,简单,170 -2265,2200-2299,2265. 统计值等于子树平均值的节点数,统计值等于子树平均值的节点数,https://leetcode.cn/problems/count-nodes-equal-to-average-of-subtree/,count-nodes-equal-to-average-of-subtree,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/2200-2299/count-nodes-equal-to-average-of-subtree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2265.%20%E7%BB%9F%E8%AE%A1%E5%80%BC%E7%AD%89%E4%BA%8E%E5%AD%90%E6%A0%91%E5%B9%B3%E5%9D%87%E5%80%BC%E7%9A%84%E8%8A%82%E7%82%B9%E6%95%B0.md,82.6%,中等,200 -2266,2200-2299,2266. 统计打字方案数,统计打字方案数,https://leetcode.cn/problems/count-number-of-texts/,count-number-of-texts,哈希表、数学、字符串、动态规划,https://algo.itcharge.cn/Solutions/2200-2299/count-number-of-texts/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2266.%20%E7%BB%9F%E8%AE%A1%E6%89%93%E5%AD%97%E6%96%B9%E6%A1%88%E6%95%B0.md,43.6%,中等,138 -2267,2200-2299,2267. 检查是否有合法括号字符串路径,检查是否有合法括号字符串路径,https://leetcode.cn/problems/check-if-there-is-a-valid-parentheses-string-path/,check-if-there-is-a-valid-parentheses-string-path,数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/2200-2299/check-if-there-is-a-valid-parentheses-string-path/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2267.%20%E6%A3%80%E6%9F%A5%E6%98%AF%E5%90%A6%E6%9C%89%E5%90%88%E6%B3%95%E6%8B%AC%E5%8F%B7%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%B7%AF%E5%BE%84.md,37.9%,困难,132 -2268,2200-2299,2268. 最少按键次数,最少按键次数,https://leetcode.cn/problems/minimum-number-of-keypresses/,minimum-number-of-keypresses,贪心、数组、字符串、计数、排序,https://algo.itcharge.cn/Solutions/2200-2299/minimum-number-of-keypresses/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2268.%20%E6%9C%80%E5%B0%91%E6%8C%89%E9%94%AE%E6%AC%A1%E6%95%B0.md,68.0%,中等,18 -2269,2200-2299,2269. 找到一个数字的 K 美丽值,找到一个数字的 K 美丽值,https://leetcode.cn/problems/find-the-k-beauty-of-a-number/,find-the-k-beauty-of-a-number,数学、字符串、滑动窗口,https://algo.itcharge.cn/Solutions/2200-2299/find-the-k-beauty-of-a-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2269.%20%E6%89%BE%E5%88%B0%E4%B8%80%E4%B8%AA%E6%95%B0%E5%AD%97%E7%9A%84%20K%20%E7%BE%8E%E4%B8%BD%E5%80%BC.md,62.7%,简单,124 -2270,2200-2299,2270. 分割数组的方案数,分割数组的方案数,https://leetcode.cn/problems/number-of-ways-to-split-array/,number-of-ways-to-split-array,数组、前缀和,https://algo.itcharge.cn/Solutions/2200-2299/number-of-ways-to-split-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2270.%20%E5%88%86%E5%89%B2%E6%95%B0%E7%BB%84%E7%9A%84%E6%96%B9%E6%A1%88%E6%95%B0.md,46.4%,中等,76 -2271,2200-2299,2271. 毯子覆盖的最多白色砖块数,毯子覆盖的最多白色砖块数,https://leetcode.cn/problems/maximum-white-tiles-covered-by-a-carpet/,maximum-white-tiles-covered-by-a-carpet,贪心、数组、二分查找、前缀和、排序,https://algo.itcharge.cn/Solutions/2200-2299/maximum-white-tiles-covered-by-a-carpet/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2271.%20%E6%AF%AF%E5%AD%90%E8%A6%86%E7%9B%96%E7%9A%84%E6%9C%80%E5%A4%9A%E7%99%BD%E8%89%B2%E7%A0%96%E5%9D%97%E6%95%B0.md,32.8%,中等,101 -2272,2200-2299,2272. 最大波动的子字符串,最大波动的子字符串,https://leetcode.cn/problems/substring-with-largest-variance/,substring-with-largest-variance,数组、动态规划,https://algo.itcharge.cn/Solutions/2200-2299/substring-with-largest-variance/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2272.%20%E6%9C%80%E5%A4%A7%E6%B3%A2%E5%8A%A8%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md,38.8%,困难,42 -2273,2200-2299,2273. 移除字母异位词后的结果数组,移除字母异位词后的结果数组,https://leetcode.cn/problems/find-resultant-array-after-removing-anagrams/,find-resultant-array-after-removing-anagrams,数组、哈希表、字符串、排序,https://algo.itcharge.cn/Solutions/2200-2299/find-resultant-array-after-removing-anagrams/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2273.%20%E7%A7%BB%E9%99%A4%E5%AD%97%E6%AF%8D%E5%BC%82%E4%BD%8D%E8%AF%8D%E5%90%8E%E7%9A%84%E7%BB%93%E6%9E%9C%E6%95%B0%E7%BB%84.md,59.7%,简单,154 -2274,2200-2299,2274. 不含特殊楼层的最大连续楼层数,不含特殊楼层的最大连续楼层数,https://leetcode.cn/problems/maximum-consecutive-floors-without-special-floors/,maximum-consecutive-floors-without-special-floors,数组、排序,https://algo.itcharge.cn/Solutions/2200-2299/maximum-consecutive-floors-without-special-floors/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2274.%20%E4%B8%8D%E5%90%AB%E7%89%B9%E6%AE%8A%E6%A5%BC%E5%B1%82%E7%9A%84%E6%9C%80%E5%A4%A7%E8%BF%9E%E7%BB%AD%E6%A5%BC%E5%B1%82%E6%95%B0.md,52.6%,中等,110 -2275,2200-2299,2275. 按位与结果大于零的最长组合,按位与结果大于零的最长组合,https://leetcode.cn/problems/largest-combination-with-bitwise-and-greater-than-zero/,largest-combination-with-bitwise-and-greater-than-zero,位运算、数组、哈希表、计数,https://algo.itcharge.cn/Solutions/2200-2299/largest-combination-with-bitwise-and-greater-than-zero/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2275.%20%E6%8C%89%E4%BD%8D%E4%B8%8E%E7%BB%93%E6%9E%9C%E5%A4%A7%E4%BA%8E%E9%9B%B6%E7%9A%84%E6%9C%80%E9%95%BF%E7%BB%84%E5%90%88.md,60.1%,中等,102 -2276,2200-2299,2276. 统计区间中的整数数目,统计区间中的整数数目,https://leetcode.cn/problems/count-integers-in-intervals/,count-integers-in-intervals,设计、线段树、有序集合,https://algo.itcharge.cn/Solutions/2200-2299/count-integers-in-intervals/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2276.%20%E7%BB%9F%E8%AE%A1%E5%8C%BA%E9%97%B4%E4%B8%AD%E7%9A%84%E6%95%B4%E6%95%B0%E6%95%B0%E7%9B%AE.md,36.9%,困难,102 -2277,2200-2299,2277. 树中最接近路径的节点,树中最接近路径的节点,https://leetcode.cn/problems/closest-node-to-path-in-tree/,closest-node-to-path-in-tree,树、深度优先搜索、广度优先搜索、数组,https://algo.itcharge.cn/Solutions/2200-2299/closest-node-to-path-in-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2277.%20%E6%A0%91%E4%B8%AD%E6%9C%80%E6%8E%A5%E8%BF%91%E8%B7%AF%E5%BE%84%E7%9A%84%E8%8A%82%E7%82%B9.md,71.9%,困难,13 -2278,2200-2299,2278. 字母在字符串中的百分比,字母在字符串中的百分比,https://leetcode.cn/problems/percentage-of-letter-in-string/,percentage-of-letter-in-string,字符串,https://algo.itcharge.cn/Solutions/2200-2299/percentage-of-letter-in-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2278.%20%E5%AD%97%E6%AF%8D%E5%9C%A8%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E7%99%BE%E5%88%86%E6%AF%94.md,80.8%,简单,136 -2279,2200-2299,2279. 装满石头的背包的最大数量,装满石头的背包的最大数量,https://leetcode.cn/problems/maximum-bags-with-full-capacity-of-rocks/,maximum-bags-with-full-capacity-of-rocks,贪心、数组、排序,https://algo.itcharge.cn/Solutions/2200-2299/maximum-bags-with-full-capacity-of-rocks/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2279.%20%E8%A3%85%E6%BB%A1%E7%9F%B3%E5%A4%B4%E7%9A%84%E8%83%8C%E5%8C%85%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E9%87%8F.md,63.8%,中等,137 -2280,2200-2299,2280. 表示一个折线图的最少线段数,表示一个折线图的最少线段数,https://leetcode.cn/problems/minimum-lines-to-represent-a-line-chart/,minimum-lines-to-represent-a-line-chart,几何、数组、数学、数论、排序,https://algo.itcharge.cn/Solutions/2200-2299/minimum-lines-to-represent-a-line-chart/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2280.%20%E8%A1%A8%E7%A4%BA%E4%B8%80%E4%B8%AA%E6%8A%98%E7%BA%BF%E5%9B%BE%E7%9A%84%E6%9C%80%E5%B0%91%E7%BA%BF%E6%AE%B5%E6%95%B0.md,22.4%,中等,155 -2281,2200-2299,2281. 巫师的总力量和,巫师的总力量和,https://leetcode.cn/problems/sum-of-total-strength-of-wizards/,sum-of-total-strength-of-wizards,栈、数组、前缀和、单调栈,https://algo.itcharge.cn/Solutions/2200-2299/sum-of-total-strength-of-wizards/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2281.%20%E5%B7%AB%E5%B8%88%E7%9A%84%E6%80%BB%E5%8A%9B%E9%87%8F%E5%92%8C.md,26.6%,困难,73 -2282,2200-2299,2282. 在一个网格中可以看到的人数,在一个网格中可以看到的人数,https://leetcode.cn/problems/number-of-people-that-can-be-seen-in-a-grid/,number-of-people-that-can-be-seen-in-a-grid,栈、数组、矩阵、单调栈,https://algo.itcharge.cn/Solutions/2200-2299/number-of-people-that-can-be-seen-in-a-grid/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2282.%20%E5%9C%A8%E4%B8%80%E4%B8%AA%E7%BD%91%E6%A0%BC%E4%B8%AD%E5%8F%AF%E4%BB%A5%E7%9C%8B%E5%88%B0%E7%9A%84%E4%BA%BA%E6%95%B0.md,48.3%,中等,10 -2283,2200-2299,2283. 判断一个数的数字计数是否等于数位的值,判断一个数的数字计数是否等于数位的值,https://leetcode.cn/problems/check-if-number-has-equal-digit-count-and-digit-value/,check-if-number-has-equal-digit-count-and-digit-value,哈希表、字符串、计数,https://algo.itcharge.cn/Solutions/2200-2299/check-if-number-has-equal-digit-count-and-digit-value/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2283.%20%E5%88%A4%E6%96%AD%E4%B8%80%E4%B8%AA%E6%95%B0%E7%9A%84%E6%95%B0%E5%AD%97%E8%AE%A1%E6%95%B0%E6%98%AF%E5%90%A6%E7%AD%89%E4%BA%8E%E6%95%B0%E4%BD%8D%E7%9A%84%E5%80%BC.md,79.0%,简单,379 -2284,2200-2299,2284. 最多单词数的发件人,最多单词数的发件人,https://leetcode.cn/problems/sender-with-largest-word-count/,sender-with-largest-word-count,数组、哈希表、字符串、计数,https://algo.itcharge.cn/Solutions/2200-2299/sender-with-largest-word-count/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2284.%20%E6%9C%80%E5%A4%9A%E5%8D%95%E8%AF%8D%E6%95%B0%E7%9A%84%E5%8F%91%E4%BB%B6%E4%BA%BA.md,56.8%,中等,92 -2285,2200-2299,2285. 道路的最大总重要性,道路的最大总重要性,https://leetcode.cn/problems/maximum-total-importance-of-roads/,maximum-total-importance-of-roads,贪心、图、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/2200-2299/maximum-total-importance-of-roads/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2285.%20%E9%81%93%E8%B7%AF%E7%9A%84%E6%9C%80%E5%A4%A7%E6%80%BB%E9%87%8D%E8%A6%81%E6%80%A7.md,57.6%,中等,89 -2286,2200-2299,2286. 以组为单位订音乐会的门票,以组为单位订音乐会的门票,https://leetcode.cn/problems/booking-concert-tickets-in-groups/,booking-concert-tickets-in-groups,设计、树状数组、线段树、二分查找,https://algo.itcharge.cn/Solutions/2200-2299/booking-concert-tickets-in-groups/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2286.%20%E4%BB%A5%E7%BB%84%E4%B8%BA%E5%8D%95%E4%BD%8D%E8%AE%A2%E9%9F%B3%E4%B9%90%E4%BC%9A%E7%9A%84%E9%97%A8%E7%A5%A8.md,23.4%,困难,59 -2287,2200-2299,2287. 重排字符形成目标字符串,重排字符形成目标字符串,https://leetcode.cn/problems/rearrange-characters-to-make-target-string/,rearrange-characters-to-make-target-string,哈希表、字符串、计数,https://algo.itcharge.cn/Solutions/2200-2299/rearrange-characters-to-make-target-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2287.%20%E9%87%8D%E6%8E%92%E5%AD%97%E7%AC%A6%E5%BD%A2%E6%88%90%E7%9B%AE%E6%A0%87%E5%AD%97%E7%AC%A6%E4%B8%B2.md,65.1%,简单,422 -2288,2200-2299,2288. 价格减免,价格减免,https://leetcode.cn/problems/apply-discount-to-prices/,apply-discount-to-prices,字符串,https://algo.itcharge.cn/Solutions/2200-2299/apply-discount-to-prices/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2288.%20%E4%BB%B7%E6%A0%BC%E5%87%8F%E5%85%8D.md,31.5%,中等,114 -2289,2200-2299,2289. 使数组按非递减顺序排列,使数组按非递减顺序排列,https://leetcode.cn/problems/steps-to-make-array-non-decreasing/,steps-to-make-array-non-decreasing,栈、数组、链表、单调栈,https://algo.itcharge.cn/Solutions/2200-2299/steps-to-make-array-non-decreasing/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2289.%20%E4%BD%BF%E6%95%B0%E7%BB%84%E6%8C%89%E9%9D%9E%E9%80%92%E5%87%8F%E9%A1%BA%E5%BA%8F%E6%8E%92%E5%88%97.md,21.9%,中等,99 -2290,2200-2299,2290. 到达角落需要移除障碍物的最小数目,到达角落需要移除障碍物的最小数目,https://leetcode.cn/problems/minimum-obstacle-removal-to-reach-corner/,minimum-obstacle-removal-to-reach-corner,广度优先搜索、图、数组、矩阵、最短路、堆（优先队列）,https://algo.itcharge.cn/Solutions/2200-2299/minimum-obstacle-removal-to-reach-corner/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2290.%20%E5%88%B0%E8%BE%BE%E8%A7%92%E8%90%BD%E9%9C%80%E8%A6%81%E7%A7%BB%E9%99%A4%E9%9A%9C%E7%A2%8D%E7%89%A9%E7%9A%84%E6%9C%80%E5%B0%8F%E6%95%B0%E7%9B%AE.md,56.1%,困难,98 -2291,2200-2299,2291. 最大股票收益,最大股票收益,https://leetcode.cn/problems/maximum-profit-from-trading-stocks/,maximum-profit-from-trading-stocks,数组、动态规划,https://algo.itcharge.cn/Solutions/2200-2299/maximum-profit-from-trading-stocks/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2291.%20%E6%9C%80%E5%A4%A7%E8%82%A1%E7%A5%A8%E6%94%B6%E7%9B%8A.md,58.6%,中等,15 -2292,2200-2299,2292. 连续两年有 3 个及以上订单的产品,连续两年有 3 个及以上订单的产品,https://leetcode.cn/problems/products-with-three-or-more-orders-in-two-consecutive-years/,products-with-three-or-more-orders-in-two-consecutive-years,数据库,https://algo.itcharge.cn/Solutions/2200-2299/products-with-three-or-more-orders-in-two-consecutive-years/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2292.%20%E8%BF%9E%E7%BB%AD%E4%B8%A4%E5%B9%B4%E6%9C%89%203%20%E4%B8%AA%E5%8F%8A%E4%BB%A5%E4%B8%8A%E8%AE%A2%E5%8D%95%E7%9A%84%E4%BA%A7%E5%93%81.md,44.0%,中等,13 -2293,2200-2299,2293. 极大极小游戏,极大极小游戏,https://leetcode.cn/problems/min-max-game/,min-max-game,数组、模拟,https://algo.itcharge.cn/Solutions/2200-2299/min-max-game/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2293.%20%E6%9E%81%E5%A4%A7%E6%9E%81%E5%B0%8F%E6%B8%B8%E6%88%8F.md,73.0%,简单,316 -2294,2200-2299,2294. 划分数组使最大差为 K,划分数组使最大差为 K,https://leetcode.cn/problems/partition-array-such-that-maximum-difference-is-k/,partition-array-such-that-maximum-difference-is-k,贪心、数组、排序,https://algo.itcharge.cn/Solutions/2200-2299/partition-array-such-that-maximum-difference-is-k/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2294.%20%E5%88%92%E5%88%86%E6%95%B0%E7%BB%84%E4%BD%BF%E6%9C%80%E5%A4%A7%E5%B7%AE%E4%B8%BA%20K.md,68.0%,中等,111 -2295,2200-2299,2295. 替换数组中的元素,替换数组中的元素,https://leetcode.cn/problems/replace-elements-in-an-array/,replace-elements-in-an-array,数组、哈希表、模拟,https://algo.itcharge.cn/Solutions/2200-2299/replace-elements-in-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2295.%20%E6%9B%BF%E6%8D%A2%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E5%85%83%E7%B4%A0.md,57.8%,中等,114 -2296,2200-2299,2296. 设计一个文本编辑器,设计一个文本编辑器,https://leetcode.cn/problems/design-a-text-editor/,design-a-text-editor,栈、设计、链表、字符串、双向链表、模拟,https://algo.itcharge.cn/Solutions/2200-2299/design-a-text-editor/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2296.%20%E8%AE%BE%E8%AE%A1%E4%B8%80%E4%B8%AA%E6%96%87%E6%9C%AC%E7%BC%96%E8%BE%91%E5%99%A8.md,43.8%,困难,122 -2297,2200-2299,2297. 跳跃游戏 VIII,跳跃游戏 VIII,https://leetcode.cn/problems/jump-game-viii/,jump-game-viii,栈、图、数组、动态规划、最短路、单调栈,https://algo.itcharge.cn/Solutions/2200-2299/jump-game-viii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2297.%20%E8%B7%B3%E8%B7%83%E6%B8%B8%E6%88%8F%20VIII.md,56.3%,中等,14 -2298,2200-2299,2298. 周末任务计数,周末任务计数,https://leetcode.cn/problems/tasks-count-in-the-weekend/,tasks-count-in-the-weekend,数据库,https://algo.itcharge.cn/Solutions/2200-2299/tasks-count-in-the-weekend/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2298.%20%E5%91%A8%E6%9C%AB%E4%BB%BB%E5%8A%A1%E8%AE%A1%E6%95%B0.md,78.9%,中等,11 -2299,2200-2299,2299. 强密码检验器 II,强密码检验器 II,https://leetcode.cn/problems/strong-password-checker-ii/,strong-password-checker-ii,字符串,https://algo.itcharge.cn/Solutions/2200-2299/strong-password-checker-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2299.%20%E5%BC%BA%E5%AF%86%E7%A0%81%E6%A3%80%E9%AA%8C%E5%99%A8%20II.md,65.6%,简单,291 -2300,2300-2399,2300. 咒语和药水的成功对数,咒语和药水的成功对数,https://leetcode.cn/problems/successful-pairs-of-spells-and-potions/,successful-pairs-of-spells-and-potions,数组、双指针、二分查找、排序,https://algo.itcharge.cn/Solutions/2300-2399/successful-pairs-of-spells-and-potions/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2300.%20%E5%92%92%E8%AF%AD%E5%92%8C%E8%8D%AF%E6%B0%B4%E7%9A%84%E6%88%90%E5%8A%9F%E5%AF%B9%E6%95%B0.md,39.3%,中等,115 -2301,2300-2399,2301. 替换字符后匹配,替换字符后匹配,https://leetcode.cn/problems/match-substring-after-replacement/,match-substring-after-replacement,数组、哈希表、字符串、字符串匹配,https://algo.itcharge.cn/Solutions/2300-2399/match-substring-after-replacement/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2301.%20%E6%9B%BF%E6%8D%A2%E5%AD%97%E7%AC%A6%E5%90%8E%E5%8C%B9%E9%85%8D.md,45.3%,困难,67 -2302,2300-2399,2302. 统计得分小于 K 的子数组数目,统计得分小于 K 的子数组数目,https://leetcode.cn/problems/count-subarrays-with-score-less-than-k/,count-subarrays-with-score-less-than-k,数组、二分查找、前缀和、滑动窗口,https://algo.itcharge.cn/Solutions/2300-2399/count-subarrays-with-score-less-than-k/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2302.%20%E7%BB%9F%E8%AE%A1%E5%BE%97%E5%88%86%E5%B0%8F%E4%BA%8E%20K%20%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84%E6%95%B0%E7%9B%AE.md,50.9%,困难,83 -2303,2300-2399,2303. 计算应缴税款总额,计算应缴税款总额,https://leetcode.cn/problems/calculate-amount-paid-in-taxes/,calculate-amount-paid-in-taxes,数组、模拟,https://algo.itcharge.cn/Solutions/2300-2399/calculate-amount-paid-in-taxes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2303.%20%E8%AE%A1%E7%AE%97%E5%BA%94%E7%BC%B4%E7%A8%8E%E6%AC%BE%E6%80%BB%E9%A2%9D.md,70.5%,简单,211 -2304,2300-2399,2304. 网格中的最小路径代价,网格中的最小路径代价,https://leetcode.cn/problems/minimum-path-cost-in-a-grid/,minimum-path-cost-in-a-grid,数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/2300-2399/minimum-path-cost-in-a-grid/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2304.%20%E7%BD%91%E6%A0%BC%E4%B8%AD%E7%9A%84%E6%9C%80%E5%B0%8F%E8%B7%AF%E5%BE%84%E4%BB%A3%E4%BB%B7.md,64.2%,中等,125 -2305,2300-2399,2305. 公平分发饼干,公平分发饼干,https://leetcode.cn/problems/fair-distribution-of-cookies/,fair-distribution-of-cookies,位运算、数组、动态规划、回溯、状态压缩,https://algo.itcharge.cn/Solutions/2300-2399/fair-distribution-of-cookies/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2305.%20%E5%85%AC%E5%B9%B3%E5%88%86%E5%8F%91%E9%A5%BC%E5%B9%B2.md,72.5%,中等,135 -2306,2300-2399,2306. 公司命名,公司命名,https://leetcode.cn/problems/naming-a-company/,naming-a-company,位运算、数组、哈希表、字符串、枚举,https://algo.itcharge.cn/Solutions/2300-2399/naming-a-company/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2306.%20%E5%85%AC%E5%8F%B8%E5%91%BD%E5%90%8D.md,44.5%,困难,68 -2307,2300-2399,2307. 检查方程中的矛盾之处,检查方程中的矛盾之处,https://leetcode.cn/problems/check-for-contradictions-in-equations/,check-for-contradictions-in-equations,深度优先搜索、并查集、图、数组,https://algo.itcharge.cn/Solutions/2300-2399/check-for-contradictions-in-equations/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2307.%20%E6%A3%80%E6%9F%A5%E6%96%B9%E7%A8%8B%E4%B8%AD%E7%9A%84%E7%9F%9B%E7%9B%BE%E4%B9%8B%E5%A4%84.md,44.0%,困难,6 -2308,2300-2399,2308. 按性别排列表格,按性别排列表格,https://leetcode.cn/problems/arrange-table-by-gender/,arrange-table-by-gender,数据库,https://algo.itcharge.cn/Solutions/2300-2399/arrange-table-by-gender/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2308.%20%E6%8C%89%E6%80%A7%E5%88%AB%E6%8E%92%E5%88%97%E8%A1%A8%E6%A0%BC.md,77.5%,中等,13 -2309,2300-2399,2309. 兼具大小写的最好英文字母,兼具大小写的最好英文字母,https://leetcode.cn/problems/greatest-english-letter-in-upper-and-lower-case/,greatest-english-letter-in-upper-and-lower-case,哈希表、字符串、枚举,https://algo.itcharge.cn/Solutions/2300-2399/greatest-english-letter-in-upper-and-lower-case/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2309.%20%E5%85%BC%E5%85%B7%E5%A4%A7%E5%B0%8F%E5%86%99%E7%9A%84%E6%9C%80%E5%A5%BD%E8%8B%B1%E6%96%87%E5%AD%97%E6%AF%8D.md,71.8%,简单,328 -2310,2300-2399,2310. 个位数字为 K 的整数之和,个位数字为 K 的整数之和,https://leetcode.cn/problems/sum-of-numbers-with-units-digit-k/,sum-of-numbers-with-units-digit-k,贪心、数学、动态规划、枚举,https://algo.itcharge.cn/Solutions/2300-2399/sum-of-numbers-with-units-digit-k/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2310.%20%E4%B8%AA%E4%BD%8D%E6%95%B0%E5%AD%97%E4%B8%BA%20K%20%E7%9A%84%E6%95%B4%E6%95%B0%E4%B9%8B%E5%92%8C.md,27.6%,中等,128 -2311,2300-2399,2311. 小于等于 K 的最长二进制子序列,小于等于 K 的最长二进制子序列,https://leetcode.cn/problems/longest-binary-subsequence-less-than-or-equal-to-k/,longest-binary-subsequence-less-than-or-equal-to-k,贪心、记忆化搜索、字符串、动态规划,https://algo.itcharge.cn/Solutions/2300-2399/longest-binary-subsequence-less-than-or-equal-to-k/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2311.%20%E5%B0%8F%E4%BA%8E%E7%AD%89%E4%BA%8E%20K%20%E7%9A%84%E6%9C%80%E9%95%BF%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%AD%90%E5%BA%8F%E5%88%97.md,37.0%,中等,133 -2312,2300-2399,2312. 卖木头块,卖木头块,https://leetcode.cn/problems/selling-pieces-of-wood/,selling-pieces-of-wood,记忆化搜索、数组、动态规划,https://algo.itcharge.cn/Solutions/2300-2399/selling-pieces-of-wood/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2312.%20%E5%8D%96%E6%9C%A8%E5%A4%B4%E5%9D%97.md,53.7%,困难,60 -2313,2300-2399,2313. 二叉树中得到结果所需的最少翻转次数,二叉树中得到结果所需的最少翻转次数,https://leetcode.cn/problems/minimum-flips-in-binary-tree-to-get-result/,minimum-flips-in-binary-tree-to-get-result,树、深度优先搜索、动态规划、二叉树,https://algo.itcharge.cn/Solutions/2300-2399/minimum-flips-in-binary-tree-to-get-result/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2313.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E5%BE%97%E5%88%B0%E7%BB%93%E6%9E%9C%E6%89%80%E9%9C%80%E7%9A%84%E6%9C%80%E5%B0%91%E7%BF%BB%E8%BD%AC%E6%AC%A1%E6%95%B0.md,67.8%,困难,15 -2314,2300-2399,2314. 每个城市最高气温的第一天,每个城市最高气温的第一天,https://leetcode.cn/problems/the-first-day-of-the-maximum-recorded-degree-in-each-city/,the-first-day-of-the-maximum-recorded-degree-in-each-city,数据库,https://algo.itcharge.cn/Solutions/2300-2399/the-first-day-of-the-maximum-recorded-degree-in-each-city/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2314.%20%E6%AF%8F%E4%B8%AA%E5%9F%8E%E5%B8%82%E6%9C%80%E9%AB%98%E6%B0%94%E6%B8%A9%E7%9A%84%E7%AC%AC%E4%B8%80%E5%A4%A9.md,71.5%,中等,12 -2315,2300-2399,2315. 统计星号,统计星号,https://leetcode.cn/problems/count-asterisks/,count-asterisks,字符串,https://algo.itcharge.cn/Solutions/2300-2399/count-asterisks/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2315.%20%E7%BB%9F%E8%AE%A1%E6%98%9F%E5%8F%B7.md,85.8%,简单,464 -2316,2300-2399,2316. 统计无向图中无法互相到达点对数,统计无向图中无法互相到达点对数,https://leetcode.cn/problems/count-unreachable-pairs-of-nodes-in-an-undirected-graph/,count-unreachable-pairs-of-nodes-in-an-undirected-graph,深度优先搜索、广度优先搜索、并查集、图,https://algo.itcharge.cn/Solutions/2300-2399/count-unreachable-pairs-of-nodes-in-an-undirected-graph/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2316.%20%E7%BB%9F%E8%AE%A1%E6%97%A0%E5%90%91%E5%9B%BE%E4%B8%AD%E6%97%A0%E6%B3%95%E4%BA%92%E7%9B%B8%E5%88%B0%E8%BE%BE%E7%82%B9%E5%AF%B9%E6%95%B0.md,39.1%,中等,118 -2317,2300-2399,2317. 操作后的最大异或和,操作后的最大异或和,https://leetcode.cn/problems/maximum-xor-after-operations/,maximum-xor-after-operations,位运算、数组、数学,https://algo.itcharge.cn/Solutions/2300-2399/maximum-xor-after-operations/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2317.%20%E6%93%8D%E4%BD%9C%E5%90%8E%E7%9A%84%E6%9C%80%E5%A4%A7%E5%BC%82%E6%88%96%E5%92%8C.md,85.2%,中等,67 -2318,2300-2399,2318. 不同骰子序列的数目,不同骰子序列的数目,https://leetcode.cn/problems/number-of-distinct-roll-sequences/,number-of-distinct-roll-sequences,记忆化搜索、动态规划,https://algo.itcharge.cn/Solutions/2300-2399/number-of-distinct-roll-sequences/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2318.%20%E4%B8%8D%E5%90%8C%E9%AA%B0%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E6%95%B0%E7%9B%AE.md,57.1%,困难,70 -2319,2300-2399,2319. 判断矩阵是否是一个 X 矩阵,判断矩阵是否是一个 X 矩阵,https://leetcode.cn/problems/check-if-matrix-is-x-matrix/,check-if-matrix-is-x-matrix,数组、矩阵,https://algo.itcharge.cn/Solutions/2300-2399/check-if-matrix-is-x-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2319.%20%E5%88%A4%E6%96%AD%E7%9F%A9%E9%98%B5%E6%98%AF%E5%90%A6%E6%98%AF%E4%B8%80%E4%B8%AA%20X%20%E7%9F%A9%E9%98%B5.md,76.2%,简单,340 -2320,2300-2399,2320. 统计放置房子的方式数,统计放置房子的方式数,https://leetcode.cn/problems/count-number-of-ways-to-place-houses/,count-number-of-ways-to-place-houses,动态规划,https://algo.itcharge.cn/Solutions/2300-2399/count-number-of-ways-to-place-houses/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2320.%20%E7%BB%9F%E8%AE%A1%E6%94%BE%E7%BD%AE%E6%88%BF%E5%AD%90%E7%9A%84%E6%96%B9%E5%BC%8F%E6%95%B0.md,40.4%,中等,94 -2321,2300-2399,2321. 拼接数组的最大分数,拼接数组的最大分数,https://leetcode.cn/problems/maximum-score-of-spliced-array/,maximum-score-of-spliced-array,数组、动态规划,https://algo.itcharge.cn/Solutions/2300-2399/maximum-score-of-spliced-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2321.%20%E6%8B%BC%E6%8E%A5%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%88%86%E6%95%B0.md,51.3%,困难,106 -2322,2300-2399,2322. 从树中删除边的最小分数,从树中删除边的最小分数,https://leetcode.cn/problems/minimum-score-after-removals-on-a-tree/,minimum-score-after-removals-on-a-tree,位运算、树、深度优先搜索、数组,https://algo.itcharge.cn/Solutions/2300-2399/minimum-score-after-removals-on-a-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2322.%20%E4%BB%8E%E6%A0%91%E4%B8%AD%E5%88%A0%E9%99%A4%E8%BE%B9%E7%9A%84%E6%9C%80%E5%B0%8F%E5%88%86%E6%95%B0.md,58.9%,困难,55 -2323,2300-2399,2323. 完成所有工作的最短时间 II,完成所有工作的最短时间 II,https://leetcode.cn/problems/find-minimum-time-to-finish-all-jobs-ii/,find-minimum-time-to-finish-all-jobs-ii,贪心、数组、排序,https://algo.itcharge.cn/Solutions/2300-2399/find-minimum-time-to-finish-all-jobs-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2323.%20%E5%AE%8C%E6%88%90%E6%89%80%E6%9C%89%E5%B7%A5%E4%BD%9C%E7%9A%84%E6%9C%80%E7%9F%AD%E6%97%B6%E9%97%B4%20II.md,70.6%,中等,10 -2324,2300-2399,2324. 产品销售分析 IV,产品销售分析 IV,https://leetcode.cn/problems/product-sales-analysis-iv/,product-sales-analysis-iv,数据库,https://algo.itcharge.cn/Solutions/2300-2399/product-sales-analysis-iv/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2324.%20%E4%BA%A7%E5%93%81%E9%94%80%E5%94%AE%E5%88%86%E6%9E%90%20IV.md,70.7%,中等,10 -2325,2300-2399,2325. 解密消息,解密消息,https://leetcode.cn/problems/decode-the-message/,decode-the-message,哈希表、字符串,https://algo.itcharge.cn/Solutions/2300-2399/decode-the-message/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2325.%20%E8%A7%A3%E5%AF%86%E6%B6%88%E6%81%AF.md,86.0%,简单,429 -2326,2300-2399,2326. 螺旋矩阵 IV,螺旋矩阵 IV,https://leetcode.cn/problems/spiral-matrix-iv/,spiral-matrix-iv,数组、链表、矩阵、模拟,https://algo.itcharge.cn/Solutions/2300-2399/spiral-matrix-iv/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2326.%20%E8%9E%BA%E6%97%8B%E7%9F%A9%E9%98%B5%20IV.md,66.7%,中等,138 -2327,2300-2399,2327. 知道秘密的人数,知道秘密的人数,https://leetcode.cn/problems/number-of-people-aware-of-a-secret/,number-of-people-aware-of-a-secret,队列、动态规划、模拟,https://algo.itcharge.cn/Solutions/2300-2399/number-of-people-aware-of-a-secret/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2327.%20%E7%9F%A5%E9%81%93%E7%A7%98%E5%AF%86%E7%9A%84%E4%BA%BA%E6%95%B0.md,45.7%,中等,197 -2328,2300-2399,2328. 网格图中递增路径的数目,网格图中递增路径的数目,https://leetcode.cn/problems/number-of-increasing-paths-in-a-grid/,number-of-increasing-paths-in-a-grid,深度优先搜索、广度优先搜索、图、拓扑排序、记忆化搜索、数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/2300-2399/number-of-increasing-paths-in-a-grid/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2328.%20%E7%BD%91%E6%A0%BC%E5%9B%BE%E4%B8%AD%E9%80%92%E5%A2%9E%E8%B7%AF%E5%BE%84%E7%9A%84%E6%95%B0%E7%9B%AE.md,50.9%,困难,115 -2329,2300-2399,2329. 产品销售分析Ⅴ,产品销售分析Ⅴ,https://leetcode.cn/problems/product-sales-analysis-v/,product-sales-analysis-v,数据库,https://algo.itcharge.cn/Solutions/2300-2399/product-sales-analysis-v/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2329.%20%E4%BA%A7%E5%93%81%E9%94%80%E5%94%AE%E5%88%86%E6%9E%90%E2%85%A4.md,72.4%,简单,10 -2330,2300-2399,2330. 有效的回文 IV,有效的回文 IV,https://leetcode.cn/problems/valid-palindrome-iv/,valid-palindrome-iv,双指针、字符串,https://algo.itcharge.cn/Solutions/2300-2399/valid-palindrome-iv/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2330.%20%E6%9C%89%E6%95%88%E7%9A%84%E5%9B%9E%E6%96%87%20IV.md,81.5%,中等,15 -2331,2300-2399,2331. 计算布尔二叉树的值,计算布尔二叉树的值,https://leetcode.cn/problems/evaluate-boolean-binary-tree/,evaluate-boolean-binary-tree,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/2300-2399/evaluate-boolean-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2331.%20%E8%AE%A1%E7%AE%97%E5%B8%83%E5%B0%94%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%80%BC.md,84.0%,简单,362 -2332,2300-2399,2332. 坐上公交的最晚时间,坐上公交的最晚时间,https://leetcode.cn/problems/the-latest-time-to-catch-a-bus/,the-latest-time-to-catch-a-bus,数组、双指针、二分查找、排序,https://algo.itcharge.cn/Solutions/2300-2399/the-latest-time-to-catch-a-bus/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2332.%20%E5%9D%90%E4%B8%8A%E5%85%AC%E4%BA%A4%E7%9A%84%E6%9C%80%E6%99%9A%E6%97%B6%E9%97%B4.md,24.3%,中等,92 -2333,2300-2399,2333. 最小差值平方和,最小差值平方和,https://leetcode.cn/problems/minimum-sum-of-squared-difference/,minimum-sum-of-squared-difference,数组、数学、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/2300-2399/minimum-sum-of-squared-difference/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2333.%20%E6%9C%80%E5%B0%8F%E5%B7%AE%E5%80%BC%E5%B9%B3%E6%96%B9%E5%92%8C.md,26.7%,中等,74 -2334,2300-2399,2334. 元素值大于变化阈值的子数组,元素值大于变化阈值的子数组,https://leetcode.cn/problems/subarray-with-elements-greater-than-varying-threshold/,subarray-with-elements-greater-than-varying-threshold,栈、并查集、数组、单调栈,https://algo.itcharge.cn/Solutions/2300-2399/subarray-with-elements-greater-than-varying-threshold/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2334.%20%E5%85%83%E7%B4%A0%E5%80%BC%E5%A4%A7%E4%BA%8E%E5%8F%98%E5%8C%96%E9%98%88%E5%80%BC%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md,47.4%,困难,54 -2335,2300-2399,2335. 装满杯子需要的最短总时长,装满杯子需要的最短总时长,https://leetcode.cn/problems/minimum-amount-of-time-to-fill-cups/,minimum-amount-of-time-to-fill-cups,贪心、数组、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/2300-2399/minimum-amount-of-time-to-fill-cups/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2335.%20%E8%A3%85%E6%BB%A1%E6%9D%AF%E5%AD%90%E9%9C%80%E8%A6%81%E7%9A%84%E6%9C%80%E7%9F%AD%E6%80%BB%E6%97%B6%E9%95%BF.md,64.5%,简单,392 -2336,2300-2399,2336. 无限集中的最小数字,无限集中的最小数字,https://leetcode.cn/problems/smallest-number-in-infinite-set/,smallest-number-in-infinite-set,设计、哈希表、堆（优先队列）,https://algo.itcharge.cn/Solutions/2300-2399/smallest-number-in-infinite-set/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2336.%20%E6%97%A0%E9%99%90%E9%9B%86%E4%B8%AD%E7%9A%84%E6%9C%80%E5%B0%8F%E6%95%B0%E5%AD%97.md,69.8%,中等,143 -2337,2300-2399,2337. 移动片段得到字符串,移动片段得到字符串,https://leetcode.cn/problems/move-pieces-to-obtain-a-string/,move-pieces-to-obtain-a-string,双指针、字符串,https://algo.itcharge.cn/Solutions/2300-2399/move-pieces-to-obtain-a-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2337.%20%E7%A7%BB%E5%8A%A8%E7%89%87%E6%AE%B5%E5%BE%97%E5%88%B0%E5%AD%97%E7%AC%A6%E4%B8%B2.md,39.3%,中等,124 -2338,2300-2399,2338. 统计理想数组的数目,统计理想数组的数目,https://leetcode.cn/problems/count-the-number-of-ideal-arrays/,count-the-number-of-ideal-arrays,数学、动态规划、组合数学、数论,https://algo.itcharge.cn/Solutions/2300-2399/count-the-number-of-ideal-arrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2338.%20%E7%BB%9F%E8%AE%A1%E7%90%86%E6%83%B3%E6%95%B0%E7%BB%84%E7%9A%84%E6%95%B0%E7%9B%AE.md,30.7%,困难,46 -2339,2300-2399,2339. 联赛的所有比赛,联赛的所有比赛,https://leetcode.cn/problems/all-the-matches-of-the-league/,all-the-matches-of-the-league,数据库,https://algo.itcharge.cn/Solutions/2300-2399/all-the-matches-of-the-league/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2339.%20%E8%81%94%E8%B5%9B%E7%9A%84%E6%89%80%E6%9C%89%E6%AF%94%E8%B5%9B.md,75.8%,简单,11 -2340,2300-2399,2340. 生成有效数组的最少交换次数,生成有效数组的最少交换次数,https://leetcode.cn/problems/minimum-adjacent-swaps-to-make-a-valid-array/,minimum-adjacent-swaps-to-make-a-valid-array,贪心、数组,https://algo.itcharge.cn/Solutions/2300-2399/minimum-adjacent-swaps-to-make-a-valid-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2340.%20%E7%94%9F%E6%88%90%E6%9C%89%E6%95%88%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%B0%91%E4%BA%A4%E6%8D%A2%E6%AC%A1%E6%95%B0.md,76.5%,中等,10 -2341,2300-2399,2341. 数组能形成多少数对,数组能形成多少数对,https://leetcode.cn/problems/maximum-number-of-pairs-in-array/,maximum-number-of-pairs-in-array,数组、哈希表、计数,https://algo.itcharge.cn/Solutions/2300-2399/maximum-number-of-pairs-in-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2341.%20%E6%95%B0%E7%BB%84%E8%83%BD%E5%BD%A2%E6%88%90%E5%A4%9A%E5%B0%91%E6%95%B0%E5%AF%B9.md,81.2%,简单,473 -2342,2300-2399,2342. 数位和相等数对的最大和,数位和相等数对的最大和,https://leetcode.cn/problems/max-sum-of-a-pair-with-equal-sum-of-digits/,max-sum-of-a-pair-with-equal-sum-of-digits,数组、哈希表、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/2300-2399/max-sum-of-a-pair-with-equal-sum-of-digits/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2342.%20%E6%95%B0%E4%BD%8D%E5%92%8C%E7%9B%B8%E7%AD%89%E6%95%B0%E5%AF%B9%E7%9A%84%E6%9C%80%E5%A4%A7%E5%92%8C.md,53.6%,中等,143 -2343,2300-2399,2343. 裁剪数字后查询第 K 小的数字,裁剪数字后查询第 K 小的数字,https://leetcode.cn/problems/query-kth-smallest-trimmed-number/,query-kth-smallest-trimmed-number,数组、字符串、分治、快速选择、基数排序、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/2300-2399/query-kth-smallest-trimmed-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2343.%20%E8%A3%81%E5%89%AA%E6%95%B0%E5%AD%97%E5%90%8E%E6%9F%A5%E8%AF%A2%E7%AC%AC%20K%20%E5%B0%8F%E7%9A%84%E6%95%B0%E5%AD%97.md,41.3%,中等,143 -2344,2300-2399,2344. 使数组可以被整除的最少删除次数,使数组可以被整除的最少删除次数,https://leetcode.cn/problems/minimum-deletions-to-make-array-divisible/,minimum-deletions-to-make-array-divisible,数组、数学、数论、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/2300-2399/minimum-deletions-to-make-array-divisible/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2344.%20%E4%BD%BF%E6%95%B0%E7%BB%84%E5%8F%AF%E4%BB%A5%E8%A2%AB%E6%95%B4%E9%99%A4%E7%9A%84%E6%9C%80%E5%B0%91%E5%88%A0%E9%99%A4%E6%AC%A1%E6%95%B0.md,53.3%,困难,117 -2345,2300-2399,2345. 寻找可见山的数量,寻找可见山的数量,https://leetcode.cn/problems/finding-the-number-of-visible-mountains/,finding-the-number-of-visible-mountains,栈、数组、排序、单调栈,https://algo.itcharge.cn/Solutions/2300-2399/finding-the-number-of-visible-mountains/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2345.%20%E5%AF%BB%E6%89%BE%E5%8F%AF%E8%A7%81%E5%B1%B1%E7%9A%84%E6%95%B0%E9%87%8F.md,47.9%,中等,6 -2346,2300-2399,2346. 以百分比计算排名,以百分比计算排名,https://leetcode.cn/problems/compute-the-rank-as-a-percentage/,compute-the-rank-as-a-percentage,数据库,https://algo.itcharge.cn/Solutions/2300-2399/compute-the-rank-as-a-percentage/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2346.%20%E4%BB%A5%E7%99%BE%E5%88%86%E6%AF%94%E8%AE%A1%E7%AE%97%E6%8E%92%E5%90%8D.md,37.5%,中等,9 -2347,2300-2399,2347. 最好的扑克手牌,最好的扑克手牌,https://leetcode.cn/problems/best-poker-hand/,best-poker-hand,数组、哈希表、计数,https://algo.itcharge.cn/Solutions/2300-2399/best-poker-hand/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2347.%20%E6%9C%80%E5%A5%BD%E7%9A%84%E6%89%91%E5%85%8B%E6%89%8B%E7%89%8C.md,59.4%,简单,284 -2348,2300-2399,2348. 全 0 子数组的数目,全 0 子数组的数目,https://leetcode.cn/problems/number-of-zero-filled-subarrays/,number-of-zero-filled-subarrays,数组、数学,https://algo.itcharge.cn/Solutions/2300-2399/number-of-zero-filled-subarrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2348.%20%E5%85%A8%200%20%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%95%B0%E7%9B%AE.md,56.3%,中等,116 -2349,2300-2399,2349. 设计数字容器系统,设计数字容器系统,https://leetcode.cn/problems/design-a-number-container-system/,design-a-number-container-system,设计、哈希表、有序集合、堆（优先队列）,https://algo.itcharge.cn/Solutions/2300-2399/design-a-number-container-system/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2349.%20%E8%AE%BE%E8%AE%A1%E6%95%B0%E5%AD%97%E5%AE%B9%E5%99%A8%E7%B3%BB%E7%BB%9F.md,37.3%,中等,93 -2350,2300-2399,2350. 不可能得到的最短骰子序列,不可能得到的最短骰子序列,https://leetcode.cn/problems/shortest-impossible-sequence-of-rolls/,shortest-impossible-sequence-of-rolls,贪心、数组、哈希表,https://algo.itcharge.cn/Solutions/2300-2399/shortest-impossible-sequence-of-rolls/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2350.%20%E4%B8%8D%E5%8F%AF%E8%83%BD%E5%BE%97%E5%88%B0%E7%9A%84%E6%9C%80%E7%9F%AD%E9%AA%B0%E5%AD%90%E5%BA%8F%E5%88%97.md,64.8%,困难,74 -2351,2300-2399,2351. 第一个出现两次的字母,第一个出现两次的字母,https://leetcode.cn/problems/first-letter-to-appear-twice/,first-letter-to-appear-twice,哈希表、字符串、计数,https://algo.itcharge.cn/Solutions/2300-2399/first-letter-to-appear-twice/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2351.%20%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%87%BA%E7%8E%B0%E4%B8%A4%E6%AC%A1%E7%9A%84%E5%AD%97%E6%AF%8D.md,84.8%,简单,408 -2352,2300-2399,2352. 相等行列对,相等行列对,https://leetcode.cn/problems/equal-row-and-column-pairs/,equal-row-and-column-pairs,数组、哈希表、矩阵、模拟,https://algo.itcharge.cn/Solutions/2300-2399/equal-row-and-column-pairs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2352.%20%E7%9B%B8%E7%AD%89%E8%A1%8C%E5%88%97%E5%AF%B9.md,74.1%,中等,337 -2353,2300-2399,2353. 设计食物评分系统,设计食物评分系统,https://leetcode.cn/problems/design-a-food-rating-system/,design-a-food-rating-system,设计、哈希表、有序集合、堆（优先队列）,https://algo.itcharge.cn/Solutions/2300-2399/design-a-food-rating-system/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2353.%20%E8%AE%BE%E8%AE%A1%E9%A3%9F%E7%89%A9%E8%AF%84%E5%88%86%E7%B3%BB%E7%BB%9F.md,30.6%,中等,117 -2354,2300-2399,2354. 优质数对的数目,优质数对的数目,https://leetcode.cn/problems/number-of-excellent-pairs/,number-of-excellent-pairs,位运算、数组、哈希表、二分查找,https://algo.itcharge.cn/Solutions/2300-2399/number-of-excellent-pairs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2354.%20%E4%BC%98%E8%B4%A8%E6%95%B0%E5%AF%B9%E7%9A%84%E6%95%B0%E7%9B%AE.md,44.5%,困难,76 -2355,2300-2399,2355. 你能拿走的最大图书数量,你能拿走的最大图书数量,https://leetcode.cn/problems/maximum-number-of-books-you-can-take/,maximum-number-of-books-you-can-take,栈、数组、动态规划、单调栈,https://algo.itcharge.cn/Solutions/2300-2399/maximum-number-of-books-you-can-take/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2355.%20%E4%BD%A0%E8%83%BD%E6%8B%BF%E8%B5%B0%E7%9A%84%E6%9C%80%E5%A4%A7%E5%9B%BE%E4%B9%A6%E6%95%B0%E9%87%8F.md,59.0%,困难,10 -2356,2300-2399,2356. 每位教师所教授的科目种类的数量,每位教师所教授的科目种类的数量,https://leetcode.cn/problems/number-of-unique-subjects-taught-by-each-teacher/,number-of-unique-subjects-taught-by-each-teacher,数据库,https://algo.itcharge.cn/Solutions/2300-2399/number-of-unique-subjects-taught-by-each-teacher/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2356.%20%E6%AF%8F%E4%BD%8D%E6%95%99%E5%B8%88%E6%89%80%E6%95%99%E6%8E%88%E7%9A%84%E7%A7%91%E7%9B%AE%E7%A7%8D%E7%B1%BB%E7%9A%84%E6%95%B0%E9%87%8F.md,81.0%,简单,29 -2357,2300-2399,2357. 使数组中所有元素都等于零,使数组中所有元素都等于零,https://leetcode.cn/problems/make-array-zero-by-subtracting-equal-amounts/,make-array-zero-by-subtracting-equal-amounts,贪心、数组、哈希表、排序、模拟、堆（优先队列）,https://algo.itcharge.cn/Solutions/2300-2399/make-array-zero-by-subtracting-equal-amounts/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2357.%20%E4%BD%BF%E6%95%B0%E7%BB%84%E4%B8%AD%E6%89%80%E6%9C%89%E5%85%83%E7%B4%A0%E9%83%BD%E7%AD%89%E4%BA%8E%E9%9B%B6.md,75.9%,简单,471 -2358,2300-2399,2358. 分组的最大数量,分组的最大数量,https://leetcode.cn/problems/maximum-number-of-groups-entering-a-competition/,maximum-number-of-groups-entering-a-competition,贪心、数组、数学、二分查找,https://algo.itcharge.cn/Solutions/2300-2399/maximum-number-of-groups-entering-a-competition/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2358.%20%E5%88%86%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E9%87%8F.md,64.3%,中等,171 -2359,2300-2399,2359. 找到离给定两个节点最近的节点,找到离给定两个节点最近的节点,https://leetcode.cn/problems/find-closest-node-to-given-two-nodes/,find-closest-node-to-given-two-nodes,深度优先搜索、图,https://algo.itcharge.cn/Solutions/2300-2399/find-closest-node-to-given-two-nodes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2359.%20%E6%89%BE%E5%88%B0%E7%A6%BB%E7%BB%99%E5%AE%9A%E4%B8%A4%E4%B8%AA%E8%8A%82%E7%82%B9%E6%9C%80%E8%BF%91%E7%9A%84%E8%8A%82%E7%82%B9.md,30.3%,中等,110 -2360,2300-2399,2360. 图中的最长环,图中的最长环,https://leetcode.cn/problems/longest-cycle-in-a-graph/,longest-cycle-in-a-graph,深度优先搜索、图、拓扑排序,https://algo.itcharge.cn/Solutions/2300-2399/longest-cycle-in-a-graph/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2360.%20%E5%9B%BE%E4%B8%AD%E7%9A%84%E6%9C%80%E9%95%BF%E7%8E%AF.md,38.0%,困难,140 -2361,2300-2399,2361. 乘坐火车路线的最少费用,乘坐火车路线的最少费用,https://leetcode.cn/problems/minimum-costs-using-the-train-line/,minimum-costs-using-the-train-line,数组、动态规划,https://algo.itcharge.cn/Solutions/2300-2399/minimum-costs-using-the-train-line/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2361.%20%E4%B9%98%E5%9D%90%E7%81%AB%E8%BD%A6%E8%B7%AF%E7%BA%BF%E7%9A%84%E6%9C%80%E5%B0%91%E8%B4%B9%E7%94%A8.md,77.7%,困难,13 -2362,2300-2399,2362. 生成发票,生成发票,https://leetcode.cn/problems/generate-the-invoice/,generate-the-invoice,数据库,https://algo.itcharge.cn/Solutions/2300-2399/generate-the-invoice/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2362.%20%E7%94%9F%E6%88%90%E5%8F%91%E7%A5%A8.md,72.9%,困难,14 -2363,2300-2399,2363. 合并相似的物品,合并相似的物品,https://leetcode.cn/problems/merge-similar-items/,merge-similar-items,数组、哈希表、有序集合、排序,https://algo.itcharge.cn/Solutions/2300-2399/merge-similar-items/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2363.%20%E5%90%88%E5%B9%B6%E7%9B%B8%E4%BC%BC%E7%9A%84%E7%89%A9%E5%93%81.md,78.2%,简单,298 -2364,2300-2399,2364. 统计坏数对的数目,统计坏数对的数目,https://leetcode.cn/problems/count-number-of-bad-pairs/,count-number-of-bad-pairs,数组、哈希表,https://algo.itcharge.cn/Solutions/2300-2399/count-number-of-bad-pairs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2364.%20%E7%BB%9F%E8%AE%A1%E5%9D%8F%E6%95%B0%E5%AF%B9%E7%9A%84%E6%95%B0%E7%9B%AE.md,42.2%,中等,86 -2365,2300-2399,2365. 任务调度器 II,任务调度器 II,https://leetcode.cn/problems/task-scheduler-ii/,task-scheduler-ii,数组、哈希表、模拟,https://algo.itcharge.cn/Solutions/2300-2399/task-scheduler-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2365.%20%E4%BB%BB%E5%8A%A1%E8%B0%83%E5%BA%A6%E5%99%A8%20II.md,48.0%,中等,79 -2366,2300-2399,2366. 将数组排序的最少替换次数,将数组排序的最少替换次数,https://leetcode.cn/problems/minimum-replacements-to-sort-the-array/,minimum-replacements-to-sort-the-array,贪心、数组、数学,https://algo.itcharge.cn/Solutions/2300-2399/minimum-replacements-to-sort-the-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2366.%20%E5%B0%86%E6%95%B0%E7%BB%84%E6%8E%92%E5%BA%8F%E7%9A%84%E6%9C%80%E5%B0%91%E6%9B%BF%E6%8D%A2%E6%AC%A1%E6%95%B0.md,42.7%,困难,47 -2367,2300-2399,2367. 算术三元组的数目,算术三元组的数目,https://leetcode.cn/problems/number-of-arithmetic-triplets/,number-of-arithmetic-triplets,数组、哈希表、双指针、枚举,https://algo.itcharge.cn/Solutions/2300-2399/number-of-arithmetic-triplets/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2367.%20%E7%AE%97%E6%9C%AF%E4%B8%89%E5%85%83%E7%BB%84%E7%9A%84%E6%95%B0%E7%9B%AE.md,83.4%,简单,381 -2368,2300-2399,2368. 受限条件下可到达节点的数目,受限条件下可到达节点的数目,https://leetcode.cn/problems/reachable-nodes-with-restrictions/,reachable-nodes-with-restrictions,树、深度优先搜索、广度优先搜索、图、数组、哈希表,https://algo.itcharge.cn/Solutions/2300-2399/reachable-nodes-with-restrictions/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2368.%20%E5%8F%97%E9%99%90%E6%9D%A1%E4%BB%B6%E4%B8%8B%E5%8F%AF%E5%88%B0%E8%BE%BE%E8%8A%82%E7%82%B9%E7%9A%84%E6%95%B0%E7%9B%AE.md,46.1%,中等,148 -2369,2300-2399,2369. 检查数组是否存在有效划分,检查数组是否存在有效划分,https://leetcode.cn/problems/check-if-there-is-a-valid-partition-for-the-array/,check-if-there-is-a-valid-partition-for-the-array,数组、动态规划,https://algo.itcharge.cn/Solutions/2300-2399/check-if-there-is-a-valid-partition-for-the-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2369.%20%E6%A3%80%E6%9F%A5%E6%95%B0%E7%BB%84%E6%98%AF%E5%90%A6%E5%AD%98%E5%9C%A8%E6%9C%89%E6%95%88%E5%88%92%E5%88%86.md,38.4%,中等,115 -2370,2300-2399,2370. 最长理想子序列,最长理想子序列,https://leetcode.cn/problems/longest-ideal-subsequence/,longest-ideal-subsequence,哈希表、字符串、动态规划,https://algo.itcharge.cn/Solutions/2300-2399/longest-ideal-subsequence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2370.%20%E6%9C%80%E9%95%BF%E7%90%86%E6%83%B3%E5%AD%90%E5%BA%8F%E5%88%97.md,43.1%,中等,116 -2371,2300-2399,2371. 最小化网格中的最大值,最小化网格中的最大值,https://leetcode.cn/problems/minimize-maximum-value-in-a-grid/,minimize-maximum-value-in-a-grid,贪心、并查集、图、拓扑排序、数组、矩阵、排序,https://algo.itcharge.cn/Solutions/2300-2399/minimize-maximum-value-in-a-grid/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2371.%20%E6%9C%80%E5%B0%8F%E5%8C%96%E7%BD%91%E6%A0%BC%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md,74.1%,困难,11 -2372,2300-2399,2372. 计算每个销售人员的影响力,计算每个销售人员的影响力,https://leetcode.cn/problems/calculate-the-influence-of-each-salesperson/,calculate-the-influence-of-each-salesperson,数据库,https://algo.itcharge.cn/Solutions/2300-2399/calculate-the-influence-of-each-salesperson/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2372.%20%E8%AE%A1%E7%AE%97%E6%AF%8F%E4%B8%AA%E9%94%80%E5%94%AE%E4%BA%BA%E5%91%98%E7%9A%84%E5%BD%B1%E5%93%8D%E5%8A%9B.md,77.7%,中等,8 -2373,2300-2399,2373. 矩阵中的局部最大值,矩阵中的局部最大值,https://leetcode.cn/problems/largest-local-values-in-a-matrix/,largest-local-values-in-a-matrix,数组、矩阵,https://algo.itcharge.cn/Solutions/2300-2399/largest-local-values-in-a-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2373.%20%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E5%B1%80%E9%83%A8%E6%9C%80%E5%A4%A7%E5%80%BC.md,85.2%,简单,312 -2374,2300-2399,2374. 边积分最高的节点,边积分最高的节点,https://leetcode.cn/problems/node-with-highest-edge-score/,node-with-highest-edge-score,图、哈希表,https://algo.itcharge.cn/Solutions/2300-2399/node-with-highest-edge-score/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2374.%20%E8%BE%B9%E7%A7%AF%E5%88%86%E6%9C%80%E9%AB%98%E7%9A%84%E8%8A%82%E7%82%B9.md,42.3%,中等,105 -2375,2300-2399,2375. 根据模式串构造最小数字,根据模式串构造最小数字,https://leetcode.cn/problems/construct-smallest-number-from-di-string/,construct-smallest-number-from-di-string,栈、贪心、字符串、回溯,https://algo.itcharge.cn/Solutions/2300-2399/construct-smallest-number-from-di-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2375.%20%E6%A0%B9%E6%8D%AE%E6%A8%A1%E5%BC%8F%E4%B8%B2%E6%9E%84%E9%80%A0%E6%9C%80%E5%B0%8F%E6%95%B0%E5%AD%97.md,70.0%,中等,212 -2376,2300-2399,2376. 统计特殊整数,统计特殊整数,https://leetcode.cn/problems/count-special-integers/,count-special-integers,数学、动态规划,https://algo.itcharge.cn/Solutions/2300-2399/count-special-integers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2376.%20%E7%BB%9F%E8%AE%A1%E7%89%B9%E6%AE%8A%E6%95%B4%E6%95%B0.md,51.6%,困难,113 -2377,2300-2399,2377. 整理奥运表,整理奥运表,https://leetcode.cn/problems/sort-the-olympic-table/,sort-the-olympic-table,数据库,https://algo.itcharge.cn/Solutions/2300-2399/sort-the-olympic-table/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2377.%20%E6%95%B4%E7%90%86%E5%A5%A5%E8%BF%90%E8%A1%A8.md,80.1%,简单,9 -2378,2300-2399,2378. 选择边来最大化树的得分,选择边来最大化树的得分,https://leetcode.cn/problems/choose-edges-to-maximize-score-in-a-tree/,choose-edges-to-maximize-score-in-a-tree,树、深度优先搜索、动态规划,https://algo.itcharge.cn/Solutions/2300-2399/choose-edges-to-maximize-score-in-a-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2378.%20%E9%80%89%E6%8B%A9%E8%BE%B9%E6%9D%A5%E6%9C%80%E5%A4%A7%E5%8C%96%E6%A0%91%E7%9A%84%E5%BE%97%E5%88%86.md,68.4%,中等,8 -2379,2300-2399,2379. 得到 K 个黑块的最少涂色次数,得到 K 个黑块的最少涂色次数,https://leetcode.cn/problems/minimum-recolors-to-get-k-consecutive-black-blocks/,minimum-recolors-to-get-k-consecutive-black-blocks,字符串、滑动窗口,https://algo.itcharge.cn/Solutions/2300-2399/minimum-recolors-to-get-k-consecutive-black-blocks/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2379.%20%E5%BE%97%E5%88%B0%20K%20%E4%B8%AA%E9%BB%91%E5%9D%97%E7%9A%84%E6%9C%80%E5%B0%91%E6%B6%82%E8%89%B2%E6%AC%A1%E6%95%B0.md,61.8%,简单,429 -2380,2300-2399,2380. 二进制字符串重新安排顺序需要的时间,二进制字符串重新安排顺序需要的时间,https://leetcode.cn/problems/time-needed-to-rearrange-a-binary-string/,time-needed-to-rearrange-a-binary-string,字符串、动态规划、模拟,https://algo.itcharge.cn/Solutions/2300-2399/time-needed-to-rearrange-a-binary-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2380.%20%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%AD%97%E7%AC%A6%E4%B8%B2%E9%87%8D%E6%96%B0%E5%AE%89%E6%8E%92%E9%A1%BA%E5%BA%8F%E9%9C%80%E8%A6%81%E7%9A%84%E6%97%B6%E9%97%B4.md,56.1%,中等,73 -2381,2300-2399,2381. 字母移位 II,字母移位 II,https://leetcode.cn/problems/shifting-letters-ii/,shifting-letters-ii,数组、字符串、前缀和,https://algo.itcharge.cn/Solutions/2300-2399/shifting-letters-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2381.%20%E5%AD%97%E6%AF%8D%E7%A7%BB%E4%BD%8D%20II.md,36.8%,中等,100 -2382,2300-2399,2382. 删除操作后的最大子段和,删除操作后的最大子段和,https://leetcode.cn/problems/maximum-segment-sum-after-removals/,maximum-segment-sum-after-removals,并查集、数组、有序集合、前缀和,https://algo.itcharge.cn/Solutions/2300-2399/maximum-segment-sum-after-removals/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2382.%20%E5%88%A0%E9%99%A4%E6%93%8D%E4%BD%9C%E5%90%8E%E7%9A%84%E6%9C%80%E5%A4%A7%E5%AD%90%E6%AE%B5%E5%92%8C.md,56.3%,困难,94 -2383,2300-2399,2383. 赢得比赛需要的最少训练时长,赢得比赛需要的最少训练时长,https://leetcode.cn/problems/minimum-hours-of-training-to-win-a-competition/,minimum-hours-of-training-to-win-a-competition,贪心、数组,https://algo.itcharge.cn/Solutions/2300-2399/minimum-hours-of-training-to-win-a-competition/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2383.%20%E8%B5%A2%E5%BE%97%E6%AF%94%E8%B5%9B%E9%9C%80%E8%A6%81%E7%9A%84%E6%9C%80%E5%B0%91%E8%AE%AD%E7%BB%83%E6%97%B6%E9%95%BF.md,47.2%,简单,360 -2384,2300-2399,2384. 最大回文数字,最大回文数字,https://leetcode.cn/problems/largest-palindromic-number/,largest-palindromic-number,贪心、哈希表、字符串,https://algo.itcharge.cn/Solutions/2300-2399/largest-palindromic-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2384.%20%E6%9C%80%E5%A4%A7%E5%9B%9E%E6%96%87%E6%95%B0%E5%AD%97.md,31.1%,中等,150 -2385,2300-2399,2385. 感染二叉树需要的总时间,感染二叉树需要的总时间,https://leetcode.cn/problems/amount-of-time-for-binary-tree-to-be-infected/,amount-of-time-for-binary-tree-to-be-infected,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/2300-2399/amount-of-time-for-binary-tree-to-be-infected/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2385.%20%E6%84%9F%E6%9F%93%E4%BA%8C%E5%8F%89%E6%A0%91%E9%9C%80%E8%A6%81%E7%9A%84%E6%80%BB%E6%97%B6%E9%97%B4.md,46.2%,中等,157 -2386,2300-2399,2386. 找出数组的第 K 大和,找出数组的第 K 大和,https://leetcode.cn/problems/find-the-k-sum-of-an-array/,find-the-k-sum-of-an-array,数组、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/2300-2399/find-the-k-sum-of-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2386.%20%E6%89%BE%E5%87%BA%E6%95%B0%E7%BB%84%E7%9A%84%E7%AC%AC%20K%20%E5%A4%A7%E5%92%8C.md,42.3%,困难,51 -2387,2300-2399,2387. 行排序矩阵的中位数,行排序矩阵的中位数,https://leetcode.cn/problems/median-of-a-row-wise-sorted-matrix/,median-of-a-row-wise-sorted-matrix,数组、二分查找、矩阵,https://algo.itcharge.cn/Solutions/2300-2399/median-of-a-row-wise-sorted-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2387.%20%E8%A1%8C%E6%8E%92%E5%BA%8F%E7%9F%A9%E9%98%B5%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0.md,76.0%,中等,5 -2388,2300-2399,2388. 将表中的空值更改为前一个值,将表中的空值更改为前一个值,https://leetcode.cn/problems/change-null-values-in-a-table-to-the-previous-value/,change-null-values-in-a-table-to-the-previous-value,数据库,https://algo.itcharge.cn/Solutions/2300-2399/change-null-values-in-a-table-to-the-previous-value/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2388.%20%E5%B0%86%E8%A1%A8%E4%B8%AD%E7%9A%84%E7%A9%BA%E5%80%BC%E6%9B%B4%E6%94%B9%E4%B8%BA%E5%89%8D%E4%B8%80%E4%B8%AA%E5%80%BC.md,67.7%,中等,13 -2389,2300-2399,2389. 和有限的最长子序列,和有限的最长子序列,https://leetcode.cn/problems/longest-subsequence-with-limited-sum/,longest-subsequence-with-limited-sum,贪心、数组、二分查找、前缀和、排序,https://algo.itcharge.cn/Solutions/2300-2399/longest-subsequence-with-limited-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2389.%20%E5%92%8C%E6%9C%89%E9%99%90%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E5%BA%8F%E5%88%97.md,70.9%,简单,343 -2390,2300-2399,2390. 从字符串中移除星号,从字符串中移除星号,https://leetcode.cn/problems/removing-stars-from-a-string/,removing-stars-from-a-string,栈、字符串、模拟,https://algo.itcharge.cn/Solutions/2300-2399/removing-stars-from-a-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2390.%20%E4%BB%8E%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%A7%BB%E9%99%A4%E6%98%9F%E5%8F%B7.md,69.1%,中等,166 -2391,2300-2399,2391. 收集垃圾的最少总时间,收集垃圾的最少总时间,https://leetcode.cn/problems/minimum-amount-of-time-to-collect-garbage/,minimum-amount-of-time-to-collect-garbage,数组、字符串、前缀和,https://algo.itcharge.cn/Solutions/2300-2399/minimum-amount-of-time-to-collect-garbage/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2391.%20%E6%94%B6%E9%9B%86%E5%9E%83%E5%9C%BE%E7%9A%84%E6%9C%80%E5%B0%91%E6%80%BB%E6%97%B6%E9%97%B4.md,85.7%,中等,159 -2392,2300-2399,2392. 给定条件下构造矩阵,给定条件下构造矩阵,https://leetcode.cn/problems/build-a-matrix-with-conditions/,build-a-matrix-with-conditions,图、拓扑排序、数组、矩阵,https://algo.itcharge.cn/Solutions/2300-2399/build-a-matrix-with-conditions/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2392.%20%E7%BB%99%E5%AE%9A%E6%9D%A1%E4%BB%B6%E4%B8%8B%E6%9E%84%E9%80%A0%E7%9F%A9%E9%98%B5.md,55.7%,困难,94 -2393,2300-2399,2393. 严格递增的子数组个数,严格递增的子数组个数,https://leetcode.cn/problems/count-strictly-increasing-subarrays/,count-strictly-increasing-subarrays,数组、数学、动态规划,https://algo.itcharge.cn/Solutions/2300-2399/count-strictly-increasing-subarrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2393.%20%E4%B8%A5%E6%A0%BC%E9%80%92%E5%A2%9E%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84%E4%B8%AA%E6%95%B0.md,78.5%,中等,14 -2394,2300-2399,2394. 开除员工,开除员工,https://leetcode.cn/problems/employees-with-deductions/,employees-with-deductions,数据库,https://algo.itcharge.cn/Solutions/2300-2399/employees-with-deductions/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2394.%20%E5%BC%80%E9%99%A4%E5%91%98%E5%B7%A5.md,53.0%,中等,13 -2395,2300-2399,2395. 和相等的子数组,和相等的子数组,https://leetcode.cn/problems/find-subarrays-with-equal-sum/,find-subarrays-with-equal-sum,数组、哈希表,https://algo.itcharge.cn/Solutions/2300-2399/find-subarrays-with-equal-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2395.%20%E5%92%8C%E7%9B%B8%E7%AD%89%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md,76.3%,简单,237 -2396,2300-2399,2396. 严格回文的数字,严格回文的数字,https://leetcode.cn/problems/strictly-palindromic-number/,strictly-palindromic-number,脑筋急转弯、数学、双指针,https://algo.itcharge.cn/Solutions/2300-2399/strictly-palindromic-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2396.%20%E4%B8%A5%E6%A0%BC%E5%9B%9E%E6%96%87%E7%9A%84%E6%95%B0%E5%AD%97.md,87.9%,中等,115 -2397,2300-2399,2397. 被列覆盖的最多行数,被列覆盖的最多行数,https://leetcode.cn/problems/maximum-rows-covered-by-columns/,maximum-rows-covered-by-columns,位运算、数组、回溯、枚举、矩阵,https://algo.itcharge.cn/Solutions/2300-2399/maximum-rows-covered-by-columns/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2397.%20%E8%A2%AB%E5%88%97%E8%A6%86%E7%9B%96%E7%9A%84%E6%9C%80%E5%A4%9A%E8%A1%8C%E6%95%B0.md,54.7%,中等,103 -2398,2300-2399,2398. 预算内的最多机器人数目,预算内的最多机器人数目,https://leetcode.cn/problems/maximum-number-of-robots-within-budget/,maximum-number-of-robots-within-budget,队列、数组、二分查找、前缀和、滑动窗口、堆（优先队列）,https://algo.itcharge.cn/Solutions/2300-2399/maximum-number-of-robots-within-budget/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2398.%20%E9%A2%84%E7%AE%97%E5%86%85%E7%9A%84%E6%9C%80%E5%A4%9A%E6%9C%BA%E5%99%A8%E4%BA%BA%E6%95%B0%E7%9B%AE.md,34.4%,困难,85 -2399,2300-2399,2399. 检查相同字母间的距离,检查相同字母间的距离,https://leetcode.cn/problems/check-distances-between-same-letters/,check-distances-between-same-letters,数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/2300-2399/check-distances-between-same-letters/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2399.%20%E6%A3%80%E6%9F%A5%E7%9B%B8%E5%90%8C%E5%AD%97%E6%AF%8D%E9%97%B4%E7%9A%84%E8%B7%9D%E7%A6%BB.md,75.3%,简单,304 -2400,2400-2499,2400. 恰好移动 k 步到达某一位置的方法数目,恰好移动 k 步到达某一位置的方法数目,https://leetcode.cn/problems/number-of-ways-to-reach-a-position-after-exactly-k-steps/,number-of-ways-to-reach-a-position-after-exactly-k-steps,数学、动态规划、组合数学,https://algo.itcharge.cn/Solutions/2400-2499/number-of-ways-to-reach-a-position-after-exactly-k-steps/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2400.%20%E6%81%B0%E5%A5%BD%E7%A7%BB%E5%8A%A8%20k%20%E6%AD%A5%E5%88%B0%E8%BE%BE%E6%9F%90%E4%B8%80%E4%BD%8D%E7%BD%AE%E7%9A%84%E6%96%B9%E6%B3%95%E6%95%B0%E7%9B%AE.md,32.7%,中等,156 -2401,2400-2499,2401. 最长优雅子数组,最长优雅子数组,https://leetcode.cn/problems/longest-nice-subarray/,longest-nice-subarray,位运算、数组、滑动窗口,https://algo.itcharge.cn/Solutions/2400-2499/longest-nice-subarray/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2401.%20%E6%9C%80%E9%95%BF%E4%BC%98%E9%9B%85%E5%AD%90%E6%95%B0%E7%BB%84.md,49.6%,中等,159 -2402,2400-2499,2402. 会议室 III,会议室 III,https://leetcode.cn/problems/meeting-rooms-iii/,meeting-rooms-iii,数组、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/2400-2499/meeting-rooms-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2402.%20%E4%BC%9A%E8%AE%AE%E5%AE%A4%20III.md,32.6%,困难,119 -2403,2400-2499,2403. 杀死所有怪物的最短时间,杀死所有怪物的最短时间,https://leetcode.cn/problems/minimum-time-to-kill-all-monsters/,minimum-time-to-kill-all-monsters,位运算、数组、动态规划、状态压缩,https://algo.itcharge.cn/Solutions/2400-2499/minimum-time-to-kill-all-monsters/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2403.%20%E6%9D%80%E6%AD%BB%E6%89%80%E6%9C%89%E6%80%AA%E7%89%A9%E7%9A%84%E6%9C%80%E7%9F%AD%E6%97%B6%E9%97%B4.md,70.2%,困难,17 -2404,2400-2499,2404. 出现最频繁的偶数元素,出现最频繁的偶数元素,https://leetcode.cn/problems/most-frequent-even-element/,most-frequent-even-element,数组、哈希表、计数,https://algo.itcharge.cn/Solutions/2400-2499/most-frequent-even-element/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2404.%20%E5%87%BA%E7%8E%B0%E6%9C%80%E9%A2%91%E7%B9%81%E7%9A%84%E5%81%B6%E6%95%B0%E5%85%83%E7%B4%A0.md,58.3%,简单,345 -2405,2400-2499,2405. 子字符串的最优划分,子字符串的最优划分,https://leetcode.cn/problems/optimal-partition-of-string/,optimal-partition-of-string,贪心、哈希表、字符串,https://algo.itcharge.cn/Solutions/2400-2499/optimal-partition-of-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2405.%20%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%9C%80%E4%BC%98%E5%88%92%E5%88%86.md,74.9%,中等,127 -2406,2400-2499,2406. 将区间分为最少组数,将区间分为最少组数,https://leetcode.cn/problems/divide-intervals-into-minimum-number-of-groups/,divide-intervals-into-minimum-number-of-groups,贪心、数组、双指针、前缀和、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/2400-2499/divide-intervals-into-minimum-number-of-groups/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2406.%20%E5%B0%86%E5%8C%BA%E9%97%B4%E5%88%86%E4%B8%BA%E6%9C%80%E5%B0%91%E7%BB%84%E6%95%B0.md,44.6%,中等,128 -2407,2400-2499,2407. 最长递增子序列 II,最长递增子序列 II,https://leetcode.cn/problems/longest-increasing-subsequence-ii/,longest-increasing-subsequence-ii,树状数组、线段树、队列、数组、分治、动态规划、单调队列,https://algo.itcharge.cn/Solutions/2400-2499/longest-increasing-subsequence-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2407.%20%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E5%AD%90%E5%BA%8F%E5%88%97%20II.md,30.5%,困难,93 -2408,2400-2499,2408. 设计 SQL,设计 SQL,https://leetcode.cn/problems/design-sql/,design-sql,设计、数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/2400-2499/design-sql/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2408.%20%E8%AE%BE%E8%AE%A1%20SQL.md,63.9%,中等,7 -2409,2400-2499,2409. 统计共同度过的日子数,统计共同度过的日子数,https://leetcode.cn/problems/count-days-spent-together/,count-days-spent-together,数学、字符串,https://algo.itcharge.cn/Solutions/2400-2499/count-days-spent-together/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2409.%20%E7%BB%9F%E8%AE%A1%E5%85%B1%E5%90%8C%E5%BA%A6%E8%BF%87%E7%9A%84%E6%97%A5%E5%AD%90%E6%95%B0.md,55.9%,简单,316 -2410,2400-2499,2410. 运动员和训练师的最大匹配数,运动员和训练师的最大匹配数,https://leetcode.cn/problems/maximum-matching-of-players-with-trainers/,maximum-matching-of-players-with-trainers,贪心、数组、双指针、排序,https://algo.itcharge.cn/Solutions/2400-2499/maximum-matching-of-players-with-trainers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2410.%20%E8%BF%90%E5%8A%A8%E5%91%98%E5%92%8C%E8%AE%AD%E7%BB%83%E5%B8%88%E7%9A%84%E6%9C%80%E5%A4%A7%E5%8C%B9%E9%85%8D%E6%95%B0.md,64.7%,中等,81 -2411,2400-2499,2411. 按位或最大的最小子数组长度,按位或最大的最小子数组长度,https://leetcode.cn/problems/smallest-subarrays-with-maximum-bitwise-or/,smallest-subarrays-with-maximum-bitwise-or,位运算、数组、二分查找、滑动窗口,https://algo.itcharge.cn/Solutions/2400-2499/smallest-subarrays-with-maximum-bitwise-or/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2411.%20%E6%8C%89%E4%BD%8D%E6%88%96%E6%9C%80%E5%A4%A7%E7%9A%84%E6%9C%80%E5%B0%8F%E5%AD%90%E6%95%B0%E7%BB%84%E9%95%BF%E5%BA%A6.md,43.2%,中等,63 -2412,2400-2499,2412. 完成所有交易的初始最少钱数,完成所有交易的初始最少钱数,https://leetcode.cn/problems/minimum-money-required-before-transactions/,minimum-money-required-before-transactions,贪心、数组、排序,https://algo.itcharge.cn/Solutions/2400-2499/minimum-money-required-before-transactions/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2412.%20%E5%AE%8C%E6%88%90%E6%89%80%E6%9C%89%E4%BA%A4%E6%98%93%E7%9A%84%E5%88%9D%E5%A7%8B%E6%9C%80%E5%B0%91%E9%92%B1%E6%95%B0.md,48.2%,困难,62 -2413,2400-2499,2413. 最小偶倍数,最小偶倍数,https://leetcode.cn/problems/smallest-even-multiple/,smallest-even-multiple,数学、数论,https://algo.itcharge.cn/Solutions/2400-2499/smallest-even-multiple/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2413.%20%E6%9C%80%E5%B0%8F%E5%81%B6%E5%80%8D%E6%95%B0.md,87.6%,简单,291 -2414,2400-2499,2414. 最长的字母序连续子字符串的长度,最长的字母序连续子字符串的长度,https://leetcode.cn/problems/length-of-the-longest-alphabetical-continuous-substring/,length-of-the-longest-alphabetical-continuous-substring,字符串,https://algo.itcharge.cn/Solutions/2400-2499/length-of-the-longest-alphabetical-continuous-substring/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2414.%20%E6%9C%80%E9%95%BF%E7%9A%84%E5%AD%97%E6%AF%8D%E5%BA%8F%E8%BF%9E%E7%BB%AD%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E9%95%BF%E5%BA%A6.md,60.4%,中等,122 -2415,2400-2499,2415. 反转二叉树的奇数层,反转二叉树的奇数层,https://leetcode.cn/problems/reverse-odd-levels-of-binary-tree/,reverse-odd-levels-of-binary-tree,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/2400-2499/reverse-odd-levels-of-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2415.%20%E5%8F%8D%E8%BD%AC%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%A5%87%E6%95%B0%E5%B1%82.md,70.0%,中等,139 -2416,2400-2499,2416. 字符串的前缀分数和,字符串的前缀分数和,https://leetcode.cn/problems/sum-of-prefix-scores-of-strings/,sum-of-prefix-scores-of-strings,字典树、数组、字符串、计数,https://algo.itcharge.cn/Solutions/2400-2499/sum-of-prefix-scores-of-strings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2416.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E5%89%8D%E7%BC%80%E5%88%86%E6%95%B0%E5%92%8C.md,40.5%,困难,124 -2417,2400-2499,2417. 最近的公平整数,最近的公平整数,https://leetcode.cn/problems/closest-fair-integer/,closest-fair-integer,数学、枚举,https://algo.itcharge.cn/Solutions/2400-2499/closest-fair-integer/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2417.%20%E6%9C%80%E8%BF%91%E7%9A%84%E5%85%AC%E5%B9%B3%E6%95%B4%E6%95%B0.md,45.2%,中等,9 -2418,2400-2499,2418. 按身高排序,按身高排序,https://leetcode.cn/problems/sort-the-people/,sort-the-people,数组、哈希表、字符串、排序,https://algo.itcharge.cn/Solutions/2400-2499/sort-the-people/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2418.%20%E6%8C%89%E8%BA%AB%E9%AB%98%E6%8E%92%E5%BA%8F.md,79.4%,简单,373 -2419,2400-2499,2419. 按位与最大的最长子数组,按位与最大的最长子数组,https://leetcode.cn/problems/longest-subarray-with-maximum-bitwise-and/,longest-subarray-with-maximum-bitwise-and,位运算、脑筋急转弯、数组,https://algo.itcharge.cn/Solutions/2400-2499/longest-subarray-with-maximum-bitwise-and/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2419.%20%E6%8C%89%E4%BD%8D%E4%B8%8E%E6%9C%80%E5%A4%A7%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E6%95%B0%E7%BB%84.md,42.5%,中等,107 -2420,2400-2499,2420. 找到所有好下标,找到所有好下标,https://leetcode.cn/problems/find-all-good-indices/,find-all-good-indices,数组、动态规划、前缀和,https://algo.itcharge.cn/Solutions/2400-2499/find-all-good-indices/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2420.%20%E6%89%BE%E5%88%B0%E6%89%80%E6%9C%89%E5%A5%BD%E4%B8%8B%E6%A0%87.md,31.4%,中等,140 -2421,2400-2499,2421. 好路径的数目,好路径的数目,https://leetcode.cn/problems/number-of-good-paths/,number-of-good-paths,树、并查集、图、数组,https://algo.itcharge.cn/Solutions/2400-2499/number-of-good-paths/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2421.%20%E5%A5%BD%E8%B7%AF%E5%BE%84%E7%9A%84%E6%95%B0%E7%9B%AE.md,42.7%,困难,52 -2422,2400-2499,2422. 使用合并操作将数组转换为回文序列,使用合并操作将数组转换为回文序列,https://leetcode.cn/problems/merge-operations-to-turn-array-into-a-palindrome/,merge-operations-to-turn-array-into-a-palindrome,贪心、数组、双指针,https://algo.itcharge.cn/Solutions/2400-2499/merge-operations-to-turn-array-into-a-palindrome/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2422.%20%E4%BD%BF%E7%94%A8%E5%90%88%E5%B9%B6%E6%93%8D%E4%BD%9C%E5%B0%86%E6%95%B0%E7%BB%84%E8%BD%AC%E6%8D%A2%E4%B8%BA%E5%9B%9E%E6%96%87%E5%BA%8F%E5%88%97.md,71.5%,中等,11 -2423,2400-2499,2423. 删除字符使频率相同,删除字符使频率相同,https://leetcode.cn/problems/remove-letter-to-equalize-frequency/,remove-letter-to-equalize-frequency,哈希表、字符串、计数,https://algo.itcharge.cn/Solutions/2400-2499/remove-letter-to-equalize-frequency/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2423.%20%E5%88%A0%E9%99%A4%E5%AD%97%E7%AC%A6%E4%BD%BF%E9%A2%91%E7%8E%87%E7%9B%B8%E5%90%8C.md,25.2%,简单,270 -2424,2400-2499,2424. 最长上传前缀,最长上传前缀,https://leetcode.cn/problems/longest-uploaded-prefix/,longest-uploaded-prefix,并查集、设计、树状数组、线段树、二分查找、有序集合、堆（优先队列）,https://algo.itcharge.cn/Solutions/2400-2499/longest-uploaded-prefix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2424.%20%E6%9C%80%E9%95%BF%E4%B8%8A%E4%BC%A0%E5%89%8D%E7%BC%80.md,56.1%,中等,84 -2425,2400-2499,2425. 所有数对的异或和,所有数对的异或和,https://leetcode.cn/problems/bitwise-xor-of-all-pairings/,bitwise-xor-of-all-pairings,位运算、脑筋急转弯、数组,https://algo.itcharge.cn/Solutions/2400-2499/bitwise-xor-of-all-pairings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2425.%20%E6%89%80%E6%9C%89%E6%95%B0%E5%AF%B9%E7%9A%84%E5%BC%82%E6%88%96%E5%92%8C.md,64.8%,中等,71 -2426,2400-2499,2426. 满足不等式的数对数目,满足不等式的数对数目,https://leetcode.cn/problems/number-of-pairs-satisfying-inequality/,number-of-pairs-satisfying-inequality,树状数组、线段树、数组、二分查找、分治、有序集合、归并排序,https://algo.itcharge.cn/Solutions/2400-2499/number-of-pairs-satisfying-inequality/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2426.%20%E6%BB%A1%E8%B6%B3%E4%B8%8D%E7%AD%89%E5%BC%8F%E7%9A%84%E6%95%B0%E5%AF%B9%E6%95%B0%E7%9B%AE.md,46.0%,困难,82 -2427,2400-2499,2427. 公因子的数目,公因子的数目,https://leetcode.cn/problems/number-of-common-factors/,number-of-common-factors,数学、枚举、数论,https://algo.itcharge.cn/Solutions/2400-2499/number-of-common-factors/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2427.%20%E5%85%AC%E5%9B%A0%E5%AD%90%E7%9A%84%E6%95%B0%E7%9B%AE.md,81.7%,简单,237 -2428,2400-2499,2428. 沙漏的最大总和,沙漏的最大总和,https://leetcode.cn/problems/maximum-sum-of-an-hourglass/,maximum-sum-of-an-hourglass,数组、矩阵、前缀和,https://algo.itcharge.cn/Solutions/2400-2499/maximum-sum-of-an-hourglass/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2428.%20%E6%B2%99%E6%BC%8F%E7%9A%84%E6%9C%80%E5%A4%A7%E6%80%BB%E5%92%8C.md,74.7%,中等,96 -2429,2400-2499,2429. 最小 XOR,最小 XOR,https://leetcode.cn/problems/minimize-xor/,minimize-xor,贪心、位运算,https://algo.itcharge.cn/Solutions/2400-2499/minimize-xor/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2429.%20%E6%9C%80%E5%B0%8F%20XOR.md,44.5%,中等,110 -2430,2400-2499,2430. 对字母串可执行的最大删除数,对字母串可执行的最大删除数,https://leetcode.cn/problems/maximum-deletions-on-a-string/,maximum-deletions-on-a-string,字符串、动态规划、字符串匹配、哈希函数、滚动哈希,https://algo.itcharge.cn/Solutions/2400-2499/maximum-deletions-on-a-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2430.%20%E5%AF%B9%E5%AD%97%E6%AF%8D%E4%B8%B2%E5%8F%AF%E6%89%A7%E8%A1%8C%E7%9A%84%E6%9C%80%E5%A4%A7%E5%88%A0%E9%99%A4%E6%95%B0.md,47.7%,困难,105 -2431,2400-2499,2431. 最大限度地提高购买水果的口味,最大限度地提高购买水果的口味,https://leetcode.cn/problems/maximize-total-tastiness-of-purchased-fruits/,maximize-total-tastiness-of-purchased-fruits,数组、动态规划,https://algo.itcharge.cn/Solutions/2400-2499/maximize-total-tastiness-of-purchased-fruits/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2431.%20%E6%9C%80%E5%A4%A7%E9%99%90%E5%BA%A6%E5%9C%B0%E6%8F%90%E9%AB%98%E8%B4%AD%E4%B9%B0%E6%B0%B4%E6%9E%9C%E7%9A%84%E5%8F%A3%E5%91%B3.md,58.8%,中等,12 -2432,2400-2499,2432. 处理用时最长的那个任务的员工,处理用时最长的那个任务的员工,https://leetcode.cn/problems/the-employee-that-worked-on-the-longest-task/,the-employee-that-worked-on-the-longest-task,数组,https://algo.itcharge.cn/Solutions/2400-2499/the-employee-that-worked-on-the-longest-task/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2432.%20%E5%A4%84%E7%90%86%E7%94%A8%E6%97%B6%E6%9C%80%E9%95%BF%E7%9A%84%E9%82%A3%E4%B8%AA%E4%BB%BB%E5%8A%A1%E7%9A%84%E5%91%98%E5%B7%A5.md,55.3%,简单,227 -2433,2400-2499,2433. 找出前缀异或的原始数组,找出前缀异或的原始数组,https://leetcode.cn/problems/find-the-original-array-of-prefix-xor/,find-the-original-array-of-prefix-xor,位运算、数组,https://algo.itcharge.cn/Solutions/2400-2499/find-the-original-array-of-prefix-xor/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2433.%20%E6%89%BE%E5%87%BA%E5%89%8D%E7%BC%80%E5%BC%82%E6%88%96%E7%9A%84%E5%8E%9F%E5%A7%8B%E6%95%B0%E7%BB%84.md,84.8%,中等,86 -2434,2400-2499,2434. 使用机器人打印字典序最小的字符串,使用机器人打印字典序最小的字符串,https://leetcode.cn/problems/using-a-robot-to-print-the-lexicographically-smallest-string/,using-a-robot-to-print-the-lexicographically-smallest-string,栈、贪心、哈希表、字符串,https://algo.itcharge.cn/Solutions/2400-2499/using-a-robot-to-print-the-lexicographically-smallest-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2434.%20%E4%BD%BF%E7%94%A8%E6%9C%BA%E5%99%A8%E4%BA%BA%E6%89%93%E5%8D%B0%E5%AD%97%E5%85%B8%E5%BA%8F%E6%9C%80%E5%B0%8F%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2.md,42.1%,中等,114 -2435,2400-2499,2435. 矩阵中和能被 K 整除的路径,矩阵中和能被 K 整除的路径,https://leetcode.cn/problems/paths-in-matrix-whose-sum-is-divisible-by-k/,paths-in-matrix-whose-sum-is-divisible-by-k,数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/2400-2499/paths-in-matrix-whose-sum-is-divisible-by-k/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2435.%20%E7%9F%A9%E9%98%B5%E4%B8%AD%E5%92%8C%E8%83%BD%E8%A2%AB%20K%20%E6%95%B4%E9%99%A4%E7%9A%84%E8%B7%AF%E5%BE%84.md,51.5%,困难,97 -2436,2400-2499,2436. 使子数组最大公约数大于一的最小分割数,使子数组最大公约数大于一的最小分割数,https://leetcode.cn/problems/minimum-split-into-subarrays-with-gcd-greater-than-one/,minimum-split-into-subarrays-with-gcd-greater-than-one,贪心、数组、数学、动态规划、数论,https://algo.itcharge.cn/Solutions/2400-2499/minimum-split-into-subarrays-with-gcd-greater-than-one/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2436.%20%E4%BD%BF%E5%AD%90%E6%95%B0%E7%BB%84%E6%9C%80%E5%A4%A7%E5%85%AC%E7%BA%A6%E6%95%B0%E5%A4%A7%E4%BA%8E%E4%B8%80%E7%9A%84%E6%9C%80%E5%B0%8F%E5%88%86%E5%89%B2%E6%95%B0.md,76.8%,中等,11 -2437,2400-2499,2437. 有效时间的数目,有效时间的数目,https://leetcode.cn/problems/number-of-valid-clock-times/,number-of-valid-clock-times,字符串、枚举,https://algo.itcharge.cn/Solutions/2400-2499/number-of-valid-clock-times/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2437.%20%E6%9C%89%E6%95%88%E6%97%B6%E9%97%B4%E7%9A%84%E6%95%B0%E7%9B%AE.md,50.5%,简单,285 -2438,2400-2499,2438. 二的幂数组中查询范围内的乘积,二的幂数组中查询范围内的乘积,https://leetcode.cn/problems/range-product-queries-of-powers/,range-product-queries-of-powers,位运算、数组、前缀和,https://algo.itcharge.cn/Solutions/2400-2499/range-product-queries-of-powers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2438.%20%E4%BA%8C%E7%9A%84%E5%B9%82%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9F%A5%E8%AF%A2%E8%8C%83%E5%9B%B4%E5%86%85%E7%9A%84%E4%B9%98%E7%A7%AF.md,41.2%,中等,83 -2439,2400-2499,2439. 最小化数组中的最大值,最小化数组中的最大值,https://leetcode.cn/problems/minimize-maximum-of-array/,minimize-maximum-of-array,贪心、数组、二分查找、动态规划、前缀和,https://algo.itcharge.cn/Solutions/2400-2499/minimize-maximum-of-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2439.%20%E6%9C%80%E5%B0%8F%E5%8C%96%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md,39.1%,中等,120 -2440,2400-2499,2440. 创建价值相同的连通块,创建价值相同的连通块,https://leetcode.cn/problems/create-components-with-same-value/,create-components-with-same-value,树、深度优先搜索、数组、数学、枚举,https://algo.itcharge.cn/Solutions/2400-2499/create-components-with-same-value/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2440.%20%E5%88%9B%E5%BB%BA%E4%BB%B7%E5%80%BC%E7%9B%B8%E5%90%8C%E7%9A%84%E8%BF%9E%E9%80%9A%E5%9D%97.md,61.4%,困难,32 -2441,2400-2499,2441. 与对应负数同时存在的最大正整数,与对应负数同时存在的最大正整数,https://leetcode.cn/problems/largest-positive-integer-that-exists-with-its-negative/,largest-positive-integer-that-exists-with-its-negative,数组、哈希表、双指针、排序,https://algo.itcharge.cn/Solutions/2400-2499/largest-positive-integer-that-exists-with-its-negative/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2441.%20%E4%B8%8E%E5%AF%B9%E5%BA%94%E8%B4%9F%E6%95%B0%E5%90%8C%E6%97%B6%E5%AD%98%E5%9C%A8%E7%9A%84%E6%9C%80%E5%A4%A7%E6%AD%A3%E6%95%B4%E6%95%B0.md,72.5%,简单,272 -2442,2400-2499,2442. 反转之后不同整数的数目,反转之后不同整数的数目,https://leetcode.cn/problems/count-number-of-distinct-integers-after-reverse-operations/,count-number-of-distinct-integers-after-reverse-operations,数组、哈希表、数学,https://algo.itcharge.cn/Solutions/2400-2499/count-number-of-distinct-integers-after-reverse-operations/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2442.%20%E5%8F%8D%E8%BD%AC%E4%B9%8B%E5%90%8E%E4%B8%8D%E5%90%8C%E6%95%B4%E6%95%B0%E7%9A%84%E6%95%B0%E7%9B%AE.md,75.1%,中等,93 -2443,2400-2499,2443. 反转之后的数字和,反转之后的数字和,https://leetcode.cn/problems/sum-of-number-and-its-reverse/,sum-of-number-and-its-reverse,数学、枚举,https://algo.itcharge.cn/Solutions/2400-2499/sum-of-number-and-its-reverse/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2443.%20%E5%8F%8D%E8%BD%AC%E4%B9%8B%E5%90%8E%E7%9A%84%E6%95%B0%E5%AD%97%E5%92%8C.md,46.4%,中等,78 -2444,2400-2499,2444. 统计定界子数组的数目,统计定界子数组的数目,https://leetcode.cn/problems/count-subarrays-with-fixed-bounds/,count-subarrays-with-fixed-bounds,队列、数组、滑动窗口、单调队列,https://algo.itcharge.cn/Solutions/2400-2499/count-subarrays-with-fixed-bounds/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2444.%20%E7%BB%9F%E8%AE%A1%E5%AE%9A%E7%95%8C%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%95%B0%E7%9B%AE.md,44.4%,困难,99 -2445,2400-2499,2445. 值为 1 的节点数,值为 1 的节点数,https://leetcode.cn/problems/number-of-nodes-with-value-one/,number-of-nodes-with-value-one,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/2400-2499/number-of-nodes-with-value-one/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2445.%20%E5%80%BC%E4%B8%BA%201%20%E7%9A%84%E8%8A%82%E7%82%B9%E6%95%B0.md,78.2%,中等,15 -2446,2400-2499,2446. 判断两个事件是否存在冲突,判断两个事件是否存在冲突,https://leetcode.cn/problems/determine-if-two-events-have-conflict/,determine-if-two-events-have-conflict,数组、字符串,https://algo.itcharge.cn/Solutions/2400-2499/determine-if-two-events-have-conflict/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2446.%20%E5%88%A4%E6%96%AD%E4%B8%A4%E4%B8%AA%E4%BA%8B%E4%BB%B6%E6%98%AF%E5%90%A6%E5%AD%98%E5%9C%A8%E5%86%B2%E7%AA%81.md,63.5%,简单,213 -2447,2400-2499,2447. 最大公因数等于 K 的子数组数目,最大公因数等于 K 的子数组数目,https://leetcode.cn/problems/number-of-subarrays-with-gcd-equal-to-k/,number-of-subarrays-with-gcd-equal-to-k,数组、数学、数论,https://algo.itcharge.cn/Solutions/2400-2499/number-of-subarrays-with-gcd-equal-to-k/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2447.%20%E6%9C%80%E5%A4%A7%E5%85%AC%E5%9B%A0%E6%95%B0%E7%AD%89%E4%BA%8E%20K%20%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84%E6%95%B0%E7%9B%AE.md,41.2%,中等,65 -2448,2400-2499,2448. 使数组相等的最小开销,使数组相等的最小开销,https://leetcode.cn/problems/minimum-cost-to-make-array-equal/,minimum-cost-to-make-array-equal,贪心、数组、二分查找、前缀和、排序,https://algo.itcharge.cn/Solutions/2400-2499/minimum-cost-to-make-array-equal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2448.%20%E4%BD%BF%E6%95%B0%E7%BB%84%E7%9B%B8%E7%AD%89%E7%9A%84%E6%9C%80%E5%B0%8F%E5%BC%80%E9%94%80.md,36.1%,困难,80 -2449,2400-2499,2449. 使数组相似的最少操作次数,使数组相似的最少操作次数,https://leetcode.cn/problems/minimum-number-of-operations-to-make-arrays-similar/,minimum-number-of-operations-to-make-arrays-similar,贪心、数组、排序,https://algo.itcharge.cn/Solutions/2400-2499/minimum-number-of-operations-to-make-arrays-similar/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2449.%20%E4%BD%BF%E6%95%B0%E7%BB%84%E7%9B%B8%E4%BC%BC%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0.md,65.5%,困难,48 -2450,2400-2499,2450. 应用操作后不同二进制字符串的数量,应用操作后不同二进制字符串的数量,https://leetcode.cn/problems/number-of-distinct-binary-strings-after-applying-operations/,number-of-distinct-binary-strings-after-applying-operations,数学、字符串,https://algo.itcharge.cn/Solutions/2400-2499/number-of-distinct-binary-strings-after-applying-operations/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2450.%20%E5%BA%94%E7%94%A8%E6%93%8D%E4%BD%9C%E5%90%8E%E4%B8%8D%E5%90%8C%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%95%B0%E9%87%8F.md,75.5%,中等,8 -2451,2400-2499,2451. 差值数组不同的字符串,差值数组不同的字符串,https://leetcode.cn/problems/odd-string-difference/,odd-string-difference,数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/2400-2499/odd-string-difference/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2451.%20%E5%B7%AE%E5%80%BC%E6%95%B0%E7%BB%84%E4%B8%8D%E5%90%8C%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2.md,66.3%,简单,239 -2452,2400-2499,2452. 距离字典两次编辑以内的单词,距离字典两次编辑以内的单词,https://leetcode.cn/problems/words-within-two-edits-of-dictionary/,words-within-two-edits-of-dictionary,数组、字符串,https://algo.itcharge.cn/Solutions/2400-2499/words-within-two-edits-of-dictionary/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2452.%20%E8%B7%9D%E7%A6%BB%E5%AD%97%E5%85%B8%E4%B8%A4%E6%AC%A1%E7%BC%96%E8%BE%91%E4%BB%A5%E5%86%85%E7%9A%84%E5%8D%95%E8%AF%8D.md,65.1%,中等,43 -2453,2400-2499,2453. 摧毁一系列目标,摧毁一系列目标,https://leetcode.cn/problems/destroy-sequential-targets/,destroy-sequential-targets,数组、哈希表、计数,https://algo.itcharge.cn/Solutions/2400-2499/destroy-sequential-targets/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2453.%20%E6%91%A7%E6%AF%81%E4%B8%80%E7%B3%BB%E5%88%97%E7%9B%AE%E6%A0%87.md,35.5%,中等,69 -2454,2400-2499,2454. 下一个更大元素 IV,下一个更大元素 IV,https://leetcode.cn/problems/next-greater-element-iv/,next-greater-element-iv,栈、数组、二分查找、排序、单调栈、堆（优先队列）,https://algo.itcharge.cn/Solutions/2400-2499/next-greater-element-iv/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2454.%20%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%9B%B4%E5%A4%A7%E5%85%83%E7%B4%A0%20IV.md,49.0%,困难,82 -2455,2400-2499,2455. 可被三整除的偶数的平均值,可被三整除的偶数的平均值,https://leetcode.cn/problems/average-value-of-even-numbers-that-are-divisible-by-three/,average-value-of-even-numbers-that-are-divisible-by-three,数组、数学,https://algo.itcharge.cn/Solutions/2400-2499/average-value-of-even-numbers-that-are-divisible-by-three/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2455.%20%E5%8F%AF%E8%A2%AB%E4%B8%89%E6%95%B4%E9%99%A4%E7%9A%84%E5%81%B6%E6%95%B0%E7%9A%84%E5%B9%B3%E5%9D%87%E5%80%BC.md,63.6%,简单,177 -2456,2400-2499,2456. 最流行的视频创作者,最流行的视频创作者,https://leetcode.cn/problems/most-popular-video-creator/,most-popular-video-creator,数组、哈希表、字符串、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/2400-2499/most-popular-video-creator/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2456.%20%E6%9C%80%E6%B5%81%E8%A1%8C%E7%9A%84%E8%A7%86%E9%A2%91%E5%88%9B%E4%BD%9C%E8%80%85.md,38.3%,中等,119 -2457,2400-2499,2457. 美丽整数的最小增量,美丽整数的最小增量,https://leetcode.cn/problems/minimum-addition-to-make-integer-beautiful/,minimum-addition-to-make-integer-beautiful,贪心、数学,https://algo.itcharge.cn/Solutions/2400-2499/minimum-addition-to-make-integer-beautiful/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2457.%20%E7%BE%8E%E4%B8%BD%E6%95%B4%E6%95%B0%E7%9A%84%E6%9C%80%E5%B0%8F%E5%A2%9E%E9%87%8F.md,39.5%,中等,121 -2458,2400-2499,2458. 移除子树后的二叉树高度,移除子树后的二叉树高度,https://leetcode.cn/problems/height-of-binary-tree-after-subtree-removal-queries/,height-of-binary-tree-after-subtree-removal-queries,树、深度优先搜索、广度优先搜索、数组、二叉树,https://algo.itcharge.cn/Solutions/2400-2499/height-of-binary-tree-after-subtree-removal-queries/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2458.%20%E7%A7%BB%E9%99%A4%E5%AD%90%E6%A0%91%E5%90%8E%E7%9A%84%E4%BA%8C%E5%8F%89%E6%A0%91%E9%AB%98%E5%BA%A6.md,41.1%,困难,81 -2459,2400-2499,2459. 通过移动项目到空白区域来排序数组,通过移动项目到空白区域来排序数组,https://leetcode.cn/problems/sort-array-by-moving-items-to-empty-space/,sort-array-by-moving-items-to-empty-space,贪心、数组、排序,https://algo.itcharge.cn/Solutions/2400-2499/sort-array-by-moving-items-to-empty-space/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2459.%20%E9%80%9A%E8%BF%87%E7%A7%BB%E5%8A%A8%E9%A1%B9%E7%9B%AE%E5%88%B0%E7%A9%BA%E7%99%BD%E5%8C%BA%E5%9F%9F%E6%9D%A5%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md,60.1%,困难,3 -2460,2400-2499,2460. 对数组执行操作,对数组执行操作,https://leetcode.cn/problems/apply-operations-to-an-array/,apply-operations-to-an-array,数组、模拟,https://algo.itcharge.cn/Solutions/2400-2499/apply-operations-to-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2460.%20%E5%AF%B9%E6%95%B0%E7%BB%84%E6%89%A7%E8%A1%8C%E6%93%8D%E4%BD%9C.md,68.2%,简单,242 -2461,2400-2499,2461. 长度为 K 子数组中的最大和,长度为 K 子数组中的最大和,https://leetcode.cn/problems/maximum-sum-of-distinct-subarrays-with-length-k/,maximum-sum-of-distinct-subarrays-with-length-k,数组、哈希表、滑动窗口,https://algo.itcharge.cn/Solutions/2400-2499/maximum-sum-of-distinct-subarrays-with-length-k/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2461.%20%E9%95%BF%E5%BA%A6%E4%B8%BA%20K%20%E5%AD%90%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E5%92%8C.md,30.6%,中等,142 -2462,2400-2499,2462. 雇佣 K 位工人的总代价,雇佣 K 位工人的总代价,https://leetcode.cn/problems/total-cost-to-hire-k-workers/,total-cost-to-hire-k-workers,数组、双指针、模拟、堆（优先队列）,https://algo.itcharge.cn/Solutions/2400-2499/total-cost-to-hire-k-workers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2462.%20%E9%9B%87%E4%BD%A3%20K%20%E4%BD%8D%E5%B7%A5%E4%BA%BA%E7%9A%84%E6%80%BB%E4%BB%A3%E4%BB%B7.md,37.6%,中等,120 -2463,2400-2499,2463. 最小移动总距离,最小移动总距离,https://leetcode.cn/problems/minimum-total-distance-traveled/,minimum-total-distance-traveled,数组、动态规划、排序,https://algo.itcharge.cn/Solutions/2400-2499/minimum-total-distance-traveled/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2463.%20%E6%9C%80%E5%B0%8F%E7%A7%BB%E5%8A%A8%E6%80%BB%E8%B7%9D%E7%A6%BB.md,46.3%,困难,59 -2464,2400-2499,2464. 有效分割中的最少子数组数目,有效分割中的最少子数组数目,https://leetcode.cn/problems/minimum-subarrays-in-a-valid-split/,minimum-subarrays-in-a-valid-split,数组、数学、动态规划、数论,https://algo.itcharge.cn/Solutions/2400-2499/minimum-subarrays-in-a-valid-split/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2464.%20%E6%9C%89%E6%95%88%E5%88%86%E5%89%B2%E4%B8%AD%E7%9A%84%E6%9C%80%E5%B0%91%E5%AD%90%E6%95%B0%E7%BB%84%E6%95%B0%E7%9B%AE.md,63.7%,中等,7 -2465,2400-2499,2465. 不同的平均值数目,不同的平均值数目,https://leetcode.cn/problems/number-of-distinct-averages/,number-of-distinct-averages,数组、哈希表、双指针、排序,https://algo.itcharge.cn/Solutions/2400-2499/number-of-distinct-averages/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2465.%20%E4%B8%8D%E5%90%8C%E7%9A%84%E5%B9%B3%E5%9D%87%E5%80%BC%E6%95%B0%E7%9B%AE.md,72.5%,简单,217 -2466,2400-2499,2466. 统计构造好字符串的方案数,统计构造好字符串的方案数,https://leetcode.cn/problems/count-ways-to-build-good-strings/,count-ways-to-build-good-strings,动态规划,https://algo.itcharge.cn/Solutions/2400-2499/count-ways-to-build-good-strings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2466.%20%E7%BB%9F%E8%AE%A1%E6%9E%84%E9%80%A0%E5%A5%BD%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%96%B9%E6%A1%88%E6%95%B0.md,46.2%,中等,69 -2467,2400-2499,2467. 树上最大得分和路径,树上最大得分和路径,https://leetcode.cn/problems/most-profitable-path-in-a-tree/,most-profitable-path-in-a-tree,树、深度优先搜索、广度优先搜索、图、数组,https://algo.itcharge.cn/Solutions/2400-2499/most-profitable-path-in-a-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2467.%20%E6%A0%91%E4%B8%8A%E6%9C%80%E5%A4%A7%E5%BE%97%E5%88%86%E5%92%8C%E8%B7%AF%E5%BE%84.md,50.3%,中等,46 -2468,2400-2499,2468. 根据限制分割消息,根据限制分割消息,https://leetcode.cn/problems/split-message-based-on-limit/,split-message-based-on-limit,字符串、二分查找,https://algo.itcharge.cn/Solutions/2400-2499/split-message-based-on-limit/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2468.%20%E6%A0%B9%E6%8D%AE%E9%99%90%E5%88%B6%E5%88%86%E5%89%B2%E6%B6%88%E6%81%AF.md,44.4%,困难,53 -2469,2400-2499,2469. 温度转换,温度转换,https://leetcode.cn/problems/convert-the-temperature/,convert-the-temperature,数学,https://algo.itcharge.cn/Solutions/2400-2499/convert-the-temperature/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2469.%20%E6%B8%A9%E5%BA%A6%E8%BD%AC%E6%8D%A2.md,87.1%,简单,178 -2470,2400-2499,2470. 最小公倍数为 K 的子数组数目,最小公倍数为 K 的子数组数目,https://leetcode.cn/problems/number-of-subarrays-with-lcm-equal-to-k/,number-of-subarrays-with-lcm-equal-to-k,数组、数学、数论,https://algo.itcharge.cn/Solutions/2400-2499/number-of-subarrays-with-lcm-equal-to-k/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2470.%20%E6%9C%80%E5%B0%8F%E5%85%AC%E5%80%8D%E6%95%B0%E4%B8%BA%20K%20%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84%E6%95%B0%E7%9B%AE.md,40.7%,中等,88 -2471,2400-2499,2471. 逐层排序二叉树所需的最少操作数目,逐层排序二叉树所需的最少操作数目,https://leetcode.cn/problems/minimum-number-of-operations-to-sort-a-binary-tree-by-level/,minimum-number-of-operations-to-sort-a-binary-tree-by-level,树、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/2400-2499/minimum-number-of-operations-to-sort-a-binary-tree-by-level/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2471.%20%E9%80%90%E5%B1%82%E6%8E%92%E5%BA%8F%E4%BA%8C%E5%8F%89%E6%A0%91%E6%89%80%E9%9C%80%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%95%B0%E7%9B%AE.md,55.7%,中等,91 -2472,2400-2499,2472. 不重叠回文子字符串的最大数目,不重叠回文子字符串的最大数目,https://leetcode.cn/problems/maximum-number-of-non-overlapping-palindrome-substrings/,maximum-number-of-non-overlapping-palindrome-substrings,字符串、动态规划,https://algo.itcharge.cn/Solutions/2400-2499/maximum-number-of-non-overlapping-palindrome-substrings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2472.%20%E4%B8%8D%E9%87%8D%E5%8F%A0%E5%9B%9E%E6%96%87%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E7%9B%AE.md,43.9%,困难,85 -2473,2400-2499,2473. 购买苹果的最低成本,购买苹果的最低成本,https://leetcode.cn/problems/minimum-cost-to-buy-apples/,minimum-cost-to-buy-apples,图、数组、最短路、堆（优先队列）,https://algo.itcharge.cn/Solutions/2400-2499/minimum-cost-to-buy-apples/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2473.%20%E8%B4%AD%E4%B9%B0%E8%8B%B9%E6%9E%9C%E7%9A%84%E6%9C%80%E4%BD%8E%E6%88%90%E6%9C%AC.md,59.8%,中等,7 -2474,2400-2499,2474. 购买量严格增加的客户,购买量严格增加的客户,https://leetcode.cn/problems/customers-with-strictly-increasing-purchases/,customers-with-strictly-increasing-purchases,数据库,https://algo.itcharge.cn/Solutions/2400-2499/customers-with-strictly-increasing-purchases/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2474.%20%E8%B4%AD%E4%B9%B0%E9%87%8F%E4%B8%A5%E6%A0%BC%E5%A2%9E%E5%8A%A0%E7%9A%84%E5%AE%A2%E6%88%B7.md,49.6%,困难,14 -2475,2400-2499,2475. 数组中不等三元组的数目,数组中不等三元组的数目,https://leetcode.cn/problems/number-of-unequal-triplets-in-array/,number-of-unequal-triplets-in-array,数组、哈希表,https://algo.itcharge.cn/Solutions/2400-2499/number-of-unequal-triplets-in-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2475.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E4%B8%8D%E7%AD%89%E4%B8%89%E5%85%83%E7%BB%84%E7%9A%84%E6%95%B0%E7%9B%AE.md,77.8%,简单,162 -2476,2400-2499,2476. 二叉搜索树最近节点查询,二叉搜索树最近节点查询,https://leetcode.cn/problems/closest-nodes-queries-in-a-binary-search-tree/,closest-nodes-queries-in-a-binary-search-tree,树、深度优先搜索、数组、二分查找、二叉树,https://algo.itcharge.cn/Solutions/2400-2499/closest-nodes-queries-in-a-binary-search-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2476.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E6%9C%80%E8%BF%91%E8%8A%82%E7%82%B9%E6%9F%A5%E8%AF%A2.md,41.4%,中等,100 -2477,2400-2499,2477. 到达首都的最少油耗,到达首都的最少油耗,https://leetcode.cn/problems/minimum-fuel-cost-to-report-to-the-capital/,minimum-fuel-cost-to-report-to-the-capital,树、深度优先搜索、广度优先搜索、图,https://algo.itcharge.cn/Solutions/2400-2499/minimum-fuel-cost-to-report-to-the-capital/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2477.%20%E5%88%B0%E8%BE%BE%E9%A6%96%E9%83%BD%E7%9A%84%E6%9C%80%E5%B0%91%E6%B2%B9%E8%80%97.md,53.0%,中等,74 -2478,2400-2499,2478. 完美分割的方案数,完美分割的方案数,https://leetcode.cn/problems/number-of-beautiful-partitions/,number-of-beautiful-partitions,字符串、动态规划,https://algo.itcharge.cn/Solutions/2400-2499/number-of-beautiful-partitions/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2478.%20%E5%AE%8C%E7%BE%8E%E5%88%86%E5%89%B2%E7%9A%84%E6%96%B9%E6%A1%88%E6%95%B0.md,40.0%,困难,48 -2479,2400-2499,2479. 两个不重叠子树的最大异或值,两个不重叠子树的最大异或值,https://leetcode.cn/problems/maximum-xor-of-two-non-overlapping-subtrees/,maximum-xor-of-two-non-overlapping-subtrees,树、深度优先搜索、图、字典树,https://algo.itcharge.cn/Solutions/2400-2499/maximum-xor-of-two-non-overlapping-subtrees/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2479.%20%E4%B8%A4%E4%B8%AA%E4%B8%8D%E9%87%8D%E5%8F%A0%E5%AD%90%E6%A0%91%E7%9A%84%E6%9C%80%E5%A4%A7%E5%BC%82%E6%88%96%E5%80%BC.md,65.9%,困难,7 -2480,2400-2499,2480. 形成化学键,形成化学键,https://leetcode.cn/problems/form-a-chemical-bond/,form-a-chemical-bond,数据库,https://algo.itcharge.cn/Solutions/2400-2499/form-a-chemical-bond/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2480.%20%E5%BD%A2%E6%88%90%E5%8C%96%E5%AD%A6%E9%94%AE.md,84.2%,简单,5 -2481,2400-2499,2481. 分割圆的最少切割次数,分割圆的最少切割次数,https://leetcode.cn/problems/minimum-cuts-to-divide-a-circle/,minimum-cuts-to-divide-a-circle,几何、数学,https://algo.itcharge.cn/Solutions/2400-2499/minimum-cuts-to-divide-a-circle/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2481.%20%E5%88%86%E5%89%B2%E5%9C%86%E7%9A%84%E6%9C%80%E5%B0%91%E5%88%87%E5%89%B2%E6%AC%A1%E6%95%B0.md,58.8%,简单,127 -2482,2400-2499,2482. 行和列中一和零的差值,行和列中一和零的差值,https://leetcode.cn/problems/difference-between-ones-and-zeros-in-row-and-column/,difference-between-ones-and-zeros-in-row-and-column,数组、矩阵、模拟,https://algo.itcharge.cn/Solutions/2400-2499/difference-between-ones-and-zeros-in-row-and-column/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2482.%20%E8%A1%8C%E5%92%8C%E5%88%97%E4%B8%AD%E4%B8%80%E5%92%8C%E9%9B%B6%E7%9A%84%E5%B7%AE%E5%80%BC.md,82.5%,中等,60 -2483,2400-2499,2483. 商店的最少代价,商店的最少代价,https://leetcode.cn/problems/minimum-penalty-for-a-shop/,minimum-penalty-for-a-shop,字符串、前缀和,https://algo.itcharge.cn/Solutions/2400-2499/minimum-penalty-for-a-shop/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2483.%20%E5%95%86%E5%BA%97%E7%9A%84%E6%9C%80%E5%B0%91%E4%BB%A3%E4%BB%B7.md,63.3%,中等,78 -2484,2400-2499,2484. 统计回文子序列数目,统计回文子序列数目,https://leetcode.cn/problems/count-palindromic-subsequences/,count-palindromic-subsequences,字符串、动态规划,https://algo.itcharge.cn/Solutions/2400-2499/count-palindromic-subsequences/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2484.%20%E7%BB%9F%E8%AE%A1%E5%9B%9E%E6%96%87%E5%AD%90%E5%BA%8F%E5%88%97%E6%95%B0%E7%9B%AE.md,47.1%,困难,48 -2485,2400-2499,2485. 找出中枢整数,找出中枢整数,https://leetcode.cn/problems/find-the-pivot-integer/,find-the-pivot-integer,数学、前缀和,https://algo.itcharge.cn/Solutions/2400-2499/find-the-pivot-integer/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2485.%20%E6%89%BE%E5%87%BA%E4%B8%AD%E6%9E%A2%E6%95%B4%E6%95%B0.md,81.0%,简单,285 -2486,2400-2499,2486. 追加字符以获得子序列,追加字符以获得子序列,https://leetcode.cn/problems/append-characters-to-string-to-make-subsequence/,append-characters-to-string-to-make-subsequence,贪心、双指针、字符串,https://algo.itcharge.cn/Solutions/2400-2499/append-characters-to-string-to-make-subsequence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2486.%20%E8%BF%BD%E5%8A%A0%E5%AD%97%E7%AC%A6%E4%BB%A5%E8%8E%B7%E5%BE%97%E5%AD%90%E5%BA%8F%E5%88%97.md,65.2%,中等,85 -2487,2400-2499,2487. 从链表中移除节点,从链表中移除节点,https://leetcode.cn/problems/remove-nodes-from-linked-list/,remove-nodes-from-linked-list,栈、递归、链表、单调栈,https://algo.itcharge.cn/Solutions/2400-2499/remove-nodes-from-linked-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2487.%20%E4%BB%8E%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%A7%BB%E9%99%A4%E8%8A%82%E7%82%B9.md,68.8%,中等,122 -2488,2400-2499,2488. 统计中位数为 K 的子数组,统计中位数为 K 的子数组,https://leetcode.cn/problems/count-subarrays-with-median-k/,count-subarrays-with-median-k,数组、哈希表、前缀和,https://algo.itcharge.cn/Solutions/2400-2499/count-subarrays-with-median-k/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2488.%20%E7%BB%9F%E8%AE%A1%E4%B8%AD%E4%BD%8D%E6%95%B0%E4%B8%BA%20K%20%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md,50.8%,困难,201 -2489,2400-2499,2489. 固定比率的子字符串数,固定比率的子字符串数,https://leetcode.cn/problems/number-of-substrings-with-fixed-ratio/,number-of-substrings-with-fixed-ratio,哈希表、数学、字符串、前缀和,https://algo.itcharge.cn/Solutions/2400-2499/number-of-substrings-with-fixed-ratio/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2489.%20%E5%9B%BA%E5%AE%9A%E6%AF%94%E7%8E%87%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%95%B0.md,68.8%,中等,3 -2490,2400-2499,2490. 回环句,回环句,https://leetcode.cn/problems/circular-sentence/,circular-sentence,字符串,https://algo.itcharge.cn/Solutions/2400-2499/circular-sentence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2490.%20%E5%9B%9E%E7%8E%AF%E5%8F%A5.md,69.7%,简单,91 -2491,2400-2499,2491. 划分技能点相等的团队,划分技能点相等的团队,https://leetcode.cn/problems/divide-players-into-teams-of-equal-skill/,divide-players-into-teams-of-equal-skill,数组、哈希表、双指针、排序,https://algo.itcharge.cn/Solutions/2400-2499/divide-players-into-teams-of-equal-skill/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2491.%20%E5%88%92%E5%88%86%E6%8A%80%E8%83%BD%E7%82%B9%E7%9B%B8%E7%AD%89%E7%9A%84%E5%9B%A2%E9%98%9F.md,55.4%,中等,110 -2492,2400-2499,2492. 两个城市间路径的最小分数,两个城市间路径的最小分数,https://leetcode.cn/problems/minimum-score-of-a-path-between-two-cities/,minimum-score-of-a-path-between-two-cities,深度优先搜索、广度优先搜索、并查集、图,https://algo.itcharge.cn/Solutions/2400-2499/minimum-score-of-a-path-between-two-cities/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2492.%20%E4%B8%A4%E4%B8%AA%E5%9F%8E%E5%B8%82%E9%97%B4%E8%B7%AF%E5%BE%84%E7%9A%84%E6%9C%80%E5%B0%8F%E5%88%86%E6%95%B0.md,41.4%,中等,121 -2493,2400-2499,2493. 将节点分成尽可能多的组,将节点分成尽可能多的组,https://leetcode.cn/problems/divide-nodes-into-the-maximum-number-of-groups/,divide-nodes-into-the-maximum-number-of-groups,广度优先搜索、并查集、图,https://algo.itcharge.cn/Solutions/2400-2499/divide-nodes-into-the-maximum-number-of-groups/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2493.%20%E5%B0%86%E8%8A%82%E7%82%B9%E5%88%86%E6%88%90%E5%B0%BD%E5%8F%AF%E8%83%BD%E5%A4%9A%E7%9A%84%E7%BB%84.md,43.7%,困难,44 -2494,2400-2499,2494. 合并在同一个大厅重叠的活动,合并在同一个大厅重叠的活动,https://leetcode.cn/problems/merge-overlapping-events-in-the-same-hall/,merge-overlapping-events-in-the-same-hall,数据库,https://algo.itcharge.cn/Solutions/2400-2499/merge-overlapping-events-in-the-same-hall/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2494.%20%E5%90%88%E5%B9%B6%E5%9C%A8%E5%90%8C%E4%B8%80%E4%B8%AA%E5%A4%A7%E5%8E%85%E9%87%8D%E5%8F%A0%E7%9A%84%E6%B4%BB%E5%8A%A8.md,39.2%,困难,7 -2495,2400-2499,2495. 乘积为偶数的子数组数,乘积为偶数的子数组数,https://leetcode.cn/problems/number-of-subarrays-having-even-product/,number-of-subarrays-having-even-product,数组、数学、动态规划,https://algo.itcharge.cn/Solutions/2400-2499/number-of-subarrays-having-even-product/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2495.%20%E4%B9%98%E7%A7%AF%E4%B8%BA%E5%81%B6%E6%95%B0%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84%E6%95%B0.md,68.8%,中等,12 -2496,2400-2499,2496. 数组中字符串的最大值,数组中字符串的最大值,https://leetcode.cn/problems/maximum-value-of-a-string-in-an-array/,maximum-value-of-a-string-in-an-array,数组、字符串,https://algo.itcharge.cn/Solutions/2400-2499/maximum-value-of-a-string-in-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2496.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md,79.6%,简单,191 -2497,2400-2499,2497. 图中最大星和,图中最大星和,https://leetcode.cn/problems/maximum-star-sum-of-a-graph/,maximum-star-sum-of-a-graph,贪心、图、数组、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/2400-2499/maximum-star-sum-of-a-graph/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2497.%20%E5%9B%BE%E4%B8%AD%E6%9C%80%E5%A4%A7%E6%98%9F%E5%92%8C.md,38.3%,中等,50 -2498,2400-2499,2498. 青蛙过河 II,青蛙过河 II,https://leetcode.cn/problems/frog-jump-ii/,frog-jump-ii,贪心、数组、二分查找,https://algo.itcharge.cn/Solutions/2400-2499/frog-jump-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2498.%20%E9%9D%92%E8%9B%99%E8%BF%87%E6%B2%B3%20II.md,64.4%,中等,49 -2499,2400-2499,2499. 让数组不相等的最小总代价,让数组不相等的最小总代价,https://leetcode.cn/problems/minimum-total-cost-to-make-arrays-unequal/,minimum-total-cost-to-make-arrays-unequal,贪心、数组、哈希表、计数,https://algo.itcharge.cn/Solutions/2400-2499/minimum-total-cost-to-make-arrays-unequal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2499.%20%E8%AE%A9%E6%95%B0%E7%BB%84%E4%B8%8D%E7%9B%B8%E7%AD%89%E7%9A%84%E6%9C%80%E5%B0%8F%E6%80%BB%E4%BB%A3%E4%BB%B7.md,42.0%,困难,28 -2500,2500-2599,2500. 删除每行中的最大值,删除每行中的最大值,https://leetcode.cn/problems/delete-greatest-value-in-each-row/,delete-greatest-value-in-each-row,数组、矩阵、排序,https://algo.itcharge.cn/Solutions/2500-2599/delete-greatest-value-in-each-row/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2500.%20%E5%88%A0%E9%99%A4%E6%AF%8F%E8%A1%8C%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md,82.8%,简单,114 -2501,2500-2599,2501. 数组中最长的方波,数组中最长的方波,https://leetcode.cn/problems/longest-square-streak-in-an-array/,longest-square-streak-in-an-array,数组、哈希表、二分查找、动态规划、排序,https://algo.itcharge.cn/Solutions/2500-2599/longest-square-streak-in-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2501.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9C%80%E9%95%BF%E7%9A%84%E6%96%B9%E6%B3%A2.md,41.3%,中等,85 -2502,2500-2599,2502. 设计内存分配器,设计内存分配器,https://leetcode.cn/problems/design-memory-allocator/,design-memory-allocator,设计、数组、哈希表、模拟,https://algo.itcharge.cn/Solutions/2500-2599/design-memory-allocator/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2502.%20%E8%AE%BE%E8%AE%A1%E5%86%85%E5%AD%98%E5%88%86%E9%85%8D%E5%99%A8.md,52.2%,中等,73 -2503,2500-2599,2503. 矩阵查询可获得的最大分数,矩阵查询可获得的最大分数,https://leetcode.cn/problems/maximum-number-of-points-from-grid-queries/,maximum-number-of-points-from-grid-queries,广度优先搜索、并查集、数组、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/2500-2599/maximum-number-of-points-from-grid-queries/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2503.%20%E7%9F%A9%E9%98%B5%E6%9F%A5%E8%AF%A2%E5%8F%AF%E8%8E%B7%E5%BE%97%E7%9A%84%E6%9C%80%E5%A4%A7%E5%88%86%E6%95%B0.md,43.4%,困难,65 -2504,2500-2599,2504. 把名字和职业联系起来,把名字和职业联系起来,https://leetcode.cn/problems/concatenate-the-name-and-the-profession/,concatenate-the-name-and-the-profession,数据库,https://algo.itcharge.cn/Solutions/2500-2599/concatenate-the-name-and-the-profession/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2504.%20%E6%8A%8A%E5%90%8D%E5%AD%97%E5%92%8C%E8%81%8C%E4%B8%9A%E8%81%94%E7%B3%BB%E8%B5%B7%E6%9D%A5.md,76.4%,简单,8 -2505,2500-2599,2505. 所有子序列和的按位或,所有子序列和的按位或,https://leetcode.cn/problems/bitwise-or-of-all-subsequence-sums/,bitwise-or-of-all-subsequence-sums,位运算、脑筋急转弯、数组、数学,https://algo.itcharge.cn/Solutions/2500-2599/bitwise-or-of-all-subsequence-sums/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2505.%20%E6%89%80%E6%9C%89%E5%AD%90%E5%BA%8F%E5%88%97%E5%92%8C%E7%9A%84%E6%8C%89%E4%BD%8D%E6%88%96.md,58.8%,中等,4 -2506,2500-2599,2506. 统计相似字符串对的数目,统计相似字符串对的数目,https://leetcode.cn/problems/count-pairs-of-similar-strings/,count-pairs-of-similar-strings,数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/2500-2599/count-pairs-of-similar-strings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2506.%20%E7%BB%9F%E8%AE%A1%E7%9B%B8%E4%BC%BC%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%AF%B9%E7%9A%84%E6%95%B0%E7%9B%AE.md,78.3%,简单,87 -2507,2500-2599,2507. 使用质因数之和替换后可以取到的最小值,使用质因数之和替换后可以取到的最小值,https://leetcode.cn/problems/smallest-value-after-replacing-with-sum-of-prime-factors/,smallest-value-after-replacing-with-sum-of-prime-factors,数学、数论,https://algo.itcharge.cn/Solutions/2500-2599/smallest-value-after-replacing-with-sum-of-prime-factors/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2507.%20%E4%BD%BF%E7%94%A8%E8%B4%A8%E5%9B%A0%E6%95%B0%E4%B9%8B%E5%92%8C%E6%9B%BF%E6%8D%A2%E5%90%8E%E5%8F%AF%E4%BB%A5%E5%8F%96%E5%88%B0%E7%9A%84%E6%9C%80%E5%B0%8F%E5%80%BC.md,49.9%,中等,60 -2508,2500-2599,2508. 添加边使所有节点度数都为偶数,添加边使所有节点度数都为偶数,https://leetcode.cn/problems/add-edges-to-make-degrees-of-all-nodes-even/,add-edges-to-make-degrees-of-all-nodes-even,图、哈希表,https://algo.itcharge.cn/Solutions/2500-2599/add-edges-to-make-degrees-of-all-nodes-even/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2508.%20%E6%B7%BB%E5%8A%A0%E8%BE%B9%E4%BD%BF%E6%89%80%E6%9C%89%E8%8A%82%E7%82%B9%E5%BA%A6%E6%95%B0%E9%83%BD%E4%B8%BA%E5%81%B6%E6%95%B0.md,29.4%,困难,54 -2509,2500-2599,2509. 查询树中环的长度,查询树中环的长度,https://leetcode.cn/problems/cycle-length-queries-in-a-tree/,cycle-length-queries-in-a-tree,树、二叉树,https://algo.itcharge.cn/Solutions/2500-2599/cycle-length-queries-in-a-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2509.%20%E6%9F%A5%E8%AF%A2%E6%A0%91%E4%B8%AD%E7%8E%AF%E7%9A%84%E9%95%BF%E5%BA%A6.md,65.2%,困难,60 -2510,2500-2599,2510. 检查是否有路径经过相同数量的 0 和 1,检查是否有路径经过相同数量的 0 和 1,https://leetcode.cn/problems/check-if-there-is-a-path-with-equal-number-of-0s-and-1s/,check-if-there-is-a-path-with-equal-number-of-0s-and-1s,数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/2500-2599/check-if-there-is-a-path-with-equal-number-of-0s-and-1s/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2510.%20%E6%A3%80%E6%9F%A5%E6%98%AF%E5%90%A6%E6%9C%89%E8%B7%AF%E5%BE%84%E7%BB%8F%E8%BF%87%E7%9B%B8%E5%90%8C%E6%95%B0%E9%87%8F%E7%9A%84%200%20%E5%92%8C%201.md,69.1%,中等,7 -2511,2500-2599,2511. 最多可以摧毁的敌人城堡数目,最多可以摧毁的敌人城堡数目,https://leetcode.cn/problems/maximum-enemy-forts-that-can-be-captured/,maximum-enemy-forts-that-can-be-captured,数组、双指针,https://algo.itcharge.cn/Solutions/2500-2599/maximum-enemy-forts-that-can-be-captured/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2511.%20%E6%9C%80%E5%A4%9A%E5%8F%AF%E4%BB%A5%E6%91%A7%E6%AF%81%E7%9A%84%E6%95%8C%E4%BA%BA%E5%9F%8E%E5%A0%A1%E6%95%B0%E7%9B%AE.md,49.8%,简单,66 -2512,2500-2599,2512. 奖励最顶尖的 K 名学生,奖励最顶尖的 K 名学生,https://leetcode.cn/problems/reward-top-k-students/,reward-top-k-students,数组、哈希表、字符串、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/2500-2599/reward-top-k-students/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2512.%20%E5%A5%96%E5%8A%B1%E6%9C%80%E9%A1%B6%E5%B0%96%E7%9A%84%20K%20%E5%90%8D%E5%AD%A6%E7%94%9F.md,46.1%,中等,51 -2513,2500-2599,2513. 最小化两个数组中的最大值,最小化两个数组中的最大值,https://leetcode.cn/problems/minimize-the-maximum-of-two-arrays/,minimize-the-maximum-of-two-arrays,数学、二分查找、数论,https://algo.itcharge.cn/Solutions/2500-2599/minimize-the-maximum-of-two-arrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2513.%20%E6%9C%80%E5%B0%8F%E5%8C%96%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md,34.6%,中等,34 -2514,2500-2599,2514. 统计同位异构字符串数目,统计同位异构字符串数目,https://leetcode.cn/problems/count-anagrams/,count-anagrams,哈希表、数学、字符串、组合数学、计数,https://algo.itcharge.cn/Solutions/2500-2599/count-anagrams/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2514.%20%E7%BB%9F%E8%AE%A1%E5%90%8C%E4%BD%8D%E5%BC%82%E6%9E%84%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%95%B0%E7%9B%AE.md,46.3%,困难,35 -2515,2500-2599,2515. 到目标字符串的最短距离,到目标字符串的最短距离,https://leetcode.cn/problems/shortest-distance-to-target-string-in-a-circular-array/,shortest-distance-to-target-string-in-a-circular-array,数组、字符串,https://algo.itcharge.cn/Solutions/2500-2599/shortest-distance-to-target-string-in-a-circular-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2515.%20%E5%88%B0%E7%9B%AE%E6%A0%87%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%9C%80%E7%9F%AD%E8%B7%9D%E7%A6%BB.md,55.7%,简单,69 -2516,2500-2599,2516. 每种字符至少取 K 个,每种字符至少取 K 个,https://leetcode.cn/problems/take-k-of-each-character-from-left-and-right/,take-k-of-each-character-from-left-and-right,哈希表、字符串、滑动窗口,https://algo.itcharge.cn/Solutions/2500-2599/take-k-of-each-character-from-left-and-right/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2516.%20%E6%AF%8F%E7%A7%8D%E5%AD%97%E7%AC%A6%E8%87%B3%E5%B0%91%E5%8F%96%20K%20%E4%B8%AA.md,37.2%,中等,74 -2517,2500-2599,2517. 礼盒的最大甜蜜度,礼盒的最大甜蜜度,https://leetcode.cn/problems/maximum-tastiness-of-candy-basket/,maximum-tastiness-of-candy-basket,数组、二分查找、排序,https://algo.itcharge.cn/Solutions/2500-2599/maximum-tastiness-of-candy-basket/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2517.%20%E7%A4%BC%E7%9B%92%E7%9A%84%E6%9C%80%E5%A4%A7%E7%94%9C%E8%9C%9C%E5%BA%A6.md,72.0%,中等,135 -2518,2500-2599,2518. 好分区的数目,好分区的数目,https://leetcode.cn/problems/number-of-great-partitions/,number-of-great-partitions,数组、动态规划,https://algo.itcharge.cn/Solutions/2500-2599/number-of-great-partitions/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2518.%20%E5%A5%BD%E5%88%86%E5%8C%BA%E7%9A%84%E6%95%B0%E7%9B%AE.md,42.6%,困难,31 -2519,2500-2599,2519. 统计 K-Big 索引的数量,统计 K-Big 索引的数量,https://leetcode.cn/problems/count-the-number-of-k-big-indices/,count-the-number-of-k-big-indices,树状数组、线段树、数组、二分查找、分治、有序集合、归并排序,https://algo.itcharge.cn/Solutions/2500-2599/count-the-number-of-k-big-indices/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2519.%20%E7%BB%9F%E8%AE%A1%20K-Big%20%E7%B4%A2%E5%BC%95%E7%9A%84%E6%95%B0%E9%87%8F.md,75.1%,困难,11 -2520,2500-2599,2520. 统计能整除数字的位数,统计能整除数字的位数,https://leetcode.cn/problems/count-the-digits-that-divide-a-number/,count-the-digits-that-divide-a-number,数学,https://algo.itcharge.cn/Solutions/2500-2599/count-the-digits-that-divide-a-number/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2520.%20%E7%BB%9F%E8%AE%A1%E8%83%BD%E6%95%B4%E9%99%A4%E6%95%B0%E5%AD%97%E7%9A%84%E4%BD%8D%E6%95%B0.md,83.2%,简单,81 -2521,2500-2599,2521. 数组乘积中的不同质因数数目,数组乘积中的不同质因数数目,https://leetcode.cn/problems/distinct-prime-factors-of-product-of-array/,distinct-prime-factors-of-product-of-array,数组、哈希表、数学、数论,https://algo.itcharge.cn/Solutions/2500-2599/distinct-prime-factors-of-product-of-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2521.%20%E6%95%B0%E7%BB%84%E4%B9%98%E7%A7%AF%E4%B8%AD%E7%9A%84%E4%B8%8D%E5%90%8C%E8%B4%A8%E5%9B%A0%E6%95%B0%E6%95%B0%E7%9B%AE.md,62.6%,中等,63 -2522,2500-2599,2522. 将字符串分割成值不超过 K 的子字符串,将字符串分割成值不超过 K 的子字符串,https://leetcode.cn/problems/partition-string-into-substrings-with-values-at-most-k/,partition-string-into-substrings-with-values-at-most-k,贪心、字符串、动态规划,https://algo.itcharge.cn/Solutions/2500-2599/partition-string-into-substrings-with-values-at-most-k/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2522.%20%E5%B0%86%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%88%86%E5%89%B2%E6%88%90%E5%80%BC%E4%B8%8D%E8%B6%85%E8%BF%87%20K%20%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md,49.5%,中等,59 -2523,2500-2599,2523. 范围内最接近的两个质数,范围内最接近的两个质数,https://leetcode.cn/problems/closest-prime-numbers-in-range/,closest-prime-numbers-in-range,数学、数论,https://algo.itcharge.cn/Solutions/2500-2599/closest-prime-numbers-in-range/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2523.%20%E8%8C%83%E5%9B%B4%E5%86%85%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9A%84%E4%B8%A4%E4%B8%AA%E8%B4%A8%E6%95%B0.md,41.3%,中等,64 -2524,2500-2599,2524. 子数组的最大频率分数,子数组的最大频率分数,https://leetcode.cn/problems/maximum-frequency-score-of-a-subarray/,maximum-frequency-score-of-a-subarray,数组、哈希表、数学、滑动窗口,https://algo.itcharge.cn/Solutions/2500-2599/maximum-frequency-score-of-a-subarray/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2524.%20%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E9%A2%91%E7%8E%87%E5%88%86%E6%95%B0.md,52.2%,困难,3 -2525,2500-2599,2525. 根据规则将箱子分类,根据规则将箱子分类,https://leetcode.cn/problems/categorize-box-according-to-criteria/,categorize-box-according-to-criteria,数学,https://algo.itcharge.cn/Solutions/2500-2599/categorize-box-according-to-criteria/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2525.%20%E6%A0%B9%E6%8D%AE%E8%A7%84%E5%88%99%E5%B0%86%E7%AE%B1%E5%AD%90%E5%88%86%E7%B1%BB.md,47.5%,简单,37 -2526,2500-2599,2526. 找到数据流中的连续整数,找到数据流中的连续整数,https://leetcode.cn/problems/find-consecutive-integers-from-a-data-stream/,find-consecutive-integers-from-a-data-stream,设计、队列、哈希表、计数、数据流,https://algo.itcharge.cn/Solutions/2500-2599/find-consecutive-integers-from-a-data-stream/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2526.%20%E6%89%BE%E5%88%B0%E6%95%B0%E6%8D%AE%E6%B5%81%E4%B8%AD%E7%9A%84%E8%BF%9E%E7%BB%AD%E6%95%B4%E6%95%B0.md,54.0%,中等,44 -2527,2500-2599,2527. 查询数组 Xor 美丽值,查询数组 Xor 美丽值,https://leetcode.cn/problems/find-xor-beauty-of-array/,find-xor-beauty-of-array,位运算、数组、数学,https://algo.itcharge.cn/Solutions/2500-2599/find-xor-beauty-of-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2527.%20%E6%9F%A5%E8%AF%A2%E6%95%B0%E7%BB%84%20Xor%20%E7%BE%8E%E4%B8%BD%E5%80%BC.md,70.3%,中等,40 -2528,2500-2599,2528. 最大化城市的最小供电站数目,最大化城市的最小供电站数目,https://leetcode.cn/problems/maximize-the-minimum-powered-city/,maximize-the-minimum-powered-city,贪心、队列、数组、二分查找、前缀和、滑动窗口,https://algo.itcharge.cn/Solutions/2500-2599/maximize-the-minimum-powered-city/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2528.%20%E6%9C%80%E5%A4%A7%E5%8C%96%E5%9F%8E%E5%B8%82%E7%9A%84%E6%9C%80%E5%B0%8F%E4%BE%9B%E7%94%B5%E7%AB%99%E6%95%B0%E7%9B%AE.md,40.5%,困难,37 -2529,2500-2599,2529. 正整数和负整数的最大计数,正整数和负整数的最大计数,https://leetcode.cn/problems/maximum-count-of-positive-integer-and-negative-integer/,maximum-count-of-positive-integer-and-negative-integer,数组、二分查找、计数,https://algo.itcharge.cn/Solutions/2500-2599/maximum-count-of-positive-integer-and-negative-integer/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2529.%20%E6%AD%A3%E6%95%B4%E6%95%B0%E5%92%8C%E8%B4%9F%E6%95%B4%E6%95%B0%E7%9A%84%E6%9C%80%E5%A4%A7%E8%AE%A1%E6%95%B0.md,76.3%,简单,74 -2530,2500-2599,2530. 执行 K 次操作后的最大分数,执行 K 次操作后的最大分数,https://leetcode.cn/problems/maximal-score-after-applying-k-operations/,maximal-score-after-applying-k-operations,贪心、数组、堆（优先队列）,https://algo.itcharge.cn/Solutions/2500-2599/maximal-score-after-applying-k-operations/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2530.%20%E6%89%A7%E8%A1%8C%20K%20%E6%AC%A1%E6%93%8D%E4%BD%9C%E5%90%8E%E7%9A%84%E6%9C%80%E5%A4%A7%E5%88%86%E6%95%B0.md,44.9%,中等,68 -2531,2500-2599,2531. 使字符串总不同字符的数目相等,使字符串总不同字符的数目相等,https://leetcode.cn/problems/make-number-of-distinct-characters-equal/,make-number-of-distinct-characters-equal,哈希表、字符串、计数,https://algo.itcharge.cn/Solutions/2500-2599/make-number-of-distinct-characters-equal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2531.%20%E4%BD%BF%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%80%BB%E4%B8%8D%E5%90%8C%E5%AD%97%E7%AC%A6%E7%9A%84%E6%95%B0%E7%9B%AE%E7%9B%B8%E7%AD%89.md,29.7%,中等,87 -2532,2500-2599,2532. 过桥的时间,过桥的时间,https://leetcode.cn/problems/time-to-cross-a-bridge/,time-to-cross-a-bridge,数组、模拟、堆（优先队列）,https://algo.itcharge.cn/Solutions/2500-2599/time-to-cross-a-bridge/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2532.%20%E8%BF%87%E6%A1%A5%E7%9A%84%E6%97%B6%E9%97%B4.md,51.7%,困难,51 -2533,2500-2599,2533. 好二进制字符串的数量,好二进制字符串的数量,https://leetcode.cn/problems/number-of-good-binary-strings/,number-of-good-binary-strings,动态规划,https://algo.itcharge.cn/Solutions/2500-2599/number-of-good-binary-strings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2533.%20%E5%A5%BD%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%95%B0%E9%87%8F.md,69.7%,中等,3 -2534,2500-2599,2534. 通过门的时间,通过门的时间,https://leetcode.cn/problems/time-taken-to-cross-the-door/,time-taken-to-cross-the-door,队列、数组、模拟,https://algo.itcharge.cn/Solutions/2500-2599/time-taken-to-cross-the-door/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2534.%20%E9%80%9A%E8%BF%87%E9%97%A8%E7%9A%84%E6%97%B6%E9%97%B4.md,63.0%,困难,8 -2535,2500-2599,2535. 数组元素和与数字和的绝对差,数组元素和与数字和的绝对差,https://leetcode.cn/problems/difference-between-element-sum-and-digit-sum-of-an-array/,difference-between-element-sum-and-digit-sum-of-an-array,数组、数学,https://algo.itcharge.cn/Solutions/2500-2599/difference-between-element-sum-and-digit-sum-of-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2535.%20%E6%95%B0%E7%BB%84%E5%85%83%E7%B4%A0%E5%92%8C%E4%B8%8E%E6%95%B0%E5%AD%97%E5%92%8C%E7%9A%84%E7%BB%9D%E5%AF%B9%E5%B7%AE.md,84.3%,简单,110 -2536,2500-2599,2536. 子矩阵元素加 1,子矩阵元素加 1,https://leetcode.cn/problems/increment-submatrices-by-one/,increment-submatrices-by-one,数组、矩阵、前缀和,https://algo.itcharge.cn/Solutions/2500-2599/increment-submatrices-by-one/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2536.%20%E5%AD%90%E7%9F%A9%E9%98%B5%E5%85%83%E7%B4%A0%E5%8A%A0%201.md,60.6%,中等,77 -2537,2500-2599,2537. 统计好子数组的数目,统计好子数组的数目,https://leetcode.cn/problems/count-the-number-of-good-subarrays/,count-the-number-of-good-subarrays,数组、哈希表、滑动窗口,https://algo.itcharge.cn/Solutions/2500-2599/count-the-number-of-good-subarrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2537.%20%E7%BB%9F%E8%AE%A1%E5%A5%BD%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%95%B0%E7%9B%AE.md,48.6%,中等,80 -2538,2500-2599,2538. 最大价值和与最小价值和的差值,最大价值和与最小价值和的差值,https://leetcode.cn/problems/difference-between-maximum-and-minimum-price-sum/,difference-between-maximum-and-minimum-price-sum,树、深度优先搜索、数组、动态规划,https://algo.itcharge.cn/Solutions/2500-2599/difference-between-maximum-and-minimum-price-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2538.%20%E6%9C%80%E5%A4%A7%E4%BB%B7%E5%80%BC%E5%92%8C%E4%B8%8E%E6%9C%80%E5%B0%8F%E4%BB%B7%E5%80%BC%E5%92%8C%E7%9A%84%E5%B7%AE%E5%80%BC.md,48.5%,困难,43 -2539,2500-2599,2539. 好子序列的个数,好子序列的个数,https://leetcode.cn/problems/count-the-number-of-good-subsequences/,count-the-number-of-good-subsequences,哈希表、数学、字符串、组合数学、计数,https://algo.itcharge.cn/Solutions/2500-2599/count-the-number-of-good-subsequences/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2539.%20%E5%A5%BD%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E4%B8%AA%E6%95%B0.md,62.9%,中等,5 -2540,2500-2599,2540. 最小公共值,最小公共值,https://leetcode.cn/problems/minimum-common-value/,minimum-common-value,数组、哈希表、双指针、二分查找,https://algo.itcharge.cn/Solutions/2500-2599/minimum-common-value/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2540.%20%E6%9C%80%E5%B0%8F%E5%85%AC%E5%85%B1%E5%80%BC.md,60.5%,简单,60 -2541,2500-2599,2541. 使数组中所有元素相等的最小操作数 II,使数组中所有元素相等的最小操作数 II,https://leetcode.cn/problems/minimum-operations-to-make-array-equal-ii/,minimum-operations-to-make-array-equal-ii,贪心、数组、数学,https://algo.itcharge.cn/Solutions/2500-2599/minimum-operations-to-make-array-equal-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2541.%20%E4%BD%BF%E6%95%B0%E7%BB%84%E4%B8%AD%E6%89%80%E6%9C%89%E5%85%83%E7%B4%A0%E7%9B%B8%E7%AD%89%E7%9A%84%E6%9C%80%E5%B0%8F%E6%93%8D%E4%BD%9C%E6%95%B0%20II.md,31.2%,中等,32 -2542,2500-2599,2542. 最大子序列的分数,最大子序列的分数,https://leetcode.cn/problems/maximum-subsequence-score/,maximum-subsequence-score,贪心、数组、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/2500-2599/maximum-subsequence-score/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2542.%20%E6%9C%80%E5%A4%A7%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E5%88%86%E6%95%B0.md,51.2%,中等,35 -2543,2500-2599,2543. 判断一个点是否可以到达,判断一个点是否可以到达,https://leetcode.cn/problems/check-if-point-is-reachable/,check-if-point-is-reachable,数学、数论,https://algo.itcharge.cn/Solutions/2500-2599/check-if-point-is-reachable/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2543.%20%E5%88%A4%E6%96%AD%E4%B8%80%E4%B8%AA%E7%82%B9%E6%98%AF%E5%90%A6%E5%8F%AF%E4%BB%A5%E5%88%B0%E8%BE%BE.md,46.0%,困难,15 -2544,2500-2599,2544. 交替数字和,交替数字和,https://leetcode.cn/problems/alternating-digit-sum/,alternating-digit-sum,数学,https://algo.itcharge.cn/Solutions/2500-2599/alternating-digit-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2544.%20%E4%BA%A4%E6%9B%BF%E6%95%B0%E5%AD%97%E5%92%8C.md,79.8%,简单,76 -2545,2500-2599,2545. 根据第 K 场考试的分数排序,根据第 K 场考试的分数排序,https://leetcode.cn/problems/sort-the-students-by-their-kth-score/,sort-the-students-by-their-kth-score,数组、矩阵、排序,https://algo.itcharge.cn/Solutions/2500-2599/sort-the-students-by-their-kth-score/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2545.%20%E6%A0%B9%E6%8D%AE%E7%AC%AC%20K%20%E5%9C%BA%E8%80%83%E8%AF%95%E7%9A%84%E5%88%86%E6%95%B0%E6%8E%92%E5%BA%8F.md,86.5%,中等,68 -2546,2500-2599,2546. 执行逐位运算使字符串相等,执行逐位运算使字符串相等,https://leetcode.cn/problems/apply-bitwise-operations-to-make-strings-equal/,apply-bitwise-operations-to-make-strings-equal,位运算、字符串,https://algo.itcharge.cn/Solutions/2500-2599/apply-bitwise-operations-to-make-strings-equal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2546.%20%E6%89%A7%E8%A1%8C%E9%80%90%E4%BD%8D%E8%BF%90%E7%AE%97%E4%BD%BF%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E7%AD%89.md,42.2%,中等,50 -2547,2500-2599,2547. 拆分数组的最小代价,拆分数组的最小代价,https://leetcode.cn/problems/minimum-cost-to-split-an-array/,minimum-cost-to-split-an-array,数组、哈希表、动态规划、计数,https://algo.itcharge.cn/Solutions/2500-2599/minimum-cost-to-split-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2547.%20%E6%8B%86%E5%88%86%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%B0%8F%E4%BB%A3%E4%BB%B7.md,56.5%,困难,37 -2548,2500-2599,2548. 填满背包的最大价格,填满背包的最大价格,https://leetcode.cn/problems/maximum-price-to-fill-a-bag/,maximum-price-to-fill-a-bag,贪心、数组、排序,https://algo.itcharge.cn/Solutions/2500-2599/maximum-price-to-fill-a-bag/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2548.%20%E5%A1%AB%E6%BB%A1%E8%83%8C%E5%8C%85%E7%9A%84%E6%9C%80%E5%A4%A7%E4%BB%B7%E6%A0%BC.md,58.3%,中等,3 -2549,2500-2599,2549. 统计桌面上的不同数字,统计桌面上的不同数字,https://leetcode.cn/problems/count-distinct-numbers-on-board/,count-distinct-numbers-on-board,数组、哈希表、数学、模拟,https://algo.itcharge.cn/Solutions/2500-2599/count-distinct-numbers-on-board/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2549.%20%E7%BB%9F%E8%AE%A1%E6%A1%8C%E9%9D%A2%E4%B8%8A%E7%9A%84%E4%B8%8D%E5%90%8C%E6%95%B0%E5%AD%97.md,62.9%,简单,46 -2550,2500-2599,2550. 猴子碰撞的方法数,猴子碰撞的方法数,https://leetcode.cn/problems/count-collisions-of-monkeys-on-a-polygon/,count-collisions-of-monkeys-on-a-polygon,递归、数学,https://algo.itcharge.cn/Solutions/2500-2599/count-collisions-of-monkeys-on-a-polygon/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2550.%20%E7%8C%B4%E5%AD%90%E7%A2%B0%E6%92%9E%E7%9A%84%E6%96%B9%E6%B3%95%E6%95%B0.md,28.9%,中等,45 -2551,2500-2599,2551. 将珠子放入背包中,将珠子放入背包中,https://leetcode.cn/problems/put-marbles-in-bags/,put-marbles-in-bags,贪心、数组、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/2500-2599/put-marbles-in-bags/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2551.%20%E5%B0%86%E7%8F%A0%E5%AD%90%E6%94%BE%E5%85%A5%E8%83%8C%E5%8C%85%E4%B8%AD.md,56.5%,困难,38 -2552,2500-2599,2552. 统计上升四元组,统计上升四元组,https://leetcode.cn/problems/count-increasing-quadruplets/,count-increasing-quadruplets,树状数组、数组、动态规划、枚举、前缀和,https://algo.itcharge.cn/Solutions/2500-2599/count-increasing-quadruplets/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2552.%20%E7%BB%9F%E8%AE%A1%E4%B8%8A%E5%8D%87%E5%9B%9B%E5%85%83%E7%BB%84.md,44.2%,困难,37 -2553,2500-2599,2553. 分割数组中数字的数位,分割数组中数字的数位,https://leetcode.cn/problems/separate-the-digits-in-an-array/,separate-the-digits-in-an-array,数组、模拟,https://algo.itcharge.cn/Solutions/2500-2599/separate-the-digits-in-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2553.%20%E5%88%86%E5%89%B2%E6%95%B0%E7%BB%84%E4%B8%AD%E6%95%B0%E5%AD%97%E7%9A%84%E6%95%B0%E4%BD%8D.md,82.5%,简单,61 -2554,2500-2599,2554. 从一个范围内选择最多整数 I,从一个范围内选择最多整数 I,https://leetcode.cn/problems/maximum-number-of-integers-to-choose-from-a-range-i/,maximum-number-of-integers-to-choose-from-a-range-i,贪心、数组、哈希表、二分查找、排序,https://algo.itcharge.cn/Solutions/2500-2599/maximum-number-of-integers-to-choose-from-a-range-i/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2554.%20%E4%BB%8E%E4%B8%80%E4%B8%AA%E8%8C%83%E5%9B%B4%E5%86%85%E9%80%89%E6%8B%A9%E6%9C%80%E5%A4%9A%E6%95%B4%E6%95%B0%20I.md,58.2%,中等,40 -2555,2500-2599,2555. 两个线段获得的最多奖品,两个线段获得的最多奖品,https://leetcode.cn/problems/maximize-win-from-two-segments/,maximize-win-from-two-segments,数组、二分查找、滑动窗口,https://algo.itcharge.cn/Solutions/2500-2599/maximize-win-from-two-segments/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2555.%20%E4%B8%A4%E4%B8%AA%E7%BA%BF%E6%AE%B5%E8%8E%B7%E5%BE%97%E7%9A%84%E6%9C%80%E5%A4%9A%E5%A5%96%E5%93%81.md,39.9%,中等,31 -2556,2500-2599,2556. 二进制矩阵中翻转最多一次使路径不连通,二进制矩阵中翻转最多一次使路径不连通,https://leetcode.cn/problems/disconnect-path-in-a-binary-matrix-by-at-most-one-flip/,disconnect-path-in-a-binary-matrix-by-at-most-one-flip,深度优先搜索、广度优先搜索、数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/2500-2599/disconnect-path-in-a-binary-matrix-by-at-most-one-flip/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2556.%20%E4%BA%8C%E8%BF%9B%E5%88%B6%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%BF%BB%E8%BD%AC%E6%9C%80%E5%A4%9A%E4%B8%80%E6%AC%A1%E4%BD%BF%E8%B7%AF%E5%BE%84%E4%B8%8D%E8%BF%9E%E9%80%9A.md,30.2%,中等,47 -2557,2500-2599,2557. 从一个范围内选择最多整数 II,从一个范围内选择最多整数 II,https://leetcode.cn/problems/maximum-number-of-integers-to-choose-from-a-range-ii/,maximum-number-of-integers-to-choose-from-a-range-ii,贪心、数组、二分查找、排序,https://algo.itcharge.cn/Solutions/2500-2599/maximum-number-of-integers-to-choose-from-a-range-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2557.%20%E4%BB%8E%E4%B8%80%E4%B8%AA%E8%8C%83%E5%9B%B4%E5%86%85%E9%80%89%E6%8B%A9%E6%9C%80%E5%A4%9A%E6%95%B4%E6%95%B0%20II.md,43.1%,中等,7 -2558,2500-2599,2558. 从数量最多的堆取走礼物,从数量最多的堆取走礼物,https://leetcode.cn/problems/take-gifts-from-the-richest-pile/,take-gifts-from-the-richest-pile,数组、模拟、堆（优先队列）,https://algo.itcharge.cn/Solutions/2500-2599/take-gifts-from-the-richest-pile/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2558.%20%E4%BB%8E%E6%95%B0%E9%87%8F%E6%9C%80%E5%A4%9A%E7%9A%84%E5%A0%86%E5%8F%96%E8%B5%B0%E7%A4%BC%E7%89%A9.md,68.1%,简单,71 -2559,2500-2599,2559. 统计范围内的元音字符串数,统计范围内的元音字符串数,https://leetcode.cn/problems/count-vowel-strings-in-ranges/,count-vowel-strings-in-ranges,数组、字符串、前缀和,https://algo.itcharge.cn/Solutions/2500-2599/count-vowel-strings-in-ranges/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2559.%20%E7%BB%9F%E8%AE%A1%E8%8C%83%E5%9B%B4%E5%86%85%E7%9A%84%E5%85%83%E9%9F%B3%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%95%B0.md,64.3%,中等,257 -2560,2500-2599,2560. 打家劫舍 IV,打家劫舍 IV,https://leetcode.cn/problems/house-robber-iv/,house-robber-iv,数组、二分查找,https://algo.itcharge.cn/Solutions/2500-2599/house-robber-iv/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2560.%20%E6%89%93%E5%AE%B6%E5%8A%AB%E8%88%8D%20IV.md,49.6%,中等,66 -2561,2500-2599,2561. 重排水果,重排水果,https://leetcode.cn/problems/rearranging-fruits/,rearranging-fruits,贪心、数组、哈希表,https://algo.itcharge.cn/Solutions/2500-2599/rearranging-fruits/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2561.%20%E9%87%8D%E6%8E%92%E6%B0%B4%E6%9E%9C.md,36.5%,困难,36 -2562,2500-2599,2562. 找出数组的串联值,找出数组的串联值,https://leetcode.cn/problems/find-the-array-concatenation-value/,find-the-array-concatenation-value,数组、双指针、模拟,https://algo.itcharge.cn/Solutions/2500-2599/find-the-array-concatenation-value/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2562.%20%E6%89%BE%E5%87%BA%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%B2%E8%81%94%E5%80%BC.md,73.2%,简单,77 -2563,2500-2599,2563. 统计公平数对的数目,统计公平数对的数目,https://leetcode.cn/problems/count-the-number-of-fair-pairs/,count-the-number-of-fair-pairs,数组、双指针、二分查找、排序,https://algo.itcharge.cn/Solutions/2500-2599/count-the-number-of-fair-pairs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2563.%20%E7%BB%9F%E8%AE%A1%E5%85%AC%E5%B9%B3%E6%95%B0%E5%AF%B9%E7%9A%84%E6%95%B0%E7%9B%AE.md,33.5%,中等,77 -2564,2500-2599,2564. 子字符串异或查询,子字符串异或查询,https://leetcode.cn/problems/substring-xor-queries/,substring-xor-queries,位运算、数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/2500-2599/substring-xor-queries/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2564.%20%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%BC%82%E6%88%96%E6%9F%A5%E8%AF%A2.md,36.4%,中等,61 -2565,2500-2599,2565. 最少得分子序列,最少得分子序列,https://leetcode.cn/problems/subsequence-with-the-minimum-score/,subsequence-with-the-minimum-score,双指针、字符串、二分查找,https://algo.itcharge.cn/Solutions/2500-2599/subsequence-with-the-minimum-score/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2565.%20%E6%9C%80%E5%B0%91%E5%BE%97%E5%88%86%E5%AD%90%E5%BA%8F%E5%88%97.md,35.8%,困难,34 -2566,2500-2599,2566. 替换一个数字后的最大差值,替换一个数字后的最大差值,https://leetcode.cn/problems/maximum-difference-by-remapping-a-digit/,maximum-difference-by-remapping-a-digit,贪心、数学,https://algo.itcharge.cn/Solutions/2500-2599/maximum-difference-by-remapping-a-digit/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2566.%20%E6%9B%BF%E6%8D%A2%E4%B8%80%E4%B8%AA%E6%95%B0%E5%AD%97%E5%90%8E%E7%9A%84%E6%9C%80%E5%A4%A7%E5%B7%AE%E5%80%BC.md,63.7%,简单,50 -2567,2500-2599,2567. 修改两个元素的最小分数,修改两个元素的最小分数,https://leetcode.cn/problems/minimum-score-by-changing-two-elements/,minimum-score-by-changing-two-elements,贪心、数组、排序,https://algo.itcharge.cn/Solutions/2500-2599/minimum-score-by-changing-two-elements/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2567.%20%E4%BF%AE%E6%94%B9%E4%B8%A4%E4%B8%AA%E5%85%83%E7%B4%A0%E7%9A%84%E6%9C%80%E5%B0%8F%E5%88%86%E6%95%B0.md,51.8%,中等,36 -2568,2500-2599,2568. 最小无法得到的或值,最小无法得到的或值,https://leetcode.cn/problems/minimum-impossible-or/,minimum-impossible-or,位运算、脑筋急转弯、数组,https://algo.itcharge.cn/Solutions/2500-2599/minimum-impossible-or/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2568.%20%E6%9C%80%E5%B0%8F%E6%97%A0%E6%B3%95%E5%BE%97%E5%88%B0%E7%9A%84%E6%88%96%E5%80%BC.md,59.8%,中等,28 -2569,2500-2599,2569. 更新数组后处理求和查询,更新数组后处理求和查询,https://leetcode.cn/problems/handling-sum-queries-after-update/,handling-sum-queries-after-update,线段树、数组,https://algo.itcharge.cn/Solutions/2500-2599/handling-sum-queries-after-update/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2569.%20%E6%9B%B4%E6%96%B0%E6%95%B0%E7%BB%84%E5%90%8E%E5%A4%84%E7%90%86%E6%B1%82%E5%92%8C%E6%9F%A5%E8%AF%A2.md,39.7%,困难,43 -2570,2500-2599,2570. 合并两个二维数组 - 求和法,合并两个二维数组 - 求和法,https://leetcode.cn/problems/merge-two-2d-arrays-by-summing-values/,merge-two-2d-arrays-by-summing-values,数组、哈希表、双指针,https://algo.itcharge.cn/Solutions/2500-2599/merge-two-2d-arrays-by-summing-values/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2570.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E4%BA%8C%E7%BB%B4%E6%95%B0%E7%BB%84%20-%20%E6%B1%82%E5%92%8C%E6%B3%95.md,69.6%,简单,71 -2571,2500-2599,2571. 将整数减少到零需要的最少操作数,将整数减少到零需要的最少操作数,https://leetcode.cn/problems/minimum-operations-to-reduce-an-integer-to-0/,minimum-operations-to-reduce-an-integer-to-0,贪心、位运算、动态规划,https://algo.itcharge.cn/Solutions/2500-2599/minimum-operations-to-reduce-an-integer-to-0/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2571.%20%E5%B0%86%E6%95%B4%E6%95%B0%E5%87%8F%E5%B0%91%E5%88%B0%E9%9B%B6%E9%9C%80%E8%A6%81%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%95%B0.md,54.0%,中等,116 -2572,2500-2599,2572. 无平方子集计数,无平方子集计数,https://leetcode.cn/problems/count-the-number-of-square-free-subsets/,count-the-number-of-square-free-subsets,位运算、数组、数学、动态规划、状态压缩,https://algo.itcharge.cn/Solutions/2500-2599/count-the-number-of-square-free-subsets/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2572.%20%E6%97%A0%E5%B9%B3%E6%96%B9%E5%AD%90%E9%9B%86%E8%AE%A1%E6%95%B0.md,29.8%,中等,43 -2573,2500-2599,2573. 找出对应 LCP 矩阵的字符串,找出对应 LCP 矩阵的字符串,https://leetcode.cn/problems/find-the-string-with-lcp/,find-the-string-with-lcp,贪心、并查集、字符串、动态规划,https://algo.itcharge.cn/Solutions/2500-2599/find-the-string-with-lcp/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2573.%20%E6%89%BE%E5%87%BA%E5%AF%B9%E5%BA%94%20LCP%20%E7%9F%A9%E9%98%B5%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2.md,35.3%,困难,31 -2574,2500-2599,2574. 左右元素和的差值,左右元素和的差值,https://leetcode.cn/problems/left-and-right-sum-differences/,left-and-right-sum-differences,数组、前缀和,https://algo.itcharge.cn/Solutions/2500-2599/left-and-right-sum-differences/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2574.%20%E5%B7%A6%E5%8F%B3%E5%85%83%E7%B4%A0%E5%92%8C%E7%9A%84%E5%B7%AE%E5%80%BC.md,85.0%,简单,104 -2575,2500-2599,2575. 找出字符串的可整除数组,找出字符串的可整除数组,https://leetcode.cn/problems/find-the-divisibility-array-of-a-string/,find-the-divisibility-array-of-a-string,数组、数学、字符串,https://algo.itcharge.cn/Solutions/2500-2599/find-the-divisibility-array-of-a-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2575.%20%E6%89%BE%E5%87%BA%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E5%8F%AF%E6%95%B4%E9%99%A4%E6%95%B0%E7%BB%84.md,32.8%,中等,75 -2576,2500-2599,2576. 求出最多标记下标,求出最多标记下标,https://leetcode.cn/problems/find-the-maximum-number-of-marked-indices/,find-the-maximum-number-of-marked-indices,贪心、数组、双指针、二分查找、排序,https://algo.itcharge.cn/Solutions/2500-2599/find-the-maximum-number-of-marked-indices/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2576.%20%E6%B1%82%E5%87%BA%E6%9C%80%E5%A4%9A%E6%A0%87%E8%AE%B0%E4%B8%8B%E6%A0%87.md,36.8%,中等,78 -2577,2500-2599,2577. 在网格图中访问一个格子的最少时间,在网格图中访问一个格子的最少时间,https://leetcode.cn/problems/minimum-time-to-visit-a-cell-in-a-grid/,minimum-time-to-visit-a-cell-in-a-grid,广度优先搜索、图、数组、矩阵、最短路、堆（优先队列）,https://algo.itcharge.cn/Solutions/2500-2599/minimum-time-to-visit-a-cell-in-a-grid/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2577.%20%E5%9C%A8%E7%BD%91%E6%A0%BC%E5%9B%BE%E4%B8%AD%E8%AE%BF%E9%97%AE%E4%B8%80%E4%B8%AA%E6%A0%BC%E5%AD%90%E7%9A%84%E6%9C%80%E5%B0%91%E6%97%B6%E9%97%B4.md,39.4%,困难,46 -2578,2500-2599,2578. 最小和分割,最小和分割,https://leetcode.cn/problems/split-with-minimum-sum/,split-with-minimum-sum,贪心、数学、排序,https://algo.itcharge.cn/Solutions/2500-2599/split-with-minimum-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2578.%20%E6%9C%80%E5%B0%8F%E5%92%8C%E5%88%86%E5%89%B2.md,76.7%,简单,67 -2579,2500-2599,2579. 统计染色格子数,统计染色格子数,https://leetcode.cn/problems/count-total-number-of-colored-cells/,count-total-number-of-colored-cells,数学,https://algo.itcharge.cn/Solutions/2500-2599/count-total-number-of-colored-cells/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2579.%20%E7%BB%9F%E8%AE%A1%E6%9F%93%E8%89%B2%E6%A0%BC%E5%AD%90%E6%95%B0.md,66.4%,中等,36 -2580,2500-2599,2580. 统计将重叠区间合并成组的方案数,统计将重叠区间合并成组的方案数,https://leetcode.cn/problems/count-ways-to-group-overlapping-ranges/,count-ways-to-group-overlapping-ranges,数组、排序,https://algo.itcharge.cn/Solutions/2500-2599/count-ways-to-group-overlapping-ranges/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2580.%20%E7%BB%9F%E8%AE%A1%E5%B0%86%E9%87%8D%E5%8F%A0%E5%8C%BA%E9%97%B4%E5%90%88%E5%B9%B6%E6%88%90%E7%BB%84%E7%9A%84%E6%96%B9%E6%A1%88%E6%95%B0.md,35.4%,中等,50 -2581,2500-2599,2581. 统计可能的树根数目,统计可能的树根数目,https://leetcode.cn/problems/count-number-of-possible-root-nodes/,count-number-of-possible-root-nodes,树、深度优先搜索、哈希表、动态规划,https://algo.itcharge.cn/Solutions/2500-2599/count-number-of-possible-root-nodes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2581.%20%E7%BB%9F%E8%AE%A1%E5%8F%AF%E8%83%BD%E7%9A%84%E6%A0%91%E6%A0%B9%E6%95%B0%E7%9B%AE.md,57.7%,困难,26 -2582,2500-2599,2582. 递枕头,递枕头,https://leetcode.cn/problems/pass-the-pillow/,pass-the-pillow,数学、模拟,https://algo.itcharge.cn/Solutions/2500-2599/pass-the-pillow/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2582.%20%E9%80%92%E6%9E%95%E5%A4%B4.md,55.9%,简单,88 -2583,2500-2599,2583. 二叉树中的第 K 大层和,二叉树中的第 K 大层和,https://leetcode.cn/problems/kth-largest-sum-in-a-binary-tree/,kth-largest-sum-in-a-binary-tree,树、广度优先搜索、二分查找,https://algo.itcharge.cn/Solutions/2500-2599/kth-largest-sum-in-a-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2583.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E7%9A%84%E7%AC%AC%20K%20%E5%A4%A7%E5%B1%82%E5%92%8C.md,44.0%,中等,68 -2584,2500-2599,2584. 分割数组使乘积互质,分割数组使乘积互质,https://leetcode.cn/problems/split-the-array-to-make-coprime-products/,split-the-array-to-make-coprime-products,数组、哈希表、数学、数论,https://algo.itcharge.cn/Solutions/2500-2599/split-the-array-to-make-coprime-products/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2584.%20%E5%88%86%E5%89%B2%E6%95%B0%E7%BB%84%E4%BD%BF%E4%B9%98%E7%A7%AF%E4%BA%92%E8%B4%A8.md,25.4%,困难,72 -2585,2500-2599,2585. 获得分数的方法数,获得分数的方法数,https://leetcode.cn/problems/number-of-ways-to-earn-points/,number-of-ways-to-earn-points,数组、动态规划,https://algo.itcharge.cn/Solutions/2500-2599/number-of-ways-to-earn-points/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2585.%20%E8%8E%B7%E5%BE%97%E5%88%86%E6%95%B0%E7%9A%84%E6%96%B9%E6%B3%95%E6%95%B0.md,64.5%,困难,56 -2586,2500-2599,2586. 统计范围内的元音字符串数,统计范围内的元音字符串数,https://leetcode.cn/problems/count-the-number-of-vowel-strings-in-range/,count-the-number-of-vowel-strings-in-range,数组、字符串,https://algo.itcharge.cn/Solutions/2500-2599/count-the-number-of-vowel-strings-in-range/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2586.%20%E7%BB%9F%E8%AE%A1%E8%8C%83%E5%9B%B4%E5%86%85%E7%9A%84%E5%85%83%E9%9F%B3%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%95%B0.md,81.6%,简单,55 -2587,2500-2599,2587. 重排数组以得到最大前缀分数,重排数组以得到最大前缀分数,https://leetcode.cn/problems/rearrange-array-to-maximize-prefix-score/,rearrange-array-to-maximize-prefix-score,贪心、数组、前缀和、排序,https://algo.itcharge.cn/Solutions/2500-2599/rearrange-array-to-maximize-prefix-score/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2587.%20%E9%87%8D%E6%8E%92%E6%95%B0%E7%BB%84%E4%BB%A5%E5%BE%97%E5%88%B0%E6%9C%80%E5%A4%A7%E5%89%8D%E7%BC%80%E5%88%86%E6%95%B0.md,40.6%,中等,44 -2588,2500-2599,2588. 统计美丽子数组数目,统计美丽子数组数目,https://leetcode.cn/problems/count-the-number-of-beautiful-subarrays/,count-the-number-of-beautiful-subarrays,位运算、数组、哈希表、前缀和,https://algo.itcharge.cn/Solutions/2500-2599/count-the-number-of-beautiful-subarrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2588.%20%E7%BB%9F%E8%AE%A1%E7%BE%8E%E4%B8%BD%E5%AD%90%E6%95%B0%E7%BB%84%E6%95%B0%E7%9B%AE.md,41.9%,中等,60 -2589,2500-2599,2589. 完成所有任务的最少时间,完成所有任务的最少时间,https://leetcode.cn/problems/minimum-time-to-complete-all-tasks/,minimum-time-to-complete-all-tasks,栈、贪心、数组、二分查找、排序,https://algo.itcharge.cn/Solutions/2500-2599/minimum-time-to-complete-all-tasks/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2589.%20%E5%AE%8C%E6%88%90%E6%89%80%E6%9C%89%E4%BB%BB%E5%8A%A1%E7%9A%84%E6%9C%80%E5%B0%91%E6%97%B6%E9%97%B4.md,42.7%,困难,34 -2590,2500-2599,2590. 设计一个待办事项清单,设计一个待办事项清单,https://leetcode.cn/problems/design-a-todo-list/,design-a-todo-list,设计、数组、哈希表、字符串、排序,https://algo.itcharge.cn/Solutions/2500-2599/design-a-todo-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2590.%20%E8%AE%BE%E8%AE%A1%E4%B8%80%E4%B8%AA%E5%BE%85%E5%8A%9E%E4%BA%8B%E9%A1%B9%E6%B8%85%E5%8D%95.md,55.5%,中等,4 -2591,2500-2599,2591. 将钱分给最多的儿童,将钱分给最多的儿童,https://leetcode.cn/problems/distribute-money-to-maximum-children/,distribute-money-to-maximum-children,贪心、数学,https://algo.itcharge.cn/Solutions/2500-2599/distribute-money-to-maximum-children/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2591.%20%E5%B0%86%E9%92%B1%E5%88%86%E7%BB%99%E6%9C%80%E5%A4%9A%E7%9A%84%E5%84%BF%E7%AB%A5.md,20.8%,简单,59 -2592,2500-2599,2592. 最大化数组的伟大值,最大化数组的伟大值,https://leetcode.cn/problems/maximize-greatness-of-an-array/,maximize-greatness-of-an-array,贪心、数组、双指针、排序,https://algo.itcharge.cn/Solutions/2500-2599/maximize-greatness-of-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2592.%20%E6%9C%80%E5%A4%A7%E5%8C%96%E6%95%B0%E7%BB%84%E7%9A%84%E4%BC%9F%E5%A4%A7%E5%80%BC.md,57.7%,中等,57 -2593,2500-2599,2593. 标记所有元素后数组的分数,标记所有元素后数组的分数,https://leetcode.cn/problems/find-score-of-an-array-after-marking-all-elements/,find-score-of-an-array-after-marking-all-elements,数组、排序、模拟、堆（优先队列）,https://algo.itcharge.cn/Solutions/2500-2599/find-score-of-an-array-after-marking-all-elements/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2593.%20%E6%A0%87%E8%AE%B0%E6%89%80%E6%9C%89%E5%85%83%E7%B4%A0%E5%90%8E%E6%95%B0%E7%BB%84%E7%9A%84%E5%88%86%E6%95%B0.md,51.9%,中等,51 -2594,2500-2599,2594. 修车的最少时间,修车的最少时间,https://leetcode.cn/problems/minimum-time-to-repair-cars/,minimum-time-to-repair-cars,数组、二分查找,https://algo.itcharge.cn/Solutions/2500-2599/minimum-time-to-repair-cars/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2594.%20%E4%BF%AE%E8%BD%A6%E7%9A%84%E6%9C%80%E5%B0%91%E6%97%B6%E9%97%B4.md,45.6%,中等,33 -2595,2500-2599,2595. 奇偶位数,奇偶位数,https://leetcode.cn/problems/number-of-even-and-odd-bits/,number-of-even-and-odd-bits,位运算,https://algo.itcharge.cn/Solutions/2500-2599/number-of-even-and-odd-bits/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2595.%20%E5%A5%87%E5%81%B6%E4%BD%8D%E6%95%B0.md,72.8%,简单,58 -2596,2500-2599,2596. 检查骑士巡视方案,检查骑士巡视方案,https://leetcode.cn/problems/check-knight-tour-configuration/,check-knight-tour-configuration,深度优先搜索、广度优先搜索、数组、矩阵、模拟,https://algo.itcharge.cn/Solutions/2500-2599/check-knight-tour-configuration/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2596.%20%E6%A3%80%E6%9F%A5%E9%AA%91%E5%A3%AB%E5%B7%A1%E8%A7%86%E6%96%B9%E6%A1%88.md,52.5%,中等,99 -2597,2500-2599,2597. 美丽子集的数目,美丽子集的数目,https://leetcode.cn/problems/the-number-of-beautiful-subsets/,the-number-of-beautiful-subsets,数组、动态规划、回溯,https://algo.itcharge.cn/Solutions/2500-2599/the-number-of-beautiful-subsets/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2597.%20%E7%BE%8E%E4%B8%BD%E5%AD%90%E9%9B%86%E7%9A%84%E6%95%B0%E7%9B%AE.md,34.7%,中等,56 -2598,2500-2599,2598. 执行操作后的最大 MEX,执行操作后的最大 MEX,https://leetcode.cn/problems/smallest-missing-non-negative-integer-after-operations/,smallest-missing-non-negative-integer-after-operations,贪心、数组、哈希表、数学,https://algo.itcharge.cn/Solutions/2500-2599/smallest-missing-non-negative-integer-after-operations/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2598.%20%E6%89%A7%E8%A1%8C%E6%93%8D%E4%BD%9C%E5%90%8E%E7%9A%84%E6%9C%80%E5%A4%A7%20MEX.md,39.1%,中等,55 -2599,2500-2599,2599. 使前缀和数组非负,使前缀和数组非负,https://leetcode.cn/problems/make-the-prefix-sum-non-negative/,make-the-prefix-sum-non-negative,贪心、数组、堆（优先队列）,https://algo.itcharge.cn/Solutions/2500-2599/make-the-prefix-sum-non-negative/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2599.%20%E4%BD%BF%E5%89%8D%E7%BC%80%E5%92%8C%E6%95%B0%E7%BB%84%E9%9D%9E%E8%B4%9F.md,55.4%,中等,5 -2600,2600-2699,2600. K 件物品的最大和,K 件物品的最大和,https://leetcode.cn/problems/k-items-with-the-maximum-sum/,k-items-with-the-maximum-sum,贪心、数学,https://algo.itcharge.cn/Solutions/2600-2699/k-items-with-the-maximum-sum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2600.%20K%20%E4%BB%B6%E7%89%A9%E5%93%81%E7%9A%84%E6%9C%80%E5%A4%A7%E5%92%8C.md,66.0%,简单,59 -2601,2600-2699,2601. 质数减法运算,质数减法运算,https://leetcode.cn/problems/prime-subtraction-operation/,prime-subtraction-operation,贪心、数组、数学、二分查找、数论,https://algo.itcharge.cn/Solutions/2600-2699/prime-subtraction-operation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2601.%20%E8%B4%A8%E6%95%B0%E5%87%8F%E6%B3%95%E8%BF%90%E7%AE%97.md,38.6%,中等,86 -2602,2600-2699,2602. 使数组元素全部相等的最少操作次数,使数组元素全部相等的最少操作次数,https://leetcode.cn/problems/minimum-operations-to-make-all-array-elements-equal/,minimum-operations-to-make-all-array-elements-equal,数组、二分查找、前缀和、排序,https://algo.itcharge.cn/Solutions/2600-2699/minimum-operations-to-make-all-array-elements-equal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2602.%20%E4%BD%BF%E6%95%B0%E7%BB%84%E5%85%83%E7%B4%A0%E5%85%A8%E9%83%A8%E7%9B%B8%E7%AD%89%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0.md,33.4%,中等,99 -2603,2600-2699,2603. 收集树中金币,收集树中金币,https://leetcode.cn/problems/collect-coins-in-a-tree/,collect-coins-in-a-tree,树、图、拓扑排序、数组,https://algo.itcharge.cn/Solutions/2600-2699/collect-coins-in-a-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2603.%20%E6%94%B6%E9%9B%86%E6%A0%91%E4%B8%AD%E9%87%91%E5%B8%81.md,43.6%,困难,42 -2604,2600-2699,2604. 吃掉所有谷子的最短时间,吃掉所有谷子的最短时间,https://leetcode.cn/problems/minimum-time-to-eat-all-grains/,minimum-time-to-eat-all-grains,数组、二分查找、排序,https://algo.itcharge.cn/Solutions/2600-2699/minimum-time-to-eat-all-grains/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2604.%20%E5%90%83%E6%8E%89%E6%89%80%E6%9C%89%E8%B0%B7%E5%AD%90%E7%9A%84%E6%9C%80%E7%9F%AD%E6%97%B6%E9%97%B4.md,38.0%,困难,3 -2605,2600-2699,2605. 从两个数字数组里生成最小数字,从两个数字数组里生成最小数字,https://leetcode.cn/problems/form-smallest-number-from-two-digit-arrays/,form-smallest-number-from-two-digit-arrays,数组、哈希表、枚举,https://algo.itcharge.cn/Solutions/2600-2699/form-smallest-number-from-two-digit-arrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2605.%20%E4%BB%8E%E4%B8%A4%E4%B8%AA%E6%95%B0%E5%AD%97%E6%95%B0%E7%BB%84%E9%87%8C%E7%94%9F%E6%88%90%E6%9C%80%E5%B0%8F%E6%95%B0%E5%AD%97.md,63.3%,简单,48 -2606,2600-2699,2606. 找到最大开销的子字符串,找到最大开销的子字符串,https://leetcode.cn/problems/find-the-substring-with-maximum-cost/,find-the-substring-with-maximum-cost,数组、哈希表、字符串、动态规划,https://algo.itcharge.cn/Solutions/2600-2699/find-the-substring-with-maximum-cost/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2606.%20%E6%89%BE%E5%88%B0%E6%9C%80%E5%A4%A7%E5%BC%80%E9%94%80%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md,53.3%,中等,36 -2607,2600-2699,2607. 使子数组元素和相等,使子数组元素和相等,https://leetcode.cn/problems/make-k-subarray-sums-equal/,make-k-subarray-sums-equal,数组、数学、数论、排序,https://algo.itcharge.cn/Solutions/2600-2699/make-k-subarray-sums-equal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2607.%20%E4%BD%BF%E5%AD%90%E6%95%B0%E7%BB%84%E5%85%83%E7%B4%A0%E5%92%8C%E7%9B%B8%E7%AD%89.md,38.6%,中等,23 -2608,2600-2699,2608. 图中的最短环,图中的最短环,https://leetcode.cn/problems/shortest-cycle-in-a-graph/,shortest-cycle-in-a-graph,广度优先搜索、图,https://algo.itcharge.cn/Solutions/2600-2699/shortest-cycle-in-a-graph/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2608.%20%E5%9B%BE%E4%B8%AD%E7%9A%84%E6%9C%80%E7%9F%AD%E7%8E%AF.md,40.8%,困难,31 -2609,2600-2699,2609. 最长平衡子字符串,最长平衡子字符串,https://leetcode.cn/problems/find-the-longest-balanced-substring-of-a-binary-string/,find-the-longest-balanced-substring-of-a-binary-string,字符串,https://algo.itcharge.cn/Solutions/2600-2699/find-the-longest-balanced-substring-of-a-binary-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2609.%20%E6%9C%80%E9%95%BF%E5%B9%B3%E8%A1%A1%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md,49.3%,简单,95 -2610,2600-2699,2610. 转换二维数组,转换二维数组,https://leetcode.cn/problems/convert-an-array-into-a-2d-array-with-conditions/,convert-an-array-into-a-2d-array-with-conditions,数组、哈希表,https://algo.itcharge.cn/Solutions/2600-2699/convert-an-array-into-a-2d-array-with-conditions/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2610.%20%E8%BD%AC%E6%8D%A2%E4%BA%8C%E7%BB%B4%E6%95%B0%E7%BB%84.md,85.1%,中等,82 -2611,2600-2699,2611. 老鼠和奶酪,老鼠和奶酪,https://leetcode.cn/problems/mice-and-cheese/,mice-and-cheese,贪心、数组、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/2600-2699/mice-and-cheese/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2611.%20%E8%80%81%E9%BC%A0%E5%92%8C%E5%A5%B6%E9%85%AA.md,58.7%,中等,291 -2612,2600-2699,2612. 最少翻转操作数,最少翻转操作数,https://leetcode.cn/problems/minimum-reverse-operations/,minimum-reverse-operations,广度优先搜索、数组、有序集合,https://algo.itcharge.cn/Solutions/2600-2699/minimum-reverse-operations/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2612.%20%E6%9C%80%E5%B0%91%E7%BF%BB%E8%BD%AC%E6%93%8D%E4%BD%9C%E6%95%B0.md,20.8%,困难,33 -2613,2600-2699,2613. 美数对,美数对,https://leetcode.cn/problems/beautiful-pairs/,beautiful-pairs,几何、数组、数学、分治、有序集合、排序,https://algo.itcharge.cn/Solutions/2600-2699/beautiful-pairs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2613.%20%E7%BE%8E%E6%95%B0%E5%AF%B9.md,48.2%,困难,4 -2614,2600-2699,2614. 对角线上的质数,对角线上的质数,https://leetcode.cn/problems/prime-in-diagonal/,prime-in-diagonal,数组、数学、矩阵、数论,https://algo.itcharge.cn/Solutions/2600-2699/prime-in-diagonal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2614.%20%E5%AF%B9%E8%A7%92%E7%BA%BF%E4%B8%8A%E7%9A%84%E8%B4%A8%E6%95%B0.md,32.9%,简单,49 -2615,2600-2699,2615. 等值距离和,等值距离和,https://leetcode.cn/problems/sum-of-distances/,sum-of-distances,数组、哈希表、前缀和,https://algo.itcharge.cn/Solutions/2600-2699/sum-of-distances/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2615.%20%E7%AD%89%E5%80%BC%E8%B7%9D%E7%A6%BB%E5%92%8C.md,35.4%,中等,64 -2616,2600-2699,2616. 最小化数对的最大差值,最小化数对的最大差值,https://leetcode.cn/problems/minimize-the-maximum-difference-of-pairs/,minimize-the-maximum-difference-of-pairs,贪心、数组、二分查找,https://algo.itcharge.cn/Solutions/2600-2699/minimize-the-maximum-difference-of-pairs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2616.%20%E6%9C%80%E5%B0%8F%E5%8C%96%E6%95%B0%E5%AF%B9%E7%9A%84%E6%9C%80%E5%A4%A7%E5%B7%AE%E5%80%BC.md,39.0%,中等,34 -2617,2600-2699,2617. 网格图中最少访问的格子数,网格图中最少访问的格子数,https://leetcode.cn/problems/minimum-number-of-visited-cells-in-a-grid/,minimum-number-of-visited-cells-in-a-grid,栈、并查集、树状数组、线段树、数组、二分查找、动态规划,https://algo.itcharge.cn/Solutions/2600-2699/minimum-number-of-visited-cells-in-a-grid/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2617.%20%E7%BD%91%E6%A0%BC%E5%9B%BE%E4%B8%AD%E6%9C%80%E5%B0%91%E8%AE%BF%E9%97%AE%E7%9A%84%E6%A0%BC%E5%AD%90%E6%95%B0.md,32.6%,困难,62 -2618,2600-2699,2618. 检查是否是类的对象实例,检查是否是类的对象实例,https://leetcode.cn/problems/check-if-object-instance-of-class/,check-if-object-instance-of-class,,https://algo.itcharge.cn/Solutions/2600-2699/check-if-object-instance-of-class/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2618.%20%E6%A3%80%E6%9F%A5%E6%98%AF%E5%90%A6%E6%98%AF%E7%B1%BB%E7%9A%84%E5%AF%B9%E8%B1%A1%E5%AE%9E%E4%BE%8B.md,34.0%,中等,43 -2619,2600-2699,2619. 数组原型对象的最后一个元素,数组原型对象的最后一个元素,https://leetcode.cn/problems/array-prototype-last/,array-prototype-last,,https://algo.itcharge.cn/Solutions/2600-2699/array-prototype-last/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2619.%20%E6%95%B0%E7%BB%84%E5%8E%9F%E5%9E%8B%E5%AF%B9%E8%B1%A1%E7%9A%84%E6%9C%80%E5%90%8E%E4%B8%80%E4%B8%AA%E5%85%83%E7%B4%A0.md,72.2%,简单,60 -2620,2600-2699,2620. 计数器,计数器,https://leetcode.cn/problems/counter/,counter,,https://algo.itcharge.cn/Solutions/2600-2699/counter/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2620.%20%E8%AE%A1%E6%95%B0%E5%99%A8.md,81.9%,简单,57 -2621,2600-2699,2621. 睡眠函数,睡眠函数,https://leetcode.cn/problems/sleep/,sleep,,https://algo.itcharge.cn/Solutions/2600-2699/sleep/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2621.%20%E7%9D%A1%E7%9C%A0%E5%87%BD%E6%95%B0.md,84.0%,简单,38 -2622,2600-2699,2622. 有时间限制的缓存,有时间限制的缓存,https://leetcode.cn/problems/cache-with-time-limit/,cache-with-time-limit,,https://algo.itcharge.cn/Solutions/2600-2699/cache-with-time-limit/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2622.%20%E6%9C%89%E6%97%B6%E9%97%B4%E9%99%90%E5%88%B6%E7%9A%84%E7%BC%93%E5%AD%98.md,55.8%,中等,48 -2623,2600-2699,2623. 记忆函数,记忆函数,https://leetcode.cn/problems/memoize/,memoize,,https://algo.itcharge.cn/Solutions/2600-2699/memoize/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2623.%20%E8%AE%B0%E5%BF%86%E5%87%BD%E6%95%B0.md,61.2%,中等,37 -2624,2600-2699,2624. 蜗牛排序,蜗牛排序,https://leetcode.cn/problems/snail-traversal/,snail-traversal,,https://algo.itcharge.cn/Solutions/2600-2699/snail-traversal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2624.%20%E8%9C%97%E7%89%9B%E6%8E%92%E5%BA%8F.md,66.0%,中等,47 -2625,2600-2699,2625. 扁平化嵌套数组,扁平化嵌套数组,https://leetcode.cn/problems/flatten-deeply-nested-array/,flatten-deeply-nested-array,,https://algo.itcharge.cn/Solutions/2600-2699/flatten-deeply-nested-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2625.%20%E6%89%81%E5%B9%B3%E5%8C%96%E5%B5%8C%E5%A5%97%E6%95%B0%E7%BB%84.md,51.0%,中等,52 -2626,2600-2699,2626. 数组归约运算,数组归约运算,https://leetcode.cn/problems/array-reduce-transformation/,array-reduce-transformation,,https://algo.itcharge.cn/Solutions/2600-2699/array-reduce-transformation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2626.%20%E6%95%B0%E7%BB%84%E5%BD%92%E7%BA%A6%E8%BF%90%E7%AE%97.md,77.7%,简单,42 -2627,2600-2699,2627. 函数防抖,函数防抖,https://leetcode.cn/problems/debounce/,debounce,,https://algo.itcharge.cn/Solutions/2600-2699/debounce/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2627.%20%E5%87%BD%E6%95%B0%E9%98%B2%E6%8A%96.md,77.0%,中等,27 -2628,2600-2699,2628. 完全相等的 JSON 字符串,完全相等的 JSON 字符串,https://leetcode.cn/problems/json-deep-equal/,json-deep-equal,,https://algo.itcharge.cn/Solutions/2600-2699/json-deep-equal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2628.%20%E5%AE%8C%E5%85%A8%E7%9B%B8%E7%AD%89%E7%9A%84%20JSON%20%E5%AD%97%E7%AC%A6%E4%B8%B2.md,32.1%,中等,42 -2629,2600-2699,2629. 复合函数,复合函数,https://leetcode.cn/problems/function-composition/,function-composition,,https://algo.itcharge.cn/Solutions/2600-2699/function-composition/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2629.%20%E5%A4%8D%E5%90%88%E5%87%BD%E6%95%B0.md,81.8%,简单,55 -2630,2600-2699,2630. 记忆函数 II,记忆函数 II,https://leetcode.cn/problems/memoize-ii/,memoize-ii,,https://algo.itcharge.cn/Solutions/2600-2699/memoize-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2630.%20%E8%AE%B0%E5%BF%86%E5%87%BD%E6%95%B0%20II.md,42.5%,困难,16 -2631,2600-2699,2631. 分组,分组,https://leetcode.cn/problems/group-by/,group-by,,https://algo.itcharge.cn/Solutions/2600-2699/group-by/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2631.%20%E5%88%86%E7%BB%84.md,79.8%,中等,31 -2632,2600-2699,2632. 柯里化,柯里化,https://leetcode.cn/problems/curry/,curry,,https://algo.itcharge.cn/Solutions/2600-2699/curry/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2632.%20%E6%9F%AF%E9%87%8C%E5%8C%96.md,81.6%,中等,35 -2633,2600-2699,2633. 将对象转换为 JSON 字符串,将对象转换为 JSON 字符串,https://leetcode.cn/problems/convert-object-to-json-string/,convert-object-to-json-string,,https://algo.itcharge.cn/Solutions/2600-2699/convert-object-to-json-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2633.%20%E5%B0%86%E5%AF%B9%E8%B1%A1%E8%BD%AC%E6%8D%A2%E4%B8%BA%20JSON%20%E5%AD%97%E7%AC%A6%E4%B8%B2.md,57.3%,中等,39 -2634,2600-2699,2634. 过滤数组中的元素,过滤数组中的元素,https://leetcode.cn/problems/filter-elements-from-array/,filter-elements-from-array,,https://algo.itcharge.cn/Solutions/2600-2699/filter-elements-from-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2634.%20%E8%BF%87%E6%BB%A4%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E5%85%83%E7%B4%A0.md,69.3%,简单,49 -2635,2600-2699,2635. 转换数组中的每个元素,转换数组中的每个元素,https://leetcode.cn/problems/apply-transform-over-each-element-in-array/,apply-transform-over-each-element-in-array,,https://algo.itcharge.cn/Solutions/2600-2699/apply-transform-over-each-element-in-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2635.%20%E8%BD%AC%E6%8D%A2%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%AF%8F%E4%B8%AA%E5%85%83%E7%B4%A0.md,73.8%,简单,37 -2636,2600-2699,2636. Promise 对象池,Promise 对象池,https://leetcode.cn/problems/promise-pool/,promise-pool,,https://algo.itcharge.cn/Solutions/2600-2699/promise-pool/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2636.%20Promise%20%E5%AF%B9%E8%B1%A1%E6%B1%A0.md,61.8%,中等,26 -2637,2600-2699,2637. 有时间限制的 Promise 对象,有时间限制的 Promise 对象,https://leetcode.cn/problems/promise-time-limit/,promise-time-limit,,https://algo.itcharge.cn/Solutions/2600-2699/promise-time-limit/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2637.%20%E6%9C%89%E6%97%B6%E9%97%B4%E9%99%90%E5%88%B6%E7%9A%84%20Promise%20%E5%AF%B9%E8%B1%A1.md,62.2%,简单,25 -2638,2600-2699,2638. 统计 K-Free 子集的总数,统计 K-Free 子集的总数,https://leetcode.cn/problems/count-the-number-of-k-free-subsets/,count-the-number-of-k-free-subsets,数组、动态规划、排序,https://algo.itcharge.cn/Solutions/2600-2699/count-the-number-of-k-free-subsets/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2638.%20%E7%BB%9F%E8%AE%A1%20K-Free%20%E5%AD%90%E9%9B%86%E7%9A%84%E6%80%BB%E6%95%B0.md,59.3%,中等,4 -2639,2600-2699,2639. 查询网格图中每一列的宽度,查询网格图中每一列的宽度,https://leetcode.cn/problems/find-the-width-of-columns-of-a-grid/,find-the-width-of-columns-of-a-grid,数组、矩阵,https://algo.itcharge.cn/Solutions/2600-2699/find-the-width-of-columns-of-a-grid/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2639.%20%E6%9F%A5%E8%AF%A2%E7%BD%91%E6%A0%BC%E5%9B%BE%E4%B8%AD%E6%AF%8F%E4%B8%80%E5%88%97%E7%9A%84%E5%AE%BD%E5%BA%A6.md,76.5%,简单,34 -2640,2600-2699,2640. 一个数组所有前缀的分数,一个数组所有前缀的分数,https://leetcode.cn/problems/find-the-score-of-all-prefixes-of-an-array/,find-the-score-of-all-prefixes-of-an-array,数组、前缀和,https://algo.itcharge.cn/Solutions/2600-2699/find-the-score-of-all-prefixes-of-an-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2640.%20%E4%B8%80%E4%B8%AA%E6%95%B0%E7%BB%84%E6%89%80%E6%9C%89%E5%89%8D%E7%BC%80%E7%9A%84%E5%88%86%E6%95%B0.md,79.9%,中等,30 -2641,2600-2699,2641. 二叉树的堂兄弟节点 II,二叉树的堂兄弟节点 II,https://leetcode.cn/problems/cousins-in-binary-tree-ii/,cousins-in-binary-tree-ii,树、深度优先搜索、广度优先搜索、哈希表、二叉树,https://algo.itcharge.cn/Solutions/2600-2699/cousins-in-binary-tree-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2641.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%A0%82%E5%85%84%E5%BC%9F%E8%8A%82%E7%82%B9%20II.md,70.1%,中等,38 -2642,2600-2699,2642. 设计可以求最短路径的图类,设计可以求最短路径的图类,https://leetcode.cn/problems/design-graph-with-shortest-path-calculator/,design-graph-with-shortest-path-calculator,图、设计、最短路、堆（优先队列）,https://algo.itcharge.cn/Solutions/2600-2699/design-graph-with-shortest-path-calculator/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2642.%20%E8%AE%BE%E8%AE%A1%E5%8F%AF%E4%BB%A5%E6%B1%82%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84%E7%9A%84%E5%9B%BE%E7%B1%BB.md,55.4%,困难,47 -2643,2600-2699,2643. 一最多的行,一最多的行,https://leetcode.cn/problems/row-with-maximum-ones/,row-with-maximum-ones,数组、矩阵,https://algo.itcharge.cn/Solutions/2600-2699/row-with-maximum-ones/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2643.%20%E4%B8%80%E6%9C%80%E5%A4%9A%E7%9A%84%E8%A1%8C.md,80.3%,简单,40 -2644,2600-2699,2644. 找出可整除性得分最大的整数,找出可整除性得分最大的整数,https://leetcode.cn/problems/find-the-maximum-divisibility-score/,find-the-maximum-divisibility-score,数组,https://algo.itcharge.cn/Solutions/2600-2699/find-the-maximum-divisibility-score/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2644.%20%E6%89%BE%E5%87%BA%E5%8F%AF%E6%95%B4%E9%99%A4%E6%80%A7%E5%BE%97%E5%88%86%E6%9C%80%E5%A4%A7%E7%9A%84%E6%95%B4%E6%95%B0.md,50.3%,简单,29 -2645,2600-2699,2645. 构造有效字符串的最少插入数,构造有效字符串的最少插入数,https://leetcode.cn/problems/minimum-additions-to-make-valid-string/,minimum-additions-to-make-valid-string,栈、贪心、字符串、动态规划,https://algo.itcharge.cn/Solutions/2600-2699/minimum-additions-to-make-valid-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2645.%20%E6%9E%84%E9%80%A0%E6%9C%89%E6%95%88%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%9C%80%E5%B0%91%E6%8F%92%E5%85%A5%E6%95%B0.md,56.5%,中等,101 -2646,2600-2699,2646. 最小化旅行的价格总和,最小化旅行的价格总和,https://leetcode.cn/problems/minimize-the-total-price-of-the-trips/,minimize-the-total-price-of-the-trips,树、深度优先搜索、图、数组、动态规划,https://algo.itcharge.cn/Solutions/2600-2699/minimize-the-total-price-of-the-trips/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2646.%20%E6%9C%80%E5%B0%8F%E5%8C%96%E6%97%85%E8%A1%8C%E7%9A%84%E4%BB%B7%E6%A0%BC%E6%80%BB%E5%92%8C.md,49.8%,困难,50 -2647,2600-2699,2647. 把三角形染成红色,把三角形染成红色,https://leetcode.cn/problems/color-the-triangle-red/,color-the-triangle-red,数组、数学,https://algo.itcharge.cn/Solutions/2600-2699/color-the-triangle-red/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2647.%20%E6%8A%8A%E4%B8%89%E8%A7%92%E5%BD%A2%E6%9F%93%E6%88%90%E7%BA%A2%E8%89%B2.md,68.6%,困难,1 -2648,2600-2699,2648. 生成斐波那契数列,生成斐波那契数列,https://leetcode.cn/problems/generate-fibonacci-sequence/,generate-fibonacci-sequence,,https://algo.itcharge.cn/Solutions/2600-2699/generate-fibonacci-sequence/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2648.%20%E7%94%9F%E6%88%90%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0%E5%88%97.md,83.9%,简单,34 -2649,2600-2699,2649. 嵌套数组生成器,嵌套数组生成器,https://leetcode.cn/problems/nested-array-generator/,nested-array-generator,,https://algo.itcharge.cn/Solutions/2600-2699/nested-array-generator/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2649.%20%E5%B5%8C%E5%A5%97%E6%95%B0%E7%BB%84%E7%94%9F%E6%88%90%E5%99%A8.md,78.3%,中等,30 -2650,2600-2699,2650. 设计可取消函数,设计可取消函数,https://leetcode.cn/problems/design-cancellable-function/,design-cancellable-function,,https://algo.itcharge.cn/Solutions/2600-2699/design-cancellable-function/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2650.%20%E8%AE%BE%E8%AE%A1%E5%8F%AF%E5%8F%96%E6%B6%88%E5%87%BD%E6%95%B0.md,50.6%,困难,17 -2651,2600-2699,2651. 计算列车到站时间,计算列车到站时间,https://leetcode.cn/problems/calculate-delayed-arrival-time/,calculate-delayed-arrival-time,数学,https://algo.itcharge.cn/Solutions/2600-2699/calculate-delayed-arrival-time/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2651.%20%E8%AE%A1%E7%AE%97%E5%88%97%E8%BD%A6%E5%88%B0%E7%AB%99%E6%97%B6%E9%97%B4.md,86.8%,简单,33 -2652,2600-2699,2652. 倍数求和,倍数求和,https://leetcode.cn/problems/sum-multiples/,sum-multiples,数组、数学、数论,https://algo.itcharge.cn/Solutions/2600-2699/sum-multiples/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2652.%20%E5%80%8D%E6%95%B0%E6%B1%82%E5%92%8C.md,83.6%,简单,42 -2653,2600-2699,2653. 滑动子数组的美丽值,滑动子数组的美丽值,https://leetcode.cn/problems/sliding-subarray-beauty/,sliding-subarray-beauty,数组、哈希表、滑动窗口,https://algo.itcharge.cn/Solutions/2600-2699/sliding-subarray-beauty/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2653.%20%E6%BB%91%E5%8A%A8%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E7%BE%8E%E4%B8%BD%E5%80%BC.md,35.0%,中等,62 -2654,2600-2699,2654. 使数组所有元素变成 1 的最少操作次数,使数组所有元素变成 1 的最少操作次数,https://leetcode.cn/problems/minimum-number-of-operations-to-make-all-array-elements-equal-to-1/,minimum-number-of-operations-to-make-all-array-elements-equal-to-1,数组、数学、数论,https://algo.itcharge.cn/Solutions/2600-2699/minimum-number-of-operations-to-make-all-array-elements-equal-to-1/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2654.%20%E4%BD%BF%E6%95%B0%E7%BB%84%E6%89%80%E6%9C%89%E5%85%83%E7%B4%A0%E5%8F%98%E6%88%90%201%20%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0.md,40.1%,中等,28 -2655,2600-2699,2655. 寻找最大长度的未覆盖区间,寻找最大长度的未覆盖区间,https://leetcode.cn/problems/find-maximal-uncovered-ranges/,find-maximal-uncovered-ranges,数组、排序,https://algo.itcharge.cn/Solutions/2600-2699/find-maximal-uncovered-ranges/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2655.%20%E5%AF%BB%E6%89%BE%E6%9C%80%E5%A4%A7%E9%95%BF%E5%BA%A6%E7%9A%84%E6%9C%AA%E8%A6%86%E7%9B%96%E5%8C%BA%E9%97%B4.md,63.2%,中等,4 -2656,2600-2699,2656. K 个元素的最大和,K 个元素的最大和,https://leetcode.cn/problems/maximum-sum-with-exactly-k-elements/,maximum-sum-with-exactly-k-elements,贪心、数组,https://algo.itcharge.cn/Solutions/2600-2699/maximum-sum-with-exactly-k-elements/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2656.%20K%20%E4%B8%AA%E5%85%83%E7%B4%A0%E7%9A%84%E6%9C%80%E5%A4%A7%E5%92%8C.md,84.1%,简单,49 -2657,2600-2699,2657. 找到两个数组的前缀公共数组,找到两个数组的前缀公共数组,https://leetcode.cn/problems/find-the-prefix-common-array-of-two-arrays/,find-the-prefix-common-array-of-two-arrays,数组、哈希表,https://algo.itcharge.cn/Solutions/2600-2699/find-the-prefix-common-array-of-two-arrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2657.%20%E6%89%BE%E5%88%B0%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E7%9A%84%E5%89%8D%E7%BC%80%E5%85%AC%E5%85%B1%E6%95%B0%E7%BB%84.md,83.4%,中等,35 -2658,2600-2699,2658. 网格图中鱼的最大数目,网格图中鱼的最大数目,https://leetcode.cn/problems/maximum-number-of-fish-in-a-grid/,maximum-number-of-fish-in-a-grid,深度优先搜索、广度优先搜索、并查集、数组、矩阵,https://algo.itcharge.cn/Solutions/2600-2699/maximum-number-of-fish-in-a-grid/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2658.%20%E7%BD%91%E6%A0%BC%E5%9B%BE%E4%B8%AD%E9%B1%BC%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E7%9B%AE.md,60.4%,中等,36 -2659,2600-2699,2659. 将数组清空,将数组清空,https://leetcode.cn/problems/make-array-empty/,make-array-empty,贪心、树状数组、线段树、数组、二分查找、有序集合、排序,https://algo.itcharge.cn/Solutions/2600-2699/make-array-empty/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2659.%20%E5%B0%86%E6%95%B0%E7%BB%84%E6%B8%85%E7%A9%BA.md,38.4%,困难,28 -2660,2600-2699,2660. 保龄球游戏的获胜者,保龄球游戏的获胜者,https://leetcode.cn/problems/determine-the-winner-of-a-bowling-game/,determine-the-winner-of-a-bowling-game,数组、模拟,https://algo.itcharge.cn/Solutions/2600-2699/determine-the-winner-of-a-bowling-game/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2660.%20%E4%BF%9D%E9%BE%84%E7%90%83%E6%B8%B8%E6%88%8F%E7%9A%84%E8%8E%B7%E8%83%9C%E8%80%85.md,33.5%,简单,39 -2661,2600-2699,2661. 找出叠涂元素,找出叠涂元素,https://leetcode.cn/problems/first-completely-painted-row-or-column/,first-completely-painted-row-or-column,数组、哈希表、矩阵,https://algo.itcharge.cn/Solutions/2600-2699/first-completely-painted-row-or-column/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2661.%20%E6%89%BE%E5%87%BA%E5%8F%A0%E6%B6%82%E5%85%83%E7%B4%A0.md,51.2%,中等,46 -2662,2600-2699,2662. 前往目标的最小代价,前往目标的最小代价,https://leetcode.cn/problems/minimum-cost-of-a-path-with-special-roads/,minimum-cost-of-a-path-with-special-roads,图、数组、最短路、堆（优先队列）,https://algo.itcharge.cn/Solutions/2600-2699/minimum-cost-of-a-path-with-special-roads/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2662.%20%E5%89%8D%E5%BE%80%E7%9B%AE%E6%A0%87%E7%9A%84%E6%9C%80%E5%B0%8F%E4%BB%A3%E4%BB%B7.md,36.4%,中等,52 -2663,2600-2699,2663. 字典序最小的美丽字符串,字典序最小的美丽字符串,https://leetcode.cn/problems/lexicographically-smallest-beautiful-string/,lexicographically-smallest-beautiful-string,贪心、字符串,https://algo.itcharge.cn/Solutions/2600-2699/lexicographically-smallest-beautiful-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2663.%20%E5%AD%97%E5%85%B8%E5%BA%8F%E6%9C%80%E5%B0%8F%E7%9A%84%E7%BE%8E%E4%B8%BD%E5%AD%97%E7%AC%A6%E4%B8%B2.md,45.7%,困难,34 -2664,2600-2699,2664. 巡逻的骑士,巡逻的骑士,https://leetcode.cn/problems/the-knights-tour/,the-knights-tour,递归、数组、矩阵,https://algo.itcharge.cn/Solutions/2600-2699/the-knights-tour/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2664.%20%E5%B7%A1%E9%80%BB%E7%9A%84%E9%AA%91%E5%A3%AB.md,63.6%,中等,6 -2665,2600-2699,2665. 计数器 II,计数器 II,https://leetcode.cn/problems/counter-ii/,counter-ii,,https://algo.itcharge.cn/Solutions/2600-2699/counter-ii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2665.%20%E8%AE%A1%E6%95%B0%E5%99%A8%20II.md,63.8%,简单,38 -2666,2600-2699,2666. 只允许一次函数调用,只允许一次函数调用,https://leetcode.cn/problems/allow-one-function-call/,allow-one-function-call,,https://algo.itcharge.cn/Solutions/2600-2699/allow-one-function-call/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2666.%20%E5%8F%AA%E5%85%81%E8%AE%B8%E4%B8%80%E6%AC%A1%E5%87%BD%E6%95%B0%E8%B0%83%E7%94%A8.md,82.6%,简单,37 -2667,2600-2699,2667. 创建 Hello World 函数,创建 Hello World 函数,https://leetcode.cn/problems/create-hello-world-function/,create-hello-world-function,,https://algo.itcharge.cn/Solutions/2600-2699/create-hello-world-function/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2667.%20%E5%88%9B%E5%BB%BA%20Hello%20World%20%E5%87%BD%E6%95%B0.md,87.1%,简单,29 -2668,2600-2699,2668. 查询员工当前薪水,查询员工当前薪水,https://leetcode.cn/problems/find-latest-salaries/,find-latest-salaries,数据库,https://algo.itcharge.cn/Solutions/2600-2699/find-latest-salaries/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2668.%20%E6%9F%A5%E8%AF%A2%E5%91%98%E5%B7%A5%E5%BD%93%E5%89%8D%E8%96%AA%E6%B0%B4.md,68.0%,简单,4 -2669,2600-2699,2669. 统计 Spotify 排行榜上艺术家出现次数,统计 Spotify 排行榜上艺术家出现次数,https://leetcode.cn/problems/count-artist-occurrences-on-spotify-ranking-list/,count-artist-occurrences-on-spotify-ranking-list,数据库,https://algo.itcharge.cn/Solutions/2600-2699/count-artist-occurrences-on-spotify-ranking-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2669.%20%E7%BB%9F%E8%AE%A1%20Spotify%20%E6%8E%92%E8%A1%8C%E6%A6%9C%E4%B8%8A%E8%89%BA%E6%9C%AF%E5%AE%B6%E5%87%BA%E7%8E%B0%E6%AC%A1%E6%95%B0.md,73.9%,简单,2 -2670,2600-2699,2670. 找出不同元素数目差数组,找出不同元素数目差数组,https://leetcode.cn/problems/find-the-distinct-difference-array/,find-the-distinct-difference-array,数组、哈希表,https://algo.itcharge.cn/Solutions/2600-2699/find-the-distinct-difference-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2670.%20%E6%89%BE%E5%87%BA%E4%B8%8D%E5%90%8C%E5%85%83%E7%B4%A0%E6%95%B0%E7%9B%AE%E5%B7%AE%E6%95%B0%E7%BB%84.md,75.7%,简单,50 -2671,2600-2699,2671. 频率跟踪器,频率跟踪器,https://leetcode.cn/problems/frequency-tracker/,frequency-tracker,设计、哈希表,https://algo.itcharge.cn/Solutions/2600-2699/frequency-tracker/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2671.%20%E9%A2%91%E7%8E%87%E8%B7%9F%E8%B8%AA%E5%99%A8.md,32.4%,中等,52 -2672,2600-2699,2672. 有相同颜色的相邻元素数目,有相同颜色的相邻元素数目,https://leetcode.cn/problems/number-of-adjacent-elements-with-the-same-color/,number-of-adjacent-elements-with-the-same-color,数组,https://algo.itcharge.cn/Solutions/2600-2699/number-of-adjacent-elements-with-the-same-color/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2672.%20%E6%9C%89%E7%9B%B8%E5%90%8C%E9%A2%9C%E8%89%B2%E7%9A%84%E7%9B%B8%E9%82%BB%E5%85%83%E7%B4%A0%E6%95%B0%E7%9B%AE.md,58.3%,中等,48 -2673,2600-2699,2673. 使二叉树所有路径值相等的最小代价,使二叉树所有路径值相等的最小代价,https://leetcode.cn/problems/make-costs-of-paths-equal-in-a-binary-tree/,make-costs-of-paths-equal-in-a-binary-tree,贪心、树、数组、动态规划、二叉树,https://algo.itcharge.cn/Solutions/2600-2699/make-costs-of-paths-equal-in-a-binary-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2673.%20%E4%BD%BF%E4%BA%8C%E5%8F%89%E6%A0%91%E6%89%80%E6%9C%89%E8%B7%AF%E5%BE%84%E5%80%BC%E7%9B%B8%E7%AD%89%E7%9A%84%E6%9C%80%E5%B0%8F%E4%BB%A3%E4%BB%B7.md,66.2%,中等,67 -2674,2600-2699,2674. 拆分循环链表,拆分循环链表,https://leetcode.cn/problems/split-a-circular-linked-list/,split-a-circular-linked-list,,https://algo.itcharge.cn/Solutions/2600-2699/split-a-circular-linked-list/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2674.%20%E6%8B%86%E5%88%86%E5%BE%AA%E7%8E%AF%E9%93%BE%E8%A1%A8.md,82.8%,中等,5 -2675,2600-2699,2675. 将对象数组转换为矩阵,将对象数组转换为矩阵,https://leetcode.cn/problems/array-of-objects-to-matrix/,array-of-objects-to-matrix,,https://algo.itcharge.cn/Solutions/2600-2699/array-of-objects-to-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2675.%20%E5%B0%86%E5%AF%B9%E8%B1%A1%E6%95%B0%E7%BB%84%E8%BD%AC%E6%8D%A2%E4%B8%BA%E7%9F%A9%E9%98%B5.md,60.9%,中等,21 -2676,2600-2699,2676. 节流,节流,https://leetcode.cn/problems/throttle/,throttle,,https://algo.itcharge.cn/Solutions/2600-2699/throttle/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2676.%20%E8%8A%82%E6%B5%81.md,43.6%,中等,24 -2677,2600-2699,2677. 分块数组,分块数组,https://leetcode.cn/problems/chunk-array/,chunk-array,,https://algo.itcharge.cn/Solutions/2600-2699/chunk-array/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2677.%20%E5%88%86%E5%9D%97%E6%95%B0%E7%BB%84.md,72.8%,简单,31 -2678,2600-2699,2678. 老人的数目,老人的数目,https://leetcode.cn/problems/number-of-senior-citizens/,number-of-senior-citizens,数组、字符串,https://algo.itcharge.cn/Solutions/2600-2699/number-of-senior-citizens/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2678.%20%E8%80%81%E4%BA%BA%E7%9A%84%E6%95%B0%E7%9B%AE.md,83.8%,简单,35 -2679,2600-2699,2679. 矩阵中的和,矩阵中的和,https://leetcode.cn/problems/sum-in-a-matrix/,sum-in-a-matrix,数组、矩阵、排序、模拟、堆（优先队列）,https://algo.itcharge.cn/Solutions/2600-2699/sum-in-a-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2679.%20%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E5%92%8C.md,76.2%,中等,33 -2680,2600-2699,2680. 最大或值,最大或值,https://leetcode.cn/problems/maximum-or/,maximum-or,贪心、位运算、数组、前缀和,https://algo.itcharge.cn/Solutions/2600-2699/maximum-or/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2680.%20%E6%9C%80%E5%A4%A7%E6%88%96%E5%80%BC.md,42.6%,中等,32 -2681,2600-2699,2681. 英雄的力量,英雄的力量,https://leetcode.cn/problems/power-of-heroes/,power-of-heroes,数组、数学、前缀和、排序,https://algo.itcharge.cn/Solutions/2600-2699/power-of-heroes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2681.%20%E8%8B%B1%E9%9B%84%E7%9A%84%E5%8A%9B%E9%87%8F.md,35.8%,困难,24 -2682,2600-2699,2682. 找出转圈游戏输家,找出转圈游戏输家,https://leetcode.cn/problems/find-the-losers-of-the-circular-game/,find-the-losers-of-the-circular-game,数组、哈希表、模拟,https://algo.itcharge.cn/Solutions/2600-2699/find-the-losers-of-the-circular-game/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2682.%20%E6%89%BE%E5%87%BA%E8%BD%AC%E5%9C%88%E6%B8%B8%E6%88%8F%E8%BE%93%E5%AE%B6.md,54.5%,简单,36 -2683,2600-2699,2683. 相邻值的按位异或,相邻值的按位异或,https://leetcode.cn/problems/neighboring-bitwise-xor/,neighboring-bitwise-xor,位运算、数组,https://algo.itcharge.cn/Solutions/2600-2699/neighboring-bitwise-xor/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2683.%20%E7%9B%B8%E9%82%BB%E5%80%BC%E7%9A%84%E6%8C%89%E4%BD%8D%E5%BC%82%E6%88%96.md,69.0%,中等,44 -2684,2600-2699,2684. 矩阵中移动的最大次数,矩阵中移动的最大次数,https://leetcode.cn/problems/maximum-number-of-moves-in-a-grid/,maximum-number-of-moves-in-a-grid,数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/2600-2699/maximum-number-of-moves-in-a-grid/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2684.%20%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%A7%BB%E5%8A%A8%E7%9A%84%E6%9C%80%E5%A4%A7%E6%AC%A1%E6%95%B0.md,40.9%,中等,63 -2685,2600-2699,2685. 统计完全连通分量的数量,统计完全连通分量的数量,https://leetcode.cn/problems/count-the-number-of-complete-components/,count-the-number-of-complete-components,深度优先搜索、广度优先搜索、图,https://algo.itcharge.cn/Solutions/2600-2699/count-the-number-of-complete-components/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2685.%20%E7%BB%9F%E8%AE%A1%E5%AE%8C%E5%85%A8%E8%BF%9E%E9%80%9A%E5%88%86%E9%87%8F%E7%9A%84%E6%95%B0%E9%87%8F.md,67.3%,中等,49 -2686,2600-2699,2686. 即时食物配送 III,即时食物配送 III,https://leetcode.cn/problems/immediate-food-delivery-iii/,immediate-food-delivery-iii,数据库,https://algo.itcharge.cn/Solutions/2600-2699/immediate-food-delivery-iii/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2686.%20%E5%8D%B3%E6%97%B6%E9%A3%9F%E7%89%A9%E9%85%8D%E9%80%81%20III.md,67.2%,中等,5 -2687,2600-2699,2687. 自行车的最后使用时间,自行车的最后使用时间,https://leetcode.cn/problems/bikes-last-time-used/,bikes-last-time-used,数据库,https://algo.itcharge.cn/Solutions/2600-2699/bikes-last-time-used/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2687.%20%E8%87%AA%E8%A1%8C%E8%BD%A6%E7%9A%84%E6%9C%80%E5%90%8E%E4%BD%BF%E7%94%A8%E6%97%B6%E9%97%B4.md,85.8%,简单,2 -2688,2600-2699,2688. 查找活跃用户,查找活跃用户,https://leetcode.cn/problems/find-active-users/,find-active-users,数据库,https://algo.itcharge.cn/Solutions/2600-2699/find-active-users/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2688.%20%E6%9F%A5%E6%89%BE%E6%B4%BB%E8%B7%83%E7%94%A8%E6%88%B7.md,44.6%,中等,7 -2689,2600-2699,2689. 从 Rope 树中提取第 K 个字符,从 Rope 树中提取第 K 个字符,https://leetcode.cn/problems/extract-kth-character-from-the-rope-tree/,extract-kth-character-from-the-rope-tree,树、深度优先搜索,https://algo.itcharge.cn/Solutions/2600-2699/extract-kth-character-from-the-rope-tree/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2689.%20%E4%BB%8E%20Rope%20%E6%A0%91%E4%B8%AD%E6%8F%90%E5%8F%96%E7%AC%AC%20K%20%E4%B8%AA%E5%AD%97%E7%AC%A6.md,78.6%,简单,3 -2690,2600-2699,2690. 无穷方法对象,无穷方法对象,https://leetcode.cn/problems/infinite-method-object/,infinite-method-object,,https://algo.itcharge.cn/Solutions/2600-2699/infinite-method-object/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2690.%20%E6%97%A0%E7%A9%B7%E6%96%B9%E6%B3%95%E5%AF%B9%E8%B1%A1.md,95.0%,简单,2 -2691,2600-2699,2691. 不可变辅助工具,不可变辅助工具,https://leetcode.cn/problems/immutability-helper/,immutability-helper,,https://algo.itcharge.cn/Solutions/2600-2699/immutability-helper/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2691.%20%E4%B8%8D%E5%8F%AF%E5%8F%98%E8%BE%85%E5%8A%A9%E5%B7%A5%E5%85%B7.md,27.0%,困难,2 -2692,2600-2699,2692. 使对象不可变,使对象不可变,https://leetcode.cn/problems/make-object-immutable/,make-object-immutable,,https://algo.itcharge.cn/Solutions/2600-2699/make-object-immutable/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2692.%20%E4%BD%BF%E5%AF%B9%E8%B1%A1%E4%B8%8D%E5%8F%AF%E5%8F%98.md,48.0%,中等,3 -2693,2600-2699,2693. 使用自定义上下文调用函数,使用自定义上下文调用函数,https://leetcode.cn/problems/call-function-with-custom-context/,call-function-with-custom-context,,https://algo.itcharge.cn/Solutions/2600-2699/call-function-with-custom-context/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2693.%20%E4%BD%BF%E7%94%A8%E8%87%AA%E5%AE%9A%E4%B9%89%E4%B8%8A%E4%B8%8B%E6%96%87%E8%B0%83%E7%94%A8%E5%87%BD%E6%95%B0.md,73.0%,中等,16 -2694,2600-2699,2694. 事件发射器,事件发射器,https://leetcode.cn/problems/event-emitter/,event-emitter,,https://algo.itcharge.cn/Solutions/2600-2699/event-emitter/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2694.%20%E4%BA%8B%E4%BB%B6%E5%8F%91%E5%B0%84%E5%99%A8.md,64.7%,中等,8 -2695,2600-2699,2695. 包装数组,包装数组,https://leetcode.cn/problems/array-wrapper/,array-wrapper,,https://algo.itcharge.cn/Solutions/2600-2699/array-wrapper/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2695.%20%E5%8C%85%E8%A3%85%E6%95%B0%E7%BB%84.md,72.2%,简单,12 -2696,2600-2699,2696. 删除子串后的字符串最小长度,删除子串后的字符串最小长度,https://leetcode.cn/problems/minimum-string-length-after-removing-substrings/,minimum-string-length-after-removing-substrings,栈、字符串、模拟,https://algo.itcharge.cn/Solutions/2600-2699/minimum-string-length-after-removing-substrings/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2696.%20%E5%88%A0%E9%99%A4%E5%AD%90%E4%B8%B2%E5%90%8E%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%9C%80%E5%B0%8F%E9%95%BF%E5%BA%A6.md,72.5%,简单,67 -2697,2600-2699,2697. 字典序最小回文串,字典序最小回文串,https://leetcode.cn/problems/lexicographically-smallest-palindrome/,lexicographically-smallest-palindrome,双指针、字符串,https://algo.itcharge.cn/Solutions/2600-2699/lexicographically-smallest-palindrome/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2697.%20%E5%AD%97%E5%85%B8%E5%BA%8F%E6%9C%80%E5%B0%8F%E5%9B%9E%E6%96%87%E4%B8%B2.md,83.1%,简单,67 -2698,2600-2699,2698. 求一个整数的惩罚数,求一个整数的惩罚数,https://leetcode.cn/problems/find-the-punishment-number-of-an-integer/,find-the-punishment-number-of-an-integer,递归、数学,https://algo.itcharge.cn/Solutions/2600-2699/find-the-punishment-number-of-an-integer/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2698.%20%E6%B1%82%E4%B8%80%E4%B8%AA%E6%95%B4%E6%95%B0%E7%9A%84%E6%83%A9%E7%BD%9A%E6%95%B0.md,66.6%,中等,76 -2699,2600-2699,2699. 修改图中的边权,修改图中的边权,https://leetcode.cn/problems/modify-graph-edge-weights/,modify-graph-edge-weights,图、最短路、堆（优先队列）,https://algo.itcharge.cn/Solutions/2600-2699/modify-graph-edge-weights/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2699.%20%E4%BF%AE%E6%94%B9%E5%9B%BE%E4%B8%AD%E7%9A%84%E8%BE%B9%E6%9D%83.md,52.5%,困难,58 -2700,2700-2799,2700. 两个对象之间的差异,两个对象之间的差异,https://leetcode.cn/problems/differences-between-two-objects/,differences-between-two-objects,,https://algo.itcharge.cn/Solutions/2700-2799/differences-between-two-objects/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2700.%20%E4%B8%A4%E4%B8%AA%E5%AF%B9%E8%B1%A1%E4%B9%8B%E9%97%B4%E7%9A%84%E5%B7%AE%E5%BC%82.md,59.3%,中等,20 -2701,2700-2799,2701. 连续递增交易,连续递增交易,https://leetcode.cn/problems/consecutive-transactions-with-increasing-amounts/,consecutive-transactions-with-increasing-amounts,数据库,https://algo.itcharge.cn/Solutions/2700-2799/consecutive-transactions-with-increasing-amounts/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2701.%20%E8%BF%9E%E7%BB%AD%E9%80%92%E5%A2%9E%E4%BA%A4%E6%98%93.md,32.2%,困难,6 -2702,2700-2799,2702. 使数字变为非正数的最小操作次数,使数字变为非正数的最小操作次数,https://leetcode.cn/problems/minimum-operations-to-make-numbers-non-positive/,minimum-operations-to-make-numbers-non-positive,数组、二分查找,https://algo.itcharge.cn/Solutions/2700-2799/minimum-operations-to-make-numbers-non-positive/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2702.%20%E4%BD%BF%E6%95%B0%E5%AD%97%E5%8F%98%E4%B8%BA%E9%9D%9E%E6%AD%A3%E6%95%B0%E7%9A%84%E6%9C%80%E5%B0%8F%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0.md,48.8%,困难,3 -2703,2700-2799,2703. 返回传递的参数的长度,返回传递的参数的长度,https://leetcode.cn/problems/return-length-of-arguments-passed/,return-length-of-arguments-passed,,https://algo.itcharge.cn/Solutions/2700-2799/return-length-of-arguments-passed/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2703.%20%E8%BF%94%E5%9B%9E%E4%BC%A0%E9%80%92%E7%9A%84%E5%8F%82%E6%95%B0%E7%9A%84%E9%95%BF%E5%BA%A6.md,93.7%,简单,12 -2704,2700-2799,2704. 相等还是不相等,相等还是不相等,https://leetcode.cn/problems/to-be-or-not-to-be/,to-be-or-not-to-be,,https://algo.itcharge.cn/Solutions/2700-2799/to-be-or-not-to-be/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2704.%20%E7%9B%B8%E7%AD%89%E8%BF%98%E6%98%AF%E4%B8%8D%E7%9B%B8%E7%AD%89.md,52.7%,简单,16 -2705,2700-2799,2705. 精简对象,精简对象,https://leetcode.cn/problems/compact-object/,compact-object,,https://algo.itcharge.cn/Solutions/2700-2799/compact-object/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2705.%20%E7%B2%BE%E7%AE%80%E5%AF%B9%E8%B1%A1.md,63.4%,中等,9 -2706,2700-2799,2706. 购买两块巧克力,购买两块巧克力,https://leetcode.cn/problems/buy-two-chocolates/,buy-two-chocolates,数组、排序,https://algo.itcharge.cn/Solutions/2700-2799/buy-two-chocolates/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2706.%20%E8%B4%AD%E4%B9%B0%E4%B8%A4%E5%9D%97%E5%B7%A7%E5%85%8B%E5%8A%9B.md,80.0%,简单,32 -2707,2700-2799,2707. 字符串中的额外字符,字符串中的额外字符,https://leetcode.cn/problems/extra-characters-in-a-string/,extra-characters-in-a-string,字典树、数组、哈希表、字符串、动态规划,https://algo.itcharge.cn/Solutions/2700-2799/extra-characters-in-a-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2707.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E9%A2%9D%E5%A4%96%E5%AD%97%E7%AC%A6.md,41.9%,中等,38 -2708,2700-2799,2708. 一个小组的最大实力值,一个小组的最大实力值,https://leetcode.cn/problems/maximum-strength-of-a-group/,maximum-strength-of-a-group,贪心、递归、数组、排序,https://algo.itcharge.cn/Solutions/2700-2799/maximum-strength-of-a-group/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2708.%20%E4%B8%80%E4%B8%AA%E5%B0%8F%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%AE%9E%E5%8A%9B%E5%80%BC.md,30.2%,中等,52 -2709,2700-2799,2709. 最大公约数遍历,最大公约数遍历,https://leetcode.cn/problems/greatest-common-divisor-traversal/,greatest-common-divisor-traversal,并查集、数组、数学、数论,https://algo.itcharge.cn/Solutions/2700-2799/greatest-common-divisor-traversal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2709.%20%E6%9C%80%E5%A4%A7%E5%85%AC%E7%BA%A6%E6%95%B0%E9%81%8D%E5%8E%86.md,24.1%,困难,34 -2710,2700-2799,2710. 移除字符串中的尾随零,移除字符串中的尾随零,https://leetcode.cn/problems/remove-trailing-zeros-from-a-string/,remove-trailing-zeros-from-a-string,字符串,https://algo.itcharge.cn/Solutions/2700-2799/remove-trailing-zeros-from-a-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2710.%20%E7%A7%BB%E9%99%A4%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%B0%BE%E9%9A%8F%E9%9B%B6.md,83.5%,简单,59 -2711,2700-2799,2711. 对角线上不同值的数量差,对角线上不同值的数量差,https://leetcode.cn/problems/difference-of-number-of-distinct-values-on-diagonals/,difference-of-number-of-distinct-values-on-diagonals,数组、哈希表、矩阵,https://algo.itcharge.cn/Solutions/2700-2799/difference-of-number-of-distinct-values-on-diagonals/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2711.%20%E5%AF%B9%E8%A7%92%E7%BA%BF%E4%B8%8A%E4%B8%8D%E5%90%8C%E5%80%BC%E7%9A%84%E6%95%B0%E9%87%8F%E5%B7%AE.md,72.1%,中等,56 -2712,2700-2799,2712. 使所有字符相等的最小成本,使所有字符相等的最小成本,https://leetcode.cn/problems/minimum-cost-to-make-all-characters-equal/,minimum-cost-to-make-all-characters-equal,贪心、字符串、动态规划,https://algo.itcharge.cn/Solutions/2700-2799/minimum-cost-to-make-all-characters-equal/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2712.%20%E4%BD%BF%E6%89%80%E6%9C%89%E5%AD%97%E7%AC%A6%E7%9B%B8%E7%AD%89%E7%9A%84%E6%9C%80%E5%B0%8F%E6%88%90%E6%9C%AC.md,56.1%,中等,58 -2713,2700-2799,2713. 矩阵中严格递增的单元格数,矩阵中严格递增的单元格数,https://leetcode.cn/problems/maximum-strictly-increasing-cells-in-a-matrix/,maximum-strictly-increasing-cells-in-a-matrix,记忆化搜索、数组、二分查找、动态规划、矩阵、排序,https://algo.itcharge.cn/Solutions/2700-2799/maximum-strictly-increasing-cells-in-a-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2713.%20%E7%9F%A9%E9%98%B5%E4%B8%AD%E4%B8%A5%E6%A0%BC%E9%80%92%E5%A2%9E%E7%9A%84%E5%8D%95%E5%85%83%E6%A0%BC%E6%95%B0.md,35.0%,困难,28 -2714,2700-2799,2714. 找到最短路径的 K 次跨越,找到最短路径的 K 次跨越,https://leetcode.cn/problems/find-shortest-path-with-k-hops/,find-shortest-path-with-k-hops,图、最短路、堆（优先队列）,https://algo.itcharge.cn/Solutions/2700-2799/find-shortest-path-with-k-hops/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2714.%20%E6%89%BE%E5%88%B0%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84%E7%9A%84%20K%20%E6%AC%A1%E8%B7%A8%E8%B6%8A.md,72.2%,困难,4 -2715,2700-2799,2715. 执行可取消的延迟函数,执行可取消的延迟函数,https://leetcode.cn/problems/execute-cancellable-function-with-delay/,execute-cancellable-function-with-delay,,https://algo.itcharge.cn/Solutions/2700-2799/execute-cancellable-function-with-delay/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2715.%20%E6%89%A7%E8%A1%8C%E5%8F%AF%E5%8F%96%E6%B6%88%E7%9A%84%E5%BB%B6%E8%BF%9F%E5%87%BD%E6%95%B0.md,81.6%,简单,6 -2716,2700-2799,2716. 最小化字符串长度,最小化字符串长度,https://leetcode.cn/problems/minimize-string-length/,minimize-string-length,哈希表、字符串,https://algo.itcharge.cn/Solutions/2700-2799/minimize-string-length/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2716.%20%E6%9C%80%E5%B0%8F%E5%8C%96%E5%AD%97%E7%AC%A6%E4%B8%B2%E9%95%BF%E5%BA%A6.md,72.2%,简单,41 -2717,2700-2799,2717. 半有序排列,半有序排列,https://leetcode.cn/problems/semi-ordered-permutation/,semi-ordered-permutation,数组、模拟,https://algo.itcharge.cn/Solutions/2700-2799/semi-ordered-permutation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2717.%20%E5%8D%8A%E6%9C%89%E5%BA%8F%E6%8E%92%E5%88%97.md,72.8%,简单,35 -2718,2700-2799,2718. 查询后矩阵的和,查询后矩阵的和,https://leetcode.cn/problems/sum-of-matrix-after-queries/,sum-of-matrix-after-queries,数组、哈希表,https://algo.itcharge.cn/Solutions/2700-2799/sum-of-matrix-after-queries/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2718.%20%E6%9F%A5%E8%AF%A2%E5%90%8E%E7%9F%A9%E9%98%B5%E7%9A%84%E5%92%8C.md,32.9%,中等,88 -2719,2700-2799,2719. 统计整数数目,统计整数数目,https://leetcode.cn/problems/count-of-integers/,count-of-integers,数学、字符串、动态规划,https://algo.itcharge.cn/Solutions/2700-2799/count-of-integers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2719.%20%E7%BB%9F%E8%AE%A1%E6%95%B4%E6%95%B0%E6%95%B0%E7%9B%AE.md,47.3%,困难,36 -2720,2700-2799,2720. 受欢迎度百分比,受欢迎度百分比,https://leetcode.cn/problems/popularity-percentage/,popularity-percentage,数据库,https://algo.itcharge.cn/Solutions/2700-2799/popularity-percentage/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2720.%20%E5%8F%97%E6%AC%A2%E8%BF%8E%E5%BA%A6%E7%99%BE%E5%88%86%E6%AF%94.md,61.2%,困难,3 -2721,2700-2799,2721. 并行执行异步函数,并行执行异步函数,https://leetcode.cn/problems/execute-asynchronous-functions-in-parallel/,execute-asynchronous-functions-in-parallel,,https://algo.itcharge.cn/Solutions/2700-2799/execute-asynchronous-functions-in-parallel/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2721.%20%E5%B9%B6%E8%A1%8C%E6%89%A7%E8%A1%8C%E5%BC%82%E6%AD%A5%E5%87%BD%E6%95%B0.md,58.6%,中等,8 -2722,2700-2799,2722. 根据 ID 合并两个数组,根据 ID 合并两个数组,https://leetcode.cn/problems/join-two-arrays-by-id/,join-two-arrays-by-id,,https://algo.itcharge.cn/Solutions/2700-2799/join-two-arrays-by-id/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2722.%20%E6%A0%B9%E6%8D%AE%20ID%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84.md,47.4%,中等,6 -2723,2700-2799,2723. 添加两个 Promise 对象,添加两个 Promise 对象,https://leetcode.cn/problems/add-two-promises/,add-two-promises,,https://algo.itcharge.cn/Solutions/2700-2799/add-two-promises/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2723.%20%E6%B7%BB%E5%8A%A0%E4%B8%A4%E4%B8%AA%20Promise%20%E5%AF%B9%E8%B1%A1.md,86.5%,简单,8 -2724,2700-2799,2724. 排序方式,排序方式,https://leetcode.cn/problems/sort-by/,sort-by,,https://algo.itcharge.cn/Solutions/2700-2799/sort-by/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2724.%20%E6%8E%92%E5%BA%8F%E6%96%B9%E5%BC%8F.md,81.2%,简单,5 -2725,2700-2799,2725. 间隔取消,间隔取消,https://leetcode.cn/problems/interval-cancellation/,interval-cancellation,,https://algo.itcharge.cn/Solutions/2700-2799/interval-cancellation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2725.%20%E9%97%B4%E9%9A%94%E5%8F%96%E6%B6%88.md,75.0%,简单,9 -2726,2700-2799,2726. 使用方法链的计算器,使用方法链的计算器,https://leetcode.cn/problems/calculator-with-method-chaining/,calculator-with-method-chaining,,https://algo.itcharge.cn/Solutions/2700-2799/calculator-with-method-chaining/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2726.%20%E4%BD%BF%E7%94%A8%E6%96%B9%E6%B3%95%E9%93%BE%E7%9A%84%E8%AE%A1%E7%AE%97%E5%99%A8.md,60.9%,简单,8 -2727,2700-2799,2727. 判断对象是否为空,判断对象是否为空,https://leetcode.cn/problems/is-object-empty/,is-object-empty,,https://algo.itcharge.cn/Solutions/2700-2799/is-object-empty/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2727.%20%E5%88%A4%E6%96%AD%E5%AF%B9%E8%B1%A1%E6%98%AF%E5%90%A6%E4%B8%BA%E7%A9%BA.md,71.1%,简单,12 -2728,2700-2799,2728. 计算一个环形街道上的房屋数量,计算一个环形街道上的房屋数量,https://leetcode.cn/problems/count-houses-in-a-circular-street/,count-houses-in-a-circular-street,数组,https://algo.itcharge.cn/Solutions/2700-2799/count-houses-in-a-circular-street/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2728.%20%E8%AE%A1%E7%AE%97%E4%B8%80%E4%B8%AA%E7%8E%AF%E5%BD%A2%E8%A1%97%E9%81%93%E4%B8%8A%E7%9A%84%E6%88%BF%E5%B1%8B%E6%95%B0%E9%87%8F.md,89.9%,简单,5 -2729,2700-2799,2729. 判断一个数是否迷人,判断一个数是否迷人,https://leetcode.cn/problems/check-if-the-number-is-fascinating/,check-if-the-number-is-fascinating,哈希表、数学,https://algo.itcharge.cn/Solutions/2700-2799/check-if-the-number-is-fascinating/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2729.%20%E5%88%A4%E6%96%AD%E4%B8%80%E4%B8%AA%E6%95%B0%E6%98%AF%E5%90%A6%E8%BF%B7%E4%BA%BA.md,62.5%,简单,37 -2730,2700-2799,2730. 找到最长的半重复子字符串,找到最长的半重复子字符串,https://leetcode.cn/problems/find-the-longest-semi-repetitive-substring/,find-the-longest-semi-repetitive-substring,字符串、滑动窗口,https://algo.itcharge.cn/Solutions/2700-2799/find-the-longest-semi-repetitive-substring/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2730.%20%E6%89%BE%E5%88%B0%E6%9C%80%E9%95%BF%E7%9A%84%E5%8D%8A%E9%87%8D%E5%A4%8D%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md,45.6%,中等,29 -2731,2700-2799,2731. 移动机器人,移动机器人,https://leetcode.cn/problems/movement-of-robots/,movement-of-robots,脑筋急转弯、数组、前缀和、排序,https://algo.itcharge.cn/Solutions/2700-2799/movement-of-robots/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2731.%20%E7%A7%BB%E5%8A%A8%E6%9C%BA%E5%99%A8%E4%BA%BA.md,33.7%,中等,29 -2732,2700-2799,2732. 找到矩阵中的好子集,找到矩阵中的好子集,https://leetcode.cn/problems/find-a-good-subset-of-the-matrix/,find-a-good-subset-of-the-matrix,贪心、位运算、数组、矩阵,https://algo.itcharge.cn/Solutions/2700-2799/find-a-good-subset-of-the-matrix/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2732.%20%E6%89%BE%E5%88%B0%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E5%A5%BD%E5%AD%90%E9%9B%86.md,56.1%,困难,15 -2733,2700-2799,2733. 既不是最小值也不是最大值,既不是最小值也不是最大值,https://leetcode.cn/problems/neither-minimum-nor-maximum/,neither-minimum-nor-maximum,数组、排序,https://algo.itcharge.cn/Solutions/2700-2799/neither-minimum-nor-maximum/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2733.%20%E6%97%A2%E4%B8%8D%E6%98%AF%E6%9C%80%E5%B0%8F%E5%80%BC%E4%B9%9F%E4%B8%8D%E6%98%AF%E6%9C%80%E5%A4%A7%E5%80%BC.md,80.2%,简单,40 -2734,2700-2799,2734. 执行子串操作后的字典序最小字符串,执行子串操作后的字典序最小字符串,https://leetcode.cn/problems/lexicographically-smallest-string-after-substring-operation/,lexicographically-smallest-string-after-substring-operation,贪心、字符串,https://algo.itcharge.cn/Solutions/2700-2799/lexicographically-smallest-string-after-substring-operation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2734.%20%E6%89%A7%E8%A1%8C%E5%AD%90%E4%B8%B2%E6%93%8D%E4%BD%9C%E5%90%8E%E7%9A%84%E5%AD%97%E5%85%B8%E5%BA%8F%E6%9C%80%E5%B0%8F%E5%AD%97%E7%AC%A6%E4%B8%B2.md,32.8%,中等,42 -2735,2700-2799,2735. 收集巧克力,收集巧克力,https://leetcode.cn/problems/collecting-chocolates/,collecting-chocolates,数组、枚举,https://algo.itcharge.cn/Solutions/2700-2799/collecting-chocolates/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2735.%20%E6%94%B6%E9%9B%86%E5%B7%A7%E5%85%8B%E5%8A%9B.md,43.1%,中等,45 -2736,2700-2799,2736. 最大和查询,最大和查询,https://leetcode.cn/problems/maximum-sum-queries/,maximum-sum-queries,栈、树状数组、线段树、数组、二分查找、排序、单调栈,https://algo.itcharge.cn/Solutions/2700-2799/maximum-sum-queries/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2736.%20%E6%9C%80%E5%A4%A7%E5%92%8C%E6%9F%A5%E8%AF%A2.md,38.1%,困难,46 -2737,2700-2799,2737. 找到最近的标记节点,找到最近的标记节点,https://leetcode.cn/problems/find-the-closest-marked-node/,find-the-closest-marked-node,图、数组、最短路、堆（优先队列）,https://algo.itcharge.cn/Solutions/2700-2799/find-the-closest-marked-node/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2737.%20%E6%89%BE%E5%88%B0%E6%9C%80%E8%BF%91%E7%9A%84%E6%A0%87%E8%AE%B0%E8%8A%82%E7%82%B9.md,46.9%,中等,3 -2738,2700-2799,2738. 统计文本中单词的出现次数,统计文本中单词的出现次数,https://leetcode.cn/problems/count-occurrences-in-text/,count-occurrences-in-text,数据库,https://algo.itcharge.cn/Solutions/2700-2799/count-occurrences-in-text/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2738.%20%E7%BB%9F%E8%AE%A1%E6%96%87%E6%9C%AC%E4%B8%AD%E5%8D%95%E8%AF%8D%E7%9A%84%E5%87%BA%E7%8E%B0%E6%AC%A1%E6%95%B0.md,29.9%,中等,1 -2739,2700-2799,2739. 总行驶距离,总行驶距离,https://leetcode.cn/problems/total-distance-traveled/,total-distance-traveled,数学、模拟,https://algo.itcharge.cn/Solutions/2700-2799/total-distance-traveled/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2739.%20%E6%80%BB%E8%A1%8C%E9%A9%B6%E8%B7%9D%E7%A6%BB.md,52.8%,简单,43 -2740,2700-2799,2740. 找出分区值,找出分区值,https://leetcode.cn/problems/find-the-value-of-the-partition/,find-the-value-of-the-partition,数组、排序,https://algo.itcharge.cn/Solutions/2700-2799/find-the-value-of-the-partition/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2740.%20%E6%89%BE%E5%87%BA%E5%88%86%E5%8C%BA%E5%80%BC.md,74.3%,中等,39 -2741,2700-2799,2741. 特别的排列,特别的排列,https://leetcode.cn/problems/special-permutations/,special-permutations,位运算、数组、状态压缩,https://algo.itcharge.cn/Solutions/2700-2799/special-permutations/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2741.%20%E7%89%B9%E5%88%AB%E7%9A%84%E6%8E%92%E5%88%97.md,35.1%,中等,47 -2742,2700-2799,2742. 给墙壁刷油漆,给墙壁刷油漆,https://leetcode.cn/problems/painting-the-walls/,painting-the-walls,数组、动态规划,https://algo.itcharge.cn/Solutions/2700-2799/painting-the-walls/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2742.%20%E7%BB%99%E5%A2%99%E5%A3%81%E5%88%B7%E6%B2%B9%E6%BC%86.md,34.2%,困难,24 -2743,2700-2799,2743. ,,https://leetcode.cn/problems/count-substrings-without-repeating-character/,count-substrings-without-repeating-character,哈希表、字符串、滑动窗口,https://algo.itcharge.cn/Solutions/2700-2799/count-substrings-without-repeating-character/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2743.%20.md,82.1%,中等,1 -2744,2700-2799,2744. 最大字符串配对数目,最大字符串配对数目,https://leetcode.cn/problems/find-maximum-number-of-string-pairs/,find-maximum-number-of-string-pairs,数组、哈希表、字符串、模拟,https://algo.itcharge.cn/Solutions/2700-2799/find-maximum-number-of-string-pairs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2744.%20%E6%9C%80%E5%A4%A7%E5%AD%97%E7%AC%A6%E4%B8%B2%E9%85%8D%E5%AF%B9%E6%95%B0%E7%9B%AE.md,85.5%,简单,26 -2745,2700-2799,2745. 构造最长的新字符串,构造最长的新字符串,https://leetcode.cn/problems/construct-the-longest-new-string/,construct-the-longest-new-string,贪心、脑筋急转弯、数学,https://algo.itcharge.cn/Solutions/2700-2799/construct-the-longest-new-string/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2745.%20%E6%9E%84%E9%80%A0%E6%9C%80%E9%95%BF%E7%9A%84%E6%96%B0%E5%AD%97%E7%AC%A6%E4%B8%B2.md,55.8%,中等,29 -2746,2700-2799,2746. 字符串连接删减字母,字符串连接删减字母,https://leetcode.cn/problems/decremental-string-concatenation/,decremental-string-concatenation,数组、字符串,https://algo.itcharge.cn/Solutions/2700-2799/decremental-string-concatenation/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2746.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%BF%9E%E6%8E%A5%E5%88%A0%E5%87%8F%E5%AD%97%E6%AF%8D.md,34.7%,中等,27 -2747,2700-2799,2747. 统计没有收到请求的服务器数目,统计没有收到请求的服务器数目,https://leetcode.cn/problems/count-zero-request-servers/,count-zero-request-servers,数组、哈希表、排序、滑动窗口,https://algo.itcharge.cn/Solutions/2700-2799/count-zero-request-servers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2747.%20%E7%BB%9F%E8%AE%A1%E6%B2%A1%E6%9C%89%E6%94%B6%E5%88%B0%E8%AF%B7%E6%B1%82%E7%9A%84%E6%9C%8D%E5%8A%A1%E5%99%A8%E6%95%B0%E7%9B%AE.md,37.1%,中等,20 -2748,2700-2799,2748. 美丽下标对的数目,美丽下标对的数目,https://leetcode.cn/problems/number-of-beautiful-pairs/,number-of-beautiful-pairs,数组、数学、数论,https://algo.itcharge.cn/Solutions/2700-2799/number-of-beautiful-pairs/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2748.%20%E7%BE%8E%E4%B8%BD%E4%B8%8B%E6%A0%87%E5%AF%B9%E7%9A%84%E6%95%B0%E7%9B%AE.md,56.2%,简单,28 -2749,2700-2799,2749. 得到整数零需要执行的最少操作数,得到整数零需要执行的最少操作数,https://leetcode.cn/problems/minimum-operations-to-make-the-integer-zero/,minimum-operations-to-make-the-integer-zero,位运算、脑筋急转弯,https://algo.itcharge.cn/Solutions/2700-2799/minimum-operations-to-make-the-integer-zero/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2749.%20%E5%BE%97%E5%88%B0%E6%95%B4%E6%95%B0%E9%9B%B6%E9%9C%80%E8%A6%81%E6%89%A7%E8%A1%8C%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%95%B0.md,29.5%,中等,23 -2750,2700-2799,2750. 将数组划分成若干好子数组的方式,将数组划分成若干好子数组的方式,https://leetcode.cn/problems/ways-to-split-array-into-good-subarrays/,ways-to-split-array-into-good-subarrays,数组、数学,https://algo.itcharge.cn/Solutions/2700-2799/ways-to-split-array-into-good-subarrays/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2750.%20%E5%B0%86%E6%95%B0%E7%BB%84%E5%88%92%E5%88%86%E6%88%90%E8%8B%A5%E5%B9%B2%E5%A5%BD%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%96%B9%E5%BC%8F.md,37.4%,中等,30 -2751,2700-2799,2751. 机器人碰撞,机器人碰撞,https://leetcode.cn/problems/robot-collisions/,robot-collisions,栈、数组、排序、模拟,https://algo.itcharge.cn/Solutions/2700-2799/robot-collisions/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2751.%20%E6%9C%BA%E5%99%A8%E4%BA%BA%E7%A2%B0%E6%92%9E.md,48.9%,困难,26 -2752,2700-2799,2752. ,,https://leetcode.cn/problems/customers-with-maximum-number-of-transactions-on-consecutive-days/,customers-with-maximum-number-of-transactions-on-consecutive-days,,https://algo.itcharge.cn/Solutions/2700-2799/customers-with-maximum-number-of-transactions-on-consecutive-days/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2752.%20.md,57.1%,困难,0 -LCP 01,LCP,LCP 01. 猜数字,猜数字,https://leetcode.cn/problems/guess-numbers/,guess-numbers,数组,https://algo.itcharge.cn/Solutions/LCP/guess-numbers/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2001.%20%E7%8C%9C%E6%95%B0%E5%AD%97.md,84.7%,简单,806 -LCP 02,LCP,LCP 02. 分式化简,分式化简,https://leetcode.cn/problems/deep-dark-fraction/,deep-dark-fraction,数组、数学、数论、模拟,https://algo.itcharge.cn/Solutions/LCP/deep-dark-fraction/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2002.%20%E5%88%86%E5%BC%8F%E5%8C%96%E7%AE%80.md,70.2%,简单,329 -LCP 03,LCP,LCP 03. 机器人大冒险,机器人大冒险,https://leetcode.cn/problems/programmable-robot/,programmable-robot,数组、哈希表、模拟,https://algo.itcharge.cn/Solutions/LCP/programmable-robot/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2003.%20%E6%9C%BA%E5%99%A8%E4%BA%BA%E5%A4%A7%E5%86%92%E9%99%A9.md,23.2%,中等,243 -LCP 04,LCP,LCP 04. 覆盖,覆盖,https://leetcode.cn/problems/broken-board-dominoes/,broken-board-dominoes,位运算、图、数组、动态规划、状态压缩,https://algo.itcharge.cn/Solutions/LCP/broken-board-dominoes/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2004.%20%E8%A6%86%E7%9B%96.md,41.2%,困难,93 -LCP 05,LCP,LCP 05. 发 LeetCoin,发 LeetCoin,https://leetcode.cn/problems/coin-bonus/,coin-bonus,树状数组、线段树、数组,https://algo.itcharge.cn/Solutions/LCP/coin-bonus/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2005.%20%E5%8F%91%20LeetCoin.md,22.4%,困难,68 -LCP 06,LCP,LCP 06. 拿硬币,拿硬币,https://leetcode.cn/problems/na-ying-bi/,na-ying-bi,数组、数学,https://algo.itcharge.cn/Solutions/LCP/na-ying-bi/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2006.%20%E6%8B%BF%E7%A1%AC%E5%B8%81.md,83.9%,简单,871 -LCP 07,LCP,LCP 07. 传递信息,传递信息,https://leetcode.cn/problems/chuan-di-xin-xi/,chuan-di-xin-xi,深度优先搜索、广度优先搜索、图、动态规划,https://algo.itcharge.cn/Solutions/LCP/chuan-di-xin-xi/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2007.%20%E4%BC%A0%E9%80%92%E4%BF%A1%E6%81%AF.md,75.5%,简单,626 -LCP 08,LCP,LCP 08. 剧情触发时间,剧情触发时间,https://leetcode.cn/problems/ju-qing-hong-fa-shi-jian/,ju-qing-hong-fa-shi-jian,数组、二分查找、排序,https://algo.itcharge.cn/Solutions/LCP/ju-qing-hong-fa-shi-jian/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2008.%20%E5%89%A7%E6%83%85%E8%A7%A6%E5%8F%91%E6%97%B6%E9%97%B4.md,32.9%,中等,131 -LCP 09,LCP,LCP 09. 最小跳跃次数,最小跳跃次数,https://leetcode.cn/problems/zui-xiao-tiao-yue-ci-shu/,zui-xiao-tiao-yue-ci-shu,广度优先搜索、线段树、数组、动态规划,https://algo.itcharge.cn/Solutions/LCP/zui-xiao-tiao-yue-ci-shu/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2009.%20%E6%9C%80%E5%B0%8F%E8%B7%B3%E8%B7%83%E6%AC%A1%E6%95%B0.md,31.9%,困难,134 -LCP 10,LCP,LCP 10. 二叉树任务调度,二叉树任务调度,https://leetcode.cn/problems/er-cha-shu-ren-wu-diao-du/,er-cha-shu-ren-wu-diao-du,树、深度优先搜索、动态规划、二叉树,https://algo.itcharge.cn/Solutions/LCP/er-cha-shu-ren-wu-diao-du/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2010.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%BB%BB%E5%8A%A1%E8%B0%83%E5%BA%A6.md,61.6%,困难,53 -LCP 11,LCP,LCP 11. 期望个数统计,期望个数统计,https://leetcode.cn/problems/qi-wang-ge-shu-tong-ji/,qi-wang-ge-shu-tong-ji,数组、哈希表、数学、概率与统计,https://algo.itcharge.cn/Solutions/LCP/qi-wang-ge-shu-tong-ji/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2011.%20%E6%9C%9F%E6%9C%9B%E4%B8%AA%E6%95%B0%E7%BB%9F%E8%AE%A1.md,72.6%,简单,99 -LCP 12,LCP,LCP 12. 小张刷题计划,小张刷题计划,https://leetcode.cn/problems/xiao-zhang-shua-ti-ji-hua/,xiao-zhang-shua-ti-ji-hua,数组、二分查找,https://algo.itcharge.cn/Solutions/LCP/xiao-zhang-shua-ti-ji-hua/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2012.%20%E5%B0%8F%E5%BC%A0%E5%88%B7%E9%A2%98%E8%AE%A1%E5%88%92.md,43.9%,中等,155 -LCP 13,LCP,LCP 13. 寻宝,寻宝,https://leetcode.cn/problems/xun-bao/,xun-bao,位运算、广度优先搜索、数组、动态规划、状态压缩、矩阵,https://algo.itcharge.cn/Solutions/LCP/xun-bao/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2013.%20%E5%AF%BB%E5%AE%9D.md,59.7%,困难,100 -LCP 14,LCP,LCP 14. 切分数组,切分数组,https://leetcode.cn/problems/qie-fen-shu-zu/,qie-fen-shu-zu,数组、数学、动态规划、数论,https://algo.itcharge.cn/Solutions/LCP/qie-fen-shu-zu/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2014.%20%E5%88%87%E5%88%86%E6%95%B0%E7%BB%84.md,24.1%,困难,59 -LCP 15,LCP,LCP 15. 游乐园的迷宫,游乐园的迷宫,https://leetcode.cn/problems/you-le-yuan-de-mi-gong/,you-le-yuan-de-mi-gong,贪心、几何、数组、数学,https://algo.itcharge.cn/Solutions/LCP/you-le-yuan-de-mi-gong/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2015.%20%E6%B8%B8%E4%B9%90%E5%9B%AD%E7%9A%84%E8%BF%B7%E5%AE%AB.md,62.6%,困难,30 -LCP 16,LCP,LCP 16. 游乐园的游览计划,游乐园的游览计划,https://leetcode.cn/problems/you-le-yuan-de-you-lan-ji-hua/,you-le-yuan-de-you-lan-ji-hua,图、几何、数学,https://algo.itcharge.cn/Solutions/LCP/you-le-yuan-de-you-lan-ji-hua/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2016.%20%E6%B8%B8%E4%B9%90%E5%9B%AD%E7%9A%84%E6%B8%B8%E8%A7%88%E8%AE%A1%E5%88%92.md,34.9%,困难,22 -LCP 17,LCP,LCP 17. 速算机器人,速算机器人,https://leetcode.cn/problems/nGK0Fy/,nGK0Fy,数学、字符串、模拟,https://algo.itcharge.cn/Solutions/LCP/nGK0Fy/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2017.%20%E9%80%9F%E7%AE%97%E6%9C%BA%E5%99%A8%E4%BA%BA.md,80.2%,简单,356 -LCP 18,LCP,LCP 18. 早餐组合,早餐组合,https://leetcode.cn/problems/2vYnGI/,2vYnGI,数组、双指针、二分查找、排序,https://algo.itcharge.cn/Solutions/LCP/2vYnGI/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2018.%20%E6%97%A9%E9%A4%90%E7%BB%84%E5%90%88.md,30.2%,简单,356 -LCP 19,LCP,LCP 19. 秋叶收藏集,秋叶收藏集,https://leetcode.cn/problems/UlBDOe/,UlBDOe,字符串、动态规划,https://algo.itcharge.cn/Solutions/LCP/UlBDOe/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2019.%20%E7%A7%8B%E5%8F%B6%E6%94%B6%E8%97%8F%E9%9B%86.md,51.8%,中等,234 -LCP 20,LCP,LCP 20. 快速公交,快速公交,https://leetcode.cn/problems/meChtZ/,meChtZ,记忆化搜索、数组、动态规划,https://algo.itcharge.cn/Solutions/LCP/meChtZ/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2020.%20%E5%BF%AB%E9%80%9F%E5%85%AC%E4%BA%A4.md,36.0%,困难,39 -LCP 21,LCP,LCP 21. 追逐游戏,追逐游戏,https://leetcode.cn/problems/Za25hA/,Za25hA,深度优先搜索、广度优先搜索、图、拓扑排序,https://algo.itcharge.cn/Solutions/LCP/Za25hA/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2021.%20%E8%BF%BD%E9%80%90%E6%B8%B8%E6%88%8F.md,38.6%,困难,35 -LCP 22,LCP,LCP 22. 黑白方格画,黑白方格画,https://leetcode.cn/problems/ccw6C7/,ccw6C7,数学,https://algo.itcharge.cn/Solutions/LCP/ccw6C7/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2022.%20%E9%BB%91%E7%99%BD%E6%96%B9%E6%A0%BC%E7%94%BB.md,35.0%,简单,221 -LCP 23,LCP,LCP 23. 魔术排列,魔术排列,https://leetcode.cn/problems/er94lq/,er94lq,队列、数组、模拟,https://algo.itcharge.cn/Solutions/LCP/er94lq/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2023.%20%E9%AD%94%E6%9C%AF%E6%8E%92%E5%88%97.md,37.1%,中等,68 -LCP 24,LCP,LCP 24. 数字游戏,数字游戏,https://leetcode.cn/problems/5TxKeK/,5TxKeK,数组、数学、堆（优先队列）,https://algo.itcharge.cn/Solutions/LCP/5TxKeK/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2024.%20%E6%95%B0%E5%AD%97%E6%B8%B8%E6%88%8F.md,32.5%,困难,30 -LCP 25,LCP,LCP 25. 古董键盘,古董键盘,https://leetcode.cn/problems/Uh984O/,Uh984O,数学、动态规划、组合数学,https://algo.itcharge.cn/Solutions/LCP/Uh984O/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2025.%20%E5%8F%A4%E8%91%A3%E9%94%AE%E7%9B%98.md,37.5%,困难,36 -LCP 26,LCP,LCP 26. 导航装置,导航装置,https://leetcode.cn/problems/hSRGyL/,hSRGyL,树、动态规划、二叉树,https://algo.itcharge.cn/Solutions/LCP/hSRGyL/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2026.%20%E5%AF%BC%E8%88%AA%E8%A3%85%E7%BD%AE.md,37.6%,困难,23 -LCP 27,LCP,LCP 27. 黑盒光线反射,黑盒光线反射,https://leetcode.cn/problems/IQvJ9i/,IQvJ9i,设计、线段树、数学、有序集合,https://algo.itcharge.cn/Solutions/LCP/IQvJ9i/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2027.%20%E9%BB%91%E7%9B%92%E5%85%89%E7%BA%BF%E5%8F%8D%E5%B0%84.md,34.2%,困难,30 -LCP 28,LCP,LCP 28. 采购方案,采购方案,https://leetcode.cn/problems/4xy4Wx/,4xy4Wx,数组、双指针、二分查找、排序,https://algo.itcharge.cn/Solutions/LCP/4xy4Wx/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2028.%20%E9%87%87%E8%B4%AD%E6%96%B9%E6%A1%88.md,31.8%,简单,293 -LCP 29,LCP,LCP 29. 乐团站位,乐团站位,https://leetcode.cn/problems/SNJvJP/,SNJvJP,数学,https://algo.itcharge.cn/Solutions/LCP/SNJvJP/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2029.%20%E4%B9%90%E5%9B%A2%E7%AB%99%E4%BD%8D.md,21.2%,中等,171 -LCP 30,LCP,LCP 30. 魔塔游戏,魔塔游戏,https://leetcode.cn/problems/p0NxJO/,p0NxJO,贪心、数组、堆（优先队列）,https://algo.itcharge.cn/Solutions/LCP/p0NxJO/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2030.%20%E9%AD%94%E5%A1%94%E6%B8%B8%E6%88%8F.md,37.7%,中等,142 -LCP 31,LCP,LCP 31. 变换的迷宫,变换的迷宫,https://leetcode.cn/problems/Db3wC1/,Db3wC1,深度优先搜索、广度优先搜索、数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/LCP/Db3wC1/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2031.%20%E5%8F%98%E6%8D%A2%E7%9A%84%E8%BF%B7%E5%AE%AB.md,29.4%,困难,42 -LCP 32,LCP,LCP 32. 批量处理任务,批量处理任务,https://leetcode.cn/problems/t3fKg1/,t3fKg1,贪心、数组、堆（优先队列）,https://algo.itcharge.cn/Solutions/LCP/t3fKg1/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2032.%20%E6%89%B9%E9%87%8F%E5%A4%84%E7%90%86%E4%BB%BB%E5%8A%A1.md,42.6%,困难,32 -LCP 33,LCP,LCP 33. 蓄水,蓄水,https://leetcode.cn/problems/o8SXZn/,o8SXZn,贪心、数组、堆（优先队列）,https://algo.itcharge.cn/Solutions/LCP/o8SXZn/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2033.%20%E8%93%84%E6%B0%B4.md,34.9%,简单,198 -LCP 34,LCP,LCP 34. 二叉树染色,二叉树染色,https://leetcode.cn/problems/er-cha-shu-ran-se-UGC/,er-cha-shu-ran-se-UGC,树、动态规划、二叉树,https://algo.itcharge.cn/Solutions/LCP/er-cha-shu-ran-se-UGC/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2034.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E6%9F%93%E8%89%B2.md,56.1%,中等,103 -LCP 35,LCP,LCP 35. 电动车游城市,电动车游城市,https://leetcode.cn/problems/DFPeFJ/,DFPeFJ,图、最短路、堆（优先队列）,https://algo.itcharge.cn/Solutions/LCP/DFPeFJ/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2035.%20%E7%94%B5%E5%8A%A8%E8%BD%A6%E6%B8%B8%E5%9F%8E%E5%B8%82.md,48.2%,困难,39 -LCP 36,LCP,LCP 36. 最多牌组数,最多牌组数,https://leetcode.cn/problems/Up5XYM/,Up5XYM,数组、动态规划、排序,https://algo.itcharge.cn/Solutions/LCP/Up5XYM/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2036.%20%E6%9C%80%E5%A4%9A%E7%89%8C%E7%BB%84%E6%95%B0.md,34.6%,困难,25 -LCP 37,LCP,LCP 37. 最小矩形面积,最小矩形面积,https://leetcode.cn/problems/zui-xiao-ju-xing-mian-ji/,zui-xiao-ju-xing-mian-ji,贪心、几何、数组、数学、组合数学、排序,https://algo.itcharge.cn/Solutions/LCP/zui-xiao-ju-xing-mian-ji/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2037.%20%E6%9C%80%E5%B0%8F%E7%9F%A9%E5%BD%A2%E9%9D%A2%E7%A7%AF.md,24.8%,困难,27 -LCP 38,LCP,LCP 38. 守卫城堡,守卫城堡,https://leetcode.cn/problems/7rLGCR/,7rLGCR,数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/LCP/7rLGCR/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2038.%20%E5%AE%88%E5%8D%AB%E5%9F%8E%E5%A0%A1.md,56.2%,困难,19 -LCP 39,LCP,LCP 39. 无人机方阵,无人机方阵,https://leetcode.cn/problems/0jQkd0/,0jQkd0,数组、哈希表、计数、矩阵,https://algo.itcharge.cn/Solutions/LCP/0jQkd0/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2039.%20%E6%97%A0%E4%BA%BA%E6%9C%BA%E6%96%B9%E9%98%B5.md,55.5%,简单,98 -LCP 40,LCP,LCP 40. 心算挑战,心算挑战,https://leetcode.cn/problems/uOAnQW/,uOAnQW,贪心、数组、排序,https://algo.itcharge.cn/Solutions/LCP/uOAnQW/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2040.%20%E5%BF%83%E7%AE%97%E6%8C%91%E6%88%98.md,31.1%,简单,185 -LCP 41,LCP,LCP 41. 黑白翻转棋,黑白翻转棋,https://leetcode.cn/problems/fHi6rV/,fHi6rV,广度优先搜索、数组、矩阵,https://algo.itcharge.cn/Solutions/LCP/fHi6rV/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2041.%20%E9%BB%91%E7%99%BD%E7%BF%BB%E8%BD%AC%E6%A3%8B.md,68.3%,中等,136 -LCP 42,LCP,LCP 42. 玩具套圈,玩具套圈,https://leetcode.cn/problems/vFjcfV/,vFjcfV,几何、数组、哈希表、数学、二分查找、排序,https://algo.itcharge.cn/Solutions/LCP/vFjcfV/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2042.%20%E7%8E%A9%E5%85%B7%E5%A5%97%E5%9C%88.md,28.5%,困难,48 -LCP 43,LCP,LCP 43. 十字路口的交通,十字路口的交通,https://leetcode.cn/problems/Y1VbOX/,Y1VbOX,数组、字符串、动态规划,https://algo.itcharge.cn/Solutions/LCP/Y1VbOX/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2043.%20%E5%8D%81%E5%AD%97%E8%B7%AF%E5%8F%A3%E7%9A%84%E4%BA%A4%E9%80%9A.md,51.6%,困难,30 -LCP 44,LCP,LCP 44. 开幕式焰火,开幕式焰火,https://leetcode.cn/problems/sZ59z6/,sZ59z6,树、深度优先搜索、广度优先搜索、哈希表、二叉树,https://algo.itcharge.cn/Solutions/LCP/sZ59z6/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2044.%20%E5%BC%80%E5%B9%95%E5%BC%8F%E7%84%B0%E7%81%AB.md,78.6%,简单,215 -LCP 45,LCP,LCP 45. 自行车炫技赛场,自行车炫技赛场,https://leetcode.cn/problems/kplEvH/,kplEvH,深度优先搜索、广度优先搜索、记忆化搜索、数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/LCP/kplEvH/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2045.%20%E8%87%AA%E8%A1%8C%E8%BD%A6%E7%82%AB%E6%8A%80%E8%B5%9B%E5%9C%BA.md,29.6%,中等,58 -LCP 46,LCP,LCP 46. 志愿者调配,志愿者调配,https://leetcode.cn/problems/05ZEDJ/,05ZEDJ,图、数组、数学,https://algo.itcharge.cn/Solutions/LCP/05ZEDJ/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2046.%20%E5%BF%97%E6%84%BF%E8%80%85%E8%B0%83%E9%85%8D.md,49.2%,中等,45 -LCP 47,LCP,LCP 47. 入场安检,入场安检,https://leetcode.cn/problems/oPs9Bm/,oPs9Bm,数组、动态规划,https://algo.itcharge.cn/Solutions/LCP/oPs9Bm/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2047.%20%E5%85%A5%E5%9C%BA%E5%AE%89%E6%A3%80.md,45.0%,困难,33 -LCP 48,LCP,LCP 48. 无限棋局,无限棋局,https://leetcode.cn/problems/fsa7oZ/,fsa7oZ,数组、数学、枚举、博弈,https://algo.itcharge.cn/Solutions/LCP/fsa7oZ/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2048.%20%E6%97%A0%E9%99%90%E6%A3%8B%E5%B1%80.md,27.3%,困难,17 -LCP 49,LCP,LCP 49. 环形闯关游戏,环形闯关游戏,https://leetcode.cn/problems/K8GULz/,K8GULz,位运算、并查集、数组、堆（优先队列）,https://algo.itcharge.cn/Solutions/LCP/K8GULz/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2049.%20%E7%8E%AF%E5%BD%A2%E9%97%AF%E5%85%B3%E6%B8%B8%E6%88%8F.md,35.5%,困难,20 -LCP 50,LCP,LCP 50. 宝石补给,宝石补给,https://leetcode.cn/problems/WHnhjV/,WHnhjV,数组、模拟,https://algo.itcharge.cn/Solutions/LCP/WHnhjV/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2050.%20%E5%AE%9D%E7%9F%B3%E8%A1%A5%E7%BB%99.md,68.4%,简单,79 -LCP 51,LCP,LCP 51. 烹饪料理,烹饪料理,https://leetcode.cn/problems/UEcfPD/,UEcfPD,位运算、数组、回溯、枚举,https://algo.itcharge.cn/Solutions/LCP/UEcfPD/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2051.%20%E7%83%B9%E9%A5%AA%E6%96%99%E7%90%86.md,48.1%,简单,111 -LCP 52,LCP,LCP 52. 二叉搜索树染色,二叉搜索树染色,https://leetcode.cn/problems/QO5KpG/,QO5KpG,树、线段树、二叉搜索树、数组、二分查找、二叉树、有序集合,https://algo.itcharge.cn/Solutions/LCP/QO5KpG/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2052.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E6%9F%93%E8%89%B2.md,28.6%,中等,95 -LCP 53,LCP,LCP 53. 守护太空城,守护太空城,https://leetcode.cn/problems/EJvmW4/,EJvmW4,位运算、数组、动态规划、状态压缩,https://algo.itcharge.cn/Solutions/LCP/EJvmW4/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2053.%20%E5%AE%88%E6%8A%A4%E5%A4%AA%E7%A9%BA%E5%9F%8E.md,44.6%,困难,17 -LCP 54,LCP,LCP 54. 夺回据点,夺回据点,https://leetcode.cn/problems/s5kipK/,s5kipK,图、数组、双连通分量,https://algo.itcharge.cn/Solutions/LCP/s5kipK/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2054.%20%E5%A4%BA%E5%9B%9E%E6%8D%AE%E7%82%B9.md,40.9%,困难,12 -LCP 55,LCP,LCP 55. 采集果实,采集果实,https://leetcode.cn/problems/PTXy4P/,PTXy4P,数组,https://algo.itcharge.cn/Solutions/LCP/PTXy4P/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2055.%20%E9%87%87%E9%9B%86%E6%9E%9C%E5%AE%9E.md,73.6%,简单,78 -LCP 56,LCP,LCP 56. 信物传送,信物传送,https://leetcode.cn/problems/6UEx57/,6UEx57,广度优先搜索、图、数组、矩阵、最短路、堆（优先队列）,https://algo.itcharge.cn/Solutions/LCP/6UEx57/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2056.%20%E4%BF%A1%E7%89%A9%E4%BC%A0%E9%80%81.md,43.7%,中等,75 -LCP 57,LCP,LCP 57. 打地鼠,打地鼠,https://leetcode.cn/problems/ZbAuEH/,ZbAuEH,数组、动态规划、矩阵、排序,https://algo.itcharge.cn/Solutions/LCP/ZbAuEH/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2057.%20%E6%89%93%E5%9C%B0%E9%BC%A0.md,27.2%,困难,44 -LCP 58,LCP,LCP 58. 积木拼接,积木拼接,https://leetcode.cn/problems/De4qBB/,De4qBB,数组、回溯、矩阵,https://algo.itcharge.cn/Solutions/LCP/De4qBB/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2058.%20%E7%A7%AF%E6%9C%A8%E6%8B%BC%E6%8E%A5.md,35.3%,困难,18 -LCP 59,LCP,LCP 59. 搭桥过河,搭桥过河,https://leetcode.cn/problems/NfY1m5/,NfY1m5,数组、动态规划,https://algo.itcharge.cn/Solutions/LCP/NfY1m5/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2059.%20%E6%90%AD%E6%A1%A5%E8%BF%87%E6%B2%B3.md,36.0%,困难,10 -LCP 60,LCP,LCP 60. 力扣泡泡龙,力扣泡泡龙,https://leetcode.cn/problems/WInSav/,WInSav,树、动态规划、二叉树,https://algo.itcharge.cn/Solutions/LCP/WInSav/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2060.%20%E5%8A%9B%E6%89%A3%E6%B3%A1%E6%B3%A1%E9%BE%99.md,20.2%,困难,27 -LCP 61,LCP,LCP 61. 气温变化趋势,气温变化趋势,https://leetcode.cn/problems/6CE719/,6CE719,数组,https://algo.itcharge.cn/Solutions/LCP/6CE719/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2061.%20%E6%B0%94%E6%B8%A9%E5%8F%98%E5%8C%96%E8%B6%8B%E5%8A%BF.md,61.4%,简单,82 -LCP 62,LCP,LCP 62. 交通枢纽,交通枢纽,https://leetcode.cn/problems/D9PW8w/,D9PW8w,图,https://algo.itcharge.cn/Solutions/LCP/D9PW8w/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2062.%20%E4%BA%A4%E9%80%9A%E6%9E%A2%E7%BA%BD.md,62.5%,中等,72 -LCP 63,LCP,LCP 63. 弹珠游戏,弹珠游戏,https://leetcode.cn/problems/EXvqDp/,EXvqDp,深度优先搜索、广度优先搜索、图、拓扑排序、记忆化搜索、数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/LCP/EXvqDp/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2063.%20%E5%BC%B9%E7%8F%A0%E6%B8%B8%E6%88%8F.md,26.5%,中等,114 -LCP 64,LCP,LCP 64. 二叉树灯饰,二叉树灯饰,https://leetcode.cn/problems/U7WvvU/,U7WvvU,树、深度优先搜索、动态规划、二叉树,https://algo.itcharge.cn/Solutions/LCP/U7WvvU/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2064.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%81%AF%E9%A5%B0.md,35.7%,中等,51 -LCP 65,LCP,LCP 65. 舒适的湿度,舒适的湿度,https://leetcode.cn/problems/3aqs1c/,3aqs1c,数组、动态规划,https://algo.itcharge.cn/Solutions/LCP/3aqs1c/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2065.%20%E8%88%92%E9%80%82%E7%9A%84%E6%B9%BF%E5%BA%A6.md,45.7%,困难,16 -LCP 66,LCP,LCP 66. 最小展台数量,最小展台数量,https://leetcode.cn/problems/600YaG/,600YaG,数组、哈希表、字符串、计数,https://algo.itcharge.cn/Solutions/LCP/600YaG/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2066.%20%E6%9C%80%E5%B0%8F%E5%B1%95%E5%8F%B0%E6%95%B0%E9%87%8F.md,77.5%,简单,85 -LCP 67,LCP,LCP 67. 装饰树,装饰树,https://leetcode.cn/problems/KnLfVT/,KnLfVT,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/LCP/KnLfVT/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2067.%20%E8%A3%85%E9%A5%B0%E6%A0%91.md,87.8%,中等,80 -LCP 68,LCP,LCP 68. 美观的花束,美观的花束,https://leetcode.cn/problems/1GxJYY/,1GxJYY,数组、滑动窗口,https://algo.itcharge.cn/Solutions/LCP/1GxJYY/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2068.%20%E7%BE%8E%E8%A7%82%E7%9A%84%E8%8A%B1%E6%9D%9F.md,50.7%,中等,52 -LCP 69,LCP,LCP 69. Hello LeetCode!,Hello LeetCode!,https://leetcode.cn/problems/rMeRt2/,rMeRt2,位运算、数组、字符串、动态规划、状态压缩,https://algo.itcharge.cn/Solutions/LCP/rMeRt2/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2069.%20Hello%20LeetCode%21.md,34.1%,困难,21 -LCP 70,LCP,LCP 70. 沙地治理,沙地治理,https://leetcode.cn/problems/XxZZjK/,XxZZjK,数组、数学,https://algo.itcharge.cn/Solutions/LCP/XxZZjK/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2070.%20%E6%B2%99%E5%9C%B0%E6%B2%BB%E7%90%86.md,27.8%,困难,15 -LCP 71,LCP,LCP 71. 集水器,集水器,https://leetcode.cn/problems/kskhHQ/,kskhHQ,并查集、数组、矩阵,https://algo.itcharge.cn/Solutions/LCP/kskhHQ/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2071.%20%E9%9B%86%E6%B0%B4%E5%99%A8.md,55.4%,困难,13 -LCP 72,LCP,LCP 72. 补给马车,补给马车,https://leetcode.cn/problems/hqCnmP/,hqCnmP,,https://algo.itcharge.cn/Solutions/LCP/hqCnmP/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2072.%20%E8%A1%A5%E7%BB%99%E9%A9%AC%E8%BD%A6.md,69.7%,简单,42 -LCP 73,LCP,LCP 73. 探险营地,探险营地,https://leetcode.cn/problems/0Zeoeg/,0Zeoeg,,https://algo.itcharge.cn/Solutions/LCP/0Zeoeg/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2073.%20%E6%8E%A2%E9%99%A9%E8%90%A5%E5%9C%B0.md,45.7%,中等,25 -LCP 74,LCP,LCP 74. 最强祝福力场,最强祝福力场,https://leetcode.cn/problems/xepqZ5/,xepqZ5,,https://algo.itcharge.cn/Solutions/LCP/xepqZ5/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2074.%20%E6%9C%80%E5%BC%BA%E7%A5%9D%E7%A6%8F%E5%8A%9B%E5%9C%BA.md,29.0%,中等,35 -LCP 75,LCP,LCP 75. 传送卷轴,传送卷轴,https://leetcode.cn/problems/rdmXM7/,rdmXM7,,https://algo.itcharge.cn/Solutions/LCP/rdmXM7/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2075.%20%E4%BC%A0%E9%80%81%E5%8D%B7%E8%BD%B4.md,36.2%,困难,15 -LCP 76,LCP,LCP 76. 魔法棋盘,魔法棋盘,https://leetcode.cn/problems/1ybDKD/,1ybDKD,,https://algo.itcharge.cn/Solutions/LCP/1ybDKD/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2076.%20%E9%AD%94%E6%B3%95%E6%A3%8B%E7%9B%98.md,36.8%,困难,12 -LCP 77,LCP,LCP 77. 符文储备,符文储备,https://leetcode.cn/problems/W2ZX4X/,W2ZX4X,,https://algo.itcharge.cn/Solutions/LCP/W2ZX4X/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2077.%20%E7%AC%A6%E6%96%87%E5%82%A8%E5%A4%87.md,72.3%,简单,22 -LCP 78,LCP,LCP 78. 城墙防线,城墙防线,https://leetcode.cn/problems/Nsibyl/,Nsibyl,,https://algo.itcharge.cn/Solutions/LCP/Nsibyl/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2078.%20%E5%9F%8E%E5%A2%99%E9%98%B2%E7%BA%BF.md,45.5%,中等,21 -LCP 79,LCP,LCP 79. 提取咒文,提取咒文,https://leetcode.cn/problems/kjpLFZ/,kjpLFZ,,https://algo.itcharge.cn/Solutions/LCP/kjpLFZ/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2079.%20%E6%8F%90%E5%8F%96%E5%92%92%E6%96%87.md,27.5%,中等,18 -LCP 80,LCP,LCP 80. 生物进化录,生物进化录,https://leetcode.cn/problems/qoQAMX/,qoQAMX,,https://algo.itcharge.cn/Solutions/LCP/qoQAMX/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2080.%20%E7%94%9F%E7%89%A9%E8%BF%9B%E5%8C%96%E5%BD%95.md,50.1%,困难,14 -LCP 81,LCP,LCP 81. 与非的谜题,与非的谜题,https://leetcode.cn/problems/ryfUiz/,ryfUiz,,https://algo.itcharge.cn/Solutions/LCP/ryfUiz/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2081.%20%E4%B8%8E%E9%9D%9E%E7%9A%84%E8%B0%9C%E9%A2%98.md,48.0%,困难,15 -LCP 82,LCP,LCP 82. 万灵之树,万灵之树,https://leetcode.cn/problems/cnHoX6/,cnHoX6,,https://algo.itcharge.cn/Solutions/LCP/cnHoX6/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCP%2082.%20%E4%B8%87%E7%81%B5%E4%B9%8B%E6%A0%91.md,14.0%,困难,5 -LCS 01,LCS,LCS 01. 下载插件,下载插件,https://leetcode.cn/problems/Ju9Xwi/,Ju9Xwi,贪心、数学、动态规划,https://algo.itcharge.cn/Solutions/LCS/Ju9Xwi/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCS%2001.%20%E4%B8%8B%E8%BD%BD%E6%8F%92%E4%BB%B6.md,53.8%,简单,267 -LCS 02,LCS,LCS 02. 完成一半题目,完成一半题目,https://leetcode.cn/problems/WqXACV/,WqXACV,贪心、数组、哈希表、排序,https://algo.itcharge.cn/Solutions/LCS/WqXACV/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCS%2002.%20%E5%AE%8C%E6%88%90%E4%B8%80%E5%8D%8A%E9%A2%98%E7%9B%AE.md,64.5%,简单,183 -LCS 03,LCS,LCS 03. 主题空间,主题空间,https://leetcode.cn/problems/YesdPw/,YesdPw,深度优先搜索、广度优先搜索、并查集、数组、矩阵,https://algo.itcharge.cn/Solutions/LCS/YesdPw/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/LCS%2003.%20%E4%B8%BB%E9%A2%98%E7%A9%BA%E9%97%B4.md,41.3%,中等,96 -剑指 Offer 03,Offer,剑指 Offer 03. 数组中重复的数字,数组中重复的数字,https://leetcode.cn/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof/,shu-zu-zhong-zhong-fu-de-shu-zi-lcof,数组、哈希表、排序,https://algo.itcharge.cn/Solutions/Offer/shu-zu-zhong-zhong-fu-de-shu-zi-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2003.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E9%87%8D%E5%A4%8D%E7%9A%84%E6%95%B0%E5%AD%97.md,67.1%,简单,4369 -剑指 Offer 04,Offer,剑指 Offer 04. 二维数组中的查找,二维数组中的查找,https://leetcode.cn/problems/er-wei-shu-zu-zhong-de-cha-zhao-lcof/,er-wei-shu-zu-zhong-de-cha-zhao-lcof,数组、二分查找、分治、矩阵,https://algo.itcharge.cn/Solutions/Offer/er-wei-shu-zu-zhong-de-cha-zhao-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2004.%20%E4%BA%8C%E7%BB%B4%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9F%A5%E6%89%BE.md,39.5%,中等,3514 -剑指 Offer 05,Offer,剑指 Offer 05. 替换空格,替换空格,https://leetcode.cn/problems/ti-huan-kong-ge-lcof/,ti-huan-kong-ge-lcof,字符串,https://algo.itcharge.cn/Solutions/Offer/ti-huan-kong-ge-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2005.%20%E6%9B%BF%E6%8D%A2%E7%A9%BA%E6%A0%BC.md,75.2%,简单,3525 -剑指 Offer 06,Offer,剑指 Offer 06. 从尾到头打印链表,从尾到头打印链表,https://leetcode.cn/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof/,cong-wei-dao-tou-da-yin-lian-biao-lcof,栈、递归、链表、双指针,https://algo.itcharge.cn/Solutions/Offer/cong-wei-dao-tou-da-yin-lian-biao-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2006.%20%E4%BB%8E%E5%B0%BE%E5%88%B0%E5%A4%B4%E6%89%93%E5%8D%B0%E9%93%BE%E8%A1%A8.md,74.4%,简单,3619 -剑指 Offer 07,Offer,剑指 Offer 07. 重建二叉树,重建二叉树,https://leetcode.cn/problems/zhong-jian-er-cha-shu-lcof/,zhong-jian-er-cha-shu-lcof,树、数组、哈希表、分治、二叉树,https://algo.itcharge.cn/Solutions/Offer/zhong-jian-er-cha-shu-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2007.%20%E9%87%8D%E5%BB%BA%E4%BA%8C%E5%8F%89%E6%A0%91.md,70.3%,中等,2159 -剑指 Offer 09,Offer,剑指 Offer 09. 用两个栈实现队列,用两个栈实现队列,https://leetcode.cn/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/,yong-liang-ge-zhan-shi-xian-dui-lie-lcof,栈、设计、队列,https://algo.itcharge.cn/Solutions/Offer/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2009.%20%E7%94%A8%E4%B8%A4%E4%B8%AA%E6%A0%88%E5%AE%9E%E7%8E%B0%E9%98%9F%E5%88%97.md,70.4%,简单,3003 -剑指 Offer 10- I,Offer,剑指 Offer 10- I. 斐波那契数列,斐波那契数列,https://leetcode.cn/problems/fei-bo-na-qi-shu-lie-lcof/,fei-bo-na-qi-shu-lie-lcof,记忆化搜索、数学、动态规划,https://algo.itcharge.cn/Solutions/Offer/fei-bo-na-qi-shu-lie-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2010-%20I.%20%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0%E5%88%97.md,35.9%,简单,2830 -剑指 Offer 10- II,Offer,剑指 Offer 10- II. 青蛙跳台阶问题,青蛙跳台阶问题,https://leetcode.cn/problems/qing-wa-tiao-tai-jie-wen-ti-lcof/,qing-wa-tiao-tai-jie-wen-ti-lcof,记忆化搜索、数学、动态规划,https://algo.itcharge.cn/Solutions/Offer/qing-wa-tiao-tai-jie-wen-ti-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2010-%20II.%20%E9%9D%92%E8%9B%99%E8%B7%B3%E5%8F%B0%E9%98%B6%E9%97%AE%E9%A2%98.md,45.7%,简单,2071 -剑指 Offer 11,Offer,剑指 Offer 11. 旋转数组的最小数字,旋转数组的最小数字,https://leetcode.cn/problems/xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof/,xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof,数组、二分查找,https://algo.itcharge.cn/Solutions/Offer/xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2011.%20%E6%97%8B%E8%BD%AC%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%B0%8F%E6%95%B0%E5%AD%97.md,49.5%,简单,2603 -剑指 Offer 12,Offer,剑指 Offer 12. 矩阵中的路径,矩阵中的路径,https://leetcode.cn/problems/ju-zhen-zhong-de-lu-jing-lcof/,ju-zhen-zhong-de-lu-jing-lcof,数组、回溯、矩阵,https://algo.itcharge.cn/Solutions/Offer/ju-zhen-zhong-de-lu-jing-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2012.%20%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E8%B7%AF%E5%BE%84.md,45.7%,中等,1859 -剑指 Offer 13,Offer,剑指 Offer 13. 机器人的运动范围,机器人的运动范围,https://leetcode.cn/problems/ji-qi-ren-de-yun-dong-fan-wei-lcof/,ji-qi-ren-de-yun-dong-fan-wei-lcof,深度优先搜索、广度优先搜索、动态规划,https://algo.itcharge.cn/Solutions/Offer/ji-qi-ren-de-yun-dong-fan-wei-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2013.%20%E6%9C%BA%E5%99%A8%E4%BA%BA%E7%9A%84%E8%BF%90%E5%8A%A8%E8%8C%83%E5%9B%B4.md,53.6%,中等,2542 -剑指 Offer 14- I,Offer,剑指 Offer 14- I. 剪绳子,剪绳子,https://leetcode.cn/problems/jian-sheng-zi-lcof/,jian-sheng-zi-lcof,数学、动态规划,https://algo.itcharge.cn/Solutions/Offer/jian-sheng-zi-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2014-%20I.%20%E5%89%AA%E7%BB%B3%E5%AD%90.md,57.4%,中等,2032 -剑指 Offer 14- II,Offer,剑指 Offer 14- II. 剪绳子 II,剪绳子 II,https://leetcode.cn/problems/jian-sheng-zi-ii-lcof/,jian-sheng-zi-ii-lcof,数学、动态规划,https://algo.itcharge.cn/Solutions/Offer/jian-sheng-zi-ii-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2014-%20II.%20%E5%89%AA%E7%BB%B3%E5%AD%90%20II.md,31.4%,中等,779 -剑指 Offer 15,Offer,剑指 Offer 15. 二进制中1的个数,二进制中1的个数,https://leetcode.cn/problems/er-jin-zhi-zhong-1de-ge-shu-lcof/,er-jin-zhi-zhong-1de-ge-shu-lcof,位运算,https://algo.itcharge.cn/Solutions/Offer/er-jin-zhi-zhong-1de-ge-shu-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2015.%20%E4%BA%8C%E8%BF%9B%E5%88%B6%E4%B8%AD1%E7%9A%84%E4%B8%AA%E6%95%B0.md,75.7%,简单,1828 -剑指 Offer 16,Offer,剑指 Offer 16. 数值的整数次方,数值的整数次方,https://leetcode.cn/problems/shu-zhi-de-zheng-shu-ci-fang-lcof/,shu-zhi-de-zheng-shu-ci-fang-lcof,递归、数学,https://algo.itcharge.cn/Solutions/Offer/shu-zhi-de-zheng-shu-ci-fang-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2016.%20%E6%95%B0%E5%80%BC%E7%9A%84%E6%95%B4%E6%95%B0%E6%AC%A1%E6%96%B9.md,34.8%,中等,1283 -剑指 Offer 17,Offer,剑指 Offer 17. 打印从1到最大的n位数,打印从1到最大的n位数,https://leetcode.cn/problems/da-yin-cong-1dao-zui-da-de-nwei-shu-lcof/,da-yin-cong-1dao-zui-da-de-nwei-shu-lcof,数组、数学,https://algo.itcharge.cn/Solutions/Offer/da-yin-cong-1dao-zui-da-de-nwei-shu-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2017.%20%E6%89%93%E5%8D%B0%E4%BB%8E1%E5%88%B0%E6%9C%80%E5%A4%A7%E7%9A%84n%E4%BD%8D%E6%95%B0.md,77.7%,简单,1594 -剑指 Offer 18,Offer,剑指 Offer 18. 删除链表的节点,删除链表的节点,https://leetcode.cn/problems/shan-chu-lian-biao-de-jie-dian-lcof/,shan-chu-lian-biao-de-jie-dian-lcof,链表,https://algo.itcharge.cn/Solutions/Offer/shan-chu-lian-biao-de-jie-dian-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2018.%20%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E7%9A%84%E8%8A%82%E7%82%B9.md,59.9%,简单,2313 -剑指 Offer 19,Offer,剑指 Offer 19. 正则表达式匹配,正则表达式匹配,https://leetcode.cn/problems/zheng-ze-biao-da-shi-pi-pei-lcof/,zheng-ze-biao-da-shi-pi-pei-lcof,递归、字符串、动态规划,https://algo.itcharge.cn/Solutions/Offer/zheng-ze-biao-da-shi-pi-pei-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2019.%20%E6%AD%A3%E5%88%99%E8%A1%A8%E8%BE%BE%E5%BC%8F%E5%8C%B9%E9%85%8D.md,38.5%,困难,721 -剑指 Offer 20,Offer,剑指 Offer 20. 表示数值的字符串,表示数值的字符串,https://leetcode.cn/problems/biao-shi-shu-zhi-de-zi-fu-chuan-lcof/,biao-shi-shu-zhi-de-zi-fu-chuan-lcof,字符串,https://algo.itcharge.cn/Solutions/Offer/biao-shi-shu-zhi-de-zi-fu-chuan-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2020.%20%E8%A1%A8%E7%A4%BA%E6%95%B0%E5%80%BC%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2.md,25.1%,中等,1545 -剑指 Offer 21,Offer,剑指 Offer 21. 调整数组顺序使奇数位于偶数前面,调整数组顺序使奇数位于偶数前面,https://leetcode.cn/problems/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof/,diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof,数组、双指针、排序,https://algo.itcharge.cn/Solutions/Offer/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2021.%20%E8%B0%83%E6%95%B4%E6%95%B0%E7%BB%84%E9%A1%BA%E5%BA%8F%E4%BD%BF%E5%A5%87%E6%95%B0%E4%BD%8D%E4%BA%8E%E5%81%B6%E6%95%B0%E5%89%8D%E9%9D%A2.md,65.0%,简单,2649 -剑指 Offer 22,Offer,剑指 Offer 22. 链表中倒数第k个节点,链表中倒数第k个节点,https://leetcode.cn/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof/,lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof,链表、双指针,https://algo.itcharge.cn/Solutions/Offer/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2022.%20%E9%93%BE%E8%A1%A8%E4%B8%AD%E5%80%92%E6%95%B0%E7%AC%ACk%E4%B8%AA%E8%8A%82%E7%82%B9.md,80.1%,简单,3606 -剑指 Offer 24,Offer,剑指 Offer 24. 反转链表,反转链表,https://leetcode.cn/problems/fan-zhuan-lian-biao-lcof/,fan-zhuan-lian-biao-lcof,递归、链表,https://algo.itcharge.cn/Solutions/Offer/fan-zhuan-lian-biao-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2024.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8.md,74.2%,简单,2950 -剑指 Offer 25,Offer,剑指 Offer 25. 合并两个排序的链表,合并两个排序的链表,https://leetcode.cn/problems/he-bing-liang-ge-pai-xu-de-lian-biao-lcof/,he-bing-liang-ge-pai-xu-de-lian-biao-lcof,递归、链表,https://algo.itcharge.cn/Solutions/Offer/he-bing-liang-ge-pai-xu-de-lian-biao-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2025.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%8E%92%E5%BA%8F%E7%9A%84%E9%93%BE%E8%A1%A8.md,72.2%,简单,1930 -剑指 Offer 26,Offer,剑指 Offer 26. 树的子结构,树的子结构,https://leetcode.cn/problems/shu-de-zi-jie-gou-lcof/,shu-de-zi-jie-gou-lcof,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/Offer/shu-de-zi-jie-gou-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2026.%20%E6%A0%91%E7%9A%84%E5%AD%90%E7%BB%93%E6%9E%84.md,46.4%,中等,2091 -剑指 Offer 27,Offer,剑指 Offer 27. 二叉树的镜像,二叉树的镜像,https://leetcode.cn/problems/er-cha-shu-de-jing-xiang-lcof/,er-cha-shu-de-jing-xiang-lcof,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/Offer/er-cha-shu-de-jing-xiang-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2027.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%95%9C%E5%83%8F.md,79.6%,简单,2240 -剑指 Offer 28,Offer,剑指 Offer 28. 对称的二叉树,对称的二叉树,https://leetcode.cn/problems/dui-cheng-de-er-cha-shu-lcof/,dui-cheng-de-er-cha-shu-lcof,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/Offer/dui-cheng-de-er-cha-shu-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2028.%20%E5%AF%B9%E7%A7%B0%E7%9A%84%E4%BA%8C%E5%8F%89%E6%A0%91.md,57.6%,简单,1874 -剑指 Offer 29,Offer,剑指 Offer 29. 顺时针打印矩阵,顺时针打印矩阵,https://leetcode.cn/problems/shun-shi-zhen-da-yin-ju-zhen-lcof/,shun-shi-zhen-da-yin-ju-zhen-lcof,数组、矩阵、模拟,https://algo.itcharge.cn/Solutions/Offer/shun-shi-zhen-da-yin-ju-zhen-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2029.%20%E9%A1%BA%E6%97%B6%E9%92%88%E6%89%93%E5%8D%B0%E7%9F%A9%E9%98%B5.md,43.0%,简单,2204 -剑指 Offer 30,Offer,剑指 Offer 30. 包含min函数的栈,包含min函数的栈,https://leetcode.cn/problems/bao-han-minhan-shu-de-zhan-lcof/,bao-han-minhan-shu-de-zhan-lcof,栈、设计,https://algo.itcharge.cn/Solutions/Offer/bao-han-minhan-shu-de-zhan-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2030.%20%E5%8C%85%E5%90%ABmin%E5%87%BD%E6%95%B0%E7%9A%84%E6%A0%88.md,55.3%,简单,2034 -剑指 Offer 31,Offer,剑指 Offer 31. 栈的压入、弹出序列,栈的压入、弹出序列,https://leetcode.cn/problems/zhan-de-ya-ru-dan-chu-xu-lie-lcof/,zhan-de-ya-ru-dan-chu-xu-lie-lcof,栈、数组、模拟,https://algo.itcharge.cn/Solutions/Offer/zhan-de-ya-ru-dan-chu-xu-lie-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2031.%20%E6%A0%88%E7%9A%84%E5%8E%8B%E5%85%A5%E3%80%81%E5%BC%B9%E5%87%BA%E5%BA%8F%E5%88%97.md,61.0%,中等,1561 -剑指 Offer 32 - I,Offer,剑指 Offer 32 - I. 从上到下打印二叉树,从上到下打印二叉树,https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-lcof/,cong-shang-dao-xia-da-yin-er-cha-shu-lcof,树、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/Offer/cong-shang-dao-xia-da-yin-er-cha-shu-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2032%20-%20I.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91.md,63.1%,中等,1719 -剑指 Offer 32 - II,Offer,剑指 Offer 32 - II. 从上到下打印二叉树 II,从上到下打印二叉树 II,https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof/,cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof,树、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/Offer/cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2032%20-%20II.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91%20II.md,68.9%,简单,1907 -剑指 Offer 32 - III,Offer,剑指 Offer 32 - III. 从上到下打印二叉树 III,从上到下打印二叉树 III,https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof/,cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof,树、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/Offer/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2032%20-%20III.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91%20III.md,58.2%,中等,2124 -剑指 Offer 33,Offer,剑指 Offer 33. 二叉搜索树的后序遍历序列,二叉搜索树的后序遍历序列,https://leetcode.cn/problems/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof/,er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof,栈、树、二叉搜索树、递归、二叉树、单调栈,https://algo.itcharge.cn/Solutions/Offer/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2033.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86%E5%BA%8F%E5%88%97.md,56.9%,中等,1653 -剑指 Offer 34,Offer,剑指 Offer 34. 二叉树中和为某一值的路径,二叉树中和为某一值的路径,https://leetcode.cn/problems/er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof/,er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof,树、深度优先搜索、回溯、二叉树,https://algo.itcharge.cn/Solutions/Offer/er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2034.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E5%92%8C%E4%B8%BA%E6%9F%90%E4%B8%80%E5%80%BC%E7%9A%84%E8%B7%AF%E5%BE%84.md,59.0%,中等,1515 -剑指 Offer 35,Offer,剑指 Offer 35. 复杂链表的复制,复杂链表的复制,https://leetcode.cn/problems/fu-za-lian-biao-de-fu-zhi-lcof/,fu-za-lian-biao-de-fu-zhi-lcof,哈希表、链表,https://algo.itcharge.cn/Solutions/Offer/fu-za-lian-biao-de-fu-zhi-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2035.%20%E5%A4%8D%E6%9D%82%E9%93%BE%E8%A1%A8%E7%9A%84%E5%A4%8D%E5%88%B6.md,71.6%,中等,1794 -剑指 Offer 36,Offer,剑指 Offer 36. 二叉搜索树与双向链表,二叉搜索树与双向链表,https://leetcode.cn/problems/er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof/,er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof,栈、树、深度优先搜索、二叉搜索树、链表、二叉树、双向链表,https://algo.itcharge.cn/Solutions/Offer/er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2036.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%8E%E5%8F%8C%E5%90%91%E9%93%BE%E8%A1%A8.md,64.9%,中等,1651 -剑指 Offer 37,Offer,剑指 Offer 37. 序列化二叉树,序列化二叉树,https://leetcode.cn/problems/xu-lie-hua-er-cha-shu-lcof/,xu-lie-hua-er-cha-shu-lcof,树、深度优先搜索、广度优先搜索、设计、字符串、二叉树,https://algo.itcharge.cn/Solutions/Offer/xu-lie-hua-er-cha-shu-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2037.%20%E5%BA%8F%E5%88%97%E5%8C%96%E4%BA%8C%E5%8F%89%E6%A0%91.md,57.4%,困难,861 -剑指 Offer 38,Offer,剑指 Offer 38. 字符串的排列,字符串的排列,https://leetcode.cn/problems/zi-fu-chuan-de-pai-lie-lcof/,zi-fu-chuan-de-pai-lie-lcof,字符串、回溯,https://algo.itcharge.cn/Solutions/Offer/zi-fu-chuan-de-pai-lie-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2038.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%8E%92%E5%88%97.md,57.6%,中等,1637 -剑指 Offer 39,Offer,剑指 Offer 39. 数组中出现次数超过一半的数字,数组中出现次数超过一半的数字,https://leetcode.cn/problems/shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof/,shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof,数组、哈希表、分治、计数、排序,https://algo.itcharge.cn/Solutions/Offer/shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2039.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E5%87%BA%E7%8E%B0%E6%AC%A1%E6%95%B0%E8%B6%85%E8%BF%87%E4%B8%80%E5%8D%8A%E7%9A%84%E6%95%B0%E5%AD%97.md,70.0%,简单,1595 -剑指 Offer 40,Offer,剑指 Offer 40. 最小的k个数,最小的k个数,https://leetcode.cn/problems/zui-xiao-de-kge-shu-lcof/,zui-xiao-de-kge-shu-lcof,数组、分治、快速选择、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/Offer/zui-xiao-de-kge-shu-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2040.%20%E6%9C%80%E5%B0%8F%E7%9A%84k%E4%B8%AA%E6%95%B0.md,57.7%,简单,2564 -剑指 Offer 41,Offer,剑指 Offer 41. 数据流中的中位数,数据流中的中位数,https://leetcode.cn/problems/shu-ju-liu-zhong-de-zhong-wei-shu-lcof/,shu-ju-liu-zhong-de-zhong-wei-shu-lcof,设计、双指针、数据流、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/Offer/shu-ju-liu-zhong-de-zhong-wei-shu-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2041.%20%E6%95%B0%E6%8D%AE%E6%B5%81%E4%B8%AD%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0.md,58.3%,困难,883 -剑指 Offer 42,Offer,剑指 Offer 42. 连续子数组的最大和,连续子数组的最大和,https://leetcode.cn/problems/lian-xu-zi-shu-zu-de-zui-da-he-lcof/,lian-xu-zi-shu-zu-de-zui-da-he-lcof,数组、分治、动态规划,https://algo.itcharge.cn/Solutions/Offer/lian-xu-zi-shu-zu-de-zui-da-he-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2042.%20%E8%BF%9E%E7%BB%AD%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%92%8C.md,60.4%,简单,2297 -剑指 Offer 43,Offer,剑指 Offer 43. 1～n 整数中 1 出现的次数,1～n 整数中 1 出现的次数,https://leetcode.cn/problems/1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof/,1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof,递归、数学、动态规划,https://algo.itcharge.cn/Solutions/Offer/1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2043.%201%EF%BD%9En%20%E6%95%B4%E6%95%B0%E4%B8%AD%201%20%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0.md,50.5%,困难,784 -剑指 Offer 44,Offer,剑指 Offer 44. 数字序列中某一位的数字,数字序列中某一位的数字,https://leetcode.cn/problems/shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof/,shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof,数学、二分查找,https://algo.itcharge.cn/Solutions/Offer/shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2044.%20%E6%95%B0%E5%AD%97%E5%BA%8F%E5%88%97%E4%B8%AD%E6%9F%90%E4%B8%80%E4%BD%8D%E7%9A%84%E6%95%B0%E5%AD%97.md,43.1%,中等,799 -剑指 Offer 45,Offer,剑指 Offer 45. 把数组排成最小的数,把数组排成最小的数,https://leetcode.cn/problems/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof/,ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof,贪心、字符串、排序,https://algo.itcharge.cn/Solutions/Offer/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2045.%20%E6%8A%8A%E6%95%B0%E7%BB%84%E6%8E%92%E6%88%90%E6%9C%80%E5%B0%8F%E7%9A%84%E6%95%B0.md,55.0%,中等,1472 -剑指 Offer 46,Offer,剑指 Offer 46. 把数字翻译成字符串,把数字翻译成字符串,https://leetcode.cn/problems/ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof/,ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof,字符串、动态规划,https://algo.itcharge.cn/Solutions/Offer/ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2046.%20%E6%8A%8A%E6%95%B0%E5%AD%97%E7%BF%BB%E8%AF%91%E6%88%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md,51.3%,中等,2341 -剑指 Offer 47,Offer,剑指 Offer 47. 礼物的最大价值,礼物的最大价值,https://leetcode.cn/problems/li-wu-de-zui-da-jie-zhi-lcof/,li-wu-de-zui-da-jie-zhi-lcof,数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/Offer/li-wu-de-zui-da-jie-zhi-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2047.%20%E7%A4%BC%E7%89%A9%E7%9A%84%E6%9C%80%E5%A4%A7%E4%BB%B7%E5%80%BC.md,69.4%,中等,1918 -剑指 Offer 48,Offer,剑指 Offer 48. 最长不含重复字符的子字符串,最长不含重复字符的子字符串,https://leetcode.cn/problems/zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof/,zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof,哈希表、字符串、滑动窗口,https://algo.itcharge.cn/Solutions/Offer/zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2048.%20%E6%9C%80%E9%95%BF%E4%B8%8D%E5%90%AB%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md,46.1%,中等,1862 -剑指 Offer 49,Offer,剑指 Offer 49. 丑数,丑数,https://leetcode.cn/problems/chou-shu-lcof/,chou-shu-lcof,哈希表、数学、动态规划、堆（优先队列）,https://algo.itcharge.cn/Solutions/Offer/chou-shu-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2049.%20%E4%B8%91%E6%95%B0.md,64.7%,中等,879 -剑指 Offer 50,Offer,剑指 Offer 50. 第一个只出现一次的字符,第一个只出现一次的字符,https://leetcode.cn/problems/di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof/,di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof,队列、哈希表、字符串、计数,https://algo.itcharge.cn/Solutions/Offer/di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2050.%20%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E5%AD%97%E7%AC%A6.md,61.9%,简单,1842 -剑指 Offer 51,Offer,剑指 Offer 51. 数组中的逆序对,数组中的逆序对,https://leetcode.cn/problems/shu-zu-zhong-de-ni-xu-dui-lcof/,shu-zu-zhong-de-ni-xu-dui-lcof,树状数组、线段树、数组、二分查找、分治、有序集合、归并排序,https://algo.itcharge.cn/Solutions/Offer/shu-zu-zhong-de-ni-xu-dui-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2051.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%80%86%E5%BA%8F%E5%AF%B9.md,49.5%,困难,1476 -剑指 Offer 52,Offer,剑指 Offer 52. 两个链表的第一个公共节点,两个链表的第一个公共节点,https://leetcode.cn/problems/liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof/,liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof,哈希表、链表、双指针,https://algo.itcharge.cn/Solutions/Offer/liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2052.%20%E4%B8%A4%E4%B8%AA%E9%93%BE%E8%A1%A8%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%85%AC%E5%85%B1%E8%8A%82%E7%82%B9.md,65.7%,简单,1589 -剑指 Offer 53 - I,Offer,剑指 Offer 53 - I. 在排序数组中查找数字 I,在排序数组中查找数字 I,https://leetcode.cn/problems/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof/,zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof,数组、二分查找,https://algo.itcharge.cn/Solutions/Offer/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2053%20-%20I.%20%E5%9C%A8%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9F%A5%E6%89%BE%E6%95%B0%E5%AD%97%20I.md,52.8%,简单,2647 -剑指 Offer 53 - II,Offer,剑指 Offer 53 - II. 0～n-1中缺失的数字,0～n-1中缺失的数字,https://leetcode.cn/problems/que-shi-de-shu-zi-lcof/,que-shi-de-shu-zi-lcof,位运算、数组、哈希表、数学、二分查找,https://algo.itcharge.cn/Solutions/Offer/que-shi-de-shu-zi-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2053%20-%20II.%200%EF%BD%9En-1%E4%B8%AD%E7%BC%BA%E5%A4%B1%E7%9A%84%E6%95%B0%E5%AD%97.md,44.8%,简单,2541 -剑指 Offer 54,Offer,剑指 Offer 54. 二叉搜索树的第k大节点,二叉搜索树的第k大节点,https://leetcode.cn/problems/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof/,er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof,树、深度优先搜索、二叉搜索树、二叉树,https://algo.itcharge.cn/Solutions/Offer/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2054.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E7%AC%ACk%E5%A4%A7%E8%8A%82%E7%82%B9.md,76.4%,简单,1870 -剑指 Offer 55 - I,Offer,剑指 Offer 55 - I. 二叉树的深度,二叉树的深度,https://leetcode.cn/problems/er-cha-shu-de-shen-du-lcof/,er-cha-shu-de-shen-du-lcof,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/Offer/er-cha-shu-de-shen-du-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2055%20-%20I.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%B7%B1%E5%BA%A6.md,79.5%,简单,1844 -剑指 Offer 55 - II,Offer,剑指 Offer 55 - II. 平衡二叉树,平衡二叉树,https://leetcode.cn/problems/ping-heng-er-cha-shu-lcof/,ping-heng-er-cha-shu-lcof,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/Offer/ping-heng-er-cha-shu-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2055%20-%20II.%20%E5%B9%B3%E8%A1%A1%E4%BA%8C%E5%8F%89%E6%A0%91.md,59.7%,简单,1478 -剑指 Offer 56 - I,Offer,剑指 Offer 56 - I. 数组中数字出现的次数,数组中数字出现的次数,https://leetcode.cn/problems/shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof/,shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof,位运算、数组,https://algo.itcharge.cn/Solutions/Offer/shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2056%20-%20I.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E6%95%B0%E5%AD%97%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0.md,68.8%,中等,1572 -剑指 Offer 56 - II,Offer,剑指 Offer 56 - II. 数组中数字出现的次数 II,数组中数字出现的次数 II,https://leetcode.cn/problems/shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof/,shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof,位运算、数组,https://algo.itcharge.cn/Solutions/Offer/shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2056%20-%20II.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E6%95%B0%E5%AD%97%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0%20II.md,80.7%,中等,1105 -剑指 Offer 57,Offer,剑指 Offer 57. 和为s的两个数字,和为s的两个数字,https://leetcode.cn/problems/he-wei-sde-liang-ge-shu-zi-lcof/,he-wei-sde-liang-ge-shu-zi-lcof,数组、双指针、二分查找,https://algo.itcharge.cn/Solutions/Offer/he-wei-sde-liang-ge-shu-zi-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2057.%20%E5%92%8C%E4%B8%BAs%E7%9A%84%E4%B8%A4%E4%B8%AA%E6%95%B0%E5%AD%97.md,68.0%,简单,1472 -剑指 Offer 57 - II,Offer,剑指 Offer 57 - II. 和为s的连续正数序列,和为s的连续正数序列,https://leetcode.cn/problems/he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof/,he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof,数学、双指针、枚举,https://algo.itcharge.cn/Solutions/Offer/he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2057%20-%20II.%20%E5%92%8C%E4%B8%BAs%E7%9A%84%E8%BF%9E%E7%BB%AD%E6%AD%A3%E6%95%B0%E5%BA%8F%E5%88%97.md,71.3%,简单,2459 -剑指 Offer 58 - I,Offer,剑指 Offer 58 - I. 翻转单词顺序,翻转单词顺序,https://leetcode.cn/problems/fan-zhuan-dan-ci-shun-xu-lcof/,fan-zhuan-dan-ci-shun-xu-lcof,双指针、字符串,https://algo.itcharge.cn/Solutions/Offer/fan-zhuan-dan-ci-shun-xu-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2058%20-%20I.%20%E7%BF%BB%E8%BD%AC%E5%8D%95%E8%AF%8D%E9%A1%BA%E5%BA%8F.md,44.7%,简单,1661 -剑指 Offer 58 - II,Offer,剑指 Offer 58 - II. 左旋转字符串,左旋转字符串,https://leetcode.cn/problems/zuo-xuan-zhuan-zi-fu-chuan-lcof/,zuo-xuan-zhuan-zi-fu-chuan-lcof,数学、双指针、字符串,https://algo.itcharge.cn/Solutions/Offer/zuo-xuan-zhuan-zi-fu-chuan-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2058%20-%20II.%20%E5%B7%A6%E6%97%8B%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2.md,85.8%,简单,3234 -剑指 Offer 59 - I,Offer,剑指 Offer 59 - I. 滑动窗口的最大值,滑动窗口的最大值,https://leetcode.cn/problems/hua-dong-chuang-kou-de-zui-da-zhi-lcof/,hua-dong-chuang-kou-de-zui-da-zhi-lcof,队列、滑动窗口、单调队列、堆（优先队列）,https://algo.itcharge.cn/Solutions/Offer/hua-dong-chuang-kou-de-zui-da-zhi-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2059%20-%20I.%20%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md,45.0%,困难,1731 -剑指 Offer 59 - II,Offer,剑指 Offer 59 - II. 队列的最大值,队列的最大值,https://leetcode.cn/problems/dui-lie-de-zui-da-zhi-lcof/,dui-lie-de-zui-da-zhi-lcof,设计、队列、单调队列,https://algo.itcharge.cn/Solutions/Offer/dui-lie-de-zui-da-zhi-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2059%20-%20II.%20%E9%98%9F%E5%88%97%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md,48.0%,中等,1453 -剑指 Offer 60,Offer,剑指 Offer 60. n个骰子的点数,n个骰子的点数,https://leetcode.cn/problems/nge-tou-zi-de-dian-shu-lcof/,nge-tou-zi-de-dian-shu-lcof,数学、动态规划、概率与统计,https://algo.itcharge.cn/Solutions/Offer/nge-tou-zi-de-dian-shu-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2060.%20n%E4%B8%AA%E9%AA%B0%E5%AD%90%E7%9A%84%E7%82%B9%E6%95%B0.md,57.4%,中等,1005 -剑指 Offer 61,Offer,剑指 Offer 61. 扑克牌中的顺子,扑克牌中的顺子,https://leetcode.cn/problems/bu-ke-pai-zhong-de-shun-zi-lcof/,bu-ke-pai-zhong-de-shun-zi-lcof,数组、排序,https://algo.itcharge.cn/Solutions/Offer/bu-ke-pai-zhong-de-shun-zi-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2061.%20%E6%89%91%E5%85%8B%E7%89%8C%E4%B8%AD%E7%9A%84%E9%A1%BA%E5%AD%90.md,45.4%,简单,1749 -剑指 Offer 62,Offer,剑指 Offer 62. 圆圈中最后剩下的数字,圆圈中最后剩下的数字,https://leetcode.cn/problems/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof/,yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof,递归、数学,https://algo.itcharge.cn/Solutions/Offer/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2062.%20%E5%9C%86%E5%9C%88%E4%B8%AD%E6%9C%80%E5%90%8E%E5%89%A9%E4%B8%8B%E7%9A%84%E6%95%B0%E5%AD%97.md,65.5%,简单,1105 -剑指 Offer 63,Offer,剑指 Offer 63. 股票的最大利润,股票的最大利润,https://leetcode.cn/problems/gu-piao-de-zui-da-li-run-lcof/,gu-piao-de-zui-da-li-run-lcof,数组、动态规划,https://algo.itcharge.cn/Solutions/Offer/gu-piao-de-zui-da-li-run-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2063.%20%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E5%A4%A7%E5%88%A9%E6%B6%A6.md,63.0%,中等,1627 -剑指 Offer 64,Offer,剑指 Offer 64. 求1+2+…+n,求1+2+…+n,https://leetcode.cn/problems/qiu-12n-lcof/,qiu-12n-lcof,位运算、递归、脑筋急转弯,https://algo.itcharge.cn/Solutions/Offer/qiu-12n-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2064.%20%E6%B1%821%2B2%2B%E2%80%A6%2Bn.md,85.9%,中等,1790 -剑指 Offer 65,Offer,剑指 Offer 65. 不用加减乘除做加法,不用加减乘除做加法,https://leetcode.cn/problems/bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof/,bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof,位运算、数学,https://algo.itcharge.cn/Solutions/Offer/bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2065.%20%E4%B8%8D%E7%94%A8%E5%8A%A0%E5%87%8F%E4%B9%98%E9%99%A4%E5%81%9A%E5%8A%A0%E6%B3%95.md,59.6%,简单,847 -剑指 Offer 66,Offer,剑指 Offer 66. 构建乘积数组,构建乘积数组,https://leetcode.cn/problems/gou-jian-cheng-ji-shu-zu-lcof/,gou-jian-cheng-ji-shu-zu-lcof,数组、前缀和,https://algo.itcharge.cn/Solutions/Offer/gou-jian-cheng-ji-shu-zu-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2066.%20%E6%9E%84%E5%BB%BA%E4%B9%98%E7%A7%AF%E6%95%B0%E7%BB%84.md,58.6%,中等,957 -剑指 Offer 67,Offer,剑指 Offer 67. 把字符串转换成整数,把字符串转换成整数,https://leetcode.cn/problems/ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof/,ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof,字符串,https://algo.itcharge.cn/Solutions/Offer/ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2067.%20%E6%8A%8A%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%BD%AC%E6%8D%A2%E6%88%90%E6%95%B4%E6%95%B0.md,28.5%,中等,1021 -剑指 Offer 68 - I,Offer,剑指 Offer 68 - I. 二叉搜索树的最近公共祖先,二叉搜索树的最近公共祖先,https://leetcode.cn/problems/er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof/,er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof,树、深度优先搜索、二叉搜索树、二叉树,https://algo.itcharge.cn/Solutions/Offer/er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2068%20-%20I.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88.md,69.3%,简单,1125 -剑指 Offer 68 - II,Offer,剑指 Offer 68 - II. 二叉树的最近公共祖先,二叉树的最近公共祖先,https://leetcode.cn/problems/er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof/,er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/Offer/er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2068%20-%20II.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88.md,70.3%,简单,1119 -剑指 Offer II 001,Offer-II,剑指 Offer II 001. 整数除法,整数除法,https://leetcode.cn/problems/xoh6Oh/,xoh6Oh,位运算、数学,https://algo.itcharge.cn/Solutions/Offer-II/xoh6Oh/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20001.%20%E6%95%B4%E6%95%B0%E9%99%A4%E6%B3%95.md,21.1%,简单,515 -剑指 Offer II 002,Offer-II,剑指 Offer II 002. 二进制加法,二进制加法,https://leetcode.cn/problems/JFETK5/,JFETK5,位运算、数学、字符串、模拟,https://algo.itcharge.cn/Solutions/Offer-II/JFETK5/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20002.%20%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%8A%A0%E6%B3%95.md,53.8%,简单,575 -剑指 Offer II 003,Offer-II,剑指 Offer II 003. 前 n 个数字二进制中 1 的个数,前 n 个数字二进制中 1 的个数,https://leetcode.cn/problems/w3tCBm/,w3tCBm,位运算、动态规划,https://algo.itcharge.cn/Solutions/Offer-II/w3tCBm/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20003.%20%E5%89%8D%20n%20%E4%B8%AA%E6%95%B0%E5%AD%97%E4%BA%8C%E8%BF%9B%E5%88%B6%E4%B8%AD%201%20%E7%9A%84%E4%B8%AA%E6%95%B0.md,78.2%,简单,620 -剑指 Offer II 004,Offer-II,剑指 Offer II 004. 只出现一次的数字,只出现一次的数字,https://leetcode.cn/problems/WGki4K/,WGki4K,位运算、数组,https://algo.itcharge.cn/Solutions/Offer-II/WGki4K/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20004.%20%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B0%E5%AD%97.md,70.8%,中等,483 -剑指 Offer II 005,Offer-II,剑指 Offer II 005. 单词长度的最大乘积,单词长度的最大乘积,https://leetcode.cn/problems/aseY1I/,aseY1I,位运算、数组、字符串,https://algo.itcharge.cn/Solutions/Offer-II/aseY1I/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20005.%20%E5%8D%95%E8%AF%8D%E9%95%BF%E5%BA%A6%E7%9A%84%E6%9C%80%E5%A4%A7%E4%B9%98%E7%A7%AF.md,71.2%,中等,411 -剑指 Offer II 006,Offer-II,剑指 Offer II 006. 排序数组中两个数字之和,排序数组中两个数字之和,https://leetcode.cn/problems/kLl5u1/,kLl5u1,数组、双指针、二分查找,https://algo.itcharge.cn/Solutions/Offer-II/kLl5u1/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20006.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E4%B8%A4%E4%B8%AA%E6%95%B0%E5%AD%97%E4%B9%8B%E5%92%8C.md,67.3%,简单,478 -剑指 Offer II 007,Offer-II,剑指 Offer II 007. 数组中和为 0 的三个数,数组中和为 0 的三个数,https://leetcode.cn/problems/1fGaJU/,1fGaJU,数组、双指针、排序,https://algo.itcharge.cn/Solutions/Offer-II/1fGaJU/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20007.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E5%92%8C%E4%B8%BA%200%20%E7%9A%84%E4%B8%89%E4%B8%AA%E6%95%B0.md,43.6%,中等,361 -剑指 Offer II 008,Offer-II,剑指 Offer II 008. 和大于等于 target 的最短子数组,和大于等于 target 的最短子数组,https://leetcode.cn/problems/2VG8Kg/,2VG8Kg,数组、二分查找、前缀和、滑动窗口,https://algo.itcharge.cn/Solutions/Offer-II/2VG8Kg/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20008.%20%E5%92%8C%E5%A4%A7%E4%BA%8E%E7%AD%89%E4%BA%8E%20target%20%E7%9A%84%E6%9C%80%E7%9F%AD%E5%AD%90%E6%95%B0%E7%BB%84.md,49.8%,中等,468 -剑指 Offer II 009,Offer-II,剑指 Offer II 009. 乘积小于 K 的子数组,乘积小于 K 的子数组,https://leetcode.cn/problems/ZVAVXX/,ZVAVXX,数组、滑动窗口,https://algo.itcharge.cn/Solutions/Offer-II/ZVAVXX/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20009.%20%E4%B9%98%E7%A7%AF%E5%B0%8F%E4%BA%8E%20K%20%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md,53.2%,中等,391 -剑指 Offer II 010,Offer-II,剑指 Offer II 010. 和为 k 的子数组,和为 k 的子数组,https://leetcode.cn/problems/QTMn0o/,QTMn0o,数组、哈希表、前缀和,https://algo.itcharge.cn/Solutions/Offer-II/QTMn0o/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20010.%20%E5%92%8C%E4%B8%BA%20k%20%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md,43.0%,中等,375 -剑指 Offer II 011,Offer-II,剑指 Offer II 011. 0 和 1 个数相同的子数组,0 和 1 个数相同的子数组,https://leetcode.cn/problems/A1NYOS/,A1NYOS,数组、哈希表、前缀和,https://algo.itcharge.cn/Solutions/Offer-II/A1NYOS/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20011.%200%20%E5%92%8C%201%20%E4%B8%AA%E6%95%B0%E7%9B%B8%E5%90%8C%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md,54.9%,中等,345 -剑指 Offer II 012,Offer-II,剑指 Offer II 012. 左右两边子数组的和相等,左右两边子数组的和相等,https://leetcode.cn/problems/tvdfij/,tvdfij,数组、前缀和,https://algo.itcharge.cn/Solutions/Offer-II/tvdfij/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20012.%20%E5%B7%A6%E5%8F%B3%E4%B8%A4%E8%BE%B9%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E5%92%8C%E7%9B%B8%E7%AD%89.md,67.0%,简单,411 -剑指 Offer II 013,Offer-II,剑指 Offer II 013. 二维子矩阵的和,二维子矩阵的和,https://leetcode.cn/problems/O4NDxx/,O4NDxx,设计、数组、矩阵、前缀和,https://algo.itcharge.cn/Solutions/Offer-II/O4NDxx/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20013.%20%E4%BA%8C%E7%BB%B4%E5%AD%90%E7%9F%A9%E9%98%B5%E7%9A%84%E5%92%8C.md,68.9%,中等,303 -剑指 Offer II 014,Offer-II,剑指 Offer II 014. 字符串中的变位词,字符串中的变位词,https://leetcode.cn/problems/MPnaiL/,MPnaiL,哈希表、双指针、字符串、滑动窗口,https://algo.itcharge.cn/Solutions/Offer-II/MPnaiL/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20014.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%8F%98%E4%BD%8D%E8%AF%8D.md,51.5%,中等,343 -剑指 Offer II 015,Offer-II,剑指 Offer II 015. 字符串中的所有变位词,字符串中的所有变位词,https://leetcode.cn/problems/VabMRr/,VabMRr,哈希表、字符串、滑动窗口,https://algo.itcharge.cn/Solutions/Offer-II/VabMRr/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20015.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E6%89%80%E6%9C%89%E5%8F%98%E4%BD%8D%E8%AF%8D.md,61.7%,中等,302 -剑指 Offer II 016,Offer-II,剑指 Offer II 016. 不含重复字符的最长子字符串,不含重复字符的最长子字符串,https://leetcode.cn/problems/wtcaE1/,wtcaE1,哈希表、字符串、滑动窗口,https://algo.itcharge.cn/Solutions/Offer-II/wtcaE1/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20016.%20%E4%B8%8D%E5%90%AB%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md,47.6%,中等,457 -剑指 Offer II 017,Offer-II,剑指 Offer II 017. 含有所有字符的最短字符串,含有所有字符的最短字符串,https://leetcode.cn/problems/M1oyTv/,M1oyTv,哈希表、字符串、滑动窗口,https://algo.itcharge.cn/Solutions/Offer-II/M1oyTv/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20017.%20%E5%90%AB%E6%9C%89%E6%89%80%E6%9C%89%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E7%9F%AD%E5%AD%97%E7%AC%A6%E4%B8%B2.md,50.9%,困难,316 -剑指 Offer II 018,Offer-II,剑指 Offer II 018. 有效的回文,有效的回文,https://leetcode.cn/problems/XltzEq/,XltzEq,双指针、字符串,https://algo.itcharge.cn/Solutions/Offer-II/XltzEq/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20018.%20%E6%9C%89%E6%95%88%E7%9A%84%E5%9B%9E%E6%96%87.md,51.6%,简单,357 -剑指 Offer II 019,Offer-II,剑指 Offer II 019. 最多删除一个字符得到回文,最多删除一个字符得到回文,https://leetcode.cn/problems/RQku0D/,RQku0D,贪心、双指针、字符串,https://algo.itcharge.cn/Solutions/Offer-II/RQku0D/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20019.%20%E6%9C%80%E5%A4%9A%E5%88%A0%E9%99%A4%E4%B8%80%E4%B8%AA%E5%AD%97%E7%AC%A6%E5%BE%97%E5%88%B0%E5%9B%9E%E6%96%87.md,45.7%,简单,343 -剑指 Offer II 020,Offer-II,剑指 Offer II 020. 回文子字符串的个数,回文子字符串的个数,https://leetcode.cn/problems/a7VOhD/,a7VOhD,字符串、动态规划,https://algo.itcharge.cn/Solutions/Offer-II/a7VOhD/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20020.%20%E5%9B%9E%E6%96%87%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E4%B8%AA%E6%95%B0.md,71.7%,中等,313 -剑指 Offer II 021,Offer-II,剑指 Offer II 021. 删除链表的倒数第 n 个结点,删除链表的倒数第 n 个结点,https://leetcode.cn/problems/SLwz0R/,SLwz0R,链表、双指针,https://algo.itcharge.cn/Solutions/Offer-II/SLwz0R/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20021.%20%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E7%9A%84%E5%80%92%E6%95%B0%E7%AC%AC%20n%20%E4%B8%AA%E7%BB%93%E7%82%B9.md,54.1%,中等,478 -剑指 Offer II 022,Offer-II,剑指 Offer II 022. 链表中环的入口节点,链表中环的入口节点,https://leetcode.cn/problems/c32eOV/,c32eOV,哈希表、链表、双指针,https://algo.itcharge.cn/Solutions/Offer-II/c32eOV/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20022.%20%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%8E%AF%E7%9A%84%E5%85%A5%E5%8F%A3%E8%8A%82%E7%82%B9.md,55.8%,中等,373 -剑指 Offer II 023,Offer-II,剑指 Offer II 023. 两个链表的第一个重合节点,两个链表的第一个重合节点,https://leetcode.cn/problems/3u1WK4/,3u1WK4,哈希表、链表、双指针,https://algo.itcharge.cn/Solutions/Offer-II/3u1WK4/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20023.%20%E4%B8%A4%E4%B8%AA%E9%93%BE%E8%A1%A8%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E9%87%8D%E5%90%88%E8%8A%82%E7%82%B9.md,70.1%,简单,301 -剑指 Offer II 024,Offer-II,剑指 Offer II 024. 反转链表,反转链表,https://leetcode.cn/problems/UHnkqh/,UHnkqh,递归、链表,https://algo.itcharge.cn/Solutions/Offer-II/UHnkqh/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20024.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8.md,75.4%,简单,584 -剑指 Offer II 025,Offer-II,剑指 Offer II 025. 链表中的两数相加,链表中的两数相加,https://leetcode.cn/problems/lMSNwu/,lMSNwu,栈、链表、数学,https://algo.itcharge.cn/Solutions/Offer-II/lMSNwu/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20025.%20%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E4%B8%A4%E6%95%B0%E7%9B%B8%E5%8A%A0.md,58.3%,中等,414 -剑指 Offer II 026,Offer-II,剑指 Offer II 026. 重排链表,重排链表,https://leetcode.cn/problems/LGjMqU/,LGjMqU,栈、递归、链表、双指针,https://algo.itcharge.cn/Solutions/Offer-II/LGjMqU/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20026.%20%E9%87%8D%E6%8E%92%E9%93%BE%E8%A1%A8.md,66.5%,中等,391 -剑指 Offer II 027,Offer-II,剑指 Offer II 027. 回文链表,回文链表,https://leetcode.cn/problems/aMhZSa/,aMhZSa,栈、递归、链表、双指针,https://algo.itcharge.cn/Solutions/Offer-II/aMhZSa/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20027.%20%E5%9B%9E%E6%96%87%E9%93%BE%E8%A1%A8.md,61.1%,简单,505 -剑指 Offer II 028,Offer-II,剑指 Offer II 028. 展平多级双向链表,展平多级双向链表,https://leetcode.cn/problems/Qv1Da2/,Qv1Da2,深度优先搜索、链表、双向链表,https://algo.itcharge.cn/Solutions/Offer-II/Qv1Da2/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20028.%20%E5%B1%95%E5%B9%B3%E5%A4%9A%E7%BA%A7%E5%8F%8C%E5%90%91%E9%93%BE%E8%A1%A8.md,60.0%,中等,347 -剑指 Offer II 029,Offer-II,剑指 Offer II 029. 排序的循环链表,排序的循环链表,https://leetcode.cn/problems/4ueAj6/,4ueAj6,链表,https://algo.itcharge.cn/Solutions/Offer-II/4ueAj6/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20029.%20%E6%8E%92%E5%BA%8F%E7%9A%84%E5%BE%AA%E7%8E%AF%E9%93%BE%E8%A1%A8.md,33.3%,中等,630 -剑指 Offer II 030,Offer-II,剑指 Offer II 030. 插入、删除和随机访问都是 O(1) 的容器,插入、删除和随机访问都是 O(1) 的容器,https://leetcode.cn/problems/FortPu/,FortPu,设计、数组、哈希表、数学、随机化,https://algo.itcharge.cn/Solutions/Offer-II/FortPu/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20030.%20%E6%8F%92%E5%85%A5%E3%80%81%E5%88%A0%E9%99%A4%E5%92%8C%E9%9A%8F%E6%9C%BA%E8%AE%BF%E9%97%AE%E9%83%BD%E6%98%AF%20O%281%29%20%E7%9A%84%E5%AE%B9%E5%99%A8.md,53.8%,中等,176 -剑指 Offer II 031,Offer-II,剑指 Offer II 031. 最近最少使用缓存,最近最少使用缓存,https://leetcode.cn/problems/OrIXps/,OrIXps,设计、哈希表、链表、双向链表,https://algo.itcharge.cn/Solutions/Offer-II/OrIXps/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20031.%20%E6%9C%80%E8%BF%91%E6%9C%80%E5%B0%91%E4%BD%BF%E7%94%A8%E7%BC%93%E5%AD%98.md,55.6%,中等,266 -剑指 Offer II 032,Offer-II,剑指 Offer II 032. 有效的变位词,有效的变位词,https://leetcode.cn/problems/dKk3P7/,dKk3P7,哈希表、字符串、排序,https://algo.itcharge.cn/Solutions/Offer-II/dKk3P7/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20032.%20%E6%9C%89%E6%95%88%E7%9A%84%E5%8F%98%E4%BD%8D%E8%AF%8D.md,59.8%,简单,273 -剑指 Offer II 033,Offer-II,剑指 Offer II 033. 变位词组,变位词组,https://leetcode.cn/problems/sfvd7V/,sfvd7V,数组、哈希表、字符串、排序,https://algo.itcharge.cn/Solutions/Offer-II/sfvd7V/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20033.%20%E5%8F%98%E4%BD%8D%E8%AF%8D%E7%BB%84.md,74.7%,中等,234 -剑指 Offer II 034,Offer-II,剑指 Offer II 034. 外星语言是否排序,外星语言是否排序,https://leetcode.cn/problems/lwyVBB/,lwyVBB,数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/Offer-II/lwyVBB/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20034.%20%E5%A4%96%E6%98%9F%E8%AF%AD%E8%A8%80%E6%98%AF%E5%90%A6%E6%8E%92%E5%BA%8F.md,55.7%,简单,306 -剑指 Offer II 035,Offer-II,剑指 Offer II 035. 最小时间差,最小时间差,https://leetcode.cn/problems/569nqc/,569nqc,数组、数学、字符串、排序,https://algo.itcharge.cn/Solutions/Offer-II/569nqc/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20035.%20%E6%9C%80%E5%B0%8F%E6%97%B6%E9%97%B4%E5%B7%AE.md,66.0%,中等,220 -剑指 Offer II 036,Offer-II,剑指 Offer II 036. 后缀表达式,后缀表达式,https://leetcode.cn/problems/8Zf90G/,8Zf90G,栈、数组、数学,https://algo.itcharge.cn/Solutions/Offer-II/8Zf90G/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20036.%20%E5%90%8E%E7%BC%80%E8%A1%A8%E8%BE%BE%E5%BC%8F.md,55.5%,中等,283 -剑指 Offer II 037,Offer-II,剑指 Offer II 037. 小行星碰撞,小行星碰撞,https://leetcode.cn/problems/XagZNi/,XagZNi,栈、数组、模拟,https://algo.itcharge.cn/Solutions/Offer-II/XagZNi/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20037.%20%E5%B0%8F%E8%A1%8C%E6%98%9F%E7%A2%B0%E6%92%9E.md,44.8%,中等,336 -剑指 Offer II 038,Offer-II,剑指 Offer II 038. 每日温度,每日温度,https://leetcode.cn/problems/iIQa4I/,iIQa4I,栈、数组、单调栈,https://algo.itcharge.cn/Solutions/Offer-II/iIQa4I/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20038.%20%E6%AF%8F%E6%97%A5%E6%B8%A9%E5%BA%A6.md,76.2%,中等,338 -剑指 Offer II 039,Offer-II,剑指 Offer II 039. 直方图最大矩形面积,直方图最大矩形面积,https://leetcode.cn/problems/0ynMMM/,0ynMMM,栈、数组、单调栈,https://algo.itcharge.cn/Solutions/Offer-II/0ynMMM/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20039.%20%E7%9B%B4%E6%96%B9%E5%9B%BE%E6%9C%80%E5%A4%A7%E7%9F%A9%E5%BD%A2%E9%9D%A2%E7%A7%AF.md,50.7%,困难,206 -剑指 Offer II 040,Offer-II,剑指 Offer II 040. 矩阵中最大的矩形,矩阵中最大的矩形,https://leetcode.cn/problems/PLYXKQ/,PLYXKQ,栈、数组、动态规划、矩阵、单调栈,https://algo.itcharge.cn/Solutions/Offer-II/PLYXKQ/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20040.%20%E7%9F%A9%E9%98%B5%E4%B8%AD%E6%9C%80%E5%A4%A7%E7%9A%84%E7%9F%A9%E5%BD%A2.md,58.2%,困难,191 -剑指 Offer II 041,Offer-II,剑指 Offer II 041. 滑动窗口的平均值,滑动窗口的平均值,https://leetcode.cn/problems/qIsx9U/,qIsx9U,设计、队列、数组、数据流,https://algo.itcharge.cn/Solutions/Offer-II/qIsx9U/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20041.%20%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E7%9A%84%E5%B9%B3%E5%9D%87%E5%80%BC.md,77.8%,简单,479 -剑指 Offer II 042,Offer-II,剑指 Offer II 042. 最近请求次数,最近请求次数,https://leetcode.cn/problems/H8086Q/,H8086Q,设计、队列、数据流,https://algo.itcharge.cn/Solutions/Offer-II/H8086Q/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20042.%20%E6%9C%80%E8%BF%91%E8%AF%B7%E6%B1%82%E6%AC%A1%E6%95%B0.md,82.1%,简单,218 -剑指 Offer II 043,Offer-II,剑指 Offer II 043. 往完全二叉树添加节点,往完全二叉树添加节点,https://leetcode.cn/problems/NaqhDT/,NaqhDT,树、广度优先搜索、设计、二叉树,https://algo.itcharge.cn/Solutions/Offer-II/NaqhDT/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20043.%20%E5%BE%80%E5%AE%8C%E5%85%A8%E4%BA%8C%E5%8F%89%E6%A0%91%E6%B7%BB%E5%8A%A0%E8%8A%82%E7%82%B9.md,62.4%,中等,264 -剑指 Offer II 044,Offer-II,剑指 Offer II 044. 二叉树每层的最大值,二叉树每层的最大值,https://leetcode.cn/problems/hPov7L/,hPov7L,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/Offer-II/hPov7L/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20044.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E6%AF%8F%E5%B1%82%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md,64.1%,中等,302 -剑指 Offer II 045,Offer-II,剑指 Offer II 045. 二叉树最底层最左边的值,二叉树最底层最左边的值,https://leetcode.cn/problems/LwUNpT/,LwUNpT,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/Offer-II/LwUNpT/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20045.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E6%9C%80%E5%BA%95%E5%B1%82%E6%9C%80%E5%B7%A6%E8%BE%B9%E7%9A%84%E5%80%BC.md,79.2%,中等,341 -剑指 Offer II 046,Offer-II,剑指 Offer II 046. 二叉树的右侧视图,二叉树的右侧视图,https://leetcode.cn/problems/WNC0Lk/,WNC0Lk,树、深度优先搜索、广度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/Offer-II/WNC0Lk/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20046.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%8F%B3%E4%BE%A7%E8%A7%86%E5%9B%BE.md,70.6%,中等,339 -剑指 Offer II 047,Offer-II,剑指 Offer II 047. 二叉树剪枝,二叉树剪枝,https://leetcode.cn/problems/pOCWxh/,pOCWxh,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/Offer-II/pOCWxh/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20047.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E5%89%AA%E6%9E%9D.md,68.5%,中等,339 -剑指 Offer II 048,Offer-II,剑指 Offer II 048. 序列化与反序列化二叉树,序列化与反序列化二叉树,https://leetcode.cn/problems/h54YBf/,h54YBf,树、深度优先搜索、广度优先搜索、设计、字符串、二叉树,https://algo.itcharge.cn/Solutions/Offer-II/h54YBf/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20048.%20%E5%BA%8F%E5%88%97%E5%8C%96%E4%B8%8E%E5%8F%8D%E5%BA%8F%E5%88%97%E5%8C%96%E4%BA%8C%E5%8F%89%E6%A0%91.md,67.0%,困难,185 -剑指 Offer II 049,Offer-II,剑指 Offer II 049. 从根节点到叶节点的路径数字之和,从根节点到叶节点的路径数字之和,https://leetcode.cn/problems/3Etpl5/,3Etpl5,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/Offer-II/3Etpl5/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20049.%20%E4%BB%8E%E6%A0%B9%E8%8A%82%E7%82%B9%E5%88%B0%E5%8F%B6%E8%8A%82%E7%82%B9%E7%9A%84%E8%B7%AF%E5%BE%84%E6%95%B0%E5%AD%97%E4%B9%8B%E5%92%8C.md,73.8%,中等,291 -剑指 Offer II 050,Offer-II,剑指 Offer II 050. 向下的路径节点之和,向下的路径节点之和,https://leetcode.cn/problems/6eUYwP/,6eUYwP,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/Offer-II/6eUYwP/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20050.%20%E5%90%91%E4%B8%8B%E7%9A%84%E8%B7%AF%E5%BE%84%E8%8A%82%E7%82%B9%E4%B9%8B%E5%92%8C.md,51.2%,中等,220 -剑指 Offer II 051,Offer-II,剑指 Offer II 051. 节点之和最大的路径,节点之和最大的路径,https://leetcode.cn/problems/jC7MId/,jC7MId,树、深度优先搜索、动态规划、二叉树,https://algo.itcharge.cn/Solutions/Offer-II/jC7MId/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20051.%20%E8%8A%82%E7%82%B9%E4%B9%8B%E5%92%8C%E6%9C%80%E5%A4%A7%E7%9A%84%E8%B7%AF%E5%BE%84.md,49.2%,困难,172 -剑指 Offer II 052,Offer-II,剑指 Offer II 052. 展平二叉搜索树,展平二叉搜索树,https://leetcode.cn/problems/NYBBNL/,NYBBNL,栈、树、深度优先搜索、二叉搜索树、二叉树,https://algo.itcharge.cn/Solutions/Offer-II/NYBBNL/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20052.%20%E5%B1%95%E5%B9%B3%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md,73.6%,简单,275 -剑指 Offer II 053,Offer-II,剑指 Offer II 053. 二叉搜索树中的中序后继,二叉搜索树中的中序后继,https://leetcode.cn/problems/P5rCT8/,P5rCT8,树、深度优先搜索、二叉搜索树、二叉树,https://algo.itcharge.cn/Solutions/Offer-II/P5rCT8/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20053.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E4%B8%AD%E5%BA%8F%E5%90%8E%E7%BB%A7.md,63.3%,中等,278 -剑指 Offer II 054,Offer-II,剑指 Offer II 054. 所有大于等于节点的值之和,所有大于等于节点的值之和,https://leetcode.cn/problems/w6cpku/,w6cpku,树、深度优先搜索、二叉搜索树、二叉树,https://algo.itcharge.cn/Solutions/Offer-II/w6cpku/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20054.%20%E6%89%80%E6%9C%89%E5%A4%A7%E4%BA%8E%E7%AD%89%E4%BA%8E%E8%8A%82%E7%82%B9%E7%9A%84%E5%80%BC%E4%B9%8B%E5%92%8C.md,85.6%,中等,277 -剑指 Offer II 055,Offer-II,剑指 Offer II 055. 二叉搜索树迭代器,二叉搜索树迭代器,https://leetcode.cn/problems/kTOapQ/,kTOapQ,栈、树、设计、二叉搜索树、二叉树、迭代器,https://algo.itcharge.cn/Solutions/Offer-II/kTOapQ/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20055.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E8%BF%AD%E4%BB%A3%E5%99%A8.md,85.3%,中等,199 -剑指 Offer II 056,Offer-II,剑指 Offer II 056. 二叉搜索树中两个节点之和,二叉搜索树中两个节点之和,https://leetcode.cn/problems/opLdQZ/,opLdQZ,树、深度优先搜索、广度优先搜索、二叉搜索树、哈希表、双指针、二叉树,https://algo.itcharge.cn/Solutions/Offer-II/opLdQZ/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20056.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E4%B8%A4%E4%B8%AA%E8%8A%82%E7%82%B9%E4%B9%8B%E5%92%8C.md,73.4%,简单,309 -剑指 Offer II 057,Offer-II,剑指 Offer II 057. 值和下标之差都在给定的范围内,值和下标之差都在给定的范围内,https://leetcode.cn/problems/7WqeDu/,7WqeDu,数组、桶排序、有序集合、排序、滑动窗口,https://algo.itcharge.cn/Solutions/Offer-II/7WqeDu/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20057.%20%E5%80%BC%E5%92%8C%E4%B8%8B%E6%A0%87%E4%B9%8B%E5%B7%AE%E9%83%BD%E5%9C%A8%E7%BB%99%E5%AE%9A%E7%9A%84%E8%8C%83%E5%9B%B4%E5%86%85.md,35.0%,中等,144 -剑指 Offer II 058,Offer-II,剑指 Offer II 058. 日程表,日程表,https://leetcode.cn/problems/fi9suh/,fi9suh,设计、线段树、二分查找、有序集合,https://algo.itcharge.cn/Solutions/Offer-II/fi9suh/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20058.%20%E6%97%A5%E7%A8%8B%E8%A1%A8.md,61.3%,中等,174 -剑指 Offer II 059,Offer-II,剑指 Offer II 059. 数据流的第 K 大数值,数据流的第 K 大数值,https://leetcode.cn/problems/jBjn9C/,jBjn9C,树、设计、二叉搜索树、二叉树、数据流、堆（优先队列）,https://algo.itcharge.cn/Solutions/Offer-II/jBjn9C/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20059.%20%E6%95%B0%E6%8D%AE%E6%B5%81%E7%9A%84%E7%AC%AC%20K%20%E5%A4%A7%E6%95%B0%E5%80%BC.md,62.8%,简单,199 -剑指 Offer II 060,Offer-II,剑指 Offer II 060. 出现频率最高的 k 个数字,出现频率最高的 k 个数字,https://leetcode.cn/problems/g5c51o/,g5c51o,数组、哈希表、分治、桶排序、计数、快速选择、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/Offer-II/g5c51o/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20060.%20%E5%87%BA%E7%8E%B0%E9%A2%91%E7%8E%87%E6%9C%80%E9%AB%98%E7%9A%84%20k%20%E4%B8%AA%E6%95%B0%E5%AD%97.md,68.8%,中等,273 -剑指 Offer II 061,Offer-II,剑指 Offer II 061. 和最小的 k 个数对,和最小的 k 个数对,https://leetcode.cn/problems/qn8gGX/,qn8gGX,数组、堆（优先队列）,https://algo.itcharge.cn/Solutions/Offer-II/qn8gGX/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20061.%20%E5%92%8C%E6%9C%80%E5%B0%8F%E7%9A%84%20k%20%E4%B8%AA%E6%95%B0%E5%AF%B9.md,53.5%,中等,186 -剑指 Offer II 062,Offer-II,剑指 Offer II 062. 实现前缀树,实现前缀树,https://leetcode.cn/problems/QC3q1f/,QC3q1f,设计、字典树、哈希表、字符串,https://algo.itcharge.cn/Solutions/Offer-II/QC3q1f/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20062.%20%E5%AE%9E%E7%8E%B0%E5%89%8D%E7%BC%80%E6%A0%91.md,75.6%,中等,205 -剑指 Offer II 063,Offer-II,剑指 Offer II 063. 替换单词,替换单词,https://leetcode.cn/problems/UhWRSj/,UhWRSj,字典树、数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/Offer-II/UhWRSj/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20063.%20%E6%9B%BF%E6%8D%A2%E5%8D%95%E8%AF%8D.md,71.1%,中等,259 -剑指 Offer II 064,Offer-II,剑指 Offer II 064. 神奇的字典,神奇的字典,https://leetcode.cn/problems/US1pGT/,US1pGT,设计、字典树、哈希表、字符串,https://algo.itcharge.cn/Solutions/Offer-II/US1pGT/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20064.%20%E7%A5%9E%E5%A5%87%E7%9A%84%E5%AD%97%E5%85%B8.md,61.0%,中等,174 -剑指 Offer II 065,Offer-II,剑指 Offer II 065. 最短的单词编码,最短的单词编码,https://leetcode.cn/problems/iSwD2y/,iSwD2y,字典树、数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/Offer-II/iSwD2y/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20065.%20%E6%9C%80%E7%9F%AD%E7%9A%84%E5%8D%95%E8%AF%8D%E7%BC%96%E7%A0%81.md,63.3%,中等,175 -剑指 Offer II 066,Offer-II,剑指 Offer II 066. 单词之和,单词之和,https://leetcode.cn/problems/z1R5dt/,z1R5dt,设计、字典树、哈希表、字符串,https://algo.itcharge.cn/Solutions/Offer-II/z1R5dt/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20066.%20%E5%8D%95%E8%AF%8D%E4%B9%8B%E5%92%8C.md,64.4%,中等,229 -剑指 Offer II 067,Offer-II,剑指 Offer II 067. 最大的异或,最大的异或,https://leetcode.cn/problems/ms70jA/,ms70jA,位运算、字典树、数组、哈希表,https://algo.itcharge.cn/Solutions/Offer-II/ms70jA/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20067.%20%E6%9C%80%E5%A4%A7%E7%9A%84%E5%BC%82%E6%88%96.md,65.7%,中等,150 -剑指 Offer II 068,Offer-II,剑指 Offer II 068. 查找插入位置,查找插入位置,https://leetcode.cn/problems/N6YdxV/,N6YdxV,数组、二分查找,https://algo.itcharge.cn/Solutions/Offer-II/N6YdxV/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20068.%20%E6%9F%A5%E6%89%BE%E6%8F%92%E5%85%A5%E4%BD%8D%E7%BD%AE.md,49.1%,简单,275 -剑指 Offer II 069,Offer-II,剑指 Offer II 069. 山峰数组的顶部,山峰数组的顶部,https://leetcode.cn/problems/B1IidL/,B1IidL,数组、二分查找,https://algo.itcharge.cn/Solutions/Offer-II/B1IidL/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20069.%20%E5%B1%B1%E5%B3%B0%E6%95%B0%E7%BB%84%E7%9A%84%E9%A1%B6%E9%83%A8.md,70.6%,简单,610 -剑指 Offer II 070,Offer-II,剑指 Offer II 070. 排序数组中只出现一次的数字,排序数组中只出现一次的数字,https://leetcode.cn/problems/skFtm2/,skFtm2,数组、二分查找,https://algo.itcharge.cn/Solutions/Offer-II/skFtm2/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20070.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B0%E5%AD%97.md,61.4%,中等,262 -剑指 Offer II 071,Offer-II,剑指 Offer II 071. 按权重生成随机数,按权重生成随机数,https://leetcode.cn/problems/cuyjEf/,cuyjEf,数组、数学、二分查找、前缀和、随机化,https://algo.itcharge.cn/Solutions/Offer-II/cuyjEf/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20071.%20%E6%8C%89%E6%9D%83%E9%87%8D%E7%94%9F%E6%88%90%E9%9A%8F%E6%9C%BA%E6%95%B0.md,49.8%,中等,112 -剑指 Offer II 072,Offer-II,剑指 Offer II 072. 求平方根,求平方根,https://leetcode.cn/problems/jJ0w9p/,jJ0w9p,数学、二分查找,https://algo.itcharge.cn/Solutions/Offer-II/jJ0w9p/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20072.%20%E6%B1%82%E5%B9%B3%E6%96%B9%E6%A0%B9.md,43.3%,简单,248 -剑指 Offer II 073,Offer-II,剑指 Offer II 073. 狒狒吃香蕉,狒狒吃香蕉,https://leetcode.cn/problems/nZZqjQ/,nZZqjQ,数组、二分查找,https://algo.itcharge.cn/Solutions/Offer-II/nZZqjQ/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20073.%20%E7%8B%92%E7%8B%92%E5%90%83%E9%A6%99%E8%95%89.md,53.3%,中等,189 -剑指 Offer II 074,Offer-II,剑指 Offer II 074. 合并区间,合并区间,https://leetcode.cn/problems/SsGoHC/,SsGoHC,数组、排序,https://algo.itcharge.cn/Solutions/Offer-II/SsGoHC/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20074.%20%E5%90%88%E5%B9%B6%E5%8C%BA%E9%97%B4.md,56.6%,中等,246 -剑指 Offer II 075,Offer-II,剑指 Offer II 075. 数组相对排序,数组相对排序,https://leetcode.cn/problems/0H97ZC/,0H97ZC,数组、哈希表、计数排序、排序,https://algo.itcharge.cn/Solutions/Offer-II/0H97ZC/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20075.%20%E6%95%B0%E7%BB%84%E7%9B%B8%E5%AF%B9%E6%8E%92%E5%BA%8F.md,70.2%,简单,334 -剑指 Offer II 076,Offer-II,剑指 Offer II 076. 数组中的第 k 大的数字,数组中的第 k 大的数字,https://leetcode.cn/problems/xx4gT2/,xx4gT2,数组、分治、快速选择、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/Offer-II/xx4gT2/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20076.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E7%AC%AC%20k%20%E5%A4%A7%E7%9A%84%E6%95%B0%E5%AD%97.md,67.1%,中等,302 -剑指 Offer II 077,Offer-II,剑指 Offer II 077. 链表排序,链表排序,https://leetcode.cn/problems/7WHec2/,7WHec2,链表、双指针、分治、排序、归并排序,https://algo.itcharge.cn/Solutions/Offer-II/7WHec2/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20077.%20%E9%93%BE%E8%A1%A8%E6%8E%92%E5%BA%8F.md,62.9%,中等,364 -剑指 Offer II 078,Offer-II,剑指 Offer II 078. 合并排序链表,合并排序链表,https://leetcode.cn/problems/vvXgSW/,vvXgSW,链表、分治、堆（优先队列）、归并排序,https://algo.itcharge.cn/Solutions/Offer-II/vvXgSW/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20078.%20%E5%90%88%E5%B9%B6%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8.md,64.0%,困难,268 -剑指 Offer II 079,Offer-II,剑指 Offer II 079. 所有子集,所有子集,https://leetcode.cn/problems/TVdhkn/,TVdhkn,位运算、数组、回溯,https://algo.itcharge.cn/Solutions/Offer-II/TVdhkn/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20079.%20%E6%89%80%E6%9C%89%E5%AD%90%E9%9B%86.md,85.3%,中等,310 -剑指 Offer II 080,Offer-II,剑指 Offer II 080. 含有 k 个元素的组合,含有 k 个元素的组合,https://leetcode.cn/problems/uUsW3B/,uUsW3B,数组、回溯,https://algo.itcharge.cn/Solutions/Offer-II/uUsW3B/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20080.%20%E5%90%AB%E6%9C%89%20k%20%E4%B8%AA%E5%85%83%E7%B4%A0%E7%9A%84%E7%BB%84%E5%90%88.md,83.3%,中等,204 -剑指 Offer II 081,Offer-II,剑指 Offer II 081. 允许重复选择元素的组合,允许重复选择元素的组合,https://leetcode.cn/problems/Ygoe9J/,Ygoe9J,数组、回溯,https://algo.itcharge.cn/Solutions/Offer-II/Ygoe9J/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20081.%20%E5%85%81%E8%AE%B8%E9%87%8D%E5%A4%8D%E9%80%89%E6%8B%A9%E5%85%83%E7%B4%A0%E7%9A%84%E7%BB%84%E5%90%88.md,80.7%,中等,240 -剑指 Offer II 082,Offer-II,剑指 Offer II 082. 含有重复元素集合的组合,含有重复元素集合的组合,https://leetcode.cn/problems/4sjJUc/,4sjJUc,数组、回溯,https://algo.itcharge.cn/Solutions/Offer-II/4sjJUc/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20082.%20%E5%90%AB%E6%9C%89%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0%E9%9B%86%E5%90%88%E7%9A%84%E7%BB%84%E5%90%88.md,65.9%,中等,200 -剑指 Offer II 083,Offer-II,剑指 Offer II 083. 没有重复元素集合的全排列,没有重复元素集合的全排列,https://leetcode.cn/problems/VvJkup/,VvJkup,数组、回溯,https://algo.itcharge.cn/Solutions/Offer-II/VvJkup/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20083.%20%E6%B2%A1%E6%9C%89%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0%E9%9B%86%E5%90%88%E7%9A%84%E5%85%A8%E6%8E%92%E5%88%97.md,85.8%,中等,281 -剑指 Offer II 084,Offer-II,剑指 Offer II 084. 含有重复元素集合的全排列,含有重复元素集合的全排列,https://leetcode.cn/problems/7p8L0Z/,7p8L0Z,数组、回溯,https://algo.itcharge.cn/Solutions/Offer-II/7p8L0Z/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20084.%20%E5%90%AB%E6%9C%89%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0%E9%9B%86%E5%90%88%E7%9A%84%E5%85%A8%E6%8E%92%E5%88%97.md,69.4%,中等,202 -剑指 Offer II 085,Offer-II,剑指 Offer II 085. 生成匹配的括号,生成匹配的括号,https://leetcode.cn/problems/IDBivT/,IDBivT,字符串、动态规划、回溯,https://algo.itcharge.cn/Solutions/Offer-II/IDBivT/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20085.%20%E7%94%9F%E6%88%90%E5%8C%B9%E9%85%8D%E7%9A%84%E6%8B%AC%E5%8F%B7.md,84.9%,中等,286 -剑指 Offer II 086,Offer-II,剑指 Offer II 086. 分割回文子字符串,分割回文子字符串,https://leetcode.cn/problems/M99OJA/,M99OJA,深度优先搜索、广度优先搜索、图、哈希表,https://algo.itcharge.cn/Solutions/Offer-II/M99OJA/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20086.%20%E5%88%86%E5%89%B2%E5%9B%9E%E6%96%87%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md,75.6%,中等,164 -剑指 Offer II 087,Offer-II,剑指 Offer II 087. 复原 IP,复原 IP,https://leetcode.cn/problems/0on3uN/,0on3uN,字符串、回溯,https://algo.itcharge.cn/Solutions/Offer-II/0on3uN/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20087.%20%E5%A4%8D%E5%8E%9F%20IP.md,63.2%,中等,216 -剑指 Offer II 088,Offer-II,剑指 Offer II 088. 爬楼梯的最少成本,爬楼梯的最少成本,https://leetcode.cn/problems/GzCJIP/,GzCJIP,数组、动态规划,https://algo.itcharge.cn/Solutions/Offer-II/GzCJIP/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20088.%20%E7%88%AC%E6%A5%BC%E6%A2%AF%E7%9A%84%E6%9C%80%E5%B0%91%E6%88%90%E6%9C%AC.md,72.4%,简单,300 -剑指 Offer II 089,Offer-II,剑指 Offer II 089. 房屋偷盗,房屋偷盗,https://leetcode.cn/problems/Gu0c2T/,Gu0c2T,数组、动态规划,https://algo.itcharge.cn/Solutions/Offer-II/Gu0c2T/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20089.%20%E6%88%BF%E5%B1%8B%E5%81%B7%E7%9B%97.md,60.6%,中等,205 -剑指 Offer II 090,Offer-II,剑指 Offer II 090. 环形房屋偷盗,环形房屋偷盗,https://leetcode.cn/problems/PzWKhm/,PzWKhm,数组、动态规划,https://algo.itcharge.cn/Solutions/Offer-II/PzWKhm/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20090.%20%E7%8E%AF%E5%BD%A2%E6%88%BF%E5%B1%8B%E5%81%B7%E7%9B%97.md,48.8%,中等,157 -剑指 Offer II 091,Offer-II,剑指 Offer II 091. 粉刷房子,粉刷房子,https://leetcode.cn/problems/JEj789/,JEj789,数组、动态规划,https://algo.itcharge.cn/Solutions/Offer-II/JEj789/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20091.%20%E7%B2%89%E5%88%B7%E6%88%BF%E5%AD%90.md,77.5%,中等,550 -剑指 Offer II 092,Offer-II,剑指 Offer II 092. 翻转字符,翻转字符,https://leetcode.cn/problems/cyJERH/,cyJERH,字符串、动态规划,https://algo.itcharge.cn/Solutions/Offer-II/cyJERH/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20092.%20%E7%BF%BB%E8%BD%AC%E5%AD%97%E7%AC%A6.md,68.1%,中等,243 -剑指 Offer II 093,Offer-II,剑指 Offer II 093. 最长斐波那契数列,最长斐波那契数列,https://leetcode.cn/problems/Q91FMA/,Q91FMA,数组、哈希表、动态规划,https://algo.itcharge.cn/Solutions/Offer-II/Q91FMA/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20093.%20%E6%9C%80%E9%95%BF%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0%E5%88%97.md,58.4%,中等,137 -剑指 Offer II 094,Offer-II,剑指 Offer II 094. 最少回文分割,最少回文分割,https://leetcode.cn/problems/omKAoA/,omKAoA,字符串、动态规划,https://algo.itcharge.cn/Solutions/Offer-II/omKAoA/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20094.%20%E6%9C%80%E5%B0%91%E5%9B%9E%E6%96%87%E5%88%86%E5%89%B2.md,57.7%,困难,108 -剑指 Offer II 095,Offer-II,剑指 Offer II 095. 最长公共子序列,最长公共子序列,https://leetcode.cn/problems/qJnOS7/,qJnOS7,字符串、动态规划,https://algo.itcharge.cn/Solutions/Offer-II/qJnOS7/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20095.%20%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%AD%90%E5%BA%8F%E5%88%97.md,65.6%,中等,272 -剑指 Offer II 096,Offer-II,剑指 Offer II 096. 字符串交织,字符串交织,https://leetcode.cn/problems/IY6buf/,IY6buf,字符串、动态规划,https://algo.itcharge.cn/Solutions/Offer-II/IY6buf/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20096.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%BA%A4%E7%BB%87.md,48.1%,中等,123 -剑指 Offer II 097,Offer-II,剑指 Offer II 097. 子序列的数目,子序列的数目,https://leetcode.cn/problems/21dk04/,21dk04,字符串、动态规划,https://algo.itcharge.cn/Solutions/Offer-II/21dk04/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20097.%20%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E6%95%B0%E7%9B%AE.md,55.3%,困难,121 -剑指 Offer II 098,Offer-II,剑指 Offer II 098. 路径的数目,路径的数目,https://leetcode.cn/problems/2AoeFn/,2AoeFn,数学、动态规划、组合数学,https://algo.itcharge.cn/Solutions/Offer-II/2AoeFn/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20098.%20%E8%B7%AF%E5%BE%84%E7%9A%84%E6%95%B0%E7%9B%AE.md,76.2%,中等,209 -剑指 Offer II 099,Offer-II,剑指 Offer II 099. 最小路径之和,最小路径之和,https://leetcode.cn/problems/0i0mDW/,0i0mDW,数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/Offer-II/0i0mDW/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20099.%20%E6%9C%80%E5%B0%8F%E8%B7%AF%E5%BE%84%E4%B9%8B%E5%92%8C.md,73.4%,中等,220 -剑指 Offer II 100,Offer-II,剑指 Offer II 100. 三角形中最小路径之和,三角形中最小路径之和,https://leetcode.cn/problems/IlPe0q/,IlPe0q,数组、动态规划,https://algo.itcharge.cn/Solutions/Offer-II/IlPe0q/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20100.%20%E4%B8%89%E8%A7%92%E5%BD%A2%E4%B8%AD%E6%9C%80%E5%B0%8F%E8%B7%AF%E5%BE%84%E4%B9%8B%E5%92%8C.md,74.4%,中等,220 -剑指 Offer II 101,Offer-II,剑指 Offer II 101. 分割等和子集,分割等和子集,https://leetcode.cn/problems/NUPfPr/,NUPfPr,数学、字符串、模拟,https://algo.itcharge.cn/Solutions/Offer-II/NUPfPr/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20101.%20%E5%88%86%E5%89%B2%E7%AD%89%E5%92%8C%E5%AD%90%E9%9B%86.md,49.4%,简单,163 -剑指 Offer II 102,Offer-II,剑指 Offer II 102. 加减的目标值,加减的目标值,https://leetcode.cn/problems/YaVDxD/,YaVDxD,数组、动态规划、回溯,https://algo.itcharge.cn/Solutions/Offer-II/YaVDxD/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20102.%20%E5%8A%A0%E5%87%8F%E7%9A%84%E7%9B%AE%E6%A0%87%E5%80%BC.md,56.7%,中等,139 -剑指 Offer II 103,Offer-II,剑指 Offer II 103. 最少的硬币数目,最少的硬币数目,https://leetcode.cn/problems/gaM7Ch/,gaM7Ch,广度优先搜索、数组、动态规划,https://algo.itcharge.cn/Solutions/Offer-II/gaM7Ch/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20103.%20%E6%9C%80%E5%B0%91%E7%9A%84%E7%A1%AC%E5%B8%81%E6%95%B0%E7%9B%AE.md,50.9%,中等,185 -剑指 Offer II 104,Offer-II,剑指 Offer II 104. 排列的数目,排列的数目,https://leetcode.cn/problems/D0F0SV/,D0F0SV,数组、动态规划,https://algo.itcharge.cn/Solutions/Offer-II/D0F0SV/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20104.%20%E6%8E%92%E5%88%97%E7%9A%84%E6%95%B0%E7%9B%AE.md,57.6%,中等,112 -剑指 Offer II 105,Offer-II,剑指 Offer II 105. 岛屿的最大面积,岛屿的最大面积,https://leetcode.cn/problems/ZL6zAn/,ZL6zAn,深度优先搜索、广度优先搜索、并查集、数组、矩阵,https://algo.itcharge.cn/Solutions/Offer-II/ZL6zAn/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20105.%20%E5%B2%9B%E5%B1%BF%E7%9A%84%E6%9C%80%E5%A4%A7%E9%9D%A2%E7%A7%AF.md,69.7%,中等,295 -剑指 Offer II 106,Offer-II,剑指 Offer II 106. 二分图,二分图,https://leetcode.cn/problems/vEAB3K/,vEAB3K,深度优先搜索、广度优先搜索、并查集、图,https://algo.itcharge.cn/Solutions/Offer-II/vEAB3K/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20106.%20%E4%BA%8C%E5%88%86%E5%9B%BE.md,55.3%,中等,149 -剑指 Offer II 107,Offer-II,剑指 Offer II 107. 矩阵中的距离,矩阵中的距离,https://leetcode.cn/problems/2bCMpM/,2bCMpM,广度优先搜索、数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/Offer-II/2bCMpM/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20107.%20%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E8%B7%9D%E7%A6%BB.md,51.1%,中等,118 -剑指 Offer II 108,Offer-II,剑指 Offer II 108. 单词演变,单词演变,https://leetcode.cn/problems/om3reC/,om3reC,广度优先搜索、哈希表、字符串,https://algo.itcharge.cn/Solutions/Offer-II/om3reC/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20108.%20%E5%8D%95%E8%AF%8D%E6%BC%94%E5%8F%98.md,59.5%,困难,87 -剑指 Offer II 109,Offer-II,剑指 Offer II 109. 开密码锁,开密码锁,https://leetcode.cn/problems/zlDJc7/,zlDJc7,广度优先搜索、数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/Offer-II/zlDJc7/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20109.%20%E5%BC%80%E5%AF%86%E7%A0%81%E9%94%81.md,57.4%,中等,125 -剑指 Offer II 110,Offer-II,剑指 Offer II 110. 所有路径,所有路径,https://leetcode.cn/problems/bP4bmD/,bP4bmD,深度优先搜索、广度优先搜索、图、回溯,https://algo.itcharge.cn/Solutions/Offer-II/bP4bmD/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20110.%20%E6%89%80%E6%9C%89%E8%B7%AF%E5%BE%84.md,81.0%,中等,210 -剑指 Offer II 111,Offer-II,剑指 Offer II 111. 计算除法,计算除法,https://leetcode.cn/problems/vlzXQL/,vlzXQL,深度优先搜索、广度优先搜索、并查集、图、数组、最短路,https://algo.itcharge.cn/Solutions/Offer-II/vlzXQL/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20111.%20%E8%AE%A1%E7%AE%97%E9%99%A4%E6%B3%95.md,64.9%,中等,115 -剑指 Offer II 112,Offer-II,剑指 Offer II 112. 最长递增路径,最长递增路径,https://leetcode.cn/problems/fpTFWP/,fpTFWP,深度优先搜索、广度优先搜索、图、拓扑排序、记忆化搜索、数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/Offer-II/fpTFWP/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20112.%20%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E8%B7%AF%E5%BE%84.md,57.9%,困难,130 -剑指 Offer II 113,Offer-II,剑指 Offer II 113. 课程顺序,课程顺序,https://leetcode.cn/problems/QA2IGt/,QA2IGt,深度优先搜索、广度优先搜索、图、拓扑排序,https://algo.itcharge.cn/Solutions/Offer-II/QA2IGt/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20113.%20%E8%AF%BE%E7%A8%8B%E9%A1%BA%E5%BA%8F.md,56.7%,中等,150 -剑指 Offer II 114,Offer-II,剑指 Offer II 114. 外星文字典,外星文字典,https://leetcode.cn/problems/Jf1JuT/,Jf1JuT,深度优先搜索、广度优先搜索、图、拓扑排序、数组、字符串,https://algo.itcharge.cn/Solutions/Offer-II/Jf1JuT/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20114.%20%E5%A4%96%E6%98%9F%E6%96%87%E5%AD%97%E5%85%B8.md,51.8%,困难,215 -剑指 Offer II 115,Offer-II,剑指 Offer II 115. 重建序列,重建序列,https://leetcode.cn/problems/ur2n8P/,ur2n8P,图、拓扑排序、数组,https://algo.itcharge.cn/Solutions/Offer-II/ur2n8P/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20115.%20%E9%87%8D%E5%BB%BA%E5%BA%8F%E5%88%97.md,51.1%,中等,280 -剑指 Offer II 116,Offer-II,剑指 Offer II 116. 省份数量,省份数量,https://leetcode.cn/problems/bLyHh0/,bLyHh0,深度优先搜索、广度优先搜索、并查集、图,https://algo.itcharge.cn/Solutions/Offer-II/bLyHh0/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20116.%20%E7%9C%81%E4%BB%BD%E6%95%B0%E9%87%8F.md,67.4%,中等,213 -剑指 Offer II 117,Offer-II,剑指 Offer II 117. 相似的字符串,相似的字符串,https://leetcode.cn/problems/H6lPxb/,H6lPxb,深度优先搜索、广度优先搜索、并查集、数组、字符串,https://algo.itcharge.cn/Solutions/Offer-II/H6lPxb/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20117.%20%E7%9B%B8%E4%BC%BC%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2.md,61.9%,困难,96 -剑指 Offer II 118,Offer-II,剑指 Offer II 118. 多余的边,多余的边,https://leetcode.cn/problems/7LpjUW/,7LpjUW,深度优先搜索、广度优先搜索、并查集、图,https://algo.itcharge.cn/Solutions/Offer-II/7LpjUW/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20118.%20%E5%A4%9A%E4%BD%99%E7%9A%84%E8%BE%B9.md,69.4%,中等,126 -剑指 Offer II 119,Offer-II,剑指 Offer II 119. 最长连续序列,最长连续序列,https://leetcode.cn/problems/WhsWhI/,WhsWhI,并查集、数组、哈希表,https://algo.itcharge.cn/Solutions/Offer-II/WhsWhI/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20119.%20%E6%9C%80%E9%95%BF%E8%BF%9E%E7%BB%AD%E5%BA%8F%E5%88%97.md,49.2%,中等,228 -面试题 01.01,Interviews,面试题 01.01. 判定字符是否唯一,判定字符是否唯一,https://leetcode.cn/problems/is-unique-lcci/,is-unique-lcci,位运算、哈希表、字符串、排序,https://algo.itcharge.cn/Solutions/Interviews/is-unique-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2001.01.%20%E5%88%A4%E5%AE%9A%E5%AD%97%E7%AC%A6%E6%98%AF%E5%90%A6%E5%94%AF%E4%B8%80.md,71.0%,简单,2189 -面试题 01.02,Interviews,面试题 01.02. 判定是否互为字符重排,判定是否互为字符重排,https://leetcode.cn/problems/check-permutation-lcci/,check-permutation-lcci,哈希表、字符串、排序,https://algo.itcharge.cn/Solutions/Interviews/check-permutation-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2001.02.%20%E5%88%A4%E5%AE%9A%E6%98%AF%E5%90%A6%E4%BA%92%E4%B8%BA%E5%AD%97%E7%AC%A6%E9%87%8D%E6%8E%92.md,65.7%,简单,1868 -面试题 01.03,Interviews,面试题 01.03. URL化,URL化,https://leetcode.cn/problems/string-to-url-lcci/,string-to-url-lcci,字符串,https://algo.itcharge.cn/Solutions/Interviews/string-to-url-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2001.03.%20URL%E5%8C%96.md,57.4%,简单,744 -面试题 01.04,Interviews,面试题 01.04. 回文排列,回文排列,https://leetcode.cn/problems/palindrome-permutation-lcci/,palindrome-permutation-lcci,位运算、哈希表、字符串,https://algo.itcharge.cn/Solutions/Interviews/palindrome-permutation-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2001.04.%20%E5%9B%9E%E6%96%87%E6%8E%92%E5%88%97.md,53.7%,简单,1144 -面试题 01.05,Interviews,面试题 01.05. 一次编辑,一次编辑,https://leetcode.cn/problems/one-away-lcci/,one-away-lcci,双指针、字符串,https://algo.itcharge.cn/Solutions/Interviews/one-away-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2001.05.%20%E4%B8%80%E6%AC%A1%E7%BC%96%E8%BE%91.md,35.2%,中等,1339 -面试题 01.06,Interviews,面试题 01.06. 字符串压缩,字符串压缩,https://leetcode.cn/problems/compress-string-lcci/,compress-string-lcci,双指针、字符串,https://algo.itcharge.cn/Solutions/Interviews/compress-string-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2001.06.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%8E%8B%E7%BC%A9.md,46.2%,简单,1464 -面试题 01.07,Interviews,面试题 01.07. 旋转矩阵,旋转矩阵,https://leetcode.cn/problems/rotate-matrix-lcci/,rotate-matrix-lcci,数组、数学、矩阵,https://algo.itcharge.cn/Solutions/Interviews/rotate-matrix-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2001.07.%20%E6%97%8B%E8%BD%AC%E7%9F%A9%E9%98%B5.md,73.2%,中等,1224 -面试题 01.08,Interviews,面试题 01.08. 零矩阵,零矩阵,https://leetcode.cn/problems/zero-matrix-lcci/,zero-matrix-lcci,数组、哈希表、矩阵,https://algo.itcharge.cn/Solutions/Interviews/zero-matrix-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2001.08.%20%E9%9B%B6%E7%9F%A9%E9%98%B5.md,64.4%,中等,997 -面试题 01.09,Interviews,面试题 01.09. 字符串轮转,字符串轮转,https://leetcode.cn/problems/string-rotation-lcci/,string-rotation-lcci,字符串、字符串匹配,https://algo.itcharge.cn/Solutions/Interviews/string-rotation-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2001.09.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%BD%AE%E8%BD%AC.md,54.2%,简单,852 -面试题 02.01,Interviews,面试题 02.01. 移除重复节点,移除重复节点,https://leetcode.cn/problems/remove-duplicate-node-lcci/,remove-duplicate-node-lcci,哈希表、链表、双指针,https://algo.itcharge.cn/Solutions/Interviews/remove-duplicate-node-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2002.01.%20%E7%A7%BB%E9%99%A4%E9%87%8D%E5%A4%8D%E8%8A%82%E7%82%B9.md,66.8%,简单,880 -面试题 02.02,Interviews,面试题 02.02. 返回倒数第 k 个节点,返回倒数第 k 个节点,https://leetcode.cn/problems/kth-node-from-end-of-list-lcci/,kth-node-from-end-of-list-lcci,链表、双指针,https://algo.itcharge.cn/Solutions/Interviews/kth-node-from-end-of-list-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2002.02.%20%E8%BF%94%E5%9B%9E%E5%80%92%E6%95%B0%E7%AC%AC%20k%20%E4%B8%AA%E8%8A%82%E7%82%B9.md,78.1%,简单,1223 -面试题 02.03,Interviews,面试题 02.03. 删除中间节点,删除中间节点,https://leetcode.cn/problems/delete-middle-node-lcci/,delete-middle-node-lcci,链表,https://algo.itcharge.cn/Solutions/Interviews/delete-middle-node-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2002.03.%20%E5%88%A0%E9%99%A4%E4%B8%AD%E9%97%B4%E8%8A%82%E7%82%B9.md,86.0%,简单,861 -面试题 02.04,Interviews,面试题 02.04. 分割链表,分割链表,https://leetcode.cn/problems/partition-list-lcci/,partition-list-lcci,链表、双指针,https://algo.itcharge.cn/Solutions/Interviews/partition-list-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2002.04.%20%E5%88%86%E5%89%B2%E9%93%BE%E8%A1%A8.md,61.1%,中等,567 -面试题 02.05,Interviews,面试题 02.05. 链表求和,链表求和,https://leetcode.cn/problems/sum-lists-lcci/,sum-lists-lcci,递归、链表、数学,https://algo.itcharge.cn/Solutions/Interviews/sum-lists-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2002.05.%20%E9%93%BE%E8%A1%A8%E6%B1%82%E5%92%8C.md,47.0%,中等,758 -面试题 02.06,Interviews,面试题 02.06. 回文链表,回文链表,https://leetcode.cn/problems/palindrome-linked-list-lcci/,palindrome-linked-list-lcci,栈、递归、链表、双指针,https://algo.itcharge.cn/Solutions/Interviews/palindrome-linked-list-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2002.06.%20%E5%9B%9E%E6%96%87%E9%93%BE%E8%A1%A8.md,48.8%,简单,686 -面试题 02.07,Interviews,面试题 02.07. 链表相交,链表相交,https://leetcode.cn/problems/intersection-of-two-linked-lists-lcci/,intersection-of-two-linked-lists-lcci,哈希表、链表、双指针,https://algo.itcharge.cn/Solutions/Interviews/intersection-of-two-linked-lists-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2002.07.%20%E9%93%BE%E8%A1%A8%E7%9B%B8%E4%BA%A4.md,66.3%,简单,1137 -面试题 02.08,Interviews,面试题 02.08. 环路检测,环路检测,https://leetcode.cn/problems/linked-list-cycle-lcci/,linked-list-cycle-lcci,哈希表、链表、双指针,https://algo.itcharge.cn/Solutions/Interviews/linked-list-cycle-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2002.08.%20%E7%8E%AF%E8%B7%AF%E6%A3%80%E6%B5%8B.md,55.1%,中等,408 -面试题 03.01,Interviews,面试题 03.01. 三合一,三合一,https://leetcode.cn/problems/three-in-one-lcci/,three-in-one-lcci,栈、设计、数组,https://algo.itcharge.cn/Solutions/Interviews/three-in-one-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2003.01.%20%E4%B8%89%E5%90%88%E4%B8%80.md,53.6%,简单,286 -面试题 03.02,Interviews,面试题 03.02. 栈的最小值,栈的最小值,https://leetcode.cn/problems/min-stack-lcci/,min-stack-lcci,栈、设计,https://algo.itcharge.cn/Solutions/Interviews/min-stack-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2003.02.%20%E6%A0%88%E7%9A%84%E6%9C%80%E5%B0%8F%E5%80%BC.md,62.1%,简单,414 -面试题 03.03,Interviews,面试题 03.03. 堆盘子,堆盘子,https://leetcode.cn/problems/stack-of-plates-lcci/,stack-of-plates-lcci,栈、设计、链表,https://algo.itcharge.cn/Solutions/Interviews/stack-of-plates-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2003.03.%20%E5%A0%86%E7%9B%98%E5%AD%90.md,38.5%,中等,210 -面试题 03.04,Interviews,面试题 03.04. 化栈为队,化栈为队,https://leetcode.cn/problems/implement-queue-using-stacks-lcci/,implement-queue-using-stacks-lcci,栈、设计、队列,https://algo.itcharge.cn/Solutions/Interviews/implement-queue-using-stacks-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2003.04.%20%E5%8C%96%E6%A0%88%E4%B8%BA%E9%98%9F.md,71.8%,简单,441 -面试题 03.05,Interviews,面试题 03.05. 栈排序,栈排序,https://leetcode.cn/problems/sort-of-stacks-lcci/,sort-of-stacks-lcci,栈、设计、单调栈,https://algo.itcharge.cn/Solutions/Interviews/sort-of-stacks-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2003.05.%20%E6%A0%88%E6%8E%92%E5%BA%8F.md,53.6%,中等,346 -面试题 03.06,Interviews,面试题 03.06. 动物收容所,动物收容所,https://leetcode.cn/problems/animal-shelter-lcci/,animal-shelter-lcci,设计、队列,https://algo.itcharge.cn/Solutions/Interviews/animal-shelter-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2003.06.%20%E5%8A%A8%E7%89%A9%E6%94%B6%E5%AE%B9%E6%89%80.md,58.3%,简单,259 -面试题 04.01,Interviews,面试题 04.01. 节点间通路,节点间通路,https://leetcode.cn/problems/route-between-nodes-lcci/,route-between-nodes-lcci,深度优先搜索、广度优先搜索、图,https://algo.itcharge.cn/Solutions/Interviews/route-between-nodes-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2004.01.%20%E8%8A%82%E7%82%B9%E9%97%B4%E9%80%9A%E8%B7%AF.md,53.4%,中等,385 -面试题 04.02,Interviews,面试题 04.02. 最小高度树,最小高度树,https://leetcode.cn/problems/minimum-height-tree-lcci/,minimum-height-tree-lcci,树、二叉搜索树、数组、分治、二叉树,https://algo.itcharge.cn/Solutions/Interviews/minimum-height-tree-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2004.02.%20%E6%9C%80%E5%B0%8F%E9%AB%98%E5%BA%A6%E6%A0%91.md,78.9%,简单,562 -面试题 04.03,Interviews,面试题 04.03. 特定深度节点链表,特定深度节点链表,https://leetcode.cn/problems/list-of-depth-lcci/,list-of-depth-lcci,树、广度优先搜索、链表、二叉树,https://algo.itcharge.cn/Solutions/Interviews/list-of-depth-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2004.03.%20%E7%89%B9%E5%AE%9A%E6%B7%B1%E5%BA%A6%E8%8A%82%E7%82%B9%E9%93%BE%E8%A1%A8.md,80.7%,中等,717 -面试题 04.04,Interviews,面试题 04.04. 检查平衡性,检查平衡性,https://leetcode.cn/problems/check-balance-lcci/,check-balance-lcci,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/Interviews/check-balance-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2004.04.%20%E6%A3%80%E6%9F%A5%E5%B9%B3%E8%A1%A1%E6%80%A7.md,59.8%,简单,470 -面试题 04.05,Interviews,面试题 04.05. 合法二叉搜索树,合法二叉搜索树,https://leetcode.cn/problems/legal-binary-search-tree-lcci/,legal-binary-search-tree-lcci,树、深度优先搜索、二叉搜索树、二叉树,https://algo.itcharge.cn/Solutions/Interviews/legal-binary-search-tree-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2004.05.%20%E5%90%88%E6%B3%95%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md,35.7%,中等,445 -面试题 04.06,Interviews,面试题 04.06. 后继者,后继者,https://leetcode.cn/problems/successor-lcci/,successor-lcci,树、深度优先搜索、二叉搜索树、二叉树,https://algo.itcharge.cn/Solutions/Interviews/successor-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2004.06.%20%E5%90%8E%E7%BB%A7%E8%80%85.md,62.6%,中等,668 -面试题 04.08,Interviews,面试题 04.08. 首个共同祖先,首个共同祖先,https://leetcode.cn/problems/first-common-ancestor-lcci/,first-common-ancestor-lcci,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/Interviews/first-common-ancestor-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2004.08.%20%E9%A6%96%E4%B8%AA%E5%85%B1%E5%90%8C%E7%A5%96%E5%85%88.md,71.6%,中等,272 -面试题 04.09,Interviews,面试题 04.09. 二叉搜索树序列,二叉搜索树序列,https://leetcode.cn/problems/bst-sequences-lcci/,bst-sequences-lcci,树、二叉搜索树、回溯、二叉树,https://algo.itcharge.cn/Solutions/Interviews/bst-sequences-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2004.09.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E5%BA%8F%E5%88%97.md,48.8%,困难,161 -面试题 04.10,Interviews,面试题 04.10. 检查子树,检查子树,https://leetcode.cn/problems/check-subtree-lcci/,check-subtree-lcci,树、深度优先搜索、二叉树、字符串匹配、哈希函数,https://algo.itcharge.cn/Solutions/Interviews/check-subtree-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2004.10.%20%E6%A3%80%E6%9F%A5%E5%AD%90%E6%A0%91.md,67.5%,中等,384 -面试题 04.12,Interviews,面试题 04.12. 求和路径,求和路径,https://leetcode.cn/problems/paths-with-sum-lcci/,paths-with-sum-lcci,树、深度优先搜索、二叉树,https://algo.itcharge.cn/Solutions/Interviews/paths-with-sum-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2004.12.%20%E6%B1%82%E5%92%8C%E8%B7%AF%E5%BE%84.md,49.0%,中等,353 -面试题 05.01,Interviews,面试题 05.01. 插入,插入,https://leetcode.cn/problems/insert-into-bits-lcci/,insert-into-bits-lcci,位运算,https://algo.itcharge.cn/Solutions/Interviews/insert-into-bits-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2005.01.%20%E6%8F%92%E5%85%A5.md,51.4%,简单,302 -面试题 05.02,Interviews,面试题 05.02. 二进制数转字符串,二进制数转字符串,https://leetcode.cn/problems/binary-number-to-string-lcci/,binary-number-to-string-lcci,位运算、数学、字符串,https://algo.itcharge.cn/Solutions/Interviews/binary-number-to-string-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2005.02.%20%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%95%B0%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2.md,76.8%,中等,425 -面试题 05.03,Interviews,面试题 05.03. 翻转数位,翻转数位,https://leetcode.cn/problems/reverse-bits-lcci/,reverse-bits-lcci,位运算、动态规划,https://algo.itcharge.cn/Solutions/Interviews/reverse-bits-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2005.03.%20%E7%BF%BB%E8%BD%AC%E6%95%B0%E4%BD%8D.md,37.6%,简单,358 -面试题 05.04,Interviews,面试题 05.04. 下一个数,下一个数,https://leetcode.cn/problems/closed-number-lcci/,closed-number-lcci,位运算,https://algo.itcharge.cn/Solutions/Interviews/closed-number-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2005.04.%20%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%95%B0.md,35.6%,中等,198 -面试题 05.06,Interviews,面试题 05.06. 整数转换,整数转换,https://leetcode.cn/problems/convert-integer-lcci/,convert-integer-lcci,位运算,https://algo.itcharge.cn/Solutions/Interviews/convert-integer-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2005.06.%20%E6%95%B4%E6%95%B0%E8%BD%AC%E6%8D%A2.md,51.6%,简单,334 -面试题 05.07,Interviews,面试题 05.07. 配对交换,配对交换,https://leetcode.cn/problems/exchange-lcci/,exchange-lcci,位运算,https://algo.itcharge.cn/Solutions/Interviews/exchange-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2005.07.%20%E9%85%8D%E5%AF%B9%E4%BA%A4%E6%8D%A2.md,71.0%,简单,294 -面试题 05.08,Interviews,面试题 05.08. 绘制直线,绘制直线,https://leetcode.cn/problems/draw-line-lcci/,draw-line-lcci,位运算、数组、数学,https://algo.itcharge.cn/Solutions/Interviews/draw-line-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2005.08.%20%E7%BB%98%E5%88%B6%E7%9B%B4%E7%BA%BF.md,53.7%,中等,134 -面试题 08.01,Interviews,面试题 08.01. 三步问题,三步问题,https://leetcode.cn/problems/three-steps-problem-lcci/,three-steps-problem-lcci,记忆化搜索、数学、动态规划,https://algo.itcharge.cn/Solutions/Interviews/three-steps-problem-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2008.01.%20%E4%B8%89%E6%AD%A5%E9%97%AE%E9%A2%98.md,36.7%,简单,656 -面试题 08.02,Interviews,面试题 08.02. 迷路的机器人,迷路的机器人,https://leetcode.cn/problems/robot-in-a-grid-lcci/,robot-in-a-grid-lcci,数组、动态规划、回溯、矩阵,https://algo.itcharge.cn/Solutions/Interviews/robot-in-a-grid-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2008.02.%20%E8%BF%B7%E8%B7%AF%E7%9A%84%E6%9C%BA%E5%99%A8%E4%BA%BA.md,36.2%,中等,308 -面试题 08.03,Interviews,面试题 08.03. 魔术索引,魔术索引,https://leetcode.cn/problems/magic-index-lcci/,magic-index-lcci,数组、二分查找,https://algo.itcharge.cn/Solutions/Interviews/magic-index-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2008.03.%20%E9%AD%94%E6%9C%AF%E7%B4%A2%E5%BC%95.md,67.4%,简单,490 -面试题 08.04,Interviews,面试题 08.04. 幂集,幂集,https://leetcode.cn/problems/power-set-lcci/,power-set-lcci,位运算、数组、回溯,https://algo.itcharge.cn/Solutions/Interviews/power-set-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2008.04.%20%E5%B9%82%E9%9B%86.md,82.1%,中等,459 -面试题 08.05,Interviews,面试题 08.05. 递归乘法,递归乘法,https://leetcode.cn/problems/recursive-mulitply-lcci/,recursive-mulitply-lcci,位运算、递归、数学,https://algo.itcharge.cn/Solutions/Interviews/recursive-mulitply-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2008.05.%20%E9%80%92%E5%BD%92%E4%B9%98%E6%B3%95.md,65.6%,中等,752 -面试题 08.06,Interviews,面试题 08.06. 汉诺塔问题,汉诺塔问题,https://leetcode.cn/problems/hanota-lcci/,hanota-lcci,递归、数组,https://algo.itcharge.cn/Solutions/Interviews/hanota-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2008.06.%20%E6%B1%89%E8%AF%BA%E5%A1%94%E9%97%AE%E9%A2%98.md,64.8%,简单,418 -面试题 08.07,Interviews,面试题 08.07. 无重复字符串的排列组合,无重复字符串的排列组合,https://leetcode.cn/problems/permutation-i-lcci/,permutation-i-lcci,字符串、回溯,https://algo.itcharge.cn/Solutions/Interviews/permutation-i-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2008.07.%20%E6%97%A0%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%8E%92%E5%88%97%E7%BB%84%E5%90%88.md,81.0%,中等,464 -面试题 08.08,Interviews,面试题 08.08. 有重复字符串的排列组合,有重复字符串的排列组合,https://leetcode.cn/problems/permutation-ii-lcci/,permutation-ii-lcci,字符串、回溯,https://algo.itcharge.cn/Solutions/Interviews/permutation-ii-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2008.08.%20%E6%9C%89%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%8E%92%E5%88%97%E7%BB%84%E5%90%88.md,69.8%,中等,370 -面试题 08.09,Interviews,面试题 08.09. 括号,括号,https://leetcode.cn/problems/bracket-lcci/,bracket-lcci,字符串、动态规划、回溯,https://algo.itcharge.cn/Solutions/Interviews/bracket-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2008.09.%20%E6%8B%AC%E5%8F%B7.md,82.1%,中等,497 -面试题 08.10,Interviews,面试题 08.10. 颜色填充,颜色填充,https://leetcode.cn/problems/color-fill-lcci/,color-fill-lcci,深度优先搜索、广度优先搜索、数组、矩阵,https://algo.itcharge.cn/Solutions/Interviews/color-fill-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2008.10.%20%E9%A2%9C%E8%89%B2%E5%A1%AB%E5%85%85.md,55.7%,简单,335 -面试题 08.11,Interviews,面试题 08.11. 硬币,硬币,https://leetcode.cn/problems/coin-lcci/,coin-lcci,数组、数学、动态规划,https://algo.itcharge.cn/Solutions/Interviews/coin-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2008.11.%20%E7%A1%AC%E5%B8%81.md,49.7%,中等,376 -面试题 08.12,Interviews,面试题 08.12. 八皇后,八皇后,https://leetcode.cn/problems/eight-queens-lcci/,eight-queens-lcci,数组、回溯,https://algo.itcharge.cn/Solutions/Interviews/eight-queens-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2008.12.%20%E5%85%AB%E7%9A%87%E5%90%8E.md,76.4%,困难,419 -面试题 08.13,Interviews,面试题 08.13. 堆箱子,堆箱子,https://leetcode.cn/problems/pile-box-lcci/,pile-box-lcci,数组、动态规划、排序,https://algo.itcharge.cn/Solutions/Interviews/pile-box-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2008.13.%20%E5%A0%86%E7%AE%B1%E5%AD%90.md,51.3%,困难,133 -面试题 08.14,Interviews,面试题 08.14. 布尔运算,布尔运算,https://leetcode.cn/problems/boolean-evaluation-lcci/,boolean-evaluation-lcci,记忆化搜索、字符串、动态规划,https://algo.itcharge.cn/Solutions/Interviews/boolean-evaluation-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2008.14.%20%E5%B8%83%E5%B0%94%E8%BF%90%E7%AE%97.md,52.4%,中等,115 -面试题 10.01,Interviews,面试题 10.01. 合并排序的数组,合并排序的数组,https://leetcode.cn/problems/sorted-merge-lcci/,sorted-merge-lcci,数组、双指针、排序,https://algo.itcharge.cn/Solutions/Interviews/sorted-merge-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2010.01.%20%E5%90%88%E5%B9%B6%E6%8E%92%E5%BA%8F%E7%9A%84%E6%95%B0%E7%BB%84.md,56.1%,简单,2537 -面试题 10.02,Interviews,面试题 10.02. 变位词组,变位词组,https://leetcode.cn/problems/group-anagrams-lcci/,group-anagrams-lcci,数组、哈希表、字符串、排序,https://algo.itcharge.cn/Solutions/Interviews/group-anagrams-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2010.02.%20%E5%8F%98%E4%BD%8D%E8%AF%8D%E7%BB%84.md,74.3%,中等,480 -面试题 10.03,Interviews,面试题 10.03. 搜索旋转数组,搜索旋转数组,https://leetcode.cn/problems/search-rotate-array-lcci/,search-rotate-array-lcci,数组、二分查找,https://algo.itcharge.cn/Solutions/Interviews/search-rotate-array-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2010.03.%20%E6%90%9C%E7%B4%A2%E6%97%8B%E8%BD%AC%E6%95%B0%E7%BB%84.md,38.5%,中等,301 -面试题 10.05,Interviews,面试题 10.05. 稀疏数组搜索,稀疏数组搜索,https://leetcode.cn/problems/sparse-array-search-lcci/,sparse-array-search-lcci,数组、字符串、二分查找,https://algo.itcharge.cn/Solutions/Interviews/sparse-array-search-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2010.05.%20%E7%A8%80%E7%96%8F%E6%95%B0%E7%BB%84%E6%90%9C%E7%B4%A2.md,56.9%,简单,365 -面试题 10.09,Interviews,面试题 10.09. 排序矩阵查找,排序矩阵查找,https://leetcode.cn/problems/sorted-matrix-search-lcci/,sorted-matrix-search-lcci,数组、二分查找、分治、矩阵,https://algo.itcharge.cn/Solutions/Interviews/sorted-matrix-search-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2010.09.%20%E6%8E%92%E5%BA%8F%E7%9F%A9%E9%98%B5%E6%9F%A5%E6%89%BE.md,44.6%,中等,229 -面试题 10.10,Interviews,面试题 10.10. 数字流的秩,数字流的秩,https://leetcode.cn/problems/rank-from-stream-lcci/,rank-from-stream-lcci,设计、树状数组、二分查找、数据流,https://algo.itcharge.cn/Solutions/Interviews/rank-from-stream-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2010.10.%20%E6%95%B0%E5%AD%97%E6%B5%81%E7%9A%84%E7%A7%A9.md,62.1%,中等,148 -面试题 10.11,Interviews,面试题 10.11. 峰与谷,峰与谷,https://leetcode.cn/problems/peaks-and-valleys-lcci/,peaks-and-valleys-lcci,贪心、数组、排序,https://algo.itcharge.cn/Solutions/Interviews/peaks-and-valleys-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2010.11.%20%E5%B3%B0%E4%B8%8E%E8%B0%B7.md,65.9%,中等,169 -面试题 16.01,Interviews,面试题 16.01. 交换数字,交换数字,https://leetcode.cn/problems/swap-numbers-lcci/,swap-numbers-lcci,位运算、数学,https://algo.itcharge.cn/Solutions/Interviews/swap-numbers-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2016.01.%20%E4%BA%A4%E6%8D%A2%E6%95%B0%E5%AD%97.md,81.4%,中等,556 -面试题 16.02,Interviews,面试题 16.02. 单词频率,单词频率,https://leetcode.cn/problems/words-frequency-lcci/,words-frequency-lcci,设计、字典树、数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/Interviews/words-frequency-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2016.02.%20%E5%8D%95%E8%AF%8D%E9%A2%91%E7%8E%87.md,76.9%,中等,273 -面试题 16.03,Interviews,面试题 16.03. 交点,交点,https://leetcode.cn/problems/intersection-lcci/,intersection-lcci,几何、数学,https://algo.itcharge.cn/Solutions/Interviews/intersection-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2016.03.%20%E4%BA%A4%E7%82%B9.md,43.9%,困难,253 -面试题 16.04,Interviews,面试题 16.04. 井字游戏,井字游戏,https://leetcode.cn/problems/tic-tac-toe-lcci/,tic-tac-toe-lcci,数组、计数、矩阵,https://algo.itcharge.cn/Solutions/Interviews/tic-tac-toe-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2016.04.%20%E4%BA%95%E5%AD%97%E6%B8%B8%E6%88%8F.md,46.9%,中等,219 -面试题 16.05,Interviews,面试题 16.05. 阶乘尾数,阶乘尾数,https://leetcode.cn/problems/factorial-zeros-lcci/,factorial-zeros-lcci,数学,https://algo.itcharge.cn/Solutions/Interviews/factorial-zeros-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2016.05.%20%E9%98%B6%E4%B9%98%E5%B0%BE%E6%95%B0.md,43.8%,简单,177 -面试题 16.06,Interviews,面试题 16.06. 最小差,最小差,https://leetcode.cn/problems/smallest-difference-lcci/,smallest-difference-lcci,数组、双指针、二分查找、排序,https://algo.itcharge.cn/Solutions/Interviews/smallest-difference-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2016.06.%20%E6%9C%80%E5%B0%8F%E5%B7%AE.md,42.7%,中等,286 -面试题 16.07,Interviews,面试题 16.07. 最大数值,最大数值,https://leetcode.cn/problems/maximum-lcci/,maximum-lcci,位运算、脑筋急转弯、数学,https://algo.itcharge.cn/Solutions/Interviews/maximum-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2016.07.%20%E6%9C%80%E5%A4%A7%E6%95%B0%E5%80%BC.md,74.0%,简单,427 -面试题 16.08,Interviews,面试题 16.08. 整数的英语表示,整数的英语表示,https://leetcode.cn/problems/english-int-lcci/,english-int-lcci,递归、数学、字符串,https://algo.itcharge.cn/Solutions/Interviews/english-int-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2016.08.%20%E6%95%B4%E6%95%B0%E7%9A%84%E8%8B%B1%E8%AF%AD%E8%A1%A8%E7%A4%BA.md,39.1%,困难,79 -面试题 16.09,Interviews,面试题 16.09. 运算,运算,https://leetcode.cn/problems/operations-lcci/,operations-lcci,设计、数学,https://algo.itcharge.cn/Solutions/Interviews/operations-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2016.09.%20%E8%BF%90%E7%AE%97.md,56.3%,中等,60 -面试题 16.10,Interviews,面试题 16.10. 生存人数,生存人数,https://leetcode.cn/problems/living-people-lcci/,living-people-lcci,数组、计数,https://algo.itcharge.cn/Solutions/Interviews/living-people-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2016.10.%20%E7%94%9F%E5%AD%98%E4%BA%BA%E6%95%B0.md,66.9%,中等,269 -面试题 16.11,Interviews,面试题 16.11. 跳水板,跳水板,https://leetcode.cn/problems/diving-board-lcci/,diving-board-lcci,数组、数学,https://algo.itcharge.cn/Solutions/Interviews/diving-board-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2016.11.%20%E8%B7%B3%E6%B0%B4%E6%9D%BF.md,43.9%,简单,674 -面试题 16.13,Interviews,面试题 16.13. 平分正方形,平分正方形,https://leetcode.cn/problems/bisect-squares-lcci/,bisect-squares-lcci,几何、数学,https://algo.itcharge.cn/Solutions/Interviews/bisect-squares-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2016.13.%20%E5%B9%B3%E5%88%86%E6%AD%A3%E6%96%B9%E5%BD%A2.md,43.6%,中等,83 -面试题 16.14,Interviews,面试题 16.14. 最佳直线,最佳直线,https://leetcode.cn/problems/best-line-lcci/,best-line-lcci,几何、数组、哈希表、数学,https://algo.itcharge.cn/Solutions/Interviews/best-line-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2016.14.%20%E6%9C%80%E4%BD%B3%E7%9B%B4%E7%BA%BF.md,55.6%,中等,88 -面试题 16.15,Interviews,面试题 16.15. 珠玑妙算,珠玑妙算,https://leetcode.cn/problems/master-mind-lcci/,master-mind-lcci,哈希表、字符串、计数,https://algo.itcharge.cn/Solutions/Interviews/master-mind-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2016.15.%20%E7%8F%A0%E7%8E%91%E5%A6%99%E7%AE%97.md,46.4%,简单,340 -面试题 16.16,Interviews,面试题 16.16. 部分排序,部分排序,https://leetcode.cn/problems/sub-sort-lcci/,sub-sort-lcci,栈、贪心、数组、双指针、排序、单调栈,https://algo.itcharge.cn/Solutions/Interviews/sub-sort-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2016.16.%20%E9%83%A8%E5%88%86%E6%8E%92%E5%BA%8F.md,46.7%,中等,320 -面试题 16.17,Interviews,面试题 16.17. 连续数列,连续数列,https://leetcode.cn/problems/contiguous-sequence-lcci/,contiguous-sequence-lcci,数组、分治、动态规划,https://algo.itcharge.cn/Solutions/Interviews/contiguous-sequence-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2016.17.%20%E8%BF%9E%E7%BB%AD%E6%95%B0%E5%88%97.md,58.9%,简单,514 -面试题 16.18,Interviews,面试题 16.18. 模式匹配,模式匹配,https://leetcode.cn/problems/pattern-matching-lcci/,pattern-matching-lcci,数学、字符串、回溯、枚举,https://algo.itcharge.cn/Solutions/Interviews/pattern-matching-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2016.18.%20%E6%A8%A1%E5%BC%8F%E5%8C%B9%E9%85%8D.md,33.9%,中等,347 -面试题 16.19,Interviews,面试题 16.19. 水域大小,水域大小,https://leetcode.cn/problems/pond-sizes-lcci/,pond-sizes-lcci,深度优先搜索、广度优先搜索、并查集、数组、矩阵,https://algo.itcharge.cn/Solutions/Interviews/pond-sizes-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2016.19.%20%E6%B0%B4%E5%9F%9F%E5%A4%A7%E5%B0%8F.md,66.2%,中等,590 -面试题 16.20,Interviews,面试题 16.20. T9键盘,T9键盘,https://leetcode.cn/problems/t9-lcci/,t9-lcci,数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/Interviews/t9-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2016.20.%20T9%E9%94%AE%E7%9B%98.md,71.2%,中等,261 -面试题 16.21,Interviews,面试题 16.21. 交换和,交换和,https://leetcode.cn/problems/sum-swap-lcci/,sum-swap-lcci,数组、哈希表、二分查找、排序,https://algo.itcharge.cn/Solutions/Interviews/sum-swap-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2016.21.%20%E4%BA%A4%E6%8D%A2%E5%92%8C.md,47.6%,中等,271 -面试题 16.22,Interviews,面试题 16.22. 兰顿蚂蚁,兰顿蚂蚁,https://leetcode.cn/problems/langtons-ant-lcci/,langtons-ant-lcci,数组、哈希表、字符串、矩阵、模拟,https://algo.itcharge.cn/Solutions/Interviews/langtons-ant-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2016.22.%20%E5%85%B0%E9%A1%BF%E8%9A%82%E8%9A%81.md,57.8%,中等,84 -面试题 16.24,Interviews,面试题 16.24. 数对和,数对和,https://leetcode.cn/problems/pairs-with-sum-lcci/,pairs-with-sum-lcci,数组、哈希表、双指针、计数、排序,https://algo.itcharge.cn/Solutions/Interviews/pairs-with-sum-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2016.24.%20%E6%95%B0%E5%AF%B9%E5%92%8C.md,48.3%,中等,248 -面试题 16.25,Interviews,面试题 16.25. LRU 缓存,LRU 缓存,https://leetcode.cn/problems/lru-cache-lcci/,lru-cache-lcci,设计、哈希表、链表、双向链表,https://algo.itcharge.cn/Solutions/Interviews/lru-cache-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2016.25.%20LRU%20%E7%BC%93%E5%AD%98.md,55.5%,中等,351 -面试题 16.26,Interviews,面试题 16.26. 计算器,计算器,https://leetcode.cn/problems/calculator-lcci/,calculator-lcci,栈、数学、字符串,https://algo.itcharge.cn/Solutions/Interviews/calculator-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2016.26.%20%E8%AE%A1%E7%AE%97%E5%99%A8.md,39.8%,中等,292 -面试题 17.01,Interviews,面试题 17.01. 不用加号的加法,不用加号的加法,https://leetcode.cn/problems/add-without-plus-lcci/,add-without-plus-lcci,位运算、数学,https://algo.itcharge.cn/Solutions/Interviews/add-without-plus-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.01.%20%E4%B8%8D%E7%94%A8%E5%8A%A0%E5%8F%B7%E7%9A%84%E5%8A%A0%E6%B3%95.md,61.6%,简单,234 -面试题 17.04,Interviews,面试题 17.04. 消失的数字,消失的数字,https://leetcode.cn/problems/missing-number-lcci/,missing-number-lcci,位运算、数组、哈希表、数学、排序,https://algo.itcharge.cn/Solutions/Interviews/missing-number-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.04.%20%E6%B6%88%E5%A4%B1%E7%9A%84%E6%95%B0%E5%AD%97.md,59.4%,简单,724 -面试题 17.05,Interviews,面试题 17.05. 字母与数字,字母与数字,https://leetcode.cn/problems/find-longest-subarray-lcci/,find-longest-subarray-lcci,数组、哈希表、前缀和,https://algo.itcharge.cn/Solutions/Interviews/find-longest-subarray-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.05.%20%E5%AD%97%E6%AF%8D%E4%B8%8E%E6%95%B0%E5%AD%97.md,47.5%,中等,283 -面试题 17.06,Interviews,面试题 17.06. 2出现的次数,2出现的次数,https://leetcode.cn/problems/number-of-2s-in-range-lcci/,number-of-2s-in-range-lcci,递归、数学、动态规划,https://algo.itcharge.cn/Solutions/Interviews/number-of-2s-in-range-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.06.%202%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0.md,49.6%,困难,183 -面试题 17.07,Interviews,面试题 17.07. 婴儿名字,婴儿名字,https://leetcode.cn/problems/baby-names-lcci/,baby-names-lcci,深度优先搜索、广度优先搜索、并查集、数组、哈希表、字符串、计数,https://algo.itcharge.cn/Solutions/Interviews/baby-names-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.07.%20%E5%A9%B4%E5%84%BF%E5%90%8D%E5%AD%97.md,41.6%,中等,284 -面试题 17.08,Interviews,面试题 17.08. 马戏团人塔,马戏团人塔,https://leetcode.cn/problems/circus-tower-lcci/,circus-tower-lcci,数组、二分查找、动态规划、排序,https://algo.itcharge.cn/Solutions/Interviews/circus-tower-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.08.%20%E9%A9%AC%E6%88%8F%E5%9B%A2%E4%BA%BA%E5%A1%94.md,28.5%,中等,168 -面试题 17.09,Interviews,面试题 17.09. 第 k 个数,第 k 个数,https://leetcode.cn/problems/get-kth-magic-number-lcci/,get-kth-magic-number-lcci,哈希表、数学、动态规划、堆（优先队列）,https://algo.itcharge.cn/Solutions/Interviews/get-kth-magic-number-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.09.%20%E7%AC%AC%20k%20%E4%B8%AA%E6%95%B0.md,56.1%,中等,431 -面试题 17.10,Interviews,面试题 17.10. 主要元素,主要元素,https://leetcode.cn/problems/find-majority-element-lcci/,find-majority-element-lcci,数组、计数,https://algo.itcharge.cn/Solutions/Interviews/find-majority-element-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.10.%20%E4%B8%BB%E8%A6%81%E5%85%83%E7%B4%A0.md,56.2%,简单,1052 -面试题 17.11,Interviews,面试题 17.11. 单词距离,单词距离,https://leetcode.cn/problems/find-closest-lcci/,find-closest-lcci,数组、字符串,https://algo.itcharge.cn/Solutions/Interviews/find-closest-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.11.%20%E5%8D%95%E8%AF%8D%E8%B7%9D%E7%A6%BB.md,73.1%,中等,665 -面试题 17.12,Interviews,面试题 17.12. BiNode,BiNode,https://leetcode.cn/problems/binode-lcci/,binode-lcci,栈、树、深度优先搜索、二叉搜索树、链表、二叉树,https://algo.itcharge.cn/Solutions/Interviews/binode-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.12.%20BiNode.md,63.9%,简单,394 -面试题 17.13,Interviews,面试题 17.13. 恢复空格,恢复空格,https://leetcode.cn/problems/re-space-lcci/,re-space-lcci,字典树、数组、哈希表、字符串、动态规划、哈希函数、滚动哈希,https://algo.itcharge.cn/Solutions/Interviews/re-space-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.13.%20%E6%81%A2%E5%A4%8D%E7%A9%BA%E6%A0%BC.md,55.4%,中等,303 -面试题 17.14,Interviews,面试题 17.14. 最小K个数,最小K个数,https://leetcode.cn/problems/smallest-k-lcci/,smallest-k-lcci,数组、分治、快速选择、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/Interviews/smallest-k-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.14.%20%E6%9C%80%E5%B0%8FK%E4%B8%AA%E6%95%B0.md,58.9%,中等,929 -面试题 17.15,Interviews,面试题 17.15. 最长单词,最长单词,https://leetcode.cn/problems/longest-word-lcci/,longest-word-lcci,字典树、数组、哈希表、字符串,https://algo.itcharge.cn/Solutions/Interviews/longest-word-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.15.%20%E6%9C%80%E9%95%BF%E5%8D%95%E8%AF%8D.md,40.9%,中等,189 -面试题 17.16,Interviews,面试题 17.16. 按摩师,按摩师,https://leetcode.cn/problems/the-masseuse-lcci/,the-masseuse-lcci,数组、动态规划,https://algo.itcharge.cn/Solutions/Interviews/the-masseuse-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.16.%20%E6%8C%89%E6%91%A9%E5%B8%88.md,51.1%,简单,1313 -面试题 17.17,Interviews,面试题 17.17. 多次搜索,多次搜索,https://leetcode.cn/problems/multi-search-lcci/,multi-search-lcci,字典树、数组、哈希表、字符串、字符串匹配、滑动窗口,https://algo.itcharge.cn/Solutions/Interviews/multi-search-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.17.%20%E5%A4%9A%E6%AC%A1%E6%90%9C%E7%B4%A2.md,44.7%,中等,253 -面试题 17.18,Interviews,面试题 17.18. 最短超串,最短超串,https://leetcode.cn/problems/shortest-supersequence-lcci/,shortest-supersequence-lcci,数组、哈希表、滑动窗口,https://algo.itcharge.cn/Solutions/Interviews/shortest-supersequence-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.18.%20%E6%9C%80%E7%9F%AD%E8%B6%85%E4%B8%B2.md,44.4%,中等,177 -面试题 17.19,Interviews,面试题 17.19. 消失的两个数字,消失的两个数字,https://leetcode.cn/problems/missing-two-lcci/,missing-two-lcci,位运算、数组、哈希表,https://algo.itcharge.cn/Solutions/Interviews/missing-two-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.19.%20%E6%B6%88%E5%A4%B1%E7%9A%84%E4%B8%A4%E4%B8%AA%E6%95%B0%E5%AD%97.md,60.6%,困难,576 -面试题 17.20,Interviews,面试题 17.20. 连续中值,连续中值,https://leetcode.cn/problems/continuous-median-lcci/,continuous-median-lcci,设计、双指针、数据流、排序、堆（优先队列）,https://algo.itcharge.cn/Solutions/Interviews/continuous-median-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.20.%20%E8%BF%9E%E7%BB%AD%E4%B8%AD%E5%80%BC.md,58.4%,困难,110 -面试题 17.21,Interviews,面试题 17.21. 直方图的水量,直方图的水量,https://leetcode.cn/problems/volume-of-histogram-lcci/,volume-of-histogram-lcci,栈、数组、双指针、动态规划、单调栈,https://algo.itcharge.cn/Solutions/Interviews/volume-of-histogram-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.21.%20%E7%9B%B4%E6%96%B9%E5%9B%BE%E7%9A%84%E6%B0%B4%E9%87%8F.md,63.8%,困难,591 -面试题 17.22,Interviews,面试题 17.22. 单词转换,单词转换,https://leetcode.cn/problems/word-transformer-lcci/,word-transformer-lcci,广度优先搜索、哈希表、字符串、回溯,https://algo.itcharge.cn/Solutions/Interviews/word-transformer-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.22.%20%E5%8D%95%E8%AF%8D%E8%BD%AC%E6%8D%A2.md,40.3%,中等,206 -面试题 17.23,Interviews,面试题 17.23. 最大黑方阵,最大黑方阵,https://leetcode.cn/problems/max-black-square-lcci/,max-black-square-lcci,数组、动态规划、矩阵,https://algo.itcharge.cn/Solutions/Interviews/max-black-square-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.23.%20%E6%9C%80%E5%A4%A7%E9%BB%91%E6%96%B9%E9%98%B5.md,37.8%,中等,155 -面试题 17.24,Interviews,面试题 17.24. 最大子矩阵,最大子矩阵,https://leetcode.cn/problems/max-submatrix-lcci/,max-submatrix-lcci,数组、动态规划、矩阵、前缀和,https://algo.itcharge.cn/Solutions/Interviews/max-submatrix-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.24.%20%E6%9C%80%E5%A4%A7%E5%AD%90%E7%9F%A9%E9%98%B5.md,53.6%,困难,197 -面试题 17.25,Interviews,面试题 17.25. 单词矩阵,单词矩阵,https://leetcode.cn/problems/word-rectangle-lcci/,word-rectangle-lcci,字典树、数组、字符串、回溯,https://algo.itcharge.cn/Solutions/Interviews/word-rectangle-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.25.%20%E5%8D%95%E8%AF%8D%E7%9F%A9%E9%98%B5.md,50.8%,困难,58 -面试题 17.26,Interviews,面试题 17.26. 稀疏相似度,稀疏相似度,https://leetcode.cn/problems/sparse-similarity-lcci/,sparse-similarity-lcci,数组、哈希表、排序,https://algo.itcharge.cn/Solutions/Interviews/sparse-similarity-lcci/,https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.26.%20%E7%A8%80%E7%96%8F%E7%9B%B8%E4%BC%BC%E5%BA%A6.md,35.2%,困难,90 diff --git a/Contents/00.Introduction/04.Solutions-List.md b/Contents/00.Introduction/04.Solutions-List.md deleted file mode 100644 index 658bc1e0..00000000 --- a/Contents/00.Introduction/04.Solutions-List.md +++ /dev/null @@ -1,864 +0,0 @@ -# LeetCode 题解（已完成 860 道） - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0001 | [两数之和](https://leetcode.cn/problems/two-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0001.%20%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、哈希表 | 简单 | -| 0002 | [两数相加](https://leetcode.cn/problems/add-two-numbers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0002.%20%E4%B8%A4%E6%95%B0%E7%9B%B8%E5%8A%A0.md) | 递归、链表、数学 | 中等 | -| 0003 | [无重复字符的最长子串](https://leetcode.cn/problems/longest-substring-without-repeating-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0003.%20%E6%97%A0%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2.md) | 哈希表、字符串、滑动窗口 | 中等 | -| 0004 | [寻找两个正序数组的中位数](https://leetcode.cn/problems/median-of-two-sorted-arrays/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0004.%20%E5%AF%BB%E6%89%BE%E4%B8%A4%E4%B8%AA%E6%AD%A3%E5%BA%8F%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0.md) | 数组、二分查找、分治 | 困难 | -| 0005 | [最长回文子串](https://leetcode.cn/problems/longest-palindromic-substring/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0005.%20%E6%9C%80%E9%95%BF%E5%9B%9E%E6%96%87%E5%AD%90%E4%B8%B2.md) | 字符串、动态规划 | 中等 | -| 0007 | [整数反转](https://leetcode.cn/problems/reverse-integer/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0007.%20%E6%95%B4%E6%95%B0%E5%8F%8D%E8%BD%AC.md) | 数学 | 中等 | -| 0008 | [字符串转换整数 (atoi)](https://leetcode.cn/problems/string-to-integer-atoi/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0008.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%BD%AC%E6%8D%A2%E6%95%B4%E6%95%B0%20%28atoi%29.md) | 字符串 | 中等 | -| 0009 | [回文数](https://leetcode.cn/problems/palindrome-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0009.%20%E5%9B%9E%E6%96%87%E6%95%B0.md) | 数学 | 简单 | -| 0010 | [正则表达式匹配](https://leetcode.cn/problems/regular-expression-matching/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0010.%20%E6%AD%A3%E5%88%99%E8%A1%A8%E8%BE%BE%E5%BC%8F%E5%8C%B9%E9%85%8D.md) | 递归、字符串、动态规划 | 困难 | -| 0011 | [盛最多水的容器](https://leetcode.cn/problems/container-with-most-water/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0011.%20%E7%9B%9B%E6%9C%80%E5%A4%9A%E6%B0%B4%E7%9A%84%E5%AE%B9%E5%99%A8.md) | 贪心、数组、双指针 | 中等 | -| 0012 | [整数转罗马数字](https://leetcode.cn/problems/integer-to-roman/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0012.%20%E6%95%B4%E6%95%B0%E8%BD%AC%E7%BD%97%E9%A9%AC%E6%95%B0%E5%AD%97.md) | 哈希表、数学、字符串 | 中等 | -| 0013 | [罗马数字转整数](https://leetcode.cn/problems/roman-to-integer/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0013.%20%E7%BD%97%E9%A9%AC%E6%95%B0%E5%AD%97%E8%BD%AC%E6%95%B4%E6%95%B0.md) | 哈希表、数学、字符串 | 简单 | -| 0014 | [最长公共前缀](https://leetcode.cn/problems/longest-common-prefix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0014.%20%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%89%8D%E7%BC%80.md) | 字典树、字符串 | 简单 | -| 0015 | [三数之和](https://leetcode.cn/problems/3sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0015.%20%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、双指针、排序 | 中等 | -| 0016 | [最接近的三数之和](https://leetcode.cn/problems/3sum-closest/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0016.%20%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9A%84%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、双指针、排序 | 中等 | -| 0017 | [电话号码的字母组合](https://leetcode.cn/problems/letter-combinations-of-a-phone-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0017.%20%E7%94%B5%E8%AF%9D%E5%8F%B7%E7%A0%81%E7%9A%84%E5%AD%97%E6%AF%8D%E7%BB%84%E5%90%88.md) | 哈希表、字符串、回溯 | 中等 | -| 0018 | [四数之和](https://leetcode.cn/problems/4sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0018.%20%E5%9B%9B%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、双指针、排序 | 中等 | -| 0019 | [删除链表的倒数第 N 个结点](https://leetcode.cn/problems/remove-nth-node-from-end-of-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0019.%20%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E7%9A%84%E5%80%92%E6%95%B0%E7%AC%AC%20N%20%E4%B8%AA%E7%BB%93%E7%82%B9.md) | 链表、双指针 | 中等 | -| 0020 | [有效的括号](https://leetcode.cn/problems/valid-parentheses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0020.%20%E6%9C%89%E6%95%88%E7%9A%84%E6%8B%AC%E5%8F%B7.md) | 栈、字符串 | 简单 | -| 0021 | [合并两个有序链表](https://leetcode.cn/problems/merge-two-sorted-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0021.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E9%93%BE%E8%A1%A8.md) | 递归、链表 | 简单 | -| 0022 | [括号生成](https://leetcode.cn/problems/generate-parentheses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0022.%20%E6%8B%AC%E5%8F%B7%E7%94%9F%E6%88%90.md) | 字符串、动态规划、回溯 | 中等 | -| 0023 | [合并 K 个升序链表](https://leetcode.cn/problems/merge-k-sorted-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0023.%20%E5%90%88%E5%B9%B6%20K%20%E4%B8%AA%E5%8D%87%E5%BA%8F%E9%93%BE%E8%A1%A8.md) | 链表、分治、堆（优先队列）、归并排序 | 困难 | -| 0024 | [两两交换链表中的节点](https://leetcode.cn/problems/swap-nodes-in-pairs/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0024.%20%E4%B8%A4%E4%B8%A4%E4%BA%A4%E6%8D%A2%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E8%8A%82%E7%82%B9.md) | 递归、链表 | 中等 | -| 0025 | [K 个一组翻转链表](https://leetcode.cn/problems/reverse-nodes-in-k-group/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0025.%20K%20%E4%B8%AA%E4%B8%80%E7%BB%84%E7%BF%BB%E8%BD%AC%E9%93%BE%E8%A1%A8.md) | 递归、链表 | 困难 | -| 0026 | [删除有序数组中的重复项](https://leetcode.cn/problems/remove-duplicates-from-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0026.%20%E5%88%A0%E9%99%A4%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E9%A1%B9.md) | 数组、双指针 | 简单 | -| 0027 | [移除元素](https://leetcode.cn/problems/remove-element/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0027.%20%E7%A7%BB%E9%99%A4%E5%85%83%E7%B4%A0.md) | 数组、双指针 | 简单 | -| 0028 | [找出字符串中第一个匹配项的下标](https://leetcode.cn/problems/find-the-index-of-the-first-occurrence-in-a-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0028.%20%E6%89%BE%E5%87%BA%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%8C%B9%E9%85%8D%E9%A1%B9%E7%9A%84%E4%B8%8B%E6%A0%87.md) | 双指针、字符串、字符串匹配 | 中等 | -| 0029 | [两数相除](https://leetcode.cn/problems/divide-two-integers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0029.%20%E4%B8%A4%E6%95%B0%E7%9B%B8%E9%99%A4.md) | 位运算、数学 | 中等 | -| 0032 | [最长有效括号](https://leetcode.cn/problems/longest-valid-parentheses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0032.%20%E6%9C%80%E9%95%BF%E6%9C%89%E6%95%88%E6%8B%AC%E5%8F%B7.md) | 栈、字符串、动态规划 | 困难 | -| 0033 | [搜索旋转排序数组](https://leetcode.cn/problems/search-in-rotated-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0033.%20%E6%90%9C%E7%B4%A2%E6%97%8B%E8%BD%AC%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、二分查找 | 中等 | -| 0034 | [在排序数组中查找元素的第一个和最后一个位置](https://leetcode.cn/problems/find-first-and-last-position-of-element-in-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0034.%20%E5%9C%A8%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9F%A5%E6%89%BE%E5%85%83%E7%B4%A0%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%92%8C%E6%9C%80%E5%90%8E%E4%B8%80%E4%B8%AA%E4%BD%8D%E7%BD%AE.md) | 数组、二分查找 | 中等 | -| 0035 | [搜索插入位置](https://leetcode.cn/problems/search-insert-position/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0035.%20%E6%90%9C%E7%B4%A2%E6%8F%92%E5%85%A5%E4%BD%8D%E7%BD%AE.md) | 数组、二分查找 | 简单 | -| 0036 | [有效的数独](https://leetcode.cn/problems/valid-sudoku/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0036.%20%E6%9C%89%E6%95%88%E7%9A%84%E6%95%B0%E7%8B%AC.md) | 数组、哈希表、矩阵 | 中等 | -| 0037 | [解数独](https://leetcode.cn/problems/sudoku-solver/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0037.%20%E8%A7%A3%E6%95%B0%E7%8B%AC.md) | 数组、哈希表、回溯、矩阵 | 困难 | -| 0038 | [外观数列](https://leetcode.cn/problems/count-and-say/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0038.%20%E5%A4%96%E8%A7%82%E6%95%B0%E5%88%97.md) | 字符串 | 中等 | -| 0039 | [组合总和](https://leetcode.cn/problems/combination-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0039.%20%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8C.md) | 数组、回溯 | 中等 | -| 0040 | [组合总和 II](https://leetcode.cn/problems/combination-sum-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0040.%20%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8C%20II.md) | 数组、回溯 | 中等 | -| 0041 | [缺失的第一个正数](https://leetcode.cn/problems/first-missing-positive/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0041.%20%E7%BC%BA%E5%A4%B1%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E6%AD%A3%E6%95%B0.md) | 数组、哈希表 | 困难 | -| 0042 | [接雨水](https://leetcode.cn/problems/trapping-rain-water/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0042.%20%E6%8E%A5%E9%9B%A8%E6%B0%B4.md) | 栈、数组、双指针、动态规划、单调栈 | 困难 | -| 0043 | [字符串相乘](https://leetcode.cn/problems/multiply-strings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0043.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E4%B9%98.md) | 数学、字符串、模拟 | 中等 | -| 0044 | [通配符匹配](https://leetcode.cn/problems/wildcard-matching/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0044.%20%E9%80%9A%E9%85%8D%E7%AC%A6%E5%8C%B9%E9%85%8D.md) | 贪心、递归、字符串、动态规划 | 困难 | -| 0045 | [跳跃游戏 II](https://leetcode.cn/problems/jump-game-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0045.%20%E8%B7%B3%E8%B7%83%E6%B8%B8%E6%88%8F%20II.md) | 贪心、数组、动态规划 | 中等 | -| 0046 | [全排列](https://leetcode.cn/problems/permutations/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0046.%20%E5%85%A8%E6%8E%92%E5%88%97.md) | 数组、回溯 | 中等 | -| 0047 | [全排列 II](https://leetcode.cn/problems/permutations-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0047.%20%E5%85%A8%E6%8E%92%E5%88%97%20II.md) | 数组、回溯 | 中等 | -| 0048 | [旋转图像](https://leetcode.cn/problems/rotate-image/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0048.%20%E6%97%8B%E8%BD%AC%E5%9B%BE%E5%83%8F.md) | 数组、数学、矩阵 | 中等 | -| 0049 | [字母异位词分组](https://leetcode.cn/problems/group-anagrams/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0049.%20%E5%AD%97%E6%AF%8D%E5%BC%82%E4%BD%8D%E8%AF%8D%E5%88%86%E7%BB%84.md) | 数组、哈希表、字符串、排序 | 中等 | -| 0050 | [Pow(x, n)](https://leetcode.cn/problems/powx-n/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0050.%20Pow%28x%2C%20n%29.md) | 递归、数学 | 中等 | -| 0051 | [N 皇后](https://leetcode.cn/problems/n-queens/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0051.%20N%20%E7%9A%87%E5%90%8E.md) | 数组、回溯 | 困难 | -| 0052 | [N 皇后 II](https://leetcode.cn/problems/n-queens-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0052.%20N%20%E7%9A%87%E5%90%8E%20II.md) | 回溯 | 困难 | -| 0053 | [最大子数组和](https://leetcode.cn/problems/maximum-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0053.%20%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84%E5%92%8C.md) | 数组、分治、动态规划 | 中等 | -| 0054 | [螺旋矩阵](https://leetcode.cn/problems/spiral-matrix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0054.%20%E8%9E%BA%E6%97%8B%E7%9F%A9%E9%98%B5.md) | 数组、矩阵、模拟 | 中等 | -| 0055 | [跳跃游戏](https://leetcode.cn/problems/jump-game/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0055.%20%E8%B7%B3%E8%B7%83%E6%B8%B8%E6%88%8F.md) | 贪心、数组、动态规划 | 中等 | -| 0056 | [合并区间](https://leetcode.cn/problems/merge-intervals/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0056.%20%E5%90%88%E5%B9%B6%E5%8C%BA%E9%97%B4.md) | 数组、排序 | 中等 | -| 0058 | [最后一个单词的长度](https://leetcode.cn/problems/length-of-last-word/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0058.%20%E6%9C%80%E5%90%8E%E4%B8%80%E4%B8%AA%E5%8D%95%E8%AF%8D%E7%9A%84%E9%95%BF%E5%BA%A6.md) | 字符串 | 简单 | -| 0059 | [螺旋矩阵 II](https://leetcode.cn/problems/spiral-matrix-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0059.%20%E8%9E%BA%E6%97%8B%E7%9F%A9%E9%98%B5%20II.md) | 数组、矩阵、模拟 | 中等 | -| 0061 | [旋转链表](https://leetcode.cn/problems/rotate-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0061.%20%E6%97%8B%E8%BD%AC%E9%93%BE%E8%A1%A8.md) | 链表、双指针 | 中等 | -| 0062 | [不同路径](https://leetcode.cn/problems/unique-paths/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0062.%20%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84.md) | 数学、动态规划、组合数学 | 中等 | -| 0063 | [不同路径 II](https://leetcode.cn/problems/unique-paths-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0063.%20%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84%20II.md) | 数组、动态规划、矩阵 | 中等 | -| 0064 | [最小路径和](https://leetcode.cn/problems/minimum-path-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0064.%20%E6%9C%80%E5%B0%8F%E8%B7%AF%E5%BE%84%E5%92%8C.md) | 数组、动态规划、矩阵 | 中等 | -| 0066 | [加一](https://leetcode.cn/problems/plus-one/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0066.%20%E5%8A%A0%E4%B8%80.md) | 数组、数学 | 简单 | -| 0067 | [二进制求和](https://leetcode.cn/problems/add-binary/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0067.%20%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%B1%82%E5%92%8C.md) | 位运算、数学、字符串、模拟 | 简单 | -| 0069 | [x 的平方根](https://leetcode.cn/problems/sqrtx/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0069.%20x%20%E7%9A%84%E5%B9%B3%E6%96%B9%E6%A0%B9.md) | 数学、二分查找 | 简单 | -| 0070 | [爬楼梯](https://leetcode.cn/problems/climbing-stairs/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0070.%20%E7%88%AC%E6%A5%BC%E6%A2%AF.md) | 记忆化搜索、数学、动态规划 | 简单 | -| 0072 | [编辑距离](https://leetcode.cn/problems/edit-distance/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0072.%20%E7%BC%96%E8%BE%91%E8%B7%9D%E7%A6%BB.md) | 字符串、动态规划 | 困难 | -| 0073 | [矩阵置零](https://leetcode.cn/problems/set-matrix-zeroes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0073.%20%E7%9F%A9%E9%98%B5%E7%BD%AE%E9%9B%B6.md) | 数组、哈希表、矩阵 | 中等 | -| 0074 | [搜索二维矩阵](https://leetcode.cn/problems/search-a-2d-matrix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0074.%20%E6%90%9C%E7%B4%A2%E4%BA%8C%E7%BB%B4%E7%9F%A9%E9%98%B5.md) | 数组、二分查找、矩阵 | 中等 | -| 0075 | [颜色分类](https://leetcode.cn/problems/sort-colors/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0075.%20%E9%A2%9C%E8%89%B2%E5%88%86%E7%B1%BB.md) | 数组、双指针、排序 | 中等 | -| 0076 | [最小覆盖子串](https://leetcode.cn/problems/minimum-window-substring/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0076.%20%E6%9C%80%E5%B0%8F%E8%A6%86%E7%9B%96%E5%AD%90%E4%B8%B2.md) | 哈希表、字符串、滑动窗口 | 困难 | -| 0077 | [组合](https://leetcode.cn/problems/combinations/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0077.%20%E7%BB%84%E5%90%88.md) | 回溯 | 中等 | -| 0078 | [子集](https://leetcode.cn/problems/subsets/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0078.%20%E5%AD%90%E9%9B%86.md) | 位运算、数组、回溯 | 中等 | -| 0079 | [单词搜索](https://leetcode.cn/problems/word-search/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0079.%20%E5%8D%95%E8%AF%8D%E6%90%9C%E7%B4%A2.md) | 数组、回溯、矩阵 | 中等 | -| 0080 | [删除有序数组中的重复项 II](https://leetcode.cn/problems/remove-duplicates-from-sorted-array-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0080.%20%E5%88%A0%E9%99%A4%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E9%A1%B9%20II.md) | 数组、双指针 | 中等 | -| 0081 | [搜索旋转排序数组 II](https://leetcode.cn/problems/search-in-rotated-sorted-array-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0081.%20%E6%90%9C%E7%B4%A2%E6%97%8B%E8%BD%AC%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%20II.md) | 数组、二分查找 | 中等 | -| 0082 | [删除排序链表中的重复元素 II](https://leetcode.cn/problems/remove-duplicates-from-sorted-list-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0082.%20%E5%88%A0%E9%99%A4%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0%20II.md) | 链表、双指针 | 中等 | -| 0083 | [删除排序链表中的重复元素](https://leetcode.cn/problems/remove-duplicates-from-sorted-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0083.%20%E5%88%A0%E9%99%A4%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0.md) | 链表 | 简单 | -| 0084 | [柱状图中最大的矩形](https://leetcode.cn/problems/largest-rectangle-in-histogram/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0084.%20%E6%9F%B1%E7%8A%B6%E5%9B%BE%E4%B8%AD%E6%9C%80%E5%A4%A7%E7%9A%84%E7%9F%A9%E5%BD%A2.md) | 栈、数组、单调栈 | 困难 | -| 0088 | [合并两个有序数组](https://leetcode.cn/problems/merge-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0088.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、双指针、排序 | 简单 | -| 0089 | [格雷编码](https://leetcode.cn/problems/gray-code/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0089.%20%E6%A0%BC%E9%9B%B7%E7%BC%96%E7%A0%81.md) | 位运算、数学、回溯 | 中等 | -| 0090 | [子集 II](https://leetcode.cn/problems/subsets-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0090.%20%E5%AD%90%E9%9B%86%20II.md) | 位运算、数组、回溯 | 中等 | -| 0091 | [解码方法](https://leetcode.cn/problems/decode-ways/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0091.%20%E8%A7%A3%E7%A0%81%E6%96%B9%E6%B3%95.md) | 字符串、动态规划 | 中等 | -| 0092 | [反转链表 II](https://leetcode.cn/problems/reverse-linked-list-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0092.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8%20II.md) | 链表 | 中等 | -| 0093 | [复原 IP 地址](https://leetcode.cn/problems/restore-ip-addresses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0093.%20%E5%A4%8D%E5%8E%9F%20IP%20%E5%9C%B0%E5%9D%80.md) | 字符串、回溯 | 中等 | -| 0094 | [二叉树的中序遍历](https://leetcode.cn/problems/binary-tree-inorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0094.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E4%B8%AD%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索、二叉树 | 简单 | -| 0095 | [不同的二叉搜索树 II](https://leetcode.cn/problems/unique-binary-search-trees-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0095.%20%E4%B8%8D%E5%90%8C%E7%9A%84%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%20II.md) | 树、二叉搜索树、动态规划、回溯、二叉树 | 中等 | -| 0096 | [不同的二叉搜索树](https://leetcode.cn/problems/unique-binary-search-trees/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0096.%20%E4%B8%8D%E5%90%8C%E7%9A%84%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md) | 树、二叉搜索树、数学、动态规划、二叉树 | 中等 | -| 0098 | [验证二叉搜索树](https://leetcode.cn/problems/validate-binary-search-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0098.%20%E9%AA%8C%E8%AF%81%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | -| 0100 | [相同的树](https://leetcode.cn/problems/same-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0100.%20%E7%9B%B8%E5%90%8C%E7%9A%84%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0101 | [对称二叉树](https://leetcode.cn/problems/symmetric-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0101.%20%E5%AF%B9%E7%A7%B0%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0102 | [二叉树的层序遍历](https://leetcode.cn/problems/binary-tree-level-order-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0102.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%B1%82%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 树、广度优先搜索、二叉树 | 中等 | -| 0103 | [二叉树的锯齿形层序遍历](https://leetcode.cn/problems/binary-tree-zigzag-level-order-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0103.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%94%AF%E9%BD%BF%E5%BD%A2%E5%B1%82%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 树、广度优先搜索、二叉树 | 中等 | -| 0104 | [二叉树的最大深度](https://leetcode.cn/problems/maximum-depth-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0104.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%A4%A7%E6%B7%B1%E5%BA%A6.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0105 | [从前序与中序遍历序列构造二叉树](https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0105.%20%E4%BB%8E%E5%89%8D%E5%BA%8F%E4%B8%8E%E4%B8%AD%E5%BA%8F%E9%81%8D%E5%8E%86%E5%BA%8F%E5%88%97%E6%9E%84%E9%80%A0%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、数组、哈希表、分治、二叉树 | 中等 | -| 0106 | [从中序与后序遍历序列构造二叉树](https://leetcode.cn/problems/construct-binary-tree-from-inorder-and-postorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0106.%20%E4%BB%8E%E4%B8%AD%E5%BA%8F%E4%B8%8E%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86%E5%BA%8F%E5%88%97%E6%9E%84%E9%80%A0%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、数组、哈希表、分治、二叉树 | 中等 | -| 0107 | [二叉树的层序遍历 II](https://leetcode.cn/problems/binary-tree-level-order-traversal-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0107.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%B1%82%E5%BA%8F%E9%81%8D%E5%8E%86%20II.md) | 树、广度优先搜索、二叉树 | 中等 | -| 0108 | [将有序数组转换为二叉搜索树](https://leetcode.cn/problems/convert-sorted-array-to-binary-search-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0108.%20%E5%B0%86%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E8%BD%AC%E6%8D%A2%E4%B8%BA%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md) | 树、二叉搜索树、数组、分治、二叉树 | 简单 | -| 0110 | [平衡二叉树](https://leetcode.cn/problems/balanced-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0110.%20%E5%B9%B3%E8%A1%A1%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、二叉树 | 简单 | -| 0111 | [二叉树的最小深度](https://leetcode.cn/problems/minimum-depth-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0111.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%B0%8F%E6%B7%B1%E5%BA%A6.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0112 | [路径总和](https://leetcode.cn/problems/path-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0112.%20%E8%B7%AF%E5%BE%84%E6%80%BB%E5%92%8C.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0113 | [路径总和 II](https://leetcode.cn/problems/path-sum-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0113.%20%E8%B7%AF%E5%BE%84%E6%80%BB%E5%92%8C%20II.md) | 树、深度优先搜索、回溯、二叉树 | 中等 | -| 0115 | [不同的子序列](https://leetcode.cn/problems/distinct-subsequences/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0115.%20%E4%B8%8D%E5%90%8C%E7%9A%84%E5%AD%90%E5%BA%8F%E5%88%97.md) | 字符串、动态规划 | 困难 | -| 0116 | [填充每个节点的下一个右侧节点指针](https://leetcode.cn/problems/populating-next-right-pointers-in-each-node/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0116.%20%E5%A1%AB%E5%85%85%E6%AF%8F%E4%B8%AA%E8%8A%82%E7%82%B9%E7%9A%84%E4%B8%8B%E4%B8%80%E4%B8%AA%E5%8F%B3%E4%BE%A7%E8%8A%82%E7%82%B9%E6%8C%87%E9%92%88.md) | 树、深度优先搜索、广度优先搜索、链表、二叉树 | 中等 | -| 0117 | [填充每个节点的下一个右侧节点指针 II](https://leetcode.cn/problems/populating-next-right-pointers-in-each-node-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0117.%20%E5%A1%AB%E5%85%85%E6%AF%8F%E4%B8%AA%E8%8A%82%E7%82%B9%E7%9A%84%E4%B8%8B%E4%B8%80%E4%B8%AA%E5%8F%B3%E4%BE%A7%E8%8A%82%E7%82%B9%E6%8C%87%E9%92%88%20II.md) | 树、深度优先搜索、广度优先搜索、链表、二叉树 | 中等 | -| 0118 | [杨辉三角](https://leetcode.cn/problems/pascals-triangle/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0118.%20%E6%9D%A8%E8%BE%89%E4%B8%89%E8%A7%92.md) | 数组、动态规划 | 简单 | -| 0119 | [杨辉三角 II](https://leetcode.cn/problems/pascals-triangle-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0119.%20%E6%9D%A8%E8%BE%89%E4%B8%89%E8%A7%92%20II.md) | 数组、动态规划 | 简单 | -| 0120 | [三角形最小路径和](https://leetcode.cn/problems/triangle/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0120.%20%E4%B8%89%E8%A7%92%E5%BD%A2%E6%9C%80%E5%B0%8F%E8%B7%AF%E5%BE%84%E5%92%8C.md) | 数组、动态规划 | 中等 | -| 0121 | [买卖股票的最佳时机](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0121.%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA.md) | 数组、动态规划 | 简单 | -| 0122 | [买卖股票的最佳时机 II](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0122.%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA%20II.md) | 贪心、数组 | 中等 | -| 0123 | [买卖股票的最佳时机 III](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0123.%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA%20III.md) | 数组、动态规划 | 困难 | -| 0124 | [二叉树中的最大路径和](https://leetcode.cn/problems/binary-tree-maximum-path-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0124.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E8%B7%AF%E5%BE%84%E5%92%8C.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | -| 0125 | [验证回文串](https://leetcode.cn/problems/valid-palindrome/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0125.%20%E9%AA%8C%E8%AF%81%E5%9B%9E%E6%96%87%E4%B8%B2.md) | 双指针、字符串 | 简单 | -| 0127 | [单词接龙](https://leetcode.cn/problems/word-ladder/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0127.%20%E5%8D%95%E8%AF%8D%E6%8E%A5%E9%BE%99.md) | 广度优先搜索、哈希表、字符串 | 困难 | -| 0128 | [最长连续序列](https://leetcode.cn/problems/longest-consecutive-sequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0128.%20%E6%9C%80%E9%95%BF%E8%BF%9E%E7%BB%AD%E5%BA%8F%E5%88%97.md) | 并查集、数组、哈希表 | 中等 | -| 0129 | [求根节点到叶节点数字之和](https://leetcode.cn/problems/sum-root-to-leaf-numbers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0129.%20%E6%B1%82%E6%A0%B9%E8%8A%82%E7%82%B9%E5%88%B0%E5%8F%B6%E8%8A%82%E7%82%B9%E6%95%B0%E5%AD%97%E4%B9%8B%E5%92%8C.md) | 树、深度优先搜索、二叉树 | 中等 | -| 0130 | [被围绕的区域](https://leetcode.cn/problems/surrounded-regions/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0130.%20%E8%A2%AB%E5%9B%B4%E7%BB%95%E7%9A%84%E5%8C%BA%E5%9F%9F.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | -| 0131 | [分割回文串](https://leetcode.cn/problems/palindrome-partitioning/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0131.%20%E5%88%86%E5%89%B2%E5%9B%9E%E6%96%87%E4%B8%B2.md) | 字符串、动态规划、回溯 | 中等 | -| 0133 | [克隆图](https://leetcode.cn/problems/clone-graph/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0133.%20%E5%85%8B%E9%9A%86%E5%9B%BE.md) | 深度优先搜索、广度优先搜索、图、哈希表 | 中等 | -| 0134 | [加油站](https://leetcode.cn/problems/gas-station/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0134.%20%E5%8A%A0%E6%B2%B9%E7%AB%99.md) | 贪心、数组 | 中等 | -| 0135 | [分发糖果](https://leetcode.cn/problems/candy/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0135.%20%E5%88%86%E5%8F%91%E7%B3%96%E6%9E%9C.md) | 贪心、数组 | 困难 | -| 0136 | [只出现一次的数字](https://leetcode.cn/problems/single-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0136.%20%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B0%E5%AD%97.md) | 位运算、数组 | 简单 | -| 0137 | [只出现一次的数字 II](https://leetcode.cn/problems/single-number-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0137.%20%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B0%E5%AD%97%20II.md) | 位运算、数组 | 中等 | -| 0138 | [复制带随机指针的链表](https://leetcode.cn/problems/copy-list-with-random-pointer/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0138.%20%E5%A4%8D%E5%88%B6%E5%B8%A6%E9%9A%8F%E6%9C%BA%E6%8C%87%E9%92%88%E7%9A%84%E9%93%BE%E8%A1%A8.md) | 哈希表、链表 | 中等 | -| 0139 | [单词拆分](https://leetcode.cn/problems/word-break/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0139.%20%E5%8D%95%E8%AF%8D%E6%8B%86%E5%88%86.md) | 字典树、记忆化搜索、数组、哈希表、字符串、动态规划 | 中等 | -| 0140 | [单词拆分 II](https://leetcode.cn/problems/word-break-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0140.%20%E5%8D%95%E8%AF%8D%E6%8B%86%E5%88%86%20II.md) | 字典树、记忆化搜索、数组、哈希表、字符串、动态规划、回溯 | 困难 | -| 0141 | [环形链表](https://leetcode.cn/problems/linked-list-cycle/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0141.%20%E7%8E%AF%E5%BD%A2%E9%93%BE%E8%A1%A8.md) | 哈希表、链表、双指针 | 简单 | -| 0142 | [环形链表 II](https://leetcode.cn/problems/linked-list-cycle-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0142.%20%E7%8E%AF%E5%BD%A2%E9%93%BE%E8%A1%A8%20II.md) | 哈希表、链表、双指针 | 中等 | -| 0143 | [重排链表](https://leetcode.cn/problems/reorder-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0143.%20%E9%87%8D%E6%8E%92%E9%93%BE%E8%A1%A8.md) | 栈、递归、链表、双指针 | 中等 | -| 0144 | [二叉树的前序遍历](https://leetcode.cn/problems/binary-tree-preorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0144.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%89%8D%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索、二叉树 | 简单 | -| 0145 | [二叉树的后序遍历](https://leetcode.cn/problems/binary-tree-postorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0145.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索、二叉树 | 简单 | -| 0147 | [对链表进行插入排序](https://leetcode.cn/problems/insertion-sort-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0147.%20%E5%AF%B9%E9%93%BE%E8%A1%A8%E8%BF%9B%E8%A1%8C%E6%8F%92%E5%85%A5%E6%8E%92%E5%BA%8F.md) | 链表、排序 | 中等 | -| 0148 | [排序链表](https://leetcode.cn/problems/sort-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0148.%20%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8.md) | 链表、双指针、分治、排序、归并排序 | 中等 | -| 0149 | [直线上最多的点数](https://leetcode.cn/problems/max-points-on-a-line/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0149.%20%E7%9B%B4%E7%BA%BF%E4%B8%8A%E6%9C%80%E5%A4%9A%E7%9A%84%E7%82%B9%E6%95%B0.md) | 几何、数组、哈希表、数学 | 困难 | -| 0150 | [逆波兰表达式求值](https://leetcode.cn/problems/evaluate-reverse-polish-notation/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0150.%20%E9%80%86%E6%B3%A2%E5%85%B0%E8%A1%A8%E8%BE%BE%E5%BC%8F%E6%B1%82%E5%80%BC.md) | 栈、数组、数学 | 中等 | -| 0151 | [反转字符串中的单词](https://leetcode.cn/problems/reverse-words-in-a-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0151.%20%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%8D%95%E8%AF%8D.md) | 双指针、字符串 | 中等 | -| 0152 | [乘积最大子数组](https://leetcode.cn/problems/maximum-product-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0152.%20%E4%B9%98%E7%A7%AF%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、动态规划 | 中等 | -| 0153 | [寻找旋转排序数组中的最小值](https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0153.%20%E5%AF%BB%E6%89%BE%E6%97%8B%E8%BD%AC%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9C%80%E5%B0%8F%E5%80%BC.md) | 数组、二分查找 | 中等 | -| 0154 | [寻找旋转排序数组中的最小值 II](https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0154.%20%E5%AF%BB%E6%89%BE%E6%97%8B%E8%BD%AC%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9C%80%E5%B0%8F%E5%80%BC%20II.md) | 数组、二分查找 | 困难 | -| 0155 | [最小栈](https://leetcode.cn/problems/min-stack/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0155.%20%E6%9C%80%E5%B0%8F%E6%A0%88.md) | 栈、设计 | 中等 | -| 0159 | [至多包含两个不同字符的最长子串](https://leetcode.cn/problems/longest-substring-with-at-most-two-distinct-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0159.%20%E8%87%B3%E5%A4%9A%E5%8C%85%E5%90%AB%E4%B8%A4%E4%B8%AA%E4%B8%8D%E5%90%8C%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2.md) | 哈希表、字符串、滑动窗口 | 中等 | -| 0160 | [相交链表](https://leetcode.cn/problems/intersection-of-two-linked-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0160.%20%E7%9B%B8%E4%BA%A4%E9%93%BE%E8%A1%A8.md) | 哈希表、链表、双指针 | 简单 | -| 0162 | [寻找峰值](https://leetcode.cn/problems/find-peak-element/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0162.%20%E5%AF%BB%E6%89%BE%E5%B3%B0%E5%80%BC.md) | 数组、二分查找 | 中等 | -| 0164 | [最大间距](https://leetcode.cn/problems/maximum-gap/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0164.%20%E6%9C%80%E5%A4%A7%E9%97%B4%E8%B7%9D.md) | 数组、桶排序、基数排序、排序 | 困难 | -| 0166 | [分数到小数](https://leetcode.cn/problems/fraction-to-recurring-decimal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0166.%20%E5%88%86%E6%95%B0%E5%88%B0%E5%B0%8F%E6%95%B0.md) | 哈希表、数学、字符串 | 中等 | -| 0167 | [两数之和 II - 输入有序数组](https://leetcode.cn/problems/two-sum-ii-input-array-is-sorted/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0167.%20%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C%20II%20-%20%E8%BE%93%E5%85%A5%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、双指针、二分查找 | 中等 | -| 0168 | [Excel表列名称](https://leetcode.cn/problems/excel-sheet-column-title/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0168.%20Excel%E8%A1%A8%E5%88%97%E5%90%8D%E7%A7%B0.md) | 数学、字符串 | 简单 | -| 0169 | [多数元素](https://leetcode.cn/problems/majority-element/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0169.%20%E5%A4%9A%E6%95%B0%E5%85%83%E7%B4%A0.md) | 数组、哈希表、分治、计数、排序 | 简单 | -| 0170 | [两数之和 III - 数据结构设计](https://leetcode.cn/problems/two-sum-iii-data-structure-design/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0170.%20%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C%20III%20-%20%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E8%AE%BE%E8%AE%A1.md) | 设计、数组、哈希表、双指针、数据流 | 简单 | -| 0171 | [Excel 表列序号](https://leetcode.cn/problems/excel-sheet-column-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0171.%20Excel%20%E8%A1%A8%E5%88%97%E5%BA%8F%E5%8F%B7.md) | 数学、字符串 | 简单 | -| 0172 | [阶乘后的零](https://leetcode.cn/problems/factorial-trailing-zeroes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0172.%20%E9%98%B6%E4%B9%98%E5%90%8E%E7%9A%84%E9%9B%B6.md) | 数学 | 中等 | -| 0173 | [二叉搜索树迭代器](https://leetcode.cn/problems/binary-search-tree-iterator/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0173.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E8%BF%AD%E4%BB%A3%E5%99%A8.md) | 栈、树、设计、二叉搜索树、二叉树、迭代器 | 中等 | -| 0179 | [最大数](https://leetcode.cn/problems/largest-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0179.%20%E6%9C%80%E5%A4%A7%E6%95%B0.md) | 贪心、数组、字符串、排序 | 中等 | -| 0188 | [买卖股票的最佳时机 IV](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-iv/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0188.%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA%20IV.md) | 数组、动态规划 | 困难 | -| 0189 | [轮转数组](https://leetcode.cn/problems/rotate-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0189.%20%E8%BD%AE%E8%BD%AC%E6%95%B0%E7%BB%84.md) | 数组、数学、双指针 | 中等 | -| 0190 | [颠倒二进制位](https://leetcode.cn/problems/reverse-bits/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0190.%20%E9%A2%A0%E5%80%92%E4%BA%8C%E8%BF%9B%E5%88%B6%E4%BD%8D.md) | 位运算、分治 | 简单 | -| 0191 | [位1的个数](https://leetcode.cn/problems/number-of-1-bits/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0191.%20%E4%BD%8D1%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 位运算、分治 | 简单 | -| 0198 | [打家劫舍](https://leetcode.cn/problems/house-robber/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0198.%20%E6%89%93%E5%AE%B6%E5%8A%AB%E8%88%8D.md) | 数组、动态规划 | 中等 | -| 0199 | [二叉树的右视图](https://leetcode.cn/problems/binary-tree-right-side-view/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0199.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%8F%B3%E8%A7%86%E5%9B%BE.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | -| 0200 | [岛屿数量](https://leetcode.cn/problems/number-of-islands/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0200.%20%E5%B2%9B%E5%B1%BF%E6%95%B0%E9%87%8F.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | -| 0201 | [数字范围按位与](https://leetcode.cn/problems/bitwise-and-of-numbers-range/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0201.%20%E6%95%B0%E5%AD%97%E8%8C%83%E5%9B%B4%E6%8C%89%E4%BD%8D%E4%B8%8E.md) | 位运算 | 中等 | -| 0202 | [快乐数](https://leetcode.cn/problems/happy-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0202.%20%E5%BF%AB%E4%B9%90%E6%95%B0.md) | 哈希表、数学、双指针 | 简单 | -| 0203 | [移除链表元素](https://leetcode.cn/problems/remove-linked-list-elements/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0203.%20%E7%A7%BB%E9%99%A4%E9%93%BE%E8%A1%A8%E5%85%83%E7%B4%A0.md) | 递归、链表 | 简单 | -| 0204 | [计数质数](https://leetcode.cn/problems/count-primes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0204.%20%E8%AE%A1%E6%95%B0%E8%B4%A8%E6%95%B0.md) | 数组、数学、枚举、数论 | 中等 | -| 0205 | [同构字符串](https://leetcode.cn/problems/isomorphic-strings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0205.%20%E5%90%8C%E6%9E%84%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 哈希表、字符串 | 简单 | -| 0206 | [反转链表](https://leetcode.cn/problems/reverse-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0206.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8.md) | 递归、链表 | 简单 | -| 0207 | [课程表](https://leetcode.cn/problems/course-schedule/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0207.%20%E8%AF%BE%E7%A8%8B%E8%A1%A8.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | -| 0208 | [实现 Trie (前缀树)](https://leetcode.cn/problems/implement-trie-prefix-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0208.%20%E5%AE%9E%E7%8E%B0%20Trie%20%28%E5%89%8D%E7%BC%80%E6%A0%91%29.md) | 设计、字典树、哈希表、字符串 | 中等 | -| 0209 | [长度最小的子数组](https://leetcode.cn/problems/minimum-size-subarray-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0209.%20%E9%95%BF%E5%BA%A6%E6%9C%80%E5%B0%8F%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、二分查找、前缀和、滑动窗口 | 中等 | -| 0210 | [课程表 II](https://leetcode.cn/problems/course-schedule-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0210.%20%E8%AF%BE%E7%A8%8B%E8%A1%A8%20II.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | -| 0211 | [添加与搜索单词 - 数据结构设计](https://leetcode.cn/problems/design-add-and-search-words-data-structure/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0211.%20%E6%B7%BB%E5%8A%A0%E4%B8%8E%E6%90%9C%E7%B4%A2%E5%8D%95%E8%AF%8D%20-%20%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E8%AE%BE%E8%AE%A1.md) | 深度优先搜索、设计、字典树、字符串 | 中等 | -| 0212 | [单词搜索 II](https://leetcode.cn/problems/word-search-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0212.%20%E5%8D%95%E8%AF%8D%E6%90%9C%E7%B4%A2%20II.md) | 字典树、数组、字符串、回溯、矩阵 | 困难 | -| 0213 | [打家劫舍 II](https://leetcode.cn/problems/house-robber-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0213.%20%E6%89%93%E5%AE%B6%E5%8A%AB%E8%88%8D%20II.md) | 数组、动态规划 | 中等 | -| 0215 | [数组中的第K个最大元素](https://leetcode.cn/problems/kth-largest-element-in-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0215.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E7%AC%ACK%E4%B8%AA%E6%9C%80%E5%A4%A7%E5%85%83%E7%B4%A0.md) | 数组、分治、快速选择、排序、堆（优先队列） | 中等 | -| 0217 | [存在重复元素](https://leetcode.cn/problems/contains-duplicate/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0217.%20%E5%AD%98%E5%9C%A8%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0.md) | 数组、哈希表、排序 | 简单 | -| 0218 | [天际线问题](https://leetcode.cn/problems/the-skyline-problem/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0218.%20%E5%A4%A9%E9%99%85%E7%BA%BF%E9%97%AE%E9%A2%98.md) | 树状数组、线段树、数组、分治、有序集合、扫描线、堆（优先队列） | 困难 | -| 0219 | [存在重复元素 II](https://leetcode.cn/problems/contains-duplicate-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0219.%20%E5%AD%98%E5%9C%A8%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0%20II.md) | 数组、哈希表、滑动窗口 | 简单 | -| 0220 | [存在重复元素 III](https://leetcode.cn/problems/contains-duplicate-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0220.%20%E5%AD%98%E5%9C%A8%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0%20III.md) | 数组、桶排序、有序集合、排序、滑动窗口 | 困难 | -| 0221 | [最大正方形](https://leetcode.cn/problems/maximal-square/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0221.%20%E6%9C%80%E5%A4%A7%E6%AD%A3%E6%96%B9%E5%BD%A2.md) | 数组、动态规划、矩阵 | 中等 | -| 0222 | [完全二叉树的节点个数](https://leetcode.cn/problems/count-complete-tree-nodes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0222.%20%E5%AE%8C%E5%85%A8%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E8%8A%82%E7%82%B9%E4%B8%AA%E6%95%B0.md) | 树、深度优先搜索、二分查找、二叉树 | 中等 | -| 0223 | [矩形面积](https://leetcode.cn/problems/rectangle-area/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0223.%20%E7%9F%A9%E5%BD%A2%E9%9D%A2%E7%A7%AF.md) | 几何、数学 | 中等 | -| 0225 | [用队列实现栈](https://leetcode.cn/problems/implement-stack-using-queues/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0225.%20%E7%94%A8%E9%98%9F%E5%88%97%E5%AE%9E%E7%8E%B0%E6%A0%88.md) | 栈、设计、队列 | 简单 | -| 0226 | [翻转二叉树](https://leetcode.cn/problems/invert-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0226.%20%E7%BF%BB%E8%BD%AC%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0227 | [基本计算器 II](https://leetcode.cn/problems/basic-calculator-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0227.%20%E5%9F%BA%E6%9C%AC%E8%AE%A1%E7%AE%97%E5%99%A8%20II.md) | 栈、数学、字符串 | 中等 | -| 0231 | [2 的幂](https://leetcode.cn/problems/power-of-two/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0231.%202%20%E7%9A%84%E5%B9%82.md) | 位运算、递归、数学 | 简单 | -| 0232 | [用栈实现队列](https://leetcode.cn/problems/implement-queue-using-stacks/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0232.%20%E7%94%A8%E6%A0%88%E5%AE%9E%E7%8E%B0%E9%98%9F%E5%88%97.md) | 栈、设计、队列 | 简单 | -| 0233 | [数字 1 的个数](https://leetcode.cn/problems/number-of-digit-one/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0233.%20%E6%95%B0%E5%AD%97%201%20%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 递归、数学、动态规划 | 困难 | -| 0234 | [回文链表](https://leetcode.cn/problems/palindrome-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0234.%20%E5%9B%9E%E6%96%87%E9%93%BE%E8%A1%A8.md) | 栈、递归、链表、双指针 | 简单 | -| 0235 | [二叉搜索树的最近公共祖先](https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-search-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0235.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | -| 0236 | [二叉树的最近公共祖先](https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0236.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88.md) | 树、深度优先搜索、二叉树 | 中等 | -| 0237 | [删除链表中的节点](https://leetcode.cn/problems/delete-node-in-a-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0237.%20%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E8%8A%82%E7%82%B9.md) | 链表 | 中等 | -| 0238 | [除自身以外数组的乘积](https://leetcode.cn/problems/product-of-array-except-self/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0238.%20%E9%99%A4%E8%87%AA%E8%BA%AB%E4%BB%A5%E5%A4%96%E6%95%B0%E7%BB%84%E7%9A%84%E4%B9%98%E7%A7%AF.md) | 数组、前缀和 | 中等 | -| 0239 | [滑动窗口最大值](https://leetcode.cn/problems/sliding-window-maximum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0239.%20%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E6%9C%80%E5%A4%A7%E5%80%BC.md) | 队列、数组、滑动窗口、单调队列、堆（优先队列） | 困难 | -| 0240 | [搜索二维矩阵 II](https://leetcode.cn/problems/search-a-2d-matrix-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0240.%20%E6%90%9C%E7%B4%A2%E4%BA%8C%E7%BB%B4%E7%9F%A9%E9%98%B5%20II.md) | 数组、二分查找、分治、矩阵 | 中等 | -| 0241 | [为运算表达式设计优先级](https://leetcode.cn/problems/different-ways-to-add-parentheses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0241.%20%E4%B8%BA%E8%BF%90%E7%AE%97%E8%A1%A8%E8%BE%BE%E5%BC%8F%E8%AE%BE%E8%AE%A1%E4%BC%98%E5%85%88%E7%BA%A7.md) | 递归、记忆化搜索、数学、字符串、动态规划 | 中等 | -| 0242 | [有效的字母异位词](https://leetcode.cn/problems/valid-anagram/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0242.%20%E6%9C%89%E6%95%88%E7%9A%84%E5%AD%97%E6%AF%8D%E5%BC%82%E4%BD%8D%E8%AF%8D.md) | 哈希表、字符串、排序 | 简单 | -| 0249 | [移位字符串分组](https://leetcode.cn/problems/group-shifted-strings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0249.%20%E7%A7%BB%E4%BD%8D%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%88%86%E7%BB%84.md) | 数组、哈希表、字符串 | 中等 | -| 0257 | [二叉树的所有路径](https://leetcode.cn/problems/binary-tree-paths/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0257.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%89%80%E6%9C%89%E8%B7%AF%E5%BE%84.md) | 树、深度优先搜索、字符串、回溯、二叉树 | 简单 | -| 0258 | [各位相加](https://leetcode.cn/problems/add-digits/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0258.%20%E5%90%84%E4%BD%8D%E7%9B%B8%E5%8A%A0.md) | 数学、数论、模拟 | 简单 | -| 0259 | [较小的三数之和](https://leetcode.cn/problems/3sum-smaller/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0259.%20%E8%BE%83%E5%B0%8F%E7%9A%84%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、双指针、二分查找、排序 | 中等 | -| 0260 | [只出现一次的数字 III](https://leetcode.cn/problems/single-number-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0260.%20%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B0%E5%AD%97%20III.md) | 位运算、数组 | 中等 | -| 0263 | [丑数](https://leetcode.cn/problems/ugly-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0263.%20%E4%B8%91%E6%95%B0.md) | 数学 | 简单 | -| 0264 | [丑数 II](https://leetcode.cn/problems/ugly-number-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0264.%20%E4%B8%91%E6%95%B0%20II.md) | 哈希表、数学、动态规划、堆（优先队列） | 中等 | -| 0268 | [丢失的数字](https://leetcode.cn/problems/missing-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0268.%20%E4%B8%A2%E5%A4%B1%E7%9A%84%E6%95%B0%E5%AD%97.md) | 位运算、数组、哈希表、数学、二分查找、排序 | 简单 | -| 0270 | [最接近的二叉搜索树值](https://leetcode.cn/problems/closest-binary-search-tree-value/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0270.%20%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9A%84%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E5%80%BC.md) | 树、深度优先搜索、二叉搜索树、二分查找、二叉树 | 简单 | -| 0278 | [第一个错误的版本](https://leetcode.cn/problems/first-bad-version/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0278.%20%E7%AC%AC%E4%B8%80%E4%B8%AA%E9%94%99%E8%AF%AF%E7%9A%84%E7%89%88%E6%9C%AC.md) | 二分查找、交互 | 简单 | -| 0279 | [完全平方数](https://leetcode.cn/problems/perfect-squares/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0279.%20%E5%AE%8C%E5%85%A8%E5%B9%B3%E6%96%B9%E6%95%B0.md) | 广度优先搜索、数学、动态规划 | 中等 | -| 0283 | [移动零](https://leetcode.cn/problems/move-zeroes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0283.%20%E7%A7%BB%E5%8A%A8%E9%9B%B6.md) | 数组、双指针 | 简单 | -| 0285 | [二叉搜索树中的中序后继](https://leetcode.cn/problems/inorder-successor-in-bst/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0285.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E4%B8%AD%E5%BA%8F%E5%90%8E%E7%BB%A7.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | -| 0286 | [墙与门](https://leetcode.cn/problems/walls-and-gates/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0286.%20%E5%A2%99%E4%B8%8E%E9%97%A8.md) | 广度优先搜索、数组、矩阵 | 中等 | -| 0287 | [寻找重复数](https://leetcode.cn/problems/find-the-duplicate-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0287.%20%E5%AF%BB%E6%89%BE%E9%87%8D%E5%A4%8D%E6%95%B0.md) | 位运算、数组、双指针、二分查找 | 中等 | -| 0288 | [单词的唯一缩写](https://leetcode.cn/problems/unique-word-abbreviation/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0288.%20%E5%8D%95%E8%AF%8D%E7%9A%84%E5%94%AF%E4%B8%80%E7%BC%A9%E5%86%99.md) | 设计、数组、哈希表、字符串 | 中等 | -| 0289 | [生命游戏](https://leetcode.cn/problems/game-of-life/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0289.%20%E7%94%9F%E5%91%BD%E6%B8%B8%E6%88%8F.md) | 数组、矩阵、模拟 | 中等 | -| 0290 | [单词规律](https://leetcode.cn/problems/word-pattern/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0290.%20%E5%8D%95%E8%AF%8D%E8%A7%84%E5%BE%8B.md) | 哈希表、字符串 | 简单 | -| 0292 | [Nim 游戏](https://leetcode.cn/problems/nim-game/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0292.%20Nim%20%E6%B8%B8%E6%88%8F.md) | 脑筋急转弯、数学、博弈 | 简单 | -| 0295 | [数据流的中位数](https://leetcode.cn/problems/find-median-from-data-stream/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0295.%20%E6%95%B0%E6%8D%AE%E6%B5%81%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0.md) | 设计、双指针、数据流、排序、堆（优先队列） | 困难 | -| 0297 | [二叉树的序列化与反序列化](https://leetcode.cn/problems/serialize-and-deserialize-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0297.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%BA%8F%E5%88%97%E5%8C%96%E4%B8%8E%E5%8F%8D%E5%BA%8F%E5%88%97%E5%8C%96.md) | 树、深度优先搜索、广度优先搜索、设计、字符串、二叉树 | 困难 | -| 0300 | [最长递增子序列](https://leetcode.cn/problems/longest-increasing-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0300.%20%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E5%AD%90%E5%BA%8F%E5%88%97.md) | 数组、二分查找、动态规划 | 中等 | -| 0303 | [区域和检索 - 数组不可变](https://leetcode.cn/problems/range-sum-query-immutable/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0303.%20%E5%8C%BA%E5%9F%9F%E5%92%8C%E6%A3%80%E7%B4%A2%20-%20%E6%95%B0%E7%BB%84%E4%B8%8D%E5%8F%AF%E5%8F%98.md) | 设计、数组、前缀和 | 简单 | -| 0304 | [二维区域和检索 - 矩阵不可变](https://leetcode.cn/problems/range-sum-query-2d-immutable/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0304.%20%E4%BA%8C%E7%BB%B4%E5%8C%BA%E5%9F%9F%E5%92%8C%E6%A3%80%E7%B4%A2%20-%20%E7%9F%A9%E9%98%B5%E4%B8%8D%E5%8F%AF%E5%8F%98.md) | 设计、数组、矩阵、前缀和 | 中等 | -| 0307 | [区域和检索 - 数组可修改](https://leetcode.cn/problems/range-sum-query-mutable/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0307.%20%E5%8C%BA%E5%9F%9F%E5%92%8C%E6%A3%80%E7%B4%A2%20-%20%E6%95%B0%E7%BB%84%E5%8F%AF%E4%BF%AE%E6%94%B9.md) | 设计、树状数组、线段树、数组 | 中等 | -| 0309 | [最佳买卖股票时机含冷冻期](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-cooldown/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0309.%20%E6%9C%80%E4%BD%B3%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E6%97%B6%E6%9C%BA%E5%90%AB%E5%86%B7%E5%86%BB%E6%9C%9F.md) | 数组、动态规划 | 中等 | -| 0310 | [最小高度树](https://leetcode.cn/problems/minimum-height-trees/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0310.%20%E6%9C%80%E5%B0%8F%E9%AB%98%E5%BA%A6%E6%A0%91.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | -| 0312 | [戳气球](https://leetcode.cn/problems/burst-balloons/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0312.%20%E6%88%B3%E6%B0%94%E7%90%83.md) | 数组、动态规划 | 困难 | -| 0315 | [计算右侧小于当前元素的个数](https://leetcode.cn/problems/count-of-smaller-numbers-after-self/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0315.%20%E8%AE%A1%E7%AE%97%E5%8F%B3%E4%BE%A7%E5%B0%8F%E4%BA%8E%E5%BD%93%E5%89%8D%E5%85%83%E7%B4%A0%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 树状数组、线段树、数组、二分查找、分治、有序集合、归并排序 | 困难 | -| 0316 | [去除重复字母](https://leetcode.cn/problems/remove-duplicate-letters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0316.%20%E5%8E%BB%E9%99%A4%E9%87%8D%E5%A4%8D%E5%AD%97%E6%AF%8D.md) | 栈、贪心、字符串、单调栈 | 中等 | -| 0318 | [最大单词长度乘积](https://leetcode.cn/problems/maximum-product-of-word-lengths/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0318.%20%E6%9C%80%E5%A4%A7%E5%8D%95%E8%AF%8D%E9%95%BF%E5%BA%A6%E4%B9%98%E7%A7%AF.md) | 位运算、数组、字符串 | 中等 | -| 0322 | [零钱兑换](https://leetcode.cn/problems/coin-change/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0322.%20%E9%9B%B6%E9%92%B1%E5%85%91%E6%8D%A2.md) | 广度优先搜索、数组、动态规划 | 中等 | -| 0323 | [无向图中连通分量的数目](https://leetcode.cn/problems/number-of-connected-components-in-an-undirected-graph/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0323.%20%E6%97%A0%E5%90%91%E5%9B%BE%E4%B8%AD%E8%BF%9E%E9%80%9A%E5%88%86%E9%87%8F%E7%9A%84%E6%95%B0%E7%9B%AE.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 0324 | [摆动排序 II](https://leetcode.cn/problems/wiggle-sort-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0324.%20%E6%91%86%E5%8A%A8%E6%8E%92%E5%BA%8F%20II.md) | 数组、分治、快速选择、排序 | 中等 | -| 0326 | [3 的幂](https://leetcode.cn/problems/power-of-three/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0326.%203%20%E7%9A%84%E5%B9%82.md) | 递归、数学 | 简单 | -| 0328 | [奇偶链表](https://leetcode.cn/problems/odd-even-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0328.%20%E5%A5%87%E5%81%B6%E9%93%BE%E8%A1%A8.md) | 链表 | 中等 | -| 0329 | [矩阵中的最长递增路径](https://leetcode.cn/problems/longest-increasing-path-in-a-matrix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0329.%20%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E8%B7%AF%E5%BE%84.md) | 深度优先搜索、广度优先搜索、图、拓扑排序、记忆化搜索、数组、动态规划、矩阵 | 困难 | -| 0334 | [递增的三元子序列](https://leetcode.cn/problems/increasing-triplet-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0334.%20%E9%80%92%E5%A2%9E%E7%9A%84%E4%B8%89%E5%85%83%E5%AD%90%E5%BA%8F%E5%88%97.md) | 贪心、数组 | 中等 | -| 0336 | [回文对](https://leetcode.cn/problems/palindrome-pairs/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0336.%20%E5%9B%9E%E6%96%87%E5%AF%B9.md) | 字典树、数组、哈希表、字符串 | 困难 | -| 0337 | [打家劫舍 III](https://leetcode.cn/problems/house-robber-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0337.%20%E6%89%93%E5%AE%B6%E5%8A%AB%E8%88%8D%20III.md) | 树、深度优先搜索、动态规划、二叉树 | 中等 | -| 0338 | [比特位计数](https://leetcode.cn/problems/counting-bits/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0338.%20%E6%AF%94%E7%89%B9%E4%BD%8D%E8%AE%A1%E6%95%B0.md) | 位运算、动态规划 | 简单 | -| 0340 | [至多包含 K 个不同字符的最长子串](https://leetcode.cn/problems/longest-substring-with-at-most-k-distinct-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0340.%20%E8%87%B3%E5%A4%9A%E5%8C%85%E5%90%AB%20K%20%E4%B8%AA%E4%B8%8D%E5%90%8C%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2.md) | 哈希表、字符串、滑动窗口 | 中等 | -| 0341 | [扁平化嵌套列表迭代器](https://leetcode.cn/problems/flatten-nested-list-iterator/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0341.%20%E6%89%81%E5%B9%B3%E5%8C%96%E5%B5%8C%E5%A5%97%E5%88%97%E8%A1%A8%E8%BF%AD%E4%BB%A3%E5%99%A8.md) | 栈、树、深度优先搜索、设计、队列、迭代器 | 中等 | -| 0342 | [4的幂](https://leetcode.cn/problems/power-of-four/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0342.%204%E7%9A%84%E5%B9%82.md) | 位运算、递归、数学 | 简单 | -| 0343 | [整数拆分](https://leetcode.cn/problems/integer-break/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0343.%20%E6%95%B4%E6%95%B0%E6%8B%86%E5%88%86.md) | 数学、动态规划 | 中等 | -| 0344 | [反转字符串](https://leetcode.cn/problems/reverse-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0344.%20%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 双指针、字符串 | 简单 | -| 0345 | [反转字符串中的元音字母](https://leetcode.cn/problems/reverse-vowels-of-a-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0345.%20%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%85%83%E9%9F%B3%E5%AD%97%E6%AF%8D.md) | 双指针、字符串 | 简单 | -| 0346 | [数据流中的移动平均值](https://leetcode.cn/problems/moving-average-from-data-stream/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0346.%20%E6%95%B0%E6%8D%AE%E6%B5%81%E4%B8%AD%E7%9A%84%E7%A7%BB%E5%8A%A8%E5%B9%B3%E5%9D%87%E5%80%BC.md) | 设计、队列、数组、数据流 | 简单 | -| 0347 | [前 K 个高频元素](https://leetcode.cn/problems/top-k-frequent-elements/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0347.%20%E5%89%8D%20K%20%E4%B8%AA%E9%AB%98%E9%A2%91%E5%85%83%E7%B4%A0.md) | 数组、哈希表、分治、桶排序、计数、快速选择、排序、堆（优先队列） | 中等 | -| 0349 | [两个数组的交集](https://leetcode.cn/problems/intersection-of-two-arrays/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0349.%20%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E7%9A%84%E4%BA%A4%E9%9B%86.md) | 数组、哈希表、双指针、二分查找、排序 | 简单 | -| 0350 | [两个数组的交集 II](https://leetcode.cn/problems/intersection-of-two-arrays-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0350.%20%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E7%9A%84%E4%BA%A4%E9%9B%86%20II.md) | 数组、哈希表、双指针、二分查找、排序 | 简单 | -| 0351 | [安卓系统手势解锁](https://leetcode.cn/problems/android-unlock-patterns/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0351.%20%E5%AE%89%E5%8D%93%E7%B3%BB%E7%BB%9F%E6%89%8B%E5%8A%BF%E8%A7%A3%E9%94%81.md) | 动态规划、回溯 | 中等 | -| 0354 | [俄罗斯套娃信封问题](https://leetcode.cn/problems/russian-doll-envelopes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0354.%20%E4%BF%84%E7%BD%97%E6%96%AF%E5%A5%97%E5%A8%83%E4%BF%A1%E5%B0%81%E9%97%AE%E9%A2%98.md) | 数组、二分查找、动态规划、排序 | 困难 | -| 0357 | [统计各位数字都不同的数字个数](https://leetcode.cn/problems/count-numbers-with-unique-digits/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0357.%20%E7%BB%9F%E8%AE%A1%E5%90%84%E4%BD%8D%E6%95%B0%E5%AD%97%E9%83%BD%E4%B8%8D%E5%90%8C%E7%9A%84%E6%95%B0%E5%AD%97%E4%B8%AA%E6%95%B0.md) | 数学、动态规划、回溯 | 中等 | -| 0359 | [日志速率限制器](https://leetcode.cn/problems/logger-rate-limiter/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0359.%20%E6%97%A5%E5%BF%97%E9%80%9F%E7%8E%87%E9%99%90%E5%88%B6%E5%99%A8.md) | 设计、哈希表 | 简单 | -| 0360 | [有序转化数组](https://leetcode.cn/problems/sort-transformed-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0360.%20%E6%9C%89%E5%BA%8F%E8%BD%AC%E5%8C%96%E6%95%B0%E7%BB%84.md) | 数组、数学、双指针、排序 | 中等 | -| 0367 | [有效的完全平方数](https://leetcode.cn/problems/valid-perfect-square/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0367.%20%E6%9C%89%E6%95%88%E7%9A%84%E5%AE%8C%E5%85%A8%E5%B9%B3%E6%96%B9%E6%95%B0.md) | 数学、二分查找 | 简单 | -| 0370 | [区间加法](https://leetcode.cn/problems/range-addition/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0370.%20%E5%8C%BA%E9%97%B4%E5%8A%A0%E6%B3%95.md) | 数组、前缀和 | 中等 | -| 0371 | [两整数之和](https://leetcode.cn/problems/sum-of-two-integers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0371.%20%E4%B8%A4%E6%95%B4%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 位运算、数学 | 中等 | -| 0374 | [猜数字大小](https://leetcode.cn/problems/guess-number-higher-or-lower/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0374.%20%E7%8C%9C%E6%95%B0%E5%AD%97%E5%A4%A7%E5%B0%8F.md) | 二分查找、交互 | 简单 | -| 0375 | [猜数字大小 II](https://leetcode.cn/problems/guess-number-higher-or-lower-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0375.%20%E7%8C%9C%E6%95%B0%E5%AD%97%E5%A4%A7%E5%B0%8F%20II.md) | 数学、动态规划、博弈 | 中等 | -| 0376 | [摆动序列](https://leetcode.cn/problems/wiggle-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0376.%20%E6%91%86%E5%8A%A8%E5%BA%8F%E5%88%97.md) | 贪心、数组、动态规划 | 中等 | -| 0377 | [组合总和 Ⅳ](https://leetcode.cn/problems/combination-sum-iv/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0377.%20%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8C%20%E2%85%A3.md) | 数组、动态规划 | 中等 | -| 0378 | [有序矩阵中第 K 小的元素](https://leetcode.cn/problems/kth-smallest-element-in-a-sorted-matrix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0378.%20%E6%9C%89%E5%BA%8F%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%AC%AC%20K%20%E5%B0%8F%E7%9A%84%E5%85%83%E7%B4%A0.md) | 数组、二分查找、矩阵、排序、堆（优先队列） | 中等 | -| 0380 | [O(1) 时间插入、删除和获取随机元素](https://leetcode.cn/problems/insert-delete-getrandom-o1/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0380.%20O%281%29%20%E6%97%B6%E9%97%B4%E6%8F%92%E5%85%A5%E3%80%81%E5%88%A0%E9%99%A4%E5%92%8C%E8%8E%B7%E5%8F%96%E9%9A%8F%E6%9C%BA%E5%85%83%E7%B4%A0.md) | 设计、数组、哈希表、数学、随机化 | 中等 | -| 0383 | [赎金信](https://leetcode.cn/problems/ransom-note/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0383.%20%E8%B5%8E%E9%87%91%E4%BF%A1.md) | 哈希表、字符串、计数 | 简单 | -| 0384 | [打乱数组](https://leetcode.cn/problems/shuffle-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0384.%20%E6%89%93%E4%B9%B1%E6%95%B0%E7%BB%84.md) | 数组、数学、随机化 | 中等 | -| 0386 | [字典序排数](https://leetcode.cn/problems/lexicographical-numbers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0386.%20%E5%AD%97%E5%85%B8%E5%BA%8F%E6%8E%92%E6%95%B0.md) | 深度优先搜索、字典树 | 中等 | -| 0387 | [字符串中的第一个唯一字符](https://leetcode.cn/problems/first-unique-character-in-a-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0387.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%94%AF%E4%B8%80%E5%AD%97%E7%AC%A6.md) | 队列、哈希表、字符串、计数 | 简单 | -| 0389 | [找不同](https://leetcode.cn/problems/find-the-difference/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0389.%20%E6%89%BE%E4%B8%8D%E5%90%8C.md) | 位运算、哈希表、字符串、排序 | 简单 | -| 0391 | [完美矩形](https://leetcode.cn/problems/perfect-rectangle/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0391.%20%E5%AE%8C%E7%BE%8E%E7%9F%A9%E5%BD%A2.md) | 数组、扫描线 | 困难 | -| 0392 | [判断子序列](https://leetcode.cn/problems/is-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0392.%20%E5%88%A4%E6%96%AD%E5%AD%90%E5%BA%8F%E5%88%97.md) | 双指针、字符串、动态规划 | 简单 | -| 0394 | [字符串解码](https://leetcode.cn/problems/decode-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0394.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%A7%A3%E7%A0%81.md) | 栈、递归、字符串 | 中等 | -| 0395 | [至少有 K 个重复字符的最长子串](https://leetcode.cn/problems/longest-substring-with-at-least-k-repeating-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0395.%20%E8%87%B3%E5%B0%91%E6%9C%89%20K%20%E4%B8%AA%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2.md) | 哈希表、字符串、分治、滑动窗口 | 中等 | -| 0399 | [除法求值](https://leetcode.cn/problems/evaluate-division/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0399.%20%E9%99%A4%E6%B3%95%E6%B1%82%E5%80%BC.md) | 深度优先搜索、广度优先搜索、并查集、图、数组、最短路 | 中等 | -| 0400 | [第 N 位数字](https://leetcode.cn/problems/nth-digit/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0400.%20%E7%AC%AC%20N%20%E4%BD%8D%E6%95%B0%E5%AD%97.md) | 数学、二分查找 | 中等 | -| 0403 | [青蛙过河](https://leetcode.cn/problems/frog-jump/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0403.%20%E9%9D%92%E8%9B%99%E8%BF%87%E6%B2%B3.md) | 数组、动态规划 | 困难 | -| 0404 | [左叶子之和](https://leetcode.cn/problems/sum-of-left-leaves/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0404.%20%E5%B7%A6%E5%8F%B6%E5%AD%90%E4%B9%8B%E5%92%8C.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0405 | [数字转换为十六进制数](https://leetcode.cn/problems/convert-a-number-to-hexadecimal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0405.%20%E6%95%B0%E5%AD%97%E8%BD%AC%E6%8D%A2%E4%B8%BA%E5%8D%81%E5%85%AD%E8%BF%9B%E5%88%B6%E6%95%B0.md) | 位运算、数学 | 简单 | -| 0406 | [根据身高重建队列](https://leetcode.cn/problems/queue-reconstruction-by-height/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0406.%20%E6%A0%B9%E6%8D%AE%E8%BA%AB%E9%AB%98%E9%87%8D%E5%BB%BA%E9%98%9F%E5%88%97.md) | 贪心、树状数组、线段树、数组、排序 | 中等 | -| 0409 | [最长回文串](https://leetcode.cn/problems/longest-palindrome/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0409.%20%E6%9C%80%E9%95%BF%E5%9B%9E%E6%96%87%E4%B8%B2.md) | 贪心、哈希表、字符串 | 简单 | -| 0410 | [分割数组的最大值](https://leetcode.cn/problems/split-array-largest-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0410.%20%E5%88%86%E5%89%B2%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md) | 贪心、数组、二分查找、动态规划、前缀和 | 困难 | -| 0412 | [Fizz Buzz](https://leetcode.cn/problems/fizz-buzz/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0412.%20Fizz%20Buzz.md) | 数学、字符串、模拟 | 简单 | -| 0415 | [字符串相加](https://leetcode.cn/problems/add-strings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0415.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E5%8A%A0.md) | 数学、字符串、模拟 | 简单 | -| 0416 | [分割等和子集](https://leetcode.cn/problems/partition-equal-subset-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0416.%20%E5%88%86%E5%89%B2%E7%AD%89%E5%92%8C%E5%AD%90%E9%9B%86.md) | 数组、动态规划 | 中等 | -| 0417 | [太平洋大西洋水流问题](https://leetcode.cn/problems/pacific-atlantic-water-flow/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0417.%20%E5%A4%AA%E5%B9%B3%E6%B4%8B%E5%A4%A7%E8%A5%BF%E6%B4%8B%E6%B0%B4%E6%B5%81%E9%97%AE%E9%A2%98.md) | 深度优先搜索、广度优先搜索、数组、矩阵 | 中等 | -| 0421 | [数组中两个数的最大异或值](https://leetcode.cn/problems/maximum-xor-of-two-numbers-in-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0421.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%9A%84%E6%9C%80%E5%A4%A7%E5%BC%82%E6%88%96%E5%80%BC.md) | 位运算、字典树、数组、哈希表 | 中等 | -| 0424 | [替换后的最长重复字符](https://leetcode.cn/problems/longest-repeating-character-replacement/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0424.%20%E6%9B%BF%E6%8D%A2%E5%90%8E%E7%9A%84%E6%9C%80%E9%95%BF%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6.md) | 哈希表、字符串、滑动窗口 | 中等 | -| 0425 | [单词方块](https://leetcode.cn/problems/word-squares/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0425.%20%E5%8D%95%E8%AF%8D%E6%96%B9%E5%9D%97.md) | 字典树、数组、字符串、回溯 | 困难 | -| 0426 | [将二叉搜索树转化为排序的双向链表](https://leetcode.cn/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0426.%20%E5%B0%86%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E8%BD%AC%E5%8C%96%E4%B8%BA%E6%8E%92%E5%BA%8F%E7%9A%84%E5%8F%8C%E5%90%91%E9%93%BE%E8%A1%A8.md) | 栈、树、深度优先搜索、二叉搜索树、链表、二叉树、双向链表 | 中等 | -| 0428 | [序列化和反序列化 N 叉树](https://leetcode.cn/problems/serialize-and-deserialize-n-ary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0428.%20%E5%BA%8F%E5%88%97%E5%8C%96%E5%92%8C%E5%8F%8D%E5%BA%8F%E5%88%97%E5%8C%96%20N%20%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、字符串 | 困难 | -| 0429 | [N 叉树的层序遍历](https://leetcode.cn/problems/n-ary-tree-level-order-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0429.%20N%20%E5%8F%89%E6%A0%91%E7%9A%84%E5%B1%82%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 树、广度优先搜索 | 中等 | -| 0430 | [扁平化多级双向链表](https://leetcode.cn/problems/flatten-a-multilevel-doubly-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0430.%20%E6%89%81%E5%B9%B3%E5%8C%96%E5%A4%9A%E7%BA%A7%E5%8F%8C%E5%90%91%E9%93%BE%E8%A1%A8.md) | 深度优先搜索、链表、双向链表 | 中等 | -| 0435 | [无重叠区间](https://leetcode.cn/problems/non-overlapping-intervals/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0435.%20%E6%97%A0%E9%87%8D%E5%8F%A0%E5%8C%BA%E9%97%B4.md) | 贪心、数组、动态规划、排序 | 中等 | -| 0437 | [路径总和 III](https://leetcode.cn/problems/path-sum-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0437.%20%E8%B7%AF%E5%BE%84%E6%80%BB%E5%92%8C%20III.md) | 树、深度优先搜索、二叉树 | 中等 | -| 0438 | [找到字符串中所有字母异位词](https://leetcode.cn/problems/find-all-anagrams-in-a-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0438.%20%E6%89%BE%E5%88%B0%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E6%89%80%E6%9C%89%E5%AD%97%E6%AF%8D%E5%BC%82%E4%BD%8D%E8%AF%8D.md) | 哈希表、字符串、滑动窗口 | 中等 | -| 0443 | [压缩字符串](https://leetcode.cn/problems/string-compression/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0443.%20%E5%8E%8B%E7%BC%A9%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 双指针、字符串 | 中等 | -| 0445 | [两数相加 II](https://leetcode.cn/problems/add-two-numbers-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0445.%20%E4%B8%A4%E6%95%B0%E7%9B%B8%E5%8A%A0%20II.md) | 栈、链表、数学 | 中等 | -| 0447 | [回旋镖的数量](https://leetcode.cn/problems/number-of-boomerangs/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0447.%20%E5%9B%9E%E6%97%8B%E9%95%96%E7%9A%84%E6%95%B0%E9%87%8F.md) | 数组、哈希表、数学 | 中等 | -| 0450 | [删除二叉搜索树中的节点](https://leetcode.cn/problems/delete-node-in-a-bst/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0450.%20%E5%88%A0%E9%99%A4%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E8%8A%82%E7%82%B9.md) | 树、二叉搜索树、二叉树 | 中等 | -| 0451 | [根据字符出现频率排序](https://leetcode.cn/problems/sort-characters-by-frequency/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0451.%20%E6%A0%B9%E6%8D%AE%E5%AD%97%E7%AC%A6%E5%87%BA%E7%8E%B0%E9%A2%91%E7%8E%87%E6%8E%92%E5%BA%8F.md) | 哈希表、字符串、桶排序、计数、排序、堆（优先队列） | 中等 | -| 0452 | [用最少数量的箭引爆气球](https://leetcode.cn/problems/minimum-number-of-arrows-to-burst-balloons/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0452.%20%E7%94%A8%E6%9C%80%E5%B0%91%E6%95%B0%E9%87%8F%E7%9A%84%E7%AE%AD%E5%BC%95%E7%88%86%E6%B0%94%E7%90%83.md) | 贪心、数组、排序 | 中等 | -| 0454 | [四数相加 II](https://leetcode.cn/problems/4sum-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0454.%20%E5%9B%9B%E6%95%B0%E7%9B%B8%E5%8A%A0%20II.md) | 数组、哈希表 | 中等 | -| 0455 | [分发饼干](https://leetcode.cn/problems/assign-cookies/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0455.%20%E5%88%86%E5%8F%91%E9%A5%BC%E5%B9%B2.md) | 贪心、数组、双指针、排序 | 简单 | -| 0459 | [重复的子字符串](https://leetcode.cn/problems/repeated-substring-pattern/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0459.%20%E9%87%8D%E5%A4%8D%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 字符串、字符串匹配 | 简单 | -| 0461 | [汉明距离](https://leetcode.cn/problems/hamming-distance/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0461.%20%E6%B1%89%E6%98%8E%E8%B7%9D%E7%A6%BB.md) | 位运算 | 简单 | -| 0463 | [岛屿的周长](https://leetcode.cn/problems/island-perimeter/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0463.%20%E5%B2%9B%E5%B1%BF%E7%9A%84%E5%91%A8%E9%95%BF.md) | 深度优先搜索、广度优先搜索、数组、矩阵 | 简单 | -| 0464 | [我能赢吗](https://leetcode.cn/problems/can-i-win/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0464.%20%E6%88%91%E8%83%BD%E8%B5%A2%E5%90%97.md) | 位运算、记忆化搜索、数学、动态规划、状态压缩、博弈 | 中等 | -| 0467 | [环绕字符串中唯一的子字符串](https://leetcode.cn/problems/unique-substrings-in-wraparound-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0467.%20%E7%8E%AF%E7%BB%95%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E5%94%AF%E4%B8%80%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 字符串、动态规划 | 中等 | -| 0468 | [验证IP地址](https://leetcode.cn/problems/validate-ip-address/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0468.%20%E9%AA%8C%E8%AF%81IP%E5%9C%B0%E5%9D%80.md) | 字符串 | 中等 | -| 0473 | [火柴拼正方形](https://leetcode.cn/problems/matchsticks-to-square/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0473.%20%E7%81%AB%E6%9F%B4%E6%8B%BC%E6%AD%A3%E6%96%B9%E5%BD%A2.md) | 位运算、数组、动态规划、回溯、状态压缩 | 中等 | -| 0474 | [一和零](https://leetcode.cn/problems/ones-and-zeroes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0474.%20%E4%B8%80%E5%92%8C%E9%9B%B6.md) | 数组、字符串、动态规划 | 中等 | -| 0480 | [滑动窗口中位数](https://leetcode.cn/problems/sliding-window-median/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0480.%20%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E4%B8%AD%E4%BD%8D%E6%95%B0.md) | 数组、哈希表、滑动窗口、堆（优先队列） | 困难 | -| 0485 | [最大连续 1 的个数](https://leetcode.cn/problems/max-consecutive-ones/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0485.%20%E6%9C%80%E5%A4%A7%E8%BF%9E%E7%BB%AD%201%20%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 数组 | 简单 | -| 0486 | [预测赢家](https://leetcode.cn/problems/predict-the-winner/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0486.%20%E9%A2%84%E6%B5%8B%E8%B5%A2%E5%AE%B6.md) | 递归、数组、数学、动态规划、博弈 | 中等 | -| 0487 | [最大连续1的个数 II](https://leetcode.cn/problems/max-consecutive-ones-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0487.%20%E6%9C%80%E5%A4%A7%E8%BF%9E%E7%BB%AD1%E7%9A%84%E4%B8%AA%E6%95%B0%20II.md) | 数组、动态规划、滑动窗口 | 中等 | -| 0491 | [递增子序列](https://leetcode.cn/problems/non-decreasing-subsequences/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0491.%20%E9%80%92%E5%A2%9E%E5%AD%90%E5%BA%8F%E5%88%97.md) | 位运算、数组、哈希表、回溯 | 中等 | -| 0494 | [目标和](https://leetcode.cn/problems/target-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0494.%20%E7%9B%AE%E6%A0%87%E5%92%8C.md) | 数组、动态规划、回溯 | 中等 | -| 0496 | [下一个更大元素 I](https://leetcode.cn/problems/next-greater-element-i/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0496.%20%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%9B%B4%E5%A4%A7%E5%85%83%E7%B4%A0%20I.md) | 栈、数组、哈希表、单调栈 | 简单 | -| 0498 | [对角线遍历](https://leetcode.cn/problems/diagonal-traverse/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0498.%20%E5%AF%B9%E8%A7%92%E7%BA%BF%E9%81%8D%E5%8E%86.md) | 数组、矩阵、模拟 | 中等 | -| 0501 | [二叉搜索树中的众数](https://leetcode.cn/problems/find-mode-in-binary-search-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0501.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E4%BC%97%E6%95%B0.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 简单 | -| 0503 | [下一个更大元素 II](https://leetcode.cn/problems/next-greater-element-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0503.%20%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%9B%B4%E5%A4%A7%E5%85%83%E7%B4%A0%20II.md) | 栈、数组、单调栈 | 中等 | -| 0504 | [七进制数](https://leetcode.cn/problems/base-7/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0504.%20%E4%B8%83%E8%BF%9B%E5%88%B6%E6%95%B0.md) | 数学 | 简单 | -| 0506 | [相对名次](https://leetcode.cn/problems/relative-ranks/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0506.%20%E7%9B%B8%E5%AF%B9%E5%90%8D%E6%AC%A1.md) | 数组、排序、堆（优先队列） | 简单 | -| 0509 | [斐波那契数](https://leetcode.cn/problems/fibonacci-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0509.%20%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0.md) | 递归、记忆化搜索、数学、动态规划 | 简单 | -| 0513 | [找树左下角的值](https://leetcode.cn/problems/find-bottom-left-tree-value/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0513.%20%E6%89%BE%E6%A0%91%E5%B7%A6%E4%B8%8B%E8%A7%92%E7%9A%84%E5%80%BC.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | -| 0515 | [在每个树行中找最大值](https://leetcode.cn/problems/find-largest-value-in-each-tree-row/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0515.%20%E5%9C%A8%E6%AF%8F%E4%B8%AA%E6%A0%91%E8%A1%8C%E4%B8%AD%E6%89%BE%E6%9C%80%E5%A4%A7%E5%80%BC.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | -| 0516 | [最长回文子序列](https://leetcode.cn/problems/longest-palindromic-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0516.%20%E6%9C%80%E9%95%BF%E5%9B%9E%E6%96%87%E5%AD%90%E5%BA%8F%E5%88%97.md) | 字符串、动态规划 | 中等 | -| 0518 | [零钱兑换 II](https://leetcode.cn/problems/coin-change-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0518.%20%E9%9B%B6%E9%92%B1%E5%85%91%E6%8D%A2%20II.md) | 数组、动态规划 | 中等 | -| 0525 | [连续数组](https://leetcode.cn/problems/contiguous-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0525.%20%E8%BF%9E%E7%BB%AD%E6%95%B0%E7%BB%84.md) | 数组、哈希表、前缀和 | 中等 | -| 0526 | [优美的排列](https://leetcode.cn/problems/beautiful-arrangement/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0526.%20%E4%BC%98%E7%BE%8E%E7%9A%84%E6%8E%92%E5%88%97.md) | 位运算、数组、动态规划、回溯、状态压缩 | 中等 | -| 0530 | [二叉搜索树的最小绝对差](https://leetcode.cn/problems/minimum-absolute-difference-in-bst/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0530.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E6%9C%80%E5%B0%8F%E7%BB%9D%E5%AF%B9%E5%B7%AE.md) | 树、深度优先搜索、广度优先搜索、二叉搜索树、二叉树 | 简单 | -| 0538 | [把二叉搜索树转换为累加树](https://leetcode.cn/problems/convert-bst-to-greater-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0538.%20%E6%8A%8A%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E8%BD%AC%E6%8D%A2%E4%B8%BA%E7%B4%AF%E5%8A%A0%E6%A0%91.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | -| 0539 | [最小时间差](https://leetcode.cn/problems/minimum-time-difference/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0539.%20%E6%9C%80%E5%B0%8F%E6%97%B6%E9%97%B4%E5%B7%AE.md) | 数组、数学、字符串、排序 | 中等 | -| 0542 | [01 矩阵](https://leetcode.cn/problems/01-matrix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0542.%2001%20%E7%9F%A9%E9%98%B5.md) | 广度优先搜索、数组、动态规划、矩阵 | 中等 | -| 0543 | [二叉树的直径](https://leetcode.cn/problems/diameter-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0543.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E7%9B%B4%E5%BE%84.md) | 树、深度优先搜索、二叉树 | 简单 | -| 0546 | [移除盒子](https://leetcode.cn/problems/remove-boxes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0546.%20%E7%A7%BB%E9%99%A4%E7%9B%92%E5%AD%90.md) | 记忆化搜索、数组、动态规划 | 困难 | -| 0547 | [省份数量](https://leetcode.cn/problems/number-of-provinces/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0547.%20%E7%9C%81%E4%BB%BD%E6%95%B0%E9%87%8F.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 0557 | [反转字符串中的单词 III](https://leetcode.cn/problems/reverse-words-in-a-string-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0557.%20%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%8D%95%E8%AF%8D%20III.md) | 双指针、字符串 | 简单 | -| 0560 | [和为 K 的子数组](https://leetcode.cn/problems/subarray-sum-equals-k/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0560.%20%E5%92%8C%E4%B8%BA%20K%20%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、哈希表、前缀和 | 中等 | -| 0561 | [数组拆分](https://leetcode.cn/problems/array-partition/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0561.%20%E6%95%B0%E7%BB%84%E6%8B%86%E5%88%86.md) | 贪心、数组、计数排序、排序 | 简单 | -| 0567 | [字符串的排列](https://leetcode.cn/problems/permutation-in-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0567.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%8E%92%E5%88%97.md) | 哈希表、双指针、字符串、滑动窗口 | 中等 | -| 0575 | [分糖果](https://leetcode.cn/problems/distribute-candies/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0575.%20%E5%88%86%E7%B3%96%E6%9E%9C.md) | 数组、哈希表 | 简单 | -| 0576 | [出界的路径数](https://leetcode.cn/problems/out-of-boundary-paths/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0576.%20%E5%87%BA%E7%95%8C%E7%9A%84%E8%B7%AF%E5%BE%84%E6%95%B0.md) | 动态规划 | 中等 | -| 0583 | [两个字符串的删除操作](https://leetcode.cn/problems/delete-operation-for-two-strings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0583.%20%E4%B8%A4%E4%B8%AA%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E5%88%A0%E9%99%A4%E6%93%8D%E4%BD%9C.md) | 字符串、动态规划 | 中等 | -| 0589 | [N 叉树的前序遍历](https://leetcode.cn/problems/n-ary-tree-preorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0589.%20N%20%E5%8F%89%E6%A0%91%E7%9A%84%E5%89%8D%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索 | 简单 | -| 0590 | [N 叉树的后序遍历](https://leetcode.cn/problems/n-ary-tree-postorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0590.%20N%20%E5%8F%89%E6%A0%91%E7%9A%84%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索 | 简单 | -| 0599 | [两个列表的最小索引总和](https://leetcode.cn/problems/minimum-index-sum-of-two-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0599.%20%E4%B8%A4%E4%B8%AA%E5%88%97%E8%A1%A8%E7%9A%84%E6%9C%80%E5%B0%8F%E7%B4%A2%E5%BC%95%E6%80%BB%E5%92%8C.md) | 数组、哈希表、字符串 | 简单 | -| 0600 | [不含连续1的非负整数](https://leetcode.cn/problems/non-negative-integers-without-consecutive-ones/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0600.%20%E4%B8%8D%E5%90%AB%E8%BF%9E%E7%BB%AD1%E7%9A%84%E9%9D%9E%E8%B4%9F%E6%95%B4%E6%95%B0.md) | 动态规划 | 困难 | -| 0611 | [有效三角形的个数](https://leetcode.cn/problems/valid-triangle-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0611.%20%E6%9C%89%E6%95%88%E4%B8%89%E8%A7%92%E5%BD%A2%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 贪心、数组、双指针、二分查找、排序 | 中等 | -| 0616 | [给字符串添加加粗标签](https://leetcode.cn/problems/add-bold-tag-in-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0616.%20%E7%BB%99%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%B7%BB%E5%8A%A0%E5%8A%A0%E7%B2%97%E6%A0%87%E7%AD%BE.md) | 字典树、数组、哈希表、字符串、字符串匹配 | 中等 | -| 0617 | [合并二叉树](https://leetcode.cn/problems/merge-two-binary-trees/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0617.%20%E5%90%88%E5%B9%B6%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0621 | [任务调度器](https://leetcode.cn/problems/task-scheduler/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0621.%20%E4%BB%BB%E5%8A%A1%E8%B0%83%E5%BA%A6%E5%99%A8.md) | 贪心、数组、哈希表、计数、排序、堆（优先队列） | 中等 | -| 0622 | [设计循环队列](https://leetcode.cn/problems/design-circular-queue/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0622.%20%E8%AE%BE%E8%AE%A1%E5%BE%AA%E7%8E%AF%E9%98%9F%E5%88%97.md) | 设计、队列、数组、链表 | 中等 | -| 0633 | [平方数之和](https://leetcode.cn/problems/sum-of-square-numbers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0633.%20%E5%B9%B3%E6%96%B9%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数学、双指针、二分查找 | 中等 | -| 0639 | [解码方法 II](https://leetcode.cn/problems/decode-ways-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0639.%20%E8%A7%A3%E7%A0%81%E6%96%B9%E6%B3%95%20II.md) | 字符串、动态规划 | 困难 | -| 0642 | [设计搜索自动补全系统](https://leetcode.cn/problems/design-search-autocomplete-system/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0642.%20%E8%AE%BE%E8%AE%A1%E6%90%9C%E7%B4%A2%E8%87%AA%E5%8A%A8%E8%A1%A5%E5%85%A8%E7%B3%BB%E7%BB%9F.md) | 设计、字典树、字符串、数据流 | 困难 | -| 0643 | [子数组最大平均数 I](https://leetcode.cn/problems/maximum-average-subarray-i/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0643.%20%E5%AD%90%E6%95%B0%E7%BB%84%E6%9C%80%E5%A4%A7%E5%B9%B3%E5%9D%87%E6%95%B0%20I.md) | 数组、滑动窗口 | 简单 | -| 0647 | [回文子串](https://leetcode.cn/problems/palindromic-substrings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0647.%20%E5%9B%9E%E6%96%87%E5%AD%90%E4%B8%B2.md) | 字符串、动态规划 | 中等 | -| 0648 | [单词替换](https://leetcode.cn/problems/replace-words/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0648.%20%E5%8D%95%E8%AF%8D%E6%9B%BF%E6%8D%A2.md) | 字典树、数组、哈希表、字符串 | 中等 | -| 0650 | [只有两个键的键盘](https://leetcode.cn/problems/2-keys-keyboard/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0650.%20%E5%8F%AA%E6%9C%89%E4%B8%A4%E4%B8%AA%E9%94%AE%E7%9A%84%E9%94%AE%E7%9B%98.md) | 数学、动态规划 | 中等 | -| 0652 | [寻找重复的子树](https://leetcode.cn/problems/find-duplicate-subtrees/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0652.%20%E5%AF%BB%E6%89%BE%E9%87%8D%E5%A4%8D%E7%9A%84%E5%AD%90%E6%A0%91.md) | 树、深度优先搜索、哈希表、二叉树 | 中等 | -| 0653 | [两数之和 IV - 输入二叉搜索树](https://leetcode.cn/problems/two-sum-iv-input-is-a-bst/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0653.%20%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C%20IV%20-%20%E8%BE%93%E5%85%A5%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、二叉搜索树、哈希表、双指针、二叉树 | 简单 | -| 0654 | [最大二叉树](https://leetcode.cn/problems/maximum-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0654.%20%E6%9C%80%E5%A4%A7%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 栈、树、数组、分治、二叉树、单调栈 | 中等 | -| 0658 | [找到 K 个最接近的元素](https://leetcode.cn/problems/find-k-closest-elements/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0658.%20%E6%89%BE%E5%88%B0%20K%20%E4%B8%AA%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9A%84%E5%85%83%E7%B4%A0.md) | 数组、双指针、二分查找、排序、滑动窗口、堆（优先队列） | 中等 | -| 0662 | [二叉树最大宽度](https://leetcode.cn/problems/maximum-width-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0662.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E6%9C%80%E5%A4%A7%E5%AE%BD%E5%BA%A6.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | -| 0664 | [奇怪的打印机](https://leetcode.cn/problems/strange-printer/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0664.%20%E5%A5%87%E6%80%AA%E7%9A%84%E6%89%93%E5%8D%B0%E6%9C%BA.md) | 字符串、动态规划 | 困难 | -| 0665 | [非递减数列](https://leetcode.cn/problems/non-decreasing-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0665.%20%E9%9D%9E%E9%80%92%E5%87%8F%E6%95%B0%E5%88%97.md) | 数组 | 中等 | -| 0669 | [修剪二叉搜索树](https://leetcode.cn/problems/trim-a-binary-search-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0669.%20%E4%BF%AE%E5%89%AA%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | -| 0673 | [最长递增子序列的个数](https://leetcode.cn/problems/number-of-longest-increasing-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0673.%20%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 树状数组、线段树、数组、动态规划 | 中等 | -| 0674 | [最长连续递增序列](https://leetcode.cn/problems/longest-continuous-increasing-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0674.%20%E6%9C%80%E9%95%BF%E8%BF%9E%E7%BB%AD%E9%80%92%E5%A2%9E%E5%BA%8F%E5%88%97.md) | 数组 | 简单 | -| 0676 | [实现一个魔法字典](https://leetcode.cn/problems/implement-magic-dictionary/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0676.%20%E5%AE%9E%E7%8E%B0%E4%B8%80%E4%B8%AA%E9%AD%94%E6%B3%95%E5%AD%97%E5%85%B8.md) | 设计、字典树、哈希表、字符串 | 中等 | -| 0677 | [键值映射](https://leetcode.cn/problems/map-sum-pairs/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0677.%20%E9%94%AE%E5%80%BC%E6%98%A0%E5%B0%84.md) | 设计、字典树、哈希表、字符串 | 中等 | -| 0678 | [有效的括号字符串](https://leetcode.cn/problems/valid-parenthesis-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0678.%20%E6%9C%89%E6%95%88%E7%9A%84%E6%8B%AC%E5%8F%B7%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 栈、贪心、字符串、动态规划 | 中等 | -| 0680 | [验证回文串 II](https://leetcode.cn/problems/valid-palindrome-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0680.%20%E9%AA%8C%E8%AF%81%E5%9B%9E%E6%96%87%E4%B8%B2%20II.md) | 贪心、双指针、字符串 | 简单 | -| 0683 | [K 个关闭的灯泡](https://leetcode.cn/problems/k-empty-slots/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0683.%20K%20%E4%B8%AA%E5%85%B3%E9%97%AD%E7%9A%84%E7%81%AF%E6%B3%A1.md) | 树状数组、数组、有序集合、滑动窗口 | 困难 | -| 0684 | [冗余连接](https://leetcode.cn/problems/redundant-connection/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0684.%20%E5%86%97%E4%BD%99%E8%BF%9E%E6%8E%A5.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 0686 | [重复叠加字符串匹配](https://leetcode.cn/problems/repeated-string-match/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0686.%20%E9%87%8D%E5%A4%8D%E5%8F%A0%E5%8A%A0%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%8C%B9%E9%85%8D.md) | 字符串、字符串匹配 | 中等 | -| 0687 | [最长同值路径](https://leetcode.cn/problems/longest-univalue-path/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0687.%20%E6%9C%80%E9%95%BF%E5%90%8C%E5%80%BC%E8%B7%AF%E5%BE%84.md) | 树、深度优先搜索、二叉树 | 中等 | -| 0688 | [骑士在棋盘上的概率](https://leetcode.cn/problems/knight-probability-in-chessboard/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0688.%20%E9%AA%91%E5%A3%AB%E5%9C%A8%E6%A3%8B%E7%9B%98%E4%B8%8A%E7%9A%84%E6%A6%82%E7%8E%87.md) | 动态规划 | 中等 | -| 0690 | [员工的重要性](https://leetcode.cn/problems/employee-importance/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0690.%20%E5%91%98%E5%B7%A5%E7%9A%84%E9%87%8D%E8%A6%81%E6%80%A7.md) | 深度优先搜索、广度优先搜索、哈希表 | 中等 | -| 0691 | [贴纸拼词](https://leetcode.cn/problems/stickers-to-spell-word/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0691.%20%E8%B4%B4%E7%BA%B8%E6%8B%BC%E8%AF%8D.md) | 位运算、数组、字符串、动态规划、回溯、状态压缩 | 困难 | -| 0695 | [岛屿的最大面积](https://leetcode.cn/problems/max-area-of-island/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0695.%20%E5%B2%9B%E5%B1%BF%E7%9A%84%E6%9C%80%E5%A4%A7%E9%9D%A2%E7%A7%AF.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | -| 0698 | [划分为k个相等的子集](https://leetcode.cn/problems/partition-to-k-equal-sum-subsets/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0698.%20%E5%88%92%E5%88%86%E4%B8%BAk%E4%B8%AA%E7%9B%B8%E7%AD%89%E7%9A%84%E5%AD%90%E9%9B%86.md) | 位运算、记忆化搜索、数组、动态规划、回溯、状态压缩 | 中等 | -| 0700 | [二叉搜索树中的搜索](https://leetcode.cn/problems/search-in-a-binary-search-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0700.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E6%90%9C%E7%B4%A2.md) | 树、二叉搜索树、二叉树 | 简单 | -| 0701 | [二叉搜索树中的插入操作](https://leetcode.cn/problems/insert-into-a-binary-search-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0701.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E6%8F%92%E5%85%A5%E6%93%8D%E4%BD%9C.md) | 树、二叉搜索树、二叉树 | 中等 | -| 0702 | [搜索长度未知的有序数组](https://leetcode.cn/problems/search-in-a-sorted-array-of-unknown-size/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0702.%20%E6%90%9C%E7%B4%A2%E9%95%BF%E5%BA%A6%E6%9C%AA%E7%9F%A5%E7%9A%84%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、二分查找、交互 | 中等 | -| 0703 | [数据流中的第 K 大元素](https://leetcode.cn/problems/kth-largest-element-in-a-stream/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0703.%20%E6%95%B0%E6%8D%AE%E6%B5%81%E4%B8%AD%E7%9A%84%E7%AC%AC%20K%20%E5%A4%A7%E5%85%83%E7%B4%A0.md) | 树、设计、二叉搜索树、二叉树、数据流、堆（优先队列） | 简单 | -| 0704 | [二分查找](https://leetcode.cn/problems/binary-search/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0704.%20%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE.md) | 数组、二分查找 | 简单 | -| 0705 | [设计哈希集合](https://leetcode.cn/problems/design-hashset/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0705.%20%E8%AE%BE%E8%AE%A1%E5%93%88%E5%B8%8C%E9%9B%86%E5%90%88.md) | 设计、数组、哈希表、链表、哈希函数 | 简单 | -| 0706 | [设计哈希映射](https://leetcode.cn/problems/design-hashmap/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0706.%20%E8%AE%BE%E8%AE%A1%E5%93%88%E5%B8%8C%E6%98%A0%E5%B0%84.md) | 设计、数组、哈希表、链表、哈希函数 | 简单 | -| 0707 | [设计链表](https://leetcode.cn/problems/design-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0707.%20%E8%AE%BE%E8%AE%A1%E9%93%BE%E8%A1%A8.md) | 设计、链表 | 中等 | -| 0708 | [循环有序列表的插入](https://leetcode.cn/problems/insert-into-a-sorted-circular-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0708.%20%E5%BE%AA%E7%8E%AF%E6%9C%89%E5%BA%8F%E5%88%97%E8%A1%A8%E7%9A%84%E6%8F%92%E5%85%A5.md) | 链表 | 中等 | -| 0709 | [转换成小写字母](https://leetcode.cn/problems/to-lower-case/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0709.%20%E8%BD%AC%E6%8D%A2%E6%88%90%E5%B0%8F%E5%86%99%E5%AD%97%E6%AF%8D.md) | 字符串 | 简单 | -| 0713 | [乘积小于 K 的子数组](https://leetcode.cn/problems/subarray-product-less-than-k/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0713.%20%E4%B9%98%E7%A7%AF%E5%B0%8F%E4%BA%8E%20K%20%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、滑动窗口 | 中等 | -| 0714 | [买卖股票的最佳时机含手续费](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0714.%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA%E5%90%AB%E6%89%8B%E7%BB%AD%E8%B4%B9.md) | 贪心、数组 | 中等 | -| 0715 | [Range 模块](https://leetcode.cn/problems/range-module/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0715.%20Range%20%E6%A8%A1%E5%9D%97.md) | 设计、线段树、有序集合 | 困难 | -| 0718 | [最长重复子数组](https://leetcode.cn/problems/maximum-length-of-repeated-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0718.%20%E6%9C%80%E9%95%BF%E9%87%8D%E5%A4%8D%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、二分查找、动态规划、滑动窗口、哈希函数、滚动哈希 | 中等 | -| 0719 | [找出第 K 小的数对距离](https://leetcode.cn/problems/find-k-th-smallest-pair-distance/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0719.%20%E6%89%BE%E5%87%BA%E7%AC%AC%20K%20%E5%B0%8F%E7%9A%84%E6%95%B0%E5%AF%B9%E8%B7%9D%E7%A6%BB.md) | 数组、双指针、二分查找、排序 | 困难 | -| 0720 | [词典中最长的单词](https://leetcode.cn/problems/longest-word-in-dictionary/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0720.%20%E8%AF%8D%E5%85%B8%E4%B8%AD%E6%9C%80%E9%95%BF%E7%9A%84%E5%8D%95%E8%AF%8D.md) | 字典树、数组、哈希表、字符串、排序 | 中等 | -| 0724 | [寻找数组的中心下标](https://leetcode.cn/problems/find-pivot-index/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0724.%20%E5%AF%BB%E6%89%BE%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%AD%E5%BF%83%E4%B8%8B%E6%A0%87.md) | 数组、前缀和 | 简单 | -| 0727 | [最小窗口子序列](https://leetcode.cn/problems/minimum-window-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0727.%20%E6%9C%80%E5%B0%8F%E7%AA%97%E5%8F%A3%E5%AD%90%E5%BA%8F%E5%88%97.md) | 字符串、动态规划、滑动窗口 | 困难 | -| 0729 | [我的日程安排表 I](https://leetcode.cn/problems/my-calendar-i/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0729.%20%E6%88%91%E7%9A%84%E6%97%A5%E7%A8%8B%E5%AE%89%E6%8E%92%E8%A1%A8%20I.md) | 设计、线段树、二分查找、有序集合 | 中等 | -| 0731 | [我的日程安排表 II](https://leetcode.cn/problems/my-calendar-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0731.%20%E6%88%91%E7%9A%84%E6%97%A5%E7%A8%8B%E5%AE%89%E6%8E%92%E8%A1%A8%20II.md) | 设计、线段树、二分查找、有序集合 | 中等 | -| 0732 | [我的日程安排表 III](https://leetcode.cn/problems/my-calendar-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0732.%20%E6%88%91%E7%9A%84%E6%97%A5%E7%A8%8B%E5%AE%89%E6%8E%92%E8%A1%A8%20III.md) | 设计、线段树、二分查找、有序集合 | 困难 | -| 0733 | [图像渲染](https://leetcode.cn/problems/flood-fill/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0733.%20%E5%9B%BE%E5%83%8F%E6%B8%B2%E6%9F%93.md) | 深度优先搜索、广度优先搜索、数组、矩阵 | 简单 | -| 0735 | [行星碰撞](https://leetcode.cn/problems/asteroid-collision/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0735.%20%E8%A1%8C%E6%98%9F%E7%A2%B0%E6%92%9E.md) | 栈、数组、模拟 | 中等 | -| 0738 | [单调递增的数字](https://leetcode.cn/problems/monotone-increasing-digits/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0738.%20%E5%8D%95%E8%B0%83%E9%80%92%E5%A2%9E%E7%9A%84%E6%95%B0%E5%AD%97.md) | 贪心、数学 | 中等 | -| 0739 | [每日温度](https://leetcode.cn/problems/daily-temperatures/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0739.%20%E6%AF%8F%E6%97%A5%E6%B8%A9%E5%BA%A6.md) | 栈、数组、单调栈 | 中等 | -| 0744 | [寻找比目标字母大的最小字母](https://leetcode.cn/problems/find-smallest-letter-greater-than-target/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0744.%20%E5%AF%BB%E6%89%BE%E6%AF%94%E7%9B%AE%E6%A0%87%E5%AD%97%E6%AF%8D%E5%A4%A7%E7%9A%84%E6%9C%80%E5%B0%8F%E5%AD%97%E6%AF%8D.md) | 数组、二分查找 | 简单 | -| 0746 | [使用最小花费爬楼梯](https://leetcode.cn/problems/min-cost-climbing-stairs/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0746.%20%E4%BD%BF%E7%94%A8%E6%9C%80%E5%B0%8F%E8%8A%B1%E8%B4%B9%E7%88%AC%E6%A5%BC%E6%A2%AF.md) | 数组、动态规划 | 简单 | -| 0752 | [打开转盘锁](https://leetcode.cn/problems/open-the-lock/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0752.%20%E6%89%93%E5%BC%80%E8%BD%AC%E7%9B%98%E9%94%81.md) | 广度优先搜索、数组、哈希表、字符串 | 中等 | -| 0758 | [字符串中的加粗单词](https://leetcode.cn/problems/bold-words-in-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0758.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%8A%A0%E7%B2%97%E5%8D%95%E8%AF%8D.md) | 字典树、数组、哈希表、字符串、字符串匹配 | 中等 | -| 0763 | [划分字母区间](https://leetcode.cn/problems/partition-labels/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0763.%20%E5%88%92%E5%88%86%E5%AD%97%E6%AF%8D%E5%8C%BA%E9%97%B4.md) | 贪心、哈希表、双指针、字符串 | 中等 | -| 0765 | [情侣牵手](https://leetcode.cn/problems/couples-holding-hands/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0765.%20%E6%83%85%E4%BE%A3%E7%89%B5%E6%89%8B.md) | 贪心、深度优先搜索、广度优先搜索、并查集、图 | 困难 | -| 0766 | [托普利茨矩阵](https://leetcode.cn/problems/toeplitz-matrix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0766.%20%E6%89%98%E6%99%AE%E5%88%A9%E8%8C%A8%E7%9F%A9%E9%98%B5.md) | 数组、矩阵 | 简单 | -| 0771 | [宝石与石头](https://leetcode.cn/problems/jewels-and-stones/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0771.%20%E5%AE%9D%E7%9F%B3%E4%B8%8E%E7%9F%B3%E5%A4%B4.md) | 哈希表、字符串 | 简单 | -| 0778 | [水位上升的泳池中游泳](https://leetcode.cn/problems/swim-in-rising-water/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0778.%20%E6%B0%B4%E4%BD%8D%E4%B8%8A%E5%8D%87%E7%9A%84%E6%B3%B3%E6%B1%A0%E4%B8%AD%E6%B8%B8%E6%B3%B3.md) | 深度优先搜索、广度优先搜索、并查集、数组、二分查找、矩阵、堆（优先队列） | 困难 | -| 0779 | [第K个语法符号](https://leetcode.cn/problems/k-th-symbol-in-grammar/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0779.%20%E7%AC%ACK%E4%B8%AA%E8%AF%AD%E6%B3%95%E7%AC%A6%E5%8F%B7.md) | 位运算、递归、数学 | 中等 | -| 0783 | [二叉搜索树节点最小距离](https://leetcode.cn/problems/minimum-distance-between-bst-nodes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0783.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E8%8A%82%E7%82%B9%E6%9C%80%E5%B0%8F%E8%B7%9D%E7%A6%BB.md) | 树、深度优先搜索、广度优先搜索、二叉搜索树、二叉树 | 简单 | -| 0784 | [字母大小写全排列](https://leetcode.cn/problems/letter-case-permutation/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0784.%20%E5%AD%97%E6%AF%8D%E5%A4%A7%E5%B0%8F%E5%86%99%E5%85%A8%E6%8E%92%E5%88%97.md) | 位运算、字符串、回溯 | 中等 | -| 0785 | [判断二分图](https://leetcode.cn/problems/is-graph-bipartite/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0785.%20%E5%88%A4%E6%96%AD%E4%BA%8C%E5%88%86%E5%9B%BE.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 0788 | [旋转数字](https://leetcode.cn/problems/rotated-digits/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0788.%20%E6%97%8B%E8%BD%AC%E6%95%B0%E5%AD%97.md) | 数学、动态规划 | 中等 | -| 0795 | [区间子数组个数](https://leetcode.cn/problems/number-of-subarrays-with-bounded-maximum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0795.%20%E5%8C%BA%E9%97%B4%E5%AD%90%E6%95%B0%E7%BB%84%E4%B8%AA%E6%95%B0.md) | 数组、双指针 | 中等 | -| 0796 | [旋转字符串](https://leetcode.cn/problems/rotate-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0796.%20%E6%97%8B%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 字符串、字符串匹配 | 简单 | -| 0797 | [所有可能的路径](https://leetcode.cn/problems/all-paths-from-source-to-target/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0797.%20%E6%89%80%E6%9C%89%E5%8F%AF%E8%83%BD%E7%9A%84%E8%B7%AF%E5%BE%84.md) | 深度优先搜索、广度优先搜索、图、回溯 | 中等 | -| 0800 | [相似 RGB 颜色](https://leetcode.cn/problems/similar-rgb-color/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0800.%20%E7%9B%B8%E4%BC%BC%20RGB%20%E9%A2%9C%E8%89%B2.md) | 数学、字符串、枚举 | 简单 | -| 0801 | [使序列递增的最小交换次数](https://leetcode.cn/problems/minimum-swaps-to-make-sequences-increasing/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0801.%20%E4%BD%BF%E5%BA%8F%E5%88%97%E9%80%92%E5%A2%9E%E7%9A%84%E6%9C%80%E5%B0%8F%E4%BA%A4%E6%8D%A2%E6%AC%A1%E6%95%B0.md) | 数组、动态规划 | 困难 | -| 0802 | [找到最终的安全状态](https://leetcode.cn/problems/find-eventual-safe-states/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0802.%20%E6%89%BE%E5%88%B0%E6%9C%80%E7%BB%88%E7%9A%84%E5%AE%89%E5%85%A8%E7%8A%B6%E6%80%81.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | -| 0803 | [打砖块](https://leetcode.cn/problems/bricks-falling-when-hit/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0803.%20%E6%89%93%E7%A0%96%E5%9D%97.md) | 并查集、数组、矩阵 | 困难 | -| 0804 | [唯一摩尔斯密码词](https://leetcode.cn/problems/unique-morse-code-words/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0804.%20%E5%94%AF%E4%B8%80%E6%91%A9%E5%B0%94%E6%96%AF%E5%AF%86%E7%A0%81%E8%AF%8D.md) | 数组、哈希表、字符串 | 简单 | -| 0806 | [写字符串需要的行数](https://leetcode.cn/problems/number-of-lines-to-write-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0806.%20%E5%86%99%E5%AD%97%E7%AC%A6%E4%B8%B2%E9%9C%80%E8%A6%81%E7%9A%84%E8%A1%8C%E6%95%B0.md) | 数组、字符串 | 简单 | -| 0811 | [子域名访问计数](https://leetcode.cn/problems/subdomain-visit-count/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0811.%20%E5%AD%90%E5%9F%9F%E5%90%8D%E8%AE%BF%E9%97%AE%E8%AE%A1%E6%95%B0.md) | 数组、哈希表、字符串、计数 | 中等 | -| 0814 | [二叉树剪枝](https://leetcode.cn/problems/binary-tree-pruning/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0814.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E5%89%AA%E6%9E%9D.md) | 树、深度优先搜索、二叉树 | 中等 | -| 0819 | [最常见的单词](https://leetcode.cn/problems/most-common-word/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0819.%20%E6%9C%80%E5%B8%B8%E8%A7%81%E7%9A%84%E5%8D%95%E8%AF%8D.md) | 哈希表、字符串、计数 | 简单 | -| 0820 | [单词的压缩编码](https://leetcode.cn/problems/short-encoding-of-words/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0820.%20%E5%8D%95%E8%AF%8D%E7%9A%84%E5%8E%8B%E7%BC%A9%E7%BC%96%E7%A0%81.md) | 字典树、数组、哈希表、字符串 | 中等 | -| 0821 | [字符的最短距离](https://leetcode.cn/problems/shortest-distance-to-a-character/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0821.%20%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E7%9F%AD%E8%B7%9D%E7%A6%BB.md) | 数组、双指针、字符串 | 简单 | -| 0824 | [山羊拉丁文](https://leetcode.cn/problems/goat-latin/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0824.%20%E5%B1%B1%E7%BE%8A%E6%8B%89%E4%B8%81%E6%96%87.md) | 字符串 | 简单 | -| 0830 | [较大分组的位置](https://leetcode.cn/problems/positions-of-large-groups/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0830.%20%E8%BE%83%E5%A4%A7%E5%88%86%E7%BB%84%E7%9A%84%E4%BD%8D%E7%BD%AE.md) | 字符串 | 简单 | -| 0832 | [翻转图像](https://leetcode.cn/problems/flipping-an-image/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0832.%20%E7%BF%BB%E8%BD%AC%E5%9B%BE%E5%83%8F.md) | 数组、双指针、矩阵、模拟 | 简单 | -| 0834 | [树中距离之和](https://leetcode.cn/problems/sum-of-distances-in-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0834.%20%E6%A0%91%E4%B8%AD%E8%B7%9D%E7%A6%BB%E4%B9%8B%E5%92%8C.md) | 树、深度优先搜索、图、动态规划 | 困难 | -| 0836 | [矩形重叠](https://leetcode.cn/problems/rectangle-overlap/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0836.%20%E7%9F%A9%E5%BD%A2%E9%87%8D%E5%8F%A0.md) | 几何、数学 | 简单 | -| 0841 | [钥匙和房间](https://leetcode.cn/problems/keys-and-rooms/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0841.%20%E9%92%A5%E5%8C%99%E5%92%8C%E6%88%BF%E9%97%B4.md) | 深度优先搜索、广度优先搜索、图 | 中等 | -| 0844 | [比较含退格的字符串](https://leetcode.cn/problems/backspace-string-compare/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0844.%20%E6%AF%94%E8%BE%83%E5%90%AB%E9%80%80%E6%A0%BC%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 栈、双指针、字符串、模拟 | 简单 | -| 0845 | [数组中的最长山脉](https://leetcode.cn/problems/longest-mountain-in-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0845.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9C%80%E9%95%BF%E5%B1%B1%E8%84%89.md) | 数组、双指针、动态规划、枚举 | 中等 | -| 0846 | [一手顺子](https://leetcode.cn/problems/hand-of-straights/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0846.%20%E4%B8%80%E6%89%8B%E9%A1%BA%E5%AD%90.md) | 贪心、数组、哈希表、排序 | 中等 | -| 0847 | [访问所有节点的最短路径](https://leetcode.cn/problems/shortest-path-visiting-all-nodes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0847.%20%E8%AE%BF%E9%97%AE%E6%89%80%E6%9C%89%E8%8A%82%E7%82%B9%E7%9A%84%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84.md) | 位运算、广度优先搜索、图、动态规划、状态压缩 | 困难 | -| 0850 | [矩形面积 II](https://leetcode.cn/problems/rectangle-area-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0850.%20%E7%9F%A9%E5%BD%A2%E9%9D%A2%E7%A7%AF%20II.md) | 线段树、数组、有序集合、扫描线 | 困难 | -| 0851 | [喧闹和富有](https://leetcode.cn/problems/loud-and-rich/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0851.%20%E5%96%A7%E9%97%B9%E5%92%8C%E5%AF%8C%E6%9C%89.md) | 深度优先搜索、图、拓扑排序、数组 | 中等 | -| 0852 | [山脉数组的峰顶索引](https://leetcode.cn/problems/peak-index-in-a-mountain-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0852.%20%E5%B1%B1%E8%84%89%E6%95%B0%E7%BB%84%E7%9A%84%E5%B3%B0%E9%A1%B6%E7%B4%A2%E5%BC%95.md) | 数组、二分查找 | 中等 | -| 0860 | [柠檬水找零](https://leetcode.cn/problems/lemonade-change/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0860.%20%E6%9F%A0%E6%AA%AC%E6%B0%B4%E6%89%BE%E9%9B%B6.md) | 贪心、数组 | 简单 | -| 0861 | [翻转矩阵后的得分](https://leetcode.cn/problems/score-after-flipping-matrix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0861.%20%E7%BF%BB%E8%BD%AC%E7%9F%A9%E9%98%B5%E5%90%8E%E7%9A%84%E5%BE%97%E5%88%86.md) | 贪心、位运算、数组、矩阵 | 中等 | -| 0862 | [和至少为 K 的最短子数组](https://leetcode.cn/problems/shortest-subarray-with-sum-at-least-k/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0862.%20%E5%92%8C%E8%87%B3%E5%B0%91%E4%B8%BA%20K%20%E7%9A%84%E6%9C%80%E7%9F%AD%E5%AD%90%E6%95%B0%E7%BB%84.md) | 队列、数组、二分查找、前缀和、滑动窗口、单调队列、堆（优先队列） | 困难 | -| 0867 | [转置矩阵](https://leetcode.cn/problems/transpose-matrix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0867.%20%E8%BD%AC%E7%BD%AE%E7%9F%A9%E9%98%B5.md) | 数组、矩阵、模拟 | 简单 | -| 0868 | [二进制间距](https://leetcode.cn/problems/binary-gap/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0868.%20%E4%BA%8C%E8%BF%9B%E5%88%B6%E9%97%B4%E8%B7%9D.md) | 位运算 | 简单 | -| 0872 | [叶子相似的树](https://leetcode.cn/problems/leaf-similar-trees/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0872.%20%E5%8F%B6%E5%AD%90%E7%9B%B8%E4%BC%BC%E7%9A%84%E6%A0%91.md) | 树、深度优先搜索、二叉树 | 简单 | -| 0873 | [最长的斐波那契子序列的长度](https://leetcode.cn/problems/length-of-longest-fibonacci-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0873.%20%E6%9C%80%E9%95%BF%E7%9A%84%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E9%95%BF%E5%BA%A6.md) | 数组、哈希表、动态规划 | 中等 | -| 0875 | [爱吃香蕉的珂珂](https://leetcode.cn/problems/koko-eating-bananas/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0875.%20%E7%88%B1%E5%90%83%E9%A6%99%E8%95%89%E7%9A%84%E7%8F%82%E7%8F%82.md) | 数组、二分查找 | 中等 | -| 0876 | [链表的中间结点](https://leetcode.cn/problems/middle-of-the-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0876.%20%E9%93%BE%E8%A1%A8%E7%9A%84%E4%B8%AD%E9%97%B4%E7%BB%93%E7%82%B9.md) | 链表、双指针 | 简单 | -| 0877 | [石子游戏](https://leetcode.cn/problems/stone-game/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0877.%20%E7%9F%B3%E5%AD%90%E6%B8%B8%E6%88%8F.md) | 数组、数学、动态规划、博弈 | 中等 | -| 0881 | [救生艇](https://leetcode.cn/problems/boats-to-save-people/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0881.%20%E6%95%91%E7%94%9F%E8%89%87.md) | 贪心、数组、双指针、排序 | 中等 | -| 0884 | [两句话中的不常见单词](https://leetcode.cn/problems/uncommon-words-from-two-sentences/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0884.%20%E4%B8%A4%E5%8F%A5%E8%AF%9D%E4%B8%AD%E7%9A%84%E4%B8%8D%E5%B8%B8%E8%A7%81%E5%8D%95%E8%AF%8D.md) | 哈希表、字符串 | 简单 | -| 0886 | [可能的二分法](https://leetcode.cn/problems/possible-bipartition/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0886.%20%E5%8F%AF%E8%83%BD%E7%9A%84%E4%BA%8C%E5%88%86%E6%B3%95.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 0887 | [鸡蛋掉落](https://leetcode.cn/problems/super-egg-drop/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0887.%20%E9%B8%A1%E8%9B%8B%E6%8E%89%E8%90%BD.md) | 数学、二分查找、动态规划 | 困难 | -| 0889 | [根据前序和后序遍历构造二叉树](https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-postorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0889.%20%E6%A0%B9%E6%8D%AE%E5%89%8D%E5%BA%8F%E5%92%8C%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86%E6%9E%84%E9%80%A0%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、数组、哈希表、分治、二叉树 | 中等 | -| 0892 | [三维形体的表面积](https://leetcode.cn/problems/surface-area-of-3d-shapes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0892.%20%E4%B8%89%E7%BB%B4%E5%BD%A2%E4%BD%93%E7%9A%84%E8%A1%A8%E9%9D%A2%E7%A7%AF.md) | 几何、数组、数学、矩阵 | 简单 | -| 0897 | [递增顺序搜索树](https://leetcode.cn/problems/increasing-order-search-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0897.%20%E9%80%92%E5%A2%9E%E9%A1%BA%E5%BA%8F%E6%90%9C%E7%B4%A2%E6%A0%91.md) | 栈、树、深度优先搜索、二叉搜索树、二叉树 | 简单 | -| 0900 | [RLE 迭代器](https://leetcode.cn/problems/rle-iterator/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0900.%20RLE%20%E8%BF%AD%E4%BB%A3%E5%99%A8.md) | 设计、数组、计数、迭代器 | 中等 | -| 0901 | [股票价格跨度](https://leetcode.cn/problems/online-stock-span/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0901.%20%E8%82%A1%E7%A5%A8%E4%BB%B7%E6%A0%BC%E8%B7%A8%E5%BA%A6.md) | 栈、设计、数据流、单调栈 | 中等 | -| 0902 | [最大为 N 的数字组合](https://leetcode.cn/problems/numbers-at-most-n-given-digit-set/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0902.%20%E6%9C%80%E5%A4%A7%E4%B8%BA%20N%20%E7%9A%84%E6%95%B0%E5%AD%97%E7%BB%84%E5%90%88.md) | 数组、数学、字符串、二分查找、动态规划 | 困难 | -| 0904 | [水果成篮](https://leetcode.cn/problems/fruit-into-baskets/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0904.%20%E6%B0%B4%E6%9E%9C%E6%88%90%E7%AF%AE.md) | 数组、哈希表、滑动窗口 | 中等 | -| 0908 | [最小差值 I](https://leetcode.cn/problems/smallest-range-i/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0908.%20%E6%9C%80%E5%B0%8F%E5%B7%AE%E5%80%BC%20I.md) | 数组、数学 | 简单 | -| 0912 | [排序数组](https://leetcode.cn/problems/sort-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0912.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | -| 0918 | [环形子数组的最大和](https://leetcode.cn/problems/maximum-sum-circular-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0918.%20%E7%8E%AF%E5%BD%A2%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%92%8C.md) | 队列、数组、分治、动态规划、单调队列 | 中等 | -| 0919 | [完全二叉树插入器](https://leetcode.cn/problems/complete-binary-tree-inserter/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0919.%20%E5%AE%8C%E5%85%A8%E4%BA%8C%E5%8F%89%E6%A0%91%E6%8F%92%E5%85%A5%E5%99%A8.md) | 树、广度优先搜索、设计、二叉树 | 中等 | -| 0921 | [使括号有效的最少添加](https://leetcode.cn/problems/minimum-add-to-make-parentheses-valid/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0921.%20%E4%BD%BF%E6%8B%AC%E5%8F%B7%E6%9C%89%E6%95%88%E7%9A%84%E6%9C%80%E5%B0%91%E6%B7%BB%E5%8A%A0.md) | 栈、贪心、字符串 | 中等 | -| 0925 | [长按键入](https://leetcode.cn/problems/long-pressed-name/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0925.%20%E9%95%BF%E6%8C%89%E9%94%AE%E5%85%A5.md) | 双指针、字符串 | 简单 | -| 0932 | [漂亮数组](https://leetcode.cn/problems/beautiful-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0932.%20%E6%BC%82%E4%BA%AE%E6%95%B0%E7%BB%84.md) | 数组、数学、分治 | 中等 | -| 0933 | [最近的请求次数](https://leetcode.cn/problems/number-of-recent-calls/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0933.%20%E6%9C%80%E8%BF%91%E7%9A%84%E8%AF%B7%E6%B1%82%E6%AC%A1%E6%95%B0.md) | 设计、队列、数据流 | 简单 | -| 0935 | [骑士拨号器](https://leetcode.cn/problems/knight-dialer/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0935.%20%E9%AA%91%E5%A3%AB%E6%8B%A8%E5%8F%B7%E5%99%A8.md) | 动态规划 | 中等 | -| 0938 | [二叉搜索树的范围和](https://leetcode.cn/problems/range-sum-of-bst/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0938.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E8%8C%83%E5%9B%B4%E5%92%8C.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 简单 | -| 0946 | [验证栈序列](https://leetcode.cn/problems/validate-stack-sequences/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0946.%20%E9%AA%8C%E8%AF%81%E6%A0%88%E5%BA%8F%E5%88%97.md) | 栈、数组、模拟 | 中等 | -| 0947 | [移除最多的同行或同列石头](https://leetcode.cn/problems/most-stones-removed-with-same-row-or-column/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0947.%20%E7%A7%BB%E9%99%A4%E6%9C%80%E5%A4%9A%E7%9A%84%E5%90%8C%E8%A1%8C%E6%88%96%E5%90%8C%E5%88%97%E7%9F%B3%E5%A4%B4.md) | 深度优先搜索、并查集、图 | 中等 | -| 0953 | [验证外星语词典](https://leetcode.cn/problems/verifying-an-alien-dictionary/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0953.%20%E9%AA%8C%E8%AF%81%E5%A4%96%E6%98%9F%E8%AF%AD%E8%AF%8D%E5%85%B8.md) | 数组、哈希表、字符串 | 简单 | -| 0958 | [二叉树的完全性检验](https://leetcode.cn/problems/check-completeness-of-a-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0958.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%AE%8C%E5%85%A8%E6%80%A7%E6%A3%80%E9%AA%8C.md) | 树、广度优先搜索、二叉树 | 中等 | -| 0959 | [由斜杠划分区域](https://leetcode.cn/problems/regions-cut-by-slashes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0959.%20%E7%94%B1%E6%96%9C%E6%9D%A0%E5%88%92%E5%88%86%E5%8C%BA%E5%9F%9F.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 0968 | [监控二叉树](https://leetcode.cn/problems/binary-tree-cameras/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0968.%20%E7%9B%91%E6%8E%A7%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | -| 0973 | [最接近原点的 K 个点](https://leetcode.cn/problems/k-closest-points-to-origin/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0973.%20%E6%9C%80%E6%8E%A5%E8%BF%91%E5%8E%9F%E7%82%B9%E7%9A%84%20K%20%E4%B8%AA%E7%82%B9.md) | 几何、数组、数学、分治、快速选择、排序、堆（优先队列） | 中等 | -| 0974 | [和可被 K 整除的子数组](https://leetcode.cn/problems/subarray-sums-divisible-by-k/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0974.%20%E5%92%8C%E5%8F%AF%E8%A2%AB%20K%20%E6%95%B4%E9%99%A4%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、哈希表、前缀和 | 中等 | -| 0976 | [三角形的最大周长](https://leetcode.cn/problems/largest-perimeter-triangle/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0976.%20%E4%B8%89%E8%A7%92%E5%BD%A2%E7%9A%84%E6%9C%80%E5%A4%A7%E5%91%A8%E9%95%BF.md) | 贪心、数组、数学、排序 | 简单 | -| 0977 | [有序数组的平方](https://leetcode.cn/problems/squares-of-a-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0977.%20%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E7%9A%84%E5%B9%B3%E6%96%B9.md) | 数组、双指针、排序 | 简单 | -| 0978 | [最长湍流子数组](https://leetcode.cn/problems/longest-turbulent-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0978.%20%E6%9C%80%E9%95%BF%E6%B9%8D%E6%B5%81%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、动态规划、滑动窗口 | 中等 | -| 0982 | [按位与为零的三元组](https://leetcode.cn/problems/triples-with-bitwise-and-equal-to-zero/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0982.%20%E6%8C%89%E4%BD%8D%E4%B8%8E%E4%B8%BA%E9%9B%B6%E7%9A%84%E4%B8%89%E5%85%83%E7%BB%84.md) | 位运算、数组、哈希表 | 困难 | -| 0990 | [等式方程的可满足性](https://leetcode.cn/problems/satisfiability-of-equality-equations/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0990.%20%E7%AD%89%E5%BC%8F%E6%96%B9%E7%A8%8B%E7%9A%84%E5%8F%AF%E6%BB%A1%E8%B6%B3%E6%80%A7.md) | 并查集、图、数组、字符串 | 中等 | -| 0992 | [K 个不同整数的子数组](https://leetcode.cn/problems/subarrays-with-k-different-integers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0992.%20K%20%E4%B8%AA%E4%B8%8D%E5%90%8C%E6%95%B4%E6%95%B0%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、哈希表、计数、滑动窗口 | 困难 | -| 0993 | [二叉树的堂兄弟节点](https://leetcode.cn/problems/cousins-in-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0993.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%A0%82%E5%85%84%E5%BC%9F%E8%8A%82%E7%82%B9.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0995 | [K 连续位的最小翻转次数](https://leetcode.cn/problems/minimum-number-of-k-consecutive-bit-flips/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0995.%20K%20%E8%BF%9E%E7%BB%AD%E4%BD%8D%E7%9A%84%E6%9C%80%E5%B0%8F%E7%BF%BB%E8%BD%AC%E6%AC%A1%E6%95%B0.md) | 位运算、队列、数组、前缀和、滑动窗口 | 困难 | -| 0999 | [可以被一步捕获的棋子数](https://leetcode.cn/problems/available-captures-for-rook/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0999.%20%E5%8F%AF%E4%BB%A5%E8%A2%AB%E4%B8%80%E6%AD%A5%E6%8D%95%E8%8E%B7%E7%9A%84%E6%A3%8B%E5%AD%90%E6%95%B0.md) | 数组、矩阵、模拟 | 简单 | -| 1000 | [合并石头的最低成本](https://leetcode.cn/problems/minimum-cost-to-merge-stones/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1000.%20%E5%90%88%E5%B9%B6%E7%9F%B3%E5%A4%B4%E7%9A%84%E6%9C%80%E4%BD%8E%E6%88%90%E6%9C%AC.md) | 数组、动态规划、前缀和 | 困难 | -| 1002 | [查找共用字符](https://leetcode.cn/problems/find-common-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1002.%20%E6%9F%A5%E6%89%BE%E5%85%B1%E7%94%A8%E5%AD%97%E7%AC%A6.md) | 数组、哈希表、字符串 | 简单 | -| 1004 | [最大连续1的个数 III](https://leetcode.cn/problems/max-consecutive-ones-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1004.%20%E6%9C%80%E5%A4%A7%E8%BF%9E%E7%BB%AD1%E7%9A%84%E4%B8%AA%E6%95%B0%20III.md) | 数组、二分查找、前缀和、滑动窗口 | 中等 | -| 1005 | [K 次取反后最大化的数组和](https://leetcode.cn/problems/maximize-sum-of-array-after-k-negations/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1005.%20K%20%E6%AC%A1%E5%8F%96%E5%8F%8D%E5%90%8E%E6%9C%80%E5%A4%A7%E5%8C%96%E7%9A%84%E6%95%B0%E7%BB%84%E5%92%8C.md) | 贪心、数组、排序 | 简单 | -| 1008 | [前序遍历构造二叉搜索树](https://leetcode.cn/problems/construct-binary-search-tree-from-preorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1008.%20%E5%89%8D%E5%BA%8F%E9%81%8D%E5%8E%86%E6%9E%84%E9%80%A0%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md) | 栈、树、二叉搜索树、数组、二叉树、单调栈 | 中等 | -| 1009 | [十进制整数的反码](https://leetcode.cn/problems/complement-of-base-10-integer/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1009.%20%E5%8D%81%E8%BF%9B%E5%88%B6%E6%95%B4%E6%95%B0%E7%9A%84%E5%8F%8D%E7%A0%81.md) | 位运算 | 简单 | -| 1011 | [在 D 天内送达包裹的能力](https://leetcode.cn/problems/capacity-to-ship-packages-within-d-days/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1011.%20%E5%9C%A8%20D%20%E5%A4%A9%E5%86%85%E9%80%81%E8%BE%BE%E5%8C%85%E8%A3%B9%E7%9A%84%E8%83%BD%E5%8A%9B.md) | 数组、二分查找 | 中等 | -| 1012 | [至少有 1 位重复的数字](https://leetcode.cn/problems/numbers-with-repeated-digits/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1012.%20%E8%87%B3%E5%B0%91%E6%9C%89%201%20%E4%BD%8D%E9%87%8D%E5%A4%8D%E7%9A%84%E6%95%B0%E5%AD%97.md) | 数学、动态规划 | 困难 | -| 1014 | [最佳观光组合](https://leetcode.cn/problems/best-sightseeing-pair/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1014.%20%E6%9C%80%E4%BD%B3%E8%A7%82%E5%85%89%E7%BB%84%E5%90%88.md) | 数组、动态规划 | 中等 | -| 1020 | [飞地的数量](https://leetcode.cn/problems/number-of-enclaves/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1020.%20%E9%A3%9E%E5%9C%B0%E7%9A%84%E6%95%B0%E9%87%8F.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | -| 1021 | [删除最外层的括号](https://leetcode.cn/problems/remove-outermost-parentheses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1021.%20%E5%88%A0%E9%99%A4%E6%9C%80%E5%A4%96%E5%B1%82%E7%9A%84%E6%8B%AC%E5%8F%B7.md) | 栈、字符串 | 简单 | -| 1023 | [驼峰式匹配](https://leetcode.cn/problems/camelcase-matching/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1023.%20%E9%A9%BC%E5%B3%B0%E5%BC%8F%E5%8C%B9%E9%85%8D.md) | 字典树、双指针、字符串、字符串匹配 | 中等 | -| 1025 | [除数博弈](https://leetcode.cn/problems/divisor-game/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1025.%20%E9%99%A4%E6%95%B0%E5%8D%9A%E5%BC%88.md) | 脑筋急转弯、数学、动态规划、博弈 | 简单 | -| 1028 | [从先序遍历还原二叉树](https://leetcode.cn/problems/recover-a-tree-from-preorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1028.%20%E4%BB%8E%E5%85%88%E5%BA%8F%E9%81%8D%E5%8E%86%E8%BF%98%E5%8E%9F%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、字符串、二叉树 | 困难 | -| 1029 | [两地调度](https://leetcode.cn/problems/two-city-scheduling/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1029.%20%E4%B8%A4%E5%9C%B0%E8%B0%83%E5%BA%A6.md) | 贪心、数组、排序 | 中等 | -| 1034 | [边界着色](https://leetcode.cn/problems/coloring-a-border/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1034.%20%E8%BE%B9%E7%95%8C%E7%9D%80%E8%89%B2.md) | 深度优先搜索、广度优先搜索、数组、矩阵 | 中等 | -| 1035 | [不相交的线](https://leetcode.cn/problems/uncrossed-lines/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1035.%20%E4%B8%8D%E7%9B%B8%E4%BA%A4%E7%9A%84%E7%BA%BF.md) | 数组、动态规划 | 中等 | -| 1037 | [有效的回旋镖](https://leetcode.cn/problems/valid-boomerang/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1037.%20%E6%9C%89%E6%95%88%E7%9A%84%E5%9B%9E%E6%97%8B%E9%95%96.md) | 几何、数组、数学 | 简单 | -| 1038 | [从二叉搜索树到更大和树](https://leetcode.cn/problems/binary-search-tree-to-greater-sum-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1038.%20%E4%BB%8E%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E5%88%B0%E6%9B%B4%E5%A4%A7%E5%92%8C%E6%A0%91.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | -| 1039 | [多边形三角剖分的最低得分](https://leetcode.cn/problems/minimum-score-triangulation-of-polygon/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1039.%20%E5%A4%9A%E8%BE%B9%E5%BD%A2%E4%B8%89%E8%A7%92%E5%89%96%E5%88%86%E7%9A%84%E6%9C%80%E4%BD%8E%E5%BE%97%E5%88%86.md) | 数组、动态规划 | 中等 | -| 1041 | [困于环中的机器人](https://leetcode.cn/problems/robot-bounded-in-circle/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1041.%20%E5%9B%B0%E4%BA%8E%E7%8E%AF%E4%B8%AD%E7%9A%84%E6%9C%BA%E5%99%A8%E4%BA%BA.md) | 数学、字符串、模拟 | 中等 | -| 1047 | [删除字符串中的所有相邻重复项](https://leetcode.cn/problems/remove-all-adjacent-duplicates-in-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1047.%20%E5%88%A0%E9%99%A4%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E6%89%80%E6%9C%89%E7%9B%B8%E9%82%BB%E9%87%8D%E5%A4%8D%E9%A1%B9.md) | 栈、字符串 | 简单 | -| 1049 | [最后一块石头的重量 II](https://leetcode.cn/problems/last-stone-weight-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1049.%20%E6%9C%80%E5%90%8E%E4%B8%80%E5%9D%97%E7%9F%B3%E5%A4%B4%E7%9A%84%E9%87%8D%E9%87%8F%20II.md) | 数组、动态规划 | 中等 | -| 1051 | [高度检查器](https://leetcode.cn/problems/height-checker/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1051.%20%E9%AB%98%E5%BA%A6%E6%A3%80%E6%9F%A5%E5%99%A8.md) | 数组、计数排序、排序 | 简单 | -| 1052 | [爱生气的书店老板](https://leetcode.cn/problems/grumpy-bookstore-owner/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1052.%20%E7%88%B1%E7%94%9F%E6%B0%94%E7%9A%84%E4%B9%A6%E5%BA%97%E8%80%81%E6%9D%BF.md) | 数组、滑动窗口 | 中等 | -| 1065 | [字符串的索引对](https://leetcode.cn/problems/index-pairs-of-a-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1065.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E7%B4%A2%E5%BC%95%E5%AF%B9.md) | 字典树、数组、字符串、排序 | 简单 | -| 1079 | [活字印刷](https://leetcode.cn/problems/letter-tile-possibilities/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1079.%20%E6%B4%BB%E5%AD%97%E5%8D%B0%E5%88%B7.md) | 哈希表、字符串、回溯、计数 | 中等 | -| 1081 | [不同字符的最小子序列](https://leetcode.cn/problems/smallest-subsequence-of-distinct-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1081.%20%E4%B8%8D%E5%90%8C%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E5%B0%8F%E5%AD%90%E5%BA%8F%E5%88%97.md) | 栈、贪心、字符串、单调栈 | 中等 | -| 1089 | [复写零](https://leetcode.cn/problems/duplicate-zeros/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1089.%20%E5%A4%8D%E5%86%99%E9%9B%B6.md) | 数组、双指针 | 简单 | -| 1091 | [二进制矩阵中的最短路径](https://leetcode.cn/problems/shortest-path-in-binary-matrix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1091.%20%E4%BA%8C%E8%BF%9B%E5%88%B6%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84.md) | 广度优先搜索、数组、矩阵 | 中等 | -| 1095 | [山脉数组中查找目标值](https://leetcode.cn/problems/find-in-mountain-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1095.%20%E5%B1%B1%E8%84%89%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9F%A5%E6%89%BE%E7%9B%AE%E6%A0%87%E5%80%BC.md) | 数组、二分查找、交互 | 困难 | -| 1099 | [小于 K 的两数之和](https://leetcode.cn/problems/two-sum-less-than-k/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1099.%20%E5%B0%8F%E4%BA%8E%20K%20%E7%9A%84%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、双指针、二分查找、排序 | 简单 | -| 1100 | [长度为 K 的无重复字符子串](https://leetcode.cn/problems/find-k-length-substrings-with-no-repeated-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1100.%20%E9%95%BF%E5%BA%A6%E4%B8%BA%20K%20%E7%9A%84%E6%97%A0%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E5%AD%90%E4%B8%B2.md) | 哈希表、字符串、滑动窗口 | 中等 | -| 1103 | [分糖果 II](https://leetcode.cn/problems/distribute-candies-to-people/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1103.%20%E5%88%86%E7%B3%96%E6%9E%9C%20II.md) | 数学、模拟 | 简单 | -| 1108 | [IP 地址无效化](https://leetcode.cn/problems/defanging-an-ip-address/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1108.%20IP%20%E5%9C%B0%E5%9D%80%E6%97%A0%E6%95%88%E5%8C%96.md) | 字符串 | 简单 | -| 1109 | [航班预订统计](https://leetcode.cn/problems/corporate-flight-bookings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1109.%20%E8%88%AA%E7%8F%AD%E9%A2%84%E8%AE%A2%E7%BB%9F%E8%AE%A1.md) | 数组、前缀和 | 中等 | -| 1110 | [删点成林](https://leetcode.cn/problems/delete-nodes-and-return-forest/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1110.%20%E5%88%A0%E7%82%B9%E6%88%90%E6%9E%97.md) | 树、深度优先搜索、数组、哈希表、二叉树 | 中等 | -| 1122 | [数组的相对排序](https://leetcode.cn/problems/relative-sort-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1122.%20%E6%95%B0%E7%BB%84%E7%9A%84%E7%9B%B8%E5%AF%B9%E6%8E%92%E5%BA%8F.md) | 数组、哈希表、计数排序、排序 | 简单 | -| 1136 | [并行课程](https://leetcode.cn/problems/parallel-courses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1136.%20%E5%B9%B6%E8%A1%8C%E8%AF%BE%E7%A8%8B.md) | 图、拓扑排序 | 中等 | -| 1137 | [第 N 个泰波那契数](https://leetcode.cn/problems/n-th-tribonacci-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1137.%20%E7%AC%AC%20N%20%E4%B8%AA%E6%B3%B0%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0.md) | 记忆化搜索、数学、动态规划 | 简单 | -| 1143 | [最长公共子序列](https://leetcode.cn/problems/longest-common-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1143.%20%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%AD%90%E5%BA%8F%E5%88%97.md) | 字符串、动态规划 | 中等 | -| 1151 | [最少交换次数来组合所有的 1](https://leetcode.cn/problems/minimum-swaps-to-group-all-1s-together/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1151.%20%E6%9C%80%E5%B0%91%E4%BA%A4%E6%8D%A2%E6%AC%A1%E6%95%B0%E6%9D%A5%E7%BB%84%E5%90%88%E6%89%80%E6%9C%89%E7%9A%84%201.md) | 数组、滑动窗口 | 中等 | -| 1155 | [掷骰子等于目标和的方法数](https://leetcode.cn/problems/number-of-dice-rolls-with-target-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1155.%20%E6%8E%B7%E9%AA%B0%E5%AD%90%E7%AD%89%E4%BA%8E%E7%9B%AE%E6%A0%87%E5%92%8C%E7%9A%84%E6%96%B9%E6%B3%95%E6%95%B0.md) | 动态规划 | 中等 | -| 1161 | [最大层内元素和](https://leetcode.cn/problems/maximum-level-sum-of-a-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1161.%20%E6%9C%80%E5%A4%A7%E5%B1%82%E5%86%85%E5%85%83%E7%B4%A0%E5%92%8C.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | -| 1176 | [健身计划评估](https://leetcode.cn/problems/diet-plan-performance/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1176.%20%E5%81%A5%E8%BA%AB%E8%AE%A1%E5%88%92%E8%AF%84%E4%BC%B0.md) | 数组、滑动窗口 | 简单 | -| 1184 | [公交站间的距离](https://leetcode.cn/problems/distance-between-bus-stops/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1184.%20%E5%85%AC%E4%BA%A4%E7%AB%99%E9%97%B4%E7%9A%84%E8%B7%9D%E7%A6%BB.md) | 数组 | 简单 | -| 1202 | [交换字符串中的元素](https://leetcode.cn/problems/smallest-string-with-swaps/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1202.%20%E4%BA%A4%E6%8D%A2%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%85%83%E7%B4%A0.md) | 深度优先搜索、广度优先搜索、并查集、哈希表、字符串 | 中等 | -| 1208 | [尽可能使字符串相等](https://leetcode.cn/problems/get-equal-substrings-within-budget/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1208.%20%E5%B0%BD%E5%8F%AF%E8%83%BD%E4%BD%BF%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E7%AD%89.md) | 字符串、二分查找、前缀和、滑动窗口 | 中等 | -| 1217 | [玩筹码](https://leetcode.cn/problems/minimum-cost-to-move-chips-to-the-same-position/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1217.%20%E7%8E%A9%E7%AD%B9%E7%A0%81.md) | 贪心、数组、数学 | 简单 | -| 1220 | [统计元音字母序列的数目](https://leetcode.cn/problems/count-vowels-permutation/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1220.%20%E7%BB%9F%E8%AE%A1%E5%85%83%E9%9F%B3%E5%AD%97%E6%AF%8D%E5%BA%8F%E5%88%97%E7%9A%84%E6%95%B0%E7%9B%AE.md) | 动态规划 | 困难 | -| 1227 | [飞机座位分配概率](https://leetcode.cn/problems/airplane-seat-assignment-probability/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1227.%20%E9%A3%9E%E6%9C%BA%E5%BA%A7%E4%BD%8D%E5%88%86%E9%85%8D%E6%A6%82%E7%8E%87.md) | 脑筋急转弯、数学、动态规划、概率与统计 | 中等 | -| 1229 | [安排会议日程](https://leetcode.cn/problems/meeting-scheduler/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1229.%20%E5%AE%89%E6%8E%92%E4%BC%9A%E8%AE%AE%E6%97%A5%E7%A8%8B.md) | 数组、双指针、排序 | 中等 | -| 1232 | [缀点成线](https://leetcode.cn/problems/check-if-it-is-a-straight-line/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1232.%20%E7%BC%80%E7%82%B9%E6%88%90%E7%BA%BF.md) | 几何、数组、数学 | 简单 | -| 1245 | [树的直径](https://leetcode.cn/problems/tree-diameter/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1245.%20%E6%A0%91%E7%9A%84%E7%9B%B4%E5%BE%84.md) | 树、深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | -| 1247 | [交换字符使得字符串相同](https://leetcode.cn/problems/minimum-swaps-to-make-strings-equal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1247.%20%E4%BA%A4%E6%8D%A2%E5%AD%97%E7%AC%A6%E4%BD%BF%E5%BE%97%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E5%90%8C.md) | 贪心、数学、字符串 | 中等 | -| 1253 | [重构 2 行二进制矩阵](https://leetcode.cn/problems/reconstruct-a-2-row-binary-matrix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1253.%20%E9%87%8D%E6%9E%84%202%20%E8%A1%8C%E4%BA%8C%E8%BF%9B%E5%88%B6%E7%9F%A9%E9%98%B5.md) | 贪心、数组、矩阵 | 中等 | -| 1254 | [统计封闭岛屿的数目](https://leetcode.cn/problems/number-of-closed-islands/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1254.%20%E7%BB%9F%E8%AE%A1%E5%B0%81%E9%97%AD%E5%B2%9B%E5%B1%BF%E7%9A%84%E6%95%B0%E7%9B%AE.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | -| 1261 | [在受污染的二叉树中查找元素](https://leetcode.cn/problems/find-elements-in-a-contaminated-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1261.%20%E5%9C%A8%E5%8F%97%E6%B1%A1%E6%9F%93%E7%9A%84%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E6%9F%A5%E6%89%BE%E5%85%83%E7%B4%A0.md) | 树、深度优先搜索、广度优先搜索、设计、哈希表、二叉树 | 中等 | -| 1266 | [访问所有点的最小时间](https://leetcode.cn/problems/minimum-time-visiting-all-points/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1266.%20%E8%AE%BF%E9%97%AE%E6%89%80%E6%9C%89%E7%82%B9%E7%9A%84%E6%9C%80%E5%B0%8F%E6%97%B6%E9%97%B4.md) | 几何、数组、数学 | 简单 | -| 1268 | [搜索推荐系统](https://leetcode.cn/problems/search-suggestions-system/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1268.%20%E6%90%9C%E7%B4%A2%E6%8E%A8%E8%8D%90%E7%B3%BB%E7%BB%9F.md) | 字典树、数组、字符串 | 中等 | -| 1281 | [整数的各位积和之差](https://leetcode.cn/problems/subtract-the-product-and-sum-of-digits-of-an-integer/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1281.%20%E6%95%B4%E6%95%B0%E7%9A%84%E5%90%84%E4%BD%8D%E7%A7%AF%E5%92%8C%E4%B9%8B%E5%B7%AE.md) | 数学 | 简单 | -| 1296 | [划分数组为连续数字的集合](https://leetcode.cn/problems/divide-array-in-sets-of-k-consecutive-numbers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1296.%20%E5%88%92%E5%88%86%E6%95%B0%E7%BB%84%E4%B8%BA%E8%BF%9E%E7%BB%AD%E6%95%B0%E5%AD%97%E7%9A%84%E9%9B%86%E5%90%88.md) | 贪心、数组、哈希表、排序 | 中等 | -| 1300 | [转变数组后最接近目标值的数组和](https://leetcode.cn/problems/sum-of-mutated-array-closest-to-target/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1300.%20%E8%BD%AC%E5%8F%98%E6%95%B0%E7%BB%84%E5%90%8E%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9B%AE%E6%A0%87%E5%80%BC%E7%9A%84%E6%95%B0%E7%BB%84%E5%92%8C.md) | 数组、二分查找、排序 | 中等 | -| 1305 | [两棵二叉搜索树中的所有元素](https://leetcode.cn/problems/all-elements-in-two-binary-search-trees/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1305.%20%E4%B8%A4%E6%A3%B5%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E6%89%80%E6%9C%89%E5%85%83%E7%B4%A0.md) | 树、深度优先搜索、二叉搜索树、二叉树、排序 | 中等 | -| 1310 | [子数组异或查询](https://leetcode.cn/problems/xor-queries-of-a-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1310.%20%E5%AD%90%E6%95%B0%E7%BB%84%E5%BC%82%E6%88%96%E6%9F%A5%E8%AF%A2.md) | 位运算、数组、前缀和 | 中等 | -| 1313 | [解压缩编码列表](https://leetcode.cn/problems/decompress-run-length-encoded-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1313.%20%E8%A7%A3%E5%8E%8B%E7%BC%A9%E7%BC%96%E7%A0%81%E5%88%97%E8%A1%A8.md) | 数组 | 简单 | -| 1317 | [将整数转换为两个无零整数的和](https://leetcode.cn/problems/convert-integer-to-the-sum-of-two-no-zero-integers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1317.%20%E5%B0%86%E6%95%B4%E6%95%B0%E8%BD%AC%E6%8D%A2%E4%B8%BA%E4%B8%A4%E4%B8%AA%E6%97%A0%E9%9B%B6%E6%95%B4%E6%95%B0%E7%9A%84%E5%92%8C.md) | 数学 | 简单 | -| 1319 | [连通网络的操作次数](https://leetcode.cn/problems/number-of-operations-to-make-network-connected/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1319.%20%E8%BF%9E%E9%80%9A%E7%BD%91%E7%BB%9C%E7%9A%84%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 1324 | [竖直打印单词](https://leetcode.cn/problems/print-words-vertically/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1324.%20%E7%AB%96%E7%9B%B4%E6%89%93%E5%8D%B0%E5%8D%95%E8%AF%8D.md) | 数组、字符串、模拟 | 中等 | -| 1338 | [数组大小减半](https://leetcode.cn/problems/reduce-array-size-to-the-half/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1338.%20%E6%95%B0%E7%BB%84%E5%A4%A7%E5%B0%8F%E5%87%8F%E5%8D%8A.md) | 贪心、数组、哈希表、排序、堆（优先队列） | 中等 | -| 1343 | [大小为 K 且平均值大于等于阈值的子数组数目](https://leetcode.cn/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1343.%20%E5%A4%A7%E5%B0%8F%E4%B8%BA%20K%20%E4%B8%94%E5%B9%B3%E5%9D%87%E5%80%BC%E5%A4%A7%E4%BA%8E%E7%AD%89%E4%BA%8E%E9%98%88%E5%80%BC%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84%E6%95%B0%E7%9B%AE.md) | 数组、滑动窗口 | 中等 | -| 1344 | [时钟指针的夹角](https://leetcode.cn/problems/angle-between-hands-of-a-clock/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1344.%20%E6%97%B6%E9%92%9F%E6%8C%87%E9%92%88%E7%9A%84%E5%A4%B9%E8%A7%92.md) | 数学 | 中等 | -| 1347 | [制造字母异位词的最小步骤数](https://leetcode.cn/problems/minimum-number-of-steps-to-make-two-strings-anagram/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1347.%20%E5%88%B6%E9%80%A0%E5%AD%97%E6%AF%8D%E5%BC%82%E4%BD%8D%E8%AF%8D%E7%9A%84%E6%9C%80%E5%B0%8F%E6%AD%A5%E9%AA%A4%E6%95%B0.md) | 哈希表、字符串、计数 | 中等 | -| 1349 | [参加考试的最大学生数](https://leetcode.cn/problems/maximum-students-taking-exam/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1349.%20%E5%8F%82%E5%8A%A0%E8%80%83%E8%AF%95%E7%9A%84%E6%9C%80%E5%A4%A7%E5%AD%A6%E7%94%9F%E6%95%B0.md) | 位运算、数组、动态规划、状态压缩、矩阵 | 困难 | -| 1358 | [包含所有三种字符的子字符串数目](https://leetcode.cn/problems/number-of-substrings-containing-all-three-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1358.%20%E5%8C%85%E5%90%AB%E6%89%80%E6%9C%89%E4%B8%89%E7%A7%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%95%B0%E7%9B%AE.md) | 哈希表、字符串、滑动窗口 | 中等 | -| 1362 | [最接近的因数](https://leetcode.cn/problems/closest-divisors/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1362.%20%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9A%84%E5%9B%A0%E6%95%B0.md) | 数学 | 中等 | -| 1381 | [设计一个支持增量操作的栈](https://leetcode.cn/problems/design-a-stack-with-increment-operation/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1381.%20%E8%AE%BE%E8%AE%A1%E4%B8%80%E4%B8%AA%E6%94%AF%E6%8C%81%E5%A2%9E%E9%87%8F%E6%93%8D%E4%BD%9C%E7%9A%84%E6%A0%88.md) | 栈、设计、数组 | 中等 | -| 1400 | [构造 K 个回文字符串](https://leetcode.cn/problems/construct-k-palindrome-strings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1400.%20%E6%9E%84%E9%80%A0%20K%20%E4%B8%AA%E5%9B%9E%E6%96%87%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 贪心、哈希表、字符串、计数 | 中等 | -| 1408 | [数组中的字符串匹配](https://leetcode.cn/problems/string-matching-in-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1408.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%8C%B9%E9%85%8D.md) | 数组、字符串、字符串匹配 | 简单 | -| 1422 | [分割字符串的最大得分](https://leetcode.cn/problems/maximum-score-after-splitting-a-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1422.%20%E5%88%86%E5%89%B2%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%9C%80%E5%A4%A7%E5%BE%97%E5%88%86.md) | 字符串 | 简单 | -| 1423 | [可获得的最大点数](https://leetcode.cn/problems/maximum-points-you-can-obtain-from-cards/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1423.%20%E5%8F%AF%E8%8E%B7%E5%BE%97%E7%9A%84%E6%9C%80%E5%A4%A7%E7%82%B9%E6%95%B0.md) | 数组、前缀和、滑动窗口 | 中等 | -| 1438 | [绝对差不超过限制的最长连续子数组](https://leetcode.cn/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1438.%20%E7%BB%9D%E5%AF%B9%E5%B7%AE%E4%B8%8D%E8%B6%85%E8%BF%87%E9%99%90%E5%88%B6%E7%9A%84%E6%9C%80%E9%95%BF%E8%BF%9E%E7%BB%AD%E5%AD%90%E6%95%B0%E7%BB%84.md) | 队列、数组、有序集合、滑动窗口、单调队列、堆（优先队列） | 中等 | -| 1446 | [连续字符](https://leetcode.cn/problems/consecutive-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1446.%20%E8%BF%9E%E7%BB%AD%E5%AD%97%E7%AC%A6.md) | 字符串 | 简单 | -| 1447 | [最简分数](https://leetcode.cn/problems/simplified-fractions/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1447.%20%E6%9C%80%E7%AE%80%E5%88%86%E6%95%B0.md) | 数学、字符串、数论 | 中等 | -| 1449 | [数位成本和为目标值的最大数字](https://leetcode.cn/problems/form-largest-integer-with-digits-that-add-up-to-target/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1449.%20%E6%95%B0%E4%BD%8D%E6%88%90%E6%9C%AC%E5%92%8C%E4%B8%BA%E7%9B%AE%E6%A0%87%E5%80%BC%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E5%AD%97.md) | 数组、动态规划 | 困难 | -| 1450 | [在既定时间做作业的学生人数](https://leetcode.cn/problems/number-of-students-doing-homework-at-a-given-time/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1450.%20%E5%9C%A8%E6%97%A2%E5%AE%9A%E6%97%B6%E9%97%B4%E5%81%9A%E4%BD%9C%E4%B8%9A%E7%9A%84%E5%AD%A6%E7%94%9F%E4%BA%BA%E6%95%B0.md) | 数组 | 简单 | -| 1451 | [重新排列句子中的单词](https://leetcode.cn/problems/rearrange-words-in-a-sentence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1451.%20%E9%87%8D%E6%96%B0%E6%8E%92%E5%88%97%E5%8F%A5%E5%AD%90%E4%B8%AD%E7%9A%84%E5%8D%95%E8%AF%8D.md) | 字符串、排序 | 中等 | -| 1456 | [定长子串中元音的最大数目](https://leetcode.cn/problems/maximum-number-of-vowels-in-a-substring-of-given-length/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1456.%20%E5%AE%9A%E9%95%BF%E5%AD%90%E4%B8%B2%E4%B8%AD%E5%85%83%E9%9F%B3%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E7%9B%AE.md) | 字符串、滑动窗口 | 中等 | -| 1476 | [子矩形查询](https://leetcode.cn/problems/subrectangle-queries/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1476.%20%E5%AD%90%E7%9F%A9%E5%BD%A2%E6%9F%A5%E8%AF%A2.md) | 设计、数组、矩阵 | 中等 | -| 1480 | [一维数组的动态和](https://leetcode.cn/problems/running-sum-of-1d-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1480.%20%E4%B8%80%E7%BB%B4%E6%95%B0%E7%BB%84%E7%9A%84%E5%8A%A8%E6%80%81%E5%92%8C.md) | 数组、前缀和 | 简单 | -| 1482 | [制作 m 束花所需的最少天数](https://leetcode.cn/problems/minimum-number-of-days-to-make-m-bouquets/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1482.%20%E5%88%B6%E4%BD%9C%20m%20%E6%9D%9F%E8%8A%B1%E6%89%80%E9%9C%80%E7%9A%84%E6%9C%80%E5%B0%91%E5%A4%A9%E6%95%B0.md) | 数组、二分查找 | 中等 | -| 1486 | [数组异或操作](https://leetcode.cn/problems/xor-operation-in-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1486.%20%E6%95%B0%E7%BB%84%E5%BC%82%E6%88%96%E6%93%8D%E4%BD%9C.md) | 位运算、数学 | 简单 | -| 1491 | [去掉最低工资和最高工资后的工资平均值](https://leetcode.cn/problems/average-salary-excluding-the-minimum-and-maximum-salary/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1491.%20%E5%8E%BB%E6%8E%89%E6%9C%80%E4%BD%8E%E5%B7%A5%E8%B5%84%E5%92%8C%E6%9C%80%E9%AB%98%E5%B7%A5%E8%B5%84%E5%90%8E%E7%9A%84%E5%B7%A5%E8%B5%84%E5%B9%B3%E5%9D%87%E5%80%BC.md) | 数组、排序 | 简单 | -| 1493 | [删掉一个元素以后全为 1 的最长子数组](https://leetcode.cn/problems/longest-subarray-of-1s-after-deleting-one-element/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1493.%20%E5%88%A0%E6%8E%89%E4%B8%80%E4%B8%AA%E5%85%83%E7%B4%A0%E4%BB%A5%E5%90%8E%E5%85%A8%E4%B8%BA%201%20%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、动态规划、滑动窗口 | 中等 | -| 1496 | [判断路径是否相交](https://leetcode.cn/problems/path-crossing/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1496.%20%E5%88%A4%E6%96%AD%E8%B7%AF%E5%BE%84%E6%98%AF%E5%90%A6%E7%9B%B8%E4%BA%A4.md) | 哈希表、字符串 | 简单 | -| 1502 | [判断能否形成等差数列](https://leetcode.cn/problems/can-make-arithmetic-progression-from-sequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1502.%20%E5%88%A4%E6%96%AD%E8%83%BD%E5%90%A6%E5%BD%A2%E6%88%90%E7%AD%89%E5%B7%AE%E6%95%B0%E5%88%97.md) | 数组、排序 | 简单 | -| 1507 | [转变日期格式](https://leetcode.cn/problems/reformat-date/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1507.%20%E8%BD%AC%E5%8F%98%E6%97%A5%E6%9C%9F%E6%A0%BC%E5%BC%8F.md) | 字符串 | 简单 | -| 1523 | [在区间范围内统计奇数数目](https://leetcode.cn/problems/count-odd-numbers-in-an-interval-range/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1523.%20%E5%9C%A8%E5%8C%BA%E9%97%B4%E8%8C%83%E5%9B%B4%E5%86%85%E7%BB%9F%E8%AE%A1%E5%A5%87%E6%95%B0%E6%95%B0%E7%9B%AE.md) | 数学 | 简单 | -| 1534 | [统计好三元组](https://leetcode.cn/problems/count-good-triplets/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1534.%20%E7%BB%9F%E8%AE%A1%E5%A5%BD%E4%B8%89%E5%85%83%E7%BB%84.md) | 数组、枚举 | 简单 | -| 1547 | [切棍子的最小成本](https://leetcode.cn/problems/minimum-cost-to-cut-a-stick/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1547.%20%E5%88%87%E6%A3%8D%E5%AD%90%E7%9A%84%E6%9C%80%E5%B0%8F%E6%88%90%E6%9C%AC.md) | 数组、动态规划、排序 | 困难 | -| 1551 | [使数组中所有元素相等的最小操作数](https://leetcode.cn/problems/minimum-operations-to-make-array-equal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1551.%20%E4%BD%BF%E6%95%B0%E7%BB%84%E4%B8%AD%E6%89%80%E6%9C%89%E5%85%83%E7%B4%A0%E7%9B%B8%E7%AD%89%E7%9A%84%E6%9C%80%E5%B0%8F%E6%93%8D%E4%BD%9C%E6%95%B0.md) | 数学 | 中等 | -| 1556 | [千位分隔数](https://leetcode.cn/problems/thousand-separator/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1556.%20%E5%8D%83%E4%BD%8D%E5%88%86%E9%9A%94%E6%95%B0.md) | 字符串 | 简单 | -| 1561 | [你可以获得的最大硬币数目](https://leetcode.cn/problems/maximum-number-of-coins-you-can-get/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1561.%20%E4%BD%A0%E5%8F%AF%E4%BB%A5%E8%8E%B7%E5%BE%97%E7%9A%84%E6%9C%80%E5%A4%A7%E7%A1%AC%E5%B8%81%E6%95%B0%E7%9B%AE.md) | 贪心、数组、数学、博弈、排序 | 中等 | -| 1567 | [乘积为正数的最长子数组长度](https://leetcode.cn/problems/maximum-length-of-subarray-with-positive-product/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1567.%20%E4%B9%98%E7%A7%AF%E4%B8%BA%E6%AD%A3%E6%95%B0%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E6%95%B0%E7%BB%84%E9%95%BF%E5%BA%A6.md) | 贪心、数组、动态规划 | 中等 | -| 1582 | [二进制矩阵中的特殊位置](https://leetcode.cn/problems/special-positions-in-a-binary-matrix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1582.%20%E4%BA%8C%E8%BF%9B%E5%88%B6%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E7%89%B9%E6%AE%8A%E4%BD%8D%E7%BD%AE.md) | 数组、矩阵 | 简单 | -| 1584 | [连接所有点的最小费用](https://leetcode.cn/problems/min-cost-to-connect-all-points/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1584.%20%E8%BF%9E%E6%8E%A5%E6%89%80%E6%9C%89%E7%82%B9%E7%9A%84%E6%9C%80%E5%B0%8F%E8%B4%B9%E7%94%A8.md) | 并查集、图、数组、最小生成树 | 中等 | -| 1593 | [拆分字符串使唯一子字符串的数目最大](https://leetcode.cn/problems/split-a-string-into-the-max-number-of-unique-substrings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1593.%20%E6%8B%86%E5%88%86%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%BD%BF%E5%94%AF%E4%B8%80%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%95%B0%E7%9B%AE%E6%9C%80%E5%A4%A7.md) | 哈希表、字符串、回溯 | 中等 | -| 1595 | [连通两组点的最小成本](https://leetcode.cn/problems/minimum-cost-to-connect-two-groups-of-points/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1595.%20%E8%BF%9E%E9%80%9A%E4%B8%A4%E7%BB%84%E7%82%B9%E7%9A%84%E6%9C%80%E5%B0%8F%E6%88%90%E6%9C%AC.md) | 位运算、数组、动态规划、状态压缩、矩阵 | 困难 | -| 1603 | [设计停车系统](https://leetcode.cn/problems/design-parking-system/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1603.%20%E8%AE%BE%E8%AE%A1%E5%81%9C%E8%BD%A6%E7%B3%BB%E7%BB%9F.md) | 设计、计数、模拟 | 简单 | -| 1605 | [给定行和列的和求可行矩阵](https://leetcode.cn/problems/find-valid-matrix-given-row-and-column-sums/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1605.%20%E7%BB%99%E5%AE%9A%E8%A1%8C%E5%92%8C%E5%88%97%E7%9A%84%E5%92%8C%E6%B1%82%E5%8F%AF%E8%A1%8C%E7%9F%A9%E9%98%B5.md) | 贪心、数组、矩阵 | 中等 | -| 1614 | [括号的最大嵌套深度](https://leetcode.cn/problems/maximum-nesting-depth-of-the-parentheses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1614.%20%E6%8B%AC%E5%8F%B7%E7%9A%84%E6%9C%80%E5%A4%A7%E5%B5%8C%E5%A5%97%E6%B7%B1%E5%BA%A6.md) | 栈、字符串 | 简单 | -| 1617 | [统计子树中城市之间最大距离](https://leetcode.cn/problems/count-subtrees-with-max-distance-between-cities/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1617.%20%E7%BB%9F%E8%AE%A1%E5%AD%90%E6%A0%91%E4%B8%AD%E5%9F%8E%E5%B8%82%E4%B9%8B%E9%97%B4%E6%9C%80%E5%A4%A7%E8%B7%9D%E7%A6%BB.md) | 位运算、树、动态规划、状态压缩、枚举 | 困难 | -| 1631 | [最小体力消耗路径](https://leetcode.cn/problems/path-with-minimum-effort/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1631.%20%E6%9C%80%E5%B0%8F%E4%BD%93%E5%8A%9B%E6%B6%88%E8%80%97%E8%B7%AF%E5%BE%84.md) | 深度优先搜索、广度优先搜索、并查集、数组、二分查找、矩阵、堆（优先队列） | 中等 | -| 1641 | [统计字典序元音字符串的数目](https://leetcode.cn/problems/count-sorted-vowel-strings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1641.%20%E7%BB%9F%E8%AE%A1%E5%AD%97%E5%85%B8%E5%BA%8F%E5%85%83%E9%9F%B3%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%95%B0%E7%9B%AE.md) | 数学、动态规划、组合数学 | 中等 | -| 1646 | [获取生成数组中的最大值](https://leetcode.cn/problems/get-maximum-in-generated-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1646.%20%E8%8E%B7%E5%8F%96%E7%94%9F%E6%88%90%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md) | 数组、动态规划、模拟 | 简单 | -| 1647 | [字符频次唯一的最小删除次数](https://leetcode.cn/problems/minimum-deletions-to-make-character-frequencies-unique/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1647.%20%E5%AD%97%E7%AC%A6%E9%A2%91%E6%AC%A1%E5%94%AF%E4%B8%80%E7%9A%84%E6%9C%80%E5%B0%8F%E5%88%A0%E9%99%A4%E6%AC%A1%E6%95%B0.md) | 贪心、哈希表、字符串、排序 | 中等 | -| 1657 | [确定两个字符串是否接近](https://leetcode.cn/problems/determine-if-two-strings-are-close/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1657.%20%E7%A1%AE%E5%AE%9A%E4%B8%A4%E4%B8%AA%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%98%AF%E5%90%A6%E6%8E%A5%E8%BF%91.md) | 哈希表、字符串、排序 | 中等 | -| 1658 | [将 x 减到 0 的最小操作数](https://leetcode.cn/problems/minimum-operations-to-reduce-x-to-zero/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1658.%20%E5%B0%86%20x%20%E5%87%8F%E5%88%B0%200%20%E7%9A%84%E6%9C%80%E5%B0%8F%E6%93%8D%E4%BD%9C%E6%95%B0.md) | 数组、哈希表、二分查找、前缀和、滑动窗口 | 中等 | -| 1672 | [最富有客户的资产总量](https://leetcode.cn/problems/richest-customer-wealth/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1672.%20%E6%9C%80%E5%AF%8C%E6%9C%89%E5%AE%A2%E6%88%B7%E7%9A%84%E8%B5%84%E4%BA%A7%E6%80%BB%E9%87%8F.md) | 数组、矩阵 | 简单 | -| 1695 | [删除子数组的最大得分](https://leetcode.cn/problems/maximum-erasure-value/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1695.%20%E5%88%A0%E9%99%A4%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%BE%97%E5%88%86.md) | 数组、哈希表、滑动窗口 | 中等 | -| 1698 | [字符串的不同子字符串个数](https://leetcode.cn/problems/number-of-distinct-substrings-in-a-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1698.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E4%B8%8D%E5%90%8C%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AA%E6%95%B0.md) | 字典树、字符串、后缀数组、哈希函数、滚动哈希 | 中等 | -| 1710 | [卡车上的最大单元数](https://leetcode.cn/problems/maximum-units-on-a-truck/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1710.%20%E5%8D%A1%E8%BD%A6%E4%B8%8A%E7%9A%84%E6%9C%80%E5%A4%A7%E5%8D%95%E5%85%83%E6%95%B0.md) | 贪心、数组、排序 | 简单 | -| 1716 | [计算力扣银行的钱](https://leetcode.cn/problems/calculate-money-in-leetcode-bank/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1716.%20%E8%AE%A1%E7%AE%97%E5%8A%9B%E6%89%A3%E9%93%B6%E8%A1%8C%E7%9A%84%E9%92%B1.md) | 数学 | 简单 | -| 1720 | [解码异或后的数组](https://leetcode.cn/problems/decode-xored-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1720.%20%E8%A7%A3%E7%A0%81%E5%BC%82%E6%88%96%E5%90%8E%E7%9A%84%E6%95%B0%E7%BB%84.md) | 位运算、数组 | 简单 | -| 1726 | [同积元组](https://leetcode.cn/problems/tuple-with-same-product/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1726.%20%E5%90%8C%E7%A7%AF%E5%85%83%E7%BB%84.md) | 数组、哈希表 | 中等 | -| 1736 | [替换隐藏数字得到的最晚时间](https://leetcode.cn/problems/latest-time-by-replacing-hidden-digits/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1736.%20%E6%9B%BF%E6%8D%A2%E9%9A%90%E8%97%8F%E6%95%B0%E5%AD%97%E5%BE%97%E5%88%B0%E7%9A%84%E6%9C%80%E6%99%9A%E6%97%B6%E9%97%B4.md) | 贪心、字符串 | 简单 | -| 1742 | [盒子中小球的最大数量](https://leetcode.cn/problems/maximum-number-of-balls-in-a-box/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1742.%20%E7%9B%92%E5%AD%90%E4%B8%AD%E5%B0%8F%E7%90%83%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E9%87%8F.md) | 哈希表、数学、计数 | 简单 | -| 1749 | [任意子数组和的绝对值的最大值](https://leetcode.cn/problems/maximum-absolute-sum-of-any-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1749.%20%E4%BB%BB%E6%84%8F%E5%AD%90%E6%95%B0%E7%BB%84%E5%92%8C%E7%9A%84%E7%BB%9D%E5%AF%B9%E5%80%BC%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md) | 数组、动态规划 | 中等 | -| 1763 | [最长的美好子字符串](https://leetcode.cn/problems/longest-nice-substring/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1763.%20%E6%9C%80%E9%95%BF%E7%9A%84%E7%BE%8E%E5%A5%BD%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 位运算、哈希表、字符串、分治、滑动窗口 | 简单 | -| 1779 | [找到最近的有相同 X 或 Y 坐标的点](https://leetcode.cn/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1779.%20%E6%89%BE%E5%88%B0%E6%9C%80%E8%BF%91%E7%9A%84%E6%9C%89%E7%9B%B8%E5%90%8C%20X%20%E6%88%96%20Y%20%E5%9D%90%E6%A0%87%E7%9A%84%E7%82%B9.md) | 数组 | 简单 | -| 1790 | [仅执行一次字符串交换能否使两个字符串相等](https://leetcode.cn/problems/check-if-one-string-swap-can-make-strings-equal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1790.%20%E4%BB%85%E6%89%A7%E8%A1%8C%E4%B8%80%E6%AC%A1%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%BA%A4%E6%8D%A2%E8%83%BD%E5%90%A6%E4%BD%BF%E4%B8%A4%E4%B8%AA%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E7%AD%89.md) | 哈希表、字符串、计数 | 简单 | -| 1791 | [找出星型图的中心节点](https://leetcode.cn/problems/find-center-of-star-graph/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1791.%20%E6%89%BE%E5%87%BA%E6%98%9F%E5%9E%8B%E5%9B%BE%E7%9A%84%E4%B8%AD%E5%BF%83%E8%8A%82%E7%82%B9.md) | 图 | 简单 | -| 1822 | [数组元素积的符号](https://leetcode.cn/problems/sign-of-the-product-of-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1822.%20%E6%95%B0%E7%BB%84%E5%85%83%E7%B4%A0%E7%A7%AF%E7%9A%84%E7%AC%A6%E5%8F%B7.md) | 数组、数学 | 简单 | -| 1827 | [最少操作使数组递增](https://leetcode.cn/problems/minimum-operations-to-make-the-array-increasing/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1827.%20%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E4%BD%BF%E6%95%B0%E7%BB%84%E9%80%92%E5%A2%9E.md) | 贪心、数组 | 简单 | -| 1833 | [雪糕的最大数量](https://leetcode.cn/problems/maximum-ice-cream-bars/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1833.%20%E9%9B%AA%E7%B3%95%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E9%87%8F.md) | 贪心、数组、排序 | 中等 | -| 1844 | [将所有数字用字符替换](https://leetcode.cn/problems/replace-all-digits-with-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1844.%20%E5%B0%86%E6%89%80%E6%9C%89%E6%95%B0%E5%AD%97%E7%94%A8%E5%AD%97%E7%AC%A6%E6%9B%BF%E6%8D%A2.md) | 字符串 | 简单 | -| 1858 | [包含所有前缀的最长单词](https://leetcode.cn/problems/longest-word-with-all-prefixes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1858.%20%E5%8C%85%E5%90%AB%E6%89%80%E6%9C%89%E5%89%8D%E7%BC%80%E7%9A%84%E6%9C%80%E9%95%BF%E5%8D%95%E8%AF%8D.md) | 深度优先搜索、字典树 | 中等 | -| 1859 | [将句子排序](https://leetcode.cn/problems/sorting-the-sentence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1859.%20%E5%B0%86%E5%8F%A5%E5%AD%90%E6%8E%92%E5%BA%8F.md) | 字符串、排序 | 简单 | -| 1876 | [长度为三且各字符不同的子字符串](https://leetcode.cn/problems/substrings-of-size-three-with-distinct-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1876.%20%E9%95%BF%E5%BA%A6%E4%B8%BA%E4%B8%89%E4%B8%94%E5%90%84%E5%AD%97%E7%AC%A6%E4%B8%8D%E5%90%8C%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 哈希表、字符串、计数、滑动窗口 | 简单 | -| 1877 | [数组中最大数对和的最小值](https://leetcode.cn/problems/minimize-maximum-pair-sum-in-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1877.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9C%80%E5%A4%A7%E6%95%B0%E5%AF%B9%E5%92%8C%E7%9A%84%E6%9C%80%E5%B0%8F%E5%80%BC.md) | 贪心、数组、双指针、排序 | 中等 | -| 1879 | [两个数组最小的异或值之和](https://leetcode.cn/problems/minimum-xor-sum-of-two-arrays/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1879.%20%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E6%9C%80%E5%B0%8F%E7%9A%84%E5%BC%82%E6%88%96%E5%80%BC%E4%B9%8B%E5%92%8C.md) | 位运算、数组、动态规划、状态压缩 | 困难 | -| 1893 | [检查是否区域内所有整数都被覆盖](https://leetcode.cn/problems/check-if-all-the-integers-in-a-range-are-covered/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1893.%20%E6%A3%80%E6%9F%A5%E6%98%AF%E5%90%A6%E5%8C%BA%E5%9F%9F%E5%86%85%E6%89%80%E6%9C%89%E6%95%B4%E6%95%B0%E9%83%BD%E8%A2%AB%E8%A6%86%E7%9B%96.md) | 数组、哈希表、前缀和 | 简单 | -| 1897 | [重新分配字符使所有字符串都相等](https://leetcode.cn/problems/redistribute-characters-to-make-all-strings-equal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1897.%20%E9%87%8D%E6%96%B0%E5%88%86%E9%85%8D%E5%AD%97%E7%AC%A6%E4%BD%BF%E6%89%80%E6%9C%89%E5%AD%97%E7%AC%A6%E4%B8%B2%E9%83%BD%E7%9B%B8%E7%AD%89.md) | 哈希表、字符串、计数 | 简单 | -| 1903 | [字符串中的最大奇数](https://leetcode.cn/problems/largest-odd-number-in-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1903.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E5%A5%87%E6%95%B0.md) | 贪心、数学、字符串 | 简单 | -| 1921 | [消灭怪物的最大数量](https://leetcode.cn/problems/eliminate-maximum-number-of-monsters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1921.%20%E6%B6%88%E7%81%AD%E6%80%AA%E7%89%A9%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E9%87%8F.md) | 贪心、数组、排序 | 中等 | -| 1925 | [统计平方和三元组的数目](https://leetcode.cn/problems/count-square-sum-triples/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1925.%20%E7%BB%9F%E8%AE%A1%E5%B9%B3%E6%96%B9%E5%92%8C%E4%B8%89%E5%85%83%E7%BB%84%E7%9A%84%E6%95%B0%E7%9B%AE.md) | 数学、枚举 | 简单 | -| 1929 | [数组串联](https://leetcode.cn/problems/concatenation-of-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1929.%20%E6%95%B0%E7%BB%84%E4%B8%B2%E8%81%94.md) | 数组 | 简单 | -| 1930 | [长度为 3 的不同回文子序列](https://leetcode.cn/problems/unique-length-3-palindromic-subsequences/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1930.%20%E9%95%BF%E5%BA%A6%E4%B8%BA%203%20%E7%9A%84%E4%B8%8D%E5%90%8C%E5%9B%9E%E6%96%87%E5%AD%90%E5%BA%8F%E5%88%97.md) | 哈希表、字符串、前缀和 | 中等 | -| 1936 | [新增的最少台阶数](https://leetcode.cn/problems/add-minimum-number-of-rungs/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1936.%20%E6%96%B0%E5%A2%9E%E7%9A%84%E6%9C%80%E5%B0%91%E5%8F%B0%E9%98%B6%E6%95%B0.md) | 贪心、数组 | 中等 | -| 1941 | [检查是否所有字符出现次数相同](https://leetcode.cn/problems/check-if-all-characters-have-equal-number-of-occurrences/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1941.%20%E6%A3%80%E6%9F%A5%E6%98%AF%E5%90%A6%E6%89%80%E6%9C%89%E5%AD%97%E7%AC%A6%E5%87%BA%E7%8E%B0%E6%AC%A1%E6%95%B0%E7%9B%B8%E5%90%8C.md) | 哈希表、字符串、计数 | 简单 | -| 1947 | [最大兼容性评分和](https://leetcode.cn/problems/maximum-compatibility-score-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1947.%20%E6%9C%80%E5%A4%A7%E5%85%BC%E5%AE%B9%E6%80%A7%E8%AF%84%E5%88%86%E5%92%8C.md) | 位运算、数组、动态规划、回溯、状态压缩 | 中等 | -| 1984 | [学生分数的最小差值](https://leetcode.cn/problems/minimum-difference-between-highest-and-lowest-of-k-scores/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1984.%20%E5%AD%A6%E7%94%9F%E5%88%86%E6%95%B0%E7%9A%84%E6%9C%80%E5%B0%8F%E5%B7%AE%E5%80%BC.md) | 数组、排序、滑动窗口 | 简单 | -| 1986 | [完成任务的最少工作时间段](https://leetcode.cn/problems/minimum-number-of-work-sessions-to-finish-the-tasks/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1986.%20%E5%AE%8C%E6%88%90%E4%BB%BB%E5%8A%A1%E7%9A%84%E6%9C%80%E5%B0%91%E5%B7%A5%E4%BD%9C%E6%97%B6%E9%97%B4%E6%AE%B5.md) | 位运算、数组、动态规划、回溯、状态压缩 | 中等 | -| 1991 | [找到数组的中间位置](https://leetcode.cn/problems/find-the-middle-index-in-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1991.%20%E6%89%BE%E5%88%B0%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%AD%E9%97%B4%E4%BD%8D%E7%BD%AE.md) | 数组、前缀和 | 简单 | -| 1994 | [好子集的数目](https://leetcode.cn/problems/the-number-of-good-subsets/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1994.%20%E5%A5%BD%E5%AD%90%E9%9B%86%E7%9A%84%E6%95%B0%E7%9B%AE.md) | 位运算、数组、数学、动态规划、状态压缩 | 困难 | -| 2011 | [执行操作后的变量值](https://leetcode.cn/problems/final-value-of-variable-after-performing-operations/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2011.%20%E6%89%A7%E8%A1%8C%E6%93%8D%E4%BD%9C%E5%90%8E%E7%9A%84%E5%8F%98%E9%87%8F%E5%80%BC.md) | 数组、字符串、模拟 | 简单 | -| 2023 | [连接后等于目标字符串的字符串对](https://leetcode.cn/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2023.%20%E8%BF%9E%E6%8E%A5%E5%90%8E%E7%AD%89%E4%BA%8E%E7%9B%AE%E6%A0%87%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%AF%B9.md) | 数组、字符串 | 中等 | -| 2050 | [并行课程 III](https://leetcode.cn/problems/parallel-courses-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2050.%20%E5%B9%B6%E8%A1%8C%E8%AF%BE%E7%A8%8B%20III.md) | 图、拓扑排序、数组、动态规划 | 困难 | -| 2156 | [查找给定哈希值的子串](https://leetcode.cn/problems/find-substring-with-given-hash-value/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2156.%20%E6%9F%A5%E6%89%BE%E7%BB%99%E5%AE%9A%E5%93%88%E5%B8%8C%E5%80%BC%E7%9A%84%E5%AD%90%E4%B8%B2.md) | 字符串、滑动窗口、哈希函数、滚动哈希 | 困难 | -| 2172 | [数组的最大与和](https://leetcode.cn/problems/maximum-and-sum-of-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2172.%20%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E4%B8%8E%E5%92%8C.md) | 位运算、数组、动态规划、状态压缩 | 困难 | -| 2235 | [两整数相加](https://leetcode.cn/problems/add-two-integers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2235.%20%E4%B8%A4%E6%95%B4%E6%95%B0%E7%9B%B8%E5%8A%A0.md) | 数学 | 简单 | -| 2246 | [相邻字符不同的最长路径](https://leetcode.cn/problems/longest-path-with-different-adjacent-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2246.%20%E7%9B%B8%E9%82%BB%E5%AD%97%E7%AC%A6%E4%B8%8D%E5%90%8C%E7%9A%84%E6%9C%80%E9%95%BF%E8%B7%AF%E5%BE%84.md) | 树、深度优先搜索、图、拓扑排序、数组、字符串 | 困难 | -| 2249 | [统计圆内格点数目](https://leetcode.cn/problems/count-lattice-points-inside-a-circle/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2249.%20%E7%BB%9F%E8%AE%A1%E5%9C%86%E5%86%85%E6%A0%BC%E7%82%B9%E6%95%B0%E7%9B%AE.md) | 几何、数组、哈希表、数学、枚举 | 中等 | -| 2276 | [统计区间中的整数数目](https://leetcode.cn/problems/count-integers-in-intervals/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2276.%20%E7%BB%9F%E8%AE%A1%E5%8C%BA%E9%97%B4%E4%B8%AD%E7%9A%84%E6%95%B4%E6%95%B0%E6%95%B0%E7%9B%AE.md) | 设计、线段树、有序集合 | 困难 | -| 2376 | [统计特殊整数](https://leetcode.cn/problems/count-special-integers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2376.%20%E7%BB%9F%E8%AE%A1%E7%89%B9%E6%AE%8A%E6%95%B4%E6%95%B0.md) | 数学、动态规划 | 困难 | -| 2427 | [公因子的数目](https://leetcode.cn/problems/number-of-common-factors/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2427.%20%E5%85%AC%E5%9B%A0%E5%AD%90%E7%9A%84%E6%95%B0%E7%9B%AE.md) | 数学、枚举、数论 | 简单 | -| 2538 | [最大价值和与最小价值和的差值](https://leetcode.cn/problems/difference-between-maximum-and-minimum-price-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2538.%20%E6%9C%80%E5%A4%A7%E4%BB%B7%E5%80%BC%E5%92%8C%E4%B8%8E%E6%9C%80%E5%B0%8F%E4%BB%B7%E5%80%BC%E5%92%8C%E7%9A%84%E5%B7%AE%E5%80%BC.md) | 树、深度优先搜索、数组、动态规划 | 困难 | -| 2585 | [获得分数的方法数](https://leetcode.cn/problems/number-of-ways-to-earn-points/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2585.%20%E8%8E%B7%E5%BE%97%E5%88%86%E6%95%B0%E7%9A%84%E6%96%B9%E6%B3%95%E6%95%B0.md) | 数组、动态规划 | 困难 | -| 2719 | [统计整数数目](https://leetcode.cn/problems/count-of-integers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2719.%20%E7%BB%9F%E8%AE%A1%E6%95%B4%E6%95%B0%E6%95%B0%E7%9B%AE.md) | 数学、字符串、动态规划 | 困难 | -| 剑指 Offer 03 | [数组中重复的数字](https://leetcode.cn/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2003.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E9%87%8D%E5%A4%8D%E7%9A%84%E6%95%B0%E5%AD%97.md) | 数组、哈希表、排序 | 简单 | -| 剑指 Offer 04 | [二维数组中的查找](https://leetcode.cn/problems/er-wei-shu-zu-zhong-de-cha-zhao-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2004.%20%E4%BA%8C%E7%BB%B4%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9F%A5%E6%89%BE.md) | 数组、二分查找、分治、矩阵 | 中等 | -| 剑指 Offer 05 | [替换空格](https://leetcode.cn/problems/ti-huan-kong-ge-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2005.%20%E6%9B%BF%E6%8D%A2%E7%A9%BA%E6%A0%BC.md) | 字符串 | 简单 | -| 剑指 Offer 06 | [从尾到头打印链表](https://leetcode.cn/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2006.%20%E4%BB%8E%E5%B0%BE%E5%88%B0%E5%A4%B4%E6%89%93%E5%8D%B0%E9%93%BE%E8%A1%A8.md) | 栈、递归、链表、双指针 | 简单 | -| 剑指 Offer 07 | [重建二叉树](https://leetcode.cn/problems/zhong-jian-er-cha-shu-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2007.%20%E9%87%8D%E5%BB%BA%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、数组、哈希表、分治、二叉树 | 中等 | -| 剑指 Offer 09 | [用两个栈实现队列](https://leetcode.cn/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2009.%20%E7%94%A8%E4%B8%A4%E4%B8%AA%E6%A0%88%E5%AE%9E%E7%8E%B0%E9%98%9F%E5%88%97.md) | 栈、设计、队列 | 简单 | -| 剑指 Offer 10- I | [斐波那契数列](https://leetcode.cn/problems/fei-bo-na-qi-shu-lie-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2010-%20I.%20%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0%E5%88%97.md) | 记忆化搜索、数学、动态规划 | 简单 | -| 剑指 Offer 10- II | [青蛙跳台阶问题](https://leetcode.cn/problems/qing-wa-tiao-tai-jie-wen-ti-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2010-%20II.%20%E9%9D%92%E8%9B%99%E8%B7%B3%E5%8F%B0%E9%98%B6%E9%97%AE%E9%A2%98.md) | 记忆化搜索、数学、动态规划 | 简单 | -| 剑指 Offer 11 | [旋转数组的最小数字](https://leetcode.cn/problems/xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2011.%20%E6%97%8B%E8%BD%AC%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%B0%8F%E6%95%B0%E5%AD%97.md) | 数组、二分查找 | 简单 | -| 剑指 Offer 12 | [矩阵中的路径](https://leetcode.cn/problems/ju-zhen-zhong-de-lu-jing-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2012.%20%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E8%B7%AF%E5%BE%84.md) | 数组、回溯、矩阵 | 中等 | -| 剑指 Offer 13 | [机器人的运动范围](https://leetcode.cn/problems/ji-qi-ren-de-yun-dong-fan-wei-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2013.%20%E6%9C%BA%E5%99%A8%E4%BA%BA%E7%9A%84%E8%BF%90%E5%8A%A8%E8%8C%83%E5%9B%B4.md) | 深度优先搜索、广度优先搜索、动态规划 | 中等 | -| 剑指 Offer 14- I | [剪绳子](https://leetcode.cn/problems/jian-sheng-zi-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2014-%20I.%20%E5%89%AA%E7%BB%B3%E5%AD%90.md) | 数学、动态规划 | 中等 | -| 剑指 Offer 15 | [二进制中1的个数](https://leetcode.cn/problems/er-jin-zhi-zhong-1de-ge-shu-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2015.%20%E4%BA%8C%E8%BF%9B%E5%88%B6%E4%B8%AD1%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 位运算 | 简单 | -| 剑指 Offer 16 | [数值的整数次方](https://leetcode.cn/problems/shu-zhi-de-zheng-shu-ci-fang-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2016.%20%E6%95%B0%E5%80%BC%E7%9A%84%E6%95%B4%E6%95%B0%E6%AC%A1%E6%96%B9.md) | 递归、数学 | 中等 | -| 剑指 Offer 17 | [打印从1到最大的n位数](https://leetcode.cn/problems/da-yin-cong-1dao-zui-da-de-nwei-shu-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2017.%20%E6%89%93%E5%8D%B0%E4%BB%8E1%E5%88%B0%E6%9C%80%E5%A4%A7%E7%9A%84n%E4%BD%8D%E6%95%B0.md) | 数组、数学 | 简单 | -| 剑指 Offer 18 | [删除链表的节点](https://leetcode.cn/problems/shan-chu-lian-biao-de-jie-dian-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2018.%20%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E7%9A%84%E8%8A%82%E7%82%B9.md) | 链表 | 简单 | -| 剑指 Offer 21 | [调整数组顺序使奇数位于偶数前面](https://leetcode.cn/problems/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2021.%20%E8%B0%83%E6%95%B4%E6%95%B0%E7%BB%84%E9%A1%BA%E5%BA%8F%E4%BD%BF%E5%A5%87%E6%95%B0%E4%BD%8D%E4%BA%8E%E5%81%B6%E6%95%B0%E5%89%8D%E9%9D%A2.md) | 数组、双指针、排序 | 简单 | -| 剑指 Offer 22 | [链表中倒数第k个节点](https://leetcode.cn/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2022.%20%E9%93%BE%E8%A1%A8%E4%B8%AD%E5%80%92%E6%95%B0%E7%AC%ACk%E4%B8%AA%E8%8A%82%E7%82%B9.md) | 链表、双指针 | 简单 | -| 剑指 Offer 24 | [反转链表](https://leetcode.cn/problems/fan-zhuan-lian-biao-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2024.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8.md) | 递归、链表 | 简单 | -| 剑指 Offer 25 | [合并两个排序的链表](https://leetcode.cn/problems/he-bing-liang-ge-pai-xu-de-lian-biao-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2025.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%8E%92%E5%BA%8F%E7%9A%84%E9%93%BE%E8%A1%A8.md) | 递归、链表 | 简单 | -| 剑指 Offer 26 | [树的子结构](https://leetcode.cn/problems/shu-de-zi-jie-gou-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2026.%20%E6%A0%91%E7%9A%84%E5%AD%90%E7%BB%93%E6%9E%84.md) | 树、深度优先搜索、二叉树 | 中等 | -| 剑指 Offer 27 | [二叉树的镜像](https://leetcode.cn/problems/er-cha-shu-de-jing-xiang-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2027.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%95%9C%E5%83%8F.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 剑指 Offer 28 | [对称的二叉树](https://leetcode.cn/problems/dui-cheng-de-er-cha-shu-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2028.%20%E5%AF%B9%E7%A7%B0%E7%9A%84%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 剑指 Offer 29 | [顺时针打印矩阵](https://leetcode.cn/problems/shun-shi-zhen-da-yin-ju-zhen-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2029.%20%E9%A1%BA%E6%97%B6%E9%92%88%E6%89%93%E5%8D%B0%E7%9F%A9%E9%98%B5.md) | 数组、矩阵、模拟 | 简单 | -| 剑指 Offer 30 | [包含min函数的栈](https://leetcode.cn/problems/bao-han-minhan-shu-de-zhan-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2030.%20%E5%8C%85%E5%90%ABmin%E5%87%BD%E6%95%B0%E7%9A%84%E6%A0%88.md) | 栈、设计 | 简单 | -| 剑指 Offer 31 | [栈的压入、弹出序列](https://leetcode.cn/problems/zhan-de-ya-ru-dan-chu-xu-lie-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2031.%20%E6%A0%88%E7%9A%84%E5%8E%8B%E5%85%A5%E3%80%81%E5%BC%B9%E5%87%BA%E5%BA%8F%E5%88%97.md) | 栈、数组、模拟 | 中等 | -| 剑指 Offer 32 - I | [从上到下打印二叉树](https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2032%20-%20I.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、广度优先搜索、二叉树 | 中等 | -| 剑指 Offer 32 - II | [从上到下打印二叉树 II](https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2032%20-%20II.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91%20II.md) | 树、广度优先搜索、二叉树 | 简单 | -| 剑指 Offer 32 - III | [从上到下打印二叉树 III](https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2032%20-%20III.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91%20III.md) | 树、广度优先搜索、二叉树 | 中等 | -| 剑指 Offer 33 | [二叉搜索树的后序遍历序列](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2033.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86%E5%BA%8F%E5%88%97.md) | 栈、树、二叉搜索树、递归、二叉树、单调栈 | 中等 | -| 剑指 Offer 34 | [二叉树中和为某一值的路径](https://leetcode.cn/problems/er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2034.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E5%92%8C%E4%B8%BA%E6%9F%90%E4%B8%80%E5%80%BC%E7%9A%84%E8%B7%AF%E5%BE%84.md) | 树、深度优先搜索、回溯、二叉树 | 中等 | -| 剑指 Offer 35 | [复杂链表的复制](https://leetcode.cn/problems/fu-za-lian-biao-de-fu-zhi-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2035.%20%E5%A4%8D%E6%9D%82%E9%93%BE%E8%A1%A8%E7%9A%84%E5%A4%8D%E5%88%B6.md) | 哈希表、链表 | 中等 | -| 剑指 Offer 36 | [二叉搜索树与双向链表](https://leetcode.cn/problems/er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2036.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%8E%E5%8F%8C%E5%90%91%E9%93%BE%E8%A1%A8.md) | 栈、树、深度优先搜索、二叉搜索树、链表、二叉树、双向链表 | 中等 | -| 剑指 Offer 37 | [序列化二叉树](https://leetcode.cn/problems/xu-lie-hua-er-cha-shu-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2037.%20%E5%BA%8F%E5%88%97%E5%8C%96%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、设计、字符串、二叉树 | 困难 | -| 剑指 Offer 38 | [字符串的排列](https://leetcode.cn/problems/zi-fu-chuan-de-pai-lie-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2038.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%8E%92%E5%88%97.md) | 字符串、回溯 | 中等 | -| 剑指 Offer 39 | [数组中出现次数超过一半的数字](https://leetcode.cn/problems/shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2039.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E5%87%BA%E7%8E%B0%E6%AC%A1%E6%95%B0%E8%B6%85%E8%BF%87%E4%B8%80%E5%8D%8A%E7%9A%84%E6%95%B0%E5%AD%97.md) | 数组、哈希表、分治、计数、排序 | 简单 | -| 剑指 Offer 40 | [最小的k个数](https://leetcode.cn/problems/zui-xiao-de-kge-shu-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2040.%20%E6%9C%80%E5%B0%8F%E7%9A%84k%E4%B8%AA%E6%95%B0.md) | 数组、分治、快速选择、排序、堆（优先队列） | 简单 | -| 剑指 Offer 41 | [数据流中的中位数](https://leetcode.cn/problems/shu-ju-liu-zhong-de-zhong-wei-shu-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2041.%20%E6%95%B0%E6%8D%AE%E6%B5%81%E4%B8%AD%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0.md) | 设计、双指针、数据流、排序、堆（优先队列） | 困难 | -| 剑指 Offer 42 | [连续子数组的最大和](https://leetcode.cn/problems/lian-xu-zi-shu-zu-de-zui-da-he-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2042.%20%E8%BF%9E%E7%BB%AD%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%92%8C.md) | 数组、分治、动态规划 | 简单 | -| 剑指 Offer 44 | [数字序列中某一位的数字](https://leetcode.cn/problems/shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2044.%20%E6%95%B0%E5%AD%97%E5%BA%8F%E5%88%97%E4%B8%AD%E6%9F%90%E4%B8%80%E4%BD%8D%E7%9A%84%E6%95%B0%E5%AD%97.md) | 数学、二分查找 | 中等 | -| 剑指 Offer 45 | [把数组排成最小的数](https://leetcode.cn/problems/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2045.%20%E6%8A%8A%E6%95%B0%E7%BB%84%E6%8E%92%E6%88%90%E6%9C%80%E5%B0%8F%E7%9A%84%E6%95%B0.md) | 贪心、字符串、排序 | 中等 | -| 剑指 Offer 46 | [把数字翻译成字符串](https://leetcode.cn/problems/ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2046.%20%E6%8A%8A%E6%95%B0%E5%AD%97%E7%BF%BB%E8%AF%91%E6%88%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 字符串、动态规划 | 中等 | -| 剑指 Offer 47 | [礼物的最大价值](https://leetcode.cn/problems/li-wu-de-zui-da-jie-zhi-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2047.%20%E7%A4%BC%E7%89%A9%E7%9A%84%E6%9C%80%E5%A4%A7%E4%BB%B7%E5%80%BC.md) | 数组、动态规划、矩阵 | 中等 | -| 剑指 Offer 48 | [最长不含重复字符的子字符串](https://leetcode.cn/problems/zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2048.%20%E6%9C%80%E9%95%BF%E4%B8%8D%E5%90%AB%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 哈希表、字符串、滑动窗口 | 中等 | -| 剑指 Offer 49 | [丑数](https://leetcode.cn/problems/chou-shu-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2049.%20%E4%B8%91%E6%95%B0.md) | 哈希表、数学、动态规划、堆（优先队列） | 中等 | -| 剑指 Offer 50 | [第一个只出现一次的字符](https://leetcode.cn/problems/di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2050.%20%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E5%AD%97%E7%AC%A6.md) | 队列、哈希表、字符串、计数 | 简单 | -| 剑指 Offer 51 | [数组中的逆序对](https://leetcode.cn/problems/shu-zu-zhong-de-ni-xu-dui-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2051.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%80%86%E5%BA%8F%E5%AF%B9.md) | 树状数组、线段树、数组、二分查找、分治、有序集合、归并排序 | 困难 | -| 剑指 Offer 52 | [两个链表的第一个公共节点](https://leetcode.cn/problems/liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2052.%20%E4%B8%A4%E4%B8%AA%E9%93%BE%E8%A1%A8%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%85%AC%E5%85%B1%E8%8A%82%E7%82%B9.md) | 哈希表、链表、双指针 | 简单 | -| 剑指 Offer 53 - I | [在排序数组中查找数字 I](https://leetcode.cn/problems/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2053%20-%20I.%20%E5%9C%A8%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9F%A5%E6%89%BE%E6%95%B0%E5%AD%97%20I.md) | 数组、二分查找 | 简单 | -| 剑指 Offer 53 - II | [0～n-1中缺失的数字](https://leetcode.cn/problems/que-shi-de-shu-zi-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2053%20-%20II.%200%EF%BD%9En-1%E4%B8%AD%E7%BC%BA%E5%A4%B1%E7%9A%84%E6%95%B0%E5%AD%97.md) | 位运算、数组、哈希表、数学、二分查找 | 简单 | -| 剑指 Offer 54 | [二叉搜索树的第k大节点](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2054.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E7%AC%ACk%E5%A4%A7%E8%8A%82%E7%82%B9.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 简单 | -| 剑指 Offer 55 - I | [二叉树的深度](https://leetcode.cn/problems/er-cha-shu-de-shen-du-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2055%20-%20I.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%B7%B1%E5%BA%A6.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 剑指 Offer 55 - II | [平衡二叉树](https://leetcode.cn/problems/ping-heng-er-cha-shu-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2055%20-%20II.%20%E5%B9%B3%E8%A1%A1%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、二叉树 | 简单 | -| 剑指 Offer 56 - I | [数组中数字出现的次数](https://leetcode.cn/problems/shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2056%20-%20I.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E6%95%B0%E5%AD%97%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0.md) | 位运算、数组 | 中等 | -| 剑指 Offer 57 | [和为s的两个数字](https://leetcode.cn/problems/he-wei-sde-liang-ge-shu-zi-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2057.%20%E5%92%8C%E4%B8%BAs%E7%9A%84%E4%B8%A4%E4%B8%AA%E6%95%B0%E5%AD%97.md) | 数组、双指针、二分查找 | 简单 | -| 剑指 Offer 57 - II | [和为s的连续正数序列](https://leetcode.cn/problems/he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2057%20-%20II.%20%E5%92%8C%E4%B8%BAs%E7%9A%84%E8%BF%9E%E7%BB%AD%E6%AD%A3%E6%95%B0%E5%BA%8F%E5%88%97.md) | 数学、双指针、枚举 | 简单 | -| 剑指 Offer 58 - I | [翻转单词顺序](https://leetcode.cn/problems/fan-zhuan-dan-ci-shun-xu-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2058%20-%20I.%20%E7%BF%BB%E8%BD%AC%E5%8D%95%E8%AF%8D%E9%A1%BA%E5%BA%8F.md) | 双指针、字符串 | 简单 | -| 剑指 Offer 58 - II | [左旋转字符串](https://leetcode.cn/problems/zuo-xuan-zhuan-zi-fu-chuan-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2058%20-%20II.%20%E5%B7%A6%E6%97%8B%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 数学、双指针、字符串 | 简单 | -| 剑指 Offer 59 - I | [滑动窗口的最大值](https://leetcode.cn/problems/hua-dong-chuang-kou-de-zui-da-zhi-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2059%20-%20I.%20%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md) | 队列、滑动窗口、单调队列、堆（优先队列） | 困难 | -| 剑指 Offer 59 - II | [队列的最大值](https://leetcode.cn/problems/dui-lie-de-zui-da-zhi-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2059%20-%20II.%20%E9%98%9F%E5%88%97%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md) | 设计、队列、单调队列 | 中等 | -| 剑指 Offer 61 | [扑克牌中的顺子](https://leetcode.cn/problems/bu-ke-pai-zhong-de-shun-zi-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2061.%20%E6%89%91%E5%85%8B%E7%89%8C%E4%B8%AD%E7%9A%84%E9%A1%BA%E5%AD%90.md) | 数组、排序 | 简单 | -| 剑指 Offer 62 | [圆圈中最后剩下的数字](https://leetcode.cn/problems/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2062.%20%E5%9C%86%E5%9C%88%E4%B8%AD%E6%9C%80%E5%90%8E%E5%89%A9%E4%B8%8B%E7%9A%84%E6%95%B0%E5%AD%97.md) | 递归、数学 | 简单 | -| 剑指 Offer 63 | [股票的最大利润](https://leetcode.cn/problems/gu-piao-de-zui-da-li-run-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2063.%20%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E5%A4%A7%E5%88%A9%E6%B6%A6.md) | 数组、动态规划 | 中等 | -| 剑指 Offer 64 | [求1+2+…+n](https://leetcode.cn/problems/qiu-12n-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2064.%20%E6%B1%821%2B2%2B%E2%80%A6%2Bn.md) | 位运算、递归、脑筋急转弯 | 中等 | -| 剑指 Offer 65 | [不用加减乘除做加法](https://leetcode.cn/problems/bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2065.%20%E4%B8%8D%E7%94%A8%E5%8A%A0%E5%87%8F%E4%B9%98%E9%99%A4%E5%81%9A%E5%8A%A0%E6%B3%95.md) | 位运算、数学 | 简单 | -| 剑指 Offer 66 | [构建乘积数组](https://leetcode.cn/problems/gou-jian-cheng-ji-shu-zu-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2066.%20%E6%9E%84%E5%BB%BA%E4%B9%98%E7%A7%AF%E6%95%B0%E7%BB%84.md) | 数组、前缀和 | 中等 | -| 剑指 Offer 67 | [把字符串转换成整数](https://leetcode.cn/problems/ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2067.%20%E6%8A%8A%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%BD%AC%E6%8D%A2%E6%88%90%E6%95%B4%E6%95%B0.md) | 字符串 | 中等 | -| 剑指 Offer 68 - I | [二叉搜索树的最近公共祖先](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2068%20-%20I.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 简单 | -| 剑指 Offer 68 - II | [二叉树的最近公共祖先](https://leetcode.cn/problems/er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2068%20-%20II.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88.md) | 树、深度优先搜索、二叉树 | 简单 | -| 剑指 Offer II 001 | [整数除法](https://leetcode.cn/problems/xoh6Oh/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20001.%20%E6%95%B4%E6%95%B0%E9%99%A4%E6%B3%95.md) | 位运算、数学 | 简单 | -| 剑指 Offer II 002 | [二进制加法](https://leetcode.cn/problems/JFETK5/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20002.%20%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%8A%A0%E6%B3%95.md) | 位运算、数学、字符串、模拟 | 简单 | -| 剑指 Offer II 003 | [前 n 个数字二进制中 1 的个数](https://leetcode.cn/problems/w3tCBm/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20003.%20%E5%89%8D%20n%20%E4%B8%AA%E6%95%B0%E5%AD%97%E4%BA%8C%E8%BF%9B%E5%88%B6%E4%B8%AD%201%20%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 位运算、动态规划 | 简单 | -| 剑指 Offer II 004 | [只出现一次的数字](https://leetcode.cn/problems/WGki4K/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20004.%20%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B0%E5%AD%97.md) | 位运算、数组 | 中等 | -| 剑指 Offer II 005 | [单词长度的最大乘积](https://leetcode.cn/problems/aseY1I/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20005.%20%E5%8D%95%E8%AF%8D%E9%95%BF%E5%BA%A6%E7%9A%84%E6%9C%80%E5%A4%A7%E4%B9%98%E7%A7%AF.md) | 位运算、数组、字符串 | 中等 | -| 剑指 Offer II 006 | [排序数组中两个数字之和](https://leetcode.cn/problems/kLl5u1/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20006.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E4%B8%A4%E4%B8%AA%E6%95%B0%E5%AD%97%E4%B9%8B%E5%92%8C.md) | 数组、双指针、二分查找 | 简单 | -| 剑指 Offer II 007 | [数组中和为 0 的三个数](https://leetcode.cn/problems/1fGaJU/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20007.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E5%92%8C%E4%B8%BA%200%20%E7%9A%84%E4%B8%89%E4%B8%AA%E6%95%B0.md) | 数组、双指针、排序 | 中等 | -| 剑指 Offer II 008 | [和大于等于 target 的最短子数组](https://leetcode.cn/problems/2VG8Kg/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20008.%20%E5%92%8C%E5%A4%A7%E4%BA%8E%E7%AD%89%E4%BA%8E%20target%20%E7%9A%84%E6%9C%80%E7%9F%AD%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、二分查找、前缀和、滑动窗口 | 中等 | -| 剑指 Offer II 009 | [乘积小于 K 的子数组](https://leetcode.cn/problems/ZVAVXX/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20009.%20%E4%B9%98%E7%A7%AF%E5%B0%8F%E4%BA%8E%20K%20%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、滑动窗口 | 中等 | -| 剑指 Offer II 010 | [和为 k 的子数组](https://leetcode.cn/problems/QTMn0o/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20010.%20%E5%92%8C%E4%B8%BA%20k%20%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、哈希表、前缀和 | 中等 | -| 剑指 Offer II 011 | [0 和 1 个数相同的子数组](https://leetcode.cn/problems/A1NYOS/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20011.%200%20%E5%92%8C%201%20%E4%B8%AA%E6%95%B0%E7%9B%B8%E5%90%8C%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、哈希表、前缀和 | 中等 | -| 剑指 Offer II 012 | [左右两边子数组的和相等](https://leetcode.cn/problems/tvdfij/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20012.%20%E5%B7%A6%E5%8F%B3%E4%B8%A4%E8%BE%B9%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E5%92%8C%E7%9B%B8%E7%AD%89.md) | 数组、前缀和 | 简单 | -| 剑指 Offer II 013 | [二维子矩阵的和](https://leetcode.cn/problems/O4NDxx/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20013.%20%E4%BA%8C%E7%BB%B4%E5%AD%90%E7%9F%A9%E9%98%B5%E7%9A%84%E5%92%8C.md) | 设计、数组、矩阵、前缀和 | 中等 | -| 剑指 Offer II 016 | [不含重复字符的最长子字符串](https://leetcode.cn/problems/wtcaE1/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20016.%20%E4%B8%8D%E5%90%AB%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 哈希表、字符串、滑动窗口 | 中等 | -| 剑指 Offer II 017 | [含有所有字符的最短字符串](https://leetcode.cn/problems/M1oyTv/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20017.%20%E5%90%AB%E6%9C%89%E6%89%80%E6%9C%89%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E7%9F%AD%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 哈希表、字符串、滑动窗口 | 困难 | -| 剑指 Offer II 018 | [有效的回文](https://leetcode.cn/problems/XltzEq/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20018.%20%E6%9C%89%E6%95%88%E7%9A%84%E5%9B%9E%E6%96%87.md) | 双指针、字符串 | 简单 | -| 剑指 Offer II 019 | [最多删除一个字符得到回文](https://leetcode.cn/problems/RQku0D/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20019.%20%E6%9C%80%E5%A4%9A%E5%88%A0%E9%99%A4%E4%B8%80%E4%B8%AA%E5%AD%97%E7%AC%A6%E5%BE%97%E5%88%B0%E5%9B%9E%E6%96%87.md) | 贪心、双指针、字符串 | 简单 | -| 剑指 Offer II 020 | [回文子字符串的个数](https://leetcode.cn/problems/a7VOhD/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20020.%20%E5%9B%9E%E6%96%87%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 字符串、动态规划 | 中等 | -| 剑指 Offer II 021 | [删除链表的倒数第 n 个结点](https://leetcode.cn/problems/SLwz0R/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20021.%20%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E7%9A%84%E5%80%92%E6%95%B0%E7%AC%AC%20n%20%E4%B8%AA%E7%BB%93%E7%82%B9.md) | 链表、双指针 | 中等 | -| 剑指 Offer II 022 | [链表中环的入口节点](https://leetcode.cn/problems/c32eOV/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20022.%20%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%8E%AF%E7%9A%84%E5%85%A5%E5%8F%A3%E8%8A%82%E7%82%B9.md) | 哈希表、链表、双指针 | 中等 | -| 剑指 Offer II 023 | [两个链表的第一个重合节点](https://leetcode.cn/problems/3u1WK4/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20023.%20%E4%B8%A4%E4%B8%AA%E9%93%BE%E8%A1%A8%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E9%87%8D%E5%90%88%E8%8A%82%E7%82%B9.md) | 哈希表、链表、双指针 | 简单 | -| 剑指 Offer II 024 | [反转链表](https://leetcode.cn/problems/UHnkqh/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20024.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8.md) | 递归、链表 | 简单 | -| 剑指 Offer II 025 | [链表中的两数相加](https://leetcode.cn/problems/lMSNwu/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20025.%20%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E4%B8%A4%E6%95%B0%E7%9B%B8%E5%8A%A0.md) | 栈、链表、数学 | 中等 | -| 剑指 Offer II 026 | [重排链表](https://leetcode.cn/problems/LGjMqU/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20026.%20%E9%87%8D%E6%8E%92%E9%93%BE%E8%A1%A8.md) | 栈、递归、链表、双指针 | 中等 | -| 剑指 Offer II 027 | [回文链表](https://leetcode.cn/problems/aMhZSa/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20027.%20%E5%9B%9E%E6%96%87%E9%93%BE%E8%A1%A8.md) | 栈、递归、链表、双指针 | 简单 | -| 剑指 Offer II 028 | [展平多级双向链表](https://leetcode.cn/problems/Qv1Da2/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20028.%20%E5%B1%95%E5%B9%B3%E5%A4%9A%E7%BA%A7%E5%8F%8C%E5%90%91%E9%93%BE%E8%A1%A8.md) | 深度优先搜索、链表、双向链表 | 中等 | -| 剑指 Offer II 029 | [排序的循环链表](https://leetcode.cn/problems/4ueAj6/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20029.%20%E6%8E%92%E5%BA%8F%E7%9A%84%E5%BE%AA%E7%8E%AF%E9%93%BE%E8%A1%A8.md) | 链表 | 中等 | -| 剑指 Offer II 030 | [插入、删除和随机访问都是 O(1) 的容器](https://leetcode.cn/problems/FortPu/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20030.%20%E6%8F%92%E5%85%A5%E3%80%81%E5%88%A0%E9%99%A4%E5%92%8C%E9%9A%8F%E6%9C%BA%E8%AE%BF%E9%97%AE%E9%83%BD%E6%98%AF%20O%281%29%20%E7%9A%84%E5%AE%B9%E5%99%A8.md) | 设计、数组、哈希表、数学、随机化 | 中等 | -| 剑指 Offer II 031 | [最近最少使用缓存](https://leetcode.cn/problems/OrIXps/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20031.%20%E6%9C%80%E8%BF%91%E6%9C%80%E5%B0%91%E4%BD%BF%E7%94%A8%E7%BC%93%E5%AD%98.md) | 设计、哈希表、链表、双向链表 | 中等 | -| 剑指 Offer II 032 | [有效的变位词](https://leetcode.cn/problems/dKk3P7/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20032.%20%E6%9C%89%E6%95%88%E7%9A%84%E5%8F%98%E4%BD%8D%E8%AF%8D.md) | 哈希表、字符串、排序 | 简单 | -| 剑指 Offer II 033 | [变位词组](https://leetcode.cn/problems/sfvd7V/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20033.%20%E5%8F%98%E4%BD%8D%E8%AF%8D%E7%BB%84.md) | 数组、哈希表、字符串、排序 | 中等 | -| 剑指 Offer II 034 | [外星语言是否排序](https://leetcode.cn/problems/lwyVBB/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20034.%20%E5%A4%96%E6%98%9F%E8%AF%AD%E8%A8%80%E6%98%AF%E5%90%A6%E6%8E%92%E5%BA%8F.md) | 数组、哈希表、字符串 | 简单 | -| 剑指 Offer II 035 | [最小时间差](https://leetcode.cn/problems/569nqc/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20035.%20%E6%9C%80%E5%B0%8F%E6%97%B6%E9%97%B4%E5%B7%AE.md) | 数组、数学、字符串、排序 | 中等 | -| 剑指 Offer II 036 | [后缀表达式](https://leetcode.cn/problems/8Zf90G/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20036.%20%E5%90%8E%E7%BC%80%E8%A1%A8%E8%BE%BE%E5%BC%8F.md) | 栈、数组、数学 | 中等 | -| 剑指 Offer II 037 | [小行星碰撞](https://leetcode.cn/problems/XagZNi/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20037.%20%E5%B0%8F%E8%A1%8C%E6%98%9F%E7%A2%B0%E6%92%9E.md) | 栈、数组、模拟 | 中等 | -| 剑指 Offer II 038 | [每日温度](https://leetcode.cn/problems/iIQa4I/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20038.%20%E6%AF%8F%E6%97%A5%E6%B8%A9%E5%BA%A6.md) | 栈、数组、单调栈 | 中等 | -| 剑指 Offer II 039 | [直方图最大矩形面积](https://leetcode.cn/problems/0ynMMM/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20039.%20%E7%9B%B4%E6%96%B9%E5%9B%BE%E6%9C%80%E5%A4%A7%E7%9F%A9%E5%BD%A2%E9%9D%A2%E7%A7%AF.md) | 栈、数组、单调栈 | 困难 | -| 剑指 Offer II 041 | [滑动窗口的平均值](https://leetcode.cn/problems/qIsx9U/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20041.%20%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E7%9A%84%E5%B9%B3%E5%9D%87%E5%80%BC.md) | 设计、队列、数组、数据流 | 简单 | -| 剑指 Offer II 042 | [最近请求次数](https://leetcode.cn/problems/H8086Q/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20042.%20%E6%9C%80%E8%BF%91%E8%AF%B7%E6%B1%82%E6%AC%A1%E6%95%B0.md) | 设计、队列、数据流 | 简单 | -| 剑指 Offer II 043 | [往完全二叉树添加节点](https://leetcode.cn/problems/NaqhDT/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20043.%20%E5%BE%80%E5%AE%8C%E5%85%A8%E4%BA%8C%E5%8F%89%E6%A0%91%E6%B7%BB%E5%8A%A0%E8%8A%82%E7%82%B9.md) | 树、广度优先搜索、设计、二叉树 | 中等 | -| 剑指 Offer II 044 | [二叉树每层的最大值](https://leetcode.cn/problems/hPov7L/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20044.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E6%AF%8F%E5%B1%82%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | -| 剑指 Offer II 045 | [二叉树最底层最左边的值](https://leetcode.cn/problems/LwUNpT/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20045.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E6%9C%80%E5%BA%95%E5%B1%82%E6%9C%80%E5%B7%A6%E8%BE%B9%E7%9A%84%E5%80%BC.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | -| 剑指 Offer II 046 | [二叉树的右侧视图](https://leetcode.cn/problems/WNC0Lk/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20046.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%8F%B3%E4%BE%A7%E8%A7%86%E5%9B%BE.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | -| 剑指 Offer II 047 | [二叉树剪枝](https://leetcode.cn/problems/pOCWxh/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20047.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E5%89%AA%E6%9E%9D.md) | 树、深度优先搜索、二叉树 | 中等 | -| 剑指 Offer II 048 | [序列化与反序列化二叉树](https://leetcode.cn/problems/h54YBf/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20048.%20%E5%BA%8F%E5%88%97%E5%8C%96%E4%B8%8E%E5%8F%8D%E5%BA%8F%E5%88%97%E5%8C%96%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、设计、字符串、二叉树 | 困难 | -| 剑指 Offer II 049 | [从根节点到叶节点的路径数字之和](https://leetcode.cn/problems/3Etpl5/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20049.%20%E4%BB%8E%E6%A0%B9%E8%8A%82%E7%82%B9%E5%88%B0%E5%8F%B6%E8%8A%82%E7%82%B9%E7%9A%84%E8%B7%AF%E5%BE%84%E6%95%B0%E5%AD%97%E4%B9%8B%E5%92%8C.md) | 树、深度优先搜索、二叉树 | 中等 | -| 剑指 Offer II 050 | [向下的路径节点之和](https://leetcode.cn/problems/6eUYwP/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20050.%20%E5%90%91%E4%B8%8B%E7%9A%84%E8%B7%AF%E5%BE%84%E8%8A%82%E7%82%B9%E4%B9%8B%E5%92%8C.md) | 树、深度优先搜索、二叉树 | 中等 | -| 剑指 Offer II 051 | [节点之和最大的路径](https://leetcode.cn/problems/jC7MId/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20051.%20%E8%8A%82%E7%82%B9%E4%B9%8B%E5%92%8C%E6%9C%80%E5%A4%A7%E7%9A%84%E8%B7%AF%E5%BE%84.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | -| 剑指 Offer II 052 | [展平二叉搜索树](https://leetcode.cn/problems/NYBBNL/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20052.%20%E5%B1%95%E5%B9%B3%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md) | 栈、树、深度优先搜索、二叉搜索树、二叉树 | 简单 | -| 剑指 Offer II 053 | [二叉搜索树中的中序后继](https://leetcode.cn/problems/P5rCT8/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20053.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E4%B8%AD%E5%BA%8F%E5%90%8E%E7%BB%A7.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | -| 剑指 Offer II 054 | [所有大于等于节点的值之和](https://leetcode.cn/problems/w6cpku/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20054.%20%E6%89%80%E6%9C%89%E5%A4%A7%E4%BA%8E%E7%AD%89%E4%BA%8E%E8%8A%82%E7%82%B9%E7%9A%84%E5%80%BC%E4%B9%8B%E5%92%8C.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | -| 剑指 Offer II 055 | [二叉搜索树迭代器](https://leetcode.cn/problems/kTOapQ/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20055.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E8%BF%AD%E4%BB%A3%E5%99%A8.md) | 栈、树、设计、二叉搜索树、二叉树、迭代器 | 中等 | -| 剑指 Offer II 056 | [二叉搜索树中两个节点之和](https://leetcode.cn/problems/opLdQZ/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20056.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E4%B8%A4%E4%B8%AA%E8%8A%82%E7%82%B9%E4%B9%8B%E5%92%8C.md) | 树、深度优先搜索、广度优先搜索、二叉搜索树、哈希表、双指针、二叉树 | 简单 | -| 剑指 Offer II 057 | [值和下标之差都在给定的范围内](https://leetcode.cn/problems/7WqeDu/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20057.%20%E5%80%BC%E5%92%8C%E4%B8%8B%E6%A0%87%E4%B9%8B%E5%B7%AE%E9%83%BD%E5%9C%A8%E7%BB%99%E5%AE%9A%E7%9A%84%E8%8C%83%E5%9B%B4%E5%86%85.md) | 数组、桶排序、有序集合、排序、滑动窗口 | 中等 | -| 剑指 Offer II 059 | [数据流的第 K 大数值](https://leetcode.cn/problems/jBjn9C/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20059.%20%E6%95%B0%E6%8D%AE%E6%B5%81%E7%9A%84%E7%AC%AC%20K%20%E5%A4%A7%E6%95%B0%E5%80%BC.md) | 树、设计、二叉搜索树、二叉树、数据流、堆（优先队列） | 简单 | -| 剑指 Offer II 060 | [出现频率最高的 k 个数字](https://leetcode.cn/problems/g5c51o/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20060.%20%E5%87%BA%E7%8E%B0%E9%A2%91%E7%8E%87%E6%9C%80%E9%AB%98%E7%9A%84%20k%20%E4%B8%AA%E6%95%B0%E5%AD%97.md) | 数组、哈希表、分治、桶排序、计数、快速选择、排序、堆（优先队列） | 中等 | -| 剑指 Offer II 062 | [实现前缀树](https://leetcode.cn/problems/QC3q1f/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20062.%20%E5%AE%9E%E7%8E%B0%E5%89%8D%E7%BC%80%E6%A0%91.md) | 设计、字典树、哈希表、字符串 | 中等 | -| 剑指 Offer II 063 | [替换单词](https://leetcode.cn/problems/UhWRSj/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20063.%20%E6%9B%BF%E6%8D%A2%E5%8D%95%E8%AF%8D.md) | 字典树、数组、哈希表、字符串 | 中等 | -| 剑指 Offer II 064 | [神奇的字典](https://leetcode.cn/problems/US1pGT/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20064.%20%E7%A5%9E%E5%A5%87%E7%9A%84%E5%AD%97%E5%85%B8.md) | 设计、字典树、哈希表、字符串 | 中等 | -| 剑指 Offer II 065 | [最短的单词编码](https://leetcode.cn/problems/iSwD2y/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20065.%20%E6%9C%80%E7%9F%AD%E7%9A%84%E5%8D%95%E8%AF%8D%E7%BC%96%E7%A0%81.md) | 字典树、数组、哈希表、字符串 | 中等 | -| 剑指 Offer II 066 | [单词之和](https://leetcode.cn/problems/z1R5dt/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20066.%20%E5%8D%95%E8%AF%8D%E4%B9%8B%E5%92%8C.md) | 设计、字典树、哈希表、字符串 | 中等 | -| 剑指 Offer II 067 | [最大的异或](https://leetcode.cn/problems/ms70jA/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20067.%20%E6%9C%80%E5%A4%A7%E7%9A%84%E5%BC%82%E6%88%96.md) | 位运算、字典树、数组、哈希表 | 中等 | -| 剑指 Offer II 068 | [查找插入位置](https://leetcode.cn/problems/N6YdxV/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20068.%20%E6%9F%A5%E6%89%BE%E6%8F%92%E5%85%A5%E4%BD%8D%E7%BD%AE.md) | 数组、二分查找 | 简单 | -| 剑指 Offer II 072 | [求平方根](https://leetcode.cn/problems/jJ0w9p/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20072.%20%E6%B1%82%E5%B9%B3%E6%96%B9%E6%A0%B9.md) | 数学、二分查找 | 简单 | -| 剑指 Offer II 073 | [狒狒吃香蕉](https://leetcode.cn/problems/nZZqjQ/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20073.%20%E7%8B%92%E7%8B%92%E5%90%83%E9%A6%99%E8%95%89.md) | 数组、二分查找 | 中等 | -| 剑指 Offer II 074 | [合并区间](https://leetcode.cn/problems/SsGoHC/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20074.%20%E5%90%88%E5%B9%B6%E5%8C%BA%E9%97%B4.md) | 数组、排序 | 中等 | -| 剑指 Offer II 075 | [数组相对排序](https://leetcode.cn/problems/0H97ZC/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20075.%20%E6%95%B0%E7%BB%84%E7%9B%B8%E5%AF%B9%E6%8E%92%E5%BA%8F.md) | 数组、哈希表、计数排序、排序 | 简单 | -| 剑指 Offer II 076 | [数组中的第 k 大的数字](https://leetcode.cn/problems/xx4gT2/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20076.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E7%AC%AC%20k%20%E5%A4%A7%E7%9A%84%E6%95%B0%E5%AD%97.md) | 数组、分治、快速选择、排序、堆（优先队列） | 中等 | -| 剑指 Offer II 077 | [链表排序](https://leetcode.cn/problems/7WHec2/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20077.%20%E9%93%BE%E8%A1%A8%E6%8E%92%E5%BA%8F.md) | 链表、双指针、分治、排序、归并排序 | 中等 | -| 剑指 Offer II 078 | [合并排序链表](https://leetcode.cn/problems/vvXgSW/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20078.%20%E5%90%88%E5%B9%B6%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8.md) | 链表、分治、堆（优先队列）、归并排序 | 困难 | -| 剑指 Offer II 079 | [所有子集](https://leetcode.cn/problems/TVdhkn/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20079.%20%E6%89%80%E6%9C%89%E5%AD%90%E9%9B%86.md) | 位运算、数组、回溯 | 中等 | -| 剑指 Offer II 080 | [含有 k 个元素的组合](https://leetcode.cn/problems/uUsW3B/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20080.%20%E5%90%AB%E6%9C%89%20k%20%E4%B8%AA%E5%85%83%E7%B4%A0%E7%9A%84%E7%BB%84%E5%90%88.md) | 数组、回溯 | 中等 | -| 剑指 Offer II 081 | [允许重复选择元素的组合](https://leetcode.cn/problems/Ygoe9J/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20081.%20%E5%85%81%E8%AE%B8%E9%87%8D%E5%A4%8D%E9%80%89%E6%8B%A9%E5%85%83%E7%B4%A0%E7%9A%84%E7%BB%84%E5%90%88.md) | 数组、回溯 | 中等 | -| 剑指 Offer II 082 | [含有重复元素集合的组合](https://leetcode.cn/problems/4sjJUc/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20082.%20%E5%90%AB%E6%9C%89%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0%E9%9B%86%E5%90%88%E7%9A%84%E7%BB%84%E5%90%88.md) | 数组、回溯 | 中等 | -| 剑指 Offer II 083 | [没有重复元素集合的全排列](https://leetcode.cn/problems/VvJkup/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20083.%20%E6%B2%A1%E6%9C%89%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0%E9%9B%86%E5%90%88%E7%9A%84%E5%85%A8%E6%8E%92%E5%88%97.md) | 数组、回溯 | 中等 | -| 剑指 Offer II 084 | [含有重复元素集合的全排列](https://leetcode.cn/problems/7p8L0Z/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20084.%20%E5%90%AB%E6%9C%89%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0%E9%9B%86%E5%90%88%E7%9A%84%E5%85%A8%E6%8E%92%E5%88%97.md) | 数组、回溯 | 中等 | -| 剑指 Offer II 085 | [生成匹配的括号](https://leetcode.cn/problems/IDBivT/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20085.%20%E7%94%9F%E6%88%90%E5%8C%B9%E9%85%8D%E7%9A%84%E6%8B%AC%E5%8F%B7.md) | 字符串、动态规划、回溯 | 中等 | -| 剑指 Offer II 086 | [分割回文子字符串](https://leetcode.cn/problems/M99OJA/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20086.%20%E5%88%86%E5%89%B2%E5%9B%9E%E6%96%87%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 深度优先搜索、广度优先搜索、图、哈希表 | 中等 | -| 剑指 Offer II 087 | [复原 IP](https://leetcode.cn/problems/0on3uN/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20087.%20%E5%A4%8D%E5%8E%9F%20IP.md) | 字符串、回溯 | 中等 | -| 剑指 Offer II 088 | [爬楼梯的最少成本](https://leetcode.cn/problems/GzCJIP/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20088.%20%E7%88%AC%E6%A5%BC%E6%A2%AF%E7%9A%84%E6%9C%80%E5%B0%91%E6%88%90%E6%9C%AC.md) | 数组、动态规划 | 简单 | -| 剑指 Offer II 089 | [房屋偷盗](https://leetcode.cn/problems/Gu0c2T/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20089.%20%E6%88%BF%E5%B1%8B%E5%81%B7%E7%9B%97.md) | 数组、动态规划 | 中等 | -| 剑指 Offer II 090 | [环形房屋偷盗](https://leetcode.cn/problems/PzWKhm/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20090.%20%E7%8E%AF%E5%BD%A2%E6%88%BF%E5%B1%8B%E5%81%B7%E7%9B%97.md) | 数组、动态规划 | 中等 | -| 剑指 Offer II 093 | [最长斐波那契数列](https://leetcode.cn/problems/Q91FMA/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20093.%20%E6%9C%80%E9%95%BF%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0%E5%88%97.md) | 数组、哈希表、动态规划 | 中等 | -| 剑指 Offer II 095 | [最长公共子序列](https://leetcode.cn/problems/qJnOS7/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20095.%20%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%AD%90%E5%BA%8F%E5%88%97.md) | 字符串、动态规划 | 中等 | -| 剑指 Offer II 097 | [子序列的数目](https://leetcode.cn/problems/21dk04/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20097.%20%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E6%95%B0%E7%9B%AE.md) | 字符串、动态规划 | 困难 | -| 剑指 Offer II 098 | [路径的数目](https://leetcode.cn/problems/2AoeFn/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20098.%20%E8%B7%AF%E5%BE%84%E7%9A%84%E6%95%B0%E7%9B%AE.md) | 数学、动态规划、组合数学 | 中等 | -| 剑指 Offer II 101 | [分割等和子集](https://leetcode.cn/problems/NUPfPr/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20101.%20%E5%88%86%E5%89%B2%E7%AD%89%E5%92%8C%E5%AD%90%E9%9B%86.md) | 数学、字符串、模拟 | 简单 | -| 剑指 Offer II 102 | [加减的目标值](https://leetcode.cn/problems/YaVDxD/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20102.%20%E5%8A%A0%E5%87%8F%E7%9A%84%E7%9B%AE%E6%A0%87%E5%80%BC.md) | 数组、动态规划、回溯 | 中等 | -| 剑指 Offer II 103 | [最少的硬币数目](https://leetcode.cn/problems/gaM7Ch/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20103.%20%E6%9C%80%E5%B0%91%E7%9A%84%E7%A1%AC%E5%B8%81%E6%95%B0%E7%9B%AE.md) | 广度优先搜索、数组、动态规划 | 中等 | -| 剑指 Offer II 104 | [排列的数目](https://leetcode.cn/problems/D0F0SV/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20104.%20%E6%8E%92%E5%88%97%E7%9A%84%E6%95%B0%E7%9B%AE.md) | 数组、动态规划 | 中等 | -| 剑指 Offer II 105 | [岛屿的最大面积](https://leetcode.cn/problems/ZL6zAn/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20105.%20%E5%B2%9B%E5%B1%BF%E7%9A%84%E6%9C%80%E5%A4%A7%E9%9D%A2%E7%A7%AF.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | -| 剑指 Offer II 106 | [二分图](https://leetcode.cn/problems/vEAB3K/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20106.%20%E4%BA%8C%E5%88%86%E5%9B%BE.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 剑指 Offer II 107 | [矩阵中的距离](https://leetcode.cn/problems/2bCMpM/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20107.%20%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E8%B7%9D%E7%A6%BB.md) | 广度优先搜索、数组、动态规划、矩阵 | 中等 | -| 剑指 Offer II 108 | [单词演变](https://leetcode.cn/problems/om3reC/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20108.%20%E5%8D%95%E8%AF%8D%E6%BC%94%E5%8F%98.md) | 广度优先搜索、哈希表、字符串 | 困难 | -| 剑指 Offer II 109 | [开密码锁](https://leetcode.cn/problems/zlDJc7/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20109.%20%E5%BC%80%E5%AF%86%E7%A0%81%E9%94%81.md) | 广度优先搜索、数组、哈希表、字符串 | 中等 | -| 剑指 Offer II 111 | [计算除法](https://leetcode.cn/problems/vlzXQL/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20111.%20%E8%AE%A1%E7%AE%97%E9%99%A4%E6%B3%95.md) | 深度优先搜索、广度优先搜索、并查集、图、数组、最短路 | 中等 | -| 剑指 Offer II 112 | [最长递增路径](https://leetcode.cn/problems/fpTFWP/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20112.%20%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E8%B7%AF%E5%BE%84.md) | 深度优先搜索、广度优先搜索、图、拓扑排序、记忆化搜索、数组、动态规划、矩阵 | 困难 | -| 剑指 Offer II 113 | [课程顺序](https://leetcode.cn/problems/QA2IGt/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20113.%20%E8%AF%BE%E7%A8%8B%E9%A1%BA%E5%BA%8F.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | -| 剑指 Offer II 116 | [省份数量](https://leetcode.cn/problems/bLyHh0/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20116.%20%E7%9C%81%E4%BB%BD%E6%95%B0%E9%87%8F.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 剑指 Offer II 118 | [多余的边](https://leetcode.cn/problems/7LpjUW/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20118.%20%E5%A4%9A%E4%BD%99%E7%9A%84%E8%BE%B9.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 剑指 Offer II 119 | [最长连续序列](https://leetcode.cn/problems/WhsWhI/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%20II%20119.%20%E6%9C%80%E9%95%BF%E8%BF%9E%E7%BB%AD%E5%BA%8F%E5%88%97.md) | 并查集、数组、哈希表 | 中等 | -| 面试题 01.07 | [旋转矩阵](https://leetcode.cn/problems/rotate-matrix-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2001.07.%20%E6%97%8B%E8%BD%AC%E7%9F%A9%E9%98%B5.md) | 数组、数学、矩阵 | 中等 | -| 面试题 01.08 | [零矩阵](https://leetcode.cn/problems/zero-matrix-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2001.08.%20%E9%9B%B6%E7%9F%A9%E9%98%B5.md) | 数组、哈希表、矩阵 | 中等 | -| 面试题 02.02 | [返回倒数第 k 个节点](https://leetcode.cn/problems/kth-node-from-end-of-list-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2002.02.%20%E8%BF%94%E5%9B%9E%E5%80%92%E6%95%B0%E7%AC%AC%20k%20%E4%B8%AA%E8%8A%82%E7%82%B9.md) | 链表、双指针 | 简单 | -| 面试题 02.05 | [链表求和](https://leetcode.cn/problems/sum-lists-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2002.05.%20%E9%93%BE%E8%A1%A8%E6%B1%82%E5%92%8C.md) | 递归、链表、数学 | 中等 | -| 面试题 02.06 | [回文链表](https://leetcode.cn/problems/palindrome-linked-list-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2002.06.%20%E5%9B%9E%E6%96%87%E9%93%BE%E8%A1%A8.md) | 栈、递归、链表、双指针 | 简单 | -| 面试题 02.07 | [链表相交](https://leetcode.cn/problems/intersection-of-two-linked-lists-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2002.07.%20%E9%93%BE%E8%A1%A8%E7%9B%B8%E4%BA%A4.md) | 哈希表、链表、双指针 | 简单 | -| 面试题 02.08 | [环路检测](https://leetcode.cn/problems/linked-list-cycle-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2002.08.%20%E7%8E%AF%E8%B7%AF%E6%A3%80%E6%B5%8B.md) | 哈希表、链表、双指针 | 中等 | -| 面试题 03.02 | [栈的最小值](https://leetcode.cn/problems/min-stack-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2003.02.%20%E6%A0%88%E7%9A%84%E6%9C%80%E5%B0%8F%E5%80%BC.md) | 栈、设计 | 简单 | -| 面试题 03.04 | [化栈为队](https://leetcode.cn/problems/implement-queue-using-stacks-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2003.04.%20%E5%8C%96%E6%A0%88%E4%B8%BA%E9%98%9F.md) | 栈、设计、队列 | 简单 | -| 面试题 04.02 | [最小高度树](https://leetcode.cn/problems/minimum-height-tree-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2004.02.%20%E6%9C%80%E5%B0%8F%E9%AB%98%E5%BA%A6%E6%A0%91.md) | 树、二叉搜索树、数组、分治、二叉树 | 简单 | -| 面试题 04.05 | [合法二叉搜索树](https://leetcode.cn/problems/legal-binary-search-tree-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2004.05.%20%E5%90%88%E6%B3%95%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | -| 面试题 04.06 | [后继者](https://leetcode.cn/problems/successor-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2004.06.%20%E5%90%8E%E7%BB%A7%E8%80%85.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | -| 面试题 04.08 | [首个共同祖先](https://leetcode.cn/problems/first-common-ancestor-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2004.08.%20%E9%A6%96%E4%B8%AA%E5%85%B1%E5%90%8C%E7%A5%96%E5%85%88.md) | 树、深度优先搜索、二叉树 | 中等 | -| 面试题 04.12 | [求和路径](https://leetcode.cn/problems/paths-with-sum-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2004.12.%20%E6%B1%82%E5%92%8C%E8%B7%AF%E5%BE%84.md) | 树、深度优先搜索、二叉树 | 中等 | -| 面试题 08.04 | [幂集](https://leetcode.cn/problems/power-set-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2008.04.%20%E5%B9%82%E9%9B%86.md) | 位运算、数组、回溯 | 中等 | -| 面试题 08.07 | [无重复字符串的排列组合](https://leetcode.cn/problems/permutation-i-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2008.07.%20%E6%97%A0%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%8E%92%E5%88%97%E7%BB%84%E5%90%88.md) | 字符串、回溯 | 中等 | -| 面试题 08.08 | [有重复字符串的排列组合](https://leetcode.cn/problems/permutation-ii-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2008.08.%20%E6%9C%89%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%8E%92%E5%88%97%E7%BB%84%E5%90%88.md) | 字符串、回溯 | 中等 | -| 面试题 08.09 | [括号](https://leetcode.cn/problems/bracket-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2008.09.%20%E6%8B%AC%E5%8F%B7.md) | 字符串、动态规划、回溯 | 中等 | -| 面试题 08.10 | [颜色填充](https://leetcode.cn/problems/color-fill-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2008.10.%20%E9%A2%9C%E8%89%B2%E5%A1%AB%E5%85%85.md) | 深度优先搜索、广度优先搜索、数组、矩阵 | 简单 | -| 面试题 08.12 | [八皇后](https://leetcode.cn/problems/eight-queens-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2008.12.%20%E5%85%AB%E7%9A%87%E5%90%8E.md) | 数组、回溯 | 困难 | -| 面试题 10.01 | [合并排序的数组](https://leetcode.cn/problems/sorted-merge-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2010.01.%20%E5%90%88%E5%B9%B6%E6%8E%92%E5%BA%8F%E7%9A%84%E6%95%B0%E7%BB%84.md) | 数组、双指针、排序 | 简单 | -| 面试题 10.02 | [变位词组](https://leetcode.cn/problems/group-anagrams-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2010.02.%20%E5%8F%98%E4%BD%8D%E8%AF%8D%E7%BB%84.md) | 数组、哈希表、字符串、排序 | 中等 | -| 面试题 10.09 | [排序矩阵查找](https://leetcode.cn/problems/sorted-matrix-search-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2010.09.%20%E6%8E%92%E5%BA%8F%E7%9F%A9%E9%98%B5%E6%9F%A5%E6%89%BE.md) | 数组、二分查找、分治、矩阵 | 中等 | -| 面试题 16.02 | [单词频率](https://leetcode.cn/problems/words-frequency-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2016.02.%20%E5%8D%95%E8%AF%8D%E9%A2%91%E7%8E%87.md) | 设计、字典树、数组、哈希表、字符串 | 中等 | -| 面试题 16.05 | [阶乘尾数](https://leetcode.cn/problems/factorial-zeros-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2016.05.%20%E9%98%B6%E4%B9%98%E5%B0%BE%E6%95%B0.md) | 数学 | 简单 | -| 面试题 16.26 | [计算器](https://leetcode.cn/problems/calculator-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2016.26.%20%E8%AE%A1%E7%AE%97%E5%99%A8.md) | 栈、数学、字符串 | 中等 | -| 面试题 17.06 | [2出现的次数](https://leetcode.cn/problems/number-of-2s-in-range-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.06.%202%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0.md) | 递归、数学、动态规划 | 困难 | -| 面试题 17.14 | [最小K个数](https://leetcode.cn/problems/smallest-k-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.14.%20%E6%9C%80%E5%B0%8FK%E4%B8%AA%E6%95%B0.md) | 数组、分治、快速选择、排序、堆（优先队列） | 中等 | -| 面试题 17.15 | [最长单词](https://leetcode.cn/problems/longest-word-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.15.%20%E6%9C%80%E9%95%BF%E5%8D%95%E8%AF%8D.md) | 字典树、数组、哈希表、字符串 | 中等 | -| 面试题 17.17 | [多次搜索](https://leetcode.cn/problems/multi-search-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.17.%20%E5%A4%9A%E6%AC%A1%E6%90%9C%E7%B4%A2.md) | 字典树、数组、哈希表、字符串、字符串匹配、滑动窗口 | 中等 | \ No newline at end of file diff --git a/Contents/00.Introduction/05.Categories-List.md b/Contents/00.Introduction/05.Categories-List.md deleted file mode 100644 index e43308a5..00000000 --- a/Contents/00.Introduction/05.Categories-List.md +++ /dev/null @@ -1,1098 +0,0 @@ -# LeetCode 题解（按分类排序，推荐刷题列表 ★★★） - -## 01. 数组 - -### 数组基础题目 - -#### 数组操作题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0189 | [轮转数组](https://leetcode.cn/problems/rotate-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0189.%20%E8%BD%AE%E8%BD%AC%E6%95%B0%E7%BB%84.md) | 数组、数学、双指针 | 中等 | -| 0066 | [加一](https://leetcode.cn/problems/plus-one/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0066.%20%E5%8A%A0%E4%B8%80.md) | 数组、数学 | 简单 | -| 0724 | [寻找数组的中心下标](https://leetcode.cn/problems/find-pivot-index/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0724.%20%E5%AF%BB%E6%89%BE%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%AD%E5%BF%83%E4%B8%8B%E6%A0%87.md) | 数组、前缀和 | 简单 | -| 0485 | [最大连续 1 的个数](https://leetcode.cn/problems/max-consecutive-ones/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0485.%20%E6%9C%80%E5%A4%A7%E8%BF%9E%E7%BB%AD%201%20%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 数组 | 简单 | -| 0238 | [除自身以外数组的乘积](https://leetcode.cn/problems/product-of-array-except-self/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0238.%20%E9%99%A4%E8%87%AA%E8%BA%AB%E4%BB%A5%E5%A4%96%E6%95%B0%E7%BB%84%E7%9A%84%E4%B9%98%E7%A7%AF.md) | 数组、前缀和 | 中等 | - -#### 二维数组题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0498 | [对角线遍历](https://leetcode.cn/problems/diagonal-traverse/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0498.%20%E5%AF%B9%E8%A7%92%E7%BA%BF%E9%81%8D%E5%8E%86.md) | 数组、矩阵、模拟 | 中等 | -| 0048 | [旋转图像](https://leetcode.cn/problems/rotate-image/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0048.%20%E6%97%8B%E8%BD%AC%E5%9B%BE%E5%83%8F.md) | 数组、数学、矩阵 | 中等 | -| 0073 | [矩阵置零](https://leetcode.cn/problems/set-matrix-zeroes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0073.%20%E7%9F%A9%E9%98%B5%E7%BD%AE%E9%9B%B6.md) | 数组、哈希表、矩阵 | 中等 | -| 0054 | [螺旋矩阵](https://leetcode.cn/problems/spiral-matrix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0054.%20%E8%9E%BA%E6%97%8B%E7%9F%A9%E9%98%B5.md) | 数组、矩阵、模拟 | 中等 | -| 0059 | [螺旋矩阵 II](https://leetcode.cn/problems/spiral-matrix-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0059.%20%E8%9E%BA%E6%97%8B%E7%9F%A9%E9%98%B5%20II.md) | 数组、矩阵、模拟 | 中等 | -| 0289 | [生命游戏](https://leetcode.cn/problems/game-of-life/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0289.%20%E7%94%9F%E5%91%BD%E6%B8%B8%E6%88%8F.md) | 数组、矩阵、模拟 | 中等 | - -### 排序算法题目 - -#### 冒泡排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 剑指 Offer 45 | [把数组排成最小的数](https://leetcode.cn/problems/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2045.%20%E6%8A%8A%E6%95%B0%E7%BB%84%E6%8E%92%E6%88%90%E6%9C%80%E5%B0%8F%E7%9A%84%E6%95%B0.md) | 贪心、字符串、排序 | 中等 | -| 0283 | [移动零](https://leetcode.cn/problems/move-zeroes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0283.%20%E7%A7%BB%E5%8A%A8%E9%9B%B6.md) | 数组、双指针 | 简单 | - -#### 选择排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0215 | [数组中的第K个最大元素](https://leetcode.cn/problems/kth-largest-element-in-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0215.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E7%AC%ACK%E4%B8%AA%E6%9C%80%E5%A4%A7%E5%85%83%E7%B4%A0.md) | 数组、分治、快速选择、排序、堆（优先队列） | 中等 | - -#### 插入排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0075 | [颜色分类](https://leetcode.cn/problems/sort-colors/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0075.%20%E9%A2%9C%E8%89%B2%E5%88%86%E7%B1%BB.md) | 数组、双指针、排序 | 中等 | - -#### 希尔排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0912 | [排序数组](https://leetcode.cn/problems/sort-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0912.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | -| 0506 | [相对名次](https://leetcode.cn/problems/relative-ranks/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0506.%20%E7%9B%B8%E5%AF%B9%E5%90%8D%E6%AC%A1.md) | 数组、排序、堆（优先队列） | 简单 | - -#### 归并排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0912 | [排序数组](https://leetcode.cn/problems/sort-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0912.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | -| 0088 | [合并两个有序数组](https://leetcode.cn/problems/merge-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0088.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、双指针、排序 | 简单 | -| 剑指 Offer 51 | [数组中的逆序对](https://leetcode.cn/problems/shu-zu-zhong-de-ni-xu-dui-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2051.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%80%86%E5%BA%8F%E5%AF%B9.md) | 树状数组、线段树、数组、二分查找、分治、有序集合、归并排序 | 困难 | -| 0315 | [计算右侧小于当前元素的个数](https://leetcode.cn/problems/count-of-smaller-numbers-after-self/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0315.%20%E8%AE%A1%E7%AE%97%E5%8F%B3%E4%BE%A7%E5%B0%8F%E4%BA%8E%E5%BD%93%E5%89%8D%E5%85%83%E7%B4%A0%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 树状数组、线段树、数组、二分查找、分治、有序集合、归并排序 | 困难 | - -#### 快速排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0912 | [排序数组](https://leetcode.cn/problems/sort-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0912.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | -| 0169 | [多数元素](https://leetcode.cn/problems/majority-element/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0169.%20%E5%A4%9A%E6%95%B0%E5%85%83%E7%B4%A0.md) | 数组、哈希表、分治、计数、排序 | 简单 | - -#### 堆排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0912 | [排序数组](https://leetcode.cn/problems/sort-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0912.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | -| 0215 | [数组中的第K个最大元素](https://leetcode.cn/problems/kth-largest-element-in-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0215.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E7%AC%ACK%E4%B8%AA%E6%9C%80%E5%A4%A7%E5%85%83%E7%B4%A0.md) | 数组、分治、快速选择、排序、堆（优先队列） | 中等 | -| 剑指 Offer 40 | [最小的k个数](https://leetcode.cn/problems/zui-xiao-de-kge-shu-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2040.%20%E6%9C%80%E5%B0%8F%E7%9A%84k%E4%B8%AA%E6%95%B0.md) | 数组、分治、快速选择、排序、堆（优先队列） | 简单 | - -#### 计数排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0912 | [排序数组](https://leetcode.cn/problems/sort-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0912.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | -| 1122 | [数组的相对排序](https://leetcode.cn/problems/relative-sort-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1122.%20%E6%95%B0%E7%BB%84%E7%9A%84%E7%9B%B8%E5%AF%B9%E6%8E%92%E5%BA%8F.md) | 数组、哈希表、计数排序、排序 | 简单 | - -#### 桶排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0912 | [排序数组](https://leetcode.cn/problems/sort-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0912.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | -| 0220 | [存在重复元素 III](https://leetcode.cn/problems/contains-duplicate-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0220.%20%E5%AD%98%E5%9C%A8%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0%20III.md) | 数组、桶排序、有序集合、排序、滑动窗口 | 困难 | -| 0164 | [最大间距](https://leetcode.cn/problems/maximum-gap/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0164.%20%E6%9C%80%E5%A4%A7%E9%97%B4%E8%B7%9D.md) | 数组、桶排序、基数排序、排序 | 困难 | - -#### 基数排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0164 | [最大间距](https://leetcode.cn/problems/maximum-gap/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0164.%20%E6%9C%80%E5%A4%A7%E9%97%B4%E8%B7%9D.md) | 数组、桶排序、基数排序、排序 | 困难 | -| 0561 | [数组拆分](https://leetcode.cn/problems/array-partition/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0561.%20%E6%95%B0%E7%BB%84%E6%8B%86%E5%88%86.md) | 贪心、数组、计数排序、排序 | 简单 | - -#### 其他排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0217 | [存在重复元素](https://leetcode.cn/problems/contains-duplicate/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0217.%20%E5%AD%98%E5%9C%A8%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0.md) | 数组、哈希表、排序 | 简单 | -| 0136 | [只出现一次的数字](https://leetcode.cn/problems/single-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0136.%20%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B0%E5%AD%97.md) | 位运算、数组 | 简单 | -| 0056 | [合并区间](https://leetcode.cn/problems/merge-intervals/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0056.%20%E5%90%88%E5%B9%B6%E5%8C%BA%E9%97%B4.md) | 数组、排序 | 中等 | -| 0179 | [最大数](https://leetcode.cn/problems/largest-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0179.%20%E6%9C%80%E5%A4%A7%E6%95%B0.md) | 贪心、数组、字符串、排序 | 中等 | -| 0384 | [打乱数组](https://leetcode.cn/problems/shuffle-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0384.%20%E6%89%93%E4%B9%B1%E6%95%B0%E7%BB%84.md) | 数组、数学、随机化 | 中等 | -| 剑指 Offer 45 | [把数组排成最小的数](https://leetcode.cn/problems/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2045.%20%E6%8A%8A%E6%95%B0%E7%BB%84%E6%8E%92%E6%88%90%E6%9C%80%E5%B0%8F%E7%9A%84%E6%95%B0.md) | 贪心、字符串、排序 | 中等 | - -### 二分查找题目 - -#### 二分下标题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0704 | [二分查找](https://leetcode.cn/problems/binary-search/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0704.%20%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE.md) | 数组、二分查找 | 简单 | -| 0374 | [猜数字大小](https://leetcode.cn/problems/guess-number-higher-or-lower/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0374.%20%E7%8C%9C%E6%95%B0%E5%AD%97%E5%A4%A7%E5%B0%8F.md) | 二分查找、交互 | 简单 | -| 0035 | [搜索插入位置](https://leetcode.cn/problems/search-insert-position/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0035.%20%E6%90%9C%E7%B4%A2%E6%8F%92%E5%85%A5%E4%BD%8D%E7%BD%AE.md) | 数组、二分查找 | 简单 | -| 0034 | [在排序数组中查找元素的第一个和最后一个位置](https://leetcode.cn/problems/find-first-and-last-position-of-element-in-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0034.%20%E5%9C%A8%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9F%A5%E6%89%BE%E5%85%83%E7%B4%A0%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%92%8C%E6%9C%80%E5%90%8E%E4%B8%80%E4%B8%AA%E4%BD%8D%E7%BD%AE.md) | 数组、二分查找 | 中等 | -| 0167 | [两数之和 II - 输入有序数组](https://leetcode.cn/problems/two-sum-ii-input-array-is-sorted/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0167.%20%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C%20II%20-%20%E8%BE%93%E5%85%A5%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、双指针、二分查找 | 中等 | -| 0153 | [寻找旋转排序数组中的最小值](https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0153.%20%E5%AF%BB%E6%89%BE%E6%97%8B%E8%BD%AC%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9C%80%E5%B0%8F%E5%80%BC.md) | 数组、二分查找 | 中等 | -| 0154 | [寻找旋转排序数组中的最小值 II](https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0154.%20%E5%AF%BB%E6%89%BE%E6%97%8B%E8%BD%AC%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9C%80%E5%B0%8F%E5%80%BC%20II.md) | 数组、二分查找 | 困难 | -| 0033 | [搜索旋转排序数组](https://leetcode.cn/problems/search-in-rotated-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0033.%20%E6%90%9C%E7%B4%A2%E6%97%8B%E8%BD%AC%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、二分查找 | 中等 | -| 0081 | [搜索旋转排序数组 II](https://leetcode.cn/problems/search-in-rotated-sorted-array-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0081.%20%E6%90%9C%E7%B4%A2%E6%97%8B%E8%BD%AC%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%20II.md) | 数组、二分查找 | 中等 | -| 0278 | [第一个错误的版本](https://leetcode.cn/problems/first-bad-version/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0278.%20%E7%AC%AC%E4%B8%80%E4%B8%AA%E9%94%99%E8%AF%AF%E7%9A%84%E7%89%88%E6%9C%AC.md) | 二分查找、交互 | 简单 | -| 0162 | [寻找峰值](https://leetcode.cn/problems/find-peak-element/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0162.%20%E5%AF%BB%E6%89%BE%E5%B3%B0%E5%80%BC.md) | 数组、二分查找 | 中等 | -| 0852 | [山脉数组的峰顶索引](https://leetcode.cn/problems/peak-index-in-a-mountain-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0852.%20%E5%B1%B1%E8%84%89%E6%95%B0%E7%BB%84%E7%9A%84%E5%B3%B0%E9%A1%B6%E7%B4%A2%E5%BC%95.md) | 数组、二分查找 | 中等 | -| 1095 | [山脉数组中查找目标值](https://leetcode.cn/problems/find-in-mountain-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1095.%20%E5%B1%B1%E8%84%89%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9F%A5%E6%89%BE%E7%9B%AE%E6%A0%87%E5%80%BC.md) | 数组、二分查找、交互 | 困难 | -| 0744 | [寻找比目标字母大的最小字母](https://leetcode.cn/problems/find-smallest-letter-greater-than-target/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0744.%20%E5%AF%BB%E6%89%BE%E6%AF%94%E7%9B%AE%E6%A0%87%E5%AD%97%E6%AF%8D%E5%A4%A7%E7%9A%84%E6%9C%80%E5%B0%8F%E5%AD%97%E6%AF%8D.md) | 数组、二分查找 | 简单 | -| 0004 | [寻找两个正序数组的中位数](https://leetcode.cn/problems/median-of-two-sorted-arrays/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0004.%20%E5%AF%BB%E6%89%BE%E4%B8%A4%E4%B8%AA%E6%AD%A3%E5%BA%8F%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0.md) | 数组、二分查找、分治 | 困难 | -| 0074 | [搜索二维矩阵](https://leetcode.cn/problems/search-a-2d-matrix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0074.%20%E6%90%9C%E7%B4%A2%E4%BA%8C%E7%BB%B4%E7%9F%A9%E9%98%B5.md) | 数组、二分查找、矩阵 | 中等 | -| 0240 | [搜索二维矩阵 II](https://leetcode.cn/problems/search-a-2d-matrix-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0240.%20%E6%90%9C%E7%B4%A2%E4%BA%8C%E7%BB%B4%E7%9F%A9%E9%98%B5%20II.md) | 数组、二分查找、分治、矩阵 | 中等 | - -#### 二分答案题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0069 | [x 的平方根](https://leetcode.cn/problems/sqrtx/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0069.%20x%20%E7%9A%84%E5%B9%B3%E6%96%B9%E6%A0%B9.md) | 数学、二分查找 | 简单 | -| 0287 | [寻找重复数](https://leetcode.cn/problems/find-the-duplicate-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0287.%20%E5%AF%BB%E6%89%BE%E9%87%8D%E5%A4%8D%E6%95%B0.md) | 位运算、数组、双指针、二分查找 | 中等 | -| 0050 | [Pow(x, n)](https://leetcode.cn/problems/powx-n/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0050.%20Pow%28x%2C%20n%29.md) | 递归、数学 | 中等 | -| 0367 | [有效的完全平方数](https://leetcode.cn/problems/valid-perfect-square/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0367.%20%E6%9C%89%E6%95%88%E7%9A%84%E5%AE%8C%E5%85%A8%E5%B9%B3%E6%96%B9%E6%95%B0.md) | 数学、二分查找 | 简单 | -| 1300 | [转变数组后最接近目标值的数组和](https://leetcode.cn/problems/sum-of-mutated-array-closest-to-target/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1300.%20%E8%BD%AC%E5%8F%98%E6%95%B0%E7%BB%84%E5%90%8E%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9B%AE%E6%A0%87%E5%80%BC%E7%9A%84%E6%95%B0%E7%BB%84%E5%92%8C.md) | 数组、二分查找、排序 | 中等 | -| 0400 | [第 N 位数字](https://leetcode.cn/problems/nth-digit/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0400.%20%E7%AC%AC%20N%20%E4%BD%8D%E6%95%B0%E5%AD%97.md) | 数学、二分查找 | 中等 | - -#### 复杂的二分查找问题 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0875 | [爱吃香蕉的珂珂](https://leetcode.cn/problems/koko-eating-bananas/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0875.%20%E7%88%B1%E5%90%83%E9%A6%99%E8%95%89%E7%9A%84%E7%8F%82%E7%8F%82.md) | 数组、二分查找 | 中等 | -| 0410 | [分割数组的最大值](https://leetcode.cn/problems/split-array-largest-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0410.%20%E5%88%86%E5%89%B2%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md) | 贪心、数组、二分查找、动态规划、前缀和 | 困难 | -| 0209 | [长度最小的子数组](https://leetcode.cn/problems/minimum-size-subarray-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0209.%20%E9%95%BF%E5%BA%A6%E6%9C%80%E5%B0%8F%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、二分查找、前缀和、滑动窗口 | 中等 | -| 0658 | [找到 K 个最接近的元素](https://leetcode.cn/problems/find-k-closest-elements/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0658.%20%E6%89%BE%E5%88%B0%20K%20%E4%B8%AA%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9A%84%E5%85%83%E7%B4%A0.md) | 数组、双指针、二分查找、排序、滑动窗口、堆（优先队列） | 中等 | -| 0270 | [最接近的二叉搜索树值](https://leetcode.cn/problems/closest-binary-search-tree-value/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0270.%20%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9A%84%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E5%80%BC.md) | 树、深度优先搜索、二叉搜索树、二分查找、二叉树 | 简单 | -| 0702 | [搜索长度未知的有序数组](https://leetcode.cn/problems/search-in-a-sorted-array-of-unknown-size/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0702.%20%E6%90%9C%E7%B4%A2%E9%95%BF%E5%BA%A6%E6%9C%AA%E7%9F%A5%E7%9A%84%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、二分查找、交互 | 中等 | -| 0349 | [两个数组的交集](https://leetcode.cn/problems/intersection-of-two-arrays/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0349.%20%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E7%9A%84%E4%BA%A4%E9%9B%86.md) | 数组、哈希表、双指针、二分查找、排序 | 简单 | -| 0350 | [两个数组的交集 II](https://leetcode.cn/problems/intersection-of-two-arrays-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0350.%20%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E7%9A%84%E4%BA%A4%E9%9B%86%20II.md) | 数组、哈希表、双指针、二分查找、排序 | 简单 | -| 0287 | [寻找重复数](https://leetcode.cn/problems/find-the-duplicate-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0287.%20%E5%AF%BB%E6%89%BE%E9%87%8D%E5%A4%8D%E6%95%B0.md) | 位运算、数组、双指针、二分查找 | 中等 | -| 0719 | [找出第 K 小的数对距离](https://leetcode.cn/problems/find-k-th-smallest-pair-distance/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0719.%20%E6%89%BE%E5%87%BA%E7%AC%AC%20K%20%E5%B0%8F%E7%9A%84%E6%95%B0%E5%AF%B9%E8%B7%9D%E7%A6%BB.md) | 数组、双指针、二分查找、排序 | 困难 | -| 0259 | [较小的三数之和](https://leetcode.cn/problems/3sum-smaller/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0259.%20%E8%BE%83%E5%B0%8F%E7%9A%84%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、双指针、二分查找、排序 | 中等 | -| 1011 | [在 D 天内送达包裹的能力](https://leetcode.cn/problems/capacity-to-ship-packages-within-d-days/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1011.%20%E5%9C%A8%20D%20%E5%A4%A9%E5%86%85%E9%80%81%E8%BE%BE%E5%8C%85%E8%A3%B9%E7%9A%84%E8%83%BD%E5%8A%9B.md) | 数组、二分查找 | 中等 | -| 1482 | [制作 m 束花所需的最少天数](https://leetcode.cn/problems/minimum-number-of-days-to-make-m-bouquets/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1482.%20%E5%88%B6%E4%BD%9C%20m%20%E6%9D%9F%E8%8A%B1%E6%89%80%E9%9C%80%E7%9A%84%E6%9C%80%E5%B0%91%E5%A4%A9%E6%95%B0.md) | 数组、二分查找 | 中等 | - -### 双指针题目 - -#### 对撞指针题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0167 | [两数之和 II - 输入有序数组](https://leetcode.cn/problems/two-sum-ii-input-array-is-sorted/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0167.%20%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C%20II%20-%20%E8%BE%93%E5%85%A5%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、双指针、二分查找 | 中等 | -| 0344 | [反转字符串](https://leetcode.cn/problems/reverse-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0344.%20%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 双指针、字符串 | 简单 | -| 0345 | [反转字符串中的元音字母](https://leetcode.cn/problems/reverse-vowels-of-a-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0345.%20%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%85%83%E9%9F%B3%E5%AD%97%E6%AF%8D.md) | 双指针、字符串 | 简单 | -| 0125 | [验证回文串](https://leetcode.cn/problems/valid-palindrome/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0125.%20%E9%AA%8C%E8%AF%81%E5%9B%9E%E6%96%87%E4%B8%B2.md) | 双指针、字符串 | 简单 | -| 0011 | [盛最多水的容器](https://leetcode.cn/problems/container-with-most-water/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0011.%20%E7%9B%9B%E6%9C%80%E5%A4%9A%E6%B0%B4%E7%9A%84%E5%AE%B9%E5%99%A8.md) | 贪心、数组、双指针 | 中等 | -| 0611 | [有效三角形的个数](https://leetcode.cn/problems/valid-triangle-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0611.%20%E6%9C%89%E6%95%88%E4%B8%89%E8%A7%92%E5%BD%A2%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 贪心、数组、双指针、二分查找、排序 | 中等 | -| 0015 | [三数之和](https://leetcode.cn/problems/3sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0015.%20%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、双指针、排序 | 中等 | -| 0016 | [最接近的三数之和](https://leetcode.cn/problems/3sum-closest/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0016.%20%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9A%84%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、双指针、排序 | 中等 | -| 0018 | [四数之和](https://leetcode.cn/problems/4sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0018.%20%E5%9B%9B%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、双指针、排序 | 中等 | -| 0259 | [较小的三数之和](https://leetcode.cn/problems/3sum-smaller/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0259.%20%E8%BE%83%E5%B0%8F%E7%9A%84%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、双指针、二分查找、排序 | 中等 | -| 0658 | [找到 K 个最接近的元素](https://leetcode.cn/problems/find-k-closest-elements/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0658.%20%E6%89%BE%E5%88%B0%20K%20%E4%B8%AA%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9A%84%E5%85%83%E7%B4%A0.md) | 数组、双指针、二分查找、排序、滑动窗口、堆（优先队列） | 中等 | -| 1099 | [小于 K 的两数之和](https://leetcode.cn/problems/two-sum-less-than-k/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1099.%20%E5%B0%8F%E4%BA%8E%20K%20%E7%9A%84%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、双指针、二分查找、排序 | 简单 | -| 0075 | [颜色分类](https://leetcode.cn/problems/sort-colors/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0075.%20%E9%A2%9C%E8%89%B2%E5%88%86%E7%B1%BB.md) | 数组、双指针、排序 | 中等 | -| 0360 | [有序转化数组](https://leetcode.cn/problems/sort-transformed-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0360.%20%E6%9C%89%E5%BA%8F%E8%BD%AC%E5%8C%96%E6%95%B0%E7%BB%84.md) | 数组、数学、双指针、排序 | 中等 | -| 0977 | [有序数组的平方](https://leetcode.cn/problems/squares-of-a-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0977.%20%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E7%9A%84%E5%B9%B3%E6%96%B9.md) | 数组、双指针、排序 | 简单 | -| 0881 | [救生艇](https://leetcode.cn/problems/boats-to-save-people/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0881.%20%E6%95%91%E7%94%9F%E8%89%87.md) | 贪心、数组、双指针、排序 | 中等 | -| 0042 | [接雨水](https://leetcode.cn/problems/trapping-rain-water/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0042.%20%E6%8E%A5%E9%9B%A8%E6%B0%B4.md) | 栈、数组、双指针、动态规划、单调栈 | 困难 | -| 0443 | [压缩字符串](https://leetcode.cn/problems/string-compression/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0443.%20%E5%8E%8B%E7%BC%A9%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 双指针、字符串 | 中等 | - -#### 快慢指针题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0026 | [删除有序数组中的重复项](https://leetcode.cn/problems/remove-duplicates-from-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0026.%20%E5%88%A0%E9%99%A4%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E9%A1%B9.md) | 数组、双指针 | 简单 | -| 0080 | [删除有序数组中的重复项 II](https://leetcode.cn/problems/remove-duplicates-from-sorted-array-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0080.%20%E5%88%A0%E9%99%A4%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E9%A1%B9%20II.md) | 数组、双指针 | 中等 | -| 0027 | [移除元素](https://leetcode.cn/problems/remove-element/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0027.%20%E7%A7%BB%E9%99%A4%E5%85%83%E7%B4%A0.md) | 数组、双指针 | 简单 | -| 0283 | [移动零](https://leetcode.cn/problems/move-zeroes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0283.%20%E7%A7%BB%E5%8A%A8%E9%9B%B6.md) | 数组、双指针 | 简单 | -| 0845 | [数组中的最长山脉](https://leetcode.cn/problems/longest-mountain-in-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0845.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9C%80%E9%95%BF%E5%B1%B1%E8%84%89.md) | 数组、双指针、动态规划、枚举 | 中等 | -| 0088 | [合并两个有序数组](https://leetcode.cn/problems/merge-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0088.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、双指针、排序 | 简单 | -| 0719 | [找出第 K 小的数对距离](https://leetcode.cn/problems/find-k-th-smallest-pair-distance/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0719.%20%E6%89%BE%E5%87%BA%E7%AC%AC%20K%20%E5%B0%8F%E7%9A%84%E6%95%B0%E5%AF%B9%E8%B7%9D%E7%A6%BB.md) | 数组、双指针、二分查找、排序 | 困难 | -| 0334 | [递增的三元子序列](https://leetcode.cn/problems/increasing-triplet-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0334.%20%E9%80%92%E5%A2%9E%E7%9A%84%E4%B8%89%E5%85%83%E5%AD%90%E5%BA%8F%E5%88%97.md) | 贪心、数组 | 中等 | -| 0978 | [最长湍流子数组](https://leetcode.cn/problems/longest-turbulent-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0978.%20%E6%9C%80%E9%95%BF%E6%B9%8D%E6%B5%81%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、动态规划、滑动窗口 | 中等 | -| 剑指 Offer 21 | [调整数组顺序使奇数位于偶数前面](https://leetcode.cn/problems/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2021.%20%E8%B0%83%E6%95%B4%E6%95%B0%E7%BB%84%E9%A1%BA%E5%BA%8F%E4%BD%BF%E5%A5%87%E6%95%B0%E4%BD%8D%E4%BA%8E%E5%81%B6%E6%95%B0%E5%89%8D%E9%9D%A2.md) | 数组、双指针、排序 | 简单 | - -#### 分离双指针题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0350 | [两个数组的交集 II](https://leetcode.cn/problems/intersection-of-two-arrays-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0350.%20%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E7%9A%84%E4%BA%A4%E9%9B%86%20II.md) | 数组、哈希表、双指针、二分查找、排序 | 简单 | -| 0925 | [长按键入](https://leetcode.cn/problems/long-pressed-name/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0925.%20%E9%95%BF%E6%8C%89%E9%94%AE%E5%85%A5.md) | 双指针、字符串 | 简单 | -| 0844 | [比较含退格的字符串](https://leetcode.cn/problems/backspace-string-compare/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0844.%20%E6%AF%94%E8%BE%83%E5%90%AB%E9%80%80%E6%A0%BC%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 栈、双指针、字符串、模拟 | 简单 | -| 1229 | [安排会议日程](https://leetcode.cn/problems/meeting-scheduler/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1229.%20%E5%AE%89%E6%8E%92%E4%BC%9A%E8%AE%AE%E6%97%A5%E7%A8%8B.md) | 数组、双指针、排序 | 中等 | -| 0415 | [字符串相加](https://leetcode.cn/problems/add-strings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0415.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E5%8A%A0.md) | 数学、字符串、模拟 | 简单 | -| 0392 | [判断子序列](https://leetcode.cn/problems/is-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0392.%20%E5%88%A4%E6%96%AD%E5%AD%90%E5%BA%8F%E5%88%97.md) | 双指针、字符串、动态规划 | 简单 | - -### 滑动窗口题目 - -#### 固定长度窗口题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 1343 | [大小为 K 且平均值大于等于阈值的子数组数目](https://leetcode.cn/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1343.%20%E5%A4%A7%E5%B0%8F%E4%B8%BA%20K%20%E4%B8%94%E5%B9%B3%E5%9D%87%E5%80%BC%E5%A4%A7%E4%BA%8E%E7%AD%89%E4%BA%8E%E9%98%88%E5%80%BC%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84%E6%95%B0%E7%9B%AE.md) | 数组、滑动窗口 | 中等 | -| 0643 | [子数组最大平均数 I](https://leetcode.cn/problems/maximum-average-subarray-i/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0643.%20%E5%AD%90%E6%95%B0%E7%BB%84%E6%9C%80%E5%A4%A7%E5%B9%B3%E5%9D%87%E6%95%B0%20I.md) | 数组、滑动窗口 | 简单 | -| 1052 | [爱生气的书店老板](https://leetcode.cn/problems/grumpy-bookstore-owner/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1052.%20%E7%88%B1%E7%94%9F%E6%B0%94%E7%9A%84%E4%B9%A6%E5%BA%97%E8%80%81%E6%9D%BF.md) | 数组、滑动窗口 | 中等 | -| 1423 | [可获得的最大点数](https://leetcode.cn/problems/maximum-points-you-can-obtain-from-cards/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1423.%20%E5%8F%AF%E8%8E%B7%E5%BE%97%E7%9A%84%E6%9C%80%E5%A4%A7%E7%82%B9%E6%95%B0.md) | 数组、前缀和、滑动窗口 | 中等 | -| 1456 | [定长子串中元音的最大数目](https://leetcode.cn/problems/maximum-number-of-vowels-in-a-substring-of-given-length/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1456.%20%E5%AE%9A%E9%95%BF%E5%AD%90%E4%B8%B2%E4%B8%AD%E5%85%83%E9%9F%B3%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E7%9B%AE.md) | 字符串、滑动窗口 | 中等 | -| 0567 | [字符串的排列](https://leetcode.cn/problems/permutation-in-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0567.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%8E%92%E5%88%97.md) | 哈希表、双指针、字符串、滑动窗口 | 中等 | -| 1100 | [长度为 K 的无重复字符子串](https://leetcode.cn/problems/find-k-length-substrings-with-no-repeated-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1100.%20%E9%95%BF%E5%BA%A6%E4%B8%BA%20K%20%E7%9A%84%E6%97%A0%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E5%AD%90%E4%B8%B2.md) | 哈希表、字符串、滑动窗口 | 中等 | -| 1151 | [最少交换次数来组合所有的 1](https://leetcode.cn/problems/minimum-swaps-to-group-all-1s-together/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1151.%20%E6%9C%80%E5%B0%91%E4%BA%A4%E6%8D%A2%E6%AC%A1%E6%95%B0%E6%9D%A5%E7%BB%84%E5%90%88%E6%89%80%E6%9C%89%E7%9A%84%201.md) | 数组、滑动窗口 | 中等 | -| 1176 | [健身计划评估](https://leetcode.cn/problems/diet-plan-performance/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1176.%20%E5%81%A5%E8%BA%AB%E8%AE%A1%E5%88%92%E8%AF%84%E4%BC%B0.md) | 数组、滑动窗口 | 简单 | -| 0438 | [找到字符串中所有字母异位词](https://leetcode.cn/problems/find-all-anagrams-in-a-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0438.%20%E6%89%BE%E5%88%B0%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E6%89%80%E6%9C%89%E5%AD%97%E6%AF%8D%E5%BC%82%E4%BD%8D%E8%AF%8D.md) | 哈希表、字符串、滑动窗口 | 中等 | -| 0995 | [K 连续位的最小翻转次数](https://leetcode.cn/problems/minimum-number-of-k-consecutive-bit-flips/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0995.%20K%20%E8%BF%9E%E7%BB%AD%E4%BD%8D%E7%9A%84%E6%9C%80%E5%B0%8F%E7%BF%BB%E8%BD%AC%E6%AC%A1%E6%95%B0.md) | 位运算、队列、数组、前缀和、滑动窗口 | 困难 | -| 0683 | [K 个关闭的灯泡](https://leetcode.cn/problems/k-empty-slots/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0683.%20K%20%E4%B8%AA%E5%85%B3%E9%97%AD%E7%9A%84%E7%81%AF%E6%B3%A1.md) | 树状数组、数组、有序集合、滑动窗口 | 困难 | -| 0220 | [存在重复元素 III](https://leetcode.cn/problems/contains-duplicate-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0220.%20%E5%AD%98%E5%9C%A8%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0%20III.md) | 数组、桶排序、有序集合、排序、滑动窗口 | 困难 | -| 0239 | [滑动窗口最大值](https://leetcode.cn/problems/sliding-window-maximum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0239.%20%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E6%9C%80%E5%A4%A7%E5%80%BC.md) | 队列、数组、滑动窗口、单调队列、堆（优先队列） | 困难 | -| 0480 | [滑动窗口中位数](https://leetcode.cn/problems/sliding-window-median/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0480.%20%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E4%B8%AD%E4%BD%8D%E6%95%B0.md) | 数组、哈希表、滑动窗口、堆（优先队列） | 困难 | - -#### 不定长度窗口题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0674 | [最长连续递增序列](https://leetcode.cn/problems/longest-continuous-increasing-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0674.%20%E6%9C%80%E9%95%BF%E8%BF%9E%E7%BB%AD%E9%80%92%E5%A2%9E%E5%BA%8F%E5%88%97.md) | 数组 | 简单 | -| 0485 | [最大连续 1 的个数](https://leetcode.cn/problems/max-consecutive-ones/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0485.%20%E6%9C%80%E5%A4%A7%E8%BF%9E%E7%BB%AD%201%20%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 数组 | 简单 | -| 0487 | [最大连续1的个数 II](https://leetcode.cn/problems/max-consecutive-ones-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0487.%20%E6%9C%80%E5%A4%A7%E8%BF%9E%E7%BB%AD1%E7%9A%84%E4%B8%AA%E6%95%B0%20II.md) | 数组、动态规划、滑动窗口 | 中等 | -| 0076 | [最小覆盖子串](https://leetcode.cn/problems/minimum-window-substring/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0076.%20%E6%9C%80%E5%B0%8F%E8%A6%86%E7%9B%96%E5%AD%90%E4%B8%B2.md) | 哈希表、字符串、滑动窗口 | 困难 | -| 0718 | [最长重复子数组](https://leetcode.cn/problems/maximum-length-of-repeated-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0718.%20%E6%9C%80%E9%95%BF%E9%87%8D%E5%A4%8D%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、二分查找、动态规划、滑动窗口、哈希函数、滚动哈希 | 中等 | -| 0209 | [长度最小的子数组](https://leetcode.cn/problems/minimum-size-subarray-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0209.%20%E9%95%BF%E5%BA%A6%E6%9C%80%E5%B0%8F%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、二分查找、前缀和、滑动窗口 | 中等 | -| 1004 | [最大连续1的个数 III](https://leetcode.cn/problems/max-consecutive-ones-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1004.%20%E6%9C%80%E5%A4%A7%E8%BF%9E%E7%BB%AD1%E7%9A%84%E4%B8%AA%E6%95%B0%20III.md) | 数组、二分查找、前缀和、滑动窗口 | 中等 | -| 1658 | [将 x 减到 0 的最小操作数](https://leetcode.cn/problems/minimum-operations-to-reduce-x-to-zero/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1658.%20%E5%B0%86%20x%20%E5%87%8F%E5%88%B0%200%20%E7%9A%84%E6%9C%80%E5%B0%8F%E6%93%8D%E4%BD%9C%E6%95%B0.md) | 数组、哈希表、二分查找、前缀和、滑动窗口 | 中等 | -| 0424 | [替换后的最长重复字符](https://leetcode.cn/problems/longest-repeating-character-replacement/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0424.%20%E6%9B%BF%E6%8D%A2%E5%90%8E%E7%9A%84%E6%9C%80%E9%95%BF%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6.md) | 哈希表、字符串、滑动窗口 | 中等 | -| 0003 | [无重复字符的最长子串](https://leetcode.cn/problems/longest-substring-without-repeating-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0003.%20%E6%97%A0%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2.md) | 哈希表、字符串、滑动窗口 | 中等 | -| 1695 | [删除子数组的最大得分](https://leetcode.cn/problems/maximum-erasure-value/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1695.%20%E5%88%A0%E9%99%A4%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%BE%97%E5%88%86.md) | 数组、哈希表、滑动窗口 | 中等 | -| 1208 | [尽可能使字符串相等](https://leetcode.cn/problems/get-equal-substrings-within-budget/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1208.%20%E5%B0%BD%E5%8F%AF%E8%83%BD%E4%BD%BF%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E7%AD%89.md) | 字符串、二分查找、前缀和、滑动窗口 | 中等 | -| 1493 | [删掉一个元素以后全为 1 的最长子数组](https://leetcode.cn/problems/longest-subarray-of-1s-after-deleting-one-element/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1493.%20%E5%88%A0%E6%8E%89%E4%B8%80%E4%B8%AA%E5%85%83%E7%B4%A0%E4%BB%A5%E5%90%8E%E5%85%A8%E4%B8%BA%201%20%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、动态规划、滑动窗口 | 中等 | -| 0727 | [最小窗口子序列](https://leetcode.cn/problems/minimum-window-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0727.%20%E6%9C%80%E5%B0%8F%E7%AA%97%E5%8F%A3%E5%AD%90%E5%BA%8F%E5%88%97.md) | 字符串、动态规划、滑动窗口 | 困难 | -| 0159 | [至多包含两个不同字符的最长子串](https://leetcode.cn/problems/longest-substring-with-at-most-two-distinct-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0159.%20%E8%87%B3%E5%A4%9A%E5%8C%85%E5%90%AB%E4%B8%A4%E4%B8%AA%E4%B8%8D%E5%90%8C%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2.md) | 哈希表、字符串、滑动窗口 | 中等 | -| 0340 | [至多包含 K 个不同字符的最长子串](https://leetcode.cn/problems/longest-substring-with-at-most-k-distinct-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0340.%20%E8%87%B3%E5%A4%9A%E5%8C%85%E5%90%AB%20K%20%E4%B8%AA%E4%B8%8D%E5%90%8C%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2.md) | 哈希表、字符串、滑动窗口 | 中等 | -| 0795 | [区间子数组个数](https://leetcode.cn/problems/number-of-subarrays-with-bounded-maximum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0795.%20%E5%8C%BA%E9%97%B4%E5%AD%90%E6%95%B0%E7%BB%84%E4%B8%AA%E6%95%B0.md) | 数组、双指针 | 中等 | -| 0992 | [K 个不同整数的子数组](https://leetcode.cn/problems/subarrays-with-k-different-integers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0992.%20K%20%E4%B8%AA%E4%B8%8D%E5%90%8C%E6%95%B4%E6%95%B0%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、哈希表、计数、滑动窗口 | 困难 | -| 0713 | [乘积小于 K 的子数组](https://leetcode.cn/problems/subarray-product-less-than-k/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0713.%20%E4%B9%98%E7%A7%AF%E5%B0%8F%E4%BA%8E%20K%20%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、滑动窗口 | 中等 | -| 0904 | [水果成篮](https://leetcode.cn/problems/fruit-into-baskets/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0904.%20%E6%B0%B4%E6%9E%9C%E6%88%90%E7%AF%AE.md) | 数组、哈希表、滑动窗口 | 中等 | -| 1358 | [包含所有三种字符的子字符串数目](https://leetcode.cn/problems/number-of-substrings-containing-all-three-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1358.%20%E5%8C%85%E5%90%AB%E6%89%80%E6%9C%89%E4%B8%89%E7%A7%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%95%B0%E7%9B%AE.md) | 哈希表、字符串、滑动窗口 | 中等 | -| 0467 | [环绕字符串中唯一的子字符串](https://leetcode.cn/problems/unique-substrings-in-wraparound-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0467.%20%E7%8E%AF%E7%BB%95%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E5%94%AF%E4%B8%80%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 字符串、动态规划 | 中等 | -| 1438 | [绝对差不超过限制的最长连续子数组](https://leetcode.cn/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1438.%20%E7%BB%9D%E5%AF%B9%E5%B7%AE%E4%B8%8D%E8%B6%85%E8%BF%87%E9%99%90%E5%88%B6%E7%9A%84%E6%9C%80%E9%95%BF%E8%BF%9E%E7%BB%AD%E5%AD%90%E6%95%B0%E7%BB%84.md) | 队列、数组、有序集合、滑动窗口、单调队列、堆（优先队列） | 中等 | - -## 02. 链表 - -### 链表经典题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0707 | [设计链表](https://leetcode.cn/problems/design-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0707.%20%E8%AE%BE%E8%AE%A1%E9%93%BE%E8%A1%A8.md) | 设计、链表 | 中等 | -| 0083 | [删除排序链表中的重复元素](https://leetcode.cn/problems/remove-duplicates-from-sorted-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0083.%20%E5%88%A0%E9%99%A4%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0.md) | 链表 | 简单 | -| 0082 | [删除排序链表中的重复元素 II](https://leetcode.cn/problems/remove-duplicates-from-sorted-list-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0082.%20%E5%88%A0%E9%99%A4%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0%20II.md) | 链表、双指针 | 中等 | -| 0206 | [反转链表](https://leetcode.cn/problems/reverse-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0206.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8.md) | 递归、链表 | 简单 | -| 0092 | [反转链表 II](https://leetcode.cn/problems/reverse-linked-list-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0092.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8%20II.md) | 链表 | 中等 | -| 0025 | [K 个一组翻转链表](https://leetcode.cn/problems/reverse-nodes-in-k-group/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0025.%20K%20%E4%B8%AA%E4%B8%80%E7%BB%84%E7%BF%BB%E8%BD%AC%E9%93%BE%E8%A1%A8.md) | 递归、链表 | 困难 | -| 0203 | [移除链表元素](https://leetcode.cn/problems/remove-linked-list-elements/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0203.%20%E7%A7%BB%E9%99%A4%E9%93%BE%E8%A1%A8%E5%85%83%E7%B4%A0.md) | 递归、链表 | 简单 | -| 0328 | [奇偶链表](https://leetcode.cn/problems/odd-even-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0328.%20%E5%A5%87%E5%81%B6%E9%93%BE%E8%A1%A8.md) | 链表 | 中等 | -| 0234 | [回文链表](https://leetcode.cn/problems/palindrome-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0234.%20%E5%9B%9E%E6%96%87%E9%93%BE%E8%A1%A8.md) | 栈、递归、链表、双指针 | 简单 | -| 0430 | [扁平化多级双向链表](https://leetcode.cn/problems/flatten-a-multilevel-doubly-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0430.%20%E6%89%81%E5%B9%B3%E5%8C%96%E5%A4%9A%E7%BA%A7%E5%8F%8C%E5%90%91%E9%93%BE%E8%A1%A8.md) | 深度优先搜索、链表、双向链表 | 中等 | -| 0138 | [复制带随机指针的链表](https://leetcode.cn/problems/copy-list-with-random-pointer/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0138.%20%E5%A4%8D%E5%88%B6%E5%B8%A6%E9%9A%8F%E6%9C%BA%E6%8C%87%E9%92%88%E7%9A%84%E9%93%BE%E8%A1%A8.md) | 哈希表、链表 | 中等 | -| 0061 | [旋转链表](https://leetcode.cn/problems/rotate-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0061.%20%E6%97%8B%E8%BD%AC%E9%93%BE%E8%A1%A8.md) | 链表、双指针 | 中等 | - -### 链表排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0148 | [排序链表](https://leetcode.cn/problems/sort-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0148.%20%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8.md) | 链表、双指针、分治、排序、归并排序 | 中等 | -| 0021 | [合并两个有序链表](https://leetcode.cn/problems/merge-two-sorted-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0021.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E9%93%BE%E8%A1%A8.md) | 递归、链表 | 简单 | -| 0023 | [合并 K 个升序链表](https://leetcode.cn/problems/merge-k-sorted-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0023.%20%E5%90%88%E5%B9%B6%20K%20%E4%B8%AA%E5%8D%87%E5%BA%8F%E9%93%BE%E8%A1%A8.md) | 链表、分治、堆（优先队列）、归并排序 | 困难 | -| 0147 | [对链表进行插入排序](https://leetcode.cn/problems/insertion-sort-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0147.%20%E5%AF%B9%E9%93%BE%E8%A1%A8%E8%BF%9B%E8%A1%8C%E6%8F%92%E5%85%A5%E6%8E%92%E5%BA%8F.md) | 链表、排序 | 中等 | - -### 链表双指针题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0141 | [环形链表](https://leetcode.cn/problems/linked-list-cycle/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0141.%20%E7%8E%AF%E5%BD%A2%E9%93%BE%E8%A1%A8.md) | 哈希表、链表、双指针 | 简单 | -| 0142 | [环形链表 II](https://leetcode.cn/problems/linked-list-cycle-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0142.%20%E7%8E%AF%E5%BD%A2%E9%93%BE%E8%A1%A8%20II.md) | 哈希表、链表、双指针 | 中等 | -| 0160 | [相交链表](https://leetcode.cn/problems/intersection-of-two-linked-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0160.%20%E7%9B%B8%E4%BA%A4%E9%93%BE%E8%A1%A8.md) | 哈希表、链表、双指针 | 简单 | -| 0019 | [删除链表的倒数第 N 个结点](https://leetcode.cn/problems/remove-nth-node-from-end-of-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0019.%20%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E7%9A%84%E5%80%92%E6%95%B0%E7%AC%AC%20N%20%E4%B8%AA%E7%BB%93%E7%82%B9.md) | 链表、双指针 | 中等 | -| 0876 | [链表的中间结点](https://leetcode.cn/problems/middle-of-the-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0876.%20%E9%93%BE%E8%A1%A8%E7%9A%84%E4%B8%AD%E9%97%B4%E7%BB%93%E7%82%B9.md) | 链表、双指针 | 简单 | -| 剑指 Offer 22 | [链表中倒数第k个节点](https://leetcode.cn/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2022.%20%E9%93%BE%E8%A1%A8%E4%B8%AD%E5%80%92%E6%95%B0%E7%AC%ACk%E4%B8%AA%E8%8A%82%E7%82%B9.md) | 链表、双指针 | 简单 | -| 0143 | [重排链表](https://leetcode.cn/problems/reorder-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0143.%20%E9%87%8D%E6%8E%92%E9%93%BE%E8%A1%A8.md) | 栈、递归、链表、双指针 | 中等 | -| 0002 | [两数相加](https://leetcode.cn/problems/add-two-numbers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0002.%20%E4%B8%A4%E6%95%B0%E7%9B%B8%E5%8A%A0.md) | 递归、链表、数学 | 中等 | -| 0445 | [两数相加 II](https://leetcode.cn/problems/add-two-numbers-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0445.%20%E4%B8%A4%E6%95%B0%E7%9B%B8%E5%8A%A0%20II.md) | 栈、链表、数学 | 中等 | - -## 03. 堆栈 - -### 堆栈基础题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 1047 | [删除字符串中的所有相邻重复项](https://leetcode.cn/problems/remove-all-adjacent-duplicates-in-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1047.%20%E5%88%A0%E9%99%A4%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E6%89%80%E6%9C%89%E7%9B%B8%E9%82%BB%E9%87%8D%E5%A4%8D%E9%A1%B9.md) | 栈、字符串 | 简单 | -| 0155 | [最小栈](https://leetcode.cn/problems/min-stack/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0155.%20%E6%9C%80%E5%B0%8F%E6%A0%88.md) | 栈、设计 | 中等 | -| 0020 | [有效的括号](https://leetcode.cn/problems/valid-parentheses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0020.%20%E6%9C%89%E6%95%88%E7%9A%84%E6%8B%AC%E5%8F%B7.md) | 栈、字符串 | 简单 | -| 0227 | [基本计算器 II](https://leetcode.cn/problems/basic-calculator-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0227.%20%E5%9F%BA%E6%9C%AC%E8%AE%A1%E7%AE%97%E5%99%A8%20II.md) | 栈、数学、字符串 | 中等 | -| 0739 | [每日温度](https://leetcode.cn/problems/daily-temperatures/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0739.%20%E6%AF%8F%E6%97%A5%E6%B8%A9%E5%BA%A6.md) | 栈、数组、单调栈 | 中等 | -| 0150 | [逆波兰表达式求值](https://leetcode.cn/problems/evaluate-reverse-polish-notation/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0150.%20%E9%80%86%E6%B3%A2%E5%85%B0%E8%A1%A8%E8%BE%BE%E5%BC%8F%E6%B1%82%E5%80%BC.md) | 栈、数组、数学 | 中等 | -| 0232 | [用栈实现队列](https://leetcode.cn/problems/implement-queue-using-stacks/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0232.%20%E7%94%A8%E6%A0%88%E5%AE%9E%E7%8E%B0%E9%98%9F%E5%88%97.md) | 栈、设计、队列 | 简单 | -| 剑指 Offer 09 | [用两个栈实现队列](https://leetcode.cn/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2009.%20%E7%94%A8%E4%B8%A4%E4%B8%AA%E6%A0%88%E5%AE%9E%E7%8E%B0%E9%98%9F%E5%88%97.md) | 栈、设计、队列 | 简单 | -| 0394 | [字符串解码](https://leetcode.cn/problems/decode-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0394.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%A7%A3%E7%A0%81.md) | 栈、递归、字符串 | 中等 | -| 0032 | [最长有效括号](https://leetcode.cn/problems/longest-valid-parentheses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0032.%20%E6%9C%80%E9%95%BF%E6%9C%89%E6%95%88%E6%8B%AC%E5%8F%B7.md) | 栈、字符串、动态规划 | 困难 | -| 0946 | [验证栈序列](https://leetcode.cn/problems/validate-stack-sequences/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0946.%20%E9%AA%8C%E8%AF%81%E6%A0%88%E5%BA%8F%E5%88%97.md) | 栈、数组、模拟 | 中等 | -| 剑指 Offer 06 | [从尾到头打印链表](https://leetcode.cn/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2006.%20%E4%BB%8E%E5%B0%BE%E5%88%B0%E5%A4%B4%E6%89%93%E5%8D%B0%E9%93%BE%E8%A1%A8.md) | 栈、递归、链表、双指针 | 简单 | -| 0071 | [简化路径](https://leetcode.cn/problems/simplify-path/) | | 栈、字符串 | 中等 | - -### 单调栈 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0739 | [每日温度](https://leetcode.cn/problems/daily-temperatures/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0739.%20%E6%AF%8F%E6%97%A5%E6%B8%A9%E5%BA%A6.md) | 栈、数组、单调栈 | 中等 | -| 0496 | [下一个更大元素 I](https://leetcode.cn/problems/next-greater-element-i/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0496.%20%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%9B%B4%E5%A4%A7%E5%85%83%E7%B4%A0%20I.md) | 栈、数组、哈希表、单调栈 | 简单 | -| 0503 | [下一个更大元素 II](https://leetcode.cn/problems/next-greater-element-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0503.%20%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%9B%B4%E5%A4%A7%E5%85%83%E7%B4%A0%20II.md) | 栈、数组、单调栈 | 中等 | -| 0901 | [股票价格跨度](https://leetcode.cn/problems/online-stock-span/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0901.%20%E8%82%A1%E7%A5%A8%E4%BB%B7%E6%A0%BC%E8%B7%A8%E5%BA%A6.md) | 栈、设计、数据流、单调栈 | 中等 | -| 0084 | [柱状图中最大的矩形](https://leetcode.cn/problems/largest-rectangle-in-histogram/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0084.%20%E6%9F%B1%E7%8A%B6%E5%9B%BE%E4%B8%AD%E6%9C%80%E5%A4%A7%E7%9A%84%E7%9F%A9%E5%BD%A2.md) | 栈、数组、单调栈 | 困难 | -| 0316 | [去除重复字母](https://leetcode.cn/problems/remove-duplicate-letters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0316.%20%E5%8E%BB%E9%99%A4%E9%87%8D%E5%A4%8D%E5%AD%97%E6%AF%8D.md) | 栈、贪心、字符串、单调栈 | 中等 | -| 0042 | [接雨水](https://leetcode.cn/problems/trapping-rain-water/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0042.%20%E6%8E%A5%E9%9B%A8%E6%B0%B4.md) | 栈、数组、双指针、动态规划、单调栈 | 困难 | -| 0085 | [最大矩形](https://leetcode.cn/problems/maximal-rectangle/) | | 栈、数组、动态规划、矩阵、单调栈 | 困难 | -| 0862 | [和至少为 K 的最短子数组](https://leetcode.cn/problems/shortest-subarray-with-sum-at-least-k/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0862.%20%E5%92%8C%E8%87%B3%E5%B0%91%E4%B8%BA%20K%20%E7%9A%84%E6%9C%80%E7%9F%AD%E5%AD%90%E6%95%B0%E7%BB%84.md) | 队列、数组、二分查找、前缀和、滑动窗口、单调队列、堆（优先队列） | 困难 | - -## 04. 队列 - -### 队列基础题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0622 | [设计循环队列](https://leetcode.cn/problems/design-circular-queue/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0622.%20%E8%AE%BE%E8%AE%A1%E5%BE%AA%E7%8E%AF%E9%98%9F%E5%88%97.md) | 设计、队列、数组、链表 | 中等 | -| 0346 | [数据流中的移动平均值](https://leetcode.cn/problems/moving-average-from-data-stream/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0346.%20%E6%95%B0%E6%8D%AE%E6%B5%81%E4%B8%AD%E7%9A%84%E7%A7%BB%E5%8A%A8%E5%B9%B3%E5%9D%87%E5%80%BC.md) | 设计、队列、数组、数据流 | 简单 | -| 0225 | [用队列实现栈](https://leetcode.cn/problems/implement-stack-using-queues/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0225.%20%E7%94%A8%E9%98%9F%E5%88%97%E5%AE%9E%E7%8E%B0%E6%A0%88.md) | 栈、设计、队列 | 简单 | - -### 优先队列题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0703 | [数据流中的第 K 大元素](https://leetcode.cn/problems/kth-largest-element-in-a-stream/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0703.%20%E6%95%B0%E6%8D%AE%E6%B5%81%E4%B8%AD%E7%9A%84%E7%AC%AC%20K%20%E5%A4%A7%E5%85%83%E7%B4%A0.md) | 树、设计、二叉搜索树、二叉树、数据流、堆（优先队列） | 简单 | -| 0347 | [前 K 个高频元素](https://leetcode.cn/problems/top-k-frequent-elements/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0347.%20%E5%89%8D%20K%20%E4%B8%AA%E9%AB%98%E9%A2%91%E5%85%83%E7%B4%A0.md) | 数组、哈希表、分治、桶排序、计数、快速选择、排序、堆（优先队列） | 中等 | -| 0451 | [根据字符出现频率排序](https://leetcode.cn/problems/sort-characters-by-frequency/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0451.%20%E6%A0%B9%E6%8D%AE%E5%AD%97%E7%AC%A6%E5%87%BA%E7%8E%B0%E9%A2%91%E7%8E%87%E6%8E%92%E5%BA%8F.md) | 哈希表、字符串、桶排序、计数、排序、堆（优先队列） | 中等 | -| 0973 | [最接近原点的 K 个点](https://leetcode.cn/problems/k-closest-points-to-origin/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0973.%20%E6%9C%80%E6%8E%A5%E8%BF%91%E5%8E%9F%E7%82%B9%E7%9A%84%20K%20%E4%B8%AA%E7%82%B9.md) | 几何、数组、数学、分治、快速选择、排序、堆（优先队列） | 中等 | -| 1296 | [划分数组为连续数字的集合](https://leetcode.cn/problems/divide-array-in-sets-of-k-consecutive-numbers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1296.%20%E5%88%92%E5%88%86%E6%95%B0%E7%BB%84%E4%B8%BA%E8%BF%9E%E7%BB%AD%E6%95%B0%E5%AD%97%E7%9A%84%E9%9B%86%E5%90%88.md) | 贪心、数组、哈希表、排序 | 中等 | -| 0239 | [滑动窗口最大值](https://leetcode.cn/problems/sliding-window-maximum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0239.%20%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E6%9C%80%E5%A4%A7%E5%80%BC.md) | 队列、数组、滑动窗口、单调队列、堆（优先队列） | 困难 | -| 0295 | [数据流的中位数](https://leetcode.cn/problems/find-median-from-data-stream/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0295.%20%E6%95%B0%E6%8D%AE%E6%B5%81%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0.md) | 设计、双指针、数据流、排序、堆（优先队列） | 困难 | -| 0023 | [合并 K 个升序链表](https://leetcode.cn/problems/merge-k-sorted-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0023.%20%E5%90%88%E5%B9%B6%20K%20%E4%B8%AA%E5%8D%87%E5%BA%8F%E9%93%BE%E8%A1%A8.md) | 链表、分治、堆（优先队列）、归并排序 | 困难 | -| 0218 | [天际线问题](https://leetcode.cn/problems/the-skyline-problem/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0218.%20%E5%A4%A9%E9%99%85%E7%BA%BF%E9%97%AE%E9%A2%98.md) | 树状数组、线段树、数组、分治、有序集合、扫描线、堆（优先队列） | 困难 | - -## 05. 哈希表 - -### 哈希表题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0705 | [设计哈希集合](https://leetcode.cn/problems/design-hashset/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0705.%20%E8%AE%BE%E8%AE%A1%E5%93%88%E5%B8%8C%E9%9B%86%E5%90%88.md) | 设计、数组、哈希表、链表、哈希函数 | 简单 | -| 0706 | [设计哈希映射](https://leetcode.cn/problems/design-hashmap/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0706.%20%E8%AE%BE%E8%AE%A1%E5%93%88%E5%B8%8C%E6%98%A0%E5%B0%84.md) | 设计、数组、哈希表、链表、哈希函数 | 简单 | -| 0217 | [存在重复元素](https://leetcode.cn/problems/contains-duplicate/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0217.%20%E5%AD%98%E5%9C%A8%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0.md) | 数组、哈希表、排序 | 简单 | -| 0219 | [存在重复元素 II](https://leetcode.cn/problems/contains-duplicate-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0219.%20%E5%AD%98%E5%9C%A8%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0%20II.md) | 数组、哈希表、滑动窗口 | 简单 | -| 0220 | [存在重复元素 III](https://leetcode.cn/problems/contains-duplicate-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0220.%20%E5%AD%98%E5%9C%A8%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0%20III.md) | 数组、桶排序、有序集合、排序、滑动窗口 | 困难 | -| 1941 | [检查是否所有字符出现次数相同](https://leetcode.cn/problems/check-if-all-characters-have-equal-number-of-occurrences/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1941.%20%E6%A3%80%E6%9F%A5%E6%98%AF%E5%90%A6%E6%89%80%E6%9C%89%E5%AD%97%E7%AC%A6%E5%87%BA%E7%8E%B0%E6%AC%A1%E6%95%B0%E7%9B%B8%E5%90%8C.md) | 哈希表、字符串、计数 | 简单 | -| 0136 | [只出现一次的数字](https://leetcode.cn/problems/single-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0136.%20%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B0%E5%AD%97.md) | 位运算、数组 | 简单 | -| 0383 | [赎金信](https://leetcode.cn/problems/ransom-note/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0383.%20%E8%B5%8E%E9%87%91%E4%BF%A1.md) | 哈希表、字符串、计数 | 简单 | -| 0349 | [两个数组的交集](https://leetcode.cn/problems/intersection-of-two-arrays/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0349.%20%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E7%9A%84%E4%BA%A4%E9%9B%86.md) | 数组、哈希表、双指针、二分查找、排序 | 简单 | -| 0350 | [两个数组的交集 II](https://leetcode.cn/problems/intersection-of-two-arrays-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0350.%20%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E7%9A%84%E4%BA%A4%E9%9B%86%20II.md) | 数组、哈希表、双指针、二分查找、排序 | 简单 | -| 0036 | [有效的数独](https://leetcode.cn/problems/valid-sudoku/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0036.%20%E6%9C%89%E6%95%88%E7%9A%84%E6%95%B0%E7%8B%AC.md) | 数组、哈希表、矩阵 | 中等 | -| 0001 | [两数之和](https://leetcode.cn/problems/two-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0001.%20%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、哈希表 | 简单 | -| 0015 | [三数之和](https://leetcode.cn/problems/3sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0015.%20%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、双指针、排序 | 中等 | -| 0018 | [四数之和](https://leetcode.cn/problems/4sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0018.%20%E5%9B%9B%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、双指针、排序 | 中等 | -| 0454 | [四数相加 II](https://leetcode.cn/problems/4sum-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0454.%20%E5%9B%9B%E6%95%B0%E7%9B%B8%E5%8A%A0%20II.md) | 数组、哈希表 | 中等 | -| 0041 | [缺失的第一个正数](https://leetcode.cn/problems/first-missing-positive/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0041.%20%E7%BC%BA%E5%A4%B1%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E6%AD%A3%E6%95%B0.md) | 数组、哈希表 | 困难 | -| 0128 | [最长连续序列](https://leetcode.cn/problems/longest-consecutive-sequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0128.%20%E6%9C%80%E9%95%BF%E8%BF%9E%E7%BB%AD%E5%BA%8F%E5%88%97.md) | 并查集、数组、哈希表 | 中等 | -| 0202 | [快乐数](https://leetcode.cn/problems/happy-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0202.%20%E5%BF%AB%E4%B9%90%E6%95%B0.md) | 哈希表、数学、双指针 | 简单 | -| 0242 | [有效的字母异位词](https://leetcode.cn/problems/valid-anagram/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0242.%20%E6%9C%89%E6%95%88%E7%9A%84%E5%AD%97%E6%AF%8D%E5%BC%82%E4%BD%8D%E8%AF%8D.md) | 哈希表、字符串、排序 | 简单 | -| 0205 | [同构字符串](https://leetcode.cn/problems/isomorphic-strings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0205.%20%E5%90%8C%E6%9E%84%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 哈希表、字符串 | 简单 | -| 0442 | [数组中重复的数据](https://leetcode.cn/problems/find-all-duplicates-in-an-array/) | | 数组、哈希表 | 中等 | -| 剑指 Offer 61 | [扑克牌中的顺子](https://leetcode.cn/problems/bu-ke-pai-zhong-de-shun-zi-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2061.%20%E6%89%91%E5%85%8B%E7%89%8C%E4%B8%AD%E7%9A%84%E9%A1%BA%E5%AD%90.md) | 数组、排序 | 简单 | -| 0268 | [丢失的数字](https://leetcode.cn/problems/missing-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0268.%20%E4%B8%A2%E5%A4%B1%E7%9A%84%E6%95%B0%E5%AD%97.md) | 位运算、数组、哈希表、数学、二分查找、排序 | 简单 | -| 剑指 Offer 03 | [数组中重复的数字](https://leetcode.cn/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2003.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E9%87%8D%E5%A4%8D%E7%9A%84%E6%95%B0%E5%AD%97.md) | 数组、哈希表、排序 | 简单 | -| 0451 | [根据字符出现频率排序](https://leetcode.cn/problems/sort-characters-by-frequency/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0451.%20%E6%A0%B9%E6%8D%AE%E5%AD%97%E7%AC%A6%E5%87%BA%E7%8E%B0%E9%A2%91%E7%8E%87%E6%8E%92%E5%BA%8F.md) | 哈希表、字符串、桶排序、计数、排序、堆（优先队列） | 中等 | -| 0049 | [字母异位词分组](https://leetcode.cn/problems/group-anagrams/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0049.%20%E5%AD%97%E6%AF%8D%E5%BC%82%E4%BD%8D%E8%AF%8D%E5%88%86%E7%BB%84.md) | 数组、哈希表、字符串、排序 | 中等 | -| 0599 | [两个列表的最小索引总和](https://leetcode.cn/problems/minimum-index-sum-of-two-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0599.%20%E4%B8%A4%E4%B8%AA%E5%88%97%E8%A1%A8%E7%9A%84%E6%9C%80%E5%B0%8F%E7%B4%A2%E5%BC%95%E6%80%BB%E5%92%8C.md) | 数组、哈希表、字符串 | 简单 | -| 0387 | [字符串中的第一个唯一字符](https://leetcode.cn/problems/first-unique-character-in-a-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0387.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%94%AF%E4%B8%80%E5%AD%97%E7%AC%A6.md) | 队列、哈希表、字符串、计数 | 简单 | -| 0447 | [回旋镖的数量](https://leetcode.cn/problems/number-of-boomerangs/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0447.%20%E5%9B%9E%E6%97%8B%E9%95%96%E7%9A%84%E6%95%B0%E9%87%8F.md) | 数组、哈希表、数学 | 中等 | -| 0149 | [直线上最多的点数](https://leetcode.cn/problems/max-points-on-a-line/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0149.%20%E7%9B%B4%E7%BA%BF%E4%B8%8A%E6%9C%80%E5%A4%9A%E7%9A%84%E7%82%B9%E6%95%B0.md) | 几何、数组、哈希表、数学 | 困难 | -| 0359 | [日志速率限制器](https://leetcode.cn/problems/logger-rate-limiter/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0359.%20%E6%97%A5%E5%BF%97%E9%80%9F%E7%8E%87%E9%99%90%E5%88%B6%E5%99%A8.md) | 设计、哈希表 | 简单 | -| 0811 | [子域名访问计数](https://leetcode.cn/problems/subdomain-visit-count/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0811.%20%E5%AD%90%E5%9F%9F%E5%90%8D%E8%AE%BF%E9%97%AE%E8%AE%A1%E6%95%B0.md) | 数组、哈希表、字符串、计数 | 中等 | - -## 06. 字符串 - -### 字符串基础题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0125 | [验证回文串](https://leetcode.cn/problems/valid-palindrome/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0125.%20%E9%AA%8C%E8%AF%81%E5%9B%9E%E6%96%87%E4%B8%B2.md) | 双指针、字符串 | 简单 | -| 0005 | [最长回文子串](https://leetcode.cn/problems/longest-palindromic-substring/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0005.%20%E6%9C%80%E9%95%BF%E5%9B%9E%E6%96%87%E5%AD%90%E4%B8%B2.md) | 字符串、动态规划 | 中等 | -| 0003 | [无重复字符的最长子串](https://leetcode.cn/problems/longest-substring-without-repeating-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0003.%20%E6%97%A0%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2.md) | 哈希表、字符串、滑动窗口 | 中等 | -| 0344 | [反转字符串](https://leetcode.cn/problems/reverse-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0344.%20%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 双指针、字符串 | 简单 | -| 0557 | [反转字符串中的单词 III](https://leetcode.cn/problems/reverse-words-in-a-string-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0557.%20%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%8D%95%E8%AF%8D%20III.md) | 双指针、字符串 | 简单 | -| 0049 | [字母异位词分组](https://leetcode.cn/problems/group-anagrams/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0049.%20%E5%AD%97%E6%AF%8D%E5%BC%82%E4%BD%8D%E8%AF%8D%E5%88%86%E7%BB%84.md) | 数组、哈希表、字符串、排序 | 中等 | -| 0415 | [字符串相加](https://leetcode.cn/problems/add-strings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0415.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E5%8A%A0.md) | 数学、字符串、模拟 | 简单 | -| 0151 | [反转字符串中的单词](https://leetcode.cn/problems/reverse-words-in-a-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0151.%20%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%8D%95%E8%AF%8D.md) | 双指针、字符串 | 中等 | -| 0043 | [字符串相乘](https://leetcode.cn/problems/multiply-strings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0043.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E4%B9%98.md) | 数学、字符串、模拟 | 中等 | -| 0014 | [最长公共前缀](https://leetcode.cn/problems/longest-common-prefix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0014.%20%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%89%8D%E7%BC%80.md) | 字典树、字符串 | 简单 | - -### 单模式串匹配题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0028 | [找出字符串中第一个匹配项的下标](https://leetcode.cn/problems/find-the-index-of-the-first-occurrence-in-a-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0028.%20%E6%89%BE%E5%87%BA%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%8C%B9%E9%85%8D%E9%A1%B9%E7%9A%84%E4%B8%8B%E6%A0%87.md) | 双指针、字符串、字符串匹配 | 中等 | -| 0459 | [重复的子字符串](https://leetcode.cn/problems/repeated-substring-pattern/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0459.%20%E9%87%8D%E5%A4%8D%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 字符串、字符串匹配 | 简单 | -| 0686 | [重复叠加字符串匹配](https://leetcode.cn/problems/repeated-string-match/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0686.%20%E9%87%8D%E5%A4%8D%E5%8F%A0%E5%8A%A0%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%8C%B9%E9%85%8D.md) | 字符串、字符串匹配 | 中等 | -| 1668 | [最大重复子字符串](https://leetcode.cn/problems/maximum-repeating-substring/) | | 字符串、字符串匹配 | 简单 | -| 0796 | [旋转字符串](https://leetcode.cn/problems/rotate-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0796.%20%E6%97%8B%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 字符串、字符串匹配 | 简单 | -| 1408 | [数组中的字符串匹配](https://leetcode.cn/problems/string-matching-in-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1408.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%8C%B9%E9%85%8D.md) | 数组、字符串、字符串匹配 | 简单 | -| 2156 | [查找给定哈希值的子串](https://leetcode.cn/problems/find-substring-with-given-hash-value/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2156.%20%E6%9F%A5%E6%89%BE%E7%BB%99%E5%AE%9A%E5%93%88%E5%B8%8C%E5%80%BC%E7%9A%84%E5%AD%90%E4%B8%B2.md) | 字符串、滑动窗口、哈希函数、滚动哈希 | 困难 | - -### 字典树题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0208 | [实现 Trie (前缀树)](https://leetcode.cn/problems/implement-trie-prefix-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0208.%20%E5%AE%9E%E7%8E%B0%20Trie%20%28%E5%89%8D%E7%BC%80%E6%A0%91%29.md) | 设计、字典树、哈希表、字符串 | 中等 | -| 0677 | [键值映射](https://leetcode.cn/problems/map-sum-pairs/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0677.%20%E9%94%AE%E5%80%BC%E6%98%A0%E5%B0%84.md) | 设计、字典树、哈希表、字符串 | 中等 | -| 0648 | [单词替换](https://leetcode.cn/problems/replace-words/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0648.%20%E5%8D%95%E8%AF%8D%E6%9B%BF%E6%8D%A2.md) | 字典树、数组、哈希表、字符串 | 中等 | -| 0642 | [设计搜索自动补全系统](https://leetcode.cn/problems/design-search-autocomplete-system/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0642.%20%E8%AE%BE%E8%AE%A1%E6%90%9C%E7%B4%A2%E8%87%AA%E5%8A%A8%E8%A1%A5%E5%85%A8%E7%B3%BB%E7%BB%9F.md) | 设计、字典树、字符串、数据流 | 困难 | -| 0211 | [添加与搜索单词 - 数据结构设计](https://leetcode.cn/problems/design-add-and-search-words-data-structure/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0211.%20%E6%B7%BB%E5%8A%A0%E4%B8%8E%E6%90%9C%E7%B4%A2%E5%8D%95%E8%AF%8D%20-%20%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E8%AE%BE%E8%AE%A1.md) | 深度优先搜索、设计、字典树、字符串 | 中等 | -| 0421 | [数组中两个数的最大异或值](https://leetcode.cn/problems/maximum-xor-of-two-numbers-in-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0421.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%9A%84%E6%9C%80%E5%A4%A7%E5%BC%82%E6%88%96%E5%80%BC.md) | 位运算、字典树、数组、哈希表 | 中等 | -| 0212 | [单词搜索 II](https://leetcode.cn/problems/word-search-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0212.%20%E5%8D%95%E8%AF%8D%E6%90%9C%E7%B4%A2%20II.md) | 字典树、数组、字符串、回溯、矩阵 | 困难 | -| 0425 | [单词方块](https://leetcode.cn/problems/word-squares/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0425.%20%E5%8D%95%E8%AF%8D%E6%96%B9%E5%9D%97.md) | 字典树、数组、字符串、回溯 | 困难 | -| 0336 | [回文对](https://leetcode.cn/problems/palindrome-pairs/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0336.%20%E5%9B%9E%E6%96%87%E5%AF%B9.md) | 字典树、数组、哈希表、字符串 | 困难 | -| 1023 | [驼峰式匹配](https://leetcode.cn/problems/camelcase-matching/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1023.%20%E9%A9%BC%E5%B3%B0%E5%BC%8F%E5%8C%B9%E9%85%8D.md) | 字典树、双指针、字符串、字符串匹配 | 中等 | -| 0676 | [实现一个魔法字典](https://leetcode.cn/problems/implement-magic-dictionary/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0676.%20%E5%AE%9E%E7%8E%B0%E4%B8%80%E4%B8%AA%E9%AD%94%E6%B3%95%E5%AD%97%E5%85%B8.md) | 设计、字典树、哈希表、字符串 | 中等 | -| 0440 | [字典序的第K小数字](https://leetcode.cn/problems/k-th-smallest-in-lexicographical-order/) | | 字典树 | 困难 | - -## 07. 树 - -### 二叉树的遍历题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0144 | [二叉树的前序遍历](https://leetcode.cn/problems/binary-tree-preorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0144.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%89%8D%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索、二叉树 | 简单 | -| 0094 | [二叉树的中序遍历](https://leetcode.cn/problems/binary-tree-inorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0094.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E4%B8%AD%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索、二叉树 | 简单 | -| 0145 | [二叉树的后序遍历](https://leetcode.cn/problems/binary-tree-postorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0145.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索、二叉树 | 简单 | -| 0102 | [二叉树的层序遍历](https://leetcode.cn/problems/binary-tree-level-order-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0102.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%B1%82%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 树、广度优先搜索、二叉树 | 中等 | -| 0103 | [二叉树的锯齿形层序遍历](https://leetcode.cn/problems/binary-tree-zigzag-level-order-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0103.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%94%AF%E9%BD%BF%E5%BD%A2%E5%B1%82%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 树、广度优先搜索、二叉树 | 中等 | -| 0107 | [二叉树的层序遍历 II](https://leetcode.cn/problems/binary-tree-level-order-traversal-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0107.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%B1%82%E5%BA%8F%E9%81%8D%E5%8E%86%20II.md) | 树、广度优先搜索、二叉树 | 中等 | -| 0104 | [二叉树的最大深度](https://leetcode.cn/problems/maximum-depth-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0104.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%A4%A7%E6%B7%B1%E5%BA%A6.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0111 | [二叉树的最小深度](https://leetcode.cn/problems/minimum-depth-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0111.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%B0%8F%E6%B7%B1%E5%BA%A6.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0124 | [二叉树中的最大路径和](https://leetcode.cn/problems/binary-tree-maximum-path-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0124.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E8%B7%AF%E5%BE%84%E5%92%8C.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | -| 0101 | [对称二叉树](https://leetcode.cn/problems/symmetric-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0101.%20%E5%AF%B9%E7%A7%B0%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0112 | [路径总和](https://leetcode.cn/problems/path-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0112.%20%E8%B7%AF%E5%BE%84%E6%80%BB%E5%92%8C.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0113 | [路径总和 II](https://leetcode.cn/problems/path-sum-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0113.%20%E8%B7%AF%E5%BE%84%E6%80%BB%E5%92%8C%20II.md) | 树、深度优先搜索、回溯、二叉树 | 中等 | -| 0236 | [二叉树的最近公共祖先](https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0236.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88.md) | 树、深度优先搜索、二叉树 | 中等 | -| 0199 | [二叉树的右视图](https://leetcode.cn/problems/binary-tree-right-side-view/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0199.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%8F%B3%E8%A7%86%E5%9B%BE.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | -| 0226 | [翻转二叉树](https://leetcode.cn/problems/invert-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0226.%20%E7%BF%BB%E8%BD%AC%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0958 | [二叉树的完全性检验](https://leetcode.cn/problems/check-completeness-of-a-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0958.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%AE%8C%E5%85%A8%E6%80%A7%E6%A3%80%E9%AA%8C.md) | 树、广度优先搜索、二叉树 | 中等 | -| 0572 | [另一棵树的子树](https://leetcode.cn/problems/subtree-of-another-tree/) | | 树、深度优先搜索、二叉树、字符串匹配、哈希函数 | 简单 | -| 0100 | [相同的树](https://leetcode.cn/problems/same-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0100.%20%E7%9B%B8%E5%90%8C%E7%9A%84%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0116 | [填充每个节点的下一个右侧节点指针](https://leetcode.cn/problems/populating-next-right-pointers-in-each-node/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0116.%20%E5%A1%AB%E5%85%85%E6%AF%8F%E4%B8%AA%E8%8A%82%E7%82%B9%E7%9A%84%E4%B8%8B%E4%B8%80%E4%B8%AA%E5%8F%B3%E4%BE%A7%E8%8A%82%E7%82%B9%E6%8C%87%E9%92%88.md) | 树、深度优先搜索、广度优先搜索、链表、二叉树 | 中等 | -| 0117 | [填充每个节点的下一个右侧节点指针 II](https://leetcode.cn/problems/populating-next-right-pointers-in-each-node-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0117.%20%E5%A1%AB%E5%85%85%E6%AF%8F%E4%B8%AA%E8%8A%82%E7%82%B9%E7%9A%84%E4%B8%8B%E4%B8%80%E4%B8%AA%E5%8F%B3%E4%BE%A7%E8%8A%82%E7%82%B9%E6%8C%87%E9%92%88%20II.md) | 树、深度优先搜索、广度优先搜索、链表、二叉树 | 中等 | -| 0297 | [二叉树的序列化与反序列化](https://leetcode.cn/problems/serialize-and-deserialize-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0297.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%BA%8F%E5%88%97%E5%8C%96%E4%B8%8E%E5%8F%8D%E5%BA%8F%E5%88%97%E5%8C%96.md) | 树、深度优先搜索、广度优先搜索、设计、字符串、二叉树 | 困难 | -| 0114 | [二叉树展开为链表](https://leetcode.cn/problems/flatten-binary-tree-to-linked-list/) | | 栈、树、深度优先搜索、链表、二叉树 | 中等 | - -### 二叉树的还原题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0105 | [从前序与中序遍历序列构造二叉树](https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0105.%20%E4%BB%8E%E5%89%8D%E5%BA%8F%E4%B8%8E%E4%B8%AD%E5%BA%8F%E9%81%8D%E5%8E%86%E5%BA%8F%E5%88%97%E6%9E%84%E9%80%A0%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、数组、哈希表、分治、二叉树 | 中等 | -| 0106 | [从中序与后序遍历序列构造二叉树](https://leetcode.cn/problems/construct-binary-tree-from-inorder-and-postorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0106.%20%E4%BB%8E%E4%B8%AD%E5%BA%8F%E4%B8%8E%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86%E5%BA%8F%E5%88%97%E6%9E%84%E9%80%A0%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、数组、哈希表、分治、二叉树 | 中等 | -| 0889 | [根据前序和后序遍历构造二叉树](https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-postorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0889.%20%E6%A0%B9%E6%8D%AE%E5%89%8D%E5%BA%8F%E5%92%8C%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86%E6%9E%84%E9%80%A0%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、数组、哈希表、分治、二叉树 | 中等 | - -### 二叉搜索树题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0098 | [验证二叉搜索树](https://leetcode.cn/problems/validate-binary-search-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0098.%20%E9%AA%8C%E8%AF%81%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | -| 0173 | [二叉搜索树迭代器](https://leetcode.cn/problems/binary-search-tree-iterator/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0173.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E8%BF%AD%E4%BB%A3%E5%99%A8.md) | 栈、树、设计、二叉搜索树、二叉树、迭代器 | 中等 | -| 0700 | [二叉搜索树中的搜索](https://leetcode.cn/problems/search-in-a-binary-search-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0700.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E6%90%9C%E7%B4%A2.md) | 树、二叉搜索树、二叉树 | 简单 | -| 0701 | [二叉搜索树中的插入操作](https://leetcode.cn/problems/insert-into-a-binary-search-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0701.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E6%8F%92%E5%85%A5%E6%93%8D%E4%BD%9C.md) | 树、二叉搜索树、二叉树 | 中等 | -| 0450 | [删除二叉搜索树中的节点](https://leetcode.cn/problems/delete-node-in-a-bst/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0450.%20%E5%88%A0%E9%99%A4%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E8%8A%82%E7%82%B9.md) | 树、二叉搜索树、二叉树 | 中等 | -| 0703 | [数据流中的第 K 大元素](https://leetcode.cn/problems/kth-largest-element-in-a-stream/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0703.%20%E6%95%B0%E6%8D%AE%E6%B5%81%E4%B8%AD%E7%9A%84%E7%AC%AC%20K%20%E5%A4%A7%E5%85%83%E7%B4%A0.md) | 树、设计、二叉搜索树、二叉树、数据流、堆（优先队列） | 简单 | -| 剑指 Offer 54 | [二叉搜索树的第k大节点](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2054.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E7%AC%ACk%E5%A4%A7%E8%8A%82%E7%82%B9.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 简单 | -| 0230 | [二叉搜索树中第K小的元素](https://leetcode.cn/problems/kth-smallest-element-in-a-bst/) | | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | -| 0235 | [二叉搜索树的最近公共祖先](https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-search-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0235.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | -| 0426 | [将二叉搜索树转化为排序的双向链表](https://leetcode.cn/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0426.%20%E5%B0%86%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E8%BD%AC%E5%8C%96%E4%B8%BA%E6%8E%92%E5%BA%8F%E7%9A%84%E5%8F%8C%E5%90%91%E9%93%BE%E8%A1%A8.md) | 栈、树、深度优先搜索、二叉搜索树、链表、二叉树、双向链表 | 中等 | -| 0108 | [将有序数组转换为二叉搜索树](https://leetcode.cn/problems/convert-sorted-array-to-binary-search-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0108.%20%E5%B0%86%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E8%BD%AC%E6%8D%A2%E4%B8%BA%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md) | 树、二叉搜索树、数组、分治、二叉树 | 简单 | -| 0110 | [平衡二叉树](https://leetcode.cn/problems/balanced-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0110.%20%E5%B9%B3%E8%A1%A1%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、二叉树 | 简单 | - -### 线段树题目 - -#### 单点更新题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0303 | [区域和检索 - 数组不可变](https://leetcode.cn/problems/range-sum-query-immutable/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0303.%20%E5%8C%BA%E5%9F%9F%E5%92%8C%E6%A3%80%E7%B4%A2%20-%20%E6%95%B0%E7%BB%84%E4%B8%8D%E5%8F%AF%E5%8F%98.md) | 设计、数组、前缀和 | 简单 | -| 0307 | [区域和检索 - 数组可修改](https://leetcode.cn/problems/range-sum-query-mutable/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0307.%20%E5%8C%BA%E5%9F%9F%E5%92%8C%E6%A3%80%E7%B4%A2%20-%20%E6%95%B0%E7%BB%84%E5%8F%AF%E4%BF%AE%E6%94%B9.md) | 设计、树状数组、线段树、数组 | 中等 | -| 0354 | [俄罗斯套娃信封问题](https://leetcode.cn/problems/russian-doll-envelopes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0354.%20%E4%BF%84%E7%BD%97%E6%96%AF%E5%A5%97%E5%A8%83%E4%BF%A1%E5%B0%81%E9%97%AE%E9%A2%98.md) | 数组、二分查找、动态规划、排序 | 困难 | - -#### 区间更新题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0370 | [区间加法](https://leetcode.cn/problems/range-addition/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0370.%20%E5%8C%BA%E9%97%B4%E5%8A%A0%E6%B3%95.md) | 数组、前缀和 | 中等 | -| 1109 | [航班预订统计](https://leetcode.cn/problems/corporate-flight-bookings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1109.%20%E8%88%AA%E7%8F%AD%E9%A2%84%E8%AE%A2%E7%BB%9F%E8%AE%A1.md) | 数组、前缀和 | 中等 | -| 1450 | [在既定时间做作业的学生人数](https://leetcode.cn/problems/number-of-students-doing-homework-at-a-given-time/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1450.%20%E5%9C%A8%E6%97%A2%E5%AE%9A%E6%97%B6%E9%97%B4%E5%81%9A%E4%BD%9C%E4%B8%9A%E7%9A%84%E5%AD%A6%E7%94%9F%E4%BA%BA%E6%95%B0.md) | 数组 | 简单 | -| 0673 | [最长递增子序列的个数](https://leetcode.cn/problems/number-of-longest-increasing-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0673.%20%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 树状数组、线段树、数组、动态规划 | 中等 | -| 1310 | [子数组异或查询](https://leetcode.cn/problems/xor-queries-of-a-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1310.%20%E5%AD%90%E6%95%B0%E7%BB%84%E5%BC%82%E6%88%96%E6%9F%A5%E8%AF%A2.md) | 位运算、数组、前缀和 | 中等 | -| 1851 | [包含每个查询的最小区间](https://leetcode.cn/problems/minimum-interval-to-include-each-query/) | | 数组、二分查找、排序、扫描线、堆（优先队列） | 困难 | - -#### 区间合并题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0729 | [我的日程安排表 I](https://leetcode.cn/problems/my-calendar-i/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0729.%20%E6%88%91%E7%9A%84%E6%97%A5%E7%A8%8B%E5%AE%89%E6%8E%92%E8%A1%A8%20I.md) | 设计、线段树、二分查找、有序集合 | 中等 | -| 0731 | [我的日程安排表 II](https://leetcode.cn/problems/my-calendar-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0731.%20%E6%88%91%E7%9A%84%E6%97%A5%E7%A8%8B%E5%AE%89%E6%8E%92%E8%A1%A8%20II.md) | 设计、线段树、二分查找、有序集合 | 中等 | -| 0732 | [我的日程安排表 III](https://leetcode.cn/problems/my-calendar-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0732.%20%E6%88%91%E7%9A%84%E6%97%A5%E7%A8%8B%E5%AE%89%E6%8E%92%E8%A1%A8%20III.md) | 设计、线段树、二分查找、有序集合 | 困难 | - -#### 扫描线问题 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0218 | [天际线问题](https://leetcode.cn/problems/the-skyline-problem/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0218.%20%E5%A4%A9%E9%99%85%E7%BA%BF%E9%97%AE%E9%A2%98.md) | 树状数组、线段树、数组、分治、有序集合、扫描线、堆（优先队列） | 困难 | -| 0391 | [完美矩形](https://leetcode.cn/problems/perfect-rectangle/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0391.%20%E5%AE%8C%E7%BE%8E%E7%9F%A9%E5%BD%A2.md) | 数组、扫描线 | 困难 | -| 0850 | [矩形面积 II](https://leetcode.cn/problems/rectangle-area-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0850.%20%E7%9F%A9%E5%BD%A2%E9%9D%A2%E7%A7%AF%20II.md) | 线段树、数组、有序集合、扫描线 | 困难 | - -### 树状数组题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0303 | [区域和检索 - 数组不可变](https://leetcode.cn/problems/range-sum-query-immutable/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0303.%20%E5%8C%BA%E5%9F%9F%E5%92%8C%E6%A3%80%E7%B4%A2%20-%20%E6%95%B0%E7%BB%84%E4%B8%8D%E5%8F%AF%E5%8F%98.md) | 设计、数组、前缀和 | 简单 | -| 0307 | [区域和检索 - 数组可修改](https://leetcode.cn/problems/range-sum-query-mutable/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0307.%20%E5%8C%BA%E5%9F%9F%E5%92%8C%E6%A3%80%E7%B4%A2%20-%20%E6%95%B0%E7%BB%84%E5%8F%AF%E4%BF%AE%E6%94%B9.md) | 设计、树状数组、线段树、数组 | 中等 | -| 0315 | [计算右侧小于当前元素的个数](https://leetcode.cn/problems/count-of-smaller-numbers-after-self/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0315.%20%E8%AE%A1%E7%AE%97%E5%8F%B3%E4%BE%A7%E5%B0%8F%E4%BA%8E%E5%BD%93%E5%89%8D%E5%85%83%E7%B4%A0%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 树状数组、线段树、数组、二分查找、分治、有序集合、归并排序 | 困难 | -| 1450 | [在既定时间做作业的学生人数](https://leetcode.cn/problems/number-of-students-doing-homework-at-a-given-time/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1450.%20%E5%9C%A8%E6%97%A2%E5%AE%9A%E6%97%B6%E9%97%B4%E5%81%9A%E4%BD%9C%E4%B8%9A%E7%9A%84%E5%AD%A6%E7%94%9F%E4%BA%BA%E6%95%B0.md) | 数组 | 简单 | -| 0354 | [俄罗斯套娃信封问题](https://leetcode.cn/problems/russian-doll-envelopes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0354.%20%E4%BF%84%E7%BD%97%E6%96%AF%E5%A5%97%E5%A8%83%E4%BF%A1%E5%B0%81%E9%97%AE%E9%A2%98.md) | 数组、二分查找、动态规划、排序 | 困难 | -| 0673 | [最长递增子序列的个数](https://leetcode.cn/problems/number-of-longest-increasing-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0673.%20%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 树状数组、线段树、数组、动态规划 | 中等 | -| 1310 | [子数组异或查询](https://leetcode.cn/problems/xor-queries-of-a-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1310.%20%E5%AD%90%E6%95%B0%E7%BB%84%E5%BC%82%E6%88%96%E6%9F%A5%E8%AF%A2.md) | 位运算、数组、前缀和 | 中等 | -| 1893 | [检查是否区域内所有整数都被覆盖](https://leetcode.cn/problems/check-if-all-the-integers-in-a-range-are-covered/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1893.%20%E6%A3%80%E6%9F%A5%E6%98%AF%E5%90%A6%E5%8C%BA%E5%9F%9F%E5%86%85%E6%89%80%E6%9C%89%E6%95%B4%E6%95%B0%E9%83%BD%E8%A2%AB%E8%A6%86%E7%9B%96.md) | 数组、哈希表、前缀和 | 简单 | - -### 并查集题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0990 | [等式方程的可满足性](https://leetcode.cn/problems/satisfiability-of-equality-equations/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0990.%20%E7%AD%89%E5%BC%8F%E6%96%B9%E7%A8%8B%E7%9A%84%E5%8F%AF%E6%BB%A1%E8%B6%B3%E6%80%A7.md) | 并查集、图、数组、字符串 | 中等 | -| 0547 | [省份数量](https://leetcode.cn/problems/number-of-provinces/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0547.%20%E7%9C%81%E4%BB%BD%E6%95%B0%E9%87%8F.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 0684 | [冗余连接](https://leetcode.cn/problems/redundant-connection/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0684.%20%E5%86%97%E4%BD%99%E8%BF%9E%E6%8E%A5.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 1319 | [连通网络的操作次数](https://leetcode.cn/problems/number-of-operations-to-make-network-connected/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1319.%20%E8%BF%9E%E9%80%9A%E7%BD%91%E7%BB%9C%E7%9A%84%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 0765 | [情侣牵手](https://leetcode.cn/problems/couples-holding-hands/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0765.%20%E6%83%85%E4%BE%A3%E7%89%B5%E6%89%8B.md) | 贪心、深度优先搜索、广度优先搜索、并查集、图 | 困难 | -| 0399 | [除法求值](https://leetcode.cn/problems/evaluate-division/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0399.%20%E9%99%A4%E6%B3%95%E6%B1%82%E5%80%BC.md) | 深度优先搜索、广度优先搜索、并查集、图、数组、最短路 | 中等 | -| 0959 | [由斜杠划分区域](https://leetcode.cn/problems/regions-cut-by-slashes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0959.%20%E7%94%B1%E6%96%9C%E6%9D%A0%E5%88%92%E5%88%86%E5%8C%BA%E5%9F%9F.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 1631 | [最小体力消耗路径](https://leetcode.cn/problems/path-with-minimum-effort/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1631.%20%E6%9C%80%E5%B0%8F%E4%BD%93%E5%8A%9B%E6%B6%88%E8%80%97%E8%B7%AF%E5%BE%84.md) | 深度优先搜索、广度优先搜索、并查集、数组、二分查找、矩阵、堆（优先队列） | 中等 | -| 0778 | [水位上升的泳池中游泳](https://leetcode.cn/problems/swim-in-rising-water/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0778.%20%E6%B0%B4%E4%BD%8D%E4%B8%8A%E5%8D%87%E7%9A%84%E6%B3%B3%E6%B1%A0%E4%B8%AD%E6%B8%B8%E6%B3%B3.md) | 深度优先搜索、广度优先搜索、并查集、数组、二分查找、矩阵、堆（优先队列） | 困难 | -| 1202 | [交换字符串中的元素](https://leetcode.cn/problems/smallest-string-with-swaps/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1202.%20%E4%BA%A4%E6%8D%A2%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%85%83%E7%B4%A0.md) | 深度优先搜索、广度优先搜索、并查集、哈希表、字符串 | 中等 | -| 0947 | [移除最多的同行或同列石头](https://leetcode.cn/problems/most-stones-removed-with-same-row-or-column/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0947.%20%E7%A7%BB%E9%99%A4%E6%9C%80%E5%A4%9A%E7%9A%84%E5%90%8C%E8%A1%8C%E6%88%96%E5%90%8C%E5%88%97%E7%9F%B3%E5%A4%B4.md) | 深度优先搜索、并查集、图 | 中等 | -| 0803 | [打砖块](https://leetcode.cn/problems/bricks-falling-when-hit/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0803.%20%E6%89%93%E7%A0%96%E5%9D%97.md) | 并查集、数组、矩阵 | 困难 | -| 0128 | [最长连续序列](https://leetcode.cn/problems/longest-consecutive-sequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0128.%20%E6%9C%80%E9%95%BF%E8%BF%9E%E7%BB%AD%E5%BA%8F%E5%88%97.md) | 并查集、数组、哈希表 | 中等 | - -## 08. 图论 - -### 图的深度优先搜索题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0797 | [所有可能的路径](https://leetcode.cn/problems/all-paths-from-source-to-target/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0797.%20%E6%89%80%E6%9C%89%E5%8F%AF%E8%83%BD%E7%9A%84%E8%B7%AF%E5%BE%84.md) | 深度优先搜索、广度优先搜索、图、回溯 | 中等 | -| 0200 | [岛屿数量](https://leetcode.cn/problems/number-of-islands/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0200.%20%E5%B2%9B%E5%B1%BF%E6%95%B0%E9%87%8F.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | -| 0695 | [岛屿的最大面积](https://leetcode.cn/problems/max-area-of-island/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0695.%20%E5%B2%9B%E5%B1%BF%E7%9A%84%E6%9C%80%E5%A4%A7%E9%9D%A2%E7%A7%AF.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | -| 0133 | [克隆图](https://leetcode.cn/problems/clone-graph/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0133.%20%E5%85%8B%E9%9A%86%E5%9B%BE.md) | 深度优先搜索、广度优先搜索、图、哈希表 | 中等 | -| 0494 | [目标和](https://leetcode.cn/problems/target-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0494.%20%E7%9B%AE%E6%A0%87%E5%92%8C.md) | 数组、动态规划、回溯 | 中等 | -| 0144 | [二叉树的前序遍历](https://leetcode.cn/problems/binary-tree-preorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0144.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%89%8D%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索、二叉树 | 简单 | -| 0094 | [二叉树的中序遍历](https://leetcode.cn/problems/binary-tree-inorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0094.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E4%B8%AD%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索、二叉树 | 简单 | -| 0145 | [二叉树的后序遍历](https://leetcode.cn/problems/binary-tree-postorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0145.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索、二叉树 | 简单 | -| 0589 | [N 叉树的前序遍历](https://leetcode.cn/problems/n-ary-tree-preorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0589.%20N%20%E5%8F%89%E6%A0%91%E7%9A%84%E5%89%8D%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索 | 简单 | -| 0590 | [N 叉树的后序遍历](https://leetcode.cn/problems/n-ary-tree-postorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0590.%20N%20%E5%8F%89%E6%A0%91%E7%9A%84%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索 | 简单 | -| 0124 | [二叉树中的最大路径和](https://leetcode.cn/problems/binary-tree-maximum-path-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0124.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E8%B7%AF%E5%BE%84%E5%92%8C.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | -| 0199 | [二叉树的右视图](https://leetcode.cn/problems/binary-tree-right-side-view/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0199.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%8F%B3%E8%A7%86%E5%9B%BE.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | -| 0543 | [二叉树的直径](https://leetcode.cn/problems/diameter-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0543.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E7%9B%B4%E5%BE%84.md) | 树、深度优先搜索、二叉树 | 简单 | -| 0662 | [二叉树最大宽度](https://leetcode.cn/problems/maximum-width-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0662.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E6%9C%80%E5%A4%A7%E5%AE%BD%E5%BA%A6.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | -| 0958 | [二叉树的完全性检验](https://leetcode.cn/problems/check-completeness-of-a-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0958.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%AE%8C%E5%85%A8%E6%80%A7%E6%A3%80%E9%AA%8C.md) | 树、广度优先搜索、二叉树 | 中等 | -| 0572 | [另一棵树的子树](https://leetcode.cn/problems/subtree-of-another-tree/) | | 树、深度优先搜索、二叉树、字符串匹配、哈希函数 | 简单 | -| 0100 | [相同的树](https://leetcode.cn/problems/same-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0100.%20%E7%9B%B8%E5%90%8C%E7%9A%84%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0111 | [二叉树的最小深度](https://leetcode.cn/problems/minimum-depth-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0111.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%B0%8F%E6%B7%B1%E5%BA%A6.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0841 | [钥匙和房间](https://leetcode.cn/problems/keys-and-rooms/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0841.%20%E9%92%A5%E5%8C%99%E5%92%8C%E6%88%BF%E9%97%B4.md) | 深度优先搜索、广度优先搜索、图 | 中等 | -| 0129 | [求根节点到叶节点数字之和](https://leetcode.cn/problems/sum-root-to-leaf-numbers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0129.%20%E6%B1%82%E6%A0%B9%E8%8A%82%E7%82%B9%E5%88%B0%E5%8F%B6%E8%8A%82%E7%82%B9%E6%95%B0%E5%AD%97%E4%B9%8B%E5%92%8C.md) | 树、深度优先搜索、二叉树 | 中等 | -| 0323 | [无向图中连通分量的数目](https://leetcode.cn/problems/number-of-connected-components-in-an-undirected-graph/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0323.%20%E6%97%A0%E5%90%91%E5%9B%BE%E4%B8%AD%E8%BF%9E%E9%80%9A%E5%88%86%E9%87%8F%E7%9A%84%E6%95%B0%E7%9B%AE.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 0684 | [冗余连接](https://leetcode.cn/problems/redundant-connection/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0684.%20%E5%86%97%E4%BD%99%E8%BF%9E%E6%8E%A5.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 0802 | [找到最终的安全状态](https://leetcode.cn/problems/find-eventual-safe-states/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0802.%20%E6%89%BE%E5%88%B0%E6%9C%80%E7%BB%88%E7%9A%84%E5%AE%89%E5%85%A8%E7%8A%B6%E6%80%81.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | -| 0785 | [判断二分图](https://leetcode.cn/problems/is-graph-bipartite/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0785.%20%E5%88%A4%E6%96%AD%E4%BA%8C%E5%88%86%E5%9B%BE.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 0886 | [可能的二分法](https://leetcode.cn/problems/possible-bipartition/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0886.%20%E5%8F%AF%E8%83%BD%E7%9A%84%E4%BA%8C%E5%88%86%E6%B3%95.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 0323 | [无向图中连通分量的数目](https://leetcode.cn/problems/number-of-connected-components-in-an-undirected-graph/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0323.%20%E6%97%A0%E5%90%91%E5%9B%BE%E4%B8%AD%E8%BF%9E%E9%80%9A%E5%88%86%E9%87%8F%E7%9A%84%E6%95%B0%E7%9B%AE.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 0130 | [被围绕的区域](https://leetcode.cn/problems/surrounded-regions/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0130.%20%E8%A2%AB%E5%9B%B4%E7%BB%95%E7%9A%84%E5%8C%BA%E5%9F%9F.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | -| 0417 | [太平洋大西洋水流问题](https://leetcode.cn/problems/pacific-atlantic-water-flow/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0417.%20%E5%A4%AA%E5%B9%B3%E6%B4%8B%E5%A4%A7%E8%A5%BF%E6%B4%8B%E6%B0%B4%E6%B5%81%E9%97%AE%E9%A2%98.md) | 深度优先搜索、广度优先搜索、数组、矩阵 | 中等 | -| 1020 | [飞地的数量](https://leetcode.cn/problems/number-of-enclaves/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1020.%20%E9%A3%9E%E5%9C%B0%E7%9A%84%E6%95%B0%E9%87%8F.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | -| 1254 | [统计封闭岛屿的数目](https://leetcode.cn/problems/number-of-closed-islands/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1254.%20%E7%BB%9F%E8%AE%A1%E5%B0%81%E9%97%AD%E5%B2%9B%E5%B1%BF%E7%9A%84%E6%95%B0%E7%9B%AE.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | -| 1034 | [边界着色](https://leetcode.cn/problems/coloring-a-border/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1034.%20%E8%BE%B9%E7%95%8C%E7%9D%80%E8%89%B2.md) | 深度优先搜索、广度优先搜索、数组、矩阵 | 中等 | -| 剑指 Offer 13 | [机器人的运动范围](https://leetcode.cn/problems/ji-qi-ren-de-yun-dong-fan-wei-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2013.%20%E6%9C%BA%E5%99%A8%E4%BA%BA%E7%9A%84%E8%BF%90%E5%8A%A8%E8%8C%83%E5%9B%B4.md) | 深度优先搜索、广度优先搜索、动态规划 | 中等 | -| 0529 | [扫雷游戏](https://leetcode.cn/problems/minesweeper/) | | 深度优先搜索、广度优先搜索、数组、矩阵 | 中等 | - -### 图的广度优先搜索题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0797 | [所有可能的路径](https://leetcode.cn/problems/all-paths-from-source-to-target/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0797.%20%E6%89%80%E6%9C%89%E5%8F%AF%E8%83%BD%E7%9A%84%E8%B7%AF%E5%BE%84.md) | 深度优先搜索、广度优先搜索、图、回溯 | 中等 | -| 0286 | [墙与门](https://leetcode.cn/problems/walls-and-gates/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0286.%20%E5%A2%99%E4%B8%8E%E9%97%A8.md) | 广度优先搜索、数组、矩阵 | 中等 | -| 0200 | [岛屿数量](https://leetcode.cn/problems/number-of-islands/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0200.%20%E5%B2%9B%E5%B1%BF%E6%95%B0%E9%87%8F.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | -| 0752 | [打开转盘锁](https://leetcode.cn/problems/open-the-lock/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0752.%20%E6%89%93%E5%BC%80%E8%BD%AC%E7%9B%98%E9%94%81.md) | 广度优先搜索、数组、哈希表、字符串 | 中等 | -| 0279 | [完全平方数](https://leetcode.cn/problems/perfect-squares/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0279.%20%E5%AE%8C%E5%85%A8%E5%B9%B3%E6%96%B9%E6%95%B0.md) | 广度优先搜索、数学、动态规划 | 中等 | -| 0133 | [克隆图](https://leetcode.cn/problems/clone-graph/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0133.%20%E5%85%8B%E9%9A%86%E5%9B%BE.md) | 深度优先搜索、广度优先搜索、图、哈希表 | 中等 | -| 0733 | [图像渲染](https://leetcode.cn/problems/flood-fill/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0733.%20%E5%9B%BE%E5%83%8F%E6%B8%B2%E6%9F%93.md) | 深度优先搜索、广度优先搜索、数组、矩阵 | 简单 | -| 0542 | [01 矩阵](https://leetcode.cn/problems/01-matrix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0542.%2001%20%E7%9F%A9%E9%98%B5.md) | 广度优先搜索、数组、动态规划、矩阵 | 中等 | -| 0322 | [零钱兑换](https://leetcode.cn/problems/coin-change/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0322.%20%E9%9B%B6%E9%92%B1%E5%85%91%E6%8D%A2.md) | 广度优先搜索、数组、动态规划 | 中等 | -| 0323 | [无向图中连通分量的数目](https://leetcode.cn/problems/number-of-connected-components-in-an-undirected-graph/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0323.%20%E6%97%A0%E5%90%91%E5%9B%BE%E4%B8%AD%E8%BF%9E%E9%80%9A%E5%88%86%E9%87%8F%E7%9A%84%E6%95%B0%E7%9B%AE.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 剑指 Offer 13 | [机器人的运动范围](https://leetcode.cn/problems/ji-qi-ren-de-yun-dong-fan-wei-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2013.%20%E6%9C%BA%E5%99%A8%E4%BA%BA%E7%9A%84%E8%BF%90%E5%8A%A8%E8%8C%83%E5%9B%B4.md) | 深度优先搜索、广度优先搜索、动态规划 | 中等 | -| 0199 | [二叉树的右视图](https://leetcode.cn/problems/binary-tree-right-side-view/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0199.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%8F%B3%E8%A7%86%E5%9B%BE.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | -| 0662 | [二叉树最大宽度](https://leetcode.cn/problems/maximum-width-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0662.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E6%9C%80%E5%A4%A7%E5%AE%BD%E5%BA%A6.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | -| 0958 | [二叉树的完全性检验](https://leetcode.cn/problems/check-completeness-of-a-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0958.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%AE%8C%E5%85%A8%E6%80%A7%E6%A3%80%E9%AA%8C.md) | 树、广度优先搜索、二叉树 | 中等 | -| 0572 | [另一棵树的子树](https://leetcode.cn/problems/subtree-of-another-tree/) | | 树、深度优先搜索、二叉树、字符串匹配、哈希函数 | 简单 | -| 0100 | [相同的树](https://leetcode.cn/problems/same-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0100.%20%E7%9B%B8%E5%90%8C%E7%9A%84%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0111 | [二叉树的最小深度](https://leetcode.cn/problems/minimum-depth-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0111.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%B0%8F%E6%B7%B1%E5%BA%A6.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 剑指 Offer 32 - III | [从上到下打印二叉树 III](https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2032%20-%20III.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91%20III.md) | 树、广度优先搜索、二叉树 | 中等 | - -### 图的拓扑排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0207 | [课程表](https://leetcode.cn/problems/course-schedule/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0207.%20%E8%AF%BE%E7%A8%8B%E8%A1%A8.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | -| 0210 | [课程表 II](https://leetcode.cn/problems/course-schedule-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0210.%20%E8%AF%BE%E7%A8%8B%E8%A1%A8%20II.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | -| 1136 | [并行课程](https://leetcode.cn/problems/parallel-courses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1136.%20%E5%B9%B6%E8%A1%8C%E8%AF%BE%E7%A8%8B.md) | 图、拓扑排序 | 中等 | -| 2050 | [并行课程 III](https://leetcode.cn/problems/parallel-courses-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2050.%20%E5%B9%B6%E8%A1%8C%E8%AF%BE%E7%A8%8B%20III.md) | 图、拓扑排序、数组、动态规划 | 困难 | -| 0802 | [找到最终的安全状态](https://leetcode.cn/problems/find-eventual-safe-states/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0802.%20%E6%89%BE%E5%88%B0%E6%9C%80%E7%BB%88%E7%9A%84%E5%AE%89%E5%85%A8%E7%8A%B6%E6%80%81.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | -| 0851 | [喧闹和富有](https://leetcode.cn/problems/loud-and-rich/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0851.%20%E5%96%A7%E9%97%B9%E5%92%8C%E5%AF%8C%E6%9C%89.md) | 深度优先搜索、图、拓扑排序、数组 | 中等 | - -### 图的最小生成树题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 1584 | [连接所有点的最小费用](https://leetcode.cn/problems/min-cost-to-connect-all-points/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1584.%20%E8%BF%9E%E6%8E%A5%E6%89%80%E6%9C%89%E7%82%B9%E7%9A%84%E6%9C%80%E5%B0%8F%E8%B4%B9%E7%94%A8.md) | 并查集、图、数组、最小生成树 | 中等 | -| 1631 | [最小体力消耗路径](https://leetcode.cn/problems/path-with-minimum-effort/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1631.%20%E6%9C%80%E5%B0%8F%E4%BD%93%E5%8A%9B%E6%B6%88%E8%80%97%E8%B7%AF%E5%BE%84.md) | 深度优先搜索、广度优先搜索、并查集、数组、二分查找、矩阵、堆（优先队列） | 中等 | -| 0778 | [水位上升的泳池中游泳](https://leetcode.cn/problems/swim-in-rising-water/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0778.%20%E6%B0%B4%E4%BD%8D%E4%B8%8A%E5%8D%87%E7%9A%84%E6%B3%B3%E6%B1%A0%E4%B8%AD%E6%B8%B8%E6%B3%B3.md) | 深度优先搜索、广度优先搜索、并查集、数组、二分查找、矩阵、堆（优先队列） | 困难 | - -### 单源最短路径题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0407 | [接雨水 II](https://leetcode.cn/problems/trapping-rain-water-ii/) | | 广度优先搜索、数组、矩阵、堆（优先队列） | 困难 | -| 0743 | [网络延迟时间](https://leetcode.cn/problems/network-delay-time/) | | 深度优先搜索、广度优先搜索、图、最短路、堆（优先队列） | 中等 | -| 0787 | [K 站中转内最便宜的航班](https://leetcode.cn/problems/cheapest-flights-within-k-stops/) | | 深度优先搜索、广度优先搜索、图、动态规划、最短路、堆（优先队列） | 中等 | -| 1631 | [最小体力消耗路径](https://leetcode.cn/problems/path-with-minimum-effort/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1631.%20%E6%9C%80%E5%B0%8F%E4%BD%93%E5%8A%9B%E6%B6%88%E8%80%97%E8%B7%AF%E5%BE%84.md) | 深度优先搜索、广度优先搜索、并查集、数组、二分查找、矩阵、堆（优先队列） | 中等 | -| 1786 | [从第一个节点出发到最后一个节点的受限路径数](https://leetcode.cn/problems/number-of-restricted-paths-from-first-to-last-node/) | | 图、拓扑排序、动态规划、最短路、堆（优先队列） | 中等 | - -### 多源最短路径题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0815 | [公交路线](https://leetcode.cn/problems/bus-routes/) | | 广度优先搜索、数组、哈希表 | 困难 | -| 1162 | [地图分析](https://leetcode.cn/problems/as-far-from-land-as-possible/) | | 广度优先搜索、数组、动态规划、矩阵 | 中等 | - -### 次短路径题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 2045 | [到达目的地的第二短时间](https://leetcode.cn/problems/second-minimum-time-to-reach-destination/) | | 广度优先搜索、图、最短路 | 困难 | - -### 差分约束系统 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0995 | [K 连续位的最小翻转次数](https://leetcode.cn/problems/minimum-number-of-k-consecutive-bit-flips/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0995.%20K%20%E8%BF%9E%E7%BB%AD%E4%BD%8D%E7%9A%84%E6%9C%80%E5%B0%8F%E7%BF%BB%E8%BD%AC%E6%AC%A1%E6%95%B0.md) | 位运算、队列、数组、前缀和、滑动窗口 | 困难 | -| 1109 | [航班预订统计](https://leetcode.cn/problems/corporate-flight-bookings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1109.%20%E8%88%AA%E7%8F%AD%E9%A2%84%E8%AE%A2%E7%BB%9F%E8%AE%A1.md) | 数组、前缀和 | 中等 | - -### 二分图基础题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0785 | [判断二分图](https://leetcode.cn/problems/is-graph-bipartite/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0785.%20%E5%88%A4%E6%96%AD%E4%BA%8C%E5%88%86%E5%9B%BE.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | - -### 二分图最大匹配题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| LCP 04 | [覆盖](https://leetcode.cn/problems/broken-board-dominoes/) | | 位运算、图、数组、动态规划、状态压缩 | 困难 | -| 1947 | [最大兼容性评分和](https://leetcode.cn/problems/maximum-compatibility-score-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1947.%20%E6%9C%80%E5%A4%A7%E5%85%BC%E5%AE%B9%E6%80%A7%E8%AF%84%E5%88%86%E5%92%8C.md) | 位运算、数组、动态规划、回溯、状态压缩 | 中等 | -| 1595 | [连通两组点的最小成本](https://leetcode.cn/problems/minimum-cost-to-connect-two-groups-of-points/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1595.%20%E8%BF%9E%E9%80%9A%E4%B8%A4%E7%BB%84%E7%82%B9%E7%9A%84%E6%9C%80%E5%B0%8F%E6%88%90%E6%9C%AC.md) | 位运算、数组、动态规划、状态压缩、矩阵 | 困难 | - -## 09. 基础算法 - -### 枚举算法题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0001 | [两数之和](https://leetcode.cn/problems/two-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0001.%20%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、哈希表 | 简单 | -| 0204 | [计数质数](https://leetcode.cn/problems/count-primes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0204.%20%E8%AE%A1%E6%95%B0%E8%B4%A8%E6%95%B0.md) | 数组、数学、枚举、数论 | 中等 | -| 1925 | [统计平方和三元组的数目](https://leetcode.cn/problems/count-square-sum-triples/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1925.%20%E7%BB%9F%E8%AE%A1%E5%B9%B3%E6%96%B9%E5%92%8C%E4%B8%89%E5%85%83%E7%BB%84%E7%9A%84%E6%95%B0%E7%9B%AE.md) | 数学、枚举 | 简单 | -| 1450 | [在既定时间做作业的学生人数](https://leetcode.cn/problems/number-of-students-doing-homework-at-a-given-time/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1450.%20%E5%9C%A8%E6%97%A2%E5%AE%9A%E6%97%B6%E9%97%B4%E5%81%9A%E4%BD%9C%E4%B8%9A%E7%9A%84%E5%AD%A6%E7%94%9F%E4%BA%BA%E6%95%B0.md) | 数组 | 简单 | -| 1620 | [网络信号最好的坐标](https://leetcode.cn/problems/coordinate-with-maximum-network-quality/) | | 数组、枚举 | 中等 | -| 剑指 Offer 57 - II | [和为s的连续正数序列](https://leetcode.cn/problems/he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2057%20-%20II.%20%E5%92%8C%E4%B8%BAs%E7%9A%84%E8%BF%9E%E7%BB%AD%E6%AD%A3%E6%95%B0%E5%BA%8F%E5%88%97.md) | 数学、双指针、枚举 | 简单 | -| 0800 | [相似 RGB 颜色](https://leetcode.cn/problems/similar-rgb-color/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0800.%20%E7%9B%B8%E4%BC%BC%20RGB%20%E9%A2%9C%E8%89%B2.md) | 数学、字符串、枚举 | 简单 | -| 0221 | [最大正方形](https://leetcode.cn/problems/maximal-square/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0221.%20%E6%9C%80%E5%A4%A7%E6%AD%A3%E6%96%B9%E5%BD%A2.md) | 数组、动态规划、矩阵 | 中等 | -| 0560 | [和为 K 的子数组](https://leetcode.cn/problems/subarray-sum-equals-k/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0560.%20%E5%92%8C%E4%B8%BA%20K%20%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、哈希表、前缀和 | 中等 | - -### 递归算法题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0344 | [反转字符串](https://leetcode.cn/problems/reverse-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0344.%20%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 双指针、字符串 | 简单 | -| 0024 | [两两交换链表中的节点](https://leetcode.cn/problems/swap-nodes-in-pairs/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0024.%20%E4%B8%A4%E4%B8%A4%E4%BA%A4%E6%8D%A2%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E8%8A%82%E7%82%B9.md) | 递归、链表 | 中等 | -| 0118 | [杨辉三角](https://leetcode.cn/problems/pascals-triangle/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0118.%20%E6%9D%A8%E8%BE%89%E4%B8%89%E8%A7%92.md) | 数组、动态规划 | 简单 | -| 0119 | [杨辉三角 II](https://leetcode.cn/problems/pascals-triangle-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0119.%20%E6%9D%A8%E8%BE%89%E4%B8%89%E8%A7%92%20II.md) | 数组、动态规划 | 简单 | -| 0206 | [反转链表](https://leetcode.cn/problems/reverse-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0206.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8.md) | 递归、链表 | 简单 | -| 0092 | [反转链表 II](https://leetcode.cn/problems/reverse-linked-list-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0092.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8%20II.md) | 链表 | 中等 | -| 0021 | [合并两个有序链表](https://leetcode.cn/problems/merge-two-sorted-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0021.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E9%93%BE%E8%A1%A8.md) | 递归、链表 | 简单 | -| 0509 | [斐波那契数](https://leetcode.cn/problems/fibonacci-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0509.%20%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0.md) | 递归、记忆化搜索、数学、动态规划 | 简单 | -| 0070 | [爬楼梯](https://leetcode.cn/problems/climbing-stairs/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0070.%20%E7%88%AC%E6%A5%BC%E6%A2%AF.md) | 记忆化搜索、数学、动态规划 | 简单 | -| 0104 | [二叉树的最大深度](https://leetcode.cn/problems/maximum-depth-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0104.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%A4%A7%E6%B7%B1%E5%BA%A6.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0124 | [二叉树中的最大路径和](https://leetcode.cn/problems/binary-tree-maximum-path-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0124.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E8%B7%AF%E5%BE%84%E5%92%8C.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | -| 0226 | [翻转二叉树](https://leetcode.cn/problems/invert-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0226.%20%E7%BF%BB%E8%BD%AC%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0050 | [Pow(x, n)](https://leetcode.cn/problems/powx-n/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0050.%20Pow%28x%2C%20n%29.md) | 递归、数学 | 中等 | -| 0779 | [第K个语法符号](https://leetcode.cn/problems/k-th-symbol-in-grammar/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0779.%20%E7%AC%ACK%E4%B8%AA%E8%AF%AD%E6%B3%95%E7%AC%A6%E5%8F%B7.md) | 位运算、递归、数学 | 中等 | -| 0095 | [不同的二叉搜索树 II](https://leetcode.cn/problems/unique-binary-search-trees-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0095.%20%E4%B8%8D%E5%90%8C%E7%9A%84%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%20II.md) | 树、二叉搜索树、动态规划、回溯、二叉树 | 中等 | -| 剑指 Offer 62 | [圆圈中最后剩下的数字](https://leetcode.cn/problems/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2062.%20%E5%9C%86%E5%9C%88%E4%B8%AD%E6%9C%80%E5%90%8E%E5%89%A9%E4%B8%8B%E7%9A%84%E6%95%B0%E5%AD%97.md) | 递归、数学 | 简单 | - -### 分治算法题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0004 | [寻找两个正序数组的中位数](https://leetcode.cn/problems/median-of-two-sorted-arrays/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0004.%20%E5%AF%BB%E6%89%BE%E4%B8%A4%E4%B8%AA%E6%AD%A3%E5%BA%8F%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0.md) | 数组、二分查找、分治 | 困难 | -| 0023 | [合并 K 个升序链表](https://leetcode.cn/problems/merge-k-sorted-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0023.%20%E5%90%88%E5%B9%B6%20K%20%E4%B8%AA%E5%8D%87%E5%BA%8F%E9%93%BE%E8%A1%A8.md) | 链表、分治、堆（优先队列）、归并排序 | 困难 | -| 0053 | [最大子数组和](https://leetcode.cn/problems/maximum-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0053.%20%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84%E5%92%8C.md) | 数组、分治、动态规划 | 中等 | -| 0241 | [为运算表达式设计优先级](https://leetcode.cn/problems/different-ways-to-add-parentheses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0241.%20%E4%B8%BA%E8%BF%90%E7%AE%97%E8%A1%A8%E8%BE%BE%E5%BC%8F%E8%AE%BE%E8%AE%A1%E4%BC%98%E5%85%88%E7%BA%A7.md) | 递归、记忆化搜索、数学、字符串、动态规划 | 中等 | -| 0169 | [多数元素](https://leetcode.cn/problems/majority-element/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0169.%20%E5%A4%9A%E6%95%B0%E5%85%83%E7%B4%A0.md) | 数组、哈希表、分治、计数、排序 | 简单 | -| 0050 | [Pow(x, n)](https://leetcode.cn/problems/powx-n/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0050.%20Pow%28x%2C%20n%29.md) | 递归、数学 | 中等 | -| 0014 | [最长公共前缀](https://leetcode.cn/problems/longest-common-prefix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0014.%20%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%89%8D%E7%BC%80.md) | 字典树、字符串 | 简单 | -| 剑指 Offer 33 | [二叉搜索树的后序遍历序列](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2033.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86%E5%BA%8F%E5%88%97.md) | 栈、树、二叉搜索树、递归、二叉树、单调栈 | 中等 | - -### 回溯算法题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0046 | [全排列](https://leetcode.cn/problems/permutations/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0046.%20%E5%85%A8%E6%8E%92%E5%88%97.md) | 数组、回溯 | 中等 | -| 0047 | [全排列 II](https://leetcode.cn/problems/permutations-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0047.%20%E5%85%A8%E6%8E%92%E5%88%97%20II.md) | 数组、回溯 | 中等 | -| 0037 | [解数独](https://leetcode.cn/problems/sudoku-solver/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0037.%20%E8%A7%A3%E6%95%B0%E7%8B%AC.md) | 数组、哈希表、回溯、矩阵 | 困难 | -| 0022 | [括号生成](https://leetcode.cn/problems/generate-parentheses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0022.%20%E6%8B%AC%E5%8F%B7%E7%94%9F%E6%88%90.md) | 字符串、动态规划、回溯 | 中等 | -| 0017 | [电话号码的字母组合](https://leetcode.cn/problems/letter-combinations-of-a-phone-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0017.%20%E7%94%B5%E8%AF%9D%E5%8F%B7%E7%A0%81%E7%9A%84%E5%AD%97%E6%AF%8D%E7%BB%84%E5%90%88.md) | 哈希表、字符串、回溯 | 中等 | -| 0784 | [字母大小写全排列](https://leetcode.cn/problems/letter-case-permutation/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0784.%20%E5%AD%97%E6%AF%8D%E5%A4%A7%E5%B0%8F%E5%86%99%E5%85%A8%E6%8E%92%E5%88%97.md) | 位运算、字符串、回溯 | 中等 | -| 0039 | [组合总和](https://leetcode.cn/problems/combination-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0039.%20%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8C.md) | 数组、回溯 | 中等 | -| 0040 | [组合总和 II](https://leetcode.cn/problems/combination-sum-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0040.%20%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8C%20II.md) | 数组、回溯 | 中等 | -| 0078 | [子集](https://leetcode.cn/problems/subsets/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0078.%20%E5%AD%90%E9%9B%86.md) | 位运算、数组、回溯 | 中等 | -| 0090 | [子集 II](https://leetcode.cn/problems/subsets-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0090.%20%E5%AD%90%E9%9B%86%20II.md) | 位运算、数组、回溯 | 中等 | -| 0473 | [火柴拼正方形](https://leetcode.cn/problems/matchsticks-to-square/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0473.%20%E7%81%AB%E6%9F%B4%E6%8B%BC%E6%AD%A3%E6%96%B9%E5%BD%A2.md) | 位运算、数组、动态规划、回溯、状态压缩 | 中等 | -| 1593 | [拆分字符串使唯一子字符串的数目最大](https://leetcode.cn/problems/split-a-string-into-the-max-number-of-unique-substrings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1593.%20%E6%8B%86%E5%88%86%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%BD%BF%E5%94%AF%E4%B8%80%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%95%B0%E7%9B%AE%E6%9C%80%E5%A4%A7.md) | 哈希表、字符串、回溯 | 中等 | -| 1079 | [活字印刷](https://leetcode.cn/problems/letter-tile-possibilities/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1079.%20%E6%B4%BB%E5%AD%97%E5%8D%B0%E5%88%B7.md) | 哈希表、字符串、回溯、计数 | 中等 | -| 0093 | [复原 IP 地址](https://leetcode.cn/problems/restore-ip-addresses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0093.%20%E5%A4%8D%E5%8E%9F%20IP%20%E5%9C%B0%E5%9D%80.md) | 字符串、回溯 | 中等 | -| 0079 | [单词搜索](https://leetcode.cn/problems/word-search/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0079.%20%E5%8D%95%E8%AF%8D%E6%90%9C%E7%B4%A2.md) | 数组、回溯、矩阵 | 中等 | -| 0679 | [24 点游戏](https://leetcode.cn/problems/24-game/) | | 数组、数学、回溯 | 困难 | - -### 贪心算法题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0455 | [分发饼干](https://leetcode.cn/problems/assign-cookies/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0455.%20%E5%88%86%E5%8F%91%E9%A5%BC%E5%B9%B2.md) | 贪心、数组、双指针、排序 | 简单 | -| 0860 | [柠檬水找零](https://leetcode.cn/problems/lemonade-change/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0860.%20%E6%9F%A0%E6%AA%AC%E6%B0%B4%E6%89%BE%E9%9B%B6.md) | 贪心、数组 | 简单 | -| 0056 | [合并区间](https://leetcode.cn/problems/merge-intervals/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0056.%20%E5%90%88%E5%B9%B6%E5%8C%BA%E9%97%B4.md) | 数组、排序 | 中等 | -| 0435 | [无重叠区间](https://leetcode.cn/problems/non-overlapping-intervals/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0435.%20%E6%97%A0%E9%87%8D%E5%8F%A0%E5%8C%BA%E9%97%B4.md) | 贪心、数组、动态规划、排序 | 中等 | -| 0452 | [用最少数量的箭引爆气球](https://leetcode.cn/problems/minimum-number-of-arrows-to-burst-balloons/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0452.%20%E7%94%A8%E6%9C%80%E5%B0%91%E6%95%B0%E9%87%8F%E7%9A%84%E7%AE%AD%E5%BC%95%E7%88%86%E6%B0%94%E7%90%83.md) | 贪心、数组、排序 | 中等 | -| 0055 | [跳跃游戏](https://leetcode.cn/problems/jump-game/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0055.%20%E8%B7%B3%E8%B7%83%E6%B8%B8%E6%88%8F.md) | 贪心、数组、动态规划 | 中等 | -| 0045 | [跳跃游戏 II](https://leetcode.cn/problems/jump-game-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0045.%20%E8%B7%B3%E8%B7%83%E6%B8%B8%E6%88%8F%20II.md) | 贪心、数组、动态规划 | 中等 | -| 0122 | [买卖股票的最佳时机 II](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0122.%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA%20II.md) | 贪心、数组 | 中等 | -| 0561 | [数组拆分](https://leetcode.cn/problems/array-partition/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0561.%20%E6%95%B0%E7%BB%84%E6%8B%86%E5%88%86.md) | 贪心、数组、计数排序、排序 | 简单 | -| 1710 | [卡车上的最大单元数](https://leetcode.cn/problems/maximum-units-on-a-truck/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1710.%20%E5%8D%A1%E8%BD%A6%E4%B8%8A%E7%9A%84%E6%9C%80%E5%A4%A7%E5%8D%95%E5%85%83%E6%95%B0.md) | 贪心、数组、排序 | 简单 | -| 1217 | [玩筹码](https://leetcode.cn/problems/minimum-cost-to-move-chips-to-the-same-position/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1217.%20%E7%8E%A9%E7%AD%B9%E7%A0%81.md) | 贪心、数组、数学 | 简单 | -| 1247 | [交换字符使得字符串相同](https://leetcode.cn/problems/minimum-swaps-to-make-strings-equal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1247.%20%E4%BA%A4%E6%8D%A2%E5%AD%97%E7%AC%A6%E4%BD%BF%E5%BE%97%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E5%90%8C.md) | 贪心、数学、字符串 | 中等 | -| 1400 | [构造 K 个回文字符串](https://leetcode.cn/problems/construct-k-palindrome-strings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1400.%20%E6%9E%84%E9%80%A0%20K%20%E4%B8%AA%E5%9B%9E%E6%96%87%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 贪心、哈希表、字符串、计数 | 中等 | -| 0921 | [使括号有效的最少添加](https://leetcode.cn/problems/minimum-add-to-make-parentheses-valid/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0921.%20%E4%BD%BF%E6%8B%AC%E5%8F%B7%E6%9C%89%E6%95%88%E7%9A%84%E6%9C%80%E5%B0%91%E6%B7%BB%E5%8A%A0.md) | 栈、贪心、字符串 | 中等 | -| 1029 | [两地调度](https://leetcode.cn/problems/two-city-scheduling/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1029.%20%E4%B8%A4%E5%9C%B0%E8%B0%83%E5%BA%A6.md) | 贪心、数组、排序 | 中等 | -| 1605 | [给定行和列的和求可行矩阵](https://leetcode.cn/problems/find-valid-matrix-given-row-and-column-sums/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1605.%20%E7%BB%99%E5%AE%9A%E8%A1%8C%E5%92%8C%E5%88%97%E7%9A%84%E5%92%8C%E6%B1%82%E5%8F%AF%E8%A1%8C%E7%9F%A9%E9%98%B5.md) | 贪心、数组、矩阵 | 中等 | -| 0135 | [分发糖果](https://leetcode.cn/problems/candy/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0135.%20%E5%88%86%E5%8F%91%E7%B3%96%E6%9E%9C.md) | 贪心、数组 | 困难 | -| 0134 | [加油站](https://leetcode.cn/problems/gas-station/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0134.%20%E5%8A%A0%E6%B2%B9%E7%AB%99.md) | 贪心、数组 | 中等 | -| 0053 | [最大子数组和](https://leetcode.cn/problems/maximum-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0053.%20%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84%E5%92%8C.md) | 数组、分治、动态规划 | 中等 | -| 0376 | [摆动序列](https://leetcode.cn/problems/wiggle-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0376.%20%E6%91%86%E5%8A%A8%E5%BA%8F%E5%88%97.md) | 贪心、数组、动态规划 | 中等 | -| 0738 | [单调递增的数字](https://leetcode.cn/problems/monotone-increasing-digits/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0738.%20%E5%8D%95%E8%B0%83%E9%80%92%E5%A2%9E%E7%9A%84%E6%95%B0%E5%AD%97.md) | 贪心、数学 | 中等 | -| 0402 | [移掉 K 位数字](https://leetcode.cn/problems/remove-k-digits/) | | 栈、贪心、字符串、单调栈 | 中等 | -| 0861 | [翻转矩阵后的得分](https://leetcode.cn/problems/score-after-flipping-matrix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0861.%20%E7%BF%BB%E8%BD%AC%E7%9F%A9%E9%98%B5%E5%90%8E%E7%9A%84%E5%BE%97%E5%88%86.md) | 贪心、位运算、数组、矩阵 | 中等 | -| 0670 | [最大交换](https://leetcode.cn/problems/maximum-swap/) | | 贪心、数学 | 中等 | - -### 位运算题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0504 | [七进制数](https://leetcode.cn/problems/base-7/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0504.%20%E4%B8%83%E8%BF%9B%E5%88%B6%E6%95%B0.md) | 数学 | 简单 | -| 0405 | [数字转换为十六进制数](https://leetcode.cn/problems/convert-a-number-to-hexadecimal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0405.%20%E6%95%B0%E5%AD%97%E8%BD%AC%E6%8D%A2%E4%B8%BA%E5%8D%81%E5%85%AD%E8%BF%9B%E5%88%B6%E6%95%B0.md) | 位运算、数学 | 简单 | -| 0190 | [颠倒二进制位](https://leetcode.cn/problems/reverse-bits/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0190.%20%E9%A2%A0%E5%80%92%E4%BA%8C%E8%BF%9B%E5%88%B6%E4%BD%8D.md) | 位运算、分治 | 简单 | -| 1009 | [十进制整数的反码](https://leetcode.cn/problems/complement-of-base-10-integer/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1009.%20%E5%8D%81%E8%BF%9B%E5%88%B6%E6%95%B4%E6%95%B0%E7%9A%84%E5%8F%8D%E7%A0%81.md) | 位运算 | 简单 | -| 0191 | [位1的个数](https://leetcode.cn/problems/number-of-1-bits/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0191.%20%E4%BD%8D1%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 位运算、分治 | 简单 | -| 0371 | [两整数之和](https://leetcode.cn/problems/sum-of-two-integers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0371.%20%E4%B8%A4%E6%95%B4%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 位运算、数学 | 中等 | -| 0089 | [格雷编码](https://leetcode.cn/problems/gray-code/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0089.%20%E6%A0%BC%E9%9B%B7%E7%BC%96%E7%A0%81.md) | 位运算、数学、回溯 | 中等 | -| 0201 | [数字范围按位与](https://leetcode.cn/problems/bitwise-and-of-numbers-range/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0201.%20%E6%95%B0%E5%AD%97%E8%8C%83%E5%9B%B4%E6%8C%89%E4%BD%8D%E4%B8%8E.md) | 位运算 | 中等 | -| 0338 | [比特位计数](https://leetcode.cn/problems/counting-bits/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0338.%20%E6%AF%94%E7%89%B9%E4%BD%8D%E8%AE%A1%E6%95%B0.md) | 位运算、动态规划 | 简单 | -| 0136 | [只出现一次的数字](https://leetcode.cn/problems/single-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0136.%20%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B0%E5%AD%97.md) | 位运算、数组 | 简单 | -| 0137 | [只出现一次的数字 II](https://leetcode.cn/problems/single-number-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0137.%20%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B0%E5%AD%97%20II.md) | 位运算、数组 | 中等 | -| 0260 | [只出现一次的数字 III](https://leetcode.cn/problems/single-number-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0260.%20%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B0%E5%AD%97%20III.md) | 位运算、数组 | 中等 | -| 0268 | [丢失的数字](https://leetcode.cn/problems/missing-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0268.%20%E4%B8%A2%E5%A4%B1%E7%9A%84%E6%95%B0%E5%AD%97.md) | 位运算、数组、哈希表、数学、二分查找、排序 | 简单 | -| 1349 | [参加考试的最大学生数](https://leetcode.cn/problems/maximum-students-taking-exam/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1349.%20%E5%8F%82%E5%8A%A0%E8%80%83%E8%AF%95%E7%9A%84%E6%9C%80%E5%A4%A7%E5%AD%A6%E7%94%9F%E6%95%B0.md) | 位运算、数组、动态规划、状态压缩、矩阵 | 困难 | -| 0645 | [错误的集合](https://leetcode.cn/problems/set-mismatch/) | | 位运算、数组、哈希表、排序 | 简单 | -| 0078 | [子集](https://leetcode.cn/problems/subsets/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0078.%20%E5%AD%90%E9%9B%86.md) | 位运算、数组、回溯 | 中等 | -| 0090 | [子集 II](https://leetcode.cn/problems/subsets-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0090.%20%E5%AD%90%E9%9B%86%20II.md) | 位运算、数组、回溯 | 中等 | - -## 10. 动态规划 - -### 动态规划基础题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0509 | [斐波那契数](https://leetcode.cn/problems/fibonacci-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0509.%20%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0.md) | 递归、记忆化搜索、数学、动态规划 | 简单 | -| 0070 | [爬楼梯](https://leetcode.cn/problems/climbing-stairs/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0070.%20%E7%88%AC%E6%A5%BC%E6%A2%AF.md) | 记忆化搜索、数学、动态规划 | 简单 | -| 0062 | [不同路径](https://leetcode.cn/problems/unique-paths/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0062.%20%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84.md) | 数学、动态规划、组合数学 | 中等 | - -### 记忆化搜索题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 1137 | [第 N 个泰波那契数](https://leetcode.cn/problems/n-th-tribonacci-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1137.%20%E7%AC%AC%20N%20%E4%B8%AA%E6%B3%B0%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0.md) | 记忆化搜索、数学、动态规划 | 简单 | -| 0375 | [猜数字大小 II](https://leetcode.cn/problems/guess-number-higher-or-lower-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0375.%20%E7%8C%9C%E6%95%B0%E5%AD%97%E5%A4%A7%E5%B0%8F%20II.md) | 数学、动态规划、博弈 | 中等 | -| 0494 | [目标和](https://leetcode.cn/problems/target-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0494.%20%E7%9B%AE%E6%A0%87%E5%92%8C.md) | 数组、动态规划、回溯 | 中等 | -| 0576 | [出界的路径数](https://leetcode.cn/problems/out-of-boundary-paths/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0576.%20%E5%87%BA%E7%95%8C%E7%9A%84%E8%B7%AF%E5%BE%84%E6%95%B0.md) | 动态规划 | 中等 | -| 0087 | [扰乱字符串](https://leetcode.cn/problems/scramble-string/) | | 字符串、动态规划 | 困难 | -| 0403 | [青蛙过河](https://leetcode.cn/problems/frog-jump/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0403.%20%E9%9D%92%E8%9B%99%E8%BF%87%E6%B2%B3.md) | 数组、动态规划 | 困难 | -| 0552 | [学生出勤记录 II](https://leetcode.cn/problems/student-attendance-record-ii/) | | 动态规划 | 困难 | -| 0913 | [猫和老鼠](https://leetcode.cn/problems/cat-and-mouse/) | | 图、拓扑排序、记忆化搜索、数学、动态规划、博弈 | 困难 | -| 0329 | [矩阵中的最长递增路径](https://leetcode.cn/problems/longest-increasing-path-in-a-matrix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0329.%20%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E8%B7%AF%E5%BE%84.md) | 深度优先搜索、广度优先搜索、图、拓扑排序、记忆化搜索、数组、动态规划、矩阵 | 困难 | - -### 线性 DP 题目 - -#### 单串线性 DP 问题 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0300 | [最长递增子序列](https://leetcode.cn/problems/longest-increasing-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0300.%20%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E5%AD%90%E5%BA%8F%E5%88%97.md) | 数组、二分查找、动态规划 | 中等 | -| 0673 | [最长递增子序列的个数](https://leetcode.cn/problems/number-of-longest-increasing-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0673.%20%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 树状数组、线段树、数组、动态规划 | 中等 | -| 0354 | [俄罗斯套娃信封问题](https://leetcode.cn/problems/russian-doll-envelopes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0354.%20%E4%BF%84%E7%BD%97%E6%96%AF%E5%A5%97%E5%A8%83%E4%BF%A1%E5%B0%81%E9%97%AE%E9%A2%98.md) | 数组、二分查找、动态规划、排序 | 困难 | -| 0053 | [最大子数组和](https://leetcode.cn/problems/maximum-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0053.%20%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84%E5%92%8C.md) | 数组、分治、动态规划 | 中等 | -| 0152 | [乘积最大子数组](https://leetcode.cn/problems/maximum-product-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0152.%20%E4%B9%98%E7%A7%AF%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、动态规划 | 中等 | -| 0918 | [环形子数组的最大和](https://leetcode.cn/problems/maximum-sum-circular-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0918.%20%E7%8E%AF%E5%BD%A2%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%92%8C.md) | 队列、数组、分治、动态规划、单调队列 | 中等 | -| 0198 | [打家劫舍](https://leetcode.cn/problems/house-robber/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0198.%20%E6%89%93%E5%AE%B6%E5%8A%AB%E8%88%8D.md) | 数组、动态规划 | 中等 | -| 0213 | [打家劫舍 II](https://leetcode.cn/problems/house-robber-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0213.%20%E6%89%93%E5%AE%B6%E5%8A%AB%E8%88%8D%20II.md) | 数组、动态规划 | 中等 | -| 0740 | [删除并获得点数](https://leetcode.cn/problems/delete-and-earn/) | | 数组、哈希表、动态规划 | 中等 | -| 1388 | [3n 块披萨](https://leetcode.cn/problems/pizza-with-3n-slices/) | | 贪心、数组、动态规划、堆（优先队列） | 困难 | -| 0873 | [最长的斐波那契子序列的长度](https://leetcode.cn/problems/length-of-longest-fibonacci-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0873.%20%E6%9C%80%E9%95%BF%E7%9A%84%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E9%95%BF%E5%BA%A6.md) | 数组、哈希表、动态规划 | 中等 | -| 1027 | [最长等差数列](https://leetcode.cn/problems/longest-arithmetic-subsequence/) | | 数组、哈希表、二分查找、动态规划 | 中等 | -| 1055 | [形成字符串的最短路径](https://leetcode.cn/problems/shortest-way-to-form-string/) | | 贪心、双指针、字符串 | 中等 | -| 0368 | [最大整除子集](https://leetcode.cn/problems/largest-divisible-subset/) | | 数组、数学、动态规划、排序 | 中等 | -| 0032 | [最长有效括号](https://leetcode.cn/problems/longest-valid-parentheses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0032.%20%E6%9C%80%E9%95%BF%E6%9C%89%E6%95%88%E6%8B%AC%E5%8F%B7.md) | 栈、字符串、动态规划 | 困难 | -| 0413 | [等差数列划分](https://leetcode.cn/problems/arithmetic-slices/) | | 数组、动态规划 | 中等 | -| 0091 | [解码方法](https://leetcode.cn/problems/decode-ways/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0091.%20%E8%A7%A3%E7%A0%81%E6%96%B9%E6%B3%95.md) | 字符串、动态规划 | 中等 | -| 0639 | [解码方法 II](https://leetcode.cn/problems/decode-ways-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0639.%20%E8%A7%A3%E7%A0%81%E6%96%B9%E6%B3%95%20II.md) | 字符串、动态规划 | 困难 | -| 0132 | [分割回文串 II](https://leetcode.cn/problems/palindrome-partitioning-ii/) | | 字符串、动态规划 | 困难 | -| 1220 | [统计元音字母序列的数目](https://leetcode.cn/problems/count-vowels-permutation/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1220.%20%E7%BB%9F%E8%AE%A1%E5%85%83%E9%9F%B3%E5%AD%97%E6%AF%8D%E5%BA%8F%E5%88%97%E7%9A%84%E6%95%B0%E7%9B%AE.md) | 动态规划 | 困难 | -| 0338 | [比特位计数](https://leetcode.cn/problems/counting-bits/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0338.%20%E6%AF%94%E7%89%B9%E4%BD%8D%E8%AE%A1%E6%95%B0.md) | 位运算、动态规划 | 简单 | -| 0801 | [使序列递增的最小交换次数](https://leetcode.cn/problems/minimum-swaps-to-make-sequences-increasing/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0801.%20%E4%BD%BF%E5%BA%8F%E5%88%97%E9%80%92%E5%A2%9E%E7%9A%84%E6%9C%80%E5%B0%8F%E4%BA%A4%E6%8D%A2%E6%AC%A1%E6%95%B0.md) | 数组、动态规划 | 困难 | -| 0871 | [最低加油次数](https://leetcode.cn/problems/minimum-number-of-refueling-stops/) | | 贪心、数组、动态规划、堆（优先队列） | 困难 | -| 0045 | [跳跃游戏 II](https://leetcode.cn/problems/jump-game-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0045.%20%E8%B7%B3%E8%B7%83%E6%B8%B8%E6%88%8F%20II.md) | 贪心、数组、动态规划 | 中等 | -| 0813 | [最大平均值和的分组](https://leetcode.cn/problems/largest-sum-of-averages/) | | 数组、动态规划、前缀和 | 中等 | -| 0887 | [鸡蛋掉落](https://leetcode.cn/problems/super-egg-drop/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0887.%20%E9%B8%A1%E8%9B%8B%E6%8E%89%E8%90%BD.md) | 数学、二分查找、动态规划 | 困难 | -| 0256 | [粉刷房子](https://leetcode.cn/problems/paint-house/) | | 数组、动态规划 | 中等 | -| 0265 | [粉刷房子 II](https://leetcode.cn/problems/paint-house-ii/) | | 数组、动态规划 | 困难 | -| 1473 | [粉刷房子 III](https://leetcode.cn/problems/paint-house-iii/) | | 数组、动态规划 | 困难 | -| 0975 | [奇偶跳](https://leetcode.cn/problems/odd-even-jump/) | | 栈、数组、动态规划、有序集合、单调栈 | 困难 | -| 0403 | [青蛙过河](https://leetcode.cn/problems/frog-jump/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0403.%20%E9%9D%92%E8%9B%99%E8%BF%87%E6%B2%B3.md) | 数组、动态规划 | 困难 | -| 1478 | [安排邮筒](https://leetcode.cn/problems/allocate-mailboxes/) | | 数组、数学、动态规划、排序 | 困难 | -| 1230 | [抛掷硬币](https://leetcode.cn/problems/toss-strange-coins/) | | 数学、动态规划、概率与统计 | 中等 | -| 0410 | [分割数组的最大值](https://leetcode.cn/problems/split-array-largest-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0410.%20%E5%88%86%E5%89%B2%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md) | 贪心、数组、二分查找、动态规划、前缀和 | 困难 | -| 1751 | [最多可以参加的会议数目 II](https://leetcode.cn/problems/maximum-number-of-events-that-can-be-attended-ii/) | | 数组、二分查找、动态规划、排序 | 困难 | -| 1787 | [使所有区间的异或结果为零](https://leetcode.cn/problems/make-the-xor-of-all-segments-equal-to-zero/) | | 位运算、数组、动态规划 | 困难 | -| 0121 | [买卖股票的最佳时机](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0121.%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA.md) | 数组、动态规划 | 简单 | -| 0122 | [买卖股票的最佳时机 II](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0122.%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA%20II.md) | 贪心、数组 | 中等 | -| 0123 | [买卖股票的最佳时机 III](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0123.%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA%20III.md) | 数组、动态规划 | 困难 | -| 0188 | [买卖股票的最佳时机 IV](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-iv/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0188.%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA%20IV.md) | 数组、动态规划 | 困难 | -| 0309 | [最佳买卖股票时机含冷冻期](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-cooldown/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0309.%20%E6%9C%80%E4%BD%B3%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E6%97%B6%E6%9C%BA%E5%90%AB%E5%86%B7%E5%86%BB%E6%9C%9F.md) | 数组、动态规划 | 中等 | -| 0714 | [买卖股票的最佳时机含手续费](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0714.%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA%E5%90%AB%E6%89%8B%E7%BB%AD%E8%B4%B9.md) | 贪心、数组 | 中等 | - -#### 双串线性 DP 问题 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 1143 | [最长公共子序列](https://leetcode.cn/problems/longest-common-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1143.%20%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%AD%90%E5%BA%8F%E5%88%97.md) | 字符串、动态规划 | 中等 | -| 0712 | [两个字符串的最小ASCII删除和](https://leetcode.cn/problems/minimum-ascii-delete-sum-for-two-strings/) | | 字符串、动态规划 | 中等 | -| 0718 | [最长重复子数组](https://leetcode.cn/problems/maximum-length-of-repeated-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0718.%20%E6%9C%80%E9%95%BF%E9%87%8D%E5%A4%8D%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、二分查找、动态规划、滑动窗口、哈希函数、滚动哈希 | 中等 | -| 0583 | [两个字符串的删除操作](https://leetcode.cn/problems/delete-operation-for-two-strings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0583.%20%E4%B8%A4%E4%B8%AA%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E5%88%A0%E9%99%A4%E6%93%8D%E4%BD%9C.md) | 字符串、动态规划 | 中等 | -| 0072 | [编辑距离](https://leetcode.cn/problems/edit-distance/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0072.%20%E7%BC%96%E8%BE%91%E8%B7%9D%E7%A6%BB.md) | 字符串、动态规划 | 困难 | -| 0044 | [通配符匹配](https://leetcode.cn/problems/wildcard-matching/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0044.%20%E9%80%9A%E9%85%8D%E7%AC%A6%E5%8C%B9%E9%85%8D.md) | 贪心、递归、字符串、动态规划 | 困难 | -| 0010 | [正则表达式匹配](https://leetcode.cn/problems/regular-expression-matching/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0010.%20%E6%AD%A3%E5%88%99%E8%A1%A8%E8%BE%BE%E5%BC%8F%E5%8C%B9%E9%85%8D.md) | 递归、字符串、动态规划 | 困难 | -| 0097 | [交错字符串](https://leetcode.cn/problems/interleaving-string/) | | 字符串、动态规划 | 中等 | -| 0115 | [不同的子序列](https://leetcode.cn/problems/distinct-subsequences/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0115.%20%E4%B8%8D%E5%90%8C%E7%9A%84%E5%AD%90%E5%BA%8F%E5%88%97.md) | 字符串、动态规划 | 困难 | -| 0087 | [扰乱字符串](https://leetcode.cn/problems/scramble-string/) | | 字符串、动态规划 | 困难 | - -#### 矩阵线性 DP 问题 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0118 | [杨辉三角](https://leetcode.cn/problems/pascals-triangle/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0118.%20%E6%9D%A8%E8%BE%89%E4%B8%89%E8%A7%92.md) | 数组、动态规划 | 简单 | -| 0119 | [杨辉三角 II](https://leetcode.cn/problems/pascals-triangle-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0119.%20%E6%9D%A8%E8%BE%89%E4%B8%89%E8%A7%92%20II.md) | 数组、动态规划 | 简单 | -| 0120 | [三角形最小路径和](https://leetcode.cn/problems/triangle/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0120.%20%E4%B8%89%E8%A7%92%E5%BD%A2%E6%9C%80%E5%B0%8F%E8%B7%AF%E5%BE%84%E5%92%8C.md) | 数组、动态规划 | 中等 | -| 0064 | [最小路径和](https://leetcode.cn/problems/minimum-path-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0064.%20%E6%9C%80%E5%B0%8F%E8%B7%AF%E5%BE%84%E5%92%8C.md) | 数组、动态规划、矩阵 | 中等 | -| 0174 | [地下城游戏](https://leetcode.cn/problems/dungeon-game/) | | 数组、动态规划、矩阵 | 困难 | -| 0221 | [最大正方形](https://leetcode.cn/problems/maximal-square/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0221.%20%E6%9C%80%E5%A4%A7%E6%AD%A3%E6%96%B9%E5%BD%A2.md) | 数组、动态规划、矩阵 | 中等 | -| 0931 | [下降路径最小和](https://leetcode.cn/problems/minimum-falling-path-sum/) | | 数组、动态规划、矩阵 | 中等 | -| 0576 | [出界的路径数](https://leetcode.cn/problems/out-of-boundary-paths/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0576.%20%E5%87%BA%E7%95%8C%E7%9A%84%E8%B7%AF%E5%BE%84%E6%95%B0.md) | 动态规划 | 中等 | -| 0085 | [最大矩形](https://leetcode.cn/problems/maximal-rectangle/) | | 栈、数组、动态规划、矩阵、单调栈 | 困难 | -| 0363 | [矩形区域不超过 K 的最大数值和](https://leetcode.cn/problems/max-sum-of-rectangle-no-larger-than-k/) | | 数组、二分查找、矩阵、有序集合、前缀和 | 困难 | -| 面试题 17.24 | [最大子矩阵](https://leetcode.cn/problems/max-submatrix-lcci/) | | 数组、动态规划、矩阵、前缀和 | 困难 | -| 1444 | [切披萨的方案数](https://leetcode.cn/problems/number-of-ways-of-cutting-a-pizza/) | | 记忆化搜索、数组、动态规划、矩阵 | 困难 | - -#### 无串线性 DP 问题 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 1137 | [第 N 个泰波那契数](https://leetcode.cn/problems/n-th-tribonacci-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1137.%20%E7%AC%AC%20N%20%E4%B8%AA%E6%B3%B0%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0.md) | 记忆化搜索、数学、动态规划 | 简单 | -| 0650 | [只有两个键的键盘](https://leetcode.cn/problems/2-keys-keyboard/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0650.%20%E5%8F%AA%E6%9C%89%E4%B8%A4%E4%B8%AA%E9%94%AE%E7%9A%84%E9%94%AE%E7%9B%98.md) | 数学、动态规划 | 中等 | -| 0264 | [丑数 II](https://leetcode.cn/problems/ugly-number-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0264.%20%E4%B8%91%E6%95%B0%20II.md) | 哈希表、数学、动态规划、堆（优先队列） | 中等 | -| 0279 | [完全平方数](https://leetcode.cn/problems/perfect-squares/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0279.%20%E5%AE%8C%E5%85%A8%E5%B9%B3%E6%96%B9%E6%95%B0.md) | 广度优先搜索、数学、动态规划 | 中等 | -| 0343 | [整数拆分](https://leetcode.cn/problems/integer-break/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0343.%20%E6%95%B4%E6%95%B0%E6%8B%86%E5%88%86.md) | 数学、动态规划 | 中等 | - -### 背包问题题目 - -#### 0-1 背包问题 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0416 | [分割等和子集](https://leetcode.cn/problems/partition-equal-subset-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0416.%20%E5%88%86%E5%89%B2%E7%AD%89%E5%92%8C%E5%AD%90%E9%9B%86.md) | 数组、动态规划 | 中等 | -| 0494 | [目标和](https://leetcode.cn/problems/target-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0494.%20%E7%9B%AE%E6%A0%87%E5%92%8C.md) | 数组、动态规划、回溯 | 中等 | -| 1049 | [最后一块石头的重量 II](https://leetcode.cn/problems/last-stone-weight-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1049.%20%E6%9C%80%E5%90%8E%E4%B8%80%E5%9D%97%E7%9F%B3%E5%A4%B4%E7%9A%84%E9%87%8D%E9%87%8F%20II.md) | 数组、动态规划 | 中等 | - -#### 完全背包问题 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0279 | [完全平方数](https://leetcode.cn/problems/perfect-squares/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0279.%20%E5%AE%8C%E5%85%A8%E5%B9%B3%E6%96%B9%E6%95%B0.md) | 广度优先搜索、数学、动态规划 | 中等 | -| 0322 | [零钱兑换](https://leetcode.cn/problems/coin-change/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0322.%20%E9%9B%B6%E9%92%B1%E5%85%91%E6%8D%A2.md) | 广度优先搜索、数组、动态规划 | 中等 | -| 0518 | [零钱兑换 II](https://leetcode.cn/problems/coin-change-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0518.%20%E9%9B%B6%E9%92%B1%E5%85%91%E6%8D%A2%20II.md) | 数组、动态规划 | 中等 | -| 0139 | [单词拆分](https://leetcode.cn/problems/word-break/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0139.%20%E5%8D%95%E8%AF%8D%E6%8B%86%E5%88%86.md) | 字典树、记忆化搜索、数组、哈希表、字符串、动态规划 | 中等 | -| 0377 | [组合总和 Ⅳ](https://leetcode.cn/problems/combination-sum-iv/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0377.%20%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8C%20%E2%85%A3.md) | 数组、动态规划 | 中等 | -| 0638 | [大礼包](https://leetcode.cn/problems/shopping-offers/) | | 位运算、记忆化搜索、数组、动态规划、回溯、状态压缩 | 中等 | -| 1449 | [数位成本和为目标值的最大数字](https://leetcode.cn/problems/form-largest-integer-with-digits-that-add-up-to-target/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1449.%20%E6%95%B0%E4%BD%8D%E6%88%90%E6%9C%AC%E5%92%8C%E4%B8%BA%E7%9B%AE%E6%A0%87%E5%80%BC%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E5%AD%97.md) | 数组、动态规划 | 困难 | - -#### 多重背包问题 - -#### 分组背包问题 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 1155 | [掷骰子等于目标和的方法数](https://leetcode.cn/problems/number-of-dice-rolls-with-target-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1155.%20%E6%8E%B7%E9%AA%B0%E5%AD%90%E7%AD%89%E4%BA%8E%E7%9B%AE%E6%A0%87%E5%92%8C%E7%9A%84%E6%96%B9%E6%B3%95%E6%95%B0.md) | 动态规划 | 中等 | -| 2585 | [获得分数的方法数](https://leetcode.cn/problems/number-of-ways-to-earn-points/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2585.%20%E8%8E%B7%E5%BE%97%E5%88%86%E6%95%B0%E7%9A%84%E6%96%B9%E6%B3%95%E6%95%B0.md) | 数组、动态规划 | 困难 | - -#### 多维背包问题 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0474 | [一和零](https://leetcode.cn/problems/ones-and-zeroes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0474.%20%E4%B8%80%E5%92%8C%E9%9B%B6.md) | 数组、字符串、动态规划 | 中等 | -| 0879 | [盈利计划](https://leetcode.cn/problems/profitable-schemes/) | | 数组、动态规划 | 困难 | -| 1995 | [统计特殊四元组](https://leetcode.cn/problems/count-special-quadruplets/) | | 数组、枚举 | 简单 | - -### 区间 DP 题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0486 | [预测赢家](https://leetcode.cn/problems/predict-the-winner/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0486.%20%E9%A2%84%E6%B5%8B%E8%B5%A2%E5%AE%B6.md) | 递归、数组、数学、动态规划、博弈 | 中等 | -| 0312 | [戳气球](https://leetcode.cn/problems/burst-balloons/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0312.%20%E6%88%B3%E6%B0%94%E7%90%83.md) | 数组、动态规划 | 困难 | -| 0877 | [石子游戏](https://leetcode.cn/problems/stone-game/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0877.%20%E7%9F%B3%E5%AD%90%E6%B8%B8%E6%88%8F.md) | 数组、数学、动态规划、博弈 | 中等 | -| 1000 | [合并石头的最低成本](https://leetcode.cn/problems/minimum-cost-to-merge-stones/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1000.%20%E5%90%88%E5%B9%B6%E7%9F%B3%E5%A4%B4%E7%9A%84%E6%9C%80%E4%BD%8E%E6%88%90%E6%9C%AC.md) | 数组、动态规划、前缀和 | 困难 | -| 1547 | [切棍子的最小成本](https://leetcode.cn/problems/minimum-cost-to-cut-a-stick/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1547.%20%E5%88%87%E6%A3%8D%E5%AD%90%E7%9A%84%E6%9C%80%E5%B0%8F%E6%88%90%E6%9C%AC.md) | 数组、动态规划、排序 | 困难 | -| 0664 | [奇怪的打印机](https://leetcode.cn/problems/strange-printer/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0664.%20%E5%A5%87%E6%80%AA%E7%9A%84%E6%89%93%E5%8D%B0%E6%9C%BA.md) | 字符串、动态规划 | 困难 | -| 1039 | [多边形三角剖分的最低得分](https://leetcode.cn/problems/minimum-score-triangulation-of-polygon/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1039.%20%E5%A4%9A%E8%BE%B9%E5%BD%A2%E4%B8%89%E8%A7%92%E5%89%96%E5%88%86%E7%9A%84%E6%9C%80%E4%BD%8E%E5%BE%97%E5%88%86.md) | 数组、动态规划 | 中等 | -| 0546 | [移除盒子](https://leetcode.cn/problems/remove-boxes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0546.%20%E7%A7%BB%E9%99%A4%E7%9B%92%E5%AD%90.md) | 记忆化搜索、数组、动态规划 | 困难 | -| 0375 | [猜数字大小 II](https://leetcode.cn/problems/guess-number-higher-or-lower-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0375.%20%E7%8C%9C%E6%95%B0%E5%AD%97%E5%A4%A7%E5%B0%8F%20II.md) | 数学、动态规划、博弈 | 中等 | -| 0678 | [有效的括号字符串](https://leetcode.cn/problems/valid-parenthesis-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0678.%20%E6%9C%89%E6%95%88%E7%9A%84%E6%8B%AC%E5%8F%B7%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 栈、贪心、字符串、动态规划 | 中等 | -| 0005 | [最长回文子串](https://leetcode.cn/problems/longest-palindromic-substring/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0005.%20%E6%9C%80%E9%95%BF%E5%9B%9E%E6%96%87%E5%AD%90%E4%B8%B2.md) | 字符串、动态规划 | 中等 | -| 0516 | [最长回文子序列](https://leetcode.cn/problems/longest-palindromic-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0516.%20%E6%9C%80%E9%95%BF%E5%9B%9E%E6%96%87%E5%AD%90%E5%BA%8F%E5%88%97.md) | 字符串、动态规划 | 中等 | -| 0730 | [统计不同回文子序列](https://leetcode.cn/problems/count-different-palindromic-subsequences/) | | 字符串、动态规划 | 困难 | -| 2104 | [子数组范围和](https://leetcode.cn/problems/sum-of-subarray-ranges/) | | 栈、数组、单调栈 | 中等 | - -### 树形 DP 题目 - -#### 固定根的树形 DP 题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0543 | [二叉树的直径](https://leetcode.cn/problems/diameter-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0543.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E7%9B%B4%E5%BE%84.md) | 树、深度优先搜索、二叉树 | 简单 | -| 0124 | [二叉树中的最大路径和](https://leetcode.cn/problems/binary-tree-maximum-path-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0124.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E8%B7%AF%E5%BE%84%E5%92%8C.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | -| 1245 | [树的直径](https://leetcode.cn/problems/tree-diameter/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1245.%20%E6%A0%91%E7%9A%84%E7%9B%B4%E5%BE%84.md) | 树、深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | -| 2246 | [相邻字符不同的最长路径](https://leetcode.cn/problems/longest-path-with-different-adjacent-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2246.%20%E7%9B%B8%E9%82%BB%E5%AD%97%E7%AC%A6%E4%B8%8D%E5%90%8C%E7%9A%84%E6%9C%80%E9%95%BF%E8%B7%AF%E5%BE%84.md) | 树、深度优先搜索、图、拓扑排序、数组、字符串 | 困难 | -| 0687 | [最长同值路径](https://leetcode.cn/problems/longest-univalue-path/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0687.%20%E6%9C%80%E9%95%BF%E5%90%8C%E5%80%BC%E8%B7%AF%E5%BE%84.md) | 树、深度优先搜索、二叉树 | 中等 | -| 0337 | [打家劫舍 III](https://leetcode.cn/problems/house-robber-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0337.%20%E6%89%93%E5%AE%B6%E5%8A%AB%E8%88%8D%20III.md) | 树、深度优先搜索、动态规划、二叉树 | 中等 | -| 0333 | [最大 BST 子树](https://leetcode.cn/problems/largest-bst-subtree/) | | 树、深度优先搜索、二叉搜索树、动态规划、二叉树 | 中等 | -| 1617 | [统计子树中城市之间最大距离](https://leetcode.cn/problems/count-subtrees-with-max-distance-between-cities/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1617.%20%E7%BB%9F%E8%AE%A1%E5%AD%90%E6%A0%91%E4%B8%AD%E5%9F%8E%E5%B8%82%E4%B9%8B%E9%97%B4%E6%9C%80%E5%A4%A7%E8%B7%9D%E7%A6%BB.md) | 位运算、树、动态规划、状态压缩、枚举 | 困难 | -| 2538 | [最大价值和与最小价值和的差值](https://leetcode.cn/problems/difference-between-maximum-and-minimum-price-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2538.%20%E6%9C%80%E5%A4%A7%E4%BB%B7%E5%80%BC%E5%92%8C%E4%B8%8E%E6%9C%80%E5%B0%8F%E4%BB%B7%E5%80%BC%E5%92%8C%E7%9A%84%E5%B7%AE%E5%80%BC.md) | 树、深度优先搜索、数组、动态规划 | 困难 | -| 1569 | [将子数组重新排序得到同一个二叉搜索树的方案数](https://leetcode.cn/problems/number-of-ways-to-reorder-array-to-get-same-bst/) | | 树、并查集、二叉搜索树、记忆化搜索、数组、数学、分治、动态规划、二叉树、组合数学 | 困难 | -| 1372 | [二叉树中的最长交错路径](https://leetcode.cn/problems/longest-zigzag-path-in-a-binary-tree/) | | 树、深度优先搜索、动态规划、二叉树 | 中等 | -| 1373 | [二叉搜索子树的最大键值和](https://leetcode.cn/problems/maximum-sum-bst-in-binary-tree/) | | 树、深度优先搜索、二叉搜索树、动态规划、二叉树 | 困难 | -| 0968 | [监控二叉树](https://leetcode.cn/problems/binary-tree-cameras/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0968.%20%E7%9B%91%E6%8E%A7%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | -| 1273 | [删除树节点](https://leetcode.cn/problems/delete-tree-nodes/) | | 树、深度优先搜索、广度优先搜索 | 中等 | -| 1519 | [子树中标签相同的节点数](https://leetcode.cn/problems/number-of-nodes-in-the-sub-tree-with-the-same-label/) | | 树、深度优先搜索、广度优先搜索、哈希表、计数 | 中等 | - -#### 不定根的树形 DP 题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0310 | [最小高度树](https://leetcode.cn/problems/minimum-height-trees/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0310.%20%E6%9C%80%E5%B0%8F%E9%AB%98%E5%BA%A6%E6%A0%91.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | -| 0834 | [树中距离之和](https://leetcode.cn/problems/sum-of-distances-in-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0834.%20%E6%A0%91%E4%B8%AD%E8%B7%9D%E7%A6%BB%E4%B9%8B%E5%92%8C.md) | 树、深度优先搜索、图、动态规划 | 困难 | -| 2581 | [统计可能的树根数目](https://leetcode.cn/problems/count-number-of-possible-root-nodes/) | | 树、深度优先搜索、哈希表、动态规划 | 困难 | - -### 状态压缩 DP 题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 1879 | [两个数组最小的异或值之和](https://leetcode.cn/problems/minimum-xor-sum-of-two-arrays/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1879.%20%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E6%9C%80%E5%B0%8F%E7%9A%84%E5%BC%82%E6%88%96%E5%80%BC%E4%B9%8B%E5%92%8C.md) | 位运算、数组、动态规划、状态压缩 | 困难 | -| 2172 | [数组的最大与和](https://leetcode.cn/problems/maximum-and-sum-of-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2172.%20%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E4%B8%8E%E5%92%8C.md) | 位运算、数组、动态规划、状态压缩 | 困难 | -| 1947 | [最大兼容性评分和](https://leetcode.cn/problems/maximum-compatibility-score-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1947.%20%E6%9C%80%E5%A4%A7%E5%85%BC%E5%AE%B9%E6%80%A7%E8%AF%84%E5%88%86%E5%92%8C.md) | 位运算、数组、动态规划、回溯、状态压缩 | 中等 | -| 1595 | [连通两组点的最小成本](https://leetcode.cn/problems/minimum-cost-to-connect-two-groups-of-points/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1595.%20%E8%BF%9E%E9%80%9A%E4%B8%A4%E7%BB%84%E7%82%B9%E7%9A%84%E6%9C%80%E5%B0%8F%E6%88%90%E6%9C%AC.md) | 位运算、数组、动态规划、状态压缩、矩阵 | 困难 | -| 1494 | [并行课程 II](https://leetcode.cn/problems/parallel-courses-ii/) | | 位运算、图、动态规划、状态压缩 | 困难 | -| 1655 | [分配重复整数](https://leetcode.cn/problems/distribute-repeating-integers/) | | 位运算、数组、动态规划、回溯、状态压缩 | 困难 | -| 1986 | [完成任务的最少工作时间段](https://leetcode.cn/problems/minimum-number-of-work-sessions-to-finish-the-tasks/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1986.%20%E5%AE%8C%E6%88%90%E4%BB%BB%E5%8A%A1%E7%9A%84%E6%9C%80%E5%B0%91%E5%B7%A5%E4%BD%9C%E6%97%B6%E9%97%B4%E6%AE%B5.md) | 位运算、数组、动态规划、回溯、状态压缩 | 中等 | -| 1434 | [每个人戴不同帽子的方案数](https://leetcode.cn/problems/number-of-ways-to-wear-different-hats-to-each-other/) | | 位运算、数组、动态规划、状态压缩 | 困难 | -| 1799 | [N 次操作后的最大分数和](https://leetcode.cn/problems/maximize-score-after-n-operations/) | | 位运算、数组、数学、动态规划、回溯、状态压缩、数论 | 困难 | -| 1681 | [最小不兼容性](https://leetcode.cn/problems/minimum-incompatibility/) | | 位运算、数组、动态规划、状态压缩 | 困难 | -| 0526 | [优美的排列](https://leetcode.cn/problems/beautiful-arrangement/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0526.%20%E4%BC%98%E7%BE%8E%E7%9A%84%E6%8E%92%E5%88%97.md) | 位运算、数组、动态规划、回溯、状态压缩 | 中等 | -| 0351 | [安卓系统手势解锁](https://leetcode.cn/problems/android-unlock-patterns/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0351.%20%E5%AE%89%E5%8D%93%E7%B3%BB%E7%BB%9F%E6%89%8B%E5%8A%BF%E8%A7%A3%E9%94%81.md) | 动态规划、回溯 | 中等 | -| 0464 | [我能赢吗](https://leetcode.cn/problems/can-i-win/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0464.%20%E6%88%91%E8%83%BD%E8%B5%A2%E5%90%97.md) | 位运算、记忆化搜索、数学、动态规划、状态压缩、博弈 | 中等 | -| 0847 | [访问所有节点的最短路径](https://leetcode.cn/problems/shortest-path-visiting-all-nodes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0847.%20%E8%AE%BF%E9%97%AE%E6%89%80%E6%9C%89%E8%8A%82%E7%82%B9%E7%9A%84%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84.md) | 位运算、广度优先搜索、图、动态规划、状态压缩 | 困难 | -| 0638 | [大礼包](https://leetcode.cn/problems/shopping-offers/) | | 位运算、记忆化搜索、数组、动态规划、回溯、状态压缩 | 中等 | -| 1994 | [好子集的数目](https://leetcode.cn/problems/the-number-of-good-subsets/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1994.%20%E5%A5%BD%E5%AD%90%E9%9B%86%E7%9A%84%E6%95%B0%E7%9B%AE.md) | 位运算、数组、数学、动态规划、状态压缩 | 困难 | -| 1349 | [参加考试的最大学生数](https://leetcode.cn/problems/maximum-students-taking-exam/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1349.%20%E5%8F%82%E5%8A%A0%E8%80%83%E8%AF%95%E7%9A%84%E6%9C%80%E5%A4%A7%E5%AD%A6%E7%94%9F%E6%95%B0.md) | 位运算、数组、动态规划、状态压缩、矩阵 | 困难 | -| 0698 | [划分为k个相等的子集](https://leetcode.cn/problems/partition-to-k-equal-sum-subsets/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0698.%20%E5%88%92%E5%88%86%E4%B8%BAk%E4%B8%AA%E7%9B%B8%E7%AD%89%E7%9A%84%E5%AD%90%E9%9B%86.md) | 位运算、记忆化搜索、数组、动态规划、回溯、状态压缩 | 中等 | -| 0943 | [最短超级串](https://leetcode.cn/problems/find-the-shortest-superstring/) | | 位运算、数组、字符串、动态规划、状态压缩 | 困难 | -| 0691 | [贴纸拼词](https://leetcode.cn/problems/stickers-to-spell-word/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0691.%20%E8%B4%B4%E7%BA%B8%E6%8B%BC%E8%AF%8D.md) | 位运算、数组、字符串、动态规划、回溯、状态压缩 | 困难 | -| 0982 | [按位与为零的三元组](https://leetcode.cn/problems/triples-with-bitwise-and-equal-to-zero/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0982.%20%E6%8C%89%E4%BD%8D%E4%B8%8E%E4%B8%BA%E9%9B%B6%E7%9A%84%E4%B8%89%E5%85%83%E7%BB%84.md) | 位运算、数组、哈希表 | 困难 | - -### 计数 DP 题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0062 | [不同路径](https://leetcode.cn/problems/unique-paths/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0062.%20%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84.md) | 数学、动态规划、组合数学 | 中等 | -| 0063 | [不同路径 II](https://leetcode.cn/problems/unique-paths-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0063.%20%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84%20II.md) | 数组、动态规划、矩阵 | 中等 | -| 0343 | [整数拆分](https://leetcode.cn/problems/integer-break/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0343.%20%E6%95%B4%E6%95%B0%E6%8B%86%E5%88%86.md) | 数学、动态规划 | 中等 | -| 0096 | [不同的二叉搜索树](https://leetcode.cn/problems/unique-binary-search-trees/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0096.%20%E4%B8%8D%E5%90%8C%E7%9A%84%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md) | 树、二叉搜索树、数学、动态规划、二叉树 | 中等 | -| 1259 | [不相交的握手](https://leetcode.cn/problems/handshakes-that-dont-cross/) | | 数学、动态规划 | 困难 | -| 0790 | [多米诺和托米诺平铺](https://leetcode.cn/problems/domino-and-tromino-tiling/) | | 动态规划 | 中等 | -| 0070 | [爬楼梯](https://leetcode.cn/problems/climbing-stairs/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0070.%20%E7%88%AC%E6%A5%BC%E6%A2%AF.md) | 记忆化搜索、数学、动态规划 | 简单 | -| 0746 | [使用最小花费爬楼梯](https://leetcode.cn/problems/min-cost-climbing-stairs/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0746.%20%E4%BD%BF%E7%94%A8%E6%9C%80%E5%B0%8F%E8%8A%B1%E8%B4%B9%E7%88%AC%E6%A5%BC%E6%A2%AF.md) | 数组、动态规划 | 简单 | -| 0509 | [斐波那契数](https://leetcode.cn/problems/fibonacci-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0509.%20%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0.md) | 递归、记忆化搜索、数学、动态规划 | 简单 | -| 1137 | [第 N 个泰波那契数](https://leetcode.cn/problems/n-th-tribonacci-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1137.%20%E7%AC%AC%20N%20%E4%B8%AA%E6%B3%B0%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0.md) | 记忆化搜索、数学、动态规划 | 简单 | - -### 数位 DP 题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 2376 | [统计特殊整数](https://leetcode.cn/problems/count-special-integers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2376.%20%E7%BB%9F%E8%AE%A1%E7%89%B9%E6%AE%8A%E6%95%B4%E6%95%B0.md) | 数学、动态规划 | 困难 | -| 0357 | [统计各位数字都不同的数字个数](https://leetcode.cn/problems/count-numbers-with-unique-digits/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0357.%20%E7%BB%9F%E8%AE%A1%E5%90%84%E4%BD%8D%E6%95%B0%E5%AD%97%E9%83%BD%E4%B8%8D%E5%90%8C%E7%9A%84%E6%95%B0%E5%AD%97%E4%B8%AA%E6%95%B0.md) | 数学、动态规划、回溯 | 中等 | -| 1012 | [至少有 1 位重复的数字](https://leetcode.cn/problems/numbers-with-repeated-digits/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1012.%20%E8%87%B3%E5%B0%91%E6%9C%89%201%20%E4%BD%8D%E9%87%8D%E5%A4%8D%E7%9A%84%E6%95%B0%E5%AD%97.md) | 数学、动态规划 | 困难 | -| 0902 | [最大为 N 的数字组合](https://leetcode.cn/problems/numbers-at-most-n-given-digit-set/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0902.%20%E6%9C%80%E5%A4%A7%E4%B8%BA%20N%20%E7%9A%84%E6%95%B0%E5%AD%97%E7%BB%84%E5%90%88.md) | 数组、数学、字符串、二分查找、动态规划 | 困难 | -| 0788 | [旋转数字](https://leetcode.cn/problems/rotated-digits/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0788.%20%E6%97%8B%E8%BD%AC%E6%95%B0%E5%AD%97.md) | 数学、动态规划 | 中等 | -| 0600 | [不含连续1的非负整数](https://leetcode.cn/problems/non-negative-integers-without-consecutive-ones/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0600.%20%E4%B8%8D%E5%90%AB%E8%BF%9E%E7%BB%AD1%E7%9A%84%E9%9D%9E%E8%B4%9F%E6%95%B4%E6%95%B0.md) | 动态规划 | 困难 | -| 0233 | [数字 1 的个数](https://leetcode.cn/problems/number-of-digit-one/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0233.%20%E6%95%B0%E5%AD%97%201%20%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 递归、数学、动态规划 | 困难 | -| 2719 | [统计整数数目](https://leetcode.cn/problems/count-of-integers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2719.%20%E7%BB%9F%E8%AE%A1%E6%95%B4%E6%95%B0%E6%95%B0%E7%9B%AE.md) | 数学、字符串、动态规划 | 困难 | -| 0248 | [中心对称数 III](https://leetcode.cn/problems/strobogrammatic-number-iii/) | | 递归、数组、字符串 | 困难 | -| 1088 | [易混淆数 II](https://leetcode.cn/problems/confusing-number-ii/) | | 数学、回溯 | 困难 | -| 1067 | [范围内的数字计数](https://leetcode.cn/problems/digit-count-in-range/) | | 数学、动态规划 | 困难 | -| 1742 | [盒子中小球的最大数量](https://leetcode.cn/problems/maximum-number-of-balls-in-a-box/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1742.%20%E7%9B%92%E5%AD%90%E4%B8%AD%E5%B0%8F%E7%90%83%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E9%87%8F.md) | 哈希表、数学、计数 | 简单 | -| 面试题 17.06 | [2出现的次数](https://leetcode.cn/problems/number-of-2s-in-range-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.06.%202%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0.md) | 递归、数学、动态规划 | 困难 | - -### 概率 DP 题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0688 | [骑士在棋盘上的概率](https://leetcode.cn/problems/knight-probability-in-chessboard/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0688.%20%E9%AA%91%E5%A3%AB%E5%9C%A8%E6%A3%8B%E7%9B%98%E4%B8%8A%E7%9A%84%E6%A6%82%E7%8E%87.md) | 动态规划 | 中等 | -| 0808 | [分汤](https://leetcode.cn/problems/soup-servings/) | | 数学、动态规划、概率与统计 | 中等 | -| 0837 | [新 21 点](https://leetcode.cn/problems/new-21-game/) | | 数学、动态规划、滑动窗口、概率与统计 | 中等 | -| 1230 | [抛掷硬币](https://leetcode.cn/problems/toss-strange-coins/) | | 数学、动态规划、概率与统计 | 中等 | -| 1467 | [两个盒子中球的颜色数相同的概率](https://leetcode.cn/problems/probability-of-a-two-boxes-having-the-same-number-of-distinct-balls/) | | 数组、数学、动态规划、回溯、组合数学、概率与统计 | 困难 | -| 1227 | [飞机座位分配概率](https://leetcode.cn/problems/airplane-seat-assignment-probability/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1227.%20%E9%A3%9E%E6%9C%BA%E5%BA%A7%E4%BD%8D%E5%88%86%E9%85%8D%E6%A6%82%E7%8E%87.md) | 脑筋急转弯、数学、动态规划、概率与统计 | 中等 | -| 1377 | [T 秒后青蛙的位置](https://leetcode.cn/problems/frog-position-after-t-seconds/) | | 树、深度优先搜索、广度优先搜索、图 | 困难 | -| 剑指 Offer 60 | [n个骰子的点数](https://leetcode.cn/problems/nge-tou-zi-de-dian-shu-lcof/) | | 数学、动态规划、概率与统计 | 中等 | - -### 动态规划优化题目 - diff --git a/Contents/00.Introduction/06.Interview-100-List.md b/Contents/00.Introduction/06.Interview-100-List.md deleted file mode 100644 index df1c1d8b..00000000 --- a/Contents/00.Introduction/06.Interview-100-List.md +++ /dev/null @@ -1,382 +0,0 @@ -# LeetCode 面试最常考 100 题（按分类排序） - -## 01. 数组 - -### 数组基础题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0054 | [螺旋矩阵](https://leetcode.cn/problems/spiral-matrix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0054.%20%E8%9E%BA%E6%97%8B%E7%9F%A9%E9%98%B5.md) | 数组、矩阵、模拟 | 中等 | -| 0048 | [旋转图像](https://leetcode.cn/problems/rotate-image/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0048.%20%E6%97%8B%E8%BD%AC%E5%9B%BE%E5%83%8F.md) | 数组、数学、矩阵 | 中等 | - -### 排序算法题目 - -#### 选择排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0215 | [数组中的第K个最大元素](https://leetcode.cn/problems/kth-largest-element-in-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0215.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E7%AC%ACK%E4%B8%AA%E6%9C%80%E5%A4%A7%E5%85%83%E7%B4%A0.md) | 数组、分治、快速选择、排序、堆（优先队列） | 中等 | - -#### 希尔排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0912 | [排序数组](https://leetcode.cn/problems/sort-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0912.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | - -#### 归并排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0912 | [排序数组](https://leetcode.cn/problems/sort-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0912.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | -| 0088 | [合并两个有序数组](https://leetcode.cn/problems/merge-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0088.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、双指针、排序 | 简单 | - -#### 快速排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0912 | [排序数组](https://leetcode.cn/problems/sort-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0912.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | -| 0169 | [多数元素](https://leetcode.cn/problems/majority-element/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0169.%20%E5%A4%9A%E6%95%B0%E5%85%83%E7%B4%A0.md) | 数组、哈希表、分治、计数、排序 | 简单 | - -#### 堆排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0912 | [排序数组](https://leetcode.cn/problems/sort-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0912.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | -| 0215 | [数组中的第K个最大元素](https://leetcode.cn/problems/kth-largest-element-in-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0215.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E7%AC%ACK%E4%B8%AA%E6%9C%80%E5%A4%A7%E5%85%83%E7%B4%A0.md) | 数组、分治、快速选择、排序、堆（优先队列） | 中等 | - -#### 计数排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0912 | [排序数组](https://leetcode.cn/problems/sort-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0912.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | - -#### 桶排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0912 | [排序数组](https://leetcode.cn/problems/sort-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0912.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | - -#### 其他排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0136 | [只出现一次的数字](https://leetcode.cn/problems/single-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0136.%20%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B0%E5%AD%97.md) | 位运算、数组 | 简单 | -| 0056 | [合并区间](https://leetcode.cn/problems/merge-intervals/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0056.%20%E5%90%88%E5%B9%B6%E5%8C%BA%E9%97%B4.md) | 数组、排序 | 中等 | -| 0179 | [最大数](https://leetcode.cn/problems/largest-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0179.%20%E6%9C%80%E5%A4%A7%E6%95%B0.md) | 贪心、数组、字符串、排序 | 中等 | - -### 二分查找题目 - -#### 二分下标题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0704 | [二分查找](https://leetcode.cn/problems/binary-search/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0704.%20%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE.md) | 数组、二分查找 | 简单 | -| 0034 | [在排序数组中查找元素的第一个和最后一个位置](https://leetcode.cn/problems/find-first-and-last-position-of-element-in-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0034.%20%E5%9C%A8%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9F%A5%E6%89%BE%E5%85%83%E7%B4%A0%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%92%8C%E6%9C%80%E5%90%8E%E4%B8%80%E4%B8%AA%E4%BD%8D%E7%BD%AE.md) | 数组、二分查找 | 中等 | -| 0153 | [寻找旋转排序数组中的最小值](https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0153.%20%E5%AF%BB%E6%89%BE%E6%97%8B%E8%BD%AC%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9C%80%E5%B0%8F%E5%80%BC.md) | 数组、二分查找 | 中等 | -| 0033 | [搜索旋转排序数组](https://leetcode.cn/problems/search-in-rotated-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0033.%20%E6%90%9C%E7%B4%A2%E6%97%8B%E8%BD%AC%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、二分查找 | 中等 | -| 0162 | [寻找峰值](https://leetcode.cn/problems/find-peak-element/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0162.%20%E5%AF%BB%E6%89%BE%E5%B3%B0%E5%80%BC.md) | 数组、二分查找 | 中等 | -| 0004 | [寻找两个正序数组的中位数](https://leetcode.cn/problems/median-of-two-sorted-arrays/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0004.%20%E5%AF%BB%E6%89%BE%E4%B8%A4%E4%B8%AA%E6%AD%A3%E5%BA%8F%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0.md) | 数组、二分查找、分治 | 困难 | -| 0240 | [搜索二维矩阵 II](https://leetcode.cn/problems/search-a-2d-matrix-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0240.%20%E6%90%9C%E7%B4%A2%E4%BA%8C%E7%BB%B4%E7%9F%A9%E9%98%B5%20II.md) | 数组、二分查找、分治、矩阵 | 中等 | - -#### 二分答案题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0069 | [x 的平方根](https://leetcode.cn/problems/sqrtx/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0069.%20x%20%E7%9A%84%E5%B9%B3%E6%96%B9%E6%A0%B9.md) | 数学、二分查找 | 简单 | - -### 双指针题目 - -#### 对撞指针题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0015 | [三数之和](https://leetcode.cn/problems/3sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0015.%20%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、双指针、排序 | 中等 | - -#### 快慢指针题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0283 | [移动零](https://leetcode.cn/problems/move-zeroes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0283.%20%E7%A7%BB%E5%8A%A8%E9%9B%B6.md) | 数组、双指针 | 简单 | -| 0088 | [合并两个有序数组](https://leetcode.cn/problems/merge-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0088.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、双指针、排序 | 简单 | - -#### 分离双指针题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0415 | [字符串相加](https://leetcode.cn/problems/add-strings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0415.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E5%8A%A0.md) | 数学、字符串、模拟 | 简单 | - -### 滑动窗口题目 - -#### 固定长度窗口题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0239 | [滑动窗口最大值](https://leetcode.cn/problems/sliding-window-maximum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0239.%20%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E6%9C%80%E5%A4%A7%E5%80%BC.md) | 队列、数组、滑动窗口、单调队列、堆（优先队列） | 困难 | - -#### 不定长度窗口题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0003 | [无重复字符的最长子串](https://leetcode.cn/problems/longest-substring-without-repeating-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0003.%20%E6%97%A0%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2.md) | 哈希表、字符串、滑动窗口 | 中等 | -| 0076 | [最小覆盖子串](https://leetcode.cn/problems/minimum-window-substring/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0076.%20%E6%9C%80%E5%B0%8F%E8%A6%86%E7%9B%96%E5%AD%90%E4%B8%B2.md) | 哈希表、字符串、滑动窗口 | 困难 | -| 0718 | [最长重复子数组](https://leetcode.cn/problems/maximum-length-of-repeated-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0718.%20%E6%9C%80%E9%95%BF%E9%87%8D%E5%A4%8D%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、二分查找、动态规划、滑动窗口、哈希函数、滚动哈希 | 中等 | - -## 02. 链表 - -### 链表经典题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0083 | [删除排序链表中的重复元素](https://leetcode.cn/problems/remove-duplicates-from-sorted-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0083.%20%E5%88%A0%E9%99%A4%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0.md) | 链表 | 简单 | -| 0082 | [删除排序链表中的重复元素 II](https://leetcode.cn/problems/remove-duplicates-from-sorted-list-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0082.%20%E5%88%A0%E9%99%A4%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0%20II.md) | 链表、双指针 | 中等 | -| 0206 | [反转链表](https://leetcode.cn/problems/reverse-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0206.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8.md) | 递归、链表 | 简单 | -| 0092 | [反转链表 II](https://leetcode.cn/problems/reverse-linked-list-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0092.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8%20II.md) | 链表 | 中等 | -| 0025 | [K 个一组翻转链表](https://leetcode.cn/problems/reverse-nodes-in-k-group/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0025.%20K%20%E4%B8%AA%E4%B8%80%E7%BB%84%E7%BF%BB%E8%BD%AC%E9%93%BE%E8%A1%A8.md) | 递归、链表 | 困难 | -| 0234 | [回文链表](https://leetcode.cn/problems/palindrome-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0234.%20%E5%9B%9E%E6%96%87%E9%93%BE%E8%A1%A8.md) | 栈、递归、链表、双指针 | 简单 | - -### 链表排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0148 | [排序链表](https://leetcode.cn/problems/sort-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0148.%20%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8.md) | 链表、双指针、分治、排序、归并排序 | 中等 | -| 0021 | [合并两个有序链表](https://leetcode.cn/problems/merge-two-sorted-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0021.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E9%93%BE%E8%A1%A8.md) | 递归、链表 | 简单 | -| 0023 | [合并 K 个升序链表](https://leetcode.cn/problems/merge-k-sorted-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0023.%20%E5%90%88%E5%B9%B6%20K%20%E4%B8%AA%E5%8D%87%E5%BA%8F%E9%93%BE%E8%A1%A8.md) | 链表、分治、堆（优先队列）、归并排序 | 困难 | - -### 链表双指针题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0141 | [环形链表](https://leetcode.cn/problems/linked-list-cycle/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0141.%20%E7%8E%AF%E5%BD%A2%E9%93%BE%E8%A1%A8.md) | 哈希表、链表、双指针 | 简单 | -| 0142 | [环形链表 II](https://leetcode.cn/problems/linked-list-cycle-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0142.%20%E7%8E%AF%E5%BD%A2%E9%93%BE%E8%A1%A8%20II.md) | 哈希表、链表、双指针 | 中等 | -| 0160 | [相交链表](https://leetcode.cn/problems/intersection-of-two-linked-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0160.%20%E7%9B%B8%E4%BA%A4%E9%93%BE%E8%A1%A8.md) | 哈希表、链表、双指针 | 简单 | -| 0019 | [删除链表的倒数第 N 个结点](https://leetcode.cn/problems/remove-nth-node-from-end-of-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0019.%20%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E7%9A%84%E5%80%92%E6%95%B0%E7%AC%AC%20N%20%E4%B8%AA%E7%BB%93%E7%82%B9.md) | 链表、双指针 | 中等 | -| 剑指 Offer 22 | [链表中倒数第k个节点](https://leetcode.cn/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2022.%20%E9%93%BE%E8%A1%A8%E4%B8%AD%E5%80%92%E6%95%B0%E7%AC%ACk%E4%B8%AA%E8%8A%82%E7%82%B9.md) | 链表、双指针 | 简单 | -| 0143 | [重排链表](https://leetcode.cn/problems/reorder-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0143.%20%E9%87%8D%E6%8E%92%E9%93%BE%E8%A1%A8.md) | 栈、递归、链表、双指针 | 中等 | -| 0002 | [两数相加](https://leetcode.cn/problems/add-two-numbers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0002.%20%E4%B8%A4%E6%95%B0%E7%9B%B8%E5%8A%A0.md) | 递归、链表、数学 | 中等 | - -## 03. 堆栈 - -### 堆栈基础题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0155 | [最小栈](https://leetcode.cn/problems/min-stack/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0155.%20%E6%9C%80%E5%B0%8F%E6%A0%88.md) | 栈、设计 | 中等 | -| 0020 | [有效的括号](https://leetcode.cn/problems/valid-parentheses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0020.%20%E6%9C%89%E6%95%88%E7%9A%84%E6%8B%AC%E5%8F%B7.md) | 栈、字符串 | 简单 | -| 0227 | [基本计算器 II](https://leetcode.cn/problems/basic-calculator-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0227.%20%E5%9F%BA%E6%9C%AC%E8%AE%A1%E7%AE%97%E5%99%A8%20II.md) | 栈、数学、字符串 | 中等 | -| 0232 | [用栈实现队列](https://leetcode.cn/problems/implement-queue-using-stacks/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0232.%20%E7%94%A8%E6%A0%88%E5%AE%9E%E7%8E%B0%E9%98%9F%E5%88%97.md) | 栈、设计、队列 | 简单 | -| 0394 | [字符串解码](https://leetcode.cn/problems/decode-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0394.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%A7%A3%E7%A0%81.md) | 栈、递归、字符串 | 中等 | -| 0032 | [最长有效括号](https://leetcode.cn/problems/longest-valid-parentheses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0032.%20%E6%9C%80%E9%95%BF%E6%9C%89%E6%95%88%E6%8B%AC%E5%8F%B7.md) | 栈、字符串、动态规划 | 困难 | - -### 单调栈 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0042 | [接雨水](https://leetcode.cn/problems/trapping-rain-water/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0042.%20%E6%8E%A5%E9%9B%A8%E6%B0%B4.md) | 栈、数组、双指针、动态规划、单调栈 | 困难 | - -## 04. 队列 - -### 队列基础题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0225 | [用队列实现栈](https://leetcode.cn/problems/implement-stack-using-queues/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0225.%20%E7%94%A8%E9%98%9F%E5%88%97%E5%AE%9E%E7%8E%B0%E6%A0%88.md) | 栈、设计、队列 | 简单 | - -### 优先队列题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0023 | [合并 K 个升序链表](https://leetcode.cn/problems/merge-k-sorted-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0023.%20%E5%90%88%E5%B9%B6%20K%20%E4%B8%AA%E5%8D%87%E5%BA%8F%E9%93%BE%E8%A1%A8.md) | 链表、分治、堆（优先队列）、归并排序 | 困难 | -| 0239 | [滑动窗口最大值](https://leetcode.cn/problems/sliding-window-maximum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0239.%20%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E6%9C%80%E5%A4%A7%E5%80%BC.md) | 队列、数组、滑动窗口、单调队列、堆（优先队列） | 困难 | - -## 05. 哈希表 - -### 哈希表题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0001 | [两数之和](https://leetcode.cn/problems/two-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0001.%20%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、哈希表 | 简单 | -| 0015 | [三数之和](https://leetcode.cn/problems/3sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0015.%20%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、双指针、排序 | 中等 | -| 0041 | [缺失的第一个正数](https://leetcode.cn/problems/first-missing-positive/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0041.%20%E7%BC%BA%E5%A4%B1%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E6%AD%A3%E6%95%B0.md) | 数组、哈希表 | 困难 | -| 0128 | [最长连续序列](https://leetcode.cn/problems/longest-consecutive-sequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0128.%20%E6%9C%80%E9%95%BF%E8%BF%9E%E7%BB%AD%E5%BA%8F%E5%88%97.md) | 并查集、数组、哈希表 | 中等 | -| 0136 | [只出现一次的数字](https://leetcode.cn/problems/single-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0136.%20%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B0%E5%AD%97.md) | 位运算、数组 | 简单 | - -## 06. 字符串 - -### 字符串基础题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0003 | [无重复字符的最长子串](https://leetcode.cn/problems/longest-substring-without-repeating-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0003.%20%E6%97%A0%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2.md) | 哈希表、字符串、滑动窗口 | 中等 | -| 0005 | [最长回文子串](https://leetcode.cn/problems/longest-palindromic-substring/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0005.%20%E6%9C%80%E9%95%BF%E5%9B%9E%E6%96%87%E5%AD%90%E4%B8%B2.md) | 字符串、动态规划 | 中等 | -| 0415 | [字符串相加](https://leetcode.cn/problems/add-strings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0415.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E5%8A%A0.md) | 数学、字符串、模拟 | 简单 | -| 0151 | [反转字符串中的单词](https://leetcode.cn/problems/reverse-words-in-a-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0151.%20%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%8D%95%E8%AF%8D.md) | 双指针、字符串 | 中等 | -| 0043 | [字符串相乘](https://leetcode.cn/problems/multiply-strings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0043.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E4%B9%98.md) | 数学、字符串、模拟 | 中等 | -| 0014 | [最长公共前缀](https://leetcode.cn/problems/longest-common-prefix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0014.%20%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%89%8D%E7%BC%80.md) | 字典树、字符串 | 简单 | - -## 07. 树 - -### 二叉树的遍历题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0144 | [二叉树的前序遍历](https://leetcode.cn/problems/binary-tree-preorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0144.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%89%8D%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索、二叉树 | 简单 | -| 0094 | [二叉树的中序遍历](https://leetcode.cn/problems/binary-tree-inorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0094.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E4%B8%AD%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索、二叉树 | 简单 | -| 0102 | [二叉树的层序遍历](https://leetcode.cn/problems/binary-tree-level-order-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0102.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%B1%82%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 树、广度优先搜索、二叉树 | 中等 | -| 0103 | [二叉树的锯齿形层序遍历](https://leetcode.cn/problems/binary-tree-zigzag-level-order-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0103.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%94%AF%E9%BD%BF%E5%BD%A2%E5%B1%82%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 树、广度优先搜索、二叉树 | 中等 | -| 0236 | [二叉树的最近公共祖先](https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0236.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88.md) | 树、深度优先搜索、二叉树 | 中等 | -| 0104 | [二叉树的最大深度](https://leetcode.cn/problems/maximum-depth-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0104.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%A4%A7%E6%B7%B1%E5%BA%A6.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0112 | [路径总和](https://leetcode.cn/problems/path-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0112.%20%E8%B7%AF%E5%BE%84%E6%80%BB%E5%92%8C.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0113 | [路径总和 II](https://leetcode.cn/problems/path-sum-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0113.%20%E8%B7%AF%E5%BE%84%E6%80%BB%E5%92%8C%20II.md) | 树、深度优先搜索、回溯、二叉树 | 中等 | -| 0101 | [对称二叉树](https://leetcode.cn/problems/symmetric-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0101.%20%E5%AF%B9%E7%A7%B0%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0124 | [二叉树中的最大路径和](https://leetcode.cn/problems/binary-tree-maximum-path-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0124.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E8%B7%AF%E5%BE%84%E5%92%8C.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | -| 0199 | [二叉树的右视图](https://leetcode.cn/problems/binary-tree-right-side-view/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0199.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%8F%B3%E8%A7%86%E5%9B%BE.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | -| 0226 | [翻转二叉树](https://leetcode.cn/problems/invert-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0226.%20%E7%BF%BB%E8%BD%AC%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | - -### 二叉树的还原题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0105 | [从前序与中序遍历序列构造二叉树](https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0105.%20%E4%BB%8E%E5%89%8D%E5%BA%8F%E4%B8%8E%E4%B8%AD%E5%BA%8F%E9%81%8D%E5%8E%86%E5%BA%8F%E5%88%97%E6%9E%84%E9%80%A0%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、数组、哈希表、分治、二叉树 | 中等 | - -### 二叉搜索树题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0098 | [验证二叉搜索树](https://leetcode.cn/problems/validate-binary-search-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0098.%20%E9%AA%8C%E8%AF%81%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | -| 0110 | [平衡二叉树](https://leetcode.cn/problems/balanced-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0110.%20%E5%B9%B3%E8%A1%A1%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、二叉树 | 简单 | - -### 并查集题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0128 | [最长连续序列](https://leetcode.cn/problems/longest-consecutive-sequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0128.%20%E6%9C%80%E9%95%BF%E8%BF%9E%E7%BB%AD%E5%BA%8F%E5%88%97.md) | 并查集、数组、哈希表 | 中等 | - -## 08. 图论 - -### 图的深度优先搜索题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0200 | [岛屿数量](https://leetcode.cn/problems/number-of-islands/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0200.%20%E5%B2%9B%E5%B1%BF%E6%95%B0%E9%87%8F.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | -| 0695 | [岛屿的最大面积](https://leetcode.cn/problems/max-area-of-island/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0695.%20%E5%B2%9B%E5%B1%BF%E7%9A%84%E6%9C%80%E5%A4%A7%E9%9D%A2%E7%A7%AF.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | -| 0144 | [二叉树的前序遍历](https://leetcode.cn/problems/binary-tree-preorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0144.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%89%8D%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索、二叉树 | 简单 | -| 0094 | [二叉树的中序遍历](https://leetcode.cn/problems/binary-tree-inorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0094.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E4%B8%AD%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索、二叉树 | 简单 | -| 0129 | [求根节点到叶节点数字之和](https://leetcode.cn/problems/sum-root-to-leaf-numbers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0129.%20%E6%B1%82%E6%A0%B9%E8%8A%82%E7%82%B9%E5%88%B0%E5%8F%B6%E8%8A%82%E7%82%B9%E6%95%B0%E5%AD%97%E4%B9%8B%E5%92%8C.md) | 树、深度优先搜索、二叉树 | 中等 | -| 0124 | [二叉树中的最大路径和](https://leetcode.cn/problems/binary-tree-maximum-path-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0124.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E8%B7%AF%E5%BE%84%E5%92%8C.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | -| 0199 | [二叉树的右视图](https://leetcode.cn/problems/binary-tree-right-side-view/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0199.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%8F%B3%E8%A7%86%E5%9B%BE.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | -| 0543 | [二叉树的直径](https://leetcode.cn/problems/diameter-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0543.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E7%9B%B4%E5%BE%84.md) | 树、深度优先搜索、二叉树 | 简单 | -| 0662 | [二叉树最大宽度](https://leetcode.cn/problems/maximum-width-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0662.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E6%9C%80%E5%A4%A7%E5%AE%BD%E5%BA%A6.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | - -### 图的广度优先搜索题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0200 | [岛屿数量](https://leetcode.cn/problems/number-of-islands/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0200.%20%E5%B2%9B%E5%B1%BF%E6%95%B0%E9%87%8F.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | -| 0322 | [零钱兑换](https://leetcode.cn/problems/coin-change/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0322.%20%E9%9B%B6%E9%92%B1%E5%85%91%E6%8D%A2.md) | 广度优先搜索、数组、动态规划 | 中等 | -| 0199 | [二叉树的右视图](https://leetcode.cn/problems/binary-tree-right-side-view/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0199.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%8F%B3%E8%A7%86%E5%9B%BE.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | -| 0662 | [二叉树最大宽度](https://leetcode.cn/problems/maximum-width-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0662.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E6%9C%80%E5%A4%A7%E5%AE%BD%E5%BA%A6.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | - -## 09. 基础算法 - -### 枚举算法题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0001 | [两数之和](https://leetcode.cn/problems/two-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0001.%20%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、哈希表 | 简单 | -| 0078 | [子集](https://leetcode.cn/problems/subsets/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0078.%20%E5%AD%90%E9%9B%86.md) | 位运算、数组、回溯 | 中等 | -| 0221 | [最大正方形](https://leetcode.cn/problems/maximal-square/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0221.%20%E6%9C%80%E5%A4%A7%E6%AD%A3%E6%96%B9%E5%BD%A2.md) | 数组、动态规划、矩阵 | 中等 | - -### 递归算法题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0024 | [两两交换链表中的节点](https://leetcode.cn/problems/swap-nodes-in-pairs/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0024.%20%E4%B8%A4%E4%B8%A4%E4%BA%A4%E6%8D%A2%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E8%8A%82%E7%82%B9.md) | 递归、链表 | 中等 | -| 0206 | [反转链表](https://leetcode.cn/problems/reverse-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0206.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8.md) | 递归、链表 | 简单 | -| 0092 | [反转链表 II](https://leetcode.cn/problems/reverse-linked-list-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0092.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8%20II.md) | 链表 | 中等 | -| 0021 | [合并两个有序链表](https://leetcode.cn/problems/merge-two-sorted-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0021.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E9%93%BE%E8%A1%A8.md) | 递归、链表 | 简单 | -| 0070 | [爬楼梯](https://leetcode.cn/problems/climbing-stairs/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0070.%20%E7%88%AC%E6%A5%BC%E6%A2%AF.md) | 记忆化搜索、数学、动态规划 | 简单 | -| 0104 | [二叉树的最大深度](https://leetcode.cn/problems/maximum-depth-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0104.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%A4%A7%E6%B7%B1%E5%BA%A6.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0124 | [二叉树中的最大路径和](https://leetcode.cn/problems/binary-tree-maximum-path-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0124.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E8%B7%AF%E5%BE%84%E5%92%8C.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | -| 0226 | [翻转二叉树](https://leetcode.cn/problems/invert-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0226.%20%E7%BF%BB%E8%BD%AC%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | - -### 分治算法题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0053 | [最大子数组和](https://leetcode.cn/problems/maximum-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0053.%20%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84%E5%92%8C.md) | 数组、分治、动态规划 | 中等 | -| 0023 | [合并 K 个升序链表](https://leetcode.cn/problems/merge-k-sorted-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0023.%20%E5%90%88%E5%B9%B6%20K%20%E4%B8%AA%E5%8D%87%E5%BA%8F%E9%93%BE%E8%A1%A8.md) | 链表、分治、堆（优先队列）、归并排序 | 困难 | -| 0004 | [寻找两个正序数组的中位数](https://leetcode.cn/problems/median-of-two-sorted-arrays/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0004.%20%E5%AF%BB%E6%89%BE%E4%B8%A4%E4%B8%AA%E6%AD%A3%E5%BA%8F%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0.md) | 数组、二分查找、分治 | 困难 | -| 0169 | [多数元素](https://leetcode.cn/problems/majority-element/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0169.%20%E5%A4%9A%E6%95%B0%E5%85%83%E7%B4%A0.md) | 数组、哈希表、分治、计数、排序 | 简单 | -| 0014 | [最长公共前缀](https://leetcode.cn/problems/longest-common-prefix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0014.%20%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%89%8D%E7%BC%80.md) | 字典树、字符串 | 简单 | - -### 回溯算法题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0046 | [全排列](https://leetcode.cn/problems/permutations/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0046.%20%E5%85%A8%E6%8E%92%E5%88%97.md) | 数组、回溯 | 中等 | -| 0022 | [括号生成](https://leetcode.cn/problems/generate-parentheses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0022.%20%E6%8B%AC%E5%8F%B7%E7%94%9F%E6%88%90.md) | 字符串、动态规划、回溯 | 中等 | -| 0078 | [子集](https://leetcode.cn/problems/subsets/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0078.%20%E5%AD%90%E9%9B%86.md) | 位运算、数组、回溯 | 中等 | -| 0039 | [组合总和](https://leetcode.cn/problems/combination-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0039.%20%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8C.md) | 数组、回溯 | 中等 | -| 0093 | [复原 IP 地址](https://leetcode.cn/problems/restore-ip-addresses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0093.%20%E5%A4%8D%E5%8E%9F%20IP%20%E5%9C%B0%E5%9D%80.md) | 字符串、回溯 | 中等 | - -### 贪心算法题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0053 | [最大子数组和](https://leetcode.cn/problems/maximum-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0053.%20%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84%E5%92%8C.md) | 数组、分治、动态规划 | 中等 | -| 0056 | [合并区间](https://leetcode.cn/problems/merge-intervals/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0056.%20%E5%90%88%E5%B9%B6%E5%8C%BA%E9%97%B4.md) | 数组、排序 | 中等 | -| 0122 | [买卖股票的最佳时机 II](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0122.%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA%20II.md) | 贪心、数组 | 中等 | - -### 位运算题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0136 | [只出现一次的数字](https://leetcode.cn/problems/single-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0136.%20%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B0%E5%AD%97.md) | 位运算、数组 | 简单 | - -## 10. 动态规划 - -### 动态规划题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0070 | [爬楼梯](https://leetcode.cn/problems/climbing-stairs/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0070.%20%E7%88%AC%E6%A5%BC%E6%A2%AF.md) | 记忆化搜索、数学、动态规划 | 简单 | -| 0121 | [买卖股票的最佳时机](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0121.%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA.md) | 数组、动态规划 | 简单 | -| 0322 | [零钱兑换](https://leetcode.cn/problems/coin-change/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0322.%20%E9%9B%B6%E9%92%B1%E5%85%91%E6%8D%A2.md) | 广度优先搜索、数组、动态规划 | 中等 | -| 0300 | [最长递增子序列](https://leetcode.cn/problems/longest-increasing-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0300.%20%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E5%AD%90%E5%BA%8F%E5%88%97.md) | 数组、二分查找、动态规划 | 中等 | -| 1143 | [最长公共子序列](https://leetcode.cn/problems/longest-common-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1143.%20%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%AD%90%E5%BA%8F%E5%88%97.md) | 字符串、动态规划 | 中等 | -| 0718 | [最长重复子数组](https://leetcode.cn/problems/maximum-length-of-repeated-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0718.%20%E6%9C%80%E9%95%BF%E9%87%8D%E5%A4%8D%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、二分查找、动态规划、滑动窗口、哈希函数、滚动哈希 | 中等 | -| 0064 | [最小路径和](https://leetcode.cn/problems/minimum-path-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0064.%20%E6%9C%80%E5%B0%8F%E8%B7%AF%E5%BE%84%E5%92%8C.md) | 数组、动态规划、矩阵 | 中等 | -| 0072 | [编辑距离](https://leetcode.cn/problems/edit-distance/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0072.%20%E7%BC%96%E8%BE%91%E8%B7%9D%E7%A6%BB.md) | 字符串、动态规划 | 困难 | -| 0032 | [最长有效括号](https://leetcode.cn/problems/longest-valid-parentheses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0032.%20%E6%9C%80%E9%95%BF%E6%9C%89%E6%95%88%E6%8B%AC%E5%8F%B7.md) | 栈、字符串、动态规划 | 困难 | -| 0221 | [最大正方形](https://leetcode.cn/problems/maximal-square/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0221.%20%E6%9C%80%E5%A4%A7%E6%AD%A3%E6%96%B9%E5%BD%A2.md) | 数组、动态规划、矩阵 | 中等 | -| 0062 | [不同路径](https://leetcode.cn/problems/unique-paths/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0062.%20%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84.md) | 数学、动态规划、组合数学 | 中等 | -| 0152 | [乘积最大子数组](https://leetcode.cn/problems/maximum-product-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0152.%20%E4%B9%98%E7%A7%AF%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、动态规划 | 中等 | -| 0198 | [打家劫舍](https://leetcode.cn/problems/house-robber/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0198.%20%E6%89%93%E5%AE%B6%E5%8A%AB%E8%88%8D.md) | 数组、动态规划 | 中等 | - -## 11. 补充题目 - -#### 设计数据结构题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0146 | [LRU 缓存](https://leetcode.cn/problems/lru-cache/) | | 设计、哈希表、链表、双向链表 | 中等 | - -#### 模拟题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0008 | [字符串转换整数 (atoi)](https://leetcode.cn/problems/string-to-integer-atoi/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0008.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%BD%AC%E6%8D%A2%E6%95%B4%E6%95%B0%20%28atoi%29.md) | 字符串 | 中等 | -| 0165 | [比较版本号](https://leetcode.cn/problems/compare-version-numbers/) | | 双指针、字符串 | 中等 | -| 0468 | [验证IP地址](https://leetcode.cn/problems/validate-ip-address/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0468.%20%E9%AA%8C%E8%AF%81IP%E5%9C%B0%E5%9D%80.md) | 字符串 | 中等 | - -#### 思维锻炼题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0031 | [下一个排列](https://leetcode.cn/problems/next-permutation/) | | 数组、双指针 | 中等 | -| 0470 | [用 Rand7() 实现 Rand10()](https://leetcode.cn/problems/implement-rand10-using-rand7/) | | 数学、拒绝采样、概率与统计、随机化 | 中等 | - - -## 参考资料 - -- 【清单】[CodeTop 企业题库](https://codetop.cc/home) diff --git a/Contents/00.Introduction/07.Interview-200-List.md b/Contents/00.Introduction/07.Interview-200-List.md deleted file mode 100644 index 1a597a0b..00000000 --- a/Contents/00.Introduction/07.Interview-200-List.md +++ /dev/null @@ -1,551 +0,0 @@ -# LeetCode 面试最常考 200 题（按分类排序） - -## 01. 数组 - -### 数组基础题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0189 | [轮转数组](https://leetcode.cn/problems/rotate-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0189.%20%E8%BD%AE%E8%BD%AC%E6%95%B0%E7%BB%84.md) | 数组、数学、双指针 | 中等 | -| 0498 | [对角线遍历](https://leetcode.cn/problems/diagonal-traverse/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0498.%20%E5%AF%B9%E8%A7%92%E7%BA%BF%E9%81%8D%E5%8E%86.md) | 数组、矩阵、模拟 | 中等 | -| 0048 | [旋转图像](https://leetcode.cn/problems/rotate-image/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0048.%20%E6%97%8B%E8%BD%AC%E5%9B%BE%E5%83%8F.md) | 数组、数学、矩阵 | 中等 | -| 0054 | [螺旋矩阵](https://leetcode.cn/problems/spiral-matrix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0054.%20%E8%9E%BA%E6%97%8B%E7%9F%A9%E9%98%B5.md) | 数组、矩阵、模拟 | 中等 | -| 0059 | [螺旋矩阵 II](https://leetcode.cn/problems/spiral-matrix-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0059.%20%E8%9E%BA%E6%97%8B%E7%9F%A9%E9%98%B5%20II.md) | 数组、矩阵、模拟 | 中等 | - -### 排序算法题目 - -#### 冒泡排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0283 | [移动零](https://leetcode.cn/problems/move-zeroes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0283.%20%E7%A7%BB%E5%8A%A8%E9%9B%B6.md) | 数组、双指针 | 简单 | - -#### 选择排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0215 | [数组中的第K个最大元素](https://leetcode.cn/problems/kth-largest-element-in-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0215.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E7%AC%ACK%E4%B8%AA%E6%9C%80%E5%A4%A7%E5%85%83%E7%B4%A0.md) | 数组、分治、快速选择、排序、堆（优先队列） | 中等 | - -#### 插入排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0075 | [颜色分类](https://leetcode.cn/problems/sort-colors/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0075.%20%E9%A2%9C%E8%89%B2%E5%88%86%E7%B1%BB.md) | 数组、双指针、排序 | 中等 | - -#### 希尔排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0912 | [排序数组](https://leetcode.cn/problems/sort-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0912.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | - -#### 归并排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0912 | [排序数组](https://leetcode.cn/problems/sort-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0912.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | -| 0088 | [合并两个有序数组](https://leetcode.cn/problems/merge-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0088.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、双指针、排序 | 简单 | -| 剑指 Offer 51 | [数组中的逆序对](https://leetcode.cn/problems/shu-zu-zhong-de-ni-xu-dui-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2051.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%80%86%E5%BA%8F%E5%AF%B9.md) | 树状数组、线段树、数组、二分查找、分治、有序集合、归并排序 | 困难 | - -#### 快速排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0912 | [排序数组](https://leetcode.cn/problems/sort-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0912.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | -| 0169 | [多数元素](https://leetcode.cn/problems/majority-element/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0169.%20%E5%A4%9A%E6%95%B0%E5%85%83%E7%B4%A0.md) | 数组、哈希表、分治、计数、排序 | 简单 | - -#### 堆排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0912 | [排序数组](https://leetcode.cn/problems/sort-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0912.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | -| 0215 | [数组中的第K个最大元素](https://leetcode.cn/problems/kth-largest-element-in-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0215.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E7%AC%ACK%E4%B8%AA%E6%9C%80%E5%A4%A7%E5%85%83%E7%B4%A0.md) | 数组、分治、快速选择、排序、堆（优先队列） | 中等 | -| 剑指 Offer 40 | [最小的k个数](https://leetcode.cn/problems/zui-xiao-de-kge-shu-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2040.%20%E6%9C%80%E5%B0%8F%E7%9A%84k%E4%B8%AA%E6%95%B0.md) | 数组、分治、快速选择、排序、堆（优先队列） | 简单 | - -#### 计数排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0912 | [排序数组](https://leetcode.cn/problems/sort-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0912.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | - -#### 桶排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0912 | [排序数组](https://leetcode.cn/problems/sort-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0912.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | - -#### 基数排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0164 | [最大间距](https://leetcode.cn/problems/maximum-gap/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0164.%20%E6%9C%80%E5%A4%A7%E9%97%B4%E8%B7%9D.md) | 数组、桶排序、基数排序、排序 | 困难 | - -#### 其他排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0136 | [只出现一次的数字](https://leetcode.cn/problems/single-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0136.%20%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B0%E5%AD%97.md) | 位运算、数组 | 简单 | -| 0056 | [合并区间](https://leetcode.cn/problems/merge-intervals/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0056.%20%E5%90%88%E5%B9%B6%E5%8C%BA%E9%97%B4.md) | 数组、排序 | 中等 | -| 0179 | [最大数](https://leetcode.cn/problems/largest-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0179.%20%E6%9C%80%E5%A4%A7%E6%95%B0.md) | 贪心、数组、字符串、排序 | 中等 | -| 0384 | [打乱数组](https://leetcode.cn/problems/shuffle-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0384.%20%E6%89%93%E4%B9%B1%E6%95%B0%E7%BB%84.md) | 数组、数学、随机化 | 中等 | -| 剑指 Offer 45 | [把数组排成最小的数](https://leetcode.cn/problems/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2045.%20%E6%8A%8A%E6%95%B0%E7%BB%84%E6%8E%92%E6%88%90%E6%9C%80%E5%B0%8F%E7%9A%84%E6%95%B0.md) | 贪心、字符串、排序 | 中等 | - -### 二分查找题目 - -#### 二分下标题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0704 | [二分查找](https://leetcode.cn/problems/binary-search/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0704.%20%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE.md) | 数组、二分查找 | 简单 | -| 0034 | [在排序数组中查找元素的第一个和最后一个位置](https://leetcode.cn/problems/find-first-and-last-position-of-element-in-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0034.%20%E5%9C%A8%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9F%A5%E6%89%BE%E5%85%83%E7%B4%A0%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%92%8C%E6%9C%80%E5%90%8E%E4%B8%80%E4%B8%AA%E4%BD%8D%E7%BD%AE.md) | 数组、二分查找 | 中等 | -| 0153 | [寻找旋转排序数组中的最小值](https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0153.%20%E5%AF%BB%E6%89%BE%E6%97%8B%E8%BD%AC%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9C%80%E5%B0%8F%E5%80%BC.md) | 数组、二分查找 | 中等 | -| 0154 | [寻找旋转排序数组中的最小值 II](https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0154.%20%E5%AF%BB%E6%89%BE%E6%97%8B%E8%BD%AC%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9C%80%E5%B0%8F%E5%80%BC%20II.md) | 数组、二分查找 | 困难 | -| 0033 | [搜索旋转排序数组](https://leetcode.cn/problems/search-in-rotated-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0033.%20%E6%90%9C%E7%B4%A2%E6%97%8B%E8%BD%AC%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、二分查找 | 中等 | -| 0162 | [寻找峰值](https://leetcode.cn/problems/find-peak-element/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0162.%20%E5%AF%BB%E6%89%BE%E5%B3%B0%E5%80%BC.md) | 数组、二分查找 | 中等 | -| 0004 | [寻找两个正序数组的中位数](https://leetcode.cn/problems/median-of-two-sorted-arrays/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0004.%20%E5%AF%BB%E6%89%BE%E4%B8%A4%E4%B8%AA%E6%AD%A3%E5%BA%8F%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0.md) | 数组、二分查找、分治 | 困难 | -| 0074 | [搜索二维矩阵](https://leetcode.cn/problems/search-a-2d-matrix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0074.%20%E6%90%9C%E7%B4%A2%E4%BA%8C%E7%BB%B4%E7%9F%A9%E9%98%B5.md) | 数组、二分查找、矩阵 | 中等 | -| 0240 | [搜索二维矩阵 II](https://leetcode.cn/problems/search-a-2d-matrix-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0240.%20%E6%90%9C%E7%B4%A2%E4%BA%8C%E7%BB%B4%E7%9F%A9%E9%98%B5%20II.md) | 数组、二分查找、分治、矩阵 | 中等 | - -#### 二分答案题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0069 | [x 的平方根](https://leetcode.cn/problems/sqrtx/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0069.%20x%20%E7%9A%84%E5%B9%B3%E6%96%B9%E6%A0%B9.md) | 数学、二分查找 | 简单 | -| 0287 | [寻找重复数](https://leetcode.cn/problems/find-the-duplicate-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0287.%20%E5%AF%BB%E6%89%BE%E9%87%8D%E5%A4%8D%E6%95%B0.md) | 位运算、数组、双指针、二分查找 | 中等 | -| 0050 | [Pow(x, n)](https://leetcode.cn/problems/powx-n/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0050.%20Pow%28x%2C%20n%29.md) | 递归、数学 | 中等 | -| 0400 | [第 N 位数字](https://leetcode.cn/problems/nth-digit/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0400.%20%E7%AC%AC%20N%20%E4%BD%8D%E6%95%B0%E5%AD%97.md) | 数学、二分查找 | 中等 | - -#### 复杂的二分查找问题 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0209 | [长度最小的子数组](https://leetcode.cn/problems/minimum-size-subarray-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0209.%20%E9%95%BF%E5%BA%A6%E6%9C%80%E5%B0%8F%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、二分查找、前缀和、滑动窗口 | 中等 | -| 0349 | [两个数组的交集](https://leetcode.cn/problems/intersection-of-two-arrays/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0349.%20%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E7%9A%84%E4%BA%A4%E9%9B%86.md) | 数组、哈希表、双指针、二分查找、排序 | 简单 | - -### 双指针题目 - -#### 对撞指针题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0611 | [有效三角形的个数](https://leetcode.cn/problems/valid-triangle-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0611.%20%E6%9C%89%E6%95%88%E4%B8%89%E8%A7%92%E5%BD%A2%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 贪心、数组、双指针、二分查找、排序 | 中等 | -| 0015 | [三数之和](https://leetcode.cn/problems/3sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0015.%20%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、双指针、排序 | 中等 | -| 0016 | [最接近的三数之和](https://leetcode.cn/problems/3sum-closest/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0016.%20%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9A%84%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、双指针、排序 | 中等 | -| 0125 | [验证回文串](https://leetcode.cn/problems/valid-palindrome/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0125.%20%E9%AA%8C%E8%AF%81%E5%9B%9E%E6%96%87%E4%B8%B2.md) | 双指针、字符串 | 简单 | -| 0011 | [盛最多水的容器](https://leetcode.cn/problems/container-with-most-water/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0011.%20%E7%9B%9B%E6%9C%80%E5%A4%9A%E6%B0%B4%E7%9A%84%E5%AE%B9%E5%99%A8.md) | 贪心、数组、双指针 | 中等 | -| 0075 | [颜色分类](https://leetcode.cn/problems/sort-colors/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0075.%20%E9%A2%9C%E8%89%B2%E5%88%86%E7%B1%BB.md) | 数组、双指针、排序 | 中等 | -| 剑指 Offer 21 | [调整数组顺序使奇数位于偶数前面](https://leetcode.cn/problems/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2021.%20%E8%B0%83%E6%95%B4%E6%95%B0%E7%BB%84%E9%A1%BA%E5%BA%8F%E4%BD%BF%E5%A5%87%E6%95%B0%E4%BD%8D%E4%BA%8E%E5%81%B6%E6%95%B0%E5%89%8D%E9%9D%A2.md) | 数组、双指针、排序 | 简单 | -| 0443 | [压缩字符串](https://leetcode.cn/problems/string-compression/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0443.%20%E5%8E%8B%E7%BC%A9%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 双指针、字符串 | 中等 | - -#### 快慢指针题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0026 | [删除有序数组中的重复项](https://leetcode.cn/problems/remove-duplicates-from-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0026.%20%E5%88%A0%E9%99%A4%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E9%A1%B9.md) | 数组、双指针 | 简单 | -| 0283 | [移动零](https://leetcode.cn/problems/move-zeroes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0283.%20%E7%A7%BB%E5%8A%A8%E9%9B%B6.md) | 数组、双指针 | 简单 | -| 0088 | [合并两个有序数组](https://leetcode.cn/problems/merge-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0088.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、双指针、排序 | 简单 | - -#### 分离双指针题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0415 | [字符串相加](https://leetcode.cn/problems/add-strings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0415.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E5%8A%A0.md) | 数学、字符串、模拟 | 简单 | - -### 滑动窗口题目 - -#### 固定长度窗口题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0239 | [滑动窗口最大值](https://leetcode.cn/problems/sliding-window-maximum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0239.%20%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E6%9C%80%E5%A4%A7%E5%80%BC.md) | 队列、数组、滑动窗口、单调队列、堆（优先队列） | 困难 | - -#### 不定长度窗口题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0003 | [无重复字符的最长子串](https://leetcode.cn/problems/longest-substring-without-repeating-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0003.%20%E6%97%A0%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2.md) | 哈希表、字符串、滑动窗口 | 中等 | -| 0076 | [最小覆盖子串](https://leetcode.cn/problems/minimum-window-substring/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0076.%20%E6%9C%80%E5%B0%8F%E8%A6%86%E7%9B%96%E5%AD%90%E4%B8%B2.md) | 哈希表、字符串、滑动窗口 | 困难 | -| 0718 | [最长重复子数组](https://leetcode.cn/problems/maximum-length-of-repeated-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0718.%20%E6%9C%80%E9%95%BF%E9%87%8D%E5%A4%8D%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、二分查找、动态规划、滑动窗口、哈希函数、滚动哈希 | 中等 | -| 0209 | [长度最小的子数组](https://leetcode.cn/problems/minimum-size-subarray-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0209.%20%E9%95%BF%E5%BA%A6%E6%9C%80%E5%B0%8F%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、二分查找、前缀和、滑动窗口 | 中等 | -| 0862 | [和至少为 K 的最短子数组](https://leetcode.cn/problems/shortest-subarray-with-sum-at-least-k/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0862.%20%E5%92%8C%E8%87%B3%E5%B0%91%E4%B8%BA%20K%20%E7%9A%84%E6%9C%80%E7%9F%AD%E5%AD%90%E6%95%B0%E7%BB%84.md) | 队列、数组、二分查找、前缀和、滑动窗口、单调队列、堆（优先队列） | 困难 | -| 1004 | [最大连续1的个数 III](https://leetcode.cn/problems/max-consecutive-ones-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1004.%20%E6%9C%80%E5%A4%A7%E8%BF%9E%E7%BB%AD1%E7%9A%84%E4%B8%AA%E6%95%B0%20III.md) | 数组、二分查找、前缀和、滑动窗口 | 中等 | - -## 02. 链表 - -### 链表经典题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0083 | [删除排序链表中的重复元素](https://leetcode.cn/problems/remove-duplicates-from-sorted-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0083.%20%E5%88%A0%E9%99%A4%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0.md) | 链表 | 简单 | -| 0082 | [删除排序链表中的重复元素 II](https://leetcode.cn/problems/remove-duplicates-from-sorted-list-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0082.%20%E5%88%A0%E9%99%A4%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0%20II.md) | 链表、双指针 | 中等 | -| 0206 | [反转链表](https://leetcode.cn/problems/reverse-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0206.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8.md) | 递归、链表 | 简单 | -| 0092 | [反转链表 II](https://leetcode.cn/problems/reverse-linked-list-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0092.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8%20II.md) | 链表 | 中等 | -| 0025 | [K 个一组翻转链表](https://leetcode.cn/problems/reverse-nodes-in-k-group/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0025.%20K%20%E4%B8%AA%E4%B8%80%E7%BB%84%E7%BF%BB%E8%BD%AC%E9%93%BE%E8%A1%A8.md) | 递归、链表 | 困难 | -| 0328 | [奇偶链表](https://leetcode.cn/problems/odd-even-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0328.%20%E5%A5%87%E5%81%B6%E9%93%BE%E8%A1%A8.md) | 链表 | 中等 | -| 0234 | [回文链表](https://leetcode.cn/problems/palindrome-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0234.%20%E5%9B%9E%E6%96%87%E9%93%BE%E8%A1%A8.md) | 栈、递归、链表、双指针 | 简单 | -| 0138 | [复制带随机指针的链表](https://leetcode.cn/problems/copy-list-with-random-pointer/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0138.%20%E5%A4%8D%E5%88%B6%E5%B8%A6%E9%9A%8F%E6%9C%BA%E6%8C%87%E9%92%88%E7%9A%84%E9%93%BE%E8%A1%A8.md) | 哈希表、链表 | 中等 | -| 0061 | [旋转链表](https://leetcode.cn/problems/rotate-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0061.%20%E6%97%8B%E8%BD%AC%E9%93%BE%E8%A1%A8.md) | 链表、双指针 | 中等 | - -### 链表排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0148 | [排序链表](https://leetcode.cn/problems/sort-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0148.%20%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8.md) | 链表、双指针、分治、排序、归并排序 | 中等 | -| 0021 | [合并两个有序链表](https://leetcode.cn/problems/merge-two-sorted-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0021.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E9%93%BE%E8%A1%A8.md) | 递归、链表 | 简单 | -| 0023 | [合并 K 个升序链表](https://leetcode.cn/problems/merge-k-sorted-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0023.%20%E5%90%88%E5%B9%B6%20K%20%E4%B8%AA%E5%8D%87%E5%BA%8F%E9%93%BE%E8%A1%A8.md) | 链表、分治、堆（优先队列）、归并排序 | 困难 | - -### 链表双指针题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0141 | [环形链表](https://leetcode.cn/problems/linked-list-cycle/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0141.%20%E7%8E%AF%E5%BD%A2%E9%93%BE%E8%A1%A8.md) | 哈希表、链表、双指针 | 简单 | -| 0142 | [环形链表 II](https://leetcode.cn/problems/linked-list-cycle-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0142.%20%E7%8E%AF%E5%BD%A2%E9%93%BE%E8%A1%A8%20II.md) | 哈希表、链表、双指针 | 中等 | -| 0160 | [相交链表](https://leetcode.cn/problems/intersection-of-two-linked-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0160.%20%E7%9B%B8%E4%BA%A4%E9%93%BE%E8%A1%A8.md) | 哈希表、链表、双指针 | 简单 | -| 0019 | [删除链表的倒数第 N 个结点](https://leetcode.cn/problems/remove-nth-node-from-end-of-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0019.%20%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E7%9A%84%E5%80%92%E6%95%B0%E7%AC%AC%20N%20%E4%B8%AA%E7%BB%93%E7%82%B9.md) | 链表、双指针 | 中等 | -| 剑指 Offer 22 | [链表中倒数第k个节点](https://leetcode.cn/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2022.%20%E9%93%BE%E8%A1%A8%E4%B8%AD%E5%80%92%E6%95%B0%E7%AC%ACk%E4%B8%AA%E8%8A%82%E7%82%B9.md) | 链表、双指针 | 简单 | -| 0143 | [重排链表](https://leetcode.cn/problems/reorder-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0143.%20%E9%87%8D%E6%8E%92%E9%93%BE%E8%A1%A8.md) | 栈、递归、链表、双指针 | 中等 | -| 0002 | [两数相加](https://leetcode.cn/problems/add-two-numbers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0002.%20%E4%B8%A4%E6%95%B0%E7%9B%B8%E5%8A%A0.md) | 递归、链表、数学 | 中等 | -| 0445 | [两数相加 II](https://leetcode.cn/problems/add-two-numbers-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0445.%20%E4%B8%A4%E6%95%B0%E7%9B%B8%E5%8A%A0%20II.md) | 栈、链表、数学 | 中等 | - -## 03. 堆栈 - -### 堆栈基础题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 1047 | [删除字符串中的所有相邻重复项](https://leetcode.cn/problems/remove-all-adjacent-duplicates-in-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1047.%20%E5%88%A0%E9%99%A4%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E6%89%80%E6%9C%89%E7%9B%B8%E9%82%BB%E9%87%8D%E5%A4%8D%E9%A1%B9.md) | 栈、字符串 | 简单 | -| 0155 | [最小栈](https://leetcode.cn/problems/min-stack/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0155.%20%E6%9C%80%E5%B0%8F%E6%A0%88.md) | 栈、设计 | 中等 | -| 0020 | [有效的括号](https://leetcode.cn/problems/valid-parentheses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0020.%20%E6%9C%89%E6%95%88%E7%9A%84%E6%8B%AC%E5%8F%B7.md) | 栈、字符串 | 简单 | -| 0224 | [基本计算器](https://leetcode.cn/problems/basic-calculator/) | | 栈、递归、数学、字符串 | 困难 | -| 0227 | [基本计算器 II](https://leetcode.cn/problems/basic-calculator-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0227.%20%E5%9F%BA%E6%9C%AC%E8%AE%A1%E7%AE%97%E5%99%A8%20II.md) | 栈、数学、字符串 | 中等 | -| 0232 | [用栈实现队列](https://leetcode.cn/problems/implement-queue-using-stacks/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0232.%20%E7%94%A8%E6%A0%88%E5%AE%9E%E7%8E%B0%E9%98%9F%E5%88%97.md) | 栈、设计、队列 | 简单 | -| 剑指 Offer 09 | [用两个栈实现队列](https://leetcode.cn/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2009.%20%E7%94%A8%E4%B8%A4%E4%B8%AA%E6%A0%88%E5%AE%9E%E7%8E%B0%E9%98%9F%E5%88%97.md) | 栈、设计、队列 | 简单 | -| 0394 | [字符串解码](https://leetcode.cn/problems/decode-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0394.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%A7%A3%E7%A0%81.md) | 栈、递归、字符串 | 中等 | -| 0032 | [最长有效括号](https://leetcode.cn/problems/longest-valid-parentheses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0032.%20%E6%9C%80%E9%95%BF%E6%9C%89%E6%95%88%E6%8B%AC%E5%8F%B7.md) | 栈、字符串、动态规划 | 困难 | -| 0739 | [每日温度](https://leetcode.cn/problems/daily-temperatures/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0739.%20%E6%AF%8F%E6%97%A5%E6%B8%A9%E5%BA%A6.md) | 栈、数组、单调栈 | 中等 | -| 0071 | [简化路径](https://leetcode.cn/problems/simplify-path/) | | 栈、字符串 | 中等 | - -### 单调栈 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0739 | [每日温度](https://leetcode.cn/problems/daily-temperatures/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0739.%20%E6%AF%8F%E6%97%A5%E6%B8%A9%E5%BA%A6.md) | 栈、数组、单调栈 | 中等 | -| 0503 | [下一个更大元素 II](https://leetcode.cn/problems/next-greater-element-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0503.%20%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%9B%B4%E5%A4%A7%E5%85%83%E7%B4%A0%20II.md) | 栈、数组、单调栈 | 中等 | -| 0042 | [接雨水](https://leetcode.cn/problems/trapping-rain-water/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0042.%20%E6%8E%A5%E9%9B%A8%E6%B0%B4.md) | 栈、数组、双指针、动态规划、单调栈 | 困难 | -| 0085 | [最大矩形](https://leetcode.cn/problems/maximal-rectangle/) | | 栈、数组、动态规划、矩阵、单调栈 | 困难 | - -## 04. 队列 - -### 队列基础题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0225 | [用队列实现栈](https://leetcode.cn/problems/implement-stack-using-queues/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0225.%20%E7%94%A8%E9%98%9F%E5%88%97%E5%AE%9E%E7%8E%B0%E6%A0%88.md) | 栈、设计、队列 | 简单 | - -### 优先队列题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0347 | [前 K 个高频元素](https://leetcode.cn/problems/top-k-frequent-elements/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0347.%20%E5%89%8D%20K%20%E4%B8%AA%E9%AB%98%E9%A2%91%E5%85%83%E7%B4%A0.md) | 数组、哈希表、分治、桶排序、计数、快速选择、排序、堆（优先队列） | 中等 | -| 0239 | [滑动窗口最大值](https://leetcode.cn/problems/sliding-window-maximum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0239.%20%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E6%9C%80%E5%A4%A7%E5%80%BC.md) | 队列、数组、滑动窗口、单调队列、堆（优先队列） | 困难 | -| 0295 | [数据流的中位数](https://leetcode.cn/problems/find-median-from-data-stream/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0295.%20%E6%95%B0%E6%8D%AE%E6%B5%81%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0.md) | 设计、双指针、数据流、排序、堆（优先队列） | 困难 | -| 0023 | [合并 K 个升序链表](https://leetcode.cn/problems/merge-k-sorted-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0023.%20%E5%90%88%E5%B9%B6%20K%20%E4%B8%AA%E5%8D%87%E5%BA%8F%E9%93%BE%E8%A1%A8.md) | 链表、分治、堆（优先队列）、归并排序 | 困难 | - -## 05. 哈希表 - -### 哈希表题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0001 | [两数之和](https://leetcode.cn/problems/two-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0001.%20%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、哈希表 | 简单 | -| 0015 | [三数之和](https://leetcode.cn/problems/3sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0015.%20%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、双指针、排序 | 中等 | -| 0041 | [缺失的第一个正数](https://leetcode.cn/problems/first-missing-positive/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0041.%20%E7%BC%BA%E5%A4%B1%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E6%AD%A3%E6%95%B0.md) | 数组、哈希表 | 困难 | -| 0128 | [最长连续序列](https://leetcode.cn/problems/longest-consecutive-sequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0128.%20%E6%9C%80%E9%95%BF%E8%BF%9E%E7%BB%AD%E5%BA%8F%E5%88%97.md) | 并查集、数组、哈希表 | 中等 | -| 0136 | [只出现一次的数字](https://leetcode.cn/problems/single-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0136.%20%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B0%E5%AD%97.md) | 位运算、数组 | 简单 | -| 0242 | [有效的字母异位词](https://leetcode.cn/problems/valid-anagram/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0242.%20%E6%9C%89%E6%95%88%E7%9A%84%E5%AD%97%E6%AF%8D%E5%BC%82%E4%BD%8D%E8%AF%8D.md) | 哈希表、字符串、排序 | 简单 | -| 0442 | [数组中重复的数据](https://leetcode.cn/problems/find-all-duplicates-in-an-array/) | | 数组、哈希表 | 中等 | -| 剑指 Offer 61 | [扑克牌中的顺子](https://leetcode.cn/problems/bu-ke-pai-zhong-de-shun-zi-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2061.%20%E6%89%91%E5%85%8B%E7%89%8C%E4%B8%AD%E7%9A%84%E9%A1%BA%E5%AD%90.md) | 数组、排序 | 简单 | -| 0268 | [丢失的数字](https://leetcode.cn/problems/missing-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0268.%20%E4%B8%A2%E5%A4%B1%E7%9A%84%E6%95%B0%E5%AD%97.md) | 位运算、数组、哈希表、数学、二分查找、排序 | 简单 | -| 剑指 Offer 03 | [数组中重复的数字](https://leetcode.cn/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2003.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E9%87%8D%E5%A4%8D%E7%9A%84%E6%95%B0%E5%AD%97.md) | 数组、哈希表、排序 | 简单 | - -## 06. 字符串 - -### 字符串基础题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0125 | [验证回文串](https://leetcode.cn/problems/valid-palindrome/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0125.%20%E9%AA%8C%E8%AF%81%E5%9B%9E%E6%96%87%E4%B8%B2.md) | 双指针、字符串 | 简单 | -| 0005 | [最长回文子串](https://leetcode.cn/problems/longest-palindromic-substring/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0005.%20%E6%9C%80%E9%95%BF%E5%9B%9E%E6%96%87%E5%AD%90%E4%B8%B2.md) | 字符串、动态规划 | 中等 | -| 0003 | [无重复字符的最长子串](https://leetcode.cn/problems/longest-substring-without-repeating-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0003.%20%E6%97%A0%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2.md) | 哈希表、字符串、滑动窗口 | 中等 | -| 0344 | [反转字符串](https://leetcode.cn/problems/reverse-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0344.%20%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 双指针、字符串 | 简单 | -| 0557 | [反转字符串中的单词 III](https://leetcode.cn/problems/reverse-words-in-a-string-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0557.%20%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%8D%95%E8%AF%8D%20III.md) | 双指针、字符串 | 简单 | -| 0415 | [字符串相加](https://leetcode.cn/problems/add-strings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0415.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E5%8A%A0.md) | 数学、字符串、模拟 | 简单 | -| 0151 | [反转字符串中的单词](https://leetcode.cn/problems/reverse-words-in-a-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0151.%20%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%8D%95%E8%AF%8D.md) | 双指针、字符串 | 中等 | -| 0043 | [字符串相乘](https://leetcode.cn/problems/multiply-strings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0043.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E4%B9%98.md) | 数学、字符串、模拟 | 中等 | -| 0014 | [最长公共前缀](https://leetcode.cn/problems/longest-common-prefix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0014.%20%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%89%8D%E7%BC%80.md) | 字典树、字符串 | 简单 | - -### 单模式串匹配题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0459 | [重复的子字符串](https://leetcode.cn/problems/repeated-substring-pattern/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0459.%20%E9%87%8D%E5%A4%8D%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 字符串、字符串匹配 | 简单 | - -### 字典树题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0208 | [实现 Trie (前缀树)](https://leetcode.cn/problems/implement-trie-prefix-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0208.%20%E5%AE%9E%E7%8E%B0%20Trie%20%28%E5%89%8D%E7%BC%80%E6%A0%91%29.md) | 设计、字典树、哈希表、字符串 | 中等 | -| 0440 | [字典序的第K小数字](https://leetcode.cn/problems/k-th-smallest-in-lexicographical-order/) | | 字典树 | 困难 | - -## 07. 树 - -### 二叉树的遍历题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0144 | [二叉树的前序遍历](https://leetcode.cn/problems/binary-tree-preorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0144.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%89%8D%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索、二叉树 | 简单 | -| 0094 | [二叉树的中序遍历](https://leetcode.cn/problems/binary-tree-inorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0094.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E4%B8%AD%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索、二叉树 | 简单 | -| 0145 | [二叉树的后序遍历](https://leetcode.cn/problems/binary-tree-postorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0145.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索、二叉树 | 简单 | -| 0102 | [二叉树的层序遍历](https://leetcode.cn/problems/binary-tree-level-order-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0102.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%B1%82%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 树、广度优先搜索、二叉树 | 中等 | -| 0103 | [二叉树的锯齿形层序遍历](https://leetcode.cn/problems/binary-tree-zigzag-level-order-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0103.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%94%AF%E9%BD%BF%E5%BD%A2%E5%B1%82%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 树、广度优先搜索、二叉树 | 中等 | -| 0104 | [二叉树的最大深度](https://leetcode.cn/problems/maximum-depth-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0104.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%A4%A7%E6%B7%B1%E5%BA%A6.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0111 | [二叉树的最小深度](https://leetcode.cn/problems/minimum-depth-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0111.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%B0%8F%E6%B7%B1%E5%BA%A6.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0124 | [二叉树中的最大路径和](https://leetcode.cn/problems/binary-tree-maximum-path-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0124.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E8%B7%AF%E5%BE%84%E5%92%8C.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | -| 0101 | [对称二叉树](https://leetcode.cn/problems/symmetric-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0101.%20%E5%AF%B9%E7%A7%B0%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0112 | [路径总和](https://leetcode.cn/problems/path-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0112.%20%E8%B7%AF%E5%BE%84%E6%80%BB%E5%92%8C.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0113 | [路径总和 II](https://leetcode.cn/problems/path-sum-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0113.%20%E8%B7%AF%E5%BE%84%E6%80%BB%E5%92%8C%20II.md) | 树、深度优先搜索、回溯、二叉树 | 中等 | -| 0236 | [二叉树的最近公共祖先](https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0236.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88.md) | 树、深度优先搜索、二叉树 | 中等 | -| 0199 | [二叉树的右视图](https://leetcode.cn/problems/binary-tree-right-side-view/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0199.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%8F%B3%E8%A7%86%E5%9B%BE.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | -| 0226 | [翻转二叉树](https://leetcode.cn/problems/invert-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0226.%20%E7%BF%BB%E8%BD%AC%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0958 | [二叉树的完全性检验](https://leetcode.cn/problems/check-completeness-of-a-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0958.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%AE%8C%E5%85%A8%E6%80%A7%E6%A3%80%E9%AA%8C.md) | 树、广度优先搜索、二叉树 | 中等 | -| 0572 | [另一棵树的子树](https://leetcode.cn/problems/subtree-of-another-tree/) | | 树、深度优先搜索、二叉树、字符串匹配、哈希函数 | 简单 | -| 0100 | [相同的树](https://leetcode.cn/problems/same-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0100.%20%E7%9B%B8%E5%90%8C%E7%9A%84%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0297 | [二叉树的序列化与反序列化](https://leetcode.cn/problems/serialize-and-deserialize-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0297.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%BA%8F%E5%88%97%E5%8C%96%E4%B8%8E%E5%8F%8D%E5%BA%8F%E5%88%97%E5%8C%96.md) | 树、深度优先搜索、广度优先搜索、设计、字符串、二叉树 | 困难 | -| 0114 | [二叉树展开为链表](https://leetcode.cn/problems/flatten-binary-tree-to-linked-list/) | | 栈、树、深度优先搜索、链表、二叉树 | 中等 | - -### 二叉树的还原题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0105 | [从前序与中序遍历序列构造二叉树](https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0105.%20%E4%BB%8E%E5%89%8D%E5%BA%8F%E4%B8%8E%E4%B8%AD%E5%BA%8F%E9%81%8D%E5%8E%86%E5%BA%8F%E5%88%97%E6%9E%84%E9%80%A0%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、数组、哈希表、分治、二叉树 | 中等 | -| 0106 | [从中序与后序遍历序列构造二叉树](https://leetcode.cn/problems/construct-binary-tree-from-inorder-and-postorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0106.%20%E4%BB%8E%E4%B8%AD%E5%BA%8F%E4%B8%8E%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86%E5%BA%8F%E5%88%97%E6%9E%84%E9%80%A0%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、数组、哈希表、分治、二叉树 | 中等 | - -### 二叉搜索树题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0098 | [验证二叉搜索树](https://leetcode.cn/problems/validate-binary-search-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0098.%20%E9%AA%8C%E8%AF%81%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | -| 0450 | [删除二叉搜索树中的节点](https://leetcode.cn/problems/delete-node-in-a-bst/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0450.%20%E5%88%A0%E9%99%A4%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E8%8A%82%E7%82%B9.md) | 树、二叉搜索树、二叉树 | 中等 | -| 剑指 Offer 54 | [二叉搜索树的第k大节点](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2054.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E7%AC%ACk%E5%A4%A7%E8%8A%82%E7%82%B9.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 简单 | -| 0230 | [二叉搜索树中第K小的元素](https://leetcode.cn/problems/kth-smallest-element-in-a-bst/) | | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | -| 0426 | [将二叉搜索树转化为排序的双向链表](https://leetcode.cn/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0426.%20%E5%B0%86%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E8%BD%AC%E5%8C%96%E4%B8%BA%E6%8E%92%E5%BA%8F%E7%9A%84%E5%8F%8C%E5%90%91%E9%93%BE%E8%A1%A8.md) | 栈、树、深度优先搜索、二叉搜索树、链表、二叉树、双向链表 | 中等 | -| 0110 | [平衡二叉树](https://leetcode.cn/problems/balanced-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0110.%20%E5%B9%B3%E8%A1%A1%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、二叉树 | 简单 | - -### 并查集题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0128 | [最长连续序列](https://leetcode.cn/problems/longest-consecutive-sequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0128.%20%E6%9C%80%E9%95%BF%E8%BF%9E%E7%BB%AD%E5%BA%8F%E5%88%97.md) | 并查集、数组、哈希表 | 中等 | - -## 08. 图论 - -### 图的深度优先搜索题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0200 | [岛屿数量](https://leetcode.cn/problems/number-of-islands/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0200.%20%E5%B2%9B%E5%B1%BF%E6%95%B0%E9%87%8F.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | -| 0695 | [岛屿的最大面积](https://leetcode.cn/problems/max-area-of-island/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0695.%20%E5%B2%9B%E5%B1%BF%E7%9A%84%E6%9C%80%E5%A4%A7%E9%9D%A2%E7%A7%AF.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | -| 0144 | [二叉树的前序遍历](https://leetcode.cn/problems/binary-tree-preorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0144.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%89%8D%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索、二叉树 | 简单 | -| 0094 | [二叉树的中序遍历](https://leetcode.cn/problems/binary-tree-inorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0094.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E4%B8%AD%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索、二叉树 | 简单 | -| 0145 | [二叉树的后序遍历](https://leetcode.cn/problems/binary-tree-postorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0145.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索、二叉树 | 简单 | -| 0129 | [求根节点到叶节点数字之和](https://leetcode.cn/problems/sum-root-to-leaf-numbers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0129.%20%E6%B1%82%E6%A0%B9%E8%8A%82%E7%82%B9%E5%88%B0%E5%8F%B6%E8%8A%82%E7%82%B9%E6%95%B0%E5%AD%97%E4%B9%8B%E5%92%8C.md) | 树、深度优先搜索、二叉树 | 中等 | -| 0124 | [二叉树中的最大路径和](https://leetcode.cn/problems/binary-tree-maximum-path-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0124.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E8%B7%AF%E5%BE%84%E5%92%8C.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | -| 0199 | [二叉树的右视图](https://leetcode.cn/problems/binary-tree-right-side-view/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0199.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%8F%B3%E8%A7%86%E5%9B%BE.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | -| 0543 | [二叉树的直径](https://leetcode.cn/problems/diameter-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0543.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E7%9B%B4%E5%BE%84.md) | 树、深度优先搜索、二叉树 | 简单 | -| 0662 | [二叉树最大宽度](https://leetcode.cn/problems/maximum-width-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0662.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E6%9C%80%E5%A4%A7%E5%AE%BD%E5%BA%A6.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | -| 0958 | [二叉树的完全性检验](https://leetcode.cn/problems/check-completeness-of-a-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0958.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%AE%8C%E5%85%A8%E6%80%A7%E6%A3%80%E9%AA%8C.md) | 树、广度优先搜索、二叉树 | 中等 | -| 0572 | [另一棵树的子树](https://leetcode.cn/problems/subtree-of-another-tree/) | | 树、深度优先搜索、二叉树、字符串匹配、哈希函数 | 简单 | -| 0100 | [相同的树](https://leetcode.cn/problems/same-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0100.%20%E7%9B%B8%E5%90%8C%E7%9A%84%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0111 | [二叉树的最小深度](https://leetcode.cn/problems/minimum-depth-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0111.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%B0%8F%E6%B7%B1%E5%BA%A6.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | - -### 图的广度优先搜索题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0200 | [岛屿数量](https://leetcode.cn/problems/number-of-islands/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0200.%20%E5%B2%9B%E5%B1%BF%E6%95%B0%E9%87%8F.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | -| 0322 | [零钱兑换](https://leetcode.cn/problems/coin-change/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0322.%20%E9%9B%B6%E9%92%B1%E5%85%91%E6%8D%A2.md) | 广度优先搜索、数组、动态规划 | 中等 | -| 0207 | [课程表](https://leetcode.cn/problems/course-schedule/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0207.%20%E8%AF%BE%E7%A8%8B%E8%A1%A8.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | -| 0199 | [二叉树的右视图](https://leetcode.cn/problems/binary-tree-right-side-view/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0199.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%8F%B3%E8%A7%86%E5%9B%BE.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | -| 0662 | [二叉树最大宽度](https://leetcode.cn/problems/maximum-width-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0662.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E6%9C%80%E5%A4%A7%E5%AE%BD%E5%BA%A6.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | -| 0958 | [二叉树的完全性检验](https://leetcode.cn/problems/check-completeness-of-a-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0958.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%AE%8C%E5%85%A8%E6%80%A7%E6%A3%80%E9%AA%8C.md) | 树、广度优先搜索、二叉树 | 中等 | -| 0572 | [另一棵树的子树](https://leetcode.cn/problems/subtree-of-another-tree/) | | 树、深度优先搜索、二叉树、字符串匹配、哈希函数 | 简单 | -| 0100 | [相同的树](https://leetcode.cn/problems/same-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0100.%20%E7%9B%B8%E5%90%8C%E7%9A%84%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0111 | [二叉树的最小深度](https://leetcode.cn/problems/minimum-depth-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0111.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%B0%8F%E6%B7%B1%E5%BA%A6.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 剑指 Offer 32 - III | [从上到下打印二叉树 III](https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2032%20-%20III.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91%20III.md) | 树、广度优先搜索、二叉树 | 中等 | - -### 图的拓扑排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0210 | [课程表 II](https://leetcode.cn/problems/course-schedule-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0210.%20%E8%AF%BE%E7%A8%8B%E8%A1%A8%20II.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | - -## 09. 基础算法 - -### 枚举算法题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0001 | [两数之和](https://leetcode.cn/problems/two-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0001.%20%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、哈希表 | 简单 | -| 0078 | [子集](https://leetcode.cn/problems/subsets/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0078.%20%E5%AD%90%E9%9B%86.md) | 位运算、数组、回溯 | 中等 | -| 0221 | [最大正方形](https://leetcode.cn/problems/maximal-square/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0221.%20%E6%9C%80%E5%A4%A7%E6%AD%A3%E6%96%B9%E5%BD%A2.md) | 数组、动态规划、矩阵 | 中等 | -| 0560 | [和为 K 的子数组](https://leetcode.cn/problems/subarray-sum-equals-k/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0560.%20%E5%92%8C%E4%B8%BA%20K%20%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、哈希表、前缀和 | 中等 | - -### 递归算法题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0024 | [两两交换链表中的节点](https://leetcode.cn/problems/swap-nodes-in-pairs/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0024.%20%E4%B8%A4%E4%B8%A4%E4%BA%A4%E6%8D%A2%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E8%8A%82%E7%82%B9.md) | 递归、链表 | 中等 | -| 0206 | [反转链表](https://leetcode.cn/problems/reverse-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0206.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8.md) | 递归、链表 | 简单 | -| 0092 | [反转链表 II](https://leetcode.cn/problems/reverse-linked-list-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0092.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8%20II.md) | 链表 | 中等 | -| 0021 | [合并两个有序链表](https://leetcode.cn/problems/merge-two-sorted-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0021.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E9%93%BE%E8%A1%A8.md) | 递归、链表 | 简单 | -| 0509 | [斐波那契数](https://leetcode.cn/problems/fibonacci-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0509.%20%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0.md) | 递归、记忆化搜索、数学、动态规划 | 简单 | -| 0070 | [爬楼梯](https://leetcode.cn/problems/climbing-stairs/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0070.%20%E7%88%AC%E6%A5%BC%E6%A2%AF.md) | 记忆化搜索、数学、动态规划 | 简单 | -| 0104 | [二叉树的最大深度](https://leetcode.cn/problems/maximum-depth-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0104.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%A4%A7%E6%B7%B1%E5%BA%A6.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0124 | [二叉树中的最大路径和](https://leetcode.cn/problems/binary-tree-maximum-path-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0124.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E8%B7%AF%E5%BE%84%E5%92%8C.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | -| 0226 | [翻转二叉树](https://leetcode.cn/problems/invert-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0226.%20%E7%BF%BB%E8%BD%AC%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 剑指 Offer 62 | [圆圈中最后剩下的数字](https://leetcode.cn/problems/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2062.%20%E5%9C%86%E5%9C%88%E4%B8%AD%E6%9C%80%E5%90%8E%E5%89%A9%E4%B8%8B%E7%9A%84%E6%95%B0%E5%AD%97.md) | 递归、数学 | 简单 | - -### 分治算法题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0004 | [寻找两个正序数组的中位数](https://leetcode.cn/problems/median-of-two-sorted-arrays/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0004.%20%E5%AF%BB%E6%89%BE%E4%B8%A4%E4%B8%AA%E6%AD%A3%E5%BA%8F%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0.md) | 数组、二分查找、分治 | 困难 | -| 0023 | [合并 K 个升序链表](https://leetcode.cn/problems/merge-k-sorted-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0023.%20%E5%90%88%E5%B9%B6%20K%20%E4%B8%AA%E5%8D%87%E5%BA%8F%E9%93%BE%E8%A1%A8.md) | 链表、分治、堆（优先队列）、归并排序 | 困难 | -| 0053 | [最大子数组和](https://leetcode.cn/problems/maximum-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0053.%20%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84%E5%92%8C.md) | 数组、分治、动态规划 | 中等 | -| 0169 | [多数元素](https://leetcode.cn/problems/majority-element/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0169.%20%E5%A4%9A%E6%95%B0%E5%85%83%E7%B4%A0.md) | 数组、哈希表、分治、计数、排序 | 简单 | -| 0014 | [最长公共前缀](https://leetcode.cn/problems/longest-common-prefix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0014.%20%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%89%8D%E7%BC%80.md) | 字典树、字符串 | 简单 | -| 剑指 Offer 33 | [二叉搜索树的后序遍历序列](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2033.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86%E5%BA%8F%E5%88%97.md) | 栈、树、二叉搜索树、递归、二叉树、单调栈 | 中等 | - -### 回溯算法题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0046 | [全排列](https://leetcode.cn/problems/permutations/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0046.%20%E5%85%A8%E6%8E%92%E5%88%97.md) | 数组、回溯 | 中等 | -| 0047 | [全排列 II](https://leetcode.cn/problems/permutations-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0047.%20%E5%85%A8%E6%8E%92%E5%88%97%20II.md) | 数组、回溯 | 中等 | -| 0037 | [解数独](https://leetcode.cn/problems/sudoku-solver/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0037.%20%E8%A7%A3%E6%95%B0%E7%8B%AC.md) | 数组、哈希表、回溯、矩阵 | 困难 | -| 0022 | [括号生成](https://leetcode.cn/problems/generate-parentheses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0022.%20%E6%8B%AC%E5%8F%B7%E7%94%9F%E6%88%90.md) | 字符串、动态规划、回溯 | 中等 | -| 0078 | [子集](https://leetcode.cn/problems/subsets/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0078.%20%E5%AD%90%E9%9B%86.md) | 位运算、数组、回溯 | 中等 | -| 0039 | [组合总和](https://leetcode.cn/problems/combination-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0039.%20%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8C.md) | 数组、回溯 | 中等 | -| 0040 | [组合总和 II](https://leetcode.cn/problems/combination-sum-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0040.%20%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8C%20II.md) | 数组、回溯 | 中等 | -| 0093 | [复原 IP 地址](https://leetcode.cn/problems/restore-ip-addresses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0093.%20%E5%A4%8D%E5%8E%9F%20IP%20%E5%9C%B0%E5%9D%80.md) | 字符串、回溯 | 中等 | -| 0079 | [单词搜索](https://leetcode.cn/problems/word-search/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0079.%20%E5%8D%95%E8%AF%8D%E6%90%9C%E7%B4%A2.md) | 数组、回溯、矩阵 | 中等 | -| 0679 | [24 点游戏](https://leetcode.cn/problems/24-game/) | | 数组、数学、回溯 | 困难 | - -### 贪心算法题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0053 | [最大子数组和](https://leetcode.cn/problems/maximum-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0053.%20%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84%E5%92%8C.md) | 数组、分治、动态规划 | 中等 | -| 0056 | [合并区间](https://leetcode.cn/problems/merge-intervals/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0056.%20%E5%90%88%E5%B9%B6%E5%8C%BA%E9%97%B4.md) | 数组、排序 | 中等 | -| 0122 | [买卖股票的最佳时机 II](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0122.%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA%20II.md) | 贪心、数组 | 中等 | -| 0055 | [跳跃游戏](https://leetcode.cn/problems/jump-game/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0055.%20%E8%B7%B3%E8%B7%83%E6%B8%B8%E6%88%8F.md) | 贪心、数组、动态规划 | 中等 | -| 0402 | [移掉 K 位数字](https://leetcode.cn/problems/remove-k-digits/) | | 栈、贪心、字符串、单调栈 | 中等 | -| 0135 | [分发糖果](https://leetcode.cn/problems/candy/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0135.%20%E5%88%86%E5%8F%91%E7%B3%96%E6%9E%9C.md) | 贪心、数组 | 困难 | -| 0134 | [加油站](https://leetcode.cn/problems/gas-station/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0134.%20%E5%8A%A0%E6%B2%B9%E7%AB%99.md) | 贪心、数组 | 中等 | -| 0670 | [最大交换](https://leetcode.cn/problems/maximum-swap/) | | 贪心、数学 | 中等 | - -### 位运算题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0136 | [只出现一次的数字](https://leetcode.cn/problems/single-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0136.%20%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B0%E5%AD%97.md) | 位运算、数组 | 简单 | -| 0191 | [位1的个数](https://leetcode.cn/problems/number-of-1-bits/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0191.%20%E4%BD%8D1%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 位运算、分治 | 简单 | -| 0268 | [丢失的数字](https://leetcode.cn/problems/missing-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0268.%20%E4%B8%A2%E5%A4%B1%E7%9A%84%E6%95%B0%E5%AD%97.md) | 位运算、数组、哈希表、数学、二分查找、排序 | 简单 | - -## 10. 动态规划 - -### 动态规划题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0070 | [爬楼梯](https://leetcode.cn/problems/climbing-stairs/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0070.%20%E7%88%AC%E6%A5%BC%E6%A2%AF.md) | 记忆化搜索、数学、动态规划 | 简单 | -| 0509 | [斐波那契数](https://leetcode.cn/problems/fibonacci-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0509.%20%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0.md) | 递归、记忆化搜索、数学、动态规划 | 简单 | -| 0121 | [买卖股票的最佳时机](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0121.%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA.md) | 数组、动态规划 | 简单 | -| 0322 | [零钱兑换](https://leetcode.cn/problems/coin-change/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0322.%20%E9%9B%B6%E9%92%B1%E5%85%91%E6%8D%A2.md) | 广度优先搜索、数组、动态规划 | 中等 | -| 0518 | [零钱兑换 II](https://leetcode.cn/problems/coin-change-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0518.%20%E9%9B%B6%E9%92%B1%E5%85%91%E6%8D%A2%20II.md) | 数组、动态规划 | 中等 | -| 0300 | [最长递增子序列](https://leetcode.cn/problems/longest-increasing-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0300.%20%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E5%AD%90%E5%BA%8F%E5%88%97.md) | 数组、二分查找、动态规划 | 中等 | -| 1143 | [最长公共子序列](https://leetcode.cn/problems/longest-common-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1143.%20%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%AD%90%E5%BA%8F%E5%88%97.md) | 字符串、动态规划 | 中等 | -| 0718 | [最长重复子数组](https://leetcode.cn/problems/maximum-length-of-repeated-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0718.%20%E6%9C%80%E9%95%BF%E9%87%8D%E5%A4%8D%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、二分查找、动态规划、滑动窗口、哈希函数、滚动哈希 | 中等 | -| 0064 | [最小路径和](https://leetcode.cn/problems/minimum-path-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0064.%20%E6%9C%80%E5%B0%8F%E8%B7%AF%E5%BE%84%E5%92%8C.md) | 数组、动态规划、矩阵 | 中等 | -| 0072 | [编辑距离](https://leetcode.cn/problems/edit-distance/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0072.%20%E7%BC%96%E8%BE%91%E8%B7%9D%E7%A6%BB.md) | 字符串、动态规划 | 困难 | -| 0032 | [最长有效括号](https://leetcode.cn/problems/longest-valid-parentheses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0032.%20%E6%9C%80%E9%95%BF%E6%9C%89%E6%95%88%E6%8B%AC%E5%8F%B7.md) | 栈、字符串、动态规划 | 困难 | -| 0221 | [最大正方形](https://leetcode.cn/problems/maximal-square/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0221.%20%E6%9C%80%E5%A4%A7%E6%AD%A3%E6%96%B9%E5%BD%A2.md) | 数组、动态规划、矩阵 | 中等 | -| 0062 | [不同路径](https://leetcode.cn/problems/unique-paths/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0062.%20%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84.md) | 数学、动态规划、组合数学 | 中等 | -| 0063 | [不同路径 II](https://leetcode.cn/problems/unique-paths-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0063.%20%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84%20II.md) | 数组、动态规划、矩阵 | 中等 | -| 0152 | [乘积最大子数组](https://leetcode.cn/problems/maximum-product-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0152.%20%E4%B9%98%E7%A7%AF%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、动态规划 | 中等 | -| 0198 | [打家劫舍](https://leetcode.cn/problems/house-robber/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0198.%20%E6%89%93%E5%AE%B6%E5%8A%AB%E8%88%8D.md) | 数组、动态规划 | 中等 | -| 0213 | [打家劫舍 II](https://leetcode.cn/problems/house-robber-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0213.%20%E6%89%93%E5%AE%B6%E5%8A%AB%E8%88%8D%20II.md) | 数组、动态规划 | 中等 | -| 0091 | [解码方法](https://leetcode.cn/problems/decode-ways/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0091.%20%E8%A7%A3%E7%A0%81%E6%96%B9%E6%B3%95.md) | 字符串、动态规划 | 中等 | -| 0010 | [正则表达式匹配](https://leetcode.cn/problems/regular-expression-matching/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0010.%20%E6%AD%A3%E5%88%99%E8%A1%A8%E8%BE%BE%E5%BC%8F%E5%8C%B9%E9%85%8D.md) | 递归、字符串、动态规划 | 困难 | -| 0678 | [有效的括号字符串](https://leetcode.cn/problems/valid-parenthesis-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0678.%20%E6%9C%89%E6%95%88%E7%9A%84%E6%8B%AC%E5%8F%B7%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 栈、贪心、字符串、动态规划 | 中等 | -| 0045 | [跳跃游戏 II](https://leetcode.cn/problems/jump-game-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0045.%20%E8%B7%B3%E8%B7%83%E6%B8%B8%E6%88%8F%20II.md) | 贪心、数组、动态规划 | 中等 | -| 0673 | [最长递增子序列的个数](https://leetcode.cn/problems/number-of-longest-increasing-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0673.%20%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 树状数组、线段树、数组、动态规划 | 中等 | -| 0139 | [单词拆分](https://leetcode.cn/problems/word-break/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0139.%20%E5%8D%95%E8%AF%8D%E6%8B%86%E5%88%86.md) | 字典树、记忆化搜索、数组、哈希表、字符串、动态规划 | 中等 | -| 0044 | [通配符匹配](https://leetcode.cn/problems/wildcard-matching/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0044.%20%E9%80%9A%E9%85%8D%E7%AC%A6%E5%8C%B9%E9%85%8D.md) | 贪心、递归、字符串、动态规划 | 困难 | -| 0120 | [三角形最小路径和](https://leetcode.cn/problems/triangle/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0120.%20%E4%B8%89%E8%A7%92%E5%BD%A2%E6%9C%80%E5%B0%8F%E8%B7%AF%E5%BE%84%E5%92%8C.md) | 数组、动态规划 | 中等 | -| 0096 | [不同的二叉搜索树](https://leetcode.cn/problems/unique-binary-search-trees/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0096.%20%E4%B8%8D%E5%90%8C%E7%9A%84%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md) | 树、二叉搜索树、数学、动态规划、二叉树 | 中等 | -| 0887 | [鸡蛋掉落](https://leetcode.cn/problems/super-egg-drop/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0887.%20%E9%B8%A1%E8%9B%8B%E6%8E%89%E8%90%BD.md) | 数学、二分查找、动态规划 | 困难 | -| 0097 | [交错字符串](https://leetcode.cn/problems/interleaving-string/) | | 字符串、动态规划 | 中等 | -| 0516 | [最长回文子序列](https://leetcode.cn/problems/longest-palindromic-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0516.%20%E6%9C%80%E9%95%BF%E5%9B%9E%E6%96%87%E5%AD%90%E5%BA%8F%E5%88%97.md) | 字符串、动态规划 | 中等 | - -### 记忆化搜索题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0329 | [矩阵中的最长递增路径](https://leetcode.cn/problems/longest-increasing-path-in-a-matrix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0329.%20%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E8%B7%AF%E5%BE%84.md) | 深度优先搜索、广度优先搜索、图、拓扑排序、记忆化搜索、数组、动态规划、矩阵 | 困难 | - -## 11. 补充题目 - -#### 设计数据结构题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0146 | [LRU 缓存](https://leetcode.cn/problems/lru-cache/) | | 设计、哈希表、链表、双向链表 | 中等 | -| 0460 | [LFU 缓存](https://leetcode.cn/problems/lfu-cache/) | | 设计、哈希表、链表、双向链表 | 困难 | - -#### 数学题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0007 | [整数反转](https://leetcode.cn/problems/reverse-integer/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0007.%20%E6%95%B4%E6%95%B0%E5%8F%8D%E8%BD%AC.md) | 数学 | 中等 | -| 0009 | [回文数](https://leetcode.cn/problems/palindrome-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0009.%20%E5%9B%9E%E6%96%87%E6%95%B0.md) | 数学 | 简单 | -| 剑指 Offer 62 | [圆圈中最后剩下的数字](https://leetcode.cn/problems/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2062.%20%E5%9C%86%E5%9C%88%E4%B8%AD%E6%9C%80%E5%90%8E%E5%89%A9%E4%B8%8B%E7%9A%84%E6%95%B0%E5%AD%97.md) | 递归、数学 | 简单 | -| 0168 | [Excel表列名称](https://leetcode.cn/problems/excel-sheet-column-title/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0168.%20Excel%E8%A1%A8%E5%88%97%E5%90%8D%E7%A7%B0.md) | 数学、字符串 | 简单 | -| 0400 | [第 N 位数字](https://leetcode.cn/problems/nth-digit/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0400.%20%E7%AC%AC%20N%20%E4%BD%8D%E6%95%B0%E5%AD%97.md) | 数学、二分查找 | 中等 | - -#### 模拟题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0008 | [字符串转换整数 (atoi)](https://leetcode.cn/problems/string-to-integer-atoi/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0008.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%BD%AC%E6%8D%A2%E6%95%B4%E6%95%B0%20%28atoi%29.md) | 字符串 | 中等 | -| 0165 | [比较版本号](https://leetcode.cn/problems/compare-version-numbers/) | | 双指针、字符串 | 中等 | -| 0468 | [验证IP地址](https://leetcode.cn/problems/validate-ip-address/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0468.%20%E9%AA%8C%E8%AF%81IP%E5%9C%B0%E5%9D%80.md) | 字符串 | 中等 | -| 0086 | [分隔链表](https://leetcode.cn/problems/partition-list/) | | 链表、双指针 | 中等 | - -#### 前缀和 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0560 | [和为 K 的子数组](https://leetcode.cn/problems/subarray-sum-equals-k/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0560.%20%E5%92%8C%E4%B8%BA%20K%20%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、哈希表、前缀和 | 中等 | - -#### 思维锻炼题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0031 | [下一个排列](https://leetcode.cn/problems/next-permutation/) | | 数组、双指针 | 中等 | -| 0556 | [下一个更大元素 III](https://leetcode.cn/problems/next-greater-element-iii/) | | 数学、双指针、字符串 | 中等 | -| 0470 | [用 Rand7() 实现 Rand10()](https://leetcode.cn/problems/implement-rand10-using-rand7/) | | 数学、拒绝采样、概率与统计、随机化 | 中等 | - - -## 参考资料 - -- 【清单】[CodeTop 企业题库](https://codetop.cc/home) diff --git a/Contents/00.Introduction/08.Algorithms-Overview.md b/Contents/00.Introduction/08.Algorithms-Overview.md deleted file mode 100644 index 3bb31bac..00000000 --- a/Contents/00.Introduction/08.Algorithms-Overview.md +++ /dev/null @@ -1,3 +0,0 @@ -## 1. 数据结构和算法分类 - -## 2. 时间复杂度与数据规模 \ No newline at end of file diff --git a/Contents/00.Introduction/index.md b/Contents/00.Introduction/index.md deleted file mode 100644 index 2cc124f7..00000000 --- a/Contents/00.Introduction/index.md +++ /dev/null @@ -1,9 +0,0 @@ -## 本章内容 - -- [算法与数据结构](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/01.Data-Structures-Algorithms.md) -- [算法复杂度](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/02.Algorithm-Complexity.md) -- [LeetCode 入门与攻略](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/03.LeetCode-Guide.md) -- [LeetCode 题解（字典序排序，850+ 道题解）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/04.Solutions-List.md) -- [LeetCode 题解（按分类排序，推荐刷题列表 ★★★）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/05.Categories-List.md) -- [LeetCode 面试最常考 100 题（按分类排序）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/06.Interview-100-List.md) -- [LeetCode 面试最常考 200 题（按分类排序）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/07.Interview-200-List.md) \ No newline at end of file diff --git a/Contents/01.Array/01.Array-Basic/02.Array-Basic-List.md b/Contents/01.Array/01.Array-Basic/02.Array-Basic-List.md deleted file mode 100644 index eb1b656c..00000000 --- a/Contents/01.Array/01.Array-Basic/02.Array-Basic-List.md +++ /dev/null @@ -1,23 +0,0 @@ -### 数组基础题目 - -#### 数组操作题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0189 | [轮转数组](https://leetcode.cn/problems/rotate-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0189.%20%E8%BD%AE%E8%BD%AC%E6%95%B0%E7%BB%84.md) | 数组、数学、双指针 | 中等 | -| 0066 | [加一](https://leetcode.cn/problems/plus-one/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0066.%20%E5%8A%A0%E4%B8%80.md) | 数组、数学 | 简单 | -| 0724 | [寻找数组的中心下标](https://leetcode.cn/problems/find-pivot-index/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0724.%20%E5%AF%BB%E6%89%BE%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%AD%E5%BF%83%E4%B8%8B%E6%A0%87.md) | 数组、前缀和 | 简单 | -| 0485 | [最大连续 1 的个数](https://leetcode.cn/problems/max-consecutive-ones/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0485.%20%E6%9C%80%E5%A4%A7%E8%BF%9E%E7%BB%AD%201%20%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 数组 | 简单 | -| 0238 | [除自身以外数组的乘积](https://leetcode.cn/problems/product-of-array-except-self/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0238.%20%E9%99%A4%E8%87%AA%E8%BA%AB%E4%BB%A5%E5%A4%96%E6%95%B0%E7%BB%84%E7%9A%84%E4%B9%98%E7%A7%AF.md) | 数组、前缀和 | 中等 | - -#### 二维数组题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0498 | [对角线遍历](https://leetcode.cn/problems/diagonal-traverse/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0498.%20%E5%AF%B9%E8%A7%92%E7%BA%BF%E9%81%8D%E5%8E%86.md) | 数组、矩阵、模拟 | 中等 | -| 0048 | [旋转图像](https://leetcode.cn/problems/rotate-image/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0048.%20%E6%97%8B%E8%BD%AC%E5%9B%BE%E5%83%8F.md) | 数组、数学、矩阵 | 中等 | -| 0073 | [矩阵置零](https://leetcode.cn/problems/set-matrix-zeroes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0073.%20%E7%9F%A9%E9%98%B5%E7%BD%AE%E9%9B%B6.md) | 数组、哈希表、矩阵 | 中等 | -| 0054 | [螺旋矩阵](https://leetcode.cn/problems/spiral-matrix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0054.%20%E8%9E%BA%E6%97%8B%E7%9F%A9%E9%98%B5.md) | 数组、矩阵、模拟 | 中等 | -| 0059 | [螺旋矩阵 II](https://leetcode.cn/problems/spiral-matrix-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0059.%20%E8%9E%BA%E6%97%8B%E7%9F%A9%E9%98%B5%20II.md) | 数组、矩阵、模拟 | 中等 | -| 0289 | [生命游戏](https://leetcode.cn/problems/game-of-life/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0289.%20%E7%94%9F%E5%91%BD%E6%B8%B8%E6%88%8F.md) | 数组、矩阵、模拟 | 中等 | - diff --git a/Contents/01.Array/01.Array-Basic/index.md b/Contents/01.Array/01.Array-Basic/index.md deleted file mode 100644 index 6dad3efd..00000000 --- a/Contents/01.Array/01.Array-Basic/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [数组基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/01.Array-Basic/01.Array-Basic.md) -- [数组基础题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/01.Array-Basic/02.Array-Basic-List.md) \ No newline at end of file diff --git a/Contents/01.Array/02.Array-Sort/11.Array-Sort-List.md b/Contents/01.Array/02.Array-Sort/11.Array-Sort-List.md deleted file mode 100644 index c8b4dbcd..00000000 --- a/Contents/01.Array/02.Array-Sort/11.Array-Sort-List.md +++ /dev/null @@ -1,85 +0,0 @@ -### 排序算法题目 - -#### 冒泡排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 剑指 Offer 45 | [把数组排成最小的数](https://leetcode.cn/problems/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2045.%20%E6%8A%8A%E6%95%B0%E7%BB%84%E6%8E%92%E6%88%90%E6%9C%80%E5%B0%8F%E7%9A%84%E6%95%B0.md) | 贪心、字符串、排序 | 中等 | -| 0283 | [移动零](https://leetcode.cn/problems/move-zeroes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0283.%20%E7%A7%BB%E5%8A%A8%E9%9B%B6.md) | 数组、双指针 | 简单 | - -#### 选择排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0215 | [数组中的第K个最大元素](https://leetcode.cn/problems/kth-largest-element-in-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0215.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E7%AC%ACK%E4%B8%AA%E6%9C%80%E5%A4%A7%E5%85%83%E7%B4%A0.md) | 数组、分治、快速选择、排序、堆（优先队列） | 中等 | - -#### 插入排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0075 | [颜色分类](https://leetcode.cn/problems/sort-colors/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0075.%20%E9%A2%9C%E8%89%B2%E5%88%86%E7%B1%BB.md) | 数组、双指针、排序 | 中等 | - -#### 希尔排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0912 | [排序数组](https://leetcode.cn/problems/sort-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0912.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | -| 0506 | [相对名次](https://leetcode.cn/problems/relative-ranks/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0506.%20%E7%9B%B8%E5%AF%B9%E5%90%8D%E6%AC%A1.md) | 数组、排序、堆（优先队列） | 简单 | - -#### 归并排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0912 | [排序数组](https://leetcode.cn/problems/sort-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0912.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | -| 0088 | [合并两个有序数组](https://leetcode.cn/problems/merge-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0088.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、双指针、排序 | 简单 | -| 剑指 Offer 51 | [数组中的逆序对](https://leetcode.cn/problems/shu-zu-zhong-de-ni-xu-dui-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2051.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%80%86%E5%BA%8F%E5%AF%B9.md) | 树状数组、线段树、数组、二分查找、分治、有序集合、归并排序 | 困难 | -| 0315 | [计算右侧小于当前元素的个数](https://leetcode.cn/problems/count-of-smaller-numbers-after-self/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0315.%20%E8%AE%A1%E7%AE%97%E5%8F%B3%E4%BE%A7%E5%B0%8F%E4%BA%8E%E5%BD%93%E5%89%8D%E5%85%83%E7%B4%A0%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 树状数组、线段树、数组、二分查找、分治、有序集合、归并排序 | 困难 | - -#### 快速排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0912 | [排序数组](https://leetcode.cn/problems/sort-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0912.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | -| 0169 | [多数元素](https://leetcode.cn/problems/majority-element/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0169.%20%E5%A4%9A%E6%95%B0%E5%85%83%E7%B4%A0.md) | 数组、哈希表、分治、计数、排序 | 简单 | - -#### 堆排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0912 | [排序数组](https://leetcode.cn/problems/sort-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0912.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | -| 0215 | [数组中的第K个最大元素](https://leetcode.cn/problems/kth-largest-element-in-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0215.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E7%AC%ACK%E4%B8%AA%E6%9C%80%E5%A4%A7%E5%85%83%E7%B4%A0.md) | 数组、分治、快速选择、排序、堆（优先队列） | 中等 | -| 剑指 Offer 40 | [最小的k个数](https://leetcode.cn/problems/zui-xiao-de-kge-shu-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2040.%20%E6%9C%80%E5%B0%8F%E7%9A%84k%E4%B8%AA%E6%95%B0.md) | 数组、分治、快速选择、排序、堆（优先队列） | 简单 | - -#### 计数排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0912 | [排序数组](https://leetcode.cn/problems/sort-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0912.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | -| 1122 | [数组的相对排序](https://leetcode.cn/problems/relative-sort-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1122.%20%E6%95%B0%E7%BB%84%E7%9A%84%E7%9B%B8%E5%AF%B9%E6%8E%92%E5%BA%8F.md) | 数组、哈希表、计数排序、排序 | 简单 | - -#### 桶排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0912 | [排序数组](https://leetcode.cn/problems/sort-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0912.%20%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | -| 0220 | [存在重复元素 III](https://leetcode.cn/problems/contains-duplicate-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0220.%20%E5%AD%98%E5%9C%A8%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0%20III.md) | 数组、桶排序、有序集合、排序、滑动窗口 | 困难 | -| 0164 | [最大间距](https://leetcode.cn/problems/maximum-gap/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0164.%20%E6%9C%80%E5%A4%A7%E9%97%B4%E8%B7%9D.md) | 数组、桶排序、基数排序、排序 | 困难 | - -#### 基数排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0164 | [最大间距](https://leetcode.cn/problems/maximum-gap/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0164.%20%E6%9C%80%E5%A4%A7%E9%97%B4%E8%B7%9D.md) | 数组、桶排序、基数排序、排序 | 困难 | -| 0561 | [数组拆分](https://leetcode.cn/problems/array-partition/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0561.%20%E6%95%B0%E7%BB%84%E6%8B%86%E5%88%86.md) | 贪心、数组、计数排序、排序 | 简单 | - -#### 其他排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0217 | [存在重复元素](https://leetcode.cn/problems/contains-duplicate/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0217.%20%E5%AD%98%E5%9C%A8%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0.md) | 数组、哈希表、排序 | 简单 | -| 0136 | [只出现一次的数字](https://leetcode.cn/problems/single-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0136.%20%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B0%E5%AD%97.md) | 位运算、数组 | 简单 | -| 0056 | [合并区间](https://leetcode.cn/problems/merge-intervals/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0056.%20%E5%90%88%E5%B9%B6%E5%8C%BA%E9%97%B4.md) | 数组、排序 | 中等 | -| 0179 | [最大数](https://leetcode.cn/problems/largest-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0179.%20%E6%9C%80%E5%A4%A7%E6%95%B0.md) | 贪心、数组、字符串、排序 | 中等 | -| 0384 | [打乱数组](https://leetcode.cn/problems/shuffle-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0384.%20%E6%89%93%E4%B9%B1%E6%95%B0%E7%BB%84.md) | 数组、数学、随机化 | 中等 | -| 剑指 Offer 45 | [把数组排成最小的数](https://leetcode.cn/problems/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2045.%20%E6%8A%8A%E6%95%B0%E7%BB%84%E6%8E%92%E6%88%90%E6%9C%80%E5%B0%8F%E7%9A%84%E6%95%B0.md) | 贪心、字符串、排序 | 中等 | - diff --git a/Contents/01.Array/02.Array-Sort/index.md b/Contents/01.Array/02.Array-Sort/index.md deleted file mode 100644 index 5042bb9a..00000000 --- a/Contents/01.Array/02.Array-Sort/index.md +++ /dev/null @@ -1,13 +0,0 @@ -## 本章内容 - -- [冒泡排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/01.Array-Bubble-Sort.md) -- [选择排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/02.Array-Selection-Sort.md) -- [插入排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/03.Array-Insertion-Sort.md) -- [希尔排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/04.Array-Shell-Sort.md) -- [归并排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/05.Array-Merge-Sort.md) -- [快速排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/06.Array-Quick-Sort.md) -- [堆排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/07.Array-Heap-Sort.md) -- [计数排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/08.Array-Counting-Sort.md) -- [桶排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/09.Array-Bucket-Sort.md) -- [基数排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/10.Array-Radix-Sort.md) -- [数组排序题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/11.Array-Sort-List.md) \ No newline at end of file diff --git a/Contents/01.Array/03.Array-Binary-Search/03.Array-Binary-Search-List.md b/Contents/01.Array/03.Array-Binary-Search/03.Array-Binary-Search-List.md deleted file mode 100644 index 451e6ee3..00000000 --- a/Contents/01.Array/03.Array-Binary-Search/03.Array-Binary-Search-List.md +++ /dev/null @@ -1,53 +0,0 @@ -### 二分查找题目 - -#### 二分下标题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0704 | [二分查找](https://leetcode.cn/problems/binary-search/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0704.%20%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE.md) | 数组、二分查找 | 简单 | -| 0374 | [猜数字大小](https://leetcode.cn/problems/guess-number-higher-or-lower/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0374.%20%E7%8C%9C%E6%95%B0%E5%AD%97%E5%A4%A7%E5%B0%8F.md) | 二分查找、交互 | 简单 | -| 0035 | [搜索插入位置](https://leetcode.cn/problems/search-insert-position/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0035.%20%E6%90%9C%E7%B4%A2%E6%8F%92%E5%85%A5%E4%BD%8D%E7%BD%AE.md) | 数组、二分查找 | 简单 | -| 0034 | [在排序数组中查找元素的第一个和最后一个位置](https://leetcode.cn/problems/find-first-and-last-position-of-element-in-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0034.%20%E5%9C%A8%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9F%A5%E6%89%BE%E5%85%83%E7%B4%A0%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%92%8C%E6%9C%80%E5%90%8E%E4%B8%80%E4%B8%AA%E4%BD%8D%E7%BD%AE.md) | 数组、二分查找 | 中等 | -| 0167 | [两数之和 II - 输入有序数组](https://leetcode.cn/problems/two-sum-ii-input-array-is-sorted/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0167.%20%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C%20II%20-%20%E8%BE%93%E5%85%A5%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、双指针、二分查找 | 中等 | -| 0153 | [寻找旋转排序数组中的最小值](https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0153.%20%E5%AF%BB%E6%89%BE%E6%97%8B%E8%BD%AC%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9C%80%E5%B0%8F%E5%80%BC.md) | 数组、二分查找 | 中等 | -| 0154 | [寻找旋转排序数组中的最小值 II](https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0154.%20%E5%AF%BB%E6%89%BE%E6%97%8B%E8%BD%AC%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9C%80%E5%B0%8F%E5%80%BC%20II.md) | 数组、二分查找 | 困难 | -| 0033 | [搜索旋转排序数组](https://leetcode.cn/problems/search-in-rotated-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0033.%20%E6%90%9C%E7%B4%A2%E6%97%8B%E8%BD%AC%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、二分查找 | 中等 | -| 0081 | [搜索旋转排序数组 II](https://leetcode.cn/problems/search-in-rotated-sorted-array-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0081.%20%E6%90%9C%E7%B4%A2%E6%97%8B%E8%BD%AC%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%20II.md) | 数组、二分查找 | 中等 | -| 0278 | [第一个错误的版本](https://leetcode.cn/problems/first-bad-version/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0278.%20%E7%AC%AC%E4%B8%80%E4%B8%AA%E9%94%99%E8%AF%AF%E7%9A%84%E7%89%88%E6%9C%AC.md) | 二分查找、交互 | 简单 | -| 0162 | [寻找峰值](https://leetcode.cn/problems/find-peak-element/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0162.%20%E5%AF%BB%E6%89%BE%E5%B3%B0%E5%80%BC.md) | 数组、二分查找 | 中等 | -| 0852 | [山脉数组的峰顶索引](https://leetcode.cn/problems/peak-index-in-a-mountain-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0852.%20%E5%B1%B1%E8%84%89%E6%95%B0%E7%BB%84%E7%9A%84%E5%B3%B0%E9%A1%B6%E7%B4%A2%E5%BC%95.md) | 数组、二分查找 | 中等 | -| 1095 | [山脉数组中查找目标值](https://leetcode.cn/problems/find-in-mountain-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1095.%20%E5%B1%B1%E8%84%89%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9F%A5%E6%89%BE%E7%9B%AE%E6%A0%87%E5%80%BC.md) | 数组、二分查找、交互 | 困难 | -| 0744 | [寻找比目标字母大的最小字母](https://leetcode.cn/problems/find-smallest-letter-greater-than-target/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0744.%20%E5%AF%BB%E6%89%BE%E6%AF%94%E7%9B%AE%E6%A0%87%E5%AD%97%E6%AF%8D%E5%A4%A7%E7%9A%84%E6%9C%80%E5%B0%8F%E5%AD%97%E6%AF%8D.md) | 数组、二分查找 | 简单 | -| 0004 | [寻找两个正序数组的中位数](https://leetcode.cn/problems/median-of-two-sorted-arrays/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0004.%20%E5%AF%BB%E6%89%BE%E4%B8%A4%E4%B8%AA%E6%AD%A3%E5%BA%8F%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0.md) | 数组、二分查找、分治 | 困难 | -| 0074 | [搜索二维矩阵](https://leetcode.cn/problems/search-a-2d-matrix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0074.%20%E6%90%9C%E7%B4%A2%E4%BA%8C%E7%BB%B4%E7%9F%A9%E9%98%B5.md) | 数组、二分查找、矩阵 | 中等 | -| 0240 | [搜索二维矩阵 II](https://leetcode.cn/problems/search-a-2d-matrix-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0240.%20%E6%90%9C%E7%B4%A2%E4%BA%8C%E7%BB%B4%E7%9F%A9%E9%98%B5%20II.md) | 数组、二分查找、分治、矩阵 | 中等 | - -#### 二分答案题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0069 | [x 的平方根](https://leetcode.cn/problems/sqrtx/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0069.%20x%20%E7%9A%84%E5%B9%B3%E6%96%B9%E6%A0%B9.md) | 数学、二分查找 | 简单 | -| 0287 | [寻找重复数](https://leetcode.cn/problems/find-the-duplicate-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0287.%20%E5%AF%BB%E6%89%BE%E9%87%8D%E5%A4%8D%E6%95%B0.md) | 位运算、数组、双指针、二分查找 | 中等 | -| 0050 | [Pow(x, n)](https://leetcode.cn/problems/powx-n/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0050.%20Pow%28x%2C%20n%29.md) | 递归、数学 | 中等 | -| 0367 | [有效的完全平方数](https://leetcode.cn/problems/valid-perfect-square/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0367.%20%E6%9C%89%E6%95%88%E7%9A%84%E5%AE%8C%E5%85%A8%E5%B9%B3%E6%96%B9%E6%95%B0.md) | 数学、二分查找 | 简单 | -| 1300 | [转变数组后最接近目标值的数组和](https://leetcode.cn/problems/sum-of-mutated-array-closest-to-target/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1300.%20%E8%BD%AC%E5%8F%98%E6%95%B0%E7%BB%84%E5%90%8E%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9B%AE%E6%A0%87%E5%80%BC%E7%9A%84%E6%95%B0%E7%BB%84%E5%92%8C.md) | 数组、二分查找、排序 | 中等 | -| 0400 | [第 N 位数字](https://leetcode.cn/problems/nth-digit/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0400.%20%E7%AC%AC%20N%20%E4%BD%8D%E6%95%B0%E5%AD%97.md) | 数学、二分查找 | 中等 | - -#### 复杂的二分查找问题 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0875 | [爱吃香蕉的珂珂](https://leetcode.cn/problems/koko-eating-bananas/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0875.%20%E7%88%B1%E5%90%83%E9%A6%99%E8%95%89%E7%9A%84%E7%8F%82%E7%8F%82.md) | 数组、二分查找 | 中等 | -| 0410 | [分割数组的最大值](https://leetcode.cn/problems/split-array-largest-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0410.%20%E5%88%86%E5%89%B2%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md) | 贪心、数组、二分查找、动态规划、前缀和 | 困难 | -| 0209 | [长度最小的子数组](https://leetcode.cn/problems/minimum-size-subarray-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0209.%20%E9%95%BF%E5%BA%A6%E6%9C%80%E5%B0%8F%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、二分查找、前缀和、滑动窗口 | 中等 | -| 0658 | [找到 K 个最接近的元素](https://leetcode.cn/problems/find-k-closest-elements/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0658.%20%E6%89%BE%E5%88%B0%20K%20%E4%B8%AA%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9A%84%E5%85%83%E7%B4%A0.md) | 数组、双指针、二分查找、排序、滑动窗口、堆（优先队列） | 中等 | -| 0270 | [最接近的二叉搜索树值](https://leetcode.cn/problems/closest-binary-search-tree-value/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0270.%20%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9A%84%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E5%80%BC.md) | 树、深度优先搜索、二叉搜索树、二分查找、二叉树 | 简单 | -| 0702 | [搜索长度未知的有序数组](https://leetcode.cn/problems/search-in-a-sorted-array-of-unknown-size/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0702.%20%E6%90%9C%E7%B4%A2%E9%95%BF%E5%BA%A6%E6%9C%AA%E7%9F%A5%E7%9A%84%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、二分查找、交互 | 中等 | -| 0349 | [两个数组的交集](https://leetcode.cn/problems/intersection-of-two-arrays/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0349.%20%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E7%9A%84%E4%BA%A4%E9%9B%86.md) | 数组、哈希表、双指针、二分查找、排序 | 简单 | -| 0350 | [两个数组的交集 II](https://leetcode.cn/problems/intersection-of-two-arrays-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0350.%20%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E7%9A%84%E4%BA%A4%E9%9B%86%20II.md) | 数组、哈希表、双指针、二分查找、排序 | 简单 | -| 0287 | [寻找重复数](https://leetcode.cn/problems/find-the-duplicate-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0287.%20%E5%AF%BB%E6%89%BE%E9%87%8D%E5%A4%8D%E6%95%B0.md) | 位运算、数组、双指针、二分查找 | 中等 | -| 0719 | [找出第 K 小的数对距离](https://leetcode.cn/problems/find-k-th-smallest-pair-distance/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0719.%20%E6%89%BE%E5%87%BA%E7%AC%AC%20K%20%E5%B0%8F%E7%9A%84%E6%95%B0%E5%AF%B9%E8%B7%9D%E7%A6%BB.md) | 数组、双指针、二分查找、排序 | 困难 | -| 0259 | [较小的三数之和](https://leetcode.cn/problems/3sum-smaller/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0259.%20%E8%BE%83%E5%B0%8F%E7%9A%84%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、双指针、二分查找、排序 | 中等 | -| 1011 | [在 D 天内送达包裹的能力](https://leetcode.cn/problems/capacity-to-ship-packages-within-d-days/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1011.%20%E5%9C%A8%20D%20%E5%A4%A9%E5%86%85%E9%80%81%E8%BE%BE%E5%8C%85%E8%A3%B9%E7%9A%84%E8%83%BD%E5%8A%9B.md) | 数组、二分查找 | 中等 | -| 1482 | [制作 m 束花所需的最少天数](https://leetcode.cn/problems/minimum-number-of-days-to-make-m-bouquets/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1482.%20%E5%88%B6%E4%BD%9C%20m%20%E6%9D%9F%E8%8A%B1%E6%89%80%E9%9C%80%E7%9A%84%E6%9C%80%E5%B0%91%E5%A4%A9%E6%95%B0.md) | 数组、二分查找 | 中等 | - diff --git a/Contents/01.Array/03.Array-Binary-Search/index.md b/Contents/01.Array/03.Array-Binary-Search/index.md deleted file mode 100644 index 5b261ffb..00000000 --- a/Contents/01.Array/03.Array-Binary-Search/index.md +++ /dev/null @@ -1,5 +0,0 @@ -## 本章内容 - -- [二分查找知识（一）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/03.Array-Binary-Search/01.Array-Binary-Search-01.md) -- [二分查找知识（二）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/03.Array-Binary-Search/02.Array-Binary-Search-02.md) -- [二分查找题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/03.Array-Binary-Search/03.Array-Binary-Search-List.md) \ No newline at end of file diff --git a/Contents/01.Array/04.Array-Two-Pointers/02.Array-Two-Pointers-List.md b/Contents/01.Array/04.Array-Two-Pointers/02.Array-Two-Pointers-List.md deleted file mode 100644 index d7aa78fe..00000000 --- a/Contents/01.Array/04.Array-Two-Pointers/02.Array-Two-Pointers-List.md +++ /dev/null @@ -1,51 +0,0 @@ -### 双指针题目 - -#### 对撞指针题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0167 | [两数之和 II - 输入有序数组](https://leetcode.cn/problems/two-sum-ii-input-array-is-sorted/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0167.%20%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C%20II%20-%20%E8%BE%93%E5%85%A5%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、双指针、二分查找 | 中等 | -| 0344 | [反转字符串](https://leetcode.cn/problems/reverse-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0344.%20%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 双指针、字符串 | 简单 | -| 0345 | [反转字符串中的元音字母](https://leetcode.cn/problems/reverse-vowels-of-a-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0345.%20%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%85%83%E9%9F%B3%E5%AD%97%E6%AF%8D.md) | 双指针、字符串 | 简单 | -| 0125 | [验证回文串](https://leetcode.cn/problems/valid-palindrome/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0125.%20%E9%AA%8C%E8%AF%81%E5%9B%9E%E6%96%87%E4%B8%B2.md) | 双指针、字符串 | 简单 | -| 0011 | [盛最多水的容器](https://leetcode.cn/problems/container-with-most-water/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0011.%20%E7%9B%9B%E6%9C%80%E5%A4%9A%E6%B0%B4%E7%9A%84%E5%AE%B9%E5%99%A8.md) | 贪心、数组、双指针 | 中等 | -| 0611 | [有效三角形的个数](https://leetcode.cn/problems/valid-triangle-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0611.%20%E6%9C%89%E6%95%88%E4%B8%89%E8%A7%92%E5%BD%A2%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 贪心、数组、双指针、二分查找、排序 | 中等 | -| 0015 | [三数之和](https://leetcode.cn/problems/3sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0015.%20%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、双指针、排序 | 中等 | -| 0016 | [最接近的三数之和](https://leetcode.cn/problems/3sum-closest/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0016.%20%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9A%84%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、双指针、排序 | 中等 | -| 0018 | [四数之和](https://leetcode.cn/problems/4sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0018.%20%E5%9B%9B%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、双指针、排序 | 中等 | -| 0259 | [较小的三数之和](https://leetcode.cn/problems/3sum-smaller/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0259.%20%E8%BE%83%E5%B0%8F%E7%9A%84%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、双指针、二分查找、排序 | 中等 | -| 0658 | [找到 K 个最接近的元素](https://leetcode.cn/problems/find-k-closest-elements/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0658.%20%E6%89%BE%E5%88%B0%20K%20%E4%B8%AA%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9A%84%E5%85%83%E7%B4%A0.md) | 数组、双指针、二分查找、排序、滑动窗口、堆（优先队列） | 中等 | -| 1099 | [小于 K 的两数之和](https://leetcode.cn/problems/two-sum-less-than-k/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1099.%20%E5%B0%8F%E4%BA%8E%20K%20%E7%9A%84%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、双指针、二分查找、排序 | 简单 | -| 0075 | [颜色分类](https://leetcode.cn/problems/sort-colors/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0075.%20%E9%A2%9C%E8%89%B2%E5%88%86%E7%B1%BB.md) | 数组、双指针、排序 | 中等 | -| 0360 | [有序转化数组](https://leetcode.cn/problems/sort-transformed-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0360.%20%E6%9C%89%E5%BA%8F%E8%BD%AC%E5%8C%96%E6%95%B0%E7%BB%84.md) | 数组、数学、双指针、排序 | 中等 | -| 0977 | [有序数组的平方](https://leetcode.cn/problems/squares-of-a-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0977.%20%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E7%9A%84%E5%B9%B3%E6%96%B9.md) | 数组、双指针、排序 | 简单 | -| 0881 | [救生艇](https://leetcode.cn/problems/boats-to-save-people/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0881.%20%E6%95%91%E7%94%9F%E8%89%87.md) | 贪心、数组、双指针、排序 | 中等 | -| 0042 | [接雨水](https://leetcode.cn/problems/trapping-rain-water/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0042.%20%E6%8E%A5%E9%9B%A8%E6%B0%B4.md) | 栈、数组、双指针、动态规划、单调栈 | 困难 | -| 0443 | [压缩字符串](https://leetcode.cn/problems/string-compression/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0443.%20%E5%8E%8B%E7%BC%A9%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 双指针、字符串 | 中等 | - -#### 快慢指针题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0026 | [删除有序数组中的重复项](https://leetcode.cn/problems/remove-duplicates-from-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0026.%20%E5%88%A0%E9%99%A4%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E9%A1%B9.md) | 数组、双指针 | 简单 | -| 0080 | [删除有序数组中的重复项 II](https://leetcode.cn/problems/remove-duplicates-from-sorted-array-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0080.%20%E5%88%A0%E9%99%A4%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E9%A1%B9%20II.md) | 数组、双指针 | 中等 | -| 0027 | [移除元素](https://leetcode.cn/problems/remove-element/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0027.%20%E7%A7%BB%E9%99%A4%E5%85%83%E7%B4%A0.md) | 数组、双指针 | 简单 | -| 0283 | [移动零](https://leetcode.cn/problems/move-zeroes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0283.%20%E7%A7%BB%E5%8A%A8%E9%9B%B6.md) | 数组、双指针 | 简单 | -| 0845 | [数组中的最长山脉](https://leetcode.cn/problems/longest-mountain-in-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0845.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9C%80%E9%95%BF%E5%B1%B1%E8%84%89.md) | 数组、双指针、动态规划、枚举 | 中等 | -| 0088 | [合并两个有序数组](https://leetcode.cn/problems/merge-sorted-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0088.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84.md) | 数组、双指针、排序 | 简单 | -| 0719 | [找出第 K 小的数对距离](https://leetcode.cn/problems/find-k-th-smallest-pair-distance/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0719.%20%E6%89%BE%E5%87%BA%E7%AC%AC%20K%20%E5%B0%8F%E7%9A%84%E6%95%B0%E5%AF%B9%E8%B7%9D%E7%A6%BB.md) | 数组、双指针、二分查找、排序 | 困难 | -| 0334 | [递增的三元子序列](https://leetcode.cn/problems/increasing-triplet-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0334.%20%E9%80%92%E5%A2%9E%E7%9A%84%E4%B8%89%E5%85%83%E5%AD%90%E5%BA%8F%E5%88%97.md) | 贪心、数组 | 中等 | -| 0978 | [最长湍流子数组](https://leetcode.cn/problems/longest-turbulent-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0978.%20%E6%9C%80%E9%95%BF%E6%B9%8D%E6%B5%81%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、动态规划、滑动窗口 | 中等 | -| 剑指 Offer 21 | [调整数组顺序使奇数位于偶数前面](https://leetcode.cn/problems/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2021.%20%E8%B0%83%E6%95%B4%E6%95%B0%E7%BB%84%E9%A1%BA%E5%BA%8F%E4%BD%BF%E5%A5%87%E6%95%B0%E4%BD%8D%E4%BA%8E%E5%81%B6%E6%95%B0%E5%89%8D%E9%9D%A2.md) | 数组、双指针、排序 | 简单 | - -#### 分离双指针题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0350 | [两个数组的交集 II](https://leetcode.cn/problems/intersection-of-two-arrays-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0350.%20%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E7%9A%84%E4%BA%A4%E9%9B%86%20II.md) | 数组、哈希表、双指针、二分查找、排序 | 简单 | -| 0925 | [长按键入](https://leetcode.cn/problems/long-pressed-name/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0925.%20%E9%95%BF%E6%8C%89%E9%94%AE%E5%85%A5.md) | 双指针、字符串 | 简单 | -| 0844 | [比较含退格的字符串](https://leetcode.cn/problems/backspace-string-compare/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0844.%20%E6%AF%94%E8%BE%83%E5%90%AB%E9%80%80%E6%A0%BC%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 栈、双指针、字符串、模拟 | 简单 | -| 1229 | [安排会议日程](https://leetcode.cn/problems/meeting-scheduler/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1229.%20%E5%AE%89%E6%8E%92%E4%BC%9A%E8%AE%AE%E6%97%A5%E7%A8%8B.md) | 数组、双指针、排序 | 中等 | -| 0415 | [字符串相加](https://leetcode.cn/problems/add-strings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0415.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E5%8A%A0.md) | 数学、字符串、模拟 | 简单 | -| 0392 | [判断子序列](https://leetcode.cn/problems/is-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0392.%20%E5%88%A4%E6%96%AD%E5%AD%90%E5%BA%8F%E5%88%97.md) | 双指针、字符串、动态规划 | 简单 | - diff --git a/Contents/01.Array/04.Array-Two-Pointers/index.md b/Contents/01.Array/04.Array-Two-Pointers/index.md deleted file mode 100644 index a0f281c8..00000000 --- a/Contents/01.Array/04.Array-Two-Pointers/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [数组双指针知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/04.Array-Two-Pointers/01.Array-Two-Pointers.md) -- [数组双指针题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/04.Array-Two-Pointers/02.Array-Two-Pointers-List.md) \ No newline at end of file diff --git a/Contents/01.Array/05.Array-Sliding-Window/02.Array-Sliding-Window-List.md b/Contents/01.Array/05.Array-Sliding-Window/02.Array-Sliding-Window-List.md deleted file mode 100644 index 9d613a70..00000000 --- a/Contents/01.Array/05.Array-Sliding-Window/02.Array-Sliding-Window-List.md +++ /dev/null @@ -1,50 +0,0 @@ -### 滑动窗口题目 - -#### 固定长度窗口题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 1343 | [大小为 K 且平均值大于等于阈值的子数组数目](https://leetcode.cn/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1343.%20%E5%A4%A7%E5%B0%8F%E4%B8%BA%20K%20%E4%B8%94%E5%B9%B3%E5%9D%87%E5%80%BC%E5%A4%A7%E4%BA%8E%E7%AD%89%E4%BA%8E%E9%98%88%E5%80%BC%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84%E6%95%B0%E7%9B%AE.md) | 数组、滑动窗口 | 中等 | -| 0643 | [子数组最大平均数 I](https://leetcode.cn/problems/maximum-average-subarray-i/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0643.%20%E5%AD%90%E6%95%B0%E7%BB%84%E6%9C%80%E5%A4%A7%E5%B9%B3%E5%9D%87%E6%95%B0%20I.md) | 数组、滑动窗口 | 简单 | -| 1052 | [爱生气的书店老板](https://leetcode.cn/problems/grumpy-bookstore-owner/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1052.%20%E7%88%B1%E7%94%9F%E6%B0%94%E7%9A%84%E4%B9%A6%E5%BA%97%E8%80%81%E6%9D%BF.md) | 数组、滑动窗口 | 中等 | -| 1423 | [可获得的最大点数](https://leetcode.cn/problems/maximum-points-you-can-obtain-from-cards/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1423.%20%E5%8F%AF%E8%8E%B7%E5%BE%97%E7%9A%84%E6%9C%80%E5%A4%A7%E7%82%B9%E6%95%B0.md) | 数组、前缀和、滑动窗口 | 中等 | -| 1456 | [定长子串中元音的最大数目](https://leetcode.cn/problems/maximum-number-of-vowels-in-a-substring-of-given-length/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1456.%20%E5%AE%9A%E9%95%BF%E5%AD%90%E4%B8%B2%E4%B8%AD%E5%85%83%E9%9F%B3%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E7%9B%AE.md) | 字符串、滑动窗口 | 中等 | -| 0567 | [字符串的排列](https://leetcode.cn/problems/permutation-in-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0567.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%8E%92%E5%88%97.md) | 哈希表、双指针、字符串、滑动窗口 | 中等 | -| 1100 | [长度为 K 的无重复字符子串](https://leetcode.cn/problems/find-k-length-substrings-with-no-repeated-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1100.%20%E9%95%BF%E5%BA%A6%E4%B8%BA%20K%20%E7%9A%84%E6%97%A0%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E5%AD%90%E4%B8%B2.md) | 哈希表、字符串、滑动窗口 | 中等 | -| 1151 | [最少交换次数来组合所有的 1](https://leetcode.cn/problems/minimum-swaps-to-group-all-1s-together/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1151.%20%E6%9C%80%E5%B0%91%E4%BA%A4%E6%8D%A2%E6%AC%A1%E6%95%B0%E6%9D%A5%E7%BB%84%E5%90%88%E6%89%80%E6%9C%89%E7%9A%84%201.md) | 数组、滑动窗口 | 中等 | -| 1176 | [健身计划评估](https://leetcode.cn/problems/diet-plan-performance/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1176.%20%E5%81%A5%E8%BA%AB%E8%AE%A1%E5%88%92%E8%AF%84%E4%BC%B0.md) | 数组、滑动窗口 | 简单 | -| 0438 | [找到字符串中所有字母异位词](https://leetcode.cn/problems/find-all-anagrams-in-a-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0438.%20%E6%89%BE%E5%88%B0%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E6%89%80%E6%9C%89%E5%AD%97%E6%AF%8D%E5%BC%82%E4%BD%8D%E8%AF%8D.md) | 哈希表、字符串、滑动窗口 | 中等 | -| 0995 | [K 连续位的最小翻转次数](https://leetcode.cn/problems/minimum-number-of-k-consecutive-bit-flips/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0995.%20K%20%E8%BF%9E%E7%BB%AD%E4%BD%8D%E7%9A%84%E6%9C%80%E5%B0%8F%E7%BF%BB%E8%BD%AC%E6%AC%A1%E6%95%B0.md) | 位运算、队列、数组、前缀和、滑动窗口 | 困难 | -| 0683 | [K 个关闭的灯泡](https://leetcode.cn/problems/k-empty-slots/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0683.%20K%20%E4%B8%AA%E5%85%B3%E9%97%AD%E7%9A%84%E7%81%AF%E6%B3%A1.md) | 树状数组、数组、有序集合、滑动窗口 | 困难 | -| 0220 | [存在重复元素 III](https://leetcode.cn/problems/contains-duplicate-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0220.%20%E5%AD%98%E5%9C%A8%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0%20III.md) | 数组、桶排序、有序集合、排序、滑动窗口 | 困难 | -| 0239 | [滑动窗口最大值](https://leetcode.cn/problems/sliding-window-maximum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0239.%20%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E6%9C%80%E5%A4%A7%E5%80%BC.md) | 队列、数组、滑动窗口、单调队列、堆（优先队列） | 困难 | -| 0480 | [滑动窗口中位数](https://leetcode.cn/problems/sliding-window-median/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0480.%20%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E4%B8%AD%E4%BD%8D%E6%95%B0.md) | 数组、哈希表、滑动窗口、堆（优先队列） | 困难 | - -#### 不定长度窗口题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0674 | [最长连续递增序列](https://leetcode.cn/problems/longest-continuous-increasing-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0674.%20%E6%9C%80%E9%95%BF%E8%BF%9E%E7%BB%AD%E9%80%92%E5%A2%9E%E5%BA%8F%E5%88%97.md) | 数组 | 简单 | -| 0485 | [最大连续 1 的个数](https://leetcode.cn/problems/max-consecutive-ones/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0485.%20%E6%9C%80%E5%A4%A7%E8%BF%9E%E7%BB%AD%201%20%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 数组 | 简单 | -| 0487 | [最大连续1的个数 II](https://leetcode.cn/problems/max-consecutive-ones-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0487.%20%E6%9C%80%E5%A4%A7%E8%BF%9E%E7%BB%AD1%E7%9A%84%E4%B8%AA%E6%95%B0%20II.md) | 数组、动态规划、滑动窗口 | 中等 | -| 0076 | [最小覆盖子串](https://leetcode.cn/problems/minimum-window-substring/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0076.%20%E6%9C%80%E5%B0%8F%E8%A6%86%E7%9B%96%E5%AD%90%E4%B8%B2.md) | 哈希表、字符串、滑动窗口 | 困难 | -| 0718 | [最长重复子数组](https://leetcode.cn/problems/maximum-length-of-repeated-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0718.%20%E6%9C%80%E9%95%BF%E9%87%8D%E5%A4%8D%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、二分查找、动态规划、滑动窗口、哈希函数、滚动哈希 | 中等 | -| 0209 | [长度最小的子数组](https://leetcode.cn/problems/minimum-size-subarray-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0209.%20%E9%95%BF%E5%BA%A6%E6%9C%80%E5%B0%8F%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、二分查找、前缀和、滑动窗口 | 中等 | -| 1004 | [最大连续1的个数 III](https://leetcode.cn/problems/max-consecutive-ones-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1004.%20%E6%9C%80%E5%A4%A7%E8%BF%9E%E7%BB%AD1%E7%9A%84%E4%B8%AA%E6%95%B0%20III.md) | 数组、二分查找、前缀和、滑动窗口 | 中等 | -| 1658 | [将 x 减到 0 的最小操作数](https://leetcode.cn/problems/minimum-operations-to-reduce-x-to-zero/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1658.%20%E5%B0%86%20x%20%E5%87%8F%E5%88%B0%200%20%E7%9A%84%E6%9C%80%E5%B0%8F%E6%93%8D%E4%BD%9C%E6%95%B0.md) | 数组、哈希表、二分查找、前缀和、滑动窗口 | 中等 | -| 0424 | [替换后的最长重复字符](https://leetcode.cn/problems/longest-repeating-character-replacement/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0424.%20%E6%9B%BF%E6%8D%A2%E5%90%8E%E7%9A%84%E6%9C%80%E9%95%BF%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6.md) | 哈希表、字符串、滑动窗口 | 中等 | -| 0003 | [无重复字符的最长子串](https://leetcode.cn/problems/longest-substring-without-repeating-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0003.%20%E6%97%A0%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2.md) | 哈希表、字符串、滑动窗口 | 中等 | -| 1695 | [删除子数组的最大得分](https://leetcode.cn/problems/maximum-erasure-value/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1695.%20%E5%88%A0%E9%99%A4%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%BE%97%E5%88%86.md) | 数组、哈希表、滑动窗口 | 中等 | -| 1208 | [尽可能使字符串相等](https://leetcode.cn/problems/get-equal-substrings-within-budget/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1208.%20%E5%B0%BD%E5%8F%AF%E8%83%BD%E4%BD%BF%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E7%AD%89.md) | 字符串、二分查找、前缀和、滑动窗口 | 中等 | -| 1493 | [删掉一个元素以后全为 1 的最长子数组](https://leetcode.cn/problems/longest-subarray-of-1s-after-deleting-one-element/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1493.%20%E5%88%A0%E6%8E%89%E4%B8%80%E4%B8%AA%E5%85%83%E7%B4%A0%E4%BB%A5%E5%90%8E%E5%85%A8%E4%B8%BA%201%20%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、动态规划、滑动窗口 | 中等 | -| 0727 | [最小窗口子序列](https://leetcode.cn/problems/minimum-window-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0727.%20%E6%9C%80%E5%B0%8F%E7%AA%97%E5%8F%A3%E5%AD%90%E5%BA%8F%E5%88%97.md) | 字符串、动态规划、滑动窗口 | 困难 | -| 0159 | [至多包含两个不同字符的最长子串](https://leetcode.cn/problems/longest-substring-with-at-most-two-distinct-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0159.%20%E8%87%B3%E5%A4%9A%E5%8C%85%E5%90%AB%E4%B8%A4%E4%B8%AA%E4%B8%8D%E5%90%8C%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2.md) | 哈希表、字符串、滑动窗口 | 中等 | -| 0340 | [至多包含 K 个不同字符的最长子串](https://leetcode.cn/problems/longest-substring-with-at-most-k-distinct-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0340.%20%E8%87%B3%E5%A4%9A%E5%8C%85%E5%90%AB%20K%20%E4%B8%AA%E4%B8%8D%E5%90%8C%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2.md) | 哈希表、字符串、滑动窗口 | 中等 | -| 0795 | [区间子数组个数](https://leetcode.cn/problems/number-of-subarrays-with-bounded-maximum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0795.%20%E5%8C%BA%E9%97%B4%E5%AD%90%E6%95%B0%E7%BB%84%E4%B8%AA%E6%95%B0.md) | 数组、双指针 | 中等 | -| 0992 | [K 个不同整数的子数组](https://leetcode.cn/problems/subarrays-with-k-different-integers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0992.%20K%20%E4%B8%AA%E4%B8%8D%E5%90%8C%E6%95%B4%E6%95%B0%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、哈希表、计数、滑动窗口 | 困难 | -| 0713 | [乘积小于 K 的子数组](https://leetcode.cn/problems/subarray-product-less-than-k/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0713.%20%E4%B9%98%E7%A7%AF%E5%B0%8F%E4%BA%8E%20K%20%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、滑动窗口 | 中等 | -| 0904 | [水果成篮](https://leetcode.cn/problems/fruit-into-baskets/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0904.%20%E6%B0%B4%E6%9E%9C%E6%88%90%E7%AF%AE.md) | 数组、哈希表、滑动窗口 | 中等 | -| 1358 | [包含所有三种字符的子字符串数目](https://leetcode.cn/problems/number-of-substrings-containing-all-three-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1358.%20%E5%8C%85%E5%90%AB%E6%89%80%E6%9C%89%E4%B8%89%E7%A7%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%95%B0%E7%9B%AE.md) | 哈希表、字符串、滑动窗口 | 中等 | -| 0467 | [环绕字符串中唯一的子字符串](https://leetcode.cn/problems/unique-substrings-in-wraparound-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0467.%20%E7%8E%AF%E7%BB%95%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E5%94%AF%E4%B8%80%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 字符串、动态规划 | 中等 | -| 1438 | [绝对差不超过限制的最长连续子数组](https://leetcode.cn/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1438.%20%E7%BB%9D%E5%AF%B9%E5%B7%AE%E4%B8%8D%E8%B6%85%E8%BF%87%E9%99%90%E5%88%B6%E7%9A%84%E6%9C%80%E9%95%BF%E8%BF%9E%E7%BB%AD%E5%AD%90%E6%95%B0%E7%BB%84.md) | 队列、数组、有序集合、滑动窗口、单调队列、堆（优先队列） | 中等 | - diff --git a/Contents/01.Array/05.Array-Sliding-Window/index.md b/Contents/01.Array/05.Array-Sliding-Window/index.md deleted file mode 100644 index 2d29fdfb..00000000 --- a/Contents/01.Array/05.Array-Sliding-Window/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [数组滑动窗口知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/05.Array-Sliding-Window/01.Array-Sliding-Window.md) -- [数组滑动窗口题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/05.Array-Sliding-Window/02.Array-Sliding-Window-List.md) \ No newline at end of file diff --git a/Contents/01.Array/index.md b/Contents/01.Array/index.md deleted file mode 100644 index 35f35190..00000000 --- a/Contents/01.Array/index.md +++ /dev/null @@ -1,36 +0,0 @@ -## 本章内容 - -### 数组基础知识 - -- [数组基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/01.Array-Basic/01.Array-Basic.md) -- [数组基础题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/01.Array-Basic/02.Array-Basic-List.md) - -### 数组排序算法 - -- [冒泡排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/01.Array-Bubble-Sort.md) -- [选择排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/02.Array-Selection-Sort.md) -- [插入排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/03.Array-Insertion-Sort.md) -- [希尔排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/04.Array-Shell-Sort.md) -- [归并排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/05.Array-Merge-Sort.md) -- [快速排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/06.Array-Quick-Sort.md) -- [堆排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/07.Array-Heap-Sort.md) -- [计数排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/08.Array-Counting-Sort.md) -- [桶排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/09.Array-Bucket-Sort.md) -- [基数排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/10.Array-Radix-Sort.md) -- [数组排序题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/11.Array-Sort-List.md) - -### 二分查找 - -- [二分查找知识（一）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/03.Array-Binary-Search/01.Array-Binary-Search-01.md) -- [二分查找知识（二）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/03.Array-Binary-Search/02.Array-Binary-Search-02.md) -- [二分查找题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/03.Array-Binary-Search/03.Array-Binary-Search-List.md) - -### 数组双指针 - -- [数组双指针知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/04.Array-Two-Pointers/01.Array-Two-Pointers.md) -- [数组双指针题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/04.Array-Two-Pointers/02.Array-Two-Pointers-List.md) - -### 数组滑动窗口 - -- [数组滑动窗口知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/05.Array-Sliding-Window/01.Array-Sliding-Window.md) -- [数组滑动窗口题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/05.Array-Sliding-Window/02.Array-Sliding-Window-List.md) \ No newline at end of file diff --git a/Contents/02.Linked-List/01.Linked-List-Basic/02.Linked-List-Basic-List.md b/Contents/02.Linked-List/01.Linked-List-Basic/02.Linked-List-Basic-List.md deleted file mode 100644 index b7018994..00000000 --- a/Contents/02.Linked-List/01.Linked-List-Basic/02.Linked-List-Basic-List.md +++ /dev/null @@ -1,17 +0,0 @@ -### 链表经典题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0707 | [设计链表](https://leetcode.cn/problems/design-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0707.%20%E8%AE%BE%E8%AE%A1%E9%93%BE%E8%A1%A8.md) | 设计、链表 | 中等 | -| 0083 | [删除排序链表中的重复元素](https://leetcode.cn/problems/remove-duplicates-from-sorted-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0083.%20%E5%88%A0%E9%99%A4%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0.md) | 链表 | 简单 | -| 0082 | [删除排序链表中的重复元素 II](https://leetcode.cn/problems/remove-duplicates-from-sorted-list-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0082.%20%E5%88%A0%E9%99%A4%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0%20II.md) | 链表、双指针 | 中等 | -| 0206 | [反转链表](https://leetcode.cn/problems/reverse-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0206.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8.md) | 递归、链表 | 简单 | -| 0092 | [反转链表 II](https://leetcode.cn/problems/reverse-linked-list-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0092.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8%20II.md) | 链表 | 中等 | -| 0025 | [K 个一组翻转链表](https://leetcode.cn/problems/reverse-nodes-in-k-group/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0025.%20K%20%E4%B8%AA%E4%B8%80%E7%BB%84%E7%BF%BB%E8%BD%AC%E9%93%BE%E8%A1%A8.md) | 递归、链表 | 困难 | -| 0203 | [移除链表元素](https://leetcode.cn/problems/remove-linked-list-elements/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0203.%20%E7%A7%BB%E9%99%A4%E9%93%BE%E8%A1%A8%E5%85%83%E7%B4%A0.md) | 递归、链表 | 简单 | -| 0328 | [奇偶链表](https://leetcode.cn/problems/odd-even-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0328.%20%E5%A5%87%E5%81%B6%E9%93%BE%E8%A1%A8.md) | 链表 | 中等 | -| 0234 | [回文链表](https://leetcode.cn/problems/palindrome-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0234.%20%E5%9B%9E%E6%96%87%E9%93%BE%E8%A1%A8.md) | 栈、递归、链表、双指针 | 简单 | -| 0430 | [扁平化多级双向链表](https://leetcode.cn/problems/flatten-a-multilevel-doubly-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0430.%20%E6%89%81%E5%B9%B3%E5%8C%96%E5%A4%9A%E7%BA%A7%E5%8F%8C%E5%90%91%E9%93%BE%E8%A1%A8.md) | 深度优先搜索、链表、双向链表 | 中等 | -| 0138 | [复制带随机指针的链表](https://leetcode.cn/problems/copy-list-with-random-pointer/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0138.%20%E5%A4%8D%E5%88%B6%E5%B8%A6%E9%9A%8F%E6%9C%BA%E6%8C%87%E9%92%88%E7%9A%84%E9%93%BE%E8%A1%A8.md) | 哈希表、链表 | 中等 | -| 0061 | [旋转链表](https://leetcode.cn/problems/rotate-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0061.%20%E6%97%8B%E8%BD%AC%E9%93%BE%E8%A1%A8.md) | 链表、双指针 | 中等 | - diff --git a/Contents/02.Linked-List/01.Linked-List-Basic/index.md b/Contents/02.Linked-List/01.Linked-List-Basic/index.md deleted file mode 100644 index c8f1269c..00000000 --- a/Contents/02.Linked-List/01.Linked-List-Basic/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [链表基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/01.Linked-List-Basic/01.Linked-List-Basic.md) -- [链表经典题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/01.Linked-List-Basic/02.Linked-List-Basic-List.md) \ No newline at end of file diff --git a/Contents/02.Linked-List/02.Linked-List-Sort/01.Linked-List-Sort.md b/Contents/02.Linked-List/02.Linked-List-Sort/01.Linked-List-Sort.md deleted file mode 100644 index 169dcfd9..00000000 --- a/Contents/02.Linked-List/02.Linked-List-Sort/01.Linked-List-Sort.md +++ /dev/null @@ -1,523 +0,0 @@ -## 1. 链表排序简介 - -在数组排序中，常见的排序算法有：冒泡排序、选择排序、插入排序、希尔排序、归并排序、快速排序、堆排序、计数排序、桶排序、基数排序等。 - -而对于链表排序而言，因为链表不支持随机访问，访问链表后面的节点只能依靠 `next` 指针从头部顺序遍历，所以相对于数组排序问题来说，链表排序问题会更加复杂一点。 - -下面先来总结一下适合链表排序与不适合链表排序的算法： - -- 适合链表的排序算法：**冒泡排序**、**选择排序**、**插入排序**、**归并排序**、**快速排序**、**计数排序**、**桶排序**、**基数排序**。 -- 不适合链表的排序算法：**希尔排序**。 -- 可以用于链表排序但不建议使用的排序算法：**堆排序**。 - -> 希尔排序为什么不适合链表排序？ - -**希尔排序**：希尔排序中经常涉及到对序列中第 `i + gap` 的元素进行操作，其中 `gap` 是希尔排序中当前的步长。而链表不支持随机访问的特性，导致这种操作不适合链表，因而希尔排序算法不适合进行链表排序。 - -> 为什么不建议使用堆排序？ - -**堆排序**：堆排序所使用的最大堆 / 最小堆结构本质上是一棵完全二叉树。而完全二叉树适合采用顺序存储结构（数组）。因为数组存储的完全二叉树可以很方便的通过下标序号来确定父亲节点和孩子节点，并且可以极大限度的节省存储空间。 - -而链表用在存储完全二叉树的时候，因为不支持随机访问的特性，导致其寻找子节点和父亲节点会比较耗时，如果增加指向父亲节点的变量，又会浪费大量存储空间。所以堆排序算法不适合进行链表排序。 - -如果一定要对链表进行堆排序，则可以使用额外的数组空间表示堆结构。然后将链表中各个节点的值依次添加入堆结构中，对数组进行堆排序。排序后，再按照堆中元素顺序，依次建立链表节点，构建新的链表并返回新链表头节点。 - -> 需要用到额外的辅助空间进行排序的算法 - -刚才我们说到如果一定要对链表进行堆排序，则需要使用额外的数组空间。除此之外，计数排序、桶排序、基数排序都需要用到额外的数组空间。 - -接下来，我们将对适合链表排序的 8 种算法进行一一讲解。当然，这些排序算法不用完全掌握，重点是掌握 **「链表插入排序」**、**「链表归并排序」** 这两种排序算法。 - -## 2. 链表冒泡排序 - -### 2.1 链表冒泡排序算法描述 - -1. 使用三个指针 `node_i`、`node_j` 和 `tail`。其中 `node_i` 用于控制外循环次数，循环次数为链节点个数（链表长度）。`node_j` 和 `tail` 用于控制内循环次数和循环结束位置。 - -2. 排序开始前，将 `node_i` 、`node_j` 置于头节点位置。`tail` 指向链表末尾，即 `None`。 - -3. 比较链表中相邻两个元素 `node_j.val` 与 `node_j.next.val` 的值大小，如果 `node_j.val > node_j.next.val`，则值相互交换。否则不发生交换。然后向右移动 `node_j` 指针，直到 `node_j.next == tail` 时停止。 - -4. 一次循环之后，将 `tail` 移动到 `node_j` 所在位置。相当于 `tail` 向左移动了一位。此时 `tail` 节点右侧为链表中最大的链节点。 - -5. 然后移动 `node_i` 节点，并将 `node_j` 置于头节点位置。然后重复第 3、4 步操作。 -6. 直到 `node_i` 节点移动到链表末尾停止，排序结束。 -7. 返回链表的头节点 `head`。 - -### 2.2 链表冒泡排序算法实现代码 - -```python -class Solution: - def bubbleSort(self, head: ListNode): - node_i = head - tail = None - # 外层循环次数为 链表节点个数 - while node_i: - node_j = head - while node_j and node_j.next != tail: - if node_j.val > node_j.next.val: - # 交换两个节点的值 - node_j.val, node_j.next.val = node_j.next.val, node_j.val - node_j = node_j.next - # 尾指针向前移动 1 位，此时尾指针右侧为排好序的链表 - tail = node_j - node_i = node_i.next - - return head - - def sortList(self, head: Optional[ListNode]) -> Optional[ListNode]: - return self.bubbleSort(head) -``` - -### 2.3 链表冒泡排序算法复杂度分析 - -- **时间复杂度**：$O(n^2)$。 -- **空间复杂度**：$O(1)$。 - -## 3. 链表选择排序 - -### 3.1 链表选择排序算法描述 - -1. 使用两个指针 `node_i`、`node_j`。`node_i` 既可以用于控制外循环次数，又可以作为当前未排序链表的第一个链节点位置。 -2. 使用 `min_node` 记录当前未排序链表中值最小的链节点。 -3. 每一趟排序开始时，先令 `min_node = node_i`（即暂时假设链表中 `node_i` 节点为值最小的节点，经过比较后再确定最小值节点位置）。 -4. 然后依次比较未排序链表中 `node_j.val` 与 `min_node.val` 的值大小。如果 `node_j.val < min_node.val`，则更新 `min_node` 为 `node_j`。 -5. 这一趟排序结束时，未排序链表中最小值节点为 `min_node`，如果 `node_i != min_node`，则将 `node_i` 与 `min_node` 值进行交换。如果 `node_i == min_node`，则不用交换。 -6. 排序结束后，继续向右移动 `node_i`，重复上述步骤，在剩余未排序链表中寻找最小的链节点，并与 `node_i` 进行比较和交换，直到 `node_i == None` 或者 `node_i.next == None` 时，停止排序。 -7. 返回链表的头节点 `head`。 - -### 3.2 链表选择排序实现代码 - -```python -class Solution: - def sectionSort(self, head: ListNode): - node_i = head - # node_i 为当前未排序链表的第一个链节点 - while node_i and node_i.next: - # min_node 为未排序链表中的值最小节点 - min_node = node_i - node_j = node_i.next - while node_j: - if node_j.val < min_node.val: - min_node = node_j - node_j = node_j.next - # 交换值最小节点与未排序链表中第一个节点的值 - if node_i != min_node: - node_i.val, min_node.val = min_node.val, node_i.val - node_i = node_i.next - - return head - - def sortList(self, head: Optional[ListNode]) -> Optional[ListNode]: - return self.sectionSort(head) -``` - -### 3.3 链表选择排序算法复杂度分析 - -- **时间复杂度**：$O(n^2)$。 -- **空间复杂度**：$O(1)$。 - -## 4. 链表插入排序 - -### 4.1 链表插入排序算法描述 - -1. 先使用哑节点 `dummy_head` 构造一个指向 `head` 的指针，使得可以从 `head` 开始遍历。 -2. 维护 `sorted_list` 为链表的已排序部分的最后一个节点，初始时，`sorted_list = head`。 -3. 维护 `prev` 为插入元素位置的前一个节点，维护 `cur` 为待插入元素。初始时，`prev = head`，`cur = head.next`。 -4. 比较 `sorted_list` 和 `cur` 的节点值。 - - - 如果 `sorted_list.val <= cur.val`，说明 `cur` 应该插入到 `sorted_list` 之后，则将 `sorted_list` 后移一位。 - - 如果 `sorted_list.val > cur.val`，说明 `cur` 应该插入到 `head` 与 `sorted_list` 之间。则使用 `prev` 从 `head` 开始遍历，直到找到插入 `cur` 的位置的前一个节点位置。然后将 `cur` 插入。 - -5. 令 `cur = sorted_list.next`，此时 `cur` 为下一个待插入元素。 -6. 重复 4、5 步骤，直到 `cur` 遍历结束为空。返回 `dummy_head` 的下一个节点。 - -### 4.2 链表插入排序实现代码 - -```python -class Solution: - def insertionSort(self, head: ListNode): - if not head or not head.next: - return head - - dummy_head = ListNode(-1) - dummy_head.next = head - sorted_list = head - cur = head.next - - while cur: - if sorted_list.val <= cur.val: - # 将 cur 插入到 sorted_list 之后 - sorted_list = sorted_list.next - else: - prev = dummy_head - while prev.next.val <= cur.val: - prev = prev.next - # 将 cur 到链表中间 - sorted_list.next = cur.next - cur.next = prev.next - prev.next = cur - cur = sorted_list.next - - return dummy_head.next - - def sortList(self, head: Optional[ListNode]) -> Optional[ListNode]: - return self.insertionSort(head) -``` - -### 4.3 链表插入排序算法复杂度分析 - -- **时间复杂度**：$O(n^2)$。 -- **空间复杂度**：$O(1)$。 - -## 5. 链表归并排序 - -### 5.1 链表归并排序算法描述 - -1. **分割环节**：找到链表中心链节点，从中心节点将链表断开，并递归进行分割。 - 1. 使用快慢指针 `fast = head.next`、`slow = head`，让 `fast` 每次移动 `2` 步，`slow` 移动 `1` 步，移动到链表末尾，从而找到链表中心链节点，即 `slow`。 - 2. 从中心位置将链表从中心位置分为左右两个链表 `left_head` 和 `right_head`，并从中心位置将其断开，即 `slow.next = None`。 - 3. 对左右两个链表分别进行递归分割，直到每个链表中只包含一个链节点。 -2. **归并环节**：将递归后的链表进行两两归并，完成一遍后每个子链表长度加倍。重复进行归并操作，直到得到完整的链表。 - 1. 使用哑节点 `dummy_head` 构造一个头节点，并使用 `cur` 指向 `dummy_head` 用于遍历。 - 2. 比较两个链表头节点 `left` 和 `right` 的值大小。将较小的头节点加入到合并后的链表中，并向后移动该链表的头节点指针。 - 3. 然后重复上一步操作，直到两个链表中出现链表为空的情况。 - 4. 将剩余链表插入到合并后的链表中。 - 5. 将哑节点 `dummy_dead` 的下一个链节点 `dummy_head.next` 作为合并后的头节点返回。 - -### 5.2 链表归并排序实现代码 - -```python -class Solution: - def merge(self, left, right): - # 归并环节 - dummy_head = ListNode(-1) - cur = dummy_head - while left and right: - if left.val <= right.val: - cur.next = left - left = left.next - else: - cur.next = right - right = right.next - cur = cur.next - - if left: - cur.next = left - elif right: - cur.next = right - - return dummy_head.next - - def mergeSort(self, head: ListNode): - # 分割环节 - if not head or not head.next: - return head - - # 快慢指针找到中心链节点 - slow, fast = head, head.next - while fast and fast.next: - slow = slow.next - fast = fast.next.next - - # 断开左右链节点 - left_head, right_head = head, slow.next - slow.next = None - - # 归并操作 - return self.merge(self.mergeSort(left_head), self.mergeSort(right_head)) - - def sortList(self, head: Optional[ListNode]) -> Optional[ListNode]: - return self.mergeSort(head) -``` - -### 5.3 链表归并排序算法复杂度分析 - -- **时间复杂度**：$O(n \times \log_2n)$。 -- **空间复杂度**：$O(1)$。 - -## 6. 链表快速排序 - -### 6.1 链表快速排序算法描述 - -1. 从链表中找到一个基准值 `pivot`，这里以头节点为基准值。 -2. 然后通过快慢指针 `node_i`、`node_j` 在链表中移动，使得 `node_i` 之前的节点值都小于基准值，`node_i` 之后的节点值都大于基准值。从而把数组拆分为左右两个部分。 -3. 再对左右两个部分分别重复第二步，直到各个部分只有一个节点，则排序结束。 - -### 6.2 链表快速排序实现代码 - -```python -class Solution: - def partition(self, left: ListNode, right: ListNode): - # 左闭右开，区间没有元素或者只有一个元素，直接返回第一个节点 - if left == right or left.next == right: - return left - # 选择头节点为基准节点 - pivot = left.val - # 使用 node_i, node_j 双指针，保证 node_i 之前的节点值都小于基准节点值，node_i 与 node_j 之间的节点值都大于等于基准节点值 - node_i, node_j = left, left.next - - while node_j != right: - # 发现一个小与基准值的元素 - if node_j.val < pivot: - # 因为 node_i 之前节点都小于基准值，所以先将 node_i 向右移动一位（此时 node_i 节点值大于等于基准节点值） - node_i = node_i.next - # 将小于基准值的元素 node_j 与当前 node_i 换位，换位后可以保证 node_i 之前的节点都小于基准节点值 - node_i.val, node_j.val = node_j.val, node_i.val - node_j = node_j.next - # 将基准节点放到正确位置上 - node_i.val, left.val = left.val, node_i.val - return node_i - - def quickSort(self, left: ListNode, right: ListNode): - if left == right or left.next == right: - return left - pi = self.partition(left, right) - self.quickSort(left, pi) - self.quickSort(pi.next, right) - return left - - def sortList(self, head: Optional[ListNode]) -> Optional[ListNode]: - if not head or not head.next: - return head - return self.quickSort(head, None) -``` - -### 6.3 链表快速排序算法复杂度分析 - -- **时间复杂度**：$O(n \times \log_2n)$。 -- **空间复杂度**：$O(1)$。 - -## 7. 链表计数排序 - -### 7.1 链表计数排序算法描述 - -1. 使用 `cur` 指针遍历一遍链表。找出链表中最大值 `list_max` 和最小值 `list_min`。 -2. 使用数组 `counts` 存储节点出现次数。 -3. 再次使用 `cur` 指针遍历一遍链表。将链表中每个值为 `cur.val` 的节点出现次数，存入数组对应第 `cur.val - list_min` 项中。 -4. 反向填充目标链表： - 1. 建立一个哑节点 `dummy_head`，作为链表的头节点。使用 `cur` 指针指向 `dummy_head`。 - 2. 从小到大遍历一遍数组 `counts`。对于每个 `counts[i] != 0` 的元素建立一个链节点，值为 `i + list_min`，将其插入到 `cur.next` 上。并向右移动 `cur`。同时 `counts[i] -= 1`。直到 `counts[i] == 0` 后继续向后遍历数组 `counts`。 -5. 将哑节点 `dummy_dead` 的下一个链节点 `dummy_head.next` 作为新链表的头节点返回。 - -### 7.2 链表计数排序代码实现 - -```python -class Solution: - def countingSort(self, head: ListNode): - if not head: - return head - - # 找出链表中最大值 list_max 和最小值 list_min - list_min, list_max = float('inf'), float('-inf') - cur = head - while cur: - if cur.val < list_min: - list_min = cur.val - if cur.val > list_max: - list_max = cur.val - cur = cur.next - - size = list_max - list_min + 1 - counts = [0 for _ in range(size)] - - cur = head - while cur: - counts[cur.val - list_min] += 1 - cur = cur.next - - dummy_head = ListNode(-1) - cur = dummy_head - for i in range(size): - while counts[i]: - cur.next = ListNode(i + list_min) - counts[i] -= 1 - cur = cur.next - return dummy_head.next - - def sortList(self, head: Optional[ListNode]) -> Optional[ListNode]: - return self.countingSort(head) -``` - -### 7.3 链表计数排序算法复杂度分析 - -- **时间复杂度**：$O(n + k)$，其中 $k$ 代表待排序链表中所有元素的值域。 -- **空间复杂度**：$O(k)$。 - -## 8. 链表桶排序 - -### 8.1 链表桶排序算法描述 - -1. 使用 `cur` 指针遍历一遍链表。找出链表中最大值 `list_max` 和最小值 `list_min`。 -2. 通过 `(最大值 - 最小值) / 每个桶的大小` 计算出桶的个数，即 `bucket_count = (list_max - list_min) // bucket_size + 1` 个桶。 -3. 定义数组 `buckets` 为桶，桶的个数为 `bucket_count` 个。 -4. 使用 `cur` 指针再次遍历一遍链表，将每个元素装入对应的桶中。 -5. 对每个桶内的元素单独排序，可以使用链表插入排序、链表归并排序、链表快速排序等算法。 -6. 最后按照顺序将桶内的元素拼成新的链表，并返回。 - -### 8.2 链表桶排序代码实现 - -```python -class ListNode: - def __init__(self, val=0, next=None): - self.val = val - self.next = next - -class Solution: - # 将链表节点值 val 添加到对应桶 buckets[index] 中 - def insertion(self, buckets, index, val): - if not buckets[index]: - buckets[index] = ListNode(val) - return - - node = ListNode(val) - node.next = buckets[index] - buckets[index] = node - - # 归并环节 - def merge(self, left, right): - dummy_head = ListNode(-1) - cur = dummy_head - while left and right: - if left.val <= right.val: - cur.next = left - left = left.next - else: - cur.next = right - right = right.next - cur = cur.next - - if left: - cur.next = left - elif right: - cur.next = right - - return dummy_head.next - - def mergeSort(self, head: ListNode): - # 分割环节 - if not head or not head.next: - return head - - # 快慢指针找到中心链节点 - slow, fast = head, head.next - while fast and fast.next: - slow = slow.next - fast = fast.next.next - - # 断开左右链节点 - left_head, right_head = head, slow.next - slow.next = None - - # 归并操作 - return self.merge(self.mergeSort(left_head), self.mergeSort(right_head)) - - def bucketSort(self, head: ListNode, bucket_size=5): - if not head: - return head - - # 找出链表中最大值 list_max 和最小值 list_min - list_min, list_max = float('inf'), float('-inf') - cur = head - while cur: - if cur.val < list_min: - list_min = cur.val - if cur.val > list_max: - list_max = cur.val - cur = cur.next - - # 计算桶的个数，并定义桶 - bucket_count = (list_max - list_min) // bucket_size + 1 - buckets = [None for _ in range(bucket_count)] - - # 将链表节点值依次添加到对应桶中 - cur = head - while cur: - index = (cur.val - list_min) // bucket_size - self.insertion(buckets, index, cur.val) - cur = cur.next - - dummy_head = ListNode(-1) - cur = dummy_head - # 将元素依次出桶，并拼接成有序链表 - for bucket_head in buckets: - bucket_cur = self.mergeSort(bucket_head) - while bucket_cur: - cur.next = bucket_cur - cur = cur.next - bucket_cur = bucket_cur.next - - return dummy_head.next - - def sortList(self, head: Optional[ListNode]) -> Optional[ListNode]: - return self.bucketSort(head) -``` - -### 8.3 链表桶排序算法复杂度分析 - -- **时间复杂度**：$O(n)$。 -- **空间复杂度**：$O(n + m)$。$m$ 为桶的个数。 - -## 9. 链表基数排序 - -### 9.1 链表基数排序算法描述 - -1. 使用 `cur` 指针遍历链表，获取节点值位数最长的位数 `size`。 -2. 从个位到高位遍历位数。因为 `0` ~ `9` 共有 `10` 位数字，所以建立 `10` 个桶。 -3. 以每个节点对应位数上的数字为索引，将节点值放入到对应桶中。 -4. 建立一个哑节点 `dummy_head`，作为链表的头节点。使用 `cur` 指针指向 `dummy_head`。 -5. 将桶中元素依次取出，并根据元素值建立链表节点，并插入到新的链表后面。从而生成新的链表。 -6. 之后依次以十位，百位，…，直到最大值元素的最高位处值为索引，放入到对应桶中，并生成新的链表，最终完成排序。 -7. 将哑节点 `dummy_dead` 的下一个链节点 `dummy_head.next` 作为新链表的头节点返回。 - -### 9.2 链表基数排序代码实现 - -```python -class Solution: - def radixSort(self, head: ListNode): - # 计算位数最长的位数 - size = 0 - cur = head - while cur: - val_len = len(str(cur.val)) - if val_len > size: - size = val_len - cur = cur.next - - # 从个位到高位遍历位数 - for i in range(size): - buckets = [[] for _ in range(10)] - cur = head - while cur: - # 以每个节点对应位数上的数字为索引，将节点值放入到对应桶中 - buckets[cur.val // (10 ** i) % 10].append(cur.val) - cur = cur.next - - # 生成新的链表 - dummy_head = ListNode(-1) - cur = dummy_head - for bucket in buckets: - for num in bucket: - cur.next = ListNode(num) - cur = cur.next - head = dummy_head.next - - return head - - def sortList(self, head: Optional[ListNode]) -> Optional[ListNode]: - return self.radixSort(head) -``` - -### 9.3 链表基数排序算法复杂度分析 - -- **时间复杂度**：$O(n \times k)$。其中 $n$ 是待排序元素的个数，$k$ 是数字位数。$k$ 的大小取决于数字位的选择（十进制位、二进制位）和待排序元素所属数据类型全集的大小。 -- **空间复杂度**：$O(n + k)$。 - -## 参考资料 - -- 【文章】[单链表的冒泡排序_zhao_miao的博客 - CSDN博客](https://blog.csdn.net/zhao_miao/article/details/81708454) -- 【文章】[链表排序总结（全）（C++）- 阿祭儿 - CSDN博客](https://blog.csdn.net/qq_32523711/article/details/107402873) -- 【题解】[快排、冒泡、选择排序实现列表排序 - 排序链表 - 力扣](https://leetcode.cn/problems/sort-list/solution/kuai-pai-mou-pao-xuan-ze-pai-xu-shi-xian-ula7/) -- 【题解】[归并排序+快速排序 - 排序链表 - 力扣](https://leetcode.cn/problems/sort-list/solution/gui-bing-pai-xu-kuai-su-pai-xu-by-datacruiser/) -- 【题解】[排序链表（递归+迭代）详解 - 排序链表 - 力扣](https://leetcode.cn/problems/sort-list/solution/pai-xu-lian-biao-di-gui-die-dai-xiang-jie-by-cherr/) -- 【题解】[Sort List （归并排序链表） - 排序链表 - 力扣](https://leetcode.cn/problems/sort-list/solution/sort-list-gui-bing-pai-xu-lian-biao-by-jyd/) \ No newline at end of file diff --git a/Contents/02.Linked-List/02.Linked-List-Sort/02.Linked-List-Sort-List.md b/Contents/02.Linked-List/02.Linked-List-Sort/02.Linked-List-Sort-List.md deleted file mode 100644 index bde4212f..00000000 --- a/Contents/02.Linked-List/02.Linked-List-Sort/02.Linked-List-Sort-List.md +++ /dev/null @@ -1,9 +0,0 @@ -### 链表排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0148 | [排序链表](https://leetcode.cn/problems/sort-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0148.%20%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8.md) | 链表、双指针、分治、排序、归并排序 | 中等 | -| 0021 | [合并两个有序链表](https://leetcode.cn/problems/merge-two-sorted-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0021.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E9%93%BE%E8%A1%A8.md) | 递归、链表 | 简单 | -| 0023 | [合并 K 个升序链表](https://leetcode.cn/problems/merge-k-sorted-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0023.%20%E5%90%88%E5%B9%B6%20K%20%E4%B8%AA%E5%8D%87%E5%BA%8F%E9%93%BE%E8%A1%A8.md) | 链表、分治、堆（优先队列）、归并排序 | 困难 | -| 0147 | [对链表进行插入排序](https://leetcode.cn/problems/insertion-sort-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0147.%20%E5%AF%B9%E9%93%BE%E8%A1%A8%E8%BF%9B%E8%A1%8C%E6%8F%92%E5%85%A5%E6%8E%92%E5%BA%8F.md) | 链表、排序 | 中等 | - diff --git a/Contents/02.Linked-List/02.Linked-List-Sort/index.md b/Contents/02.Linked-List/02.Linked-List-Sort/index.md deleted file mode 100644 index 772df309..00000000 --- a/Contents/02.Linked-List/02.Linked-List-Sort/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [链表排序知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/02.Linked-List-Sort/01.Linked-List-Sort.md) -- [链表排序题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/02.Linked-List-Sort/02.Linked-List-Sort-List.md) \ No newline at end of file diff --git a/Contents/02.Linked-List/03.Linked-List-Two-Pointers/02.Linked-List-Two-Pointers-List.md b/Contents/02.Linked-List/03.Linked-List-Two-Pointers/02.Linked-List-Two-Pointers-List.md deleted file mode 100644 index f35368d5..00000000 --- a/Contents/02.Linked-List/03.Linked-List-Two-Pointers/02.Linked-List-Two-Pointers-List.md +++ /dev/null @@ -1,14 +0,0 @@ -### 链表双指针题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0141 | [环形链表](https://leetcode.cn/problems/linked-list-cycle/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0141.%20%E7%8E%AF%E5%BD%A2%E9%93%BE%E8%A1%A8.md) | 哈希表、链表、双指针 | 简单 | -| 0142 | [环形链表 II](https://leetcode.cn/problems/linked-list-cycle-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0142.%20%E7%8E%AF%E5%BD%A2%E9%93%BE%E8%A1%A8%20II.md) | 哈希表、链表、双指针 | 中等 | -| 0160 | [相交链表](https://leetcode.cn/problems/intersection-of-two-linked-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0160.%20%E7%9B%B8%E4%BA%A4%E9%93%BE%E8%A1%A8.md) | 哈希表、链表、双指针 | 简单 | -| 0019 | [删除链表的倒数第 N 个结点](https://leetcode.cn/problems/remove-nth-node-from-end-of-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0019.%20%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E7%9A%84%E5%80%92%E6%95%B0%E7%AC%AC%20N%20%E4%B8%AA%E7%BB%93%E7%82%B9.md) | 链表、双指针 | 中等 | -| 0876 | [链表的中间结点](https://leetcode.cn/problems/middle-of-the-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0876.%20%E9%93%BE%E8%A1%A8%E7%9A%84%E4%B8%AD%E9%97%B4%E7%BB%93%E7%82%B9.md) | 链表、双指针 | 简单 | -| 剑指 Offer 22 | [链表中倒数第k个节点](https://leetcode.cn/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2022.%20%E9%93%BE%E8%A1%A8%E4%B8%AD%E5%80%92%E6%95%B0%E7%AC%ACk%E4%B8%AA%E8%8A%82%E7%82%B9.md) | 链表、双指针 | 简单 | -| 0143 | [重排链表](https://leetcode.cn/problems/reorder-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0143.%20%E9%87%8D%E6%8E%92%E9%93%BE%E8%A1%A8.md) | 栈、递归、链表、双指针 | 中等 | -| 0002 | [两数相加](https://leetcode.cn/problems/add-two-numbers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0002.%20%E4%B8%A4%E6%95%B0%E7%9B%B8%E5%8A%A0.md) | 递归、链表、数学 | 中等 | -| 0445 | [两数相加 II](https://leetcode.cn/problems/add-two-numbers-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0445.%20%E4%B8%A4%E6%95%B0%E7%9B%B8%E5%8A%A0%20II.md) | 栈、链表、数学 | 中等 | - diff --git a/Contents/02.Linked-List/03.Linked-List-Two-Pointers/index.md b/Contents/02.Linked-List/03.Linked-List-Two-Pointers/index.md deleted file mode 100644 index df50efdc..00000000 --- a/Contents/02.Linked-List/03.Linked-List-Two-Pointers/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [链表双指针知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/03.Linked-List-Two-Pointers/01.Linked-List-Two-Pointers.md) -- [链表双指针题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/03.Linked-List-Two-Pointers/02.Linked-List-Two-Pointers-List.md) \ No newline at end of file diff --git a/Contents/02.Linked-List/index.md b/Contents/02.Linked-List/index.md deleted file mode 100644 index 880bf9a0..00000000 --- a/Contents/02.Linked-List/index.md +++ /dev/null @@ -1,17 +0,0 @@ -## 本章内容 - -### 链表基础知识 - -- [链表基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/01.Linked-List-Basic/01.Linked-List-Basic.md) -- [链表经典题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/01.Linked-List-Basic/02.Linked-List-Basic-List.md) - -### 链表排序 - -- [链表排序知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/02.Linked-List-Sort/01.Linked-List-Sort.md) -- [链表排序题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/02.Linked-List-Sort/02.Linked-List-Sort-List.md) - -### 链表双指针 - -- [链表双指针知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/03.Linked-List-Two-Pointers/01.Linked-List-Two-Pointers.md) -- [链表双指针题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/03.Linked-List-Two-Pointers/02.Linked-List-Two-Pointers-List.md) - diff --git a/Contents/03.Stack/01.Stack-Basic/02.Stack-Basic-List.md b/Contents/03.Stack/01.Stack-Basic/02.Stack-Basic-List.md deleted file mode 100644 index 369efe75..00000000 --- a/Contents/03.Stack/01.Stack-Basic/02.Stack-Basic-List.md +++ /dev/null @@ -1,18 +0,0 @@ -### 堆栈基础题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 1047 | [删除字符串中的所有相邻重复项](https://leetcode.cn/problems/remove-all-adjacent-duplicates-in-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1047.%20%E5%88%A0%E9%99%A4%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E6%89%80%E6%9C%89%E7%9B%B8%E9%82%BB%E9%87%8D%E5%A4%8D%E9%A1%B9.md) | 栈、字符串 | 简单 | -| 0155 | [最小栈](https://leetcode.cn/problems/min-stack/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0155.%20%E6%9C%80%E5%B0%8F%E6%A0%88.md) | 栈、设计 | 中等 | -| 0020 | [有效的括号](https://leetcode.cn/problems/valid-parentheses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0020.%20%E6%9C%89%E6%95%88%E7%9A%84%E6%8B%AC%E5%8F%B7.md) | 栈、字符串 | 简单 | -| 0227 | [基本计算器 II](https://leetcode.cn/problems/basic-calculator-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0227.%20%E5%9F%BA%E6%9C%AC%E8%AE%A1%E7%AE%97%E5%99%A8%20II.md) | 栈、数学、字符串 | 中等 | -| 0739 | [每日温度](https://leetcode.cn/problems/daily-temperatures/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0739.%20%E6%AF%8F%E6%97%A5%E6%B8%A9%E5%BA%A6.md) | 栈、数组、单调栈 | 中等 | -| 0150 | [逆波兰表达式求值](https://leetcode.cn/problems/evaluate-reverse-polish-notation/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0150.%20%E9%80%86%E6%B3%A2%E5%85%B0%E8%A1%A8%E8%BE%BE%E5%BC%8F%E6%B1%82%E5%80%BC.md) | 栈、数组、数学 | 中等 | -| 0232 | [用栈实现队列](https://leetcode.cn/problems/implement-queue-using-stacks/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0232.%20%E7%94%A8%E6%A0%88%E5%AE%9E%E7%8E%B0%E9%98%9F%E5%88%97.md) | 栈、设计、队列 | 简单 | -| 剑指 Offer 09 | [用两个栈实现队列](https://leetcode.cn/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2009.%20%E7%94%A8%E4%B8%A4%E4%B8%AA%E6%A0%88%E5%AE%9E%E7%8E%B0%E9%98%9F%E5%88%97.md) | 栈、设计、队列 | 简单 | -| 0394 | [字符串解码](https://leetcode.cn/problems/decode-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0394.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%A7%A3%E7%A0%81.md) | 栈、递归、字符串 | 中等 | -| 0032 | [最长有效括号](https://leetcode.cn/problems/longest-valid-parentheses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0032.%20%E6%9C%80%E9%95%BF%E6%9C%89%E6%95%88%E6%8B%AC%E5%8F%B7.md) | 栈、字符串、动态规划 | 困难 | -| 0946 | [验证栈序列](https://leetcode.cn/problems/validate-stack-sequences/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0946.%20%E9%AA%8C%E8%AF%81%E6%A0%88%E5%BA%8F%E5%88%97.md) | 栈、数组、模拟 | 中等 | -| 剑指 Offer 06 | [从尾到头打印链表](https://leetcode.cn/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2006.%20%E4%BB%8E%E5%B0%BE%E5%88%B0%E5%A4%B4%E6%89%93%E5%8D%B0%E9%93%BE%E8%A1%A8.md) | 栈、递归、链表、双指针 | 简单 | -| 0071 | [简化路径](https://leetcode.cn/problems/simplify-path/) | | 栈、字符串 | 中等 | - diff --git a/Contents/03.Stack/01.Stack-Basic/index.md b/Contents/03.Stack/01.Stack-Basic/index.md deleted file mode 100644 index e5e04e07..00000000 --- a/Contents/03.Stack/01.Stack-Basic/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [堆栈基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/03.Stack/01.Stack-Basic/01.Stack-Basic.md) -- [堆栈基础题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/03.Stack/01.Stack-Basic/02.Stack-Basic-List.md) \ No newline at end of file diff --git a/Contents/03.Stack/02.Monotone-Stack/02.Monotone-Stack-List.md b/Contents/03.Stack/02.Monotone-Stack/02.Monotone-Stack-List.md deleted file mode 100644 index acab1306..00000000 --- a/Contents/03.Stack/02.Monotone-Stack/02.Monotone-Stack-List.md +++ /dev/null @@ -1,14 +0,0 @@ -### 单调栈 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0739 | [每日温度](https://leetcode.cn/problems/daily-temperatures/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0739.%20%E6%AF%8F%E6%97%A5%E6%B8%A9%E5%BA%A6.md) | 栈、数组、单调栈 | 中等 | -| 0496 | [下一个更大元素 I](https://leetcode.cn/problems/next-greater-element-i/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0496.%20%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%9B%B4%E5%A4%A7%E5%85%83%E7%B4%A0%20I.md) | 栈、数组、哈希表、单调栈 | 简单 | -| 0503 | [下一个更大元素 II](https://leetcode.cn/problems/next-greater-element-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0503.%20%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%9B%B4%E5%A4%A7%E5%85%83%E7%B4%A0%20II.md) | 栈、数组、单调栈 | 中等 | -| 0901 | [股票价格跨度](https://leetcode.cn/problems/online-stock-span/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0901.%20%E8%82%A1%E7%A5%A8%E4%BB%B7%E6%A0%BC%E8%B7%A8%E5%BA%A6.md) | 栈、设计、数据流、单调栈 | 中等 | -| 0084 | [柱状图中最大的矩形](https://leetcode.cn/problems/largest-rectangle-in-histogram/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0084.%20%E6%9F%B1%E7%8A%B6%E5%9B%BE%E4%B8%AD%E6%9C%80%E5%A4%A7%E7%9A%84%E7%9F%A9%E5%BD%A2.md) | 栈、数组、单调栈 | 困难 | -| 0316 | [去除重复字母](https://leetcode.cn/problems/remove-duplicate-letters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0316.%20%E5%8E%BB%E9%99%A4%E9%87%8D%E5%A4%8D%E5%AD%97%E6%AF%8D.md) | 栈、贪心、字符串、单调栈 | 中等 | -| 0042 | [接雨水](https://leetcode.cn/problems/trapping-rain-water/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0042.%20%E6%8E%A5%E9%9B%A8%E6%B0%B4.md) | 栈、数组、双指针、动态规划、单调栈 | 困难 | -| 0085 | [最大矩形](https://leetcode.cn/problems/maximal-rectangle/) | | 栈、数组、动态规划、矩阵、单调栈 | 困难 | -| 0862 | [和至少为 K 的最短子数组](https://leetcode.cn/problems/shortest-subarray-with-sum-at-least-k/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0862.%20%E5%92%8C%E8%87%B3%E5%B0%91%E4%B8%BA%20K%20%E7%9A%84%E6%9C%80%E7%9F%AD%E5%AD%90%E6%95%B0%E7%BB%84.md) | 队列、数组、二分查找、前缀和、滑动窗口、单调队列、堆（优先队列） | 困难 | - diff --git a/Contents/03.Stack/02.Monotone-Stack/index.md b/Contents/03.Stack/02.Monotone-Stack/index.md deleted file mode 100644 index 58d7f5f6..00000000 --- a/Contents/03.Stack/02.Monotone-Stack/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [单调栈知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/03.Stack/02.Monotone-Stack/01.Monotone-Stack.md) -- [单调栈题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/03.Stack/02.Monotone-Stack/02.Monotone-Stack-List.md) \ No newline at end of file diff --git a/Contents/03.Stack/index.md b/Contents/03.Stack/index.md deleted file mode 100644 index f5426b4d..00000000 --- a/Contents/03.Stack/index.md +++ /dev/null @@ -1,11 +0,0 @@ -## 本章内容 - -### 堆栈基础知识 - -- [堆栈基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/03.Stack/01.Stack-Basic/01.Stack-Basic.md) -- [堆栈基础题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/03.Stack/01.Stack-Basic/02.Stack-Basic-List.md) - -### 单调栈 - -- [单调栈知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/03.Stack/02.Monotone-Stack/01.Monotone-Stack.md) -- [单调栈题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/03.Stack/02.Monotone-Stack/02.Monotone-Stack-List.md) \ No newline at end of file diff --git a/Contents/04.Queue/01.Queue-Basic/02.Queue-Basic-List.md b/Contents/04.Queue/01.Queue-Basic/02.Queue-Basic-List.md deleted file mode 100644 index 72b53f41..00000000 --- a/Contents/04.Queue/01.Queue-Basic/02.Queue-Basic-List.md +++ /dev/null @@ -1,8 +0,0 @@ -### 队列基础题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0622 | [设计循环队列](https://leetcode.cn/problems/design-circular-queue/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0622.%20%E8%AE%BE%E8%AE%A1%E5%BE%AA%E7%8E%AF%E9%98%9F%E5%88%97.md) | 设计、队列、数组、链表 | 中等 | -| 0346 | [数据流中的移动平均值](https://leetcode.cn/problems/moving-average-from-data-stream/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0346.%20%E6%95%B0%E6%8D%AE%E6%B5%81%E4%B8%AD%E7%9A%84%E7%A7%BB%E5%8A%A8%E5%B9%B3%E5%9D%87%E5%80%BC.md) | 设计、队列、数组、数据流 | 简单 | -| 0225 | [用队列实现栈](https://leetcode.cn/problems/implement-stack-using-queues/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0225.%20%E7%94%A8%E9%98%9F%E5%88%97%E5%AE%9E%E7%8E%B0%E6%A0%88.md) | 栈、设计、队列 | 简单 | - diff --git a/Contents/04.Queue/01.Queue-Basic/index.md b/Contents/04.Queue/01.Queue-Basic/index.md deleted file mode 100644 index c6c1d365..00000000 --- a/Contents/04.Queue/01.Queue-Basic/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [队列基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/04.Queue/01.Queue-Basic/01.Queue-Basic.md) -- [队列基础题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/04.Queue/01.Queue-Basic/02.Queue-Basic-List.md) \ No newline at end of file diff --git a/Contents/04.Queue/02.Priority-Queue/02.Priority-Queue-List.md b/Contents/04.Queue/02.Priority-Queue/02.Priority-Queue-List.md deleted file mode 100644 index 5a7753f2..00000000 --- a/Contents/04.Queue/02.Priority-Queue/02.Priority-Queue-List.md +++ /dev/null @@ -1,14 +0,0 @@ -### 优先队列题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0703 | [数据流中的第 K 大元素](https://leetcode.cn/problems/kth-largest-element-in-a-stream/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0703.%20%E6%95%B0%E6%8D%AE%E6%B5%81%E4%B8%AD%E7%9A%84%E7%AC%AC%20K%20%E5%A4%A7%E5%85%83%E7%B4%A0.md) | 树、设计、二叉搜索树、二叉树、数据流、堆（优先队列） | 简单 | -| 0347 | [前 K 个高频元素](https://leetcode.cn/problems/top-k-frequent-elements/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0347.%20%E5%89%8D%20K%20%E4%B8%AA%E9%AB%98%E9%A2%91%E5%85%83%E7%B4%A0.md) | 数组、哈希表、分治、桶排序、计数、快速选择、排序、堆（优先队列） | 中等 | -| 0451 | [根据字符出现频率排序](https://leetcode.cn/problems/sort-characters-by-frequency/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0451.%20%E6%A0%B9%E6%8D%AE%E5%AD%97%E7%AC%A6%E5%87%BA%E7%8E%B0%E9%A2%91%E7%8E%87%E6%8E%92%E5%BA%8F.md) | 哈希表、字符串、桶排序、计数、排序、堆（优先队列） | 中等 | -| 0973 | [最接近原点的 K 个点](https://leetcode.cn/problems/k-closest-points-to-origin/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0973.%20%E6%9C%80%E6%8E%A5%E8%BF%91%E5%8E%9F%E7%82%B9%E7%9A%84%20K%20%E4%B8%AA%E7%82%B9.md) | 几何、数组、数学、分治、快速选择、排序、堆（优先队列） | 中等 | -| 1296 | [划分数组为连续数字的集合](https://leetcode.cn/problems/divide-array-in-sets-of-k-consecutive-numbers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1296.%20%E5%88%92%E5%88%86%E6%95%B0%E7%BB%84%E4%B8%BA%E8%BF%9E%E7%BB%AD%E6%95%B0%E5%AD%97%E7%9A%84%E9%9B%86%E5%90%88.md) | 贪心、数组、哈希表、排序 | 中等 | -| 0239 | [滑动窗口最大值](https://leetcode.cn/problems/sliding-window-maximum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0239.%20%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E6%9C%80%E5%A4%A7%E5%80%BC.md) | 队列、数组、滑动窗口、单调队列、堆（优先队列） | 困难 | -| 0295 | [数据流的中位数](https://leetcode.cn/problems/find-median-from-data-stream/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0295.%20%E6%95%B0%E6%8D%AE%E6%B5%81%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0.md) | 设计、双指针、数据流、排序、堆（优先队列） | 困难 | -| 0023 | [合并 K 个升序链表](https://leetcode.cn/problems/merge-k-sorted-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0023.%20%E5%90%88%E5%B9%B6%20K%20%E4%B8%AA%E5%8D%87%E5%BA%8F%E9%93%BE%E8%A1%A8.md) | 链表、分治、堆（优先队列）、归并排序 | 困难 | -| 0218 | [天际线问题](https://leetcode.cn/problems/the-skyline-problem/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0218.%20%E5%A4%A9%E9%99%85%E7%BA%BF%E9%97%AE%E9%A2%98.md) | 树状数组、线段树、数组、分治、有序集合、扫描线、堆（优先队列） | 困难 | - diff --git a/Contents/04.Queue/02.Priority-Queue/index.md b/Contents/04.Queue/02.Priority-Queue/index.md deleted file mode 100644 index 9563cfb4..00000000 --- a/Contents/04.Queue/02.Priority-Queue/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [优先队列知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/04.Queue/02.Priority-Queue/01.Priority-Queue.md) -- [优先队列题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/04.Queue/02.Priority-Queue/02.Priority-Queue-List.md) \ No newline at end of file diff --git a/Contents/04.Queue/index.md b/Contents/04.Queue/index.md deleted file mode 100644 index 1f37c2e9..00000000 --- a/Contents/04.Queue/index.md +++ /dev/null @@ -1,11 +0,0 @@ -## 本章内容 - -### 队列基础知识 - -- [队列基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/04.Queue/01.Queue-Basic/01.Queue-Basic.md) -- [队列基础题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/04.Queue/01.Queue-Basic/02.Queue-Basic-List.md) - -### 优先队列 - -- [优先队列知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/04.Queue/02.Priority-Queue/01.Priority-Queue.md) -- [优先队列题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/04.Queue/02.Priority-Queue/02.Priority-Queue-List.md) \ No newline at end of file diff --git a/Contents/05.Hash-Table/02.Hash-Table-List.md b/Contents/05.Hash-Table/02.Hash-Table-List.md deleted file mode 100644 index a035c3e7..00000000 --- a/Contents/05.Hash-Table/02.Hash-Table-List.md +++ /dev/null @@ -1,37 +0,0 @@ -### 哈希表题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0705 | [设计哈希集合](https://leetcode.cn/problems/design-hashset/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0705.%20%E8%AE%BE%E8%AE%A1%E5%93%88%E5%B8%8C%E9%9B%86%E5%90%88.md) | 设计、数组、哈希表、链表、哈希函数 | 简单 | -| 0706 | [设计哈希映射](https://leetcode.cn/problems/design-hashmap/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0706.%20%E8%AE%BE%E8%AE%A1%E5%93%88%E5%B8%8C%E6%98%A0%E5%B0%84.md) | 设计、数组、哈希表、链表、哈希函数 | 简单 | -| 0217 | [存在重复元素](https://leetcode.cn/problems/contains-duplicate/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0217.%20%E5%AD%98%E5%9C%A8%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0.md) | 数组、哈希表、排序 | 简单 | -| 0219 | [存在重复元素 II](https://leetcode.cn/problems/contains-duplicate-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0219.%20%E5%AD%98%E5%9C%A8%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0%20II.md) | 数组、哈希表、滑动窗口 | 简单 | -| 0220 | [存在重复元素 III](https://leetcode.cn/problems/contains-duplicate-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0220.%20%E5%AD%98%E5%9C%A8%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0%20III.md) | 数组、桶排序、有序集合、排序、滑动窗口 | 困难 | -| 1941 | [检查是否所有字符出现次数相同](https://leetcode.cn/problems/check-if-all-characters-have-equal-number-of-occurrences/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1941.%20%E6%A3%80%E6%9F%A5%E6%98%AF%E5%90%A6%E6%89%80%E6%9C%89%E5%AD%97%E7%AC%A6%E5%87%BA%E7%8E%B0%E6%AC%A1%E6%95%B0%E7%9B%B8%E5%90%8C.md) | 哈希表、字符串、计数 | 简单 | -| 0136 | [只出现一次的数字](https://leetcode.cn/problems/single-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0136.%20%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B0%E5%AD%97.md) | 位运算、数组 | 简单 | -| 0383 | [赎金信](https://leetcode.cn/problems/ransom-note/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0383.%20%E8%B5%8E%E9%87%91%E4%BF%A1.md) | 哈希表、字符串、计数 | 简单 | -| 0349 | [两个数组的交集](https://leetcode.cn/problems/intersection-of-two-arrays/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0349.%20%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E7%9A%84%E4%BA%A4%E9%9B%86.md) | 数组、哈希表、双指针、二分查找、排序 | 简单 | -| 0350 | [两个数组的交集 II](https://leetcode.cn/problems/intersection-of-two-arrays-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0350.%20%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E7%9A%84%E4%BA%A4%E9%9B%86%20II.md) | 数组、哈希表、双指针、二分查找、排序 | 简单 | -| 0036 | [有效的数独](https://leetcode.cn/problems/valid-sudoku/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0036.%20%E6%9C%89%E6%95%88%E7%9A%84%E6%95%B0%E7%8B%AC.md) | 数组、哈希表、矩阵 | 中等 | -| 0001 | [两数之和](https://leetcode.cn/problems/two-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0001.%20%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、哈希表 | 简单 | -| 0015 | [三数之和](https://leetcode.cn/problems/3sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0015.%20%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、双指针、排序 | 中等 | -| 0018 | [四数之和](https://leetcode.cn/problems/4sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0018.%20%E5%9B%9B%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、双指针、排序 | 中等 | -| 0454 | [四数相加 II](https://leetcode.cn/problems/4sum-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0454.%20%E5%9B%9B%E6%95%B0%E7%9B%B8%E5%8A%A0%20II.md) | 数组、哈希表 | 中等 | -| 0041 | [缺失的第一个正数](https://leetcode.cn/problems/first-missing-positive/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0041.%20%E7%BC%BA%E5%A4%B1%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E6%AD%A3%E6%95%B0.md) | 数组、哈希表 | 困难 | -| 0128 | [最长连续序列](https://leetcode.cn/problems/longest-consecutive-sequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0128.%20%E6%9C%80%E9%95%BF%E8%BF%9E%E7%BB%AD%E5%BA%8F%E5%88%97.md) | 并查集、数组、哈希表 | 中等 | -| 0202 | [快乐数](https://leetcode.cn/problems/happy-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0202.%20%E5%BF%AB%E4%B9%90%E6%95%B0.md) | 哈希表、数学、双指针 | 简单 | -| 0242 | [有效的字母异位词](https://leetcode.cn/problems/valid-anagram/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0242.%20%E6%9C%89%E6%95%88%E7%9A%84%E5%AD%97%E6%AF%8D%E5%BC%82%E4%BD%8D%E8%AF%8D.md) | 哈希表、字符串、排序 | 简单 | -| 0205 | [同构字符串](https://leetcode.cn/problems/isomorphic-strings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0205.%20%E5%90%8C%E6%9E%84%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 哈希表、字符串 | 简单 | -| 0442 | [数组中重复的数据](https://leetcode.cn/problems/find-all-duplicates-in-an-array/) | | 数组、哈希表 | 中等 | -| 剑指 Offer 61 | [扑克牌中的顺子](https://leetcode.cn/problems/bu-ke-pai-zhong-de-shun-zi-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2061.%20%E6%89%91%E5%85%8B%E7%89%8C%E4%B8%AD%E7%9A%84%E9%A1%BA%E5%AD%90.md) | 数组、排序 | 简单 | -| 0268 | [丢失的数字](https://leetcode.cn/problems/missing-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0268.%20%E4%B8%A2%E5%A4%B1%E7%9A%84%E6%95%B0%E5%AD%97.md) | 位运算、数组、哈希表、数学、二分查找、排序 | 简单 | -| 剑指 Offer 03 | [数组中重复的数字](https://leetcode.cn/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2003.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E9%87%8D%E5%A4%8D%E7%9A%84%E6%95%B0%E5%AD%97.md) | 数组、哈希表、排序 | 简单 | -| 0451 | [根据字符出现频率排序](https://leetcode.cn/problems/sort-characters-by-frequency/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0451.%20%E6%A0%B9%E6%8D%AE%E5%AD%97%E7%AC%A6%E5%87%BA%E7%8E%B0%E9%A2%91%E7%8E%87%E6%8E%92%E5%BA%8F.md) | 哈希表、字符串、桶排序、计数、排序、堆（优先队列） | 中等 | -| 0049 | [字母异位词分组](https://leetcode.cn/problems/group-anagrams/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0049.%20%E5%AD%97%E6%AF%8D%E5%BC%82%E4%BD%8D%E8%AF%8D%E5%88%86%E7%BB%84.md) | 数组、哈希表、字符串、排序 | 中等 | -| 0599 | [两个列表的最小索引总和](https://leetcode.cn/problems/minimum-index-sum-of-two-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0599.%20%E4%B8%A4%E4%B8%AA%E5%88%97%E8%A1%A8%E7%9A%84%E6%9C%80%E5%B0%8F%E7%B4%A2%E5%BC%95%E6%80%BB%E5%92%8C.md) | 数组、哈希表、字符串 | 简单 | -| 0387 | [字符串中的第一个唯一字符](https://leetcode.cn/problems/first-unique-character-in-a-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0387.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%94%AF%E4%B8%80%E5%AD%97%E7%AC%A6.md) | 队列、哈希表、字符串、计数 | 简单 | -| 0447 | [回旋镖的数量](https://leetcode.cn/problems/number-of-boomerangs/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0447.%20%E5%9B%9E%E6%97%8B%E9%95%96%E7%9A%84%E6%95%B0%E9%87%8F.md) | 数组、哈希表、数学 | 中等 | -| 0149 | [直线上最多的点数](https://leetcode.cn/problems/max-points-on-a-line/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0149.%20%E7%9B%B4%E7%BA%BF%E4%B8%8A%E6%9C%80%E5%A4%9A%E7%9A%84%E7%82%B9%E6%95%B0.md) | 几何、数组、哈希表、数学 | 困难 | -| 0359 | [日志速率限制器](https://leetcode.cn/problems/logger-rate-limiter/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0359.%20%E6%97%A5%E5%BF%97%E9%80%9F%E7%8E%87%E9%99%90%E5%88%B6%E5%99%A8.md) | 设计、哈希表 | 简单 | -| 0811 | [子域名访问计数](https://leetcode.cn/problems/subdomain-visit-count/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0811.%20%E5%AD%90%E5%9F%9F%E5%90%8D%E8%AE%BF%E9%97%AE%E8%AE%A1%E6%95%B0.md) | 数组、哈希表、字符串、计数 | 中等 | - diff --git a/Contents/05.Hash-Table/index.md b/Contents/05.Hash-Table/index.md deleted file mode 100644 index 16278edc..00000000 --- a/Contents/05.Hash-Table/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [哈希表知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/05.Hash-Table/01.Hash-Table.md) -- [哈希表题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/05.Hash-Table/02.Hash-Table-List.md) \ No newline at end of file diff --git a/Contents/06.String/01.String-Basic/02.String-Basic-List.md b/Contents/06.String/01.String-Basic/02.String-Basic-List.md deleted file mode 100644 index 44679425..00000000 --- a/Contents/06.String/01.String-Basic/02.String-Basic-List.md +++ /dev/null @@ -1,15 +0,0 @@ -### 字符串基础题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0125 | [验证回文串](https://leetcode.cn/problems/valid-palindrome/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0125.%20%E9%AA%8C%E8%AF%81%E5%9B%9E%E6%96%87%E4%B8%B2.md) | 双指针、字符串 | 简单 | -| 0005 | [最长回文子串](https://leetcode.cn/problems/longest-palindromic-substring/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0005.%20%E6%9C%80%E9%95%BF%E5%9B%9E%E6%96%87%E5%AD%90%E4%B8%B2.md) | 字符串、动态规划 | 中等 | -| 0003 | [无重复字符的最长子串](https://leetcode.cn/problems/longest-substring-without-repeating-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0003.%20%E6%97%A0%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2.md) | 哈希表、字符串、滑动窗口 | 中等 | -| 0344 | [反转字符串](https://leetcode.cn/problems/reverse-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0344.%20%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 双指针、字符串 | 简单 | -| 0557 | [反转字符串中的单词 III](https://leetcode.cn/problems/reverse-words-in-a-string-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0557.%20%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%8D%95%E8%AF%8D%20III.md) | 双指针、字符串 | 简单 | -| 0049 | [字母异位词分组](https://leetcode.cn/problems/group-anagrams/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0049.%20%E5%AD%97%E6%AF%8D%E5%BC%82%E4%BD%8D%E8%AF%8D%E5%88%86%E7%BB%84.md) | 数组、哈希表、字符串、排序 | 中等 | -| 0415 | [字符串相加](https://leetcode.cn/problems/add-strings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0415.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E5%8A%A0.md) | 数学、字符串、模拟 | 简单 | -| 0151 | [反转字符串中的单词](https://leetcode.cn/problems/reverse-words-in-a-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0151.%20%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%8D%95%E8%AF%8D.md) | 双指针、字符串 | 中等 | -| 0043 | [字符串相乘](https://leetcode.cn/problems/multiply-strings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0043.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E4%B9%98.md) | 数学、字符串、模拟 | 中等 | -| 0014 | [最长公共前缀](https://leetcode.cn/problems/longest-common-prefix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0014.%20%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%89%8D%E7%BC%80.md) | 字典树、字符串 | 简单 | - diff --git a/Contents/06.String/01.String-Basic/index.md b/Contents/06.String/01.String-Basic/index.md deleted file mode 100644 index 784ecfdf..00000000 --- a/Contents/06.String/01.String-Basic/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [字符串基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/01.String-Basic/01.String-Basic.md) -- [字符串经典题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/01.String-Basic/02.String-Basic-List.md) \ No newline at end of file diff --git a/Contents/06.String/02.String-Single-Pattern-Matching/07.String-Single-Pattern-Matching-List.md b/Contents/06.String/02.String-Single-Pattern-Matching/07.String-Single-Pattern-Matching-List.md deleted file mode 100644 index 966cb4b5..00000000 --- a/Contents/06.String/02.String-Single-Pattern-Matching/07.String-Single-Pattern-Matching-List.md +++ /dev/null @@ -1,12 +0,0 @@ -### 单模式串匹配题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0028 | [找出字符串中第一个匹配项的下标](https://leetcode.cn/problems/find-the-index-of-the-first-occurrence-in-a-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0028.%20%E6%89%BE%E5%87%BA%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%8C%B9%E9%85%8D%E9%A1%B9%E7%9A%84%E4%B8%8B%E6%A0%87.md) | 双指针、字符串、字符串匹配 | 中等 | -| 0459 | [重复的子字符串](https://leetcode.cn/problems/repeated-substring-pattern/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0459.%20%E9%87%8D%E5%A4%8D%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 字符串、字符串匹配 | 简单 | -| 0686 | [重复叠加字符串匹配](https://leetcode.cn/problems/repeated-string-match/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0686.%20%E9%87%8D%E5%A4%8D%E5%8F%A0%E5%8A%A0%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%8C%B9%E9%85%8D.md) | 字符串、字符串匹配 | 中等 | -| 1668 | [最大重复子字符串](https://leetcode.cn/problems/maximum-repeating-substring/) | | 字符串、字符串匹配 | 简单 | -| 0796 | [旋转字符串](https://leetcode.cn/problems/rotate-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0796.%20%E6%97%8B%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 字符串、字符串匹配 | 简单 | -| 1408 | [数组中的字符串匹配](https://leetcode.cn/problems/string-matching-in-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1408.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%8C%B9%E9%85%8D.md) | 数组、字符串、字符串匹配 | 简单 | -| 2156 | [查找给定哈希值的子串](https://leetcode.cn/problems/find-substring-with-given-hash-value/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2156.%20%E6%9F%A5%E6%89%BE%E7%BB%99%E5%AE%9A%E5%93%88%E5%B8%8C%E5%80%BC%E7%9A%84%E5%AD%90%E4%B8%B2.md) | 字符串、滑动窗口、哈希函数、滚动哈希 | 困难 | - diff --git a/Contents/06.String/02.String-Single-Pattern-Matching/index.md b/Contents/06.String/02.String-Single-Pattern-Matching/index.md deleted file mode 100644 index bc823dec..00000000 --- a/Contents/06.String/02.String-Single-Pattern-Matching/index.md +++ /dev/null @@ -1,9 +0,0 @@ -## 本章内容 - -- [Brute Force 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/01.String-Brute-Force.md) -- [Rabin Karp 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/02.String-Rabin-Karp.md) -- [KMP 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/03.String-KMP.md) -- [Boyer Moore 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/04.String-Boyer-Moore.md) -- [Horspool 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/05.String-Horspool.md) -- [Sunday 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/06.String-Sunday.md) -- [单模式串匹配题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/07.String-Single-Pattern-Matching-List.md) \ No newline at end of file diff --git a/Contents/06.String/03.String-Multi-Pattern-Matching/02.Trie-List.md b/Contents/06.String/03.String-Multi-Pattern-Matching/02.Trie-List.md deleted file mode 100644 index 9cecd882..00000000 --- a/Contents/06.String/03.String-Multi-Pattern-Matching/02.Trie-List.md +++ /dev/null @@ -1,17 +0,0 @@ -### 字典树题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0208 | [实现 Trie (前缀树)](https://leetcode.cn/problems/implement-trie-prefix-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0208.%20%E5%AE%9E%E7%8E%B0%20Trie%20%28%E5%89%8D%E7%BC%80%E6%A0%91%29.md) | 设计、字典树、哈希表、字符串 | 中等 | -| 0677 | [键值映射](https://leetcode.cn/problems/map-sum-pairs/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0677.%20%E9%94%AE%E5%80%BC%E6%98%A0%E5%B0%84.md) | 设计、字典树、哈希表、字符串 | 中等 | -| 0648 | [单词替换](https://leetcode.cn/problems/replace-words/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0648.%20%E5%8D%95%E8%AF%8D%E6%9B%BF%E6%8D%A2.md) | 字典树、数组、哈希表、字符串 | 中等 | -| 0642 | [设计搜索自动补全系统](https://leetcode.cn/problems/design-search-autocomplete-system/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0642.%20%E8%AE%BE%E8%AE%A1%E6%90%9C%E7%B4%A2%E8%87%AA%E5%8A%A8%E8%A1%A5%E5%85%A8%E7%B3%BB%E7%BB%9F.md) | 设计、字典树、字符串、数据流 | 困难 | -| 0211 | [添加与搜索单词 - 数据结构设计](https://leetcode.cn/problems/design-add-and-search-words-data-structure/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0211.%20%E6%B7%BB%E5%8A%A0%E4%B8%8E%E6%90%9C%E7%B4%A2%E5%8D%95%E8%AF%8D%20-%20%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E8%AE%BE%E8%AE%A1.md) | 深度优先搜索、设计、字典树、字符串 | 中等 | -| 0421 | [数组中两个数的最大异或值](https://leetcode.cn/problems/maximum-xor-of-two-numbers-in-an-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0421.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%9A%84%E6%9C%80%E5%A4%A7%E5%BC%82%E6%88%96%E5%80%BC.md) | 位运算、字典树、数组、哈希表 | 中等 | -| 0212 | [单词搜索 II](https://leetcode.cn/problems/word-search-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0212.%20%E5%8D%95%E8%AF%8D%E6%90%9C%E7%B4%A2%20II.md) | 字典树、数组、字符串、回溯、矩阵 | 困难 | -| 0425 | [单词方块](https://leetcode.cn/problems/word-squares/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0425.%20%E5%8D%95%E8%AF%8D%E6%96%B9%E5%9D%97.md) | 字典树、数组、字符串、回溯 | 困难 | -| 0336 | [回文对](https://leetcode.cn/problems/palindrome-pairs/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0336.%20%E5%9B%9E%E6%96%87%E5%AF%B9.md) | 字典树、数组、哈希表、字符串 | 困难 | -| 1023 | [驼峰式匹配](https://leetcode.cn/problems/camelcase-matching/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1023.%20%E9%A9%BC%E5%B3%B0%E5%BC%8F%E5%8C%B9%E9%85%8D.md) | 字典树、双指针、字符串、字符串匹配 | 中等 | -| 0676 | [实现一个魔法字典](https://leetcode.cn/problems/implement-magic-dictionary/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0676.%20%E5%AE%9E%E7%8E%B0%E4%B8%80%E4%B8%AA%E9%AD%94%E6%B3%95%E5%AD%97%E5%85%B8.md) | 设计、字典树、哈希表、字符串 | 中等 | -| 0440 | [字典序的第K小数字](https://leetcode.cn/problems/k-th-smallest-in-lexicographical-order/) | | 字典树 | 困难 | - diff --git a/Contents/06.String/03.String-Multi-Pattern-Matching/03.AC-Automaton.md b/Contents/06.String/03.String-Multi-Pattern-Matching/03.AC-Automaton.md deleted file mode 100644 index 73663069..00000000 --- a/Contents/06.String/03.String-Multi-Pattern-Matching/03.AC-Automaton.md +++ /dev/null @@ -1,27 +0,0 @@ -## 1. AC 自动机简介 - -> **AC 自动机（Aho-Corasick Automaton）**：该算法在 1975 年产生于贝尔实验室，是最著名的多模式匹配算法之一。简单来说，AC 自动机是以 **字典树（Trie）** 的结构为基础，结合 **KMP 算法思想** 建立的。 - -AC 自动机的构造有 3 个步骤： - -1. 构造一棵字典树（Trie），作为 AC 自动机的搜索数据结构。 -2. 利用 KMP 算法思想，构造失配指针。使得当前字符失配时可以通过失配指针跳转到具有最长公共前后缀的字符位置上继续匹配。 -3. 扫描文本串进行匹配。 - -## 2. AC 自动机原理 - -接下来我们以一个例子来说明一下 AC 自动机的原理。 - -> 描述：给定 5 个单词，分别是 `say`、`she`、`shr`、`he`、`her`，再给定一个文本串 `yasherhs`。 -> -> 要求：计算出有多少个单词在文本串中出现过。 - -### 2.1 构造一棵字典树（Trie） - -首先我们需要建立一棵字典树。 - -### 2.2 构造失配指针 - -### 2.3 扫描文本串 - -## 3. AC 自动机的应用 \ No newline at end of file diff --git a/Contents/06.String/03.String-Multi-Pattern-Matching/05.Suffix-Array.md b/Contents/06.String/03.String-Multi-Pattern-Matching/05.Suffix-Array.md deleted file mode 100644 index e69de29b..00000000 diff --git a/Contents/06.String/03.String-Multi-Pattern-Matching/06.Suffix-Array-List.md b/Contents/06.String/03.String-Multi-Pattern-Matching/06.Suffix-Array-List.md deleted file mode 100644 index e69de29b..00000000 diff --git a/Contents/06.String/03.String-Multi-Pattern-Matching/index.md b/Contents/06.String/03.String-Multi-Pattern-Matching/index.md deleted file mode 100644 index 60064500..00000000 --- a/Contents/06.String/03.String-Multi-Pattern-Matching/index.md +++ /dev/null @@ -1,8 +0,0 @@ -## 本章内容 - -- [字典树知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/01.Trie.md) -- [字典树题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/02.Trie-List.md) -- [AC 自动机知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/03.AC-Automaton.md) -- [AC 自动机题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/04.AC-Automaton-List.md) -- [后缀数组知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/05.Suffix-Array.md) -- [后缀数组题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/06.Suffix-Array-List.md) \ No newline at end of file diff --git a/Contents/06.String/index.md b/Contents/06.String/index.md deleted file mode 100644 index d931547d..00000000 --- a/Contents/06.String/index.md +++ /dev/null @@ -1,25 +0,0 @@ -## 本章内容 - -### 字符串基础知识 - -- [字符串基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/01.String-Basic/01.String-Basic.md) -- [字符串经典题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/01.String-Basic/02.String-Basic-List.md) - -### 单模式串匹配 - -- [Brute Force 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/01.String-Brute-Force.md) -- [Rabin Karp 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/02.String-Rabin-Karp.md) -- [KMP 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/03.String-KMP.md) -- [Boyer Moore 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/04.String-Boyer-Moore.md) -- [Horspool 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/05.String-Horspool.md) -- [Sunday 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/06.String-Sunday.md) -- [单模式串匹配题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/07.String-Single-Pattern-Matching-List.md) - -### 多模式串匹配 - -- [字典树知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/01.Trie.md) -- [字典树题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/02.Trie-List.md) -- [AC 自动机知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/03.AC-Automaton.md) -- [AC 自动机题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/04.AC-Automaton-List.md) -- [后缀数组知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/05.Suffix-Array.md) -- [后缀数组题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/06.Suffix-Array-List.md) \ No newline at end of file diff --git a/Contents/07.Tree/01.Binary-Tree/03.Binary-Tree-Traverse-List.md b/Contents/07.Tree/01.Binary-Tree/03.Binary-Tree-Traverse-List.md deleted file mode 100644 index a1bbc360..00000000 --- a/Contents/07.Tree/01.Binary-Tree/03.Binary-Tree-Traverse-List.md +++ /dev/null @@ -1,27 +0,0 @@ -### 二叉树的遍历题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0144 | [二叉树的前序遍历](https://leetcode.cn/problems/binary-tree-preorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0144.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%89%8D%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索、二叉树 | 简单 | -| 0094 | [二叉树的中序遍历](https://leetcode.cn/problems/binary-tree-inorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0094.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E4%B8%AD%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索、二叉树 | 简单 | -| 0145 | [二叉树的后序遍历](https://leetcode.cn/problems/binary-tree-postorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0145.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索、二叉树 | 简单 | -| 0102 | [二叉树的层序遍历](https://leetcode.cn/problems/binary-tree-level-order-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0102.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%B1%82%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 树、广度优先搜索、二叉树 | 中等 | -| 0103 | [二叉树的锯齿形层序遍历](https://leetcode.cn/problems/binary-tree-zigzag-level-order-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0103.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%94%AF%E9%BD%BF%E5%BD%A2%E5%B1%82%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 树、广度优先搜索、二叉树 | 中等 | -| 0107 | [二叉树的层序遍历 II](https://leetcode.cn/problems/binary-tree-level-order-traversal-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0107.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%B1%82%E5%BA%8F%E9%81%8D%E5%8E%86%20II.md) | 树、广度优先搜索、二叉树 | 中等 | -| 0104 | [二叉树的最大深度](https://leetcode.cn/problems/maximum-depth-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0104.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%A4%A7%E6%B7%B1%E5%BA%A6.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0111 | [二叉树的最小深度](https://leetcode.cn/problems/minimum-depth-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0111.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%B0%8F%E6%B7%B1%E5%BA%A6.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0124 | [二叉树中的最大路径和](https://leetcode.cn/problems/binary-tree-maximum-path-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0124.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E8%B7%AF%E5%BE%84%E5%92%8C.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | -| 0101 | [对称二叉树](https://leetcode.cn/problems/symmetric-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0101.%20%E5%AF%B9%E7%A7%B0%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0112 | [路径总和](https://leetcode.cn/problems/path-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0112.%20%E8%B7%AF%E5%BE%84%E6%80%BB%E5%92%8C.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0113 | [路径总和 II](https://leetcode.cn/problems/path-sum-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0113.%20%E8%B7%AF%E5%BE%84%E6%80%BB%E5%92%8C%20II.md) | 树、深度优先搜索、回溯、二叉树 | 中等 | -| 0236 | [二叉树的最近公共祖先](https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0236.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88.md) | 树、深度优先搜索、二叉树 | 中等 | -| 0199 | [二叉树的右视图](https://leetcode.cn/problems/binary-tree-right-side-view/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0199.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%8F%B3%E8%A7%86%E5%9B%BE.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | -| 0226 | [翻转二叉树](https://leetcode.cn/problems/invert-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0226.%20%E7%BF%BB%E8%BD%AC%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0958 | [二叉树的完全性检验](https://leetcode.cn/problems/check-completeness-of-a-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0958.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%AE%8C%E5%85%A8%E6%80%A7%E6%A3%80%E9%AA%8C.md) | 树、广度优先搜索、二叉树 | 中等 | -| 0572 | [另一棵树的子树](https://leetcode.cn/problems/subtree-of-another-tree/) | | 树、深度优先搜索、二叉树、字符串匹配、哈希函数 | 简单 | -| 0100 | [相同的树](https://leetcode.cn/problems/same-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0100.%20%E7%9B%B8%E5%90%8C%E7%9A%84%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0116 | [填充每个节点的下一个右侧节点指针](https://leetcode.cn/problems/populating-next-right-pointers-in-each-node/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0116.%20%E5%A1%AB%E5%85%85%E6%AF%8F%E4%B8%AA%E8%8A%82%E7%82%B9%E7%9A%84%E4%B8%8B%E4%B8%80%E4%B8%AA%E5%8F%B3%E4%BE%A7%E8%8A%82%E7%82%B9%E6%8C%87%E9%92%88.md) | 树、深度优先搜索、广度优先搜索、链表、二叉树 | 中等 | -| 0117 | [填充每个节点的下一个右侧节点指针 II](https://leetcode.cn/problems/populating-next-right-pointers-in-each-node-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0117.%20%E5%A1%AB%E5%85%85%E6%AF%8F%E4%B8%AA%E8%8A%82%E7%82%B9%E7%9A%84%E4%B8%8B%E4%B8%80%E4%B8%AA%E5%8F%B3%E4%BE%A7%E8%8A%82%E7%82%B9%E6%8C%87%E9%92%88%20II.md) | 树、深度优先搜索、广度优先搜索、链表、二叉树 | 中等 | -| 0297 | [二叉树的序列化与反序列化](https://leetcode.cn/problems/serialize-and-deserialize-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0297.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%BA%8F%E5%88%97%E5%8C%96%E4%B8%8E%E5%8F%8D%E5%BA%8F%E5%88%97%E5%8C%96.md) | 树、深度优先搜索、广度优先搜索、设计、字符串、二叉树 | 困难 | -| 0114 | [二叉树展开为链表](https://leetcode.cn/problems/flatten-binary-tree-to-linked-list/) | | 栈、树、深度优先搜索、链表、二叉树 | 中等 | - diff --git a/Contents/07.Tree/01.Binary-Tree/05.Binary-Tree-Reduction-List.md b/Contents/07.Tree/01.Binary-Tree/05.Binary-Tree-Reduction-List.md deleted file mode 100644 index fff819ec..00000000 --- a/Contents/07.Tree/01.Binary-Tree/05.Binary-Tree-Reduction-List.md +++ /dev/null @@ -1,8 +0,0 @@ -### 二叉树的还原题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0105 | [从前序与中序遍历序列构造二叉树](https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0105.%20%E4%BB%8E%E5%89%8D%E5%BA%8F%E4%B8%8E%E4%B8%AD%E5%BA%8F%E9%81%8D%E5%8E%86%E5%BA%8F%E5%88%97%E6%9E%84%E9%80%A0%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、数组、哈希表、分治、二叉树 | 中等 | -| 0106 | [从中序与后序遍历序列构造二叉树](https://leetcode.cn/problems/construct-binary-tree-from-inorder-and-postorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0106.%20%E4%BB%8E%E4%B8%AD%E5%BA%8F%E4%B8%8E%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86%E5%BA%8F%E5%88%97%E6%9E%84%E9%80%A0%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、数组、哈希表、分治、二叉树 | 中等 | -| 0889 | [根据前序和后序遍历构造二叉树](https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-postorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0889.%20%E6%A0%B9%E6%8D%AE%E5%89%8D%E5%BA%8F%E5%92%8C%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86%E6%9E%84%E9%80%A0%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、数组、哈希表、分治、二叉树 | 中等 | - diff --git a/Contents/07.Tree/01.Binary-Tree/index.md b/Contents/07.Tree/01.Binary-Tree/index.md deleted file mode 100644 index d962991b..00000000 --- a/Contents/07.Tree/01.Binary-Tree/index.md +++ /dev/null @@ -1,7 +0,0 @@ -## 本章内容 - -- [树与二叉树基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/01.Binary-Tree-Basic.md) -- [二叉树的遍历知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/02.Binary-Tree-Traverse.md) -- [二叉树的遍历题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/03.Binary-Tree-Traverse-List.md) -- [二叉树的还原知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/04.Binary-Tree-Reduction.md) -- [二叉树的还原题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/05.Binary-Tree-Reduction-List.md) \ No newline at end of file diff --git a/Contents/07.Tree/02.Binary-Search-Tree/02.Binary-Search-Tree-List.md b/Contents/07.Tree/02.Binary-Search-Tree/02.Binary-Search-Tree-List.md deleted file mode 100644 index 6d06541d..00000000 --- a/Contents/07.Tree/02.Binary-Search-Tree/02.Binary-Search-Tree-List.md +++ /dev/null @@ -1,17 +0,0 @@ -### 二叉搜索树题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0098 | [验证二叉搜索树](https://leetcode.cn/problems/validate-binary-search-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0098.%20%E9%AA%8C%E8%AF%81%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | -| 0173 | [二叉搜索树迭代器](https://leetcode.cn/problems/binary-search-tree-iterator/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0173.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E8%BF%AD%E4%BB%A3%E5%99%A8.md) | 栈、树、设计、二叉搜索树、二叉树、迭代器 | 中等 | -| 0700 | [二叉搜索树中的搜索](https://leetcode.cn/problems/search-in-a-binary-search-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0700.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E6%90%9C%E7%B4%A2.md) | 树、二叉搜索树、二叉树 | 简单 | -| 0701 | [二叉搜索树中的插入操作](https://leetcode.cn/problems/insert-into-a-binary-search-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0701.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E6%8F%92%E5%85%A5%E6%93%8D%E4%BD%9C.md) | 树、二叉搜索树、二叉树 | 中等 | -| 0450 | [删除二叉搜索树中的节点](https://leetcode.cn/problems/delete-node-in-a-bst/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0450.%20%E5%88%A0%E9%99%A4%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E8%8A%82%E7%82%B9.md) | 树、二叉搜索树、二叉树 | 中等 | -| 0703 | [数据流中的第 K 大元素](https://leetcode.cn/problems/kth-largest-element-in-a-stream/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0703.%20%E6%95%B0%E6%8D%AE%E6%B5%81%E4%B8%AD%E7%9A%84%E7%AC%AC%20K%20%E5%A4%A7%E5%85%83%E7%B4%A0.md) | 树、设计、二叉搜索树、二叉树、数据流、堆（优先队列） | 简单 | -| 剑指 Offer 54 | [二叉搜索树的第k大节点](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2054.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E7%AC%ACk%E5%A4%A7%E8%8A%82%E7%82%B9.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 简单 | -| 0230 | [二叉搜索树中第K小的元素](https://leetcode.cn/problems/kth-smallest-element-in-a-bst/) | | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | -| 0235 | [二叉搜索树的最近公共祖先](https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-search-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0235.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | -| 0426 | [将二叉搜索树转化为排序的双向链表](https://leetcode.cn/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0426.%20%E5%B0%86%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E8%BD%AC%E5%8C%96%E4%B8%BA%E6%8E%92%E5%BA%8F%E7%9A%84%E5%8F%8C%E5%90%91%E9%93%BE%E8%A1%A8.md) | 栈、树、深度优先搜索、二叉搜索树、链表、二叉树、双向链表 | 中等 | -| 0108 | [将有序数组转换为二叉搜索树](https://leetcode.cn/problems/convert-sorted-array-to-binary-search-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0108.%20%E5%B0%86%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E8%BD%AC%E6%8D%A2%E4%B8%BA%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md) | 树、二叉搜索树、数组、分治、二叉树 | 简单 | -| 0110 | [平衡二叉树](https://leetcode.cn/problems/balanced-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0110.%20%E5%B9%B3%E8%A1%A1%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、二叉树 | 简单 | - diff --git a/Contents/07.Tree/02.Binary-Search-Tree/index.md b/Contents/07.Tree/02.Binary-Search-Tree/index.md deleted file mode 100644 index 2f1c88f7..00000000 --- a/Contents/07.Tree/02.Binary-Search-Tree/index.md +++ /dev/null @@ -1,5 +0,0 @@ -## 本章内容 - -- [二叉搜索树知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/02.Binary-Search-Tree/01.Binary-Search-Tree.md) -- [二叉搜索树题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/02.Binary-Search-Tree/02.Binary-Search-Tree-List.md) - diff --git a/Contents/07.Tree/03.Segment-Tree/02.Segment-Tree-List.md b/Contents/07.Tree/03.Segment-Tree/02.Segment-Tree-List.md deleted file mode 100644 index a9a1dc92..00000000 --- a/Contents/07.Tree/03.Segment-Tree/02.Segment-Tree-List.md +++ /dev/null @@ -1,37 +0,0 @@ -### 线段树题目 - -#### 单点更新题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0303 | [区域和检索 - 数组不可变](https://leetcode.cn/problems/range-sum-query-immutable/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0303.%20%E5%8C%BA%E5%9F%9F%E5%92%8C%E6%A3%80%E7%B4%A2%20-%20%E6%95%B0%E7%BB%84%E4%B8%8D%E5%8F%AF%E5%8F%98.md) | 设计、数组、前缀和 | 简单 | -| 0307 | [区域和检索 - 数组可修改](https://leetcode.cn/problems/range-sum-query-mutable/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0307.%20%E5%8C%BA%E5%9F%9F%E5%92%8C%E6%A3%80%E7%B4%A2%20-%20%E6%95%B0%E7%BB%84%E5%8F%AF%E4%BF%AE%E6%94%B9.md) | 设计、树状数组、线段树、数组 | 中等 | -| 0354 | [俄罗斯套娃信封问题](https://leetcode.cn/problems/russian-doll-envelopes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0354.%20%E4%BF%84%E7%BD%97%E6%96%AF%E5%A5%97%E5%A8%83%E4%BF%A1%E5%B0%81%E9%97%AE%E9%A2%98.md) | 数组、二分查找、动态规划、排序 | 困难 | - -#### 区间更新题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0370 | [区间加法](https://leetcode.cn/problems/range-addition/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0370.%20%E5%8C%BA%E9%97%B4%E5%8A%A0%E6%B3%95.md) | 数组、前缀和 | 中等 | -| 1109 | [航班预订统计](https://leetcode.cn/problems/corporate-flight-bookings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1109.%20%E8%88%AA%E7%8F%AD%E9%A2%84%E8%AE%A2%E7%BB%9F%E8%AE%A1.md) | 数组、前缀和 | 中等 | -| 1450 | [在既定时间做作业的学生人数](https://leetcode.cn/problems/number-of-students-doing-homework-at-a-given-time/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1450.%20%E5%9C%A8%E6%97%A2%E5%AE%9A%E6%97%B6%E9%97%B4%E5%81%9A%E4%BD%9C%E4%B8%9A%E7%9A%84%E5%AD%A6%E7%94%9F%E4%BA%BA%E6%95%B0.md) | 数组 | 简单 | -| 0673 | [最长递增子序列的个数](https://leetcode.cn/problems/number-of-longest-increasing-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0673.%20%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 树状数组、线段树、数组、动态规划 | 中等 | -| 1310 | [子数组异或查询](https://leetcode.cn/problems/xor-queries-of-a-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1310.%20%E5%AD%90%E6%95%B0%E7%BB%84%E5%BC%82%E6%88%96%E6%9F%A5%E8%AF%A2.md) | 位运算、数组、前缀和 | 中等 | -| 1851 | [包含每个查询的最小区间](https://leetcode.cn/problems/minimum-interval-to-include-each-query/) | | 数组、二分查找、排序、扫描线、堆（优先队列） | 困难 | - -#### 区间合并题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0729 | [我的日程安排表 I](https://leetcode.cn/problems/my-calendar-i/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0729.%20%E6%88%91%E7%9A%84%E6%97%A5%E7%A8%8B%E5%AE%89%E6%8E%92%E8%A1%A8%20I.md) | 设计、线段树、二分查找、有序集合 | 中等 | -| 0731 | [我的日程安排表 II](https://leetcode.cn/problems/my-calendar-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0731.%20%E6%88%91%E7%9A%84%E6%97%A5%E7%A8%8B%E5%AE%89%E6%8E%92%E8%A1%A8%20II.md) | 设计、线段树、二分查找、有序集合 | 中等 | -| 0732 | [我的日程安排表 III](https://leetcode.cn/problems/my-calendar-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0732.%20%E6%88%91%E7%9A%84%E6%97%A5%E7%A8%8B%E5%AE%89%E6%8E%92%E8%A1%A8%20III.md) | 设计、线段树、二分查找、有序集合 | 困难 | - -#### 扫描线问题 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0218 | [天际线问题](https://leetcode.cn/problems/the-skyline-problem/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0218.%20%E5%A4%A9%E9%99%85%E7%BA%BF%E9%97%AE%E9%A2%98.md) | 树状数组、线段树、数组、分治、有序集合、扫描线、堆（优先队列） | 困难 | -| 0391 | [完美矩形](https://leetcode.cn/problems/perfect-rectangle/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0391.%20%E5%AE%8C%E7%BE%8E%E7%9F%A9%E5%BD%A2.md) | 数组、扫描线 | 困难 | -| 0850 | [矩形面积 II](https://leetcode.cn/problems/rectangle-area-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0850.%20%E7%9F%A9%E5%BD%A2%E9%9D%A2%E7%A7%AF%20II.md) | 线段树、数组、有序集合、扫描线 | 困难 | - diff --git a/Contents/07.Tree/03.Segment-Tree/index.md b/Contents/07.Tree/03.Segment-Tree/index.md deleted file mode 100644 index c0fe57d3..00000000 --- a/Contents/07.Tree/03.Segment-Tree/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [线段树知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/03.Segment-Tree/01.Segment-Tree.md) -- [线段树题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/03.Segment-Tree/02.Segment-Tree-List.md) \ No newline at end of file diff --git a/Contents/07.Tree/04.Binary-Indexed-Tree/01.Binary-Indexed-Tree.md b/Contents/07.Tree/04.Binary-Indexed-Tree/01.Binary-Indexed-Tree.md deleted file mode 100644 index fa4ae282..00000000 --- a/Contents/07.Tree/04.Binary-Indexed-Tree/01.Binary-Indexed-Tree.md +++ /dev/null @@ -1,31 +0,0 @@ -## 1. 树状数组简介 - -### 1.1 树状数组的定义 - -> **树状数组（Binary Indexed Tree）**：也因其发明者命名为 Fenwick 树，最早 Peter M. Fenwick 于 1994 年以 A New Data Structure for Cumulative Frequency Tables 为题发表在 SOFTWARE PRACTICE AND EXPERIENCE。其初衷是解决数据压缩里的累积频率（Cumulative Frequency）的计算问题，现多用于高效计算数列的前缀和，区间和。它可以以 $O(\log n)$ 的时间得到任意前缀 $\sum_{i=1}^{j}A[i], 1 \le j \le n$，并同时支持在 $O(\log n)$ 时间内支持动态单点值的修改。空间复杂度为 $O(n)$。 - -### 1.2 树状数组的原理 - -## 2. 树状数组的基本操作 - -### 2.1 树状数组的建立 - -### 2.2 树状数组的修改 - -### 2.3 树状数组的求和 - -## 4. 树状数组的常见题型 - -### 4.1 单点更新 + 区间求值 - -### 4.2 区间更新 + 单点求值 - -### 4.3 求逆序对数 - -## 参考资料 - -- 【书籍】ACM-ICPC 程序设计系列 - 算法设计与实现 - 陈宇 吴昊 主编 -- 【书籍】算法训练营 陈小玉 著 -- 【博文】[聊聊树状数组 Binary Indexed Tree - halfrost](https://halfrost.com/binary_indexed_tree/) -- 【博文】[树状数组学习笔记 - AcWing](https://www.acwing.com/blog/content/80/) - diff --git a/Contents/07.Tree/04.Binary-Indexed-Tree/02.Binary-Indexed-Tree-List.md b/Contents/07.Tree/04.Binary-Indexed-Tree/02.Binary-Indexed-Tree-List.md deleted file mode 100644 index 9e5d5a02..00000000 --- a/Contents/07.Tree/04.Binary-Indexed-Tree/02.Binary-Indexed-Tree-List.md +++ /dev/null @@ -1,13 +0,0 @@ -### 树状数组题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0303 | [区域和检索 - 数组不可变](https://leetcode.cn/problems/range-sum-query-immutable/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0303.%20%E5%8C%BA%E5%9F%9F%E5%92%8C%E6%A3%80%E7%B4%A2%20-%20%E6%95%B0%E7%BB%84%E4%B8%8D%E5%8F%AF%E5%8F%98.md) | 设计、数组、前缀和 | 简单 | -| 0307 | [区域和检索 - 数组可修改](https://leetcode.cn/problems/range-sum-query-mutable/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0307.%20%E5%8C%BA%E5%9F%9F%E5%92%8C%E6%A3%80%E7%B4%A2%20-%20%E6%95%B0%E7%BB%84%E5%8F%AF%E4%BF%AE%E6%94%B9.md) | 设计、树状数组、线段树、数组 | 中等 | -| 0315 | [计算右侧小于当前元素的个数](https://leetcode.cn/problems/count-of-smaller-numbers-after-self/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0315.%20%E8%AE%A1%E7%AE%97%E5%8F%B3%E4%BE%A7%E5%B0%8F%E4%BA%8E%E5%BD%93%E5%89%8D%E5%85%83%E7%B4%A0%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 树状数组、线段树、数组、二分查找、分治、有序集合、归并排序 | 困难 | -| 1450 | [在既定时间做作业的学生人数](https://leetcode.cn/problems/number-of-students-doing-homework-at-a-given-time/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1450.%20%E5%9C%A8%E6%97%A2%E5%AE%9A%E6%97%B6%E9%97%B4%E5%81%9A%E4%BD%9C%E4%B8%9A%E7%9A%84%E5%AD%A6%E7%94%9F%E4%BA%BA%E6%95%B0.md) | 数组 | 简单 | -| 0354 | [俄罗斯套娃信封问题](https://leetcode.cn/problems/russian-doll-envelopes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0354.%20%E4%BF%84%E7%BD%97%E6%96%AF%E5%A5%97%E5%A8%83%E4%BF%A1%E5%B0%81%E9%97%AE%E9%A2%98.md) | 数组、二分查找、动态规划、排序 | 困难 | -| 0673 | [最长递增子序列的个数](https://leetcode.cn/problems/number-of-longest-increasing-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0673.%20%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 树状数组、线段树、数组、动态规划 | 中等 | -| 1310 | [子数组异或查询](https://leetcode.cn/problems/xor-queries-of-a-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1310.%20%E5%AD%90%E6%95%B0%E7%BB%84%E5%BC%82%E6%88%96%E6%9F%A5%E8%AF%A2.md) | 位运算、数组、前缀和 | 中等 | -| 1893 | [检查是否区域内所有整数都被覆盖](https://leetcode.cn/problems/check-if-all-the-integers-in-a-range-are-covered/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1893.%20%E6%A3%80%E6%9F%A5%E6%98%AF%E5%90%A6%E5%8C%BA%E5%9F%9F%E5%86%85%E6%89%80%E6%9C%89%E6%95%B4%E6%95%B0%E9%83%BD%E8%A2%AB%E8%A6%86%E7%9B%96.md) | 数组、哈希表、前缀和 | 简单 | - diff --git a/Contents/07.Tree/04.Binary-Indexed-Tree/index.md b/Contents/07.Tree/04.Binary-Indexed-Tree/index.md deleted file mode 100644 index f80203d7..00000000 --- a/Contents/07.Tree/04.Binary-Indexed-Tree/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [树状数组知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/04.Binary-Indexed-Tree/01.Binary-Indexed-Tree.md) -- [树状数组题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/04.Binary-Indexed-Tree/02.Binary-Indexed-Tree-List.md) \ No newline at end of file diff --git a/Contents/07.Tree/05.Union-Find/02.Union-Find-List.md b/Contents/07.Tree/05.Union-Find/02.Union-Find-List.md deleted file mode 100644 index 0d2d1b75..00000000 --- a/Contents/07.Tree/05.Union-Find/02.Union-Find-List.md +++ /dev/null @@ -1,18 +0,0 @@ -### 并查集题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0990 | [等式方程的可满足性](https://leetcode.cn/problems/satisfiability-of-equality-equations/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0990.%20%E7%AD%89%E5%BC%8F%E6%96%B9%E7%A8%8B%E7%9A%84%E5%8F%AF%E6%BB%A1%E8%B6%B3%E6%80%A7.md) | 并查集、图、数组、字符串 | 中等 | -| 0547 | [省份数量](https://leetcode.cn/problems/number-of-provinces/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0547.%20%E7%9C%81%E4%BB%BD%E6%95%B0%E9%87%8F.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 0684 | [冗余连接](https://leetcode.cn/problems/redundant-connection/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0684.%20%E5%86%97%E4%BD%99%E8%BF%9E%E6%8E%A5.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 1319 | [连通网络的操作次数](https://leetcode.cn/problems/number-of-operations-to-make-network-connected/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1319.%20%E8%BF%9E%E9%80%9A%E7%BD%91%E7%BB%9C%E7%9A%84%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 0765 | [情侣牵手](https://leetcode.cn/problems/couples-holding-hands/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0765.%20%E6%83%85%E4%BE%A3%E7%89%B5%E6%89%8B.md) | 贪心、深度优先搜索、广度优先搜索、并查集、图 | 困难 | -| 0399 | [除法求值](https://leetcode.cn/problems/evaluate-division/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0399.%20%E9%99%A4%E6%B3%95%E6%B1%82%E5%80%BC.md) | 深度优先搜索、广度优先搜索、并查集、图、数组、最短路 | 中等 | -| 0959 | [由斜杠划分区域](https://leetcode.cn/problems/regions-cut-by-slashes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0959.%20%E7%94%B1%E6%96%9C%E6%9D%A0%E5%88%92%E5%88%86%E5%8C%BA%E5%9F%9F.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 1631 | [最小体力消耗路径](https://leetcode.cn/problems/path-with-minimum-effort/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1631.%20%E6%9C%80%E5%B0%8F%E4%BD%93%E5%8A%9B%E6%B6%88%E8%80%97%E8%B7%AF%E5%BE%84.md) | 深度优先搜索、广度优先搜索、并查集、数组、二分查找、矩阵、堆（优先队列） | 中等 | -| 0778 | [水位上升的泳池中游泳](https://leetcode.cn/problems/swim-in-rising-water/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0778.%20%E6%B0%B4%E4%BD%8D%E4%B8%8A%E5%8D%87%E7%9A%84%E6%B3%B3%E6%B1%A0%E4%B8%AD%E6%B8%B8%E6%B3%B3.md) | 深度优先搜索、广度优先搜索、并查集、数组、二分查找、矩阵、堆（优先队列） | 困难 | -| 1202 | [交换字符串中的元素](https://leetcode.cn/problems/smallest-string-with-swaps/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1202.%20%E4%BA%A4%E6%8D%A2%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%85%83%E7%B4%A0.md) | 深度优先搜索、广度优先搜索、并查集、哈希表、字符串 | 中等 | -| 0947 | [移除最多的同行或同列石头](https://leetcode.cn/problems/most-stones-removed-with-same-row-or-column/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0947.%20%E7%A7%BB%E9%99%A4%E6%9C%80%E5%A4%9A%E7%9A%84%E5%90%8C%E8%A1%8C%E6%88%96%E5%90%8C%E5%88%97%E7%9F%B3%E5%A4%B4.md) | 深度优先搜索、并查集、图 | 中等 | -| 0803 | [打砖块](https://leetcode.cn/problems/bricks-falling-when-hit/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0803.%20%E6%89%93%E7%A0%96%E5%9D%97.md) | 并查集、数组、矩阵 | 困难 | -| 0128 | [最长连续序列](https://leetcode.cn/problems/longest-consecutive-sequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0128.%20%E6%9C%80%E9%95%BF%E8%BF%9E%E7%BB%AD%E5%BA%8F%E5%88%97.md) | 并查集、数组、哈希表 | 中等 | - diff --git a/Contents/07.Tree/05.Union-Find/index.md b/Contents/07.Tree/05.Union-Find/index.md deleted file mode 100644 index 9eba76ed..00000000 --- a/Contents/07.Tree/05.Union-Find/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [并查集知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/05.Union-Find/01.Union-Find.md) -- [并查集题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/05.Union-Find/02.Union-Find-List.md) \ No newline at end of file diff --git a/Contents/07.Tree/index.md b/Contents/07.Tree/index.md deleted file mode 100644 index ae371747..00000000 --- a/Contents/07.Tree/index.md +++ /dev/null @@ -1,29 +0,0 @@ -## 本章内容 - -### 二叉树 - -- [树与二叉树基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/01.Binary-Tree-Basic.md) -- [二叉树的遍历知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/02.Binary-Tree-Traverse.md) -- [二叉树的遍历题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/03.Binary-Tree-Traverse-List.md) -- [二叉树的还原知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/04.Binary-Tree-Reduction.md) -- [二叉树的还原题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/05.Binary-Tree-Reduction-List.md) - -### 二叉搜索树 - -- [二叉搜索树知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/02.Binary-Search-Tree/01.Binary-Search-Tree.md) -- [二叉搜索树题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/02.Binary-Search-Tree/02.Binary-Search-Tree-List.md) - -### 线段树 - -- [线段树知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/03.Segment-Tree/01.Segment-Tree.md) -- [线段树题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/03.Segment-Tree/02.Segment-Tree-List.md) - -### 树状数组 - -- [树状数组知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/04.Binary-Indexed-Tree/01.Binary-Indexed-Tree.md) -- [树状数组题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/04.Binary-Indexed-Tree/02.Binary-Indexed-Tree-List.md) - -### 并查集 - -- [并查集知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/05.Union-Find/01.Union-Find.md) -- [并查集题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/05.Union-Find/02.Union-Find-List.md) \ No newline at end of file diff --git a/Contents/08.Graph/01.Graph-Basic/index.md b/Contents/08.Graph/01.Graph-Basic/index.md deleted file mode 100644 index 03b14c94..00000000 --- a/Contents/08.Graph/01.Graph-Basic/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [图的定义和分类](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/01.Graph-Basic/01.Graph-Basic.md) -- [图的存储结构和问题应用](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/01.Graph-Basic/02.Graph-Structure.md) \ No newline at end of file diff --git a/Contents/08.Graph/02.Graph-Traversal/02.Graph-DFS-List.md b/Contents/08.Graph/02.Graph-Traversal/02.Graph-DFS-List.md deleted file mode 100644 index 32734567..00000000 --- a/Contents/08.Graph/02.Graph-Traversal/02.Graph-DFS-List.md +++ /dev/null @@ -1,38 +0,0 @@ -### 图的深度优先搜索题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0797 | [所有可能的路径](https://leetcode.cn/problems/all-paths-from-source-to-target/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0797.%20%E6%89%80%E6%9C%89%E5%8F%AF%E8%83%BD%E7%9A%84%E8%B7%AF%E5%BE%84.md) | 深度优先搜索、广度优先搜索、图、回溯 | 中等 | -| 0200 | [岛屿数量](https://leetcode.cn/problems/number-of-islands/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0200.%20%E5%B2%9B%E5%B1%BF%E6%95%B0%E9%87%8F.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | -| 0695 | [岛屿的最大面积](https://leetcode.cn/problems/max-area-of-island/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0695.%20%E5%B2%9B%E5%B1%BF%E7%9A%84%E6%9C%80%E5%A4%A7%E9%9D%A2%E7%A7%AF.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | -| 0133 | [克隆图](https://leetcode.cn/problems/clone-graph/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0133.%20%E5%85%8B%E9%9A%86%E5%9B%BE.md) | 深度优先搜索、广度优先搜索、图、哈希表 | 中等 | -| 0494 | [目标和](https://leetcode.cn/problems/target-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0494.%20%E7%9B%AE%E6%A0%87%E5%92%8C.md) | 数组、动态规划、回溯 | 中等 | -| 0144 | [二叉树的前序遍历](https://leetcode.cn/problems/binary-tree-preorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0144.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%89%8D%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索、二叉树 | 简单 | -| 0094 | [二叉树的中序遍历](https://leetcode.cn/problems/binary-tree-inorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0094.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E4%B8%AD%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索、二叉树 | 简单 | -| 0145 | [二叉树的后序遍历](https://leetcode.cn/problems/binary-tree-postorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0145.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索、二叉树 | 简单 | -| 0589 | [N 叉树的前序遍历](https://leetcode.cn/problems/n-ary-tree-preorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0589.%20N%20%E5%8F%89%E6%A0%91%E7%9A%84%E5%89%8D%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索 | 简单 | -| 0590 | [N 叉树的后序遍历](https://leetcode.cn/problems/n-ary-tree-postorder-traversal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0590.%20N%20%E5%8F%89%E6%A0%91%E7%9A%84%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86.md) | 栈、树、深度优先搜索 | 简单 | -| 0124 | [二叉树中的最大路径和](https://leetcode.cn/problems/binary-tree-maximum-path-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0124.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E8%B7%AF%E5%BE%84%E5%92%8C.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | -| 0199 | [二叉树的右视图](https://leetcode.cn/problems/binary-tree-right-side-view/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0199.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%8F%B3%E8%A7%86%E5%9B%BE.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | -| 0543 | [二叉树的直径](https://leetcode.cn/problems/diameter-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0543.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E7%9B%B4%E5%BE%84.md) | 树、深度优先搜索、二叉树 | 简单 | -| 0662 | [二叉树最大宽度](https://leetcode.cn/problems/maximum-width-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0662.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E6%9C%80%E5%A4%A7%E5%AE%BD%E5%BA%A6.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | -| 0958 | [二叉树的完全性检验](https://leetcode.cn/problems/check-completeness-of-a-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0958.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%AE%8C%E5%85%A8%E6%80%A7%E6%A3%80%E9%AA%8C.md) | 树、广度优先搜索、二叉树 | 中等 | -| 0572 | [另一棵树的子树](https://leetcode.cn/problems/subtree-of-another-tree/) | | 树、深度优先搜索、二叉树、字符串匹配、哈希函数 | 简单 | -| 0100 | [相同的树](https://leetcode.cn/problems/same-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0100.%20%E7%9B%B8%E5%90%8C%E7%9A%84%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0111 | [二叉树的最小深度](https://leetcode.cn/problems/minimum-depth-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0111.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%B0%8F%E6%B7%B1%E5%BA%A6.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0841 | [钥匙和房间](https://leetcode.cn/problems/keys-and-rooms/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0841.%20%E9%92%A5%E5%8C%99%E5%92%8C%E6%88%BF%E9%97%B4.md) | 深度优先搜索、广度优先搜索、图 | 中等 | -| 0129 | [求根节点到叶节点数字之和](https://leetcode.cn/problems/sum-root-to-leaf-numbers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0129.%20%E6%B1%82%E6%A0%B9%E8%8A%82%E7%82%B9%E5%88%B0%E5%8F%B6%E8%8A%82%E7%82%B9%E6%95%B0%E5%AD%97%E4%B9%8B%E5%92%8C.md) | 树、深度优先搜索、二叉树 | 中等 | -| 0323 | [无向图中连通分量的数目](https://leetcode.cn/problems/number-of-connected-components-in-an-undirected-graph/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0323.%20%E6%97%A0%E5%90%91%E5%9B%BE%E4%B8%AD%E8%BF%9E%E9%80%9A%E5%88%86%E9%87%8F%E7%9A%84%E6%95%B0%E7%9B%AE.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 0684 | [冗余连接](https://leetcode.cn/problems/redundant-connection/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0684.%20%E5%86%97%E4%BD%99%E8%BF%9E%E6%8E%A5.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 0802 | [找到最终的安全状态](https://leetcode.cn/problems/find-eventual-safe-states/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0802.%20%E6%89%BE%E5%88%B0%E6%9C%80%E7%BB%88%E7%9A%84%E5%AE%89%E5%85%A8%E7%8A%B6%E6%80%81.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | -| 0785 | [判断二分图](https://leetcode.cn/problems/is-graph-bipartite/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0785.%20%E5%88%A4%E6%96%AD%E4%BA%8C%E5%88%86%E5%9B%BE.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 0886 | [可能的二分法](https://leetcode.cn/problems/possible-bipartition/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0886.%20%E5%8F%AF%E8%83%BD%E7%9A%84%E4%BA%8C%E5%88%86%E6%B3%95.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 0323 | [无向图中连通分量的数目](https://leetcode.cn/problems/number-of-connected-components-in-an-undirected-graph/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0323.%20%E6%97%A0%E5%90%91%E5%9B%BE%E4%B8%AD%E8%BF%9E%E9%80%9A%E5%88%86%E9%87%8F%E7%9A%84%E6%95%B0%E7%9B%AE.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 0130 | [被围绕的区域](https://leetcode.cn/problems/surrounded-regions/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0130.%20%E8%A2%AB%E5%9B%B4%E7%BB%95%E7%9A%84%E5%8C%BA%E5%9F%9F.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | -| 0417 | [太平洋大西洋水流问题](https://leetcode.cn/problems/pacific-atlantic-water-flow/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0417.%20%E5%A4%AA%E5%B9%B3%E6%B4%8B%E5%A4%A7%E8%A5%BF%E6%B4%8B%E6%B0%B4%E6%B5%81%E9%97%AE%E9%A2%98.md) | 深度优先搜索、广度优先搜索、数组、矩阵 | 中等 | -| 1020 | [飞地的数量](https://leetcode.cn/problems/number-of-enclaves/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1020.%20%E9%A3%9E%E5%9C%B0%E7%9A%84%E6%95%B0%E9%87%8F.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | -| 1254 | [统计封闭岛屿的数目](https://leetcode.cn/problems/number-of-closed-islands/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1254.%20%E7%BB%9F%E8%AE%A1%E5%B0%81%E9%97%AD%E5%B2%9B%E5%B1%BF%E7%9A%84%E6%95%B0%E7%9B%AE.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | -| 1034 | [边界着色](https://leetcode.cn/problems/coloring-a-border/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1034.%20%E8%BE%B9%E7%95%8C%E7%9D%80%E8%89%B2.md) | 深度优先搜索、广度优先搜索、数组、矩阵 | 中等 | -| 剑指 Offer 13 | [机器人的运动范围](https://leetcode.cn/problems/ji-qi-ren-de-yun-dong-fan-wei-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2013.%20%E6%9C%BA%E5%99%A8%E4%BA%BA%E7%9A%84%E8%BF%90%E5%8A%A8%E8%8C%83%E5%9B%B4.md) | 深度优先搜索、广度优先搜索、动态规划 | 中等 | -| 0529 | [扫雷游戏](https://leetcode.cn/problems/minesweeper/) | | 深度优先搜索、广度优先搜索、数组、矩阵 | 中等 | - diff --git a/Contents/08.Graph/02.Graph-Traversal/04.Graph-BFS-List.md b/Contents/08.Graph/02.Graph-Traversal/04.Graph-BFS-List.md deleted file mode 100644 index 388f15cd..00000000 --- a/Contents/08.Graph/02.Graph-Traversal/04.Graph-BFS-List.md +++ /dev/null @@ -1,23 +0,0 @@ -### 图的广度优先搜索题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0797 | [所有可能的路径](https://leetcode.cn/problems/all-paths-from-source-to-target/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0797.%20%E6%89%80%E6%9C%89%E5%8F%AF%E8%83%BD%E7%9A%84%E8%B7%AF%E5%BE%84.md) | 深度优先搜索、广度优先搜索、图、回溯 | 中等 | -| 0286 | [墙与门](https://leetcode.cn/problems/walls-and-gates/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0286.%20%E5%A2%99%E4%B8%8E%E9%97%A8.md) | 广度优先搜索、数组、矩阵 | 中等 | -| 0200 | [岛屿数量](https://leetcode.cn/problems/number-of-islands/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0200.%20%E5%B2%9B%E5%B1%BF%E6%95%B0%E9%87%8F.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | -| 0752 | [打开转盘锁](https://leetcode.cn/problems/open-the-lock/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0752.%20%E6%89%93%E5%BC%80%E8%BD%AC%E7%9B%98%E9%94%81.md) | 广度优先搜索、数组、哈希表、字符串 | 中等 | -| 0279 | [完全平方数](https://leetcode.cn/problems/perfect-squares/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0279.%20%E5%AE%8C%E5%85%A8%E5%B9%B3%E6%96%B9%E6%95%B0.md) | 广度优先搜索、数学、动态规划 | 中等 | -| 0133 | [克隆图](https://leetcode.cn/problems/clone-graph/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0133.%20%E5%85%8B%E9%9A%86%E5%9B%BE.md) | 深度优先搜索、广度优先搜索、图、哈希表 | 中等 | -| 0733 | [图像渲染](https://leetcode.cn/problems/flood-fill/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0733.%20%E5%9B%BE%E5%83%8F%E6%B8%B2%E6%9F%93.md) | 深度优先搜索、广度优先搜索、数组、矩阵 | 简单 | -| 0542 | [01 矩阵](https://leetcode.cn/problems/01-matrix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0542.%2001%20%E7%9F%A9%E9%98%B5.md) | 广度优先搜索、数组、动态规划、矩阵 | 中等 | -| 0322 | [零钱兑换](https://leetcode.cn/problems/coin-change/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0322.%20%E9%9B%B6%E9%92%B1%E5%85%91%E6%8D%A2.md) | 广度优先搜索、数组、动态规划 | 中等 | -| 0323 | [无向图中连通分量的数目](https://leetcode.cn/problems/number-of-connected-components-in-an-undirected-graph/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0323.%20%E6%97%A0%E5%90%91%E5%9B%BE%E4%B8%AD%E8%BF%9E%E9%80%9A%E5%88%86%E9%87%8F%E7%9A%84%E6%95%B0%E7%9B%AE.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | -| 剑指 Offer 13 | [机器人的运动范围](https://leetcode.cn/problems/ji-qi-ren-de-yun-dong-fan-wei-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2013.%20%E6%9C%BA%E5%99%A8%E4%BA%BA%E7%9A%84%E8%BF%90%E5%8A%A8%E8%8C%83%E5%9B%B4.md) | 深度优先搜索、广度优先搜索、动态规划 | 中等 | -| 0199 | [二叉树的右视图](https://leetcode.cn/problems/binary-tree-right-side-view/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0199.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%8F%B3%E8%A7%86%E5%9B%BE.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | -| 0662 | [二叉树最大宽度](https://leetcode.cn/problems/maximum-width-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0662.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E6%9C%80%E5%A4%A7%E5%AE%BD%E5%BA%A6.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | -| 0958 | [二叉树的完全性检验](https://leetcode.cn/problems/check-completeness-of-a-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0958.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%AE%8C%E5%85%A8%E6%80%A7%E6%A3%80%E9%AA%8C.md) | 树、广度优先搜索、二叉树 | 中等 | -| 0572 | [另一棵树的子树](https://leetcode.cn/problems/subtree-of-another-tree/) | | 树、深度优先搜索、二叉树、字符串匹配、哈希函数 | 简单 | -| 0100 | [相同的树](https://leetcode.cn/problems/same-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0100.%20%E7%9B%B8%E5%90%8C%E7%9A%84%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0111 | [二叉树的最小深度](https://leetcode.cn/problems/minimum-depth-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0111.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%B0%8F%E6%B7%B1%E5%BA%A6.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 剑指 Offer 32 - III | [从上到下打印二叉树 III](https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2032%20-%20III.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91%20III.md) | 树、广度优先搜索、二叉树 | 中等 | - diff --git a/Contents/08.Graph/02.Graph-Traversal/06.Graph-Topological-Sorting-List.md b/Contents/08.Graph/02.Graph-Traversal/06.Graph-Topological-Sorting-List.md deleted file mode 100644 index ff061023..00000000 --- a/Contents/08.Graph/02.Graph-Traversal/06.Graph-Topological-Sorting-List.md +++ /dev/null @@ -1,11 +0,0 @@ -### 图的拓扑排序题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0207 | [课程表](https://leetcode.cn/problems/course-schedule/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0207.%20%E8%AF%BE%E7%A8%8B%E8%A1%A8.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | -| 0210 | [课程表 II](https://leetcode.cn/problems/course-schedule-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0210.%20%E8%AF%BE%E7%A8%8B%E8%A1%A8%20II.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | -| 1136 | [并行课程](https://leetcode.cn/problems/parallel-courses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1136.%20%E5%B9%B6%E8%A1%8C%E8%AF%BE%E7%A8%8B.md) | 图、拓扑排序 | 中等 | -| 2050 | [并行课程 III](https://leetcode.cn/problems/parallel-courses-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2050.%20%E5%B9%B6%E8%A1%8C%E8%AF%BE%E7%A8%8B%20III.md) | 图、拓扑排序、数组、动态规划 | 困难 | -| 0802 | [找到最终的安全状态](https://leetcode.cn/problems/find-eventual-safe-states/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0802.%20%E6%89%BE%E5%88%B0%E6%9C%80%E7%BB%88%E7%9A%84%E5%AE%89%E5%85%A8%E7%8A%B6%E6%80%81.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | -| 0851 | [喧闹和富有](https://leetcode.cn/problems/loud-and-rich/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0851.%20%E5%96%A7%E9%97%B9%E5%92%8C%E5%AF%8C%E6%9C%89.md) | 深度优先搜索、图、拓扑排序、数组 | 中等 | - diff --git a/Contents/08.Graph/02.Graph-Traversal/index.md b/Contents/08.Graph/02.Graph-Traversal/index.md deleted file mode 100644 index c404d4b6..00000000 --- a/Contents/08.Graph/02.Graph-Traversal/index.md +++ /dev/null @@ -1,8 +0,0 @@ -## 本章内容 - -- [图的深度优先搜索知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/01.Graph-DFS.md) -- [图的深度优先搜索题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/02.Graph-DFS-List.md) -- [图的广度优先搜索知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/03.Graph-BFS.md) -- [图的广度优先搜索题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/04.Graph-BFS-List.md) -- [图的拓扑排序知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/05.Graph-Topological-Sorting.md) -- [图的拓扑排序题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/06.Graph-Topological-Sorting-List.md) \ No newline at end of file diff --git a/Contents/08.Graph/03.Graph-Spanning-Tree/01.Graph-Minimum-Spanning-Tree.md b/Contents/08.Graph/03.Graph-Spanning-Tree/01.Graph-Minimum-Spanning-Tree.md deleted file mode 100644 index d81c9a3d..00000000 --- a/Contents/08.Graph/03.Graph-Spanning-Tree/01.Graph-Minimum-Spanning-Tree.md +++ /dev/null @@ -1,81 +0,0 @@ -## 1. 最小生成树的定义 - -在了解「最小生成树」之前，我们需要要先理解 「生成树」的概念。 - -> **图的生成树（Spanning Tree）**：如果无向连通图 G 的一个子图是一棵包含图 G 所有顶点的树，则称该子图为 G 的生成树。生成树是连通图的包含图中的所有顶点的极小连通子图。图的生成树不惟一。从不同的顶点出发进行遍历，可以得到不同的生成树。 - -换句话说，生成树是原图 G 的一个子图，它包含了原图 G 的所有顶点，并且通过选择图中一部分边连接这些顶点，使得子图中没有环。 - -生成树有以下特点： - -1. **包含所有顶点**：生成树中包含了原图的所有顶点。 -2. **连通性**：生成树是原图的一个连通子图，意味着任意两个顶点之间都存在一条路径。 -3. **无环图**：生成树一个无环图。 -4. **边数最少**：在包含所有顶点的情况下，生成树的边数最少，其边数为顶点数减 $1$。 - -![](https://qcdn.itcharge.cn/images/20231211100145.png) - -如上图所示，左侧图 $G$ 是包含 $v_1…v_6$ 共 $6$ 个顶点 $7$ 条边在内的有权图。右侧是图 $G$ 的两个生成树，两者都包含了 $6$ 个顶点 $5$ 条边。 - -> **最小生成树（Minimum Spanning Tree）**：无向连通图 G 的所有生成树中，边的权值之和最小的生成树，被称为最小生成树。 - -最小生成树除了包含生成树的特点之外，还具有一个特点。 - -1. **边的权值之和最小**：在包含所有顶点的情况下，最小生成树的边的权重之和是所有可能的生成树中最小的。 - -![](https://qcdn.itcharge.cn/images/20231211101937.png) - -如上图所示，左侧图 $G$ 是包含 $v_1…v_6$ 共 $6$ 个顶点 $7$ 条边在内的有权图。右侧是图 $G$ 的最小生成树，包含了 $6$ 个顶点 $5$ 条边，并且所有边的权值和最小。 - -为了找到无向图的最小生成树，常用的算法有「Prim 算法」和「Kruskal 算法」。 - -- **Prim 算法**：从一个起始顶点出发，逐步选择与已经构建的树连接的最短边，直到包含所有顶点为止。 -- **Kruskal 算法**：基于边的排序和并查集数据结构，逐步添加边，并保证所选边不会构成环路，直到构建出最小生成树。 - -这两个算法都可以帮助我们找到图中的最小生成树，以满足连接所有顶点的要求同时使得总权重最小。 - -## 2. Prim 算法 - -### 2.1 Prim 算法的算法思想 - -> **Prim 算法的算法思想**：每次选择最短边来扩展最小生成树，从而保证生成树的总权重最小。算法通过不断扩展小生成树的顶点集合 $MST$，逐步构建出最小生成树。 - -### 2.2 Prim 算法的实现步骤 - -1. 将图 $G$ 中所有的顶点 $V$ 分为两个顶点集合 $V_A$ 和 $V_B$。其中 $V_A$ 为已经加入到最小生成树的顶点集合，$V_B$ 是还未加入生成树的顶点集合。 -2. 选择起始顶点 $start$，将其加入到最小生成树的顶点集合 $V_A$ 中。 -3. 从 $V_A$ 的顶点集合中选择一个顶点 $u$，然后找到连接顶点 $u$ 与 $V_B$ 之间的边中权重最小的边。 -4. 让上一步中找到的顶点和边加入到 $MST$ 中，更新 $MST$ 的顶点集合和边集合。 -5. 重复第 $3 \sim 4$ 步，直到 $MST$ 的顶点集合中包含了图中的所有顶点为止。 - -### 2.3 Prim 算法的实现代码 - -```python - -``` - -### 2.3 Prim 算法 - -## 03. Kruskal 算法 - -### 3.1 Kruskal 算法的算法思想 - -> **Kruskal 算法的算法思想**：通过依次选择权重最小的边并判断其两个端点是否连接在同一集合中，从而逐步构建最小生成树。这个过程保证了最终生成的树是无环的，并且总权重最小。 - -在实际实现中，我们通常使用并查集数据结构来管理顶点的集合信息，以便高效地判断两个顶点是否在同一个集合中，以及合并集合。 - -### 3.2 Kruskal 算法的实现步骤 - -1. 将图中所有边按照权重从小到大进行排序。 -2. 将每个顶点看做是一个单独集合，即初始时每个顶点自成一个集合。 -3. 按照排好序的边顺序，按照权重从小到大，依次遍历每一条边。 -4. 对于每条边，检查其连接的两个顶点所属的集合： - 1. 如果两个顶点属于同一个集合，则跳过这条边，以免形成环路。 - 2. 如果两个顶点不属于同一个集合，则将这条边加入到最小生成树中，同时合并这两个顶点所属的集合。 -5. 重复第 $3 \sim 4$ 步，直到最小生成树中的变数等于所有节点数减 $1$ 为止。 - -### 3.3 Kruskal 算法的实现代码 - -```python - -``` \ No newline at end of file diff --git a/Contents/08.Graph/03.Graph-Spanning-Tree/02.Graph-Minimum-Spanning-Tree-List.md b/Contents/08.Graph/03.Graph-Spanning-Tree/02.Graph-Minimum-Spanning-Tree-List.md deleted file mode 100644 index 0631b0aa..00000000 --- a/Contents/08.Graph/03.Graph-Spanning-Tree/02.Graph-Minimum-Spanning-Tree-List.md +++ /dev/null @@ -1,8 +0,0 @@ -### 图的最小生成树题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 1584 | [连接所有点的最小费用](https://leetcode.cn/problems/min-cost-to-connect-all-points/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1584.%20%E8%BF%9E%E6%8E%A5%E6%89%80%E6%9C%89%E7%82%B9%E7%9A%84%E6%9C%80%E5%B0%8F%E8%B4%B9%E7%94%A8.md) | 并查集、图、数组、最小生成树 | 中等 | -| 1631 | [最小体力消耗路径](https://leetcode.cn/problems/path-with-minimum-effort/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1631.%20%E6%9C%80%E5%B0%8F%E4%BD%93%E5%8A%9B%E6%B6%88%E8%80%97%E8%B7%AF%E5%BE%84.md) | 深度优先搜索、广度优先搜索、并查集、数组、二分查找、矩阵、堆（优先队列） | 中等 | -| 0778 | [水位上升的泳池中游泳](https://leetcode.cn/problems/swim-in-rising-water/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0778.%20%E6%B0%B4%E4%BD%8D%E4%B8%8A%E5%8D%87%E7%9A%84%E6%B3%B3%E6%B1%A0%E4%B8%AD%E6%B8%B8%E6%B3%B3.md) | 深度优先搜索、广度优先搜索、并查集、数组、二分查找、矩阵、堆（优先队列） | 困难 | - diff --git a/Contents/08.Graph/03.Graph-Spanning-Tree/index.md b/Contents/08.Graph/03.Graph-Spanning-Tree/index.md deleted file mode 100644 index 7de35b34..00000000 --- a/Contents/08.Graph/03.Graph-Spanning-Tree/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [图的最小生成树知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/03.Graph-Spanning-Tree/01.Graph-Minimum-Spanning-Tree.md) -- [图的最小生成树题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/03.Graph-Spanning-Tree/02.Graph-Minimum-Spanning-Tree-List.md) \ No newline at end of file diff --git a/Contents/08.Graph/04.Graph-Shortest-Path/01.Graph-Single-Source-Shortest-Path-01.md b/Contents/08.Graph/04.Graph-Shortest-Path/01.Graph-Single-Source-Shortest-Path-01.md deleted file mode 100644 index 6152ecb6..00000000 --- a/Contents/08.Graph/04.Graph-Shortest-Path/01.Graph-Single-Source-Shortest-Path-01.md +++ /dev/null @@ -1,53 +0,0 @@ -## 1. 单源最短路径的定义 - -> **单源最短路径（Single Source Shortest Path）**：对于一个带权图 $G = (V, E)$，其中每条边的权重是一个实数。另外，给定 $v$ 中的一个顶点，称之为源点。则源点到其他所有各个顶点之间的最短路径长度，称为单源最短路径。 - -这里的路径长度，指的是路径上各边权之和。 - -单源最短路径问题的核心是找到从源点到其他各个顶点的路径，使得路径上边的权重之和最小。这个问题在许多实际应用中都非常重要，比如网络路由、地图导航、通信网络优化等。 - -常见的解决单源最短路径问题的算法包括： - -1. **Dijkstra 算法**：一种贪心算法，用于解决无负权边的情况。它逐步扩展当前已知最短路径的范围，选择当前距离起始节点最近的节点，并更新与该节点相邻的节点的距离。 -2. **Bellman-Ford 算法**：适用于有负权边的情况。它通过多次迭代来逐步逼近最短路径，每次迭代都尝试通过更新边的权重来缩短路径。 -3. **SPFA 算法**：优化的 Bellman-Ford 算法，它在每次迭代中不遍历所有的边，而是选择性地更新与当前节点相关的边，从而提高了算法的效率。 - -这些算法根据图的特点和问题的需求有所不同，选择适合的算法可以在不同情况下有效地解决单源最短路径问题。 - -## 2. Dijkstra 算法 - -### 2.1 Dijkstra 算法的算法思想 - -> **Dijkstra 算法的算法思想**：通过逐步选择距离起始节点最近的节点，并根据这些节点的路径更新其他节点的距离，从而逐步找到最短路径。 - -### 2.2 Dijkstra 算法的实现步骤 - -### 2.3 Dijkstra 算法的实现代码 - -```python - -``` - -## 3. Bellman-Ford 算法 - -### 3.1 Bellman-Ford 算法的算法思想 - -### 3.2 Bellman-Ford 算法的实现步骤 - -### 3.3 Bellman-Ford 算法的实现代码 - -```python - -``` - -## 4. SPFA 算法 - -### 4.1 SPFA 算法的算法思想 - -### 4.2 SPFA 算法的实现步骤 - -### 4.3 SPFA 算法的实现代码 - -```python -``` - diff --git a/Contents/08.Graph/04.Graph-Shortest-Path/02.Graph-Single-Source-Shortest-Path-02.md b/Contents/08.Graph/04.Graph-Shortest-Path/02.Graph-Single-Source-Shortest-Path-02.md deleted file mode 100644 index e69de29b..00000000 diff --git a/Contents/08.Graph/04.Graph-Shortest-Path/03.Graph-Single-Source-Shortest-Path-List.md b/Contents/08.Graph/04.Graph-Shortest-Path/03.Graph-Single-Source-Shortest-Path-List.md deleted file mode 100644 index 686c2ea2..00000000 --- a/Contents/08.Graph/04.Graph-Shortest-Path/03.Graph-Single-Source-Shortest-Path-List.md +++ /dev/null @@ -1,10 +0,0 @@ -### 单源最短路径题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0407 | [接雨水 II](https://leetcode.cn/problems/trapping-rain-water-ii/) | | 广度优先搜索、数组、矩阵、堆（优先队列） | 困难 | -| 0743 | [网络延迟时间](https://leetcode.cn/problems/network-delay-time/) | | 深度优先搜索、广度优先搜索、图、最短路、堆（优先队列） | 中等 | -| 0787 | [K 站中转内最便宜的航班](https://leetcode.cn/problems/cheapest-flights-within-k-stops/) | | 深度优先搜索、广度优先搜索、图、动态规划、最短路、堆（优先队列） | 中等 | -| 1631 | [最小体力消耗路径](https://leetcode.cn/problems/path-with-minimum-effort/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1631.%20%E6%9C%80%E5%B0%8F%E4%BD%93%E5%8A%9B%E6%B6%88%E8%80%97%E8%B7%AF%E5%BE%84.md) | 深度优先搜索、广度优先搜索、并查集、数组、二分查找、矩阵、堆（优先队列） | 中等 | -| 1786 | [从第一个节点出发到最后一个节点的受限路径数](https://leetcode.cn/problems/number-of-restricted-paths-from-first-to-last-node/) | | 图、拓扑排序、动态规划、最短路、堆（优先队列） | 中等 | - diff --git a/Contents/08.Graph/04.Graph-Shortest-Path/04.Graph-Multi-Source-Shortest-Path.md b/Contents/08.Graph/04.Graph-Shortest-Path/04.Graph-Multi-Source-Shortest-Path.md deleted file mode 100644 index e69de29b..00000000 diff --git a/Contents/08.Graph/04.Graph-Shortest-Path/05.Graph-Multi-Source-Shortest-Path-List.md b/Contents/08.Graph/04.Graph-Shortest-Path/05.Graph-Multi-Source-Shortest-Path-List.md deleted file mode 100644 index 7a66c8e1..00000000 --- a/Contents/08.Graph/04.Graph-Shortest-Path/05.Graph-Multi-Source-Shortest-Path-List.md +++ /dev/null @@ -1,7 +0,0 @@ -### 多源最短路径题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0815 | [公交路线](https://leetcode.cn/problems/bus-routes/) | | 广度优先搜索、数组、哈希表 | 困难 | -| 1162 | [地图分析](https://leetcode.cn/problems/as-far-from-land-as-possible/) | | 广度优先搜索、数组、动态规划、矩阵 | 中等 | - diff --git a/Contents/08.Graph/04.Graph-Shortest-Path/06.Graph-The-Second-Shortest-Path.md b/Contents/08.Graph/04.Graph-Shortest-Path/06.Graph-The-Second-Shortest-Path.md deleted file mode 100644 index e69de29b..00000000 diff --git a/Contents/08.Graph/04.Graph-Shortest-Path/07.Graph-The-Second-Shortest-Path-List.md b/Contents/08.Graph/04.Graph-Shortest-Path/07.Graph-The-Second-Shortest-Path-List.md deleted file mode 100644 index b174a222..00000000 --- a/Contents/08.Graph/04.Graph-Shortest-Path/07.Graph-The-Second-Shortest-Path-List.md +++ /dev/null @@ -1,6 +0,0 @@ -### 次短路径题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 2045 | [到达目的地的第二短时间](https://leetcode.cn/problems/second-minimum-time-to-reach-destination/) | | 广度优先搜索、图、最短路 | 困难 | - diff --git a/Contents/08.Graph/04.Graph-Shortest-Path/08.Graph-System-Of-Difference-Constraints.md b/Contents/08.Graph/04.Graph-Shortest-Path/08.Graph-System-Of-Difference-Constraints.md deleted file mode 100644 index e69de29b..00000000 diff --git a/Contents/08.Graph/04.Graph-Shortest-Path/09.Graph-System-Of-Difference-Constraints-List.md b/Contents/08.Graph/04.Graph-Shortest-Path/09.Graph-System-Of-Difference-Constraints-List.md deleted file mode 100644 index a0ad57fa..00000000 --- a/Contents/08.Graph/04.Graph-Shortest-Path/09.Graph-System-Of-Difference-Constraints-List.md +++ /dev/null @@ -1,7 +0,0 @@ -### 差分约束系统 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0995 | [K 连续位的最小翻转次数](https://leetcode.cn/problems/minimum-number-of-k-consecutive-bit-flips/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0995.%20K%20%E8%BF%9E%E7%BB%AD%E4%BD%8D%E7%9A%84%E6%9C%80%E5%B0%8F%E7%BF%BB%E8%BD%AC%E6%AC%A1%E6%95%B0.md) | 位运算、队列、数组、前缀和、滑动窗口 | 困难 | -| 1109 | [航班预订统计](https://leetcode.cn/problems/corporate-flight-bookings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1109.%20%E8%88%AA%E7%8F%AD%E9%A2%84%E8%AE%A2%E7%BB%9F%E8%AE%A1.md) | 数组、前缀和 | 中等 | - diff --git a/Contents/08.Graph/04.Graph-Shortest-Path/index.md b/Contents/08.Graph/04.Graph-Shortest-Path/index.md deleted file mode 100644 index ed11ed6b..00000000 --- a/Contents/08.Graph/04.Graph-Shortest-Path/index.md +++ /dev/null @@ -1,11 +0,0 @@ -## 本章内容 - -- [单源最短路径知识（一）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/01.Graph-Single-Source-Shortest-Path-01.md) -- [单源最短路径知识（二）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/02.Graph-Single-Source-Shortest-Path-02.md) -- [单源最短路径题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/03.Graph-Single-Source-Shortest-Path-List.md) -- [多源最短路径知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/04.Graph-Multi-Source-Shortest-Path.md) -- [多源最短路径题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/05.Graph-Multi-Source-Shortest-Path-List.md) -- [次短路径知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/06.Graph-The-Second-Shortest-Path.md) -- [次短路径题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/07.Graph-The-Second-Shortest-Path-List.md) -- [差分约束系统知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/08.Graph-System-Of-Difference-Constraints.md) -- [差分约束系统题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/09.Graph-System-Of-Difference-Constraints-List.md) \ No newline at end of file diff --git a/Contents/08.Graph/05.Graph-Bipartite/01.Graph-Bipartite-Basic.md b/Contents/08.Graph/05.Graph-Bipartite/01.Graph-Bipartite-Basic.md deleted file mode 100644 index e69de29b..00000000 diff --git a/Contents/08.Graph/05.Graph-Bipartite/02.Graph-Bipartite-Basic-List.md b/Contents/08.Graph/05.Graph-Bipartite/02.Graph-Bipartite-Basic-List.md deleted file mode 100644 index 2dae199f..00000000 --- a/Contents/08.Graph/05.Graph-Bipartite/02.Graph-Bipartite-Basic-List.md +++ /dev/null @@ -1,6 +0,0 @@ -### 二分图基础题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0785 | [判断二分图](https://leetcode.cn/problems/is-graph-bipartite/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0785.%20%E5%88%A4%E6%96%AD%E4%BA%8C%E5%88%86%E5%9B%BE.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | - diff --git a/Contents/08.Graph/05.Graph-Bipartite/03.Graph-Bipartite-Matching.md b/Contents/08.Graph/05.Graph-Bipartite/03.Graph-Bipartite-Matching.md deleted file mode 100644 index e69de29b..00000000 diff --git a/Contents/08.Graph/05.Graph-Bipartite/04.Graph-Hungarian-Algorithm.md b/Contents/08.Graph/05.Graph-Bipartite/04.Graph-Hungarian-Algorithm.md deleted file mode 100644 index e69de29b..00000000 diff --git a/Contents/08.Graph/05.Graph-Bipartite/05.Graph-Hopcroft-Karp.md b/Contents/08.Graph/05.Graph-Bipartite/05.Graph-Hopcroft-Karp.md deleted file mode 100644 index e69de29b..00000000 diff --git a/Contents/08.Graph/05.Graph-Bipartite/06.Graph-Bipartite-Matching-List.md b/Contents/08.Graph/05.Graph-Bipartite/06.Graph-Bipartite-Matching-List.md deleted file mode 100644 index 2b0a9816..00000000 --- a/Contents/08.Graph/05.Graph-Bipartite/06.Graph-Bipartite-Matching-List.md +++ /dev/null @@ -1,8 +0,0 @@ -### 二分图最大匹配题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| LCP 04 | [覆盖](https://leetcode.cn/problems/broken-board-dominoes/) | | 位运算、图、数组、动态规划、状态压缩 | 困难 | -| 1947 | [最大兼容性评分和](https://leetcode.cn/problems/maximum-compatibility-score-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1947.%20%E6%9C%80%E5%A4%A7%E5%85%BC%E5%AE%B9%E6%80%A7%E8%AF%84%E5%88%86%E5%92%8C.md) | 位运算、数组、动态规划、回溯、状态压缩 | 中等 | -| 1595 | [连通两组点的最小成本](https://leetcode.cn/problems/minimum-cost-to-connect-two-groups-of-points/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1595.%20%E8%BF%9E%E9%80%9A%E4%B8%A4%E7%BB%84%E7%82%B9%E7%9A%84%E6%9C%80%E5%B0%8F%E6%88%90%E6%9C%AC.md) | 位运算、数组、动态规划、状态压缩、矩阵 | 困难 | - diff --git a/Contents/08.Graph/05.Graph-Bipartite/index.md b/Contents/08.Graph/05.Graph-Bipartite/index.md deleted file mode 100644 index 0cebef1e..00000000 --- a/Contents/08.Graph/05.Graph-Bipartite/index.md +++ /dev/null @@ -1,8 +0,0 @@ -## 本章内容 - -- [二分图基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/01.Graph-Bipartite-Basic.md) -- [二分图基础题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/02.Graph-Bipartite-Basic-List.md) -- [二分图最大匹配知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/03.Graph-Bipartite-Matching.md) -- [匈牙利算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/04.Graph-Hungarian-Algorithm.md) -- [Hopcroft-Karp 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/05.Graph-Hopcroft-Karp.md) -- [二分图最大匹配题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/06.Graph-Bipartite-Matching-List.md) \ No newline at end of file diff --git a/Contents/08.Graph/index.md b/Contents/08.Graph/index.md deleted file mode 100644 index 96dff5e7..00000000 --- a/Contents/08.Graph/index.md +++ /dev/null @@ -1,41 +0,0 @@ -## 本章内容 - -### 图的基础知识 - -- [图的定义和分类](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/01.Graph-Basic/01.Graph-Basic.md) -- [图的存储结构和问题应用](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/01.Graph-Basic/02.Graph-Structure.md) - -### 图的遍历 - -- [图的深度优先搜索知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/01.Graph-DFS.md) -- [图的深度优先搜索题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/02.Graph-DFS-List.md) -- [图的广度优先搜索知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/03.Graph-BFS.md) -- [图的广度优先搜索题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/04.Graph-BFS-List.md) -- [图的拓扑排序知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/05.Graph-Topological-Sorting.md) -- [图的拓扑排序题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/06.Graph-Topological-Sorting-List.md) - -### 图的生成树 - -- [图的最小生成树知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/03.Graph-Spanning-Tree/01.Graph-Minimum-Spanning-Tree.md) -- [图的最小生成树题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/03.Graph-Spanning-Tree/02.Graph-Minimum-Spanning-Tree-List.md) - -### 最短路径 - -- [单源最短路径知识（一）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/01.Graph-Single-Source-Shortest-Path-01.md) -- [单源最短路径知识（二）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/02.Graph-Single-Source-Shortest-Path-02.md) -- [单源最短路径题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/03.Graph-Single-Source-Shortest-Path-List.md) -- [多源最短路径知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/04.Graph-Multi-Source-Shortest-Path.md) -- [多源最短路径题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/05.Graph-Multi-Source-Shortest-Path-List.md) -- [次短路径知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/06.Graph-The-Second-Shortest-Path.md) -- [次短路径题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/07.Graph-The-Second-Shortest-Path-List.md) -- [差分约束系统知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/08.Graph-System-Of-Difference-Constraints.md) -- [差分约束系统题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/09.Graph-System-Of-Difference-Constraints-List.md) - -### 二分图 - -- [二分图基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/01.Graph-Bipartite-Basic.md) -- [二分图基础题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/02.Graph-Bipartite-Basic-List.md) -- [二分图最大匹配知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/03.Graph-Bipartite-Matching.md) -- [匈牙利算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/04.Graph-Hungarian-Algorithm.md) -- [Hopcroft-Karp 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/05.Graph-Hopcroft-Karp.md) -- [二分图最大匹配题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/06.Graph-Bipartite-Matching-List.md) \ No newline at end of file diff --git a/Contents/09.Algorithm-Base/01.Enumeration-Algorithm/02.Enumeration-Algorithm-List.md b/Contents/09.Algorithm-Base/01.Enumeration-Algorithm/02.Enumeration-Algorithm-List.md deleted file mode 100644 index ab965a29..00000000 --- a/Contents/09.Algorithm-Base/01.Enumeration-Algorithm/02.Enumeration-Algorithm-List.md +++ /dev/null @@ -1,14 +0,0 @@ -### 枚举算法题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0001 | [两数之和](https://leetcode.cn/problems/two-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0001.%20%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 数组、哈希表 | 简单 | -| 0204 | [计数质数](https://leetcode.cn/problems/count-primes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0204.%20%E8%AE%A1%E6%95%B0%E8%B4%A8%E6%95%B0.md) | 数组、数学、枚举、数论 | 中等 | -| 1925 | [统计平方和三元组的数目](https://leetcode.cn/problems/count-square-sum-triples/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1925.%20%E7%BB%9F%E8%AE%A1%E5%B9%B3%E6%96%B9%E5%92%8C%E4%B8%89%E5%85%83%E7%BB%84%E7%9A%84%E6%95%B0%E7%9B%AE.md) | 数学、枚举 | 简单 | -| 1450 | [在既定时间做作业的学生人数](https://leetcode.cn/problems/number-of-students-doing-homework-at-a-given-time/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1450.%20%E5%9C%A8%E6%97%A2%E5%AE%9A%E6%97%B6%E9%97%B4%E5%81%9A%E4%BD%9C%E4%B8%9A%E7%9A%84%E5%AD%A6%E7%94%9F%E4%BA%BA%E6%95%B0.md) | 数组 | 简单 | -| 1620 | [网络信号最好的坐标](https://leetcode.cn/problems/coordinate-with-maximum-network-quality/) | | 数组、枚举 | 中等 | -| 剑指 Offer 57 - II | [和为s的连续正数序列](https://leetcode.cn/problems/he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2057%20-%20II.%20%E5%92%8C%E4%B8%BAs%E7%9A%84%E8%BF%9E%E7%BB%AD%E6%AD%A3%E6%95%B0%E5%BA%8F%E5%88%97.md) | 数学、双指针、枚举 | 简单 | -| 0800 | [相似 RGB 颜色](https://leetcode.cn/problems/similar-rgb-color/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0800.%20%E7%9B%B8%E4%BC%BC%20RGB%20%E9%A2%9C%E8%89%B2.md) | 数学、字符串、枚举 | 简单 | -| 0221 | [最大正方形](https://leetcode.cn/problems/maximal-square/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0221.%20%E6%9C%80%E5%A4%A7%E6%AD%A3%E6%96%B9%E5%BD%A2.md) | 数组、动态规划、矩阵 | 中等 | -| 0560 | [和为 K 的子数组](https://leetcode.cn/problems/subarray-sum-equals-k/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0560.%20%E5%92%8C%E4%B8%BA%20K%20%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、哈希表、前缀和 | 中等 | - diff --git a/Contents/09.Algorithm-Base/01.Enumeration-Algorithm/index.md b/Contents/09.Algorithm-Base/01.Enumeration-Algorithm/index.md deleted file mode 100644 index a6650a96..00000000 --- a/Contents/09.Algorithm-Base/01.Enumeration-Algorithm/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [枚举算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/01.Enumeration-Algorithm/01.Enumeration-Algorithm.md) -- [枚举算法题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/01.Enumeration-Algorithm/02.Enumeration-Algorithm-List.md) \ No newline at end of file diff --git a/Contents/09.Algorithm-Base/02.Recursive-Algorithm/02.Recursive-Algorithm-List.md b/Contents/09.Algorithm-Base/02.Recursive-Algorithm/02.Recursive-Algorithm-List.md deleted file mode 100644 index 6aa36c26..00000000 --- a/Contents/09.Algorithm-Base/02.Recursive-Algorithm/02.Recursive-Algorithm-List.md +++ /dev/null @@ -1,21 +0,0 @@ -### 递归算法题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0344 | [反转字符串](https://leetcode.cn/problems/reverse-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0344.%20%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 双指针、字符串 | 简单 | -| 0024 | [两两交换链表中的节点](https://leetcode.cn/problems/swap-nodes-in-pairs/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0024.%20%E4%B8%A4%E4%B8%A4%E4%BA%A4%E6%8D%A2%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E8%8A%82%E7%82%B9.md) | 递归、链表 | 中等 | -| 0118 | [杨辉三角](https://leetcode.cn/problems/pascals-triangle/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0118.%20%E6%9D%A8%E8%BE%89%E4%B8%89%E8%A7%92.md) | 数组、动态规划 | 简单 | -| 0119 | [杨辉三角 II](https://leetcode.cn/problems/pascals-triangle-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0119.%20%E6%9D%A8%E8%BE%89%E4%B8%89%E8%A7%92%20II.md) | 数组、动态规划 | 简单 | -| 0206 | [反转链表](https://leetcode.cn/problems/reverse-linked-list/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0206.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8.md) | 递归、链表 | 简单 | -| 0092 | [反转链表 II](https://leetcode.cn/problems/reverse-linked-list-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0092.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8%20II.md) | 链表 | 中等 | -| 0021 | [合并两个有序链表](https://leetcode.cn/problems/merge-two-sorted-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0021.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E9%93%BE%E8%A1%A8.md) | 递归、链表 | 简单 | -| 0509 | [斐波那契数](https://leetcode.cn/problems/fibonacci-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0509.%20%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0.md) | 递归、记忆化搜索、数学、动态规划 | 简单 | -| 0070 | [爬楼梯](https://leetcode.cn/problems/climbing-stairs/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0070.%20%E7%88%AC%E6%A5%BC%E6%A2%AF.md) | 记忆化搜索、数学、动态规划 | 简单 | -| 0104 | [二叉树的最大深度](https://leetcode.cn/problems/maximum-depth-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0104.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%A4%A7%E6%B7%B1%E5%BA%A6.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0124 | [二叉树中的最大路径和](https://leetcode.cn/problems/binary-tree-maximum-path-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0124.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E8%B7%AF%E5%BE%84%E5%92%8C.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | -| 0226 | [翻转二叉树](https://leetcode.cn/problems/invert-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0226.%20%E7%BF%BB%E8%BD%AC%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | -| 0050 | [Pow(x, n)](https://leetcode.cn/problems/powx-n/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0050.%20Pow%28x%2C%20n%29.md) | 递归、数学 | 中等 | -| 0779 | [第K个语法符号](https://leetcode.cn/problems/k-th-symbol-in-grammar/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0779.%20%E7%AC%ACK%E4%B8%AA%E8%AF%AD%E6%B3%95%E7%AC%A6%E5%8F%B7.md) | 位运算、递归、数学 | 中等 | -| 0095 | [不同的二叉搜索树 II](https://leetcode.cn/problems/unique-binary-search-trees-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0095.%20%E4%B8%8D%E5%90%8C%E7%9A%84%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%20II.md) | 树、二叉搜索树、动态规划、回溯、二叉树 | 中等 | -| 剑指 Offer 62 | [圆圈中最后剩下的数字](https://leetcode.cn/problems/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2062.%20%E5%9C%86%E5%9C%88%E4%B8%AD%E6%9C%80%E5%90%8E%E5%89%A9%E4%B8%8B%E7%9A%84%E6%95%B0%E5%AD%97.md) | 递归、数学 | 简单 | - diff --git a/Contents/09.Algorithm-Base/02.Recursive-Algorithm/index.md b/Contents/09.Algorithm-Base/02.Recursive-Algorithm/index.md deleted file mode 100644 index 3500d867..00000000 --- a/Contents/09.Algorithm-Base/02.Recursive-Algorithm/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [递归算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/02.Recursive-Algorithm/01.Recursive-Algorithm.md) -- [递归算法题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/02.Recursive-Algorithm/02.Recursive-Algorithm-List.md) \ No newline at end of file diff --git a/Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/02.Divide-And-Conquer-Algorithm-List.md b/Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/02.Divide-And-Conquer-Algorithm-List.md deleted file mode 100644 index 2c383b83..00000000 --- a/Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/02.Divide-And-Conquer-Algorithm-List.md +++ /dev/null @@ -1,13 +0,0 @@ -### 分治算法题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0004 | [寻找两个正序数组的中位数](https://leetcode.cn/problems/median-of-two-sorted-arrays/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0004.%20%E5%AF%BB%E6%89%BE%E4%B8%A4%E4%B8%AA%E6%AD%A3%E5%BA%8F%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0.md) | 数组、二分查找、分治 | 困难 | -| 0023 | [合并 K 个升序链表](https://leetcode.cn/problems/merge-k-sorted-lists/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0023.%20%E5%90%88%E5%B9%B6%20K%20%E4%B8%AA%E5%8D%87%E5%BA%8F%E9%93%BE%E8%A1%A8.md) | 链表、分治、堆（优先队列）、归并排序 | 困难 | -| 0053 | [最大子数组和](https://leetcode.cn/problems/maximum-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0053.%20%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84%E5%92%8C.md) | 数组、分治、动态规划 | 中等 | -| 0241 | [为运算表达式设计优先级](https://leetcode.cn/problems/different-ways-to-add-parentheses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0241.%20%E4%B8%BA%E8%BF%90%E7%AE%97%E8%A1%A8%E8%BE%BE%E5%BC%8F%E8%AE%BE%E8%AE%A1%E4%BC%98%E5%85%88%E7%BA%A7.md) | 递归、记忆化搜索、数学、字符串、动态规划 | 中等 | -| 0169 | [多数元素](https://leetcode.cn/problems/majority-element/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0169.%20%E5%A4%9A%E6%95%B0%E5%85%83%E7%B4%A0.md) | 数组、哈希表、分治、计数、排序 | 简单 | -| 0050 | [Pow(x, n)](https://leetcode.cn/problems/powx-n/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0050.%20Pow%28x%2C%20n%29.md) | 递归、数学 | 中等 | -| 0014 | [最长公共前缀](https://leetcode.cn/problems/longest-common-prefix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0014.%20%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%89%8D%E7%BC%80.md) | 字典树、字符串 | 简单 | -| 剑指 Offer 33 | [二叉搜索树的后序遍历序列](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2033.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86%E5%BA%8F%E5%88%97.md) | 栈、树、二叉搜索树、递归、二叉树、单调栈 | 中等 | - diff --git a/Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/index.md b/Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/index.md deleted file mode 100644 index 0cb593e7..00000000 --- a/Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [分治算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/01.Divide-And-Conquer-Algorithm.md) -- [分治算法题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/02.Divide-And-Conquer-Algorithm-List.md) \ No newline at end of file diff --git a/Contents/09.Algorithm-Base/04.Backtracking-Algorithm/02.Backtracking-Algorithm-List.md b/Contents/09.Algorithm-Base/04.Backtracking-Algorithm/02.Backtracking-Algorithm-List.md deleted file mode 100644 index 3446cfa9..00000000 --- a/Contents/09.Algorithm-Base/04.Backtracking-Algorithm/02.Backtracking-Algorithm-List.md +++ /dev/null @@ -1,21 +0,0 @@ -### 回溯算法题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0046 | [全排列](https://leetcode.cn/problems/permutations/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0046.%20%E5%85%A8%E6%8E%92%E5%88%97.md) | 数组、回溯 | 中等 | -| 0047 | [全排列 II](https://leetcode.cn/problems/permutations-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0047.%20%E5%85%A8%E6%8E%92%E5%88%97%20II.md) | 数组、回溯 | 中等 | -| 0037 | [解数独](https://leetcode.cn/problems/sudoku-solver/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0037.%20%E8%A7%A3%E6%95%B0%E7%8B%AC.md) | 数组、哈希表、回溯、矩阵 | 困难 | -| 0022 | [括号生成](https://leetcode.cn/problems/generate-parentheses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0022.%20%E6%8B%AC%E5%8F%B7%E7%94%9F%E6%88%90.md) | 字符串、动态规划、回溯 | 中等 | -| 0017 | [电话号码的字母组合](https://leetcode.cn/problems/letter-combinations-of-a-phone-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0017.%20%E7%94%B5%E8%AF%9D%E5%8F%B7%E7%A0%81%E7%9A%84%E5%AD%97%E6%AF%8D%E7%BB%84%E5%90%88.md) | 哈希表、字符串、回溯 | 中等 | -| 0784 | [字母大小写全排列](https://leetcode.cn/problems/letter-case-permutation/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0784.%20%E5%AD%97%E6%AF%8D%E5%A4%A7%E5%B0%8F%E5%86%99%E5%85%A8%E6%8E%92%E5%88%97.md) | 位运算、字符串、回溯 | 中等 | -| 0039 | [组合总和](https://leetcode.cn/problems/combination-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0039.%20%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8C.md) | 数组、回溯 | 中等 | -| 0040 | [组合总和 II](https://leetcode.cn/problems/combination-sum-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0040.%20%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8C%20II.md) | 数组、回溯 | 中等 | -| 0078 | [子集](https://leetcode.cn/problems/subsets/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0078.%20%E5%AD%90%E9%9B%86.md) | 位运算、数组、回溯 | 中等 | -| 0090 | [子集 II](https://leetcode.cn/problems/subsets-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0090.%20%E5%AD%90%E9%9B%86%20II.md) | 位运算、数组、回溯 | 中等 | -| 0473 | [火柴拼正方形](https://leetcode.cn/problems/matchsticks-to-square/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0473.%20%E7%81%AB%E6%9F%B4%E6%8B%BC%E6%AD%A3%E6%96%B9%E5%BD%A2.md) | 位运算、数组、动态规划、回溯、状态压缩 | 中等 | -| 1593 | [拆分字符串使唯一子字符串的数目最大](https://leetcode.cn/problems/split-a-string-into-the-max-number-of-unique-substrings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1593.%20%E6%8B%86%E5%88%86%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%BD%BF%E5%94%AF%E4%B8%80%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%95%B0%E7%9B%AE%E6%9C%80%E5%A4%A7.md) | 哈希表、字符串、回溯 | 中等 | -| 1079 | [活字印刷](https://leetcode.cn/problems/letter-tile-possibilities/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1079.%20%E6%B4%BB%E5%AD%97%E5%8D%B0%E5%88%B7.md) | 哈希表、字符串、回溯、计数 | 中等 | -| 0093 | [复原 IP 地址](https://leetcode.cn/problems/restore-ip-addresses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0093.%20%E5%A4%8D%E5%8E%9F%20IP%20%E5%9C%B0%E5%9D%80.md) | 字符串、回溯 | 中等 | -| 0079 | [单词搜索](https://leetcode.cn/problems/word-search/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0079.%20%E5%8D%95%E8%AF%8D%E6%90%9C%E7%B4%A2.md) | 数组、回溯、矩阵 | 中等 | -| 0679 | [24 点游戏](https://leetcode.cn/problems/24-game/) | | 数组、数学、回溯 | 困难 | - diff --git a/Contents/09.Algorithm-Base/04.Backtracking-Algorithm/index.md b/Contents/09.Algorithm-Base/04.Backtracking-Algorithm/index.md deleted file mode 100644 index 6044c40a..00000000 --- a/Contents/09.Algorithm-Base/04.Backtracking-Algorithm/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [回溯算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/04.Backtracking-Algorithm/01.Backtracking-Algorithm.md) -- [回溯算法题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/04.Backtracking-Algorithm/02.Backtracking-Algorithm-List.md) \ No newline at end of file diff --git a/Contents/09.Algorithm-Base/05.Greedy-Algorithm/02.Greedy-Algorithm-List.md b/Contents/09.Algorithm-Base/05.Greedy-Algorithm/02.Greedy-Algorithm-List.md deleted file mode 100644 index 82df440c..00000000 --- a/Contents/09.Algorithm-Base/05.Greedy-Algorithm/02.Greedy-Algorithm-List.md +++ /dev/null @@ -1,29 +0,0 @@ -### 贪心算法题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0455 | [分发饼干](https://leetcode.cn/problems/assign-cookies/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0455.%20%E5%88%86%E5%8F%91%E9%A5%BC%E5%B9%B2.md) | 贪心、数组、双指针、排序 | 简单 | -| 0860 | [柠檬水找零](https://leetcode.cn/problems/lemonade-change/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0860.%20%E6%9F%A0%E6%AA%AC%E6%B0%B4%E6%89%BE%E9%9B%B6.md) | 贪心、数组 | 简单 | -| 0056 | [合并区间](https://leetcode.cn/problems/merge-intervals/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0056.%20%E5%90%88%E5%B9%B6%E5%8C%BA%E9%97%B4.md) | 数组、排序 | 中等 | -| 0435 | [无重叠区间](https://leetcode.cn/problems/non-overlapping-intervals/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0435.%20%E6%97%A0%E9%87%8D%E5%8F%A0%E5%8C%BA%E9%97%B4.md) | 贪心、数组、动态规划、排序 | 中等 | -| 0452 | [用最少数量的箭引爆气球](https://leetcode.cn/problems/minimum-number-of-arrows-to-burst-balloons/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0452.%20%E7%94%A8%E6%9C%80%E5%B0%91%E6%95%B0%E9%87%8F%E7%9A%84%E7%AE%AD%E5%BC%95%E7%88%86%E6%B0%94%E7%90%83.md) | 贪心、数组、排序 | 中等 | -| 0055 | [跳跃游戏](https://leetcode.cn/problems/jump-game/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0055.%20%E8%B7%B3%E8%B7%83%E6%B8%B8%E6%88%8F.md) | 贪心、数组、动态规划 | 中等 | -| 0045 | [跳跃游戏 II](https://leetcode.cn/problems/jump-game-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0045.%20%E8%B7%B3%E8%B7%83%E6%B8%B8%E6%88%8F%20II.md) | 贪心、数组、动态规划 | 中等 | -| 0122 | [买卖股票的最佳时机 II](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0122.%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA%20II.md) | 贪心、数组 | 中等 | -| 0561 | [数组拆分](https://leetcode.cn/problems/array-partition/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0561.%20%E6%95%B0%E7%BB%84%E6%8B%86%E5%88%86.md) | 贪心、数组、计数排序、排序 | 简单 | -| 1710 | [卡车上的最大单元数](https://leetcode.cn/problems/maximum-units-on-a-truck/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1710.%20%E5%8D%A1%E8%BD%A6%E4%B8%8A%E7%9A%84%E6%9C%80%E5%A4%A7%E5%8D%95%E5%85%83%E6%95%B0.md) | 贪心、数组、排序 | 简单 | -| 1217 | [玩筹码](https://leetcode.cn/problems/minimum-cost-to-move-chips-to-the-same-position/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1217.%20%E7%8E%A9%E7%AD%B9%E7%A0%81.md) | 贪心、数组、数学 | 简单 | -| 1247 | [交换字符使得字符串相同](https://leetcode.cn/problems/minimum-swaps-to-make-strings-equal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1247.%20%E4%BA%A4%E6%8D%A2%E5%AD%97%E7%AC%A6%E4%BD%BF%E5%BE%97%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E5%90%8C.md) | 贪心、数学、字符串 | 中等 | -| 1400 | [构造 K 个回文字符串](https://leetcode.cn/problems/construct-k-palindrome-strings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1400.%20%E6%9E%84%E9%80%A0%20K%20%E4%B8%AA%E5%9B%9E%E6%96%87%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 贪心、哈希表、字符串、计数 | 中等 | -| 0921 | [使括号有效的最少添加](https://leetcode.cn/problems/minimum-add-to-make-parentheses-valid/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0921.%20%E4%BD%BF%E6%8B%AC%E5%8F%B7%E6%9C%89%E6%95%88%E7%9A%84%E6%9C%80%E5%B0%91%E6%B7%BB%E5%8A%A0.md) | 栈、贪心、字符串 | 中等 | -| 1029 | [两地调度](https://leetcode.cn/problems/two-city-scheduling/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1029.%20%E4%B8%A4%E5%9C%B0%E8%B0%83%E5%BA%A6.md) | 贪心、数组、排序 | 中等 | -| 1605 | [给定行和列的和求可行矩阵](https://leetcode.cn/problems/find-valid-matrix-given-row-and-column-sums/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1605.%20%E7%BB%99%E5%AE%9A%E8%A1%8C%E5%92%8C%E5%88%97%E7%9A%84%E5%92%8C%E6%B1%82%E5%8F%AF%E8%A1%8C%E7%9F%A9%E9%98%B5.md) | 贪心、数组、矩阵 | 中等 | -| 0135 | [分发糖果](https://leetcode.cn/problems/candy/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0135.%20%E5%88%86%E5%8F%91%E7%B3%96%E6%9E%9C.md) | 贪心、数组 | 困难 | -| 0134 | [加油站](https://leetcode.cn/problems/gas-station/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0134.%20%E5%8A%A0%E6%B2%B9%E7%AB%99.md) | 贪心、数组 | 中等 | -| 0053 | [最大子数组和](https://leetcode.cn/problems/maximum-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0053.%20%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84%E5%92%8C.md) | 数组、分治、动态规划 | 中等 | -| 0376 | [摆动序列](https://leetcode.cn/problems/wiggle-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0376.%20%E6%91%86%E5%8A%A8%E5%BA%8F%E5%88%97.md) | 贪心、数组、动态规划 | 中等 | -| 0738 | [单调递增的数字](https://leetcode.cn/problems/monotone-increasing-digits/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0738.%20%E5%8D%95%E8%B0%83%E9%80%92%E5%A2%9E%E7%9A%84%E6%95%B0%E5%AD%97.md) | 贪心、数学 | 中等 | -| 0402 | [移掉 K 位数字](https://leetcode.cn/problems/remove-k-digits/) | | 栈、贪心、字符串、单调栈 | 中等 | -| 0861 | [翻转矩阵后的得分](https://leetcode.cn/problems/score-after-flipping-matrix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0861.%20%E7%BF%BB%E8%BD%AC%E7%9F%A9%E9%98%B5%E5%90%8E%E7%9A%84%E5%BE%97%E5%88%86.md) | 贪心、位运算、数组、矩阵 | 中等 | -| 0670 | [最大交换](https://leetcode.cn/problems/maximum-swap/) | | 贪心、数学 | 中等 | - diff --git a/Contents/09.Algorithm-Base/05.Greedy-Algorithm/index.md b/Contents/09.Algorithm-Base/05.Greedy-Algorithm/index.md deleted file mode 100644 index c32ee657..00000000 --- a/Contents/09.Algorithm-Base/05.Greedy-Algorithm/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [贪心算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/05.Greedy-Algorithm/01.Greedy-Algorithm.md) -- [贪心算法题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/05.Greedy-Algorithm/02.Greedy-Algorithm-List.md) \ No newline at end of file diff --git a/Contents/09.Algorithm-Base/06.Bit-Operation/02.Bit-Operation-List.md b/Contents/09.Algorithm-Base/06.Bit-Operation/02.Bit-Operation-List.md deleted file mode 100644 index 1177335e..00000000 --- a/Contents/09.Algorithm-Base/06.Bit-Operation/02.Bit-Operation-List.md +++ /dev/null @@ -1,22 +0,0 @@ -### 位运算题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0504 | [七进制数](https://leetcode.cn/problems/base-7/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0504.%20%E4%B8%83%E8%BF%9B%E5%88%B6%E6%95%B0.md) | 数学 | 简单 | -| 0405 | [数字转换为十六进制数](https://leetcode.cn/problems/convert-a-number-to-hexadecimal/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0405.%20%E6%95%B0%E5%AD%97%E8%BD%AC%E6%8D%A2%E4%B8%BA%E5%8D%81%E5%85%AD%E8%BF%9B%E5%88%B6%E6%95%B0.md) | 位运算、数学 | 简单 | -| 0190 | [颠倒二进制位](https://leetcode.cn/problems/reverse-bits/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0190.%20%E9%A2%A0%E5%80%92%E4%BA%8C%E8%BF%9B%E5%88%B6%E4%BD%8D.md) | 位运算、分治 | 简单 | -| 1009 | [十进制整数的反码](https://leetcode.cn/problems/complement-of-base-10-integer/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1009.%20%E5%8D%81%E8%BF%9B%E5%88%B6%E6%95%B4%E6%95%B0%E7%9A%84%E5%8F%8D%E7%A0%81.md) | 位运算 | 简单 | -| 0191 | [位1的个数](https://leetcode.cn/problems/number-of-1-bits/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0191.%20%E4%BD%8D1%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 位运算、分治 | 简单 | -| 0371 | [两整数之和](https://leetcode.cn/problems/sum-of-two-integers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0371.%20%E4%B8%A4%E6%95%B4%E6%95%B0%E4%B9%8B%E5%92%8C.md) | 位运算、数学 | 中等 | -| 0089 | [格雷编码](https://leetcode.cn/problems/gray-code/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0089.%20%E6%A0%BC%E9%9B%B7%E7%BC%96%E7%A0%81.md) | 位运算、数学、回溯 | 中等 | -| 0201 | [数字范围按位与](https://leetcode.cn/problems/bitwise-and-of-numbers-range/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0201.%20%E6%95%B0%E5%AD%97%E8%8C%83%E5%9B%B4%E6%8C%89%E4%BD%8D%E4%B8%8E.md) | 位运算 | 中等 | -| 0338 | [比特位计数](https://leetcode.cn/problems/counting-bits/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0338.%20%E6%AF%94%E7%89%B9%E4%BD%8D%E8%AE%A1%E6%95%B0.md) | 位运算、动态规划 | 简单 | -| 0136 | [只出现一次的数字](https://leetcode.cn/problems/single-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0136.%20%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B0%E5%AD%97.md) | 位运算、数组 | 简单 | -| 0137 | [只出现一次的数字 II](https://leetcode.cn/problems/single-number-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0137.%20%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B0%E5%AD%97%20II.md) | 位运算、数组 | 中等 | -| 0260 | [只出现一次的数字 III](https://leetcode.cn/problems/single-number-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0260.%20%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B0%E5%AD%97%20III.md) | 位运算、数组 | 中等 | -| 0268 | [丢失的数字](https://leetcode.cn/problems/missing-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0268.%20%E4%B8%A2%E5%A4%B1%E7%9A%84%E6%95%B0%E5%AD%97.md) | 位运算、数组、哈希表、数学、二分查找、排序 | 简单 | -| 1349 | [参加考试的最大学生数](https://leetcode.cn/problems/maximum-students-taking-exam/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1349.%20%E5%8F%82%E5%8A%A0%E8%80%83%E8%AF%95%E7%9A%84%E6%9C%80%E5%A4%A7%E5%AD%A6%E7%94%9F%E6%95%B0.md) | 位运算、数组、动态规划、状态压缩、矩阵 | 困难 | -| 0645 | [错误的集合](https://leetcode.cn/problems/set-mismatch/) | | 位运算、数组、哈希表、排序 | 简单 | -| 0078 | [子集](https://leetcode.cn/problems/subsets/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0078.%20%E5%AD%90%E9%9B%86.md) | 位运算、数组、回溯 | 中等 | -| 0090 | [子集 II](https://leetcode.cn/problems/subsets-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0090.%20%E5%AD%90%E9%9B%86%20II.md) | 位运算、数组、回溯 | 中等 | - diff --git a/Contents/09.Algorithm-Base/06.Bit-Operation/index.md b/Contents/09.Algorithm-Base/06.Bit-Operation/index.md deleted file mode 100644 index d28c1d38..00000000 --- a/Contents/09.Algorithm-Base/06.Bit-Operation/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [位运算知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/06.Bit-Operation/01.Bit-Operation.md) -- [位运算题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/06.Bit-Operation/02.Bit-Operation-List.md) \ No newline at end of file diff --git a/Contents/09.Algorithm-Base/index.md b/Contents/09.Algorithm-Base/index.md deleted file mode 100644 index 46473ac8..00000000 --- a/Contents/09.Algorithm-Base/index.md +++ /dev/null @@ -1,31 +0,0 @@ -## 本章内容 - -### 枚举算法 - -- [枚举算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/01.Enumeration-Algorithm/01.Enumeration-Algorithm.md) -- [枚举算法题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/01.Enumeration-Algorithm/02.Enumeration-Algorithm-List.md) - -### 递归算法 - -- [递归算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/02.Recursive-Algorithm/01.Recursive-Algorithm.md) -- [递归算法题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/02.Recursive-Algorithm/02.Recursive-Algorithm-List.md) - -### 分治算法 - -- [分治算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/01.Divide-And-Conquer-Algorithm.md) -- [分治算法题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/02.Divide-And-Conquer-Algorithm-List.md) - -### 回溯算法 - -- [回溯算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/04.Backtracking-Algorithm/01.Backtracking-Algorithm.md) -- [回溯算法题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/04.Backtracking-Algorithm/02.Backtracking-Algorithm-List.md) - -### 贪心算法 - -- [贪心算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/05.Greedy-Algorithm/01.Greedy-Algorithm.md) -- [贪心算法题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/05.Greedy-Algorithm/02.Greedy-Algorithm-List.md) - -### 位运算 - -- [位运算知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/06.Bit-Operation/01.Bit-Operation.md) -- [位运算题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/06.Bit-Operation/02.Bit-Operation-List.md) \ No newline at end of file diff --git a/Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/02.Dynamic-Programming-Basic-List.md b/Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/02.Dynamic-Programming-Basic-List.md deleted file mode 100644 index 5a134bfc..00000000 --- a/Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/02.Dynamic-Programming-Basic-List.md +++ /dev/null @@ -1,8 +0,0 @@ -### 动态规划基础题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0509 | [斐波那契数](https://leetcode.cn/problems/fibonacci-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0509.%20%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0.md) | 递归、记忆化搜索、数学、动态规划 | 简单 | -| 0070 | [爬楼梯](https://leetcode.cn/problems/climbing-stairs/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0070.%20%E7%88%AC%E6%A5%BC%E6%A2%AF.md) | 记忆化搜索、数学、动态规划 | 简单 | -| 0062 | [不同路径](https://leetcode.cn/problems/unique-paths/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0062.%20%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84.md) | 数学、动态规划、组合数学 | 中等 | - diff --git a/Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/index.md b/Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/index.md deleted file mode 100644 index c1d518cb..00000000 --- a/Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [动态规划基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/01.Dynamic-Programming-Basic.md) -- [动态规划基础题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/02.Dynamic-Programming-Basic-List.md) \ No newline at end of file diff --git a/Contents/10.Dynamic-Programming/02.Memoization/02.Memoization-List.md b/Contents/10.Dynamic-Programming/02.Memoization/02.Memoization-List.md deleted file mode 100644 index 616b85d6..00000000 --- a/Contents/10.Dynamic-Programming/02.Memoization/02.Memoization-List.md +++ /dev/null @@ -1,14 +0,0 @@ -### 记忆化搜索题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 1137 | [第 N 个泰波那契数](https://leetcode.cn/problems/n-th-tribonacci-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1137.%20%E7%AC%AC%20N%20%E4%B8%AA%E6%B3%B0%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0.md) | 记忆化搜索、数学、动态规划 | 简单 | -| 0375 | [猜数字大小 II](https://leetcode.cn/problems/guess-number-higher-or-lower-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0375.%20%E7%8C%9C%E6%95%B0%E5%AD%97%E5%A4%A7%E5%B0%8F%20II.md) | 数学、动态规划、博弈 | 中等 | -| 0494 | [目标和](https://leetcode.cn/problems/target-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0494.%20%E7%9B%AE%E6%A0%87%E5%92%8C.md) | 数组、动态规划、回溯 | 中等 | -| 0576 | [出界的路径数](https://leetcode.cn/problems/out-of-boundary-paths/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0576.%20%E5%87%BA%E7%95%8C%E7%9A%84%E8%B7%AF%E5%BE%84%E6%95%B0.md) | 动态规划 | 中等 | -| 0087 | [扰乱字符串](https://leetcode.cn/problems/scramble-string/) | | 字符串、动态规划 | 困难 | -| 0403 | [青蛙过河](https://leetcode.cn/problems/frog-jump/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0403.%20%E9%9D%92%E8%9B%99%E8%BF%87%E6%B2%B3.md) | 数组、动态规划 | 困难 | -| 0552 | [学生出勤记录 II](https://leetcode.cn/problems/student-attendance-record-ii/) | | 动态规划 | 困难 | -| 0913 | [猫和老鼠](https://leetcode.cn/problems/cat-and-mouse/) | | 图、拓扑排序、记忆化搜索、数学、动态规划、博弈 | 困难 | -| 0329 | [矩阵中的最长递增路径](https://leetcode.cn/problems/longest-increasing-path-in-a-matrix/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0329.%20%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E8%B7%AF%E5%BE%84.md) | 深度优先搜索、广度优先搜索、图、拓扑排序、记忆化搜索、数组、动态规划、矩阵 | 困难 | - diff --git a/Contents/10.Dynamic-Programming/02.Memoization/index.md b/Contents/10.Dynamic-Programming/02.Memoization/index.md deleted file mode 100644 index 8d8ac48e..00000000 --- a/Contents/10.Dynamic-Programming/02.Memoization/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [记忆化搜索知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/02.Memoization/01.Memoization.md) -- [记忆化搜索题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/02.Memoization/02.Memoization-List.md) \ No newline at end of file diff --git a/Contents/10.Dynamic-Programming/03.Linear-DP/03.Linear-DP-List.md b/Contents/10.Dynamic-Programming/03.Linear-DP/03.Linear-DP-List.md deleted file mode 100644 index 47b000b8..00000000 --- a/Contents/10.Dynamic-Programming/03.Linear-DP/03.Linear-DP-List.md +++ /dev/null @@ -1,91 +0,0 @@ -### 线性 DP 题目 - -#### 单串线性 DP 问题 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0300 | [最长递增子序列](https://leetcode.cn/problems/longest-increasing-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0300.%20%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E5%AD%90%E5%BA%8F%E5%88%97.md) | 数组、二分查找、动态规划 | 中等 | -| 0673 | [最长递增子序列的个数](https://leetcode.cn/problems/number-of-longest-increasing-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0673.%20%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 树状数组、线段树、数组、动态规划 | 中等 | -| 0354 | [俄罗斯套娃信封问题](https://leetcode.cn/problems/russian-doll-envelopes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0354.%20%E4%BF%84%E7%BD%97%E6%96%AF%E5%A5%97%E5%A8%83%E4%BF%A1%E5%B0%81%E9%97%AE%E9%A2%98.md) | 数组、二分查找、动态规划、排序 | 困难 | -| 0053 | [最大子数组和](https://leetcode.cn/problems/maximum-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0053.%20%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84%E5%92%8C.md) | 数组、分治、动态规划 | 中等 | -| 0152 | [乘积最大子数组](https://leetcode.cn/problems/maximum-product-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0152.%20%E4%B9%98%E7%A7%AF%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、动态规划 | 中等 | -| 0918 | [环形子数组的最大和](https://leetcode.cn/problems/maximum-sum-circular-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0918.%20%E7%8E%AF%E5%BD%A2%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%92%8C.md) | 队列、数组、分治、动态规划、单调队列 | 中等 | -| 0198 | [打家劫舍](https://leetcode.cn/problems/house-robber/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0198.%20%E6%89%93%E5%AE%B6%E5%8A%AB%E8%88%8D.md) | 数组、动态规划 | 中等 | -| 0213 | [打家劫舍 II](https://leetcode.cn/problems/house-robber-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0213.%20%E6%89%93%E5%AE%B6%E5%8A%AB%E8%88%8D%20II.md) | 数组、动态规划 | 中等 | -| 0740 | [删除并获得点数](https://leetcode.cn/problems/delete-and-earn/) | | 数组、哈希表、动态规划 | 中等 | -| 1388 | [3n 块披萨](https://leetcode.cn/problems/pizza-with-3n-slices/) | | 贪心、数组、动态规划、堆（优先队列） | 困难 | -| 0873 | [最长的斐波那契子序列的长度](https://leetcode.cn/problems/length-of-longest-fibonacci-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0873.%20%E6%9C%80%E9%95%BF%E7%9A%84%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E9%95%BF%E5%BA%A6.md) | 数组、哈希表、动态规划 | 中等 | -| 1027 | [最长等差数列](https://leetcode.cn/problems/longest-arithmetic-subsequence/) | | 数组、哈希表、二分查找、动态规划 | 中等 | -| 1055 | [形成字符串的最短路径](https://leetcode.cn/problems/shortest-way-to-form-string/) | | 贪心、双指针、字符串 | 中等 | -| 0368 | [最大整除子集](https://leetcode.cn/problems/largest-divisible-subset/) | | 数组、数学、动态规划、排序 | 中等 | -| 0032 | [最长有效括号](https://leetcode.cn/problems/longest-valid-parentheses/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0032.%20%E6%9C%80%E9%95%BF%E6%9C%89%E6%95%88%E6%8B%AC%E5%8F%B7.md) | 栈、字符串、动态规划 | 困难 | -| 0413 | [等差数列划分](https://leetcode.cn/problems/arithmetic-slices/) | | 数组、动态规划 | 中等 | -| 0091 | [解码方法](https://leetcode.cn/problems/decode-ways/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0091.%20%E8%A7%A3%E7%A0%81%E6%96%B9%E6%B3%95.md) | 字符串、动态规划 | 中等 | -| 0639 | [解码方法 II](https://leetcode.cn/problems/decode-ways-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0639.%20%E8%A7%A3%E7%A0%81%E6%96%B9%E6%B3%95%20II.md) | 字符串、动态规划 | 困难 | -| 0132 | [分割回文串 II](https://leetcode.cn/problems/palindrome-partitioning-ii/) | | 字符串、动态规划 | 困难 | -| 1220 | [统计元音字母序列的数目](https://leetcode.cn/problems/count-vowels-permutation/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1220.%20%E7%BB%9F%E8%AE%A1%E5%85%83%E9%9F%B3%E5%AD%97%E6%AF%8D%E5%BA%8F%E5%88%97%E7%9A%84%E6%95%B0%E7%9B%AE.md) | 动态规划 | 困难 | -| 0338 | [比特位计数](https://leetcode.cn/problems/counting-bits/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0338.%20%E6%AF%94%E7%89%B9%E4%BD%8D%E8%AE%A1%E6%95%B0.md) | 位运算、动态规划 | 简单 | -| 0801 | [使序列递增的最小交换次数](https://leetcode.cn/problems/minimum-swaps-to-make-sequences-increasing/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0801.%20%E4%BD%BF%E5%BA%8F%E5%88%97%E9%80%92%E5%A2%9E%E7%9A%84%E6%9C%80%E5%B0%8F%E4%BA%A4%E6%8D%A2%E6%AC%A1%E6%95%B0.md) | 数组、动态规划 | 困难 | -| 0871 | [最低加油次数](https://leetcode.cn/problems/minimum-number-of-refueling-stops/) | | 贪心、数组、动态规划、堆（优先队列） | 困难 | -| 0045 | [跳跃游戏 II](https://leetcode.cn/problems/jump-game-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0045.%20%E8%B7%B3%E8%B7%83%E6%B8%B8%E6%88%8F%20II.md) | 贪心、数组、动态规划 | 中等 | -| 0813 | [最大平均值和的分组](https://leetcode.cn/problems/largest-sum-of-averages/) | | 数组、动态规划、前缀和 | 中等 | -| 0887 | [鸡蛋掉落](https://leetcode.cn/problems/super-egg-drop/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0887.%20%E9%B8%A1%E8%9B%8B%E6%8E%89%E8%90%BD.md) | 数学、二分查找、动态规划 | 困难 | -| 0256 | [粉刷房子](https://leetcode.cn/problems/paint-house/) | | 数组、动态规划 | 中等 | -| 0265 | [粉刷房子 II](https://leetcode.cn/problems/paint-house-ii/) | | 数组、动态规划 | 困难 | -| 1473 | [粉刷房子 III](https://leetcode.cn/problems/paint-house-iii/) | | 数组、动态规划 | 困难 | -| 0975 | [奇偶跳](https://leetcode.cn/problems/odd-even-jump/) | | 栈、数组、动态规划、有序集合、单调栈 | 困难 | -| 0403 | [青蛙过河](https://leetcode.cn/problems/frog-jump/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0403.%20%E9%9D%92%E8%9B%99%E8%BF%87%E6%B2%B3.md) | 数组、动态规划 | 困难 | -| 1478 | [安排邮筒](https://leetcode.cn/problems/allocate-mailboxes/) | | 数组、数学、动态规划、排序 | 困难 | -| 1230 | [抛掷硬币](https://leetcode.cn/problems/toss-strange-coins/) | | 数学、动态规划、概率与统计 | 中等 | -| 0410 | [分割数组的最大值](https://leetcode.cn/problems/split-array-largest-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0410.%20%E5%88%86%E5%89%B2%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md) | 贪心、数组、二分查找、动态规划、前缀和 | 困难 | -| 1751 | [最多可以参加的会议数目 II](https://leetcode.cn/problems/maximum-number-of-events-that-can-be-attended-ii/) | | 数组、二分查找、动态规划、排序 | 困难 | -| 1787 | [使所有区间的异或结果为零](https://leetcode.cn/problems/make-the-xor-of-all-segments-equal-to-zero/) | | 位运算、数组、动态规划 | 困难 | -| 0121 | [买卖股票的最佳时机](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0121.%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA.md) | 数组、动态规划 | 简单 | -| 0122 | [买卖股票的最佳时机 II](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0122.%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA%20II.md) | 贪心、数组 | 中等 | -| 0123 | [买卖股票的最佳时机 III](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0123.%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA%20III.md) | 数组、动态规划 | 困难 | -| 0188 | [买卖股票的最佳时机 IV](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-iv/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0188.%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA%20IV.md) | 数组、动态规划 | 困难 | -| 0309 | [最佳买卖股票时机含冷冻期](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-cooldown/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0309.%20%E6%9C%80%E4%BD%B3%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E6%97%B6%E6%9C%BA%E5%90%AB%E5%86%B7%E5%86%BB%E6%9C%9F.md) | 数组、动态规划 | 中等 | -| 0714 | [买卖股票的最佳时机含手续费](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0714.%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA%E5%90%AB%E6%89%8B%E7%BB%AD%E8%B4%B9.md) | 贪心、数组 | 中等 | - -#### 双串线性 DP 问题 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 1143 | [最长公共子序列](https://leetcode.cn/problems/longest-common-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1143.%20%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%AD%90%E5%BA%8F%E5%88%97.md) | 字符串、动态规划 | 中等 | -| 0712 | [两个字符串的最小ASCII删除和](https://leetcode.cn/problems/minimum-ascii-delete-sum-for-two-strings/) | | 字符串、动态规划 | 中等 | -| 0718 | [最长重复子数组](https://leetcode.cn/problems/maximum-length-of-repeated-subarray/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0718.%20%E6%9C%80%E9%95%BF%E9%87%8D%E5%A4%8D%E5%AD%90%E6%95%B0%E7%BB%84.md) | 数组、二分查找、动态规划、滑动窗口、哈希函数、滚动哈希 | 中等 | -| 0583 | [两个字符串的删除操作](https://leetcode.cn/problems/delete-operation-for-two-strings/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0583.%20%E4%B8%A4%E4%B8%AA%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E5%88%A0%E9%99%A4%E6%93%8D%E4%BD%9C.md) | 字符串、动态规划 | 中等 | -| 0072 | [编辑距离](https://leetcode.cn/problems/edit-distance/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0072.%20%E7%BC%96%E8%BE%91%E8%B7%9D%E7%A6%BB.md) | 字符串、动态规划 | 困难 | -| 0044 | [通配符匹配](https://leetcode.cn/problems/wildcard-matching/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0044.%20%E9%80%9A%E9%85%8D%E7%AC%A6%E5%8C%B9%E9%85%8D.md) | 贪心、递归、字符串、动态规划 | 困难 | -| 0010 | [正则表达式匹配](https://leetcode.cn/problems/regular-expression-matching/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0010.%20%E6%AD%A3%E5%88%99%E8%A1%A8%E8%BE%BE%E5%BC%8F%E5%8C%B9%E9%85%8D.md) | 递归、字符串、动态规划 | 困难 | -| 0097 | [交错字符串](https://leetcode.cn/problems/interleaving-string/) | | 字符串、动态规划 | 中等 | -| 0115 | [不同的子序列](https://leetcode.cn/problems/distinct-subsequences/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0115.%20%E4%B8%8D%E5%90%8C%E7%9A%84%E5%AD%90%E5%BA%8F%E5%88%97.md) | 字符串、动态规划 | 困难 | -| 0087 | [扰乱字符串](https://leetcode.cn/problems/scramble-string/) | | 字符串、动态规划 | 困难 | - -#### 矩阵线性 DP 问题 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0118 | [杨辉三角](https://leetcode.cn/problems/pascals-triangle/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0118.%20%E6%9D%A8%E8%BE%89%E4%B8%89%E8%A7%92.md) | 数组、动态规划 | 简单 | -| 0119 | [杨辉三角 II](https://leetcode.cn/problems/pascals-triangle-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0119.%20%E6%9D%A8%E8%BE%89%E4%B8%89%E8%A7%92%20II.md) | 数组、动态规划 | 简单 | -| 0120 | [三角形最小路径和](https://leetcode.cn/problems/triangle/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0120.%20%E4%B8%89%E8%A7%92%E5%BD%A2%E6%9C%80%E5%B0%8F%E8%B7%AF%E5%BE%84%E5%92%8C.md) | 数组、动态规划 | 中等 | -| 0064 | [最小路径和](https://leetcode.cn/problems/minimum-path-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0064.%20%E6%9C%80%E5%B0%8F%E8%B7%AF%E5%BE%84%E5%92%8C.md) | 数组、动态规划、矩阵 | 中等 | -| 0174 | [地下城游戏](https://leetcode.cn/problems/dungeon-game/) | | 数组、动态规划、矩阵 | 困难 | -| 0221 | [最大正方形](https://leetcode.cn/problems/maximal-square/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0221.%20%E6%9C%80%E5%A4%A7%E6%AD%A3%E6%96%B9%E5%BD%A2.md) | 数组、动态规划、矩阵 | 中等 | -| 0931 | [下降路径最小和](https://leetcode.cn/problems/minimum-falling-path-sum/) | | 数组、动态规划、矩阵 | 中等 | -| 0576 | [出界的路径数](https://leetcode.cn/problems/out-of-boundary-paths/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0576.%20%E5%87%BA%E7%95%8C%E7%9A%84%E8%B7%AF%E5%BE%84%E6%95%B0.md) | 动态规划 | 中等 | -| 0085 | [最大矩形](https://leetcode.cn/problems/maximal-rectangle/) | | 栈、数组、动态规划、矩阵、单调栈 | 困难 | -| 0363 | [矩形区域不超过 K 的最大数值和](https://leetcode.cn/problems/max-sum-of-rectangle-no-larger-than-k/) | | 数组、二分查找、矩阵、有序集合、前缀和 | 困难 | -| 面试题 17.24 | [最大子矩阵](https://leetcode.cn/problems/max-submatrix-lcci/) | | 数组、动态规划、矩阵、前缀和 | 困难 | -| 1444 | [切披萨的方案数](https://leetcode.cn/problems/number-of-ways-of-cutting-a-pizza/) | | 记忆化搜索、数组、动态规划、矩阵 | 困难 | - -#### 无串线性 DP 问题 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 1137 | [第 N 个泰波那契数](https://leetcode.cn/problems/n-th-tribonacci-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1137.%20%E7%AC%AC%20N%20%E4%B8%AA%E6%B3%B0%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0.md) | 记忆化搜索、数学、动态规划 | 简单 | -| 0650 | [只有两个键的键盘](https://leetcode.cn/problems/2-keys-keyboard/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0650.%20%E5%8F%AA%E6%9C%89%E4%B8%A4%E4%B8%AA%E9%94%AE%E7%9A%84%E9%94%AE%E7%9B%98.md) | 数学、动态规划 | 中等 | -| 0264 | [丑数 II](https://leetcode.cn/problems/ugly-number-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0264.%20%E4%B8%91%E6%95%B0%20II.md) | 哈希表、数学、动态规划、堆（优先队列） | 中等 | -| 0279 | [完全平方数](https://leetcode.cn/problems/perfect-squares/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0279.%20%E5%AE%8C%E5%85%A8%E5%B9%B3%E6%96%B9%E6%95%B0.md) | 广度优先搜索、数学、动态规划 | 中等 | -| 0343 | [整数拆分](https://leetcode.cn/problems/integer-break/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0343.%20%E6%95%B4%E6%95%B0%E6%8B%86%E5%88%86.md) | 数学、动态规划 | 中等 | - diff --git a/Contents/10.Dynamic-Programming/03.Linear-DP/index.md b/Contents/10.Dynamic-Programming/03.Linear-DP/index.md deleted file mode 100644 index d5a94e0a..00000000 --- a/Contents/10.Dynamic-Programming/03.Linear-DP/index.md +++ /dev/null @@ -1,5 +0,0 @@ -## 本章内容 - -- [线性 DP 知识（一）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/03.Linear-DP/01.Linear-DP-01.md) -- [线性 DP 知识（二）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/03.Linear-DP/02.Linear-DP-02.md) -- [线性 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/03.Linear-DP/03.Linear-DP-List.md) \ No newline at end of file diff --git a/Contents/10.Dynamic-Programming/04.Knapsack-Problem/06.Knapsack-Problem-List.md b/Contents/10.Dynamic-Programming/04.Knapsack-Problem/06.Knapsack-Problem-List.md deleted file mode 100644 index e2225bdc..00000000 --- a/Contents/10.Dynamic-Programming/04.Knapsack-Problem/06.Knapsack-Problem-List.md +++ /dev/null @@ -1,39 +0,0 @@ -### 背包问题题目 - -#### 0-1 背包问题 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0416 | [分割等和子集](https://leetcode.cn/problems/partition-equal-subset-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0416.%20%E5%88%86%E5%89%B2%E7%AD%89%E5%92%8C%E5%AD%90%E9%9B%86.md) | 数组、动态规划 | 中等 | -| 0494 | [目标和](https://leetcode.cn/problems/target-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0494.%20%E7%9B%AE%E6%A0%87%E5%92%8C.md) | 数组、动态规划、回溯 | 中等 | -| 1049 | [最后一块石头的重量 II](https://leetcode.cn/problems/last-stone-weight-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1049.%20%E6%9C%80%E5%90%8E%E4%B8%80%E5%9D%97%E7%9F%B3%E5%A4%B4%E7%9A%84%E9%87%8D%E9%87%8F%20II.md) | 数组、动态规划 | 中等 | - -#### 完全背包问题 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0279 | [完全平方数](https://leetcode.cn/problems/perfect-squares/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0279.%20%E5%AE%8C%E5%85%A8%E5%B9%B3%E6%96%B9%E6%95%B0.md) | 广度优先搜索、数学、动态规划 | 中等 | -| 0322 | [零钱兑换](https://leetcode.cn/problems/coin-change/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0322.%20%E9%9B%B6%E9%92%B1%E5%85%91%E6%8D%A2.md) | 广度优先搜索、数组、动态规划 | 中等 | -| 0518 | [零钱兑换 II](https://leetcode.cn/problems/coin-change-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0518.%20%E9%9B%B6%E9%92%B1%E5%85%91%E6%8D%A2%20II.md) | 数组、动态规划 | 中等 | -| 0139 | [单词拆分](https://leetcode.cn/problems/word-break/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0139.%20%E5%8D%95%E8%AF%8D%E6%8B%86%E5%88%86.md) | 字典树、记忆化搜索、数组、哈希表、字符串、动态规划 | 中等 | -| 0377 | [组合总和 Ⅳ](https://leetcode.cn/problems/combination-sum-iv/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0377.%20%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8C%20%E2%85%A3.md) | 数组、动态规划 | 中等 | -| 0638 | [大礼包](https://leetcode.cn/problems/shopping-offers/) | | 位运算、记忆化搜索、数组、动态规划、回溯、状态压缩 | 中等 | -| 1449 | [数位成本和为目标值的最大数字](https://leetcode.cn/problems/form-largest-integer-with-digits-that-add-up-to-target/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1449.%20%E6%95%B0%E4%BD%8D%E6%88%90%E6%9C%AC%E5%92%8C%E4%B8%BA%E7%9B%AE%E6%A0%87%E5%80%BC%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E5%AD%97.md) | 数组、动态规划 | 困难 | - -#### 多重背包问题 - -#### 分组背包问题 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 1155 | [掷骰子等于目标和的方法数](https://leetcode.cn/problems/number-of-dice-rolls-with-target-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1155.%20%E6%8E%B7%E9%AA%B0%E5%AD%90%E7%AD%89%E4%BA%8E%E7%9B%AE%E6%A0%87%E5%92%8C%E7%9A%84%E6%96%B9%E6%B3%95%E6%95%B0.md) | 动态规划 | 中等 | -| 2585 | [获得分数的方法数](https://leetcode.cn/problems/number-of-ways-to-earn-points/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2585.%20%E8%8E%B7%E5%BE%97%E5%88%86%E6%95%B0%E7%9A%84%E6%96%B9%E6%B3%95%E6%95%B0.md) | 数组、动态规划 | 困难 | - -#### 多维背包问题 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0474 | [一和零](https://leetcode.cn/problems/ones-and-zeroes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0474.%20%E4%B8%80%E5%92%8C%E9%9B%B6.md) | 数组、字符串、动态规划 | 中等 | -| 0879 | [盈利计划](https://leetcode.cn/problems/profitable-schemes/) | | 数组、动态规划 | 困难 | -| 1995 | [统计特殊四元组](https://leetcode.cn/problems/count-special-quadruplets/) | | 数组、枚举 | 简单 | - diff --git a/Contents/10.Dynamic-Programming/04.Knapsack-Problem/index.md b/Contents/10.Dynamic-Programming/04.Knapsack-Problem/index.md deleted file mode 100644 index f9e0e6ae..00000000 --- a/Contents/10.Dynamic-Programming/04.Knapsack-Problem/index.md +++ /dev/null @@ -1,8 +0,0 @@ -## 本章内容 - -- [背包问题知识（一）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/01.Knapsack-Problem-01.md) -- [背包问题知识（二）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/02.Knapsack-Problem-02.md) -- [背包问题知识（三）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/03.Knapsack-Problem-03.md) -- [背包问题知识（四）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/04.Knapsack-Problem-04.md) -- [背包问题知识（五）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/05.Knapsack-Problem-05.md) -- [背包问题题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/06.Knapsack-Problem-List.md) \ No newline at end of file diff --git a/Contents/10.Dynamic-Programming/05.Interval-DP/02.Interval-DP-List.md b/Contents/10.Dynamic-Programming/05.Interval-DP/02.Interval-DP-List.md deleted file mode 100644 index 45050e4a..00000000 --- a/Contents/10.Dynamic-Programming/05.Interval-DP/02.Interval-DP-List.md +++ /dev/null @@ -1,19 +0,0 @@ -### 区间 DP 题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0486 | [预测赢家](https://leetcode.cn/problems/predict-the-winner/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0486.%20%E9%A2%84%E6%B5%8B%E8%B5%A2%E5%AE%B6.md) | 递归、数组、数学、动态规划、博弈 | 中等 | -| 0312 | [戳气球](https://leetcode.cn/problems/burst-balloons/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0312.%20%E6%88%B3%E6%B0%94%E7%90%83.md) | 数组、动态规划 | 困难 | -| 0877 | [石子游戏](https://leetcode.cn/problems/stone-game/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0877.%20%E7%9F%B3%E5%AD%90%E6%B8%B8%E6%88%8F.md) | 数组、数学、动态规划、博弈 | 中等 | -| 1000 | [合并石头的最低成本](https://leetcode.cn/problems/minimum-cost-to-merge-stones/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1000.%20%E5%90%88%E5%B9%B6%E7%9F%B3%E5%A4%B4%E7%9A%84%E6%9C%80%E4%BD%8E%E6%88%90%E6%9C%AC.md) | 数组、动态规划、前缀和 | 困难 | -| 1547 | [切棍子的最小成本](https://leetcode.cn/problems/minimum-cost-to-cut-a-stick/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1547.%20%E5%88%87%E6%A3%8D%E5%AD%90%E7%9A%84%E6%9C%80%E5%B0%8F%E6%88%90%E6%9C%AC.md) | 数组、动态规划、排序 | 困难 | -| 0664 | [奇怪的打印机](https://leetcode.cn/problems/strange-printer/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0664.%20%E5%A5%87%E6%80%AA%E7%9A%84%E6%89%93%E5%8D%B0%E6%9C%BA.md) | 字符串、动态规划 | 困难 | -| 1039 | [多边形三角剖分的最低得分](https://leetcode.cn/problems/minimum-score-triangulation-of-polygon/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1039.%20%E5%A4%9A%E8%BE%B9%E5%BD%A2%E4%B8%89%E8%A7%92%E5%89%96%E5%88%86%E7%9A%84%E6%9C%80%E4%BD%8E%E5%BE%97%E5%88%86.md) | 数组、动态规划 | 中等 | -| 0546 | [移除盒子](https://leetcode.cn/problems/remove-boxes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0546.%20%E7%A7%BB%E9%99%A4%E7%9B%92%E5%AD%90.md) | 记忆化搜索、数组、动态规划 | 困难 | -| 0375 | [猜数字大小 II](https://leetcode.cn/problems/guess-number-higher-or-lower-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0375.%20%E7%8C%9C%E6%95%B0%E5%AD%97%E5%A4%A7%E5%B0%8F%20II.md) | 数学、动态规划、博弈 | 中等 | -| 0678 | [有效的括号字符串](https://leetcode.cn/problems/valid-parenthesis-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0678.%20%E6%9C%89%E6%95%88%E7%9A%84%E6%8B%AC%E5%8F%B7%E5%AD%97%E7%AC%A6%E4%B8%B2.md) | 栈、贪心、字符串、动态规划 | 中等 | -| 0005 | [最长回文子串](https://leetcode.cn/problems/longest-palindromic-substring/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0005.%20%E6%9C%80%E9%95%BF%E5%9B%9E%E6%96%87%E5%AD%90%E4%B8%B2.md) | 字符串、动态规划 | 中等 | -| 0516 | [最长回文子序列](https://leetcode.cn/problems/longest-palindromic-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0516.%20%E6%9C%80%E9%95%BF%E5%9B%9E%E6%96%87%E5%AD%90%E5%BA%8F%E5%88%97.md) | 字符串、动态规划 | 中等 | -| 0730 | [统计不同回文子序列](https://leetcode.cn/problems/count-different-palindromic-subsequences/) | | 字符串、动态规划 | 困难 | -| 2104 | [子数组范围和](https://leetcode.cn/problems/sum-of-subarray-ranges/) | | 栈、数组、单调栈 | 中等 | - diff --git a/Contents/10.Dynamic-Programming/05.Interval-DP/index.md b/Contents/10.Dynamic-Programming/05.Interval-DP/index.md deleted file mode 100644 index 0b639e35..00000000 --- a/Contents/10.Dynamic-Programming/05.Interval-DP/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [区间 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/05.Interval-DP/01.Interval-DP.md) -- [区间 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/05.Interval-DP/02.Interval-DP-List.md) \ No newline at end of file diff --git a/Contents/10.Dynamic-Programming/06.Tree-DP/02.Tree-DP-List.md b/Contents/10.Dynamic-Programming/06.Tree-DP/02.Tree-DP-List.md deleted file mode 100644 index 41bd0006..00000000 --- a/Contents/10.Dynamic-Programming/06.Tree-DP/02.Tree-DP-List.md +++ /dev/null @@ -1,30 +0,0 @@ -### 树形 DP 题目 - -#### 固定根的树形 DP 题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0543 | [二叉树的直径](https://leetcode.cn/problems/diameter-of-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0543.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E7%9B%B4%E5%BE%84.md) | 树、深度优先搜索、二叉树 | 简单 | -| 0124 | [二叉树中的最大路径和](https://leetcode.cn/problems/binary-tree-maximum-path-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0124.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E8%B7%AF%E5%BE%84%E5%92%8C.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | -| 1245 | [树的直径](https://leetcode.cn/problems/tree-diameter/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1245.%20%E6%A0%91%E7%9A%84%E7%9B%B4%E5%BE%84.md) | 树、深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | -| 2246 | [相邻字符不同的最长路径](https://leetcode.cn/problems/longest-path-with-different-adjacent-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2246.%20%E7%9B%B8%E9%82%BB%E5%AD%97%E7%AC%A6%E4%B8%8D%E5%90%8C%E7%9A%84%E6%9C%80%E9%95%BF%E8%B7%AF%E5%BE%84.md) | 树、深度优先搜索、图、拓扑排序、数组、字符串 | 困难 | -| 0687 | [最长同值路径](https://leetcode.cn/problems/longest-univalue-path/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0687.%20%E6%9C%80%E9%95%BF%E5%90%8C%E5%80%BC%E8%B7%AF%E5%BE%84.md) | 树、深度优先搜索、二叉树 | 中等 | -| 0337 | [打家劫舍 III](https://leetcode.cn/problems/house-robber-iii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0337.%20%E6%89%93%E5%AE%B6%E5%8A%AB%E8%88%8D%20III.md) | 树、深度优先搜索、动态规划、二叉树 | 中等 | -| 0333 | [最大 BST 子树](https://leetcode.cn/problems/largest-bst-subtree/) | | 树、深度优先搜索、二叉搜索树、动态规划、二叉树 | 中等 | -| 1617 | [统计子树中城市之间最大距离](https://leetcode.cn/problems/count-subtrees-with-max-distance-between-cities/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1617.%20%E7%BB%9F%E8%AE%A1%E5%AD%90%E6%A0%91%E4%B8%AD%E5%9F%8E%E5%B8%82%E4%B9%8B%E9%97%B4%E6%9C%80%E5%A4%A7%E8%B7%9D%E7%A6%BB.md) | 位运算、树、动态规划、状态压缩、枚举 | 困难 | -| 2538 | [最大价值和与最小价值和的差值](https://leetcode.cn/problems/difference-between-maximum-and-minimum-price-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2538.%20%E6%9C%80%E5%A4%A7%E4%BB%B7%E5%80%BC%E5%92%8C%E4%B8%8E%E6%9C%80%E5%B0%8F%E4%BB%B7%E5%80%BC%E5%92%8C%E7%9A%84%E5%B7%AE%E5%80%BC.md) | 树、深度优先搜索、数组、动态规划 | 困难 | -| 1569 | [将子数组重新排序得到同一个二叉搜索树的方案数](https://leetcode.cn/problems/number-of-ways-to-reorder-array-to-get-same-bst/) | | 树、并查集、二叉搜索树、记忆化搜索、数组、数学、分治、动态规划、二叉树、组合数学 | 困难 | -| 1372 | [二叉树中的最长交错路径](https://leetcode.cn/problems/longest-zigzag-path-in-a-binary-tree/) | | 树、深度优先搜索、动态规划、二叉树 | 中等 | -| 1373 | [二叉搜索子树的最大键值和](https://leetcode.cn/problems/maximum-sum-bst-in-binary-tree/) | | 树、深度优先搜索、二叉搜索树、动态规划、二叉树 | 困难 | -| 0968 | [监控二叉树](https://leetcode.cn/problems/binary-tree-cameras/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0968.%20%E7%9B%91%E6%8E%A7%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | -| 1273 | [删除树节点](https://leetcode.cn/problems/delete-tree-nodes/) | | 树、深度优先搜索、广度优先搜索 | 中等 | -| 1519 | [子树中标签相同的节点数](https://leetcode.cn/problems/number-of-nodes-in-the-sub-tree-with-the-same-label/) | | 树、深度优先搜索、广度优先搜索、哈希表、计数 | 中等 | - -#### 不定根的树形 DP 题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0310 | [最小高度树](https://leetcode.cn/problems/minimum-height-trees/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0310.%20%E6%9C%80%E5%B0%8F%E9%AB%98%E5%BA%A6%E6%A0%91.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | -| 0834 | [树中距离之和](https://leetcode.cn/problems/sum-of-distances-in-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0834.%20%E6%A0%91%E4%B8%AD%E8%B7%9D%E7%A6%BB%E4%B9%8B%E5%92%8C.md) | 树、深度优先搜索、图、动态规划 | 困难 | -| 2581 | [统计可能的树根数目](https://leetcode.cn/problems/count-number-of-possible-root-nodes/) | | 树、深度优先搜索、哈希表、动态规划 | 困难 | - diff --git a/Contents/10.Dynamic-Programming/06.Tree-DP/index.md b/Contents/10.Dynamic-Programming/06.Tree-DP/index.md deleted file mode 100644 index 1b72c8a4..00000000 --- a/Contents/10.Dynamic-Programming/06.Tree-DP/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [树形 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/06.Tree-DP/01.Tree-DP.md) -- [树形 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/06.Tree-DP/02.Tree-DP-List.md) \ No newline at end of file diff --git a/Contents/10.Dynamic-Programming/07.State-DP/02.State-DP-List.md b/Contents/10.Dynamic-Programming/07.State-DP/02.State-DP-List.md deleted file mode 100644 index e361328c..00000000 --- a/Contents/10.Dynamic-Programming/07.State-DP/02.State-DP-List.md +++ /dev/null @@ -1,26 +0,0 @@ -### 状态压缩 DP 题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 1879 | [两个数组最小的异或值之和](https://leetcode.cn/problems/minimum-xor-sum-of-two-arrays/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1879.%20%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E6%9C%80%E5%B0%8F%E7%9A%84%E5%BC%82%E6%88%96%E5%80%BC%E4%B9%8B%E5%92%8C.md) | 位运算、数组、动态规划、状态压缩 | 困难 | -| 2172 | [数组的最大与和](https://leetcode.cn/problems/maximum-and-sum-of-array/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2172.%20%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E4%B8%8E%E5%92%8C.md) | 位运算、数组、动态规划、状态压缩 | 困难 | -| 1947 | [最大兼容性评分和](https://leetcode.cn/problems/maximum-compatibility-score-sum/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1947.%20%E6%9C%80%E5%A4%A7%E5%85%BC%E5%AE%B9%E6%80%A7%E8%AF%84%E5%88%86%E5%92%8C.md) | 位运算、数组、动态规划、回溯、状态压缩 | 中等 | -| 1595 | [连通两组点的最小成本](https://leetcode.cn/problems/minimum-cost-to-connect-two-groups-of-points/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1595.%20%E8%BF%9E%E9%80%9A%E4%B8%A4%E7%BB%84%E7%82%B9%E7%9A%84%E6%9C%80%E5%B0%8F%E6%88%90%E6%9C%AC.md) | 位运算、数组、动态规划、状态压缩、矩阵 | 困难 | -| 1494 | [并行课程 II](https://leetcode.cn/problems/parallel-courses-ii/) | | 位运算、图、动态规划、状态压缩 | 困难 | -| 1655 | [分配重复整数](https://leetcode.cn/problems/distribute-repeating-integers/) | | 位运算、数组、动态规划、回溯、状态压缩 | 困难 | -| 1986 | [完成任务的最少工作时间段](https://leetcode.cn/problems/minimum-number-of-work-sessions-to-finish-the-tasks/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1986.%20%E5%AE%8C%E6%88%90%E4%BB%BB%E5%8A%A1%E7%9A%84%E6%9C%80%E5%B0%91%E5%B7%A5%E4%BD%9C%E6%97%B6%E9%97%B4%E6%AE%B5.md) | 位运算、数组、动态规划、回溯、状态压缩 | 中等 | -| 1434 | [每个人戴不同帽子的方案数](https://leetcode.cn/problems/number-of-ways-to-wear-different-hats-to-each-other/) | | 位运算、数组、动态规划、状态压缩 | 困难 | -| 1799 | [N 次操作后的最大分数和](https://leetcode.cn/problems/maximize-score-after-n-operations/) | | 位运算、数组、数学、动态规划、回溯、状态压缩、数论 | 困难 | -| 1681 | [最小不兼容性](https://leetcode.cn/problems/minimum-incompatibility/) | | 位运算、数组、动态规划、状态压缩 | 困难 | -| 0526 | [优美的排列](https://leetcode.cn/problems/beautiful-arrangement/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0526.%20%E4%BC%98%E7%BE%8E%E7%9A%84%E6%8E%92%E5%88%97.md) | 位运算、数组、动态规划、回溯、状态压缩 | 中等 | -| 0351 | [安卓系统手势解锁](https://leetcode.cn/problems/android-unlock-patterns/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0351.%20%E5%AE%89%E5%8D%93%E7%B3%BB%E7%BB%9F%E6%89%8B%E5%8A%BF%E8%A7%A3%E9%94%81.md) | 动态规划、回溯 | 中等 | -| 0464 | [我能赢吗](https://leetcode.cn/problems/can-i-win/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0464.%20%E6%88%91%E8%83%BD%E8%B5%A2%E5%90%97.md) | 位运算、记忆化搜索、数学、动态规划、状态压缩、博弈 | 中等 | -| 0847 | [访问所有节点的最短路径](https://leetcode.cn/problems/shortest-path-visiting-all-nodes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0847.%20%E8%AE%BF%E9%97%AE%E6%89%80%E6%9C%89%E8%8A%82%E7%82%B9%E7%9A%84%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84.md) | 位运算、广度优先搜索、图、动态规划、状态压缩 | 困难 | -| 0638 | [大礼包](https://leetcode.cn/problems/shopping-offers/) | | 位运算、记忆化搜索、数组、动态规划、回溯、状态压缩 | 中等 | -| 1994 | [好子集的数目](https://leetcode.cn/problems/the-number-of-good-subsets/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1994.%20%E5%A5%BD%E5%AD%90%E9%9B%86%E7%9A%84%E6%95%B0%E7%9B%AE.md) | 位运算、数组、数学、动态规划、状态压缩 | 困难 | -| 1349 | [参加考试的最大学生数](https://leetcode.cn/problems/maximum-students-taking-exam/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1349.%20%E5%8F%82%E5%8A%A0%E8%80%83%E8%AF%95%E7%9A%84%E6%9C%80%E5%A4%A7%E5%AD%A6%E7%94%9F%E6%95%B0.md) | 位运算、数组、动态规划、状态压缩、矩阵 | 困难 | -| 0698 | [划分为k个相等的子集](https://leetcode.cn/problems/partition-to-k-equal-sum-subsets/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0698.%20%E5%88%92%E5%88%86%E4%B8%BAk%E4%B8%AA%E7%9B%B8%E7%AD%89%E7%9A%84%E5%AD%90%E9%9B%86.md) | 位运算、记忆化搜索、数组、动态规划、回溯、状态压缩 | 中等 | -| 0943 | [最短超级串](https://leetcode.cn/problems/find-the-shortest-superstring/) | | 位运算、数组、字符串、动态规划、状态压缩 | 困难 | -| 0691 | [贴纸拼词](https://leetcode.cn/problems/stickers-to-spell-word/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0691.%20%E8%B4%B4%E7%BA%B8%E6%8B%BC%E8%AF%8D.md) | 位运算、数组、字符串、动态规划、回溯、状态压缩 | 困难 | -| 0982 | [按位与为零的三元组](https://leetcode.cn/problems/triples-with-bitwise-and-equal-to-zero/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0982.%20%E6%8C%89%E4%BD%8D%E4%B8%8E%E4%B8%BA%E9%9B%B6%E7%9A%84%E4%B8%89%E5%85%83%E7%BB%84.md) | 位运算、数组、哈希表 | 困难 | - diff --git a/Contents/10.Dynamic-Programming/07.State-DP/index.md b/Contents/10.Dynamic-Programming/07.State-DP/index.md deleted file mode 100644 index d0d1ea87..00000000 --- a/Contents/10.Dynamic-Programming/07.State-DP/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [状态压缩 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/07.State-DP/01.State-DP.md) -- [状态压缩 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/07.State-DP/02.State-DP-List.md) \ No newline at end of file diff --git a/Contents/10.Dynamic-Programming/08.Counting-DP/02.Counting-DP-List.md b/Contents/10.Dynamic-Programming/08.Counting-DP/02.Counting-DP-List.md deleted file mode 100644 index b3154c55..00000000 --- a/Contents/10.Dynamic-Programming/08.Counting-DP/02.Counting-DP-List.md +++ /dev/null @@ -1,15 +0,0 @@ -### 计数 DP 题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0062 | [不同路径](https://leetcode.cn/problems/unique-paths/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0062.%20%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84.md) | 数学、动态规划、组合数学 | 中等 | -| 0063 | [不同路径 II](https://leetcode.cn/problems/unique-paths-ii/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0063.%20%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84%20II.md) | 数组、动态规划、矩阵 | 中等 | -| 0343 | [整数拆分](https://leetcode.cn/problems/integer-break/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0343.%20%E6%95%B4%E6%95%B0%E6%8B%86%E5%88%86.md) | 数学、动态规划 | 中等 | -| 0096 | [不同的二叉搜索树](https://leetcode.cn/problems/unique-binary-search-trees/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0096.%20%E4%B8%8D%E5%90%8C%E7%9A%84%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md) | 树、二叉搜索树、数学、动态规划、二叉树 | 中等 | -| 1259 | [不相交的握手](https://leetcode.cn/problems/handshakes-that-dont-cross/) | | 数学、动态规划 | 困难 | -| 0790 | [多米诺和托米诺平铺](https://leetcode.cn/problems/domino-and-tromino-tiling/) | | 动态规划 | 中等 | -| 0070 | [爬楼梯](https://leetcode.cn/problems/climbing-stairs/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0070.%20%E7%88%AC%E6%A5%BC%E6%A2%AF.md) | 记忆化搜索、数学、动态规划 | 简单 | -| 0746 | [使用最小花费爬楼梯](https://leetcode.cn/problems/min-cost-climbing-stairs/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0746.%20%E4%BD%BF%E7%94%A8%E6%9C%80%E5%B0%8F%E8%8A%B1%E8%B4%B9%E7%88%AC%E6%A5%BC%E6%A2%AF.md) | 数组、动态规划 | 简单 | -| 0509 | [斐波那契数](https://leetcode.cn/problems/fibonacci-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0509.%20%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0.md) | 递归、记忆化搜索、数学、动态规划 | 简单 | -| 1137 | [第 N 个泰波那契数](https://leetcode.cn/problems/n-th-tribonacci-number/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1137.%20%E7%AC%AC%20N%20%E4%B8%AA%E6%B3%B0%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0.md) | 记忆化搜索、数学、动态规划 | 简单 | - diff --git a/Contents/10.Dynamic-Programming/08.Counting-DP/index.md b/Contents/10.Dynamic-Programming/08.Counting-DP/index.md deleted file mode 100644 index d17520dc..00000000 --- a/Contents/10.Dynamic-Programming/08.Counting-DP/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [计数 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/08.Counting-DP/01.Counting-DP.md) -- [计数 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/08.Counting-DP/02.Counting-DP-List.md) \ No newline at end of file diff --git a/Contents/10.Dynamic-Programming/09.Digit-DP/02.Digit-DP-List.md b/Contents/10.Dynamic-Programming/09.Digit-DP/02.Digit-DP-List.md deleted file mode 100644 index f0a0386f..00000000 --- a/Contents/10.Dynamic-Programming/09.Digit-DP/02.Digit-DP-List.md +++ /dev/null @@ -1,18 +0,0 @@ -### 数位 DP 题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 2376 | [统计特殊整数](https://leetcode.cn/problems/count-special-integers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2376.%20%E7%BB%9F%E8%AE%A1%E7%89%B9%E6%AE%8A%E6%95%B4%E6%95%B0.md) | 数学、动态规划 | 困难 | -| 0357 | [统计各位数字都不同的数字个数](https://leetcode.cn/problems/count-numbers-with-unique-digits/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0357.%20%E7%BB%9F%E8%AE%A1%E5%90%84%E4%BD%8D%E6%95%B0%E5%AD%97%E9%83%BD%E4%B8%8D%E5%90%8C%E7%9A%84%E6%95%B0%E5%AD%97%E4%B8%AA%E6%95%B0.md) | 数学、动态规划、回溯 | 中等 | -| 1012 | [至少有 1 位重复的数字](https://leetcode.cn/problems/numbers-with-repeated-digits/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1012.%20%E8%87%B3%E5%B0%91%E6%9C%89%201%20%E4%BD%8D%E9%87%8D%E5%A4%8D%E7%9A%84%E6%95%B0%E5%AD%97.md) | 数学、动态规划 | 困难 | -| 0902 | [最大为 N 的数字组合](https://leetcode.cn/problems/numbers-at-most-n-given-digit-set/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0902.%20%E6%9C%80%E5%A4%A7%E4%B8%BA%20N%20%E7%9A%84%E6%95%B0%E5%AD%97%E7%BB%84%E5%90%88.md) | 数组、数学、字符串、二分查找、动态规划 | 困难 | -| 0788 | [旋转数字](https://leetcode.cn/problems/rotated-digits/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0788.%20%E6%97%8B%E8%BD%AC%E6%95%B0%E5%AD%97.md) | 数学、动态规划 | 中等 | -| 0600 | [不含连续1的非负整数](https://leetcode.cn/problems/non-negative-integers-without-consecutive-ones/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0600.%20%E4%B8%8D%E5%90%AB%E8%BF%9E%E7%BB%AD1%E7%9A%84%E9%9D%9E%E8%B4%9F%E6%95%B4%E6%95%B0.md) | 动态规划 | 困难 | -| 0233 | [数字 1 的个数](https://leetcode.cn/problems/number-of-digit-one/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0233.%20%E6%95%B0%E5%AD%97%201%20%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 递归、数学、动态规划 | 困难 | -| 2719 | [统计整数数目](https://leetcode.cn/problems/count-of-integers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/2719.%20%E7%BB%9F%E8%AE%A1%E6%95%B4%E6%95%B0%E6%95%B0%E7%9B%AE.md) | 数学、字符串、动态规划 | 困难 | -| 0248 | [中心对称数 III](https://leetcode.cn/problems/strobogrammatic-number-iii/) | | 递归、数组、字符串 | 困难 | -| 1088 | [易混淆数 II](https://leetcode.cn/problems/confusing-number-ii/) | | 数学、回溯 | 困难 | -| 1067 | [范围内的数字计数](https://leetcode.cn/problems/digit-count-in-range/) | | 数学、动态规划 | 困难 | -| 1742 | [盒子中小球的最大数量](https://leetcode.cn/problems/maximum-number-of-balls-in-a-box/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1742.%20%E7%9B%92%E5%AD%90%E4%B8%AD%E5%B0%8F%E7%90%83%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E9%87%8F.md) | 哈希表、数学、计数 | 简单 | -| 面试题 17.06 | [2出现的次数](https://leetcode.cn/problems/number-of-2s-in-range-lcci/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E9%9D%A2%E8%AF%95%E9%A2%98%2017.06.%202%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0.md) | 递归、数学、动态规划 | 困难 | - diff --git a/Contents/10.Dynamic-Programming/09.Digit-DP/index.md b/Contents/10.Dynamic-Programming/09.Digit-DP/index.md deleted file mode 100644 index 0b745e85..00000000 --- a/Contents/10.Dynamic-Programming/09.Digit-DP/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [数位 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/09.Digit-DP/01.Digit-DP.md) -- [数位 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/09.Digit-DP/02.Digit-DP-List.md) \ No newline at end of file diff --git a/Contents/10.Dynamic-Programming/10.Probability-DP/02.Probability-DP-List.md b/Contents/10.Dynamic-Programming/10.Probability-DP/02.Probability-DP-List.md deleted file mode 100644 index 9e1e26ce..00000000 --- a/Contents/10.Dynamic-Programming/10.Probability-DP/02.Probability-DP-List.md +++ /dev/null @@ -1,13 +0,0 @@ -### 概率 DP 题目 - -| 题号 | 标题 | 题解 | 标签 | 难度 | -| :------ | :------ | :------ | :------ | :------ | -| 0688 | [骑士在棋盘上的概率](https://leetcode.cn/problems/knight-probability-in-chessboard/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0688.%20%E9%AA%91%E5%A3%AB%E5%9C%A8%E6%A3%8B%E7%9B%98%E4%B8%8A%E7%9A%84%E6%A6%82%E7%8E%87.md) | 动态规划 | 中等 | -| 0808 | [分汤](https://leetcode.cn/problems/soup-servings/) | | 数学、动态规划、概率与统计 | 中等 | -| 0837 | [新 21 点](https://leetcode.cn/problems/new-21-game/) | | 数学、动态规划、滑动窗口、概率与统计 | 中等 | -| 1230 | [抛掷硬币](https://leetcode.cn/problems/toss-strange-coins/) | | 数学、动态规划、概率与统计 | 中等 | -| 1467 | [两个盒子中球的颜色数相同的概率](https://leetcode.cn/problems/probability-of-a-two-boxes-having-the-same-number-of-distinct-balls/) | | 数组、数学、动态规划、回溯、组合数学、概率与统计 | 困难 | -| 1227 | [飞机座位分配概率](https://leetcode.cn/problems/airplane-seat-assignment-probability/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1227.%20%E9%A3%9E%E6%9C%BA%E5%BA%A7%E4%BD%8D%E5%88%86%E9%85%8D%E6%A6%82%E7%8E%87.md) | 脑筋急转弯、数学、动态规划、概率与统计 | 中等 | -| 1377 | [T 秒后青蛙的位置](https://leetcode.cn/problems/frog-position-after-t-seconds/) | | 树、深度优先搜索、广度优先搜索、图 | 困难 | -| 剑指 Offer 60 | [n个骰子的点数](https://leetcode.cn/problems/nge-tou-zi-de-dian-shu-lcof/) | | 数学、动态规划、概率与统计 | 中等 | - diff --git a/Contents/10.Dynamic-Programming/10.Probability-DP/index.md b/Contents/10.Dynamic-Programming/10.Probability-DP/index.md deleted file mode 100644 index c719197e..00000000 --- a/Contents/10.Dynamic-Programming/10.Probability-DP/index.md +++ /dev/null @@ -1,4 +0,0 @@ -## 本章内容 - -- [概率 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/10.Probability-DP/01.Probability-DP.md) -- [概率 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/10.Probability-DP/02.Probability-DP-List.md) \ No newline at end of file diff --git a/Contents/10.Dynamic-Programming/11.DP-Optimization/01.Monotone-Stack-Queue-Optimization.md b/Contents/10.Dynamic-Programming/11.DP-Optimization/01.Monotone-Stack-Queue-Optimization.md deleted file mode 100644 index e69de29b..00000000 diff --git a/Contents/10.Dynamic-Programming/11.DP-Optimization/02.Slope-Optimization.md b/Contents/10.Dynamic-Programming/11.DP-Optimization/02.Slope-Optimization.md deleted file mode 100644 index e69de29b..00000000 diff --git a/Contents/10.Dynamic-Programming/11.DP-Optimization/03.Quadrangle-Optimization.md b/Contents/10.Dynamic-Programming/11.DP-Optimization/03.Quadrangle-Optimization.md deleted file mode 100644 index e69de29b..00000000 diff --git a/Contents/10.Dynamic-Programming/11.DP-Optimization/04.DP-Optimization-List.md b/Contents/10.Dynamic-Programming/11.DP-Optimization/04.DP-Optimization-List.md deleted file mode 100644 index a3b5f199..00000000 --- a/Contents/10.Dynamic-Programming/11.DP-Optimization/04.DP-Optimization-List.md +++ /dev/null @@ -1,2 +0,0 @@ -### 动态规划优化题目 - diff --git a/Contents/10.Dynamic-Programming/11.DP-Optimization/index.md b/Contents/10.Dynamic-Programming/11.DP-Optimization/index.md deleted file mode 100644 index 3292fa8a..00000000 --- a/Contents/10.Dynamic-Programming/11.DP-Optimization/index.md +++ /dev/null @@ -1,6 +0,0 @@ -## 本章内容 - -- [单调栈 / 优先队列优化](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/11.DP-Optimization/01.Monotone-Stack-Queue-Optimization.md) -- [斜率优化](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/11.DP-Optimization/02.Slope-Optimization.md) -- [四边形不等式优化](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/11.DP-Optimization/03.Quadrangle-Optimization.md) -- [动态规划优化题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/11.DP-Optimization/04.DP-Optimization-List.md) \ No newline at end of file diff --git a/Contents/10.Dynamic-Programming/index.md b/Contents/10.Dynamic-Programming/index.md deleted file mode 100644 index 86a96ac0..00000000 --- a/Contents/10.Dynamic-Programming/index.md +++ /dev/null @@ -1,63 +0,0 @@ -## 本章内容 - -### 动态规划基础 - -- [动态规划基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/01.Dynamic-Programming-Basic.md) -- [动态规划基础题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/02.Dynamic-Programming-Basic-List.md) - -### 记忆化搜索 - -- [记忆化搜索知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/02.Memoization/01.Memoization.md) -- [记忆化搜索题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/02.Memoization/02.Memoization-List.md) - -### 线性 DP - -- [线性 DP 知识（一）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/03.Linear-DP/01.Linear-DP-01.md) -- [线性 DP 知识（二）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/03.Linear-DP/02.Linear-DP-02.md) -- [线性 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/03.Linear-DP/03.Linear-DP-List.md) - -### 背包问题 - -- [背包问题知识（一）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/01.Knapsack-Problem-01.md) -- [背包问题知识（二）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/02.Knapsack-Problem-02.md) -- [背包问题知识（三）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/03.Knapsack-Problem-03.md) -- [背包问题知识（四）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/04.Knapsack-Problem-04.md) -- [背包问题知识（五）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/05.Knapsack-Problem-05.md) -- [背包问题题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/06.Knapsack-Problem-List.md) - -### 区间 DP - -- [区间 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/05.Interval-DP/01.Interval-DP.md) -- [区间 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/05.Interval-DP/02.Interval-DP-List.md) - -### 树形 DP - -- [树形 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/06.Tree-DP/01.Tree-DP.md) -- [树形 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/06.Tree-DP/02.Tree-DP-List.md) - -### 状态压缩 DP - -- [状态压缩 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/07.State-DP/01.State-DP.md) -- [状态压缩 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/07.State-DP/02.State-DP-List.md) - -### 计数 DP - -- [计数 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/08.Counting-DP/01.Counting-DP.md) -- [计数 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/08.Counting-DP/02.Counting-DP-List.md) - -### 数位 DP - -- [数位 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/09.Digit-DP/01.Digit-DP.md) -- [数位 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/09.Digit-DP/02.Digit-DP-List.md) - -### 概率 DP - -- [概率 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/10.Probability-DP/01.Probability-DP.md) -- [概率 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/10.Probability-DP/02.Probability-DP-List.md) - -### 动态规划优化 - -- [单调栈 / 优先队列优化](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/11.DP-Optimization/01.Monotone-Stack-Queue-Optimization.md) -- [斜率优化](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/11.DP-Optimization/02.Slope-Optimization.md) -- [四边形不等式优化](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/11.DP-Optimization/03.Quadrangle-Optimization.md) -- [动态规划优化题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/11.DP-Optimization/04.DP-Optimization-List.md) \ No newline at end of file diff --git a/Contents/index.md b/Contents/index.md deleted file mode 100644 index 98b07992..00000000 --- a/Contents/index.md +++ /dev/null @@ -1,219 +0,0 @@ -# 算法通关手册（LeetCode） - -## 章节目录 - -### 00. 绪论 - -- [算法与数据结构](./00.Introduction/01.Data-Structures-Algorithms.md) -- [算法复杂度](./00.Introduction/02.Algorithm-Complexity.md) -- [LeetCode 入门与攻略](./00.Introduction/03.LeetCode-Guide.md) -- [LeetCode 题解（字典序排序，850+ 道题解）](./00.Introduction/04.Solutions-List.md) -- [LeetCode 题解（按分类排序，推荐刷题列表 ★★★）](./00.Introduction/05.Categories-List.md) -- [LeetCode 面试最常考 100 题（按分类排序）](./00.Introduction/06.Interview-100-List.md) -- [LeetCode 面试最常考 200 题（按分类排序）](./00.Introduction/07.Interview-200-List.md) - -### 01. 数组 - -- 数组基础知识 - - [数组基础知识](./01.Array/01.Array-Basic/01.Array-Basic.md) - - [数组基础题目](./01.Array/01.Array-Basic/02.Array-Basic-List.md) -- 数组排序算法 - - [冒泡排序](./01.Array/02.Array-Sort/01.Array-Bubble-Sort.md) - - [选择排序](./01.Array/02.Array-Sort/02.Array-Selection-Sort.md) - - [插入排序](./01.Array/02.Array-Sort/03.Array-Insertion-Sort.md) - - [希尔排序](./01.Array/02.Array-Sort/04.Array-Shell-Sort.md) - - [归并排序](./01.Array/02.Array-Sort/05.Array-Merge-Sort.md) - - [快速排序](./01.Array/02.Array-Sort/06.Array-Quick-Sort.md) - - [堆排序](./01.Array/02.Array-Sort/07.Array-Heap-Sort.md) - - [计数排序](./01.Array/02.Array-Sort/08.Array-Counting-Sort.md) - - [桶排序](./01.Array/02.Array-Sort/09.Array-Bucket-Sort.md) - - [基数排序](./01.Array/02.Array-Sort/10.Array-Radix-Sort.md) - - [数组排序题目](./01.Array/02.Array-Sort/11.Array-Sort-List.md) -- 二分查找 - - [二分查找知识（一）](./01.Array/03.Array-Binary-Search/01.Array-Binary-Search-01.md) - - [二分查找知识（二）](./01.Array/03.Array-Binary-Search/02.Array-Binary-Search-02.md) - - [二分查找题目](./01.Array/03.Array-Binary-Search/03.Array-Binary-Search-List.md) -- 数组双指针 - - [数组双指针知识](./01.Array/04.Array-Two-Pointers/01.Array-Two-Pointers.md) - - [数组双指针题目](./01.Array/04.Array-Two-Pointers/02.Array-Two-Pointers-List.md) -- 数组滑动窗口 - - [数组滑动窗口知识](./01.Array/05.Array-Sliding-Window/01.Array-Sliding-Window.md) - - [数组滑动窗口题目](./01.Array/05.Array-Sliding-Window/02.Array-Sliding-Window-List.md) - -### 02. 链表 - -- 链表基础知识 - - [链表基础知识](./02.Linked-List/01.Linked-List-Basic/01.Linked-List-Basic.md) - - [链表经典题目](./02.Linked-List/01.Linked-List-Basic/02.Linked-List-Basic-List.md) -- 链表排序 - - [链表排序知识](./02.Linked-List/02.Linked-List-Sort/01.Linked-List-Sort.md) - - [链表排序题目](./02.Linked-List/02.Linked-List-Sort/02.Linked-List-Sort-List.md) -- 链表双指针 - - [链表双指针知识](./02.Linked-List/03.Linked-List-Two-Pointers/01.Linked-List-Two-Pointers.md) - - [链表双指针题目](./02.Linked-List/03.Linked-List-Two-Pointers/02.Linked-List-Two-Pointers-List.md) - -### 03. 堆栈 - -- 堆栈基础知识 - - [堆栈基础知识](./03.Stack/01.Stack-Basic/01.Stack-Basic.md) - - [堆栈基础题目](./03.Stack/01.Stack-Basic/02.Stack-Basic-List.md) -- 单调栈 - - [单调栈知识](./03.Stack/02.Monotone-Stack/01.Monotone-Stack.md) - - [单调栈题目](./03.Stack/02.Monotone-Stack/02.Monotone-Stack-List.md) - -### 04. 队列 - -- 队列基础知识 - - [队列基础知识](./04.Queue/01.Queue-Basic/01.Queue-Basic.md) - - [队列基础题目](./04.Queue/01.Queue-Basic/02.Queue-Basic-List.md) -- 优先队列 - - [优先队列知识](./04.Queue/02.Priority-Queue/01.Priority-Queue.md) - - [优先队列题目](./04.Queue/02.Priority-Queue/02.Priority-Queue-List.md) - -### 05. 哈希表 - -- [哈希表知识](./05.Hash-Table/01.Hash-Table.md) -- [哈希表题目](./05.Hash-Table/02.Hash-Table-List.md) - -### 06. 字符串 - -- 字符串基础知识 - - [字符串基础知识](./06.String/01.String-Basic/01.String-Basic.md) - - [字符串经典题目](./06.String/01.String-Basic/02.String-Basic-List.md) -- 单模式串匹配 - - [Brute Force 算法](./06.String/02.String-Single-Pattern-Matching/01.String-Brute-Force.md) - - [Rabin Karp 算法](./06.String/02.String-Single-Pattern-Matching/02.String-Rabin-Karp.md) - - [KMP 算法](./06.String/02.String-Single-Pattern-Matching/03.String-KMP.md) - - [Boyer Moore 算法](./06.String/02.String-Single-Pattern-Matching/04.String-Boyer-Moore.md) - - [Horspool 算法](./06.String/02.String-Single-Pattern-Matching/05.String-Horspool.md) - - [Sunday 算法](./06.String/02.String-Single-Pattern-Matching/06.String-Sunday.md) - - [单模式串匹配题目](./06.String/02.String-Single-Pattern-Matching/07.String-Single-Pattern-Matching-List.md) -- 多模式串匹配 - - [字典树知识](./06.String/03.String-Multi-Pattern-Matching/01.Trie.md) - - [字典树题目](./06.String/03.String-Multi-Pattern-Matching/02.Trie-List.md) - - [AC 自动机知识](./06.String/03.String-Multi-Pattern-Matching/03.AC-Automaton.md) - - [AC 自动机题目](./06.String/03.String-Multi-Pattern-Matching/04.AC-Automaton-List.md) - - [后缀数组知识](./06.String/03.String-Multi-Pattern-Matching/05.Suffix-Array.md) - - [后缀数组题目](./06.String/03.String-Multi-Pattern-Matching/06.Suffix-Array-List.md) - -### 07. 树 - -- 二叉树 - - [树与二叉树基础知识](./07.Tree/01.Binary-Tree/01.Binary-Tree-Basic.md) - - [二叉树的遍历知识](./07.Tree/01.Binary-Tree/02.Binary-Tree-Traverse.md) - - [二叉树的遍历题目](./07.Tree/01.Binary-Tree/03.Binary-Tree-Traverse-List.md) - - [二叉树的还原知识](./07.Tree/01.Binary-Tree/04.Binary-Tree-Reduction.md) - - [二叉树的还原题目](./07.Tree/01.Binary-Tree/05.Binary-Tree-Reduction-List.md) -- 二叉搜索树 - - [二叉搜索树知识](./07.Tree/02.Binary-Search-Tree/01.Binary-Search-Tree.md) - - [二叉搜索树题目](./07.Tree/02.Binary-Search-Tree/02.Binary-Search-Tree-List.md) -- 线段树 - - [线段树知识](./07.Tree/03.Segment-Tree/01.Segment-Tree.md) - - [线段树题目](./07.Tree/03.Segment-Tree/02.Segment-Tree-List.md) -- 树状数组 - - [树状数组知识](./07.Tree/04.Binary-Indexed-Tree/01.Binary-Indexed-Tree.md) - - [树状数组题目](./07.Tree/04.Binary-Indexed-Tree/02.Binary-Indexed-Tree-List.md) -- 并查集 - - [并查集知识](./07.Tree/05.Union-Find/01.Union-Find.md) - - [并查集题目](./07.Tree/05.Union-Find/02.Union-Find-List.md) - -### 08. 图论 - -- 图的基础知识 - - [图的定义和分类](./08.Graph/01.Graph-Basic/01.Graph-Basic.md) - - [图的存储结构和问题应用](./08.Graph/01.Graph-Basic/02.Graph-Structure.md) -- 图的遍历 - - [图的深度优先搜索知识](./08.Graph/02.Graph-Traversal/01.Graph-DFS.md) - - [图的深度优先搜索题目](./08.Graph/02.Graph-Traversal/02.Graph-DFS-List.md) - - [图的广度优先搜索知识](./08.Graph/02.Graph-Traversal/03.Graph-BFS.md) - - [图的广度优先搜索题目](./08.Graph/02.Graph-Traversal/04.Graph-BFS-List.md) - - [图的拓扑排序知识](./08.Graph/02.Graph-Traversal/05.Graph-Topological-Sorting.md) - - [图的拓扑排序题目](./08.Graph/02.Graph-Traversal/06.Graph-Topological-Sorting-List.md) -- 图的生成树 - - [图的最小生成树知识](./08.Graph/03.Graph-Spanning-Tree/01.Graph-Minimum-Spanning-Tree.md) - - [图的最小生成树题目](./08.Graph/03.Graph-Spanning-Tree/02.Graph-Minimum-Spanning-Tree-List.md) -- 最短路径 - - [单源最短路径知识（一）](./08.Graph/04.Graph-Shortest-Path/01.Graph-Single-Source-Shortest-Path-01.md) - - [单源最短路径知识（二）](./08.Graph/04.Graph-Shortest-Path/02.Graph-Single-Source-Shortest-Path-02.md) - - [单源最短路径题目](./08.Graph/04.Graph-Shortest-Path/03.Graph-Single-Source-Shortest-Path-List.md) - - [多源最短路径知识](./08.Graph/04.Graph-Shortest-Path/04.Graph-Multi-Source-Shortest-Path.md) - - [多源最短路径题目](./08.Graph/04.Graph-Shortest-Path/05.Graph-Multi-Source-Shortest-Path-List.md) - - [次短路径知识](./08.Graph/04.Graph-Shortest-Path/06.Graph-The-Second-Shortest-Path.md) - - [次短路径题目](./08.Graph/04.Graph-Shortest-Path/07.Graph-The-Second-Shortest-Path-List.md) - - [差分约束系统知识](./08.Graph/04.Graph-Shortest-Path/08.Graph-System-Of-Difference-Constraints.md) - - [差分约束系统题目](./08.Graph/04.Graph-Shortest-Path/09.Graph-System-Of-Difference-Constraints-List.md) -- 二分图 - - [二分图基础知识](./08.Graph/05.Graph-Bipartite/01.Graph-Bipartite-Basic.md) - - [二分图基础题目](./08.Graph/05.Graph-Bipartite/02.Graph-Bipartite-Basic-List.md) - - [二分图最大匹配知识](./08.Graph/05.Graph-Bipartite/03.Graph-Bipartite-Matching.md) - - [匈牙利算法](./08.Graph/05.Graph-Bipartite/04.Graph-Hungarian-Algorithm.md) - - [Hopcroft-Karp 算法](./08.Graph/05.Graph-Bipartite/05.Graph-Hopcroft-Karp.md) - - [二分图最大匹配题目](./08.Graph/05.Graph-Bipartite/06.Graph-Bipartite-Matching-List.md) - -### 09. 基础算法 - -- 枚举算法 - - [枚举算法知识](./09.Algorithm-Base/01.Enumeration-Algorithm/01.Enumeration-Algorithm.md) - - [枚举算法题目](./09.Algorithm-Base/01.Enumeration-Algorithm/02.Enumeration-Algorithm-List.md) -- 递归算法 - - [递归算法知识](./09.Algorithm-Base/02.Recursive-Algorithm/01.Recursive-Algorithm.md) - - [递归算法题目](./09.Algorithm-Base/02.Recursive-Algorithm/02.Recursive-Algorithm-List.md) -- 分治算法 - - [分治算法知识](./09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/01.Divide-And-Conquer-Algorithm.md) - - [分治算法题目](./09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/02.Divide-And-Conquer-Algorithm-List.md) -- 回溯算法 - - [回溯算法知识](./09.Algorithm-Base/04.Backtracking-Algorithm/01.Backtracking-Algorithm.md) - - [回溯算法题目](./09.Algorithm-Base/04.Backtracking-Algorithm/02.Backtracking-Algorithm-List.md) -- 贪心算法 - - [贪心算法知识](./09.Algorithm-Base/05.Greedy-Algorithm/01.Greedy-Algorithm.md) - - [贪心算法题目](./09.Algorithm-Base/05.Greedy-Algorithm/02.Greedy-Algorithm-List.md) -- 位运算 - - [位运算知识](./09.Algorithm-Base/06.Bit-Operation/01.Bit-Operation.md) - - [位运算题目](./09.Algorithm-Base/06.Bit-Operation/02.Bit-Operation-List.md) - -### 10. 动态规划 - -- 动态规划基础 - - [动态规划基础知识](./10.Dynamic-Programming/01.Dynamic-Programming-Basic/01.Dynamic-Programming-Basic.md) - - [动态规划基础题目](./10.Dynamic-Programming/01.Dynamic-Programming-Basic/02.Dynamic-Programming-Basic-List.md) -- 记忆化搜索 - - [记忆化搜索知识](./10.Dynamic-Programming/02.Memoization/01.Memoization.md) - - [记忆化搜索题目](./10.Dynamic-Programming/02.Memoization/02.Memoization-List.md) -- 线性 DP - - [线性 DP 知识（一）](./10.Dynamic-Programming/03.Linear-DP/01.Linear-DP-01.md) - - [线性 DP 知识（二）](./10.Dynamic-Programming/03.Linear-DP/02.Linear-DP-02.md) - - [线性 DP 题目](./10.Dynamic-Programming/03.Linear-DP/03.Linear-DP-List.md) -- 背包问题 - - [背包问题知识（一）](./10.Dynamic-Programming/04.Knapsack-Problem/01.Knapsack-Problem-01.md) - - [背包问题知识（二）](./10.Dynamic-Programming/04.Knapsack-Problem/02.Knapsack-Problem-02.md) - - [背包问题知识（三）](./10.Dynamic-Programming/04.Knapsack-Problem/03.Knapsack-Problem-03.md) - - [背包问题知识（四）](./10.Dynamic-Programming/04.Knapsack-Problem/04.Knapsack-Problem-04.md) - - [背包问题知识（五）](./10.Dynamic-Programming/04.Knapsack-Problem/05.Knapsack-Problem-05.md) - - [背包问题题目](./10.Dynamic-Programming/04.Knapsack-Problem/06.Knapsack-Problem-List.md) -- 区间 DP - - [区间 DP 知识](./10.Dynamic-Programming/05.Interval-DP/01.Interval-DP.md) - - [区间 DP 题目](./10.Dynamic-Programming/05.Interval-DP/02.Interval-DP-List.md) -- 树形 DP - - [树形 DP 知识](./10.Dynamic-Programming/06.Tree-DP/01.Tree-DP.md) - - [树形 DP 题目](./10.Dynamic-Programming/06.Tree-DP/02.Tree-DP-List.md) -- 状态压缩 DP - - [状态压缩 DP 知识](./10.Dynamic-Programming/07.State-DP/01.State-DP.md) - - [状态压缩 DP 题目](./10.Dynamic-Programming/07.State-DP/02.State-DP-List.md) -- 计数 DP - - [计数 DP 知识](./10.Dynamic-Programming/08.Counting-DP/01.Counting-DP.md) - - [计数 DP 题目](./10.Dynamic-Programming/08.Counting-DP/02.Counting-DP-List.md) -- 数位 DP - - [数位 DP 知识](./10.Dynamic-Programming/09.Digit-DP/01.Digit-DP.md) - - [数位 DP 题目](./10.Dynamic-Programming/09.Digit-DP/02.Digit-DP-List.md) -- 概率 DP - - [概率 DP 知识](./10.Dynamic-Programming/10.Probability-DP/01.Probability-DP.md) - - [概率 DP 题目](./10.Dynamic-Programming/10.Probability-DP/02.Probability-DP-List.md) -- 动态规划优化 - - [单调栈 / 优先队列优化](./10.Dynamic-Programming/11.DP-Optimization/01.Monotone-Stack-Queue-Optimization.md) - - [斜率优化](./10.Dynamic-Programming/11.DP-Optimization/02.Slope-Optimization.md) - - [四边形不等式优化](./10.Dynamic-Programming/11.DP-Optimization/03.Quadrangle-Optimization.md) - - [动态规划优化题目](./10.Dynamic-Programming/11.DP-Optimization/04.DP-Optimization-List.md) - -### 11. 附加内容 - -- [内容完成时间线](./Contents/Others/Update-Time.md) diff --git a/README.md b/README.md index 9b5c6cff..752473e7 100644 --- a/README.md +++ b/README.md @@ -1,262 +1,67 @@ -# 算法通关手册（LeetCode） +## 1. 本书简介 -## 01. 项目简介 +本书不仅仅只是一本算法题解书，更是一本算法与数据结构基础知识的讲解书。 -- **「算法与数据结构」** 基础知识的讲解教程，「LeetCode」800+ 道题目的详细解析。本项目易于理解，没有大跨度的思维跳跃，项目中使用部分图示、例子来帮助理解。 +- 超详细的 **「算法与数据结构」** 基础讲解教程，**「LeetCode 800+ 道」** 经典题目详细解析。 +- 本项目易于理解，没有大跨度的思维跳跃，项目中使用大量图示、例子来帮助理解。 +- 本项目先从基础的数据结构和算法开始讲解，再针对不同分类的数据结构和算法，进行具体题目的讲解分析。让读者可以通过「算法基础理论学习」和「编程实战学习」相结合的方式，彻底的掌握算法知识。 +- 本项目从各大知名互联网公司面试算法题中整理汇总了 **「LeetCode 200 道高频面试题」**，帮助面试者更有针对性的准备面试。 -- 本教程先从基础的数据结构和算法开始讲解，再针对不同分类的数据结构和算法，进行具体题目的讲解分析。让读者可以通过「算法基础理论学习」和「编程实战学习」相结合的方式，彻底的掌握算法知识。 +### 1.1 源码地址 -- 本教程采用 Python 作为编程语言，要求学习者已有基本 Python 程序设计的知识与经验。 +本书内容及代码都放在 [Github repo](https://github.com/itcharge/AlgoNote) 中，欢迎在下方项目中 **「Star ⭐️ 」** 和 **「Fork」**，这是对我最大的鼓励和支持。 -## 02. 项目地址 +- Github 地址：[https://github.com/itcharge/AlgoNote](https://github.com/itcharge/AlgoNote) -欢迎右上角 **「Star ⭐️ 」** 和 **「Fork」**，这是对我最大的鼓励和支持。 +### 1.2 目标读者 -- GitHub 地址：[https://github.com/itcharge/LeetCode-Py](https://github.com/itcharge/LeetCode-Py) +- 拥有 Python 编程基础或其他编程语言基础的编程爱好者 +- 对 LeetCode 刷题感兴趣或准备算法面试的面试人员 +- 对算法感兴趣的计算机专业学生或程序员 +- 想要提升编程思维和问题解决能力的开发者 -支持黑暗模式的在线电子书《算法通关手册》。 +### 1.3 内容结构 -- 电子书地址：[https://algo.itcharge.cn](https://algo.itcharge.cn) +本书采用算法与数据结构相结合的方法，把内容分为如下几个主要部分： -![电子书浅色模式](./Assets/Images/algo-book-light.png) +- **0. 序言**：介绍数据结构与算法的基础知识、算法复杂度、LeetCode 的入门和攻略，为后面的学习打好基础。 +- **1. 数组**：讲解数组的基本概念、数组的基本操作。 +- **2. 链表**：讲解链表的基本概念、操作和应用，包括单链表、双向链表、循环链表等。 +- **3. 栈、队列、哈希表**：详细介绍栈、队列、哈希表这三种数据结构，包括它们的基本概念、实现方式、应用场景以及相关的经典算法题。 +- **4. 字符串**：讲解字符串的基本操作、单字符串匹配算法、多字符串匹配算法，以及字符串相关的经典算法题。 +- **5. 树结构**：介绍树的基本概念、二叉树、二叉搜索树、线段树、树状数组、并查集等数据结构。 +- **6. 图论**：讲解图的基本概念、表示方法、遍历算法和经典应用。 +- **7. 基础算法**：介绍基本的算法思想。包括枚举、递归、分治、回溯、贪心以及位运算。 +- **8. 动态规划**：介绍动态规划的基础知识、各种动态规划题型的解法。 +- **9. 附加内容**：作为全书的扩展模块。 +- **10. 题目解析**：讲解 LeetCode 上刷过的所有题目，可按照对应题号进行检索和学习。 -![电子书深色模式](./Assets/Images/algo-book-dark.png) +### 1.4 使用说明 -## 03. 关于作者 +- 本电子书的左侧为所有章节目录导航，可直接点击对应章节跳转阅读。 +- 本电子书左上角有搜索栏，可以帮你迅速找到想看的章节和题解文章。 +- 本电子书每页都接入了 giscus 评论系统，可在每页下方的评论框进行评论（需使用 GitHub 账号登录）。 +- 建议按照章节顺序学习，循序渐进地掌握各个知识点。 +- 每章末尾都配有练习题，建议及时完成以巩固所学知识。 -我是一名 iOS / macOS 的开发程序员，另外也是北航软院的一名非全硕士（在读）。曾在大学期间学习过算法知识，并参加过 3 年的 ACM 比赛， 但水平有限，未能取得理想成绩。但是这 3 年的 ACM 经历，给我最大的收获是锻炼了自己的逻辑思维和解决实际问题的能力，这种能力为我今后的工作、学习打下了坚实的基础。 +## 2. 相关说明 -我从 2021 年 03 月 30 日开始每日在 LeetCode 刷题，到 2022 年 06 月 08 日已经刷了 1000+ 道题目，并且完成了 800+ 道题解。努力向着 1000+、1500+、2000+ 道题解前进。 - -在公众号 **「程序员充电站」** 里回复 "**算法打卡**"，拉你进 LeetCode 算法打卡计划群一起组队打卡。 - -- 进群暗号：**算法打卡** -- 进群要求：少闲聊、多分享、改备注。 - -![](./Assets/Images/itcharge-qr-code.png) - -## 04. 版权说明 - -- 本教程采用 [知识署名—非商业性使用—禁止演绎（BY-NC-ND）4.0 协议国际许可协议](https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode.zh-Hans) 进行许可。 -- 本教程题解中的所有题目版权均归 [LeetCode](https://leetcode.com/) 和 [力扣中国](https://leetcode.cn/) 所有。 - -## 05. 章节目录 - -![章节目录](./Assets/Images/algo-book-contents.png) - -### 00. 绪论 - -- [算法与数据结构](./Contents/00.Introduction/01.Data-Structures-Algorithms.md) -- [算法复杂度](./Contents/00.Introduction/02.Algorithm-Complexity.md) -- [LeetCode 入门与攻略](./Contents/00.Introduction/03.LeetCode-Guide.md) -- [LeetCode 题解（字典序排序，850+ 道题解）](./Contents/00.Introduction/04.Solutions-List.md) -- [LeetCode 题解（按分类排序，推荐刷题列表 ★★★）](./Contents/00.Introduction/05.Categories-List.md) -- [LeetCode 面试最常考 100 题（按分类排序）](./Contents/00.Introduction/06.Interview-100-List.md) -- [LeetCode 面试最常考 200 题（按分类排序）](./Contents/00.Introduction/07.Interview-200-List.md) - -### 01. 数组 - -- 数组基础知识 - - [数组基础知识](./Contents/01.Array/01.Array-Basic/01.Array-Basic.md) - - [数组基础题目](./Contents/01.Array/01.Array-Basic/02.Array-Basic-List.md) -- 数组排序算法 - - [冒泡排序](./Contents/01.Array/02.Array-Sort/01.Array-Bubble-Sort.md) - - [选择排序](./Contents/01.Array/02.Array-Sort/02.Array-Selection-Sort.md) - - [插入排序](./Contents/01.Array/02.Array-Sort/03.Array-Insertion-Sort.md) - - [希尔排序](./Contents/01.Array/02.Array-Sort/04.Array-Shell-Sort.md) - - [归并排序](./Contents/01.Array/02.Array-Sort/05.Array-Merge-Sort.md) - - [快速排序](./Contents/01.Array/02.Array-Sort/06.Array-Quick-Sort.md) - - [堆排序](./Contents/01.Array/02.Array-Sort/07.Array-Heap-Sort.md) - - [计数排序](./Contents/01.Array/02.Array-Sort/08.Array-Counting-Sort.md) - - [桶排序](./Contents/01.Array/02.Array-Sort/09.Array-Bucket-Sort.md) - - [基数排序](./Contents/01.Array/02.Array-Sort/10.Array-Radix-Sort.md) - - [数组排序题目](./Contents/01.Array/02.Array-Sort/11.Array-Sort-List.md) -- 二分查找 - - [二分查找知识（一）](./Contents/01.Array/03.Array-Binary-Search/01.Array-Binary-Search-01.md) - - [二分查找知识（二）](./Contents/01.Array/03.Array-Binary-Search/02.Array-Binary-Search-02.md) - - [二分查找题目](./Contents/01.Array/03.Array-Binary-Search/03.Array-Binary-Search-List.md) -- 数组双指针 - - [数组双指针知识](./Contents/01.Array/04.Array-Two-Pointers/01.Array-Two-Pointers.md) - - [数组双指针题目](./Contents/01.Array/04.Array-Two-Pointers/02.Array-Two-Pointers-List.md) -- 数组滑动窗口 - - [数组滑动窗口知识](./Contents/01.Array/05.Array-Sliding-Window/01.Array-Sliding-Window.md) - - [数组滑动窗口题目](./Contents/01.Array/05.Array-Sliding-Window/02.Array-Sliding-Window-List.md) +### 2.1 关于作者 -### 02. 链表 +我是一名 iOS / macOS 的开发程序员，研究生毕业于北航软件学院。曾在大学期间学习过算法知识，并参加过 3 年的 ACM 比赛， 但水平有限，未能取得理想成绩。但是这 3 年的 ACM 经历，给我最大的收获是锻炼了自己的逻辑思维和解决实际问题的能力，这种能力为我今后的工作、学习打下了坚实的基础。 -- 链表基础知识 - - [链表基础知识](./Contents/02.Linked-List/01.Linked-List-Basic/01.Linked-List-Basic.md) - - [链表经典题目](./Contents/02.Linked-List/01.Linked-List-Basic/02.Linked-List-Basic-List.md) -- 链表排序 - - [链表排序知识](./Contents/02.Linked-List/02.Linked-List-Sort/01.Linked-List-Sort.md) - - [链表排序题目](./Contents/02.Linked-List/02.Linked-List-Sort/02.Linked-List-Sort-List.md) -- 链表双指针 - - [链表双指针知识](./Contents/02.Linked-List/03.Linked-List-Two-Pointers/01.Linked-List-Two-Pointers.md) - - [链表双指针题目](./Contents/02.Linked-List/03.Linked-List-Two-Pointers/02.Linked-List-Two-Pointers-List.md) - -### 03. 堆栈 - -- 堆栈基础知识 - - [堆栈基础知识](./Contents/03.Stack/01.Stack-Basic/01.Stack-Basic.md) - - [堆栈基础题目](./Contents/03.Stack/01.Stack-Basic/02.Stack-Basic-List.md) -- 单调栈 - - [单调栈知识](./Contents/03.Stack/02.Monotone-Stack/01.Monotone-Stack.md) - - [单调栈题目](./Contents/03.Stack/02.Monotone-Stack/02.Monotone-Stack-List.md) - -### 04. 队列 - -- 队列基础知识 - - [队列基础知识](./Contents/04.Queue/01.Queue-Basic/01.Queue-Basic.md) - - [队列基础题目](./Contents/04.Queue/01.Queue-Basic/02.Queue-Basic-List.md) -- 优先队列 - - [优先队列知识](./Contents/04.Queue/02.Priority-Queue/01.Priority-Queue.md) - - [优先队列题目](./Contents/04.Queue/02.Priority-Queue/02.Priority-Queue-List.md) - -### 05. 哈希表 - -- [哈希表知识](./Contents/05.Hash-Table/01.Hash-Table.md) -- [哈希表题目](./Contents/05.Hash-Table/02.Hash-Table-List.md) - -### 06. 字符串 - -- 字符串基础知识 - - [字符串基础知识](./Contents/06.String/01.String-Basic/01.String-Basic.md) - - [字符串经典题目](./Contents/06.String/01.String-Basic/02.String-Basic-List.md) -- 单模式串匹配 - - [Brute Force 算法](./Contents/06.String/02.String-Single-Pattern-Matching/01.String-Brute-Force.md) - - [Rabin Karp 算法](./Contents/06.String/02.String-Single-Pattern-Matching/02.String-Rabin-Karp.md) - - [KMP 算法](./Contents/06.String/02.String-Single-Pattern-Matching/03.String-KMP.md) - - [Boyer Moore 算法](./Contents/06.String/02.String-Single-Pattern-Matching/04.String-Boyer-Moore.md) - - [Horspool 算法](./Contents/06.String/02.String-Single-Pattern-Matching/05.String-Horspool.md) - - [Sunday 算法](./Contents/06.String/02.String-Single-Pattern-Matching/06.String-Sunday.md) - - [单模式串匹配题目](./Contents/06.String/02.String-Single-Pattern-Matching/07.String-Single-Pattern-Matching-List.md) -- 多模式串匹配 - - [字典树知识](./Contents/06.String/03.String-Multi-Pattern-Matching/01.Trie.md) - - [字典树题目](./Contents/06.String/03.String-Multi-Pattern-Matching/02.Trie-List.md) - - [AC 自动机知识](./Contents/06.String/03.String-Multi-Pattern-Matching/03.AC-Automaton.md) - - [AC 自动机题目](./Contents/06.String/03.String-Multi-Pattern-Matching/04.AC-Automaton-List.md) - - [后缀数组知识](./Contents/06.String/03.String-Multi-Pattern-Matching/05.Suffix-Array.md) - - [后缀数组题目](./Contents/06.String/03.String-Multi-Pattern-Matching/06.Suffix-Array-List.md) - -### 07. 树 - -- 二叉树 - - [树与二叉树基础知识](./Contents/07.Tree/01.Binary-Tree/01.Binary-Tree-Basic.md) - - [二叉树的遍历知识](./Contents/07.Tree/01.Binary-Tree/02.Binary-Tree-Traverse.md) - - [二叉树的遍历题目](./Contents/07.Tree/01.Binary-Tree/03.Binary-Tree-Traverse-List.md) - - [二叉树的还原知识](./Contents/07.Tree/01.Binary-Tree/04.Binary-Tree-Reduction.md) - - [二叉树的还原题目](./Contents/07.Tree/01.Binary-Tree/05.Binary-Tree-Reduction-List.md) -- 二叉搜索树 - - [二叉搜索树知识](./Contents/07.Tree/02.Binary-Search-Tree/01.Binary-Search-Tree.md) - - [二叉搜索树题目](./Contents/07.Tree/02.Binary-Search-Tree/02.Binary-Search-Tree-List.md) -- 线段树 - - [线段树知识](./Contents/07.Tree/03.Segment-Tree/01.Segment-Tree.md) - - [线段树题目](./Contents/07.Tree/03.Segment-Tree/02.Segment-Tree-List.md) -- 树状数组 - - [树状数组知识](./Contents/07.Tree/04.Binary-Indexed-Tree/01.Binary-Indexed-Tree.md) - - [树状数组题目](./Contents/07.Tree/04.Binary-Indexed-Tree/02.Binary-Indexed-Tree-List.md) -- 并查集 - - [并查集知识](./Contents/07.Tree/05.Union-Find/01.Union-Find.md) - - [并查集题目](./Contents/07.Tree/05.Union-Find/02.Union-Find-List.md) - -### 08. 图论 +我从 2021 年 03 月 30 日开始每日在 LeetCode 刷题，到 2022 年 06 月 08 日已经刷了 1000+ 道题目，并且完成了 800+ 道题解。努力向着 1000+、1500+、2000+ 道题解前进。 -- 图的基础知识 - - [图的定义和分类](./Contents/08.Graph/01.Graph-Basic/01.Graph-Basic.md) - - [图的存储结构和问题应用](./Contents/08.Graph/01.Graph-Basic/02.Graph-Structure.md) -- 图的遍历 - - [图的深度优先搜索知识](./Contents/08.Graph/02.Graph-Traversal/01.Graph-DFS.md) - - [图的深度优先搜索题目](./Contents/08.Graph/02.Graph-Traversal/02.Graph-DFS-List.md) - - [图的广度优先搜索知识](./Contents/08.Graph/02.Graph-Traversal/03.Graph-BFS.md) - - [图的广度优先搜索题目](./Contents/08.Graph/02.Graph-Traversal/04.Graph-BFS-List.md) - - [图的拓扑排序知识](./Contents/08.Graph/02.Graph-Traversal/05.Graph-Topological-Sorting.md) - - [图的拓扑排序题目](./Contents/08.Graph/02.Graph-Traversal/06.Graph-Topological-Sorting-List.md) -- 图的生成树 - - [图的最小生成树知识](./Contents/08.Graph/03.Graph-Spanning-Tree/01.Graph-Minimum-Spanning-Tree.md) - - [图的最小生成树题目](./Contents/08.Graph/03.Graph-Spanning-Tree/02.Graph-Minimum-Spanning-Tree-List.md) -- 最短路径 - - [单源最短路径知识（一）](./Contents/08.Graph/04.Graph-Shortest-Path/01.Graph-Single-Source-Shortest-Path-01.md) - - [单源最短路径知识（二）](./Contents/08.Graph/04.Graph-Shortest-Path/02.Graph-Single-Source-Shortest-Path-02.md) - - [单源最短路径题目](./Contents/08.Graph/04.Graph-Shortest-Path/03.Graph-Single-Source-Shortest-Path-List.md) - - [多源最短路径知识](./Contents/08.Graph/04.Graph-Shortest-Path/04.Graph-Multi-Source-Shortest-Path.md) - - [多源最短路径题目](./Contents/08.Graph/04.Graph-Shortest-Path/05.Graph-Multi-Source-Shortest-Path-List.md) - - [次短路径知识](./Contents/08.Graph/04.Graph-Shortest-Path/06.Graph-The-Second-Shortest-Path.md) - - [次短路径题目](./Contents/08.Graph/04.Graph-Shortest-Path/07.Graph-The-Second-Shortest-Path-List.md) - - [差分约束系统知识](./Contents/08.Graph/04.Graph-Shortest-Path/08.Graph-System-Of-Difference-Constraints.md) - - [差分约束系统题目](./Contents/08.Graph/04.Graph-Shortest-Path/09.Graph-System-Of-Difference-Constraints-List.md) -- 二分图 - - [二分图基础知识](./Contents/08.Graph/05.Graph-Bipartite/01.Graph-Bipartite-Basic.md) - - [二分图基础题目](./Contents/08.Graph/05.Graph-Bipartite/02.Graph-Bipartite-Basic-List.md) - - [二分图最大匹配知识](./Contents/08.Graph/05.Graph-Bipartite/03.Graph-Bipartite-Matching.md) - - [匈牙利算法](./Contents/08.Graph/05.Graph-Bipartite/04.Graph-Hungarian-Algorithm.md) - - [Hopcroft-Karp 算法](./Contents/08.Graph/05.Graph-Bipartite/05.Graph-Hopcroft-Karp.md) - - [二分图最大匹配题目](./Contents/08.Graph/05.Graph-Bipartite/06.Graph-Bipartite-Matching-List.md) +### 2.2 互助与勘误 -### 09. 基础算法 +限于本人的水平和经验，书中一定不乏纰漏和谬误之处。恳切希望读者给予批评指正。这将有利于我改进和提高，以帮助更多的读者。如果您对本书有任何评论和建议，或者遇到问题需要帮助，可在每页评论区留言，或者致信作者邮箱 [i@itcharge.cn](mailto:i@itcharge.cn)，我将不胜感激。 -- 枚举算法 - - [枚举算法知识](./Contents/09.Algorithm-Base/01.Enumeration-Algorithm/01.Enumeration-Algorithm.md) - - [枚举算法题目](./Contents/09.Algorithm-Base/01.Enumeration-Algorithm/02.Enumeration-Algorithm-List.md) -- 递归算法 - - [递归算法知识](./Contents/09.Algorithm-Base/02.Recursive-Algorithm/01.Recursive-Algorithm.md) - - [递归算法题目](./Contents/09.Algorithm-Base/02.Recursive-Algorithm/02.Recursive-Algorithm-List.md) -- 分治算法 - - [分治算法知识](./Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/01.Divide-And-Conquer-Algorithm.md) - - [分治算法题目](./Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/02.Divide-And-Conquer-Algorithm-List.md) -- 回溯算法 - - [回溯算法知识](./Contents/09.Algorithm-Base/04.Backtracking-Algorithm/01.Backtracking-Algorithm.md) - - [回溯算法题目](./Contents/09.Algorithm-Base/04.Backtracking-Algorithm/02.Backtracking-Algorithm-List.md) -- 贪心算法 - - [贪心算法知识](./Contents/09.Algorithm-Base/05.Greedy-Algorithm/01.Greedy-Algorithm.md) - - [贪心算法题目](./Contents/09.Algorithm-Base/05.Greedy-Algorithm/02.Greedy-Algorithm-List.md) -- 位运算 - - [位运算知识](./Contents/09.Algorithm-Base/06.Bit-Operation/01.Bit-Operation.md) - - [位运算题目](./Contents/09.Algorithm-Base/06.Bit-Operation/02.Bit-Operation-List.md) +### 2.3 版权说明 -### 10. 动态规划 +- 本书采用 [知识署名—非商业性使用—禁止演绎（BY-NC-ND）4.0 协议国际许可协议](https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode.zh-Hans) 进行许可。 +- 本书题解中的所有题目版权均归 [LeetCode](https://leetcode.com/) 和 [力扣中国](https://leetcode.cn/) 所有。 -- 动态规划基础 - - [动态规划基础知识](./Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/01.Dynamic-Programming-Basic.md) - - [动态规划基础题目](./Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/02.Dynamic-Programming-Basic-List.md) -- 记忆化搜索 - - [记忆化搜索知识](./Contents/10.Dynamic-Programming/02.Memoization/01.Memoization.md) - - [记忆化搜索题目](./Contents/10.Dynamic-Programming/02.Memoization/02.Memoization-List.md) -- 线性 DP - - [线性 DP 知识（一）](./Contents/10.Dynamic-Programming/03.Linear-DP/01.Linear-DP-01.md) - - [线性 DP 知识（二）](./Contents/10.Dynamic-Programming/03.Linear-DP/02.Linear-DP-02.md) - - [线性 DP 题目](./Contents/10.Dynamic-Programming/03.Linear-DP/03.Linear-DP-List.md) -- 背包问题 - - [背包问题知识（一）](./Contents/10.Dynamic-Programming/04.Knapsack-Problem/01.Knapsack-Problem-01.md) - - [背包问题知识（二）](./Contents/10.Dynamic-Programming/04.Knapsack-Problem/02.Knapsack-Problem-02.md) - - [背包问题知识（三）](./Contents/10.Dynamic-Programming/04.Knapsack-Problem/03.Knapsack-Problem-03.md) - - [背包问题知识（四）](./Contents/10.Dynamic-Programming/04.Knapsack-Problem/04.Knapsack-Problem-04.md) - - [背包问题知识（五）](./Contents/10.Dynamic-Programming/04.Knapsack-Problem/05.Knapsack-Problem-05.md) - - [背包问题题目](./Contents/10.Dynamic-Programming/04.Knapsack-Problem/06.Knapsack-Problem-List.md) -- 区间 DP - - [区间 DP 知识](./Contents/10.Dynamic-Programming/05.Interval-DP/01.Interval-DP.md) - - [区间 DP 题目](./Contents/10.Dynamic-Programming/05.Interval-DP/02.Interval-DP-List.md) -- 树形 DP - - [树形 DP 知识](./Contents/10.Dynamic-Programming/06.Tree-DP/01.Tree-DP.md) - - [树形 DP 题目](./Contents/10.Dynamic-Programming/06.Tree-DP/02.Tree-DP-List.md) -- 状态压缩 DP - - [状态压缩 DP 知识](./Contents/10.Dynamic-Programming/07.State-DP/01.State-DP.md) - - [状态压缩 DP 题目](./Contents/10.Dynamic-Programming/07.State-DP/02.State-DP-List.md) -- 计数 DP - - [计数 DP 知识](./Contents/10.Dynamic-Programming/08.Counting-DP/01.Counting-DP.md) - - [计数 DP 题目](./Contents/10.Dynamic-Programming/08.Counting-DP/02.Counting-DP-List.md) -- 数位 DP - - [数位 DP 知识](./Contents/10.Dynamic-Programming/09.Digit-DP/01.Digit-DP.md) - - [数位 DP 题目](./Contents/10.Dynamic-Programming/09.Digit-DP/02.Digit-DP-List.md) -- 概率 DP - - [概率 DP 知识](./Contents/10.Dynamic-Programming/10.Probability-DP/01.Probability-DP.md) - - [概率 DP 题目](./Contents/10.Dynamic-Programming/10.Probability-DP/02.Probability-DP-List.md) -- 动态规划优化 - - [单调栈 / 优先队列优化](./Contents/10.Dynamic-Programming/11.DP-Optimization/01.Monotone-Stack-Queue-Optimization.md) - - [斜率优化](./Contents/10.Dynamic-Programming/11.DP-Optimization/02.Slope-Optimization.md) - - [四边形不等式优化](./Contents/10.Dynamic-Programming/11.DP-Optimization/03.Quadrangle-Optimization.md) - - [动态规划优化题目](./Contents/10.Dynamic-Programming/11.DP-Optimization/04.DP-Optimization-List.md) +### 2.4 致谢 -### 11. 附加内容 +在本书构思与写作阶段，很多朋友给我提出了有益的意见和建议。这些意见和建议令我受益匪浅。感谢在本书著作准备过程中，帮助过我的朋友，以及一起陪我刷题打卡的朋友，还有提供宝贵意见的读者。谢谢诸位。 -- [内容完成时间线](./Contents/Others/Update-Time.md) -### [12. LeetCode 题解（已完成 860 道）](./Contents/00.Introduction/04.Solutions-List.md) \ No newline at end of file diff --git "a/Solutions/LeetCode \350\247\243\351\242\230\346\212\245\345\221\212\347\251\272\347\231\275 (\345\212\250\346\200\201\350\247\204\345\210\222).md" "b/Solutions/LeetCode \350\247\243\351\242\230\346\212\245\345\221\212\347\251\272\347\231\275 (\345\212\250\346\200\201\350\247\204\345\210\222).md" deleted file mode 100644 index 63c82cfe..00000000 --- "a/Solutions/LeetCode \350\247\243\351\242\230\346\212\245\345\221\212\347\251\272\347\231\275 (\345\212\250\346\200\201\350\247\204\345\210\222).md" +++ /dev/null @@ -1,65 +0,0 @@ -# 题目相关 - -- 标签： -- 难度： - -## 题目链接 - -- 题目相关 - -## 题目大意 - -**描述**： - -**要求**： - -**说明**： - -- - -**示例**： - -- 示例 1： - -```python -``` - -- 示例 2： - -```python -``` - -## 解题思路 - -### 思路 1：动态规划 - -###### 1. 划分阶段 - -按照 进行阶段划分。 - -###### 2. 定义状态 - -定义状态 $dp[i]$ 表示为：。 - -###### 3. 状态转移方程 - - - -###### 4. 初始条件 - - - -###### 5. 最终结果 - -根据我们之前定义的状态，$dp[i]$ 表示为：。 所以最终结果为 $dp[size]$。 - -### 思路 1：代码 - -```python - -``` - -### 思路 1：复杂度分析 - -- **时间复杂度**： -- **空间复杂度**： diff --git "a/Solutions/LeetCode \350\247\243\351\242\230\346\212\245\345\221\212\347\251\272\347\231\275.md" "b/Solutions/LeetCode \350\247\243\351\242\230\346\212\245\345\221\212\347\251\272\347\231\275.md" deleted file mode 100644 index e3bc0608..00000000 --- "a/Solutions/LeetCode \350\247\243\351\242\230\346\212\245\345\221\212\347\251\272\347\231\275.md" +++ /dev/null @@ -1,62 +0,0 @@ -# 题目相关 - -- 标签： -- 难度： - -## 题目链接 - -- 题目相关 - -## 题目大意 - -**描述**： - -**要求**： - -**说明**： - -- - -**示例**： - -- 示例 1： - -```python -``` - -- 示例 2： - -```python -``` - -## 解题思路 - -### 思路 1： - - - -### 思路 1：代码 - -```python - -``` - -### 思路 1：复杂度分析 - -- **时间复杂度**： -- **空间复杂度**： - -### 思路 2： - - - -### 思路 2：代码 - -```python - -``` - -### 思路 2：复杂度分析 - -- **时间复杂度**： -- **空间复杂度**： \ No newline at end of file diff --git a/Templates/01.Array/Array-MaxHeap.py b/codes/python/01_array/array_maxheap.py similarity index 100% rename from Templates/01.Array/Array-MaxHeap.py rename to codes/python/01_array/array_maxheap.py diff --git a/Templates/01.Array/Array-BubbleSort.py b/codes/python/01_array/array_sort_bubble_sort.py similarity index 100% rename from Templates/01.Array/Array-BubbleSort.py rename to codes/python/01_array/array_sort_bubble_sort.py diff --git a/Templates/01.Array/Array-BucketSort.py b/codes/python/01_array/array_sort_bucket_sort.py similarity index 100% rename from Templates/01.Array/Array-BucketSort.py rename to codes/python/01_array/array_sort_bucket_sort.py diff --git a/Templates/01.Array/Array-CountingSort.py b/codes/python/01_array/array_sort_counting_sort.py similarity index 100% rename from Templates/01.Array/Array-CountingSort.py rename to codes/python/01_array/array_sort_counting_sort.py diff --git a/Templates/01.Array/Array-InsertionSort.py b/codes/python/01_array/array_sort_insertion_sort.py similarity index 100% rename from Templates/01.Array/Array-InsertionSort.py rename to codes/python/01_array/array_sort_insertion_sort.py diff --git a/Templates/01.Array/Array-MaxHeapSort.py b/codes/python/01_array/array_sort_maxheap_sort.py similarity index 100% rename from Templates/01.Array/Array-MaxHeapSort.py rename to codes/python/01_array/array_sort_maxheap_sort.py diff --git a/Templates/01.Array/Array-MergeSort.py b/codes/python/01_array/array_sort_merge_sort.py similarity index 100% rename from Templates/01.Array/Array-MergeSort.py rename to codes/python/01_array/array_sort_merge_sort.py diff --git a/Templates/01.Array/Array-MinHeapSort.py b/codes/python/01_array/array_sort_minheap_sort.py similarity index 100% rename from Templates/01.Array/Array-MinHeapSort.py rename to codes/python/01_array/array_sort_minheap_sort.py diff --git a/Templates/01.Array/Array-QuickSort.py b/codes/python/01_array/array_sort_quick_sort.py similarity index 100% rename from Templates/01.Array/Array-QuickSort.py rename to codes/python/01_array/array_sort_quick_sort.py diff --git a/Templates/01.Array/Array-RadixSort.py b/codes/python/01_array/array_sort_radix_sort.py similarity index 100% rename from Templates/01.Array/Array-RadixSort.py rename to codes/python/01_array/array_sort_radix_sort.py diff --git a/Templates/01.Array/Array-SelectionSort.py b/codes/python/01_array/array_sort_selection_sort.py similarity index 100% rename from Templates/01.Array/Array-SelectionSort.py rename to codes/python/01_array/array_sort_selection_sort.py diff --git a/Templates/01.Array/Array-ShellSort.py b/codes/python/01_array/array_sort_shell_sort.py similarity index 100% rename from Templates/01.Array/Array-ShellSort.py rename to codes/python/01_array/array_sort_shell_sort.py diff --git a/Templates/02.LinkedList/LinkedList.py b/codes/python/02_linked_list/linked_list.py similarity index 100% rename from Templates/02.LinkedList/LinkedList.py rename to codes/python/02_linked_list/linked_list.py diff --git a/Templates/02.LinkedList/LinkedList-BubbleSort.py b/codes/python/02_linked_list/linked_list_bubble_sort.py similarity index 100% rename from Templates/02.LinkedList/LinkedList-BubbleSort.py rename to codes/python/02_linked_list/linked_list_bubble_sort.py diff --git a/Templates/02.LinkedList/LinkedList-BucketSort.py b/codes/python/02_linked_list/linked_list_bucket_sort.py similarity index 100% rename from Templates/02.LinkedList/LinkedList-BucketSort.py rename to codes/python/02_linked_list/linked_list_bucket_sort.py diff --git a/Templates/02.LinkedList/LinkedList-CountingSort.py b/codes/python/02_linked_list/linked_list_counting_sort.py similarity index 100% rename from Templates/02.LinkedList/LinkedList-CountingSort.py rename to codes/python/02_linked_list/linked_list_counting_sort.py diff --git a/Templates/02.LinkedList/LinkedList-InsertionSort.py b/codes/python/02_linked_list/linked_list_insertion_sort.py similarity index 100% rename from Templates/02.LinkedList/LinkedList-InsertionSort.py rename to codes/python/02_linked_list/linked_list_insertion_sort.py diff --git a/Templates/02.LinkedList/LinkedList-MergeSort.py b/codes/python/02_linked_list/linked_list_merge_sort.py similarity index 100% rename from Templates/02.LinkedList/LinkedList-MergeSort.py rename to codes/python/02_linked_list/linked_list_merge_sort.py diff --git a/Templates/02.LinkedList/LinkedList-QuickSort.py b/codes/python/02_linked_list/linked_list_quick_sort.py similarity index 100% rename from Templates/02.LinkedList/LinkedList-QuickSort.py rename to codes/python/02_linked_list/linked_list_quick_sort.py diff --git a/Templates/02.LinkedList/LinkedList-RadixSort.py b/codes/python/02_linked_list/linked_list_radix_sort.py similarity index 100% rename from Templates/02.LinkedList/LinkedList-RadixSort.py rename to codes/python/02_linked_list/linked_list_radix_sort.py diff --git a/Templates/02.LinkedList/LinkedList-SectionSort.py b/codes/python/02_linked_list/linked_list_section_sort.py similarity index 100% rename from Templates/02.LinkedList/LinkedList-SectionSort.py rename to codes/python/02_linked_list/linked_list_section_sort.py diff --git a/Templates/04.Queue/Queue-CircularSequentialQueue.py b/codes/python/03_stack_queue_hash_table/queue_circularSequential_queue.py similarity index 100% rename from Templates/04.Queue/Queue-CircularSequentialQueue.py rename to codes/python/03_stack_queue_hash_table/queue_circularSequential_queue.py diff --git a/Templates/04.Queue/Queue-LinkQueue.py b/codes/python/03_stack_queue_hash_table/queue_link_queue.py similarity index 100% rename from Templates/04.Queue/Queue-LinkQueue.py rename to codes/python/03_stack_queue_hash_table/queue_link_queue.py diff --git a/Templates/04.Queue/Queue-PriorityQueue.py b/codes/python/03_stack_queue_hash_table/queue_priority_queue.py similarity index 100% rename from Templates/04.Queue/Queue-PriorityQueue.py rename to codes/python/03_stack_queue_hash_table/queue_priority_queue.py diff --git a/Templates/04.Queue/Queue-SequentialQueue.py b/codes/python/03_stack_queue_hash_table/queue_sequential_queue.py similarity index 100% rename from Templates/04.Queue/Queue-SequentialQueue.py rename to codes/python/03_stack_queue_hash_table/queue_sequential_queue.py diff --git a/Templates/03.Stack/Stack-LinkStack.py b/codes/python/03_stack_queue_hash_table/stack_link_stack.py similarity index 100% rename from Templates/03.Stack/Stack-LinkStack.py rename to codes/python/03_stack_queue_hash_table/stack_link_stack.py diff --git a/Templates/03.Stack/Stack-MonotoneStack.py b/codes/python/03_stack_queue_hash_table/stack_monotone_stack.py similarity index 100% rename from Templates/03.Stack/Stack-MonotoneStack.py rename to codes/python/03_stack_queue_hash_table/stack_monotone_stack.py diff --git a/Templates/03.Stack/Stack-SequentialStack.py b/codes/python/03_stack_queue_hash_table/stack_sequential_stack.py similarity index 100% rename from Templates/03.Stack/Stack-SequentialStack.py rename to codes/python/03_stack_queue_hash_table/stack_sequential_stack.py diff --git a/Templates/06.String/String-Strcmp.py b/codes/python/04_string/string_Strcmp.py similarity index 100% rename from Templates/06.String/String-Strcmp.py rename to codes/python/04_string/string_Strcmp.py diff --git a/Templates/06.String/String-BM.py b/codes/python/04_string/string_boyer_moore.py similarity index 100% rename from Templates/06.String/String-BM.py rename to codes/python/04_string/string_boyer_moore.py diff --git a/Templates/06.String/String-BF.py b/codes/python/04_string/string_brute_force.py similarity index 100% rename from Templates/06.String/String-BF.py rename to codes/python/04_string/string_brute_force.py diff --git a/Templates/06.String/String-Horspool.py b/codes/python/04_string/string_horspool.py similarity index 100% rename from Templates/06.String/String-Horspool.py rename to codes/python/04_string/string_horspool.py diff --git a/Templates/06.String/String-KMP.py b/codes/python/04_string/string_kmp.py similarity index 100% rename from Templates/06.String/String-KMP.py rename to codes/python/04_string/string_kmp.py diff --git a/Templates/06.String/String-RK.py b/codes/python/04_string/string_rabin_karp.py similarity index 100% rename from Templates/06.String/String-RK.py rename to codes/python/04_string/string_rabin_karp.py diff --git a/Templates/06.String/String-Sunday.py b/codes/python/04_string/string_sunday.py similarity index 100% rename from Templates/06.String/String-Sunday.py rename to codes/python/04_string/string_sunday.py diff --git a/Templates/06.String/String-Trie.py b/codes/python/04_string/string_trie.py similarity index 100% rename from Templates/06.String/String-Trie.py rename to codes/python/04_string/string_trie.py diff --git a/Templates/07.Tree/Tree-BinaryIndexedTree.py b/codes/python/05_tree/tree_binaryindexed_tree.py similarity index 100% rename from Templates/07.Tree/Tree-BinaryIndexedTree.py rename to codes/python/05_tree/tree_binaryindexed_tree.py diff --git a/Templates/07.Tree/Tree-DynamicSegmentTree-Update-Interval-1.py b/codes/python/05_tree/tree_dynamicSegmentTree_update_interval_1.py similarity index 100% rename from Templates/07.Tree/Tree-DynamicSegmentTree-Update-Interval-1.py rename to codes/python/05_tree/tree_dynamicSegmentTree_update_interval_1.py diff --git a/Templates/07.Tree/Tree-DynamicSegmentTree-Update-Interval-2.py b/codes/python/05_tree/tree_dynamicSegmentTree_update_interval_2.py similarity index 100% rename from Templates/07.Tree/Tree-DynamicSegmentTree-Update-Interval-2.py rename to codes/python/05_tree/tree_dynamicSegmentTree_update_interval_2.py diff --git a/Templates/07.Tree/Tree-SegmentTree-Update-Interval-1.py b/codes/python/05_tree/tree_segmentTree_update_interval_1.py similarity index 100% rename from Templates/07.Tree/Tree-SegmentTree-Update-Interval-1.py rename to codes/python/05_tree/tree_segmentTree_update_interval_1.py diff --git a/Templates/07.Tree/Tree-SegmentTree-Update-Interval-2.py b/codes/python/05_tree/tree_segmentTree_update_interval_2.py similarity index 100% rename from Templates/07.Tree/Tree-SegmentTree-Update-Interval-2.py rename to codes/python/05_tree/tree_segmentTree_update_interval_2.py diff --git a/Templates/07.Tree/Tree-SegmentTree-Update-Point.py b/codes/python/05_tree/tree_segmentTree_update_point.py similarity index 100% rename from Templates/07.Tree/Tree-SegmentTree-Update-Point.py rename to codes/python/05_tree/tree_segmentTree_update_point.py diff --git a/Templates/07.Tree/Tree-UnionFind.py b/codes/python/05_tree/tree_unionFind.py similarity index 100% rename from Templates/07.Tree/Tree-UnionFind.py rename to codes/python/05_tree/tree_unionFind.py diff --git a/Templates/07.Tree/Tree-UnionFind-QuickFind.py b/codes/python/05_tree/tree_unionFind_QuickFind.py similarity index 100% rename from Templates/07.Tree/Tree-UnionFind-QuickFind.py rename to codes/python/05_tree/tree_unionFind_QuickFind.py diff --git a/Templates/07.Tree/Tree-UnionFind-QuickUnion.py b/codes/python/05_tree/tree_unionFind_QuickUnion.py similarity index 100% rename from Templates/07.Tree/Tree-UnionFind-QuickUnion.py rename to codes/python/05_tree/tree_unionFind_QuickUnion.py diff --git a/Templates/07.Tree/Tree-UnionFind-UnoinByRank.py b/codes/python/05_tree/tree_unionFind_UnoinByRank.py similarity index 100% rename from Templates/07.Tree/Tree-UnionFind-UnoinByRank.py rename to codes/python/05_tree/tree_unionFind_UnoinByRank.py diff --git a/Templates/07.Tree/Tree-UnionFind-UnoinBySize.py b/codes/python/05_tree/tree_unionFind_UnoinBySize.py similarity index 100% rename from Templates/07.Tree/Tree-UnionFind-UnoinBySize.py rename to codes/python/05_tree/tree_unionFind_UnoinBySize.py diff --git a/Templates/08.Graph/Graph-Adjacency-List.py b/codes/python/06_graph/Graph-Adjacency-List.py similarity index 100% rename from Templates/08.Graph/Graph-Adjacency-List.py rename to codes/python/06_graph/Graph-Adjacency-List.py diff --git a/Templates/08.Graph/Graph-Adjacency-Matrix.py b/codes/python/06_graph/Graph-Adjacency-Matrix.py similarity index 100% rename from Templates/08.Graph/Graph-Adjacency-Matrix.py rename to codes/python/06_graph/Graph-Adjacency-Matrix.py diff --git a/Templates/08.Graph/Graph-BFS.py b/codes/python/06_graph/Graph-BFS.py similarity index 100% rename from Templates/08.Graph/Graph-BFS.py rename to codes/python/06_graph/Graph-BFS.py diff --git a/Templates/08.Graph/Graph-Bellman-Ford.py b/codes/python/06_graph/Graph-Bellman-Ford.py similarity index 100% rename from Templates/08.Graph/Graph-Bellman-Ford.py rename to codes/python/06_graph/Graph-Bellman-Ford.py diff --git a/Templates/08.Graph/Graph-DFS.py b/codes/python/06_graph/Graph-DFS.py similarity index 100% rename from Templates/08.Graph/Graph-DFS.py rename to codes/python/06_graph/Graph-DFS.py diff --git a/Templates/08.Graph/Graph-Edgeset-Array.py b/codes/python/06_graph/Graph-Edgeset-Array.py similarity index 100% rename from Templates/08.Graph/Graph-Edgeset-Array.py rename to codes/python/06_graph/Graph-Edgeset-Array.py diff --git a/Templates/08.Graph/Graph-Hash-Table.py b/codes/python/06_graph/Graph-Hash-Table.py similarity index 100% rename from Templates/08.Graph/Graph-Hash-Table.py rename to codes/python/06_graph/Graph-Hash-Table.py diff --git a/Templates/08.Graph/Graph-Kruskal.py b/codes/python/06_graph/Graph-Kruskal.py similarity index 100% rename from Templates/08.Graph/Graph-Kruskal.py rename to codes/python/06_graph/Graph-Kruskal.py diff --git a/Templates/08.Graph/Graph-Linked-Forward-Star.py b/codes/python/06_graph/Graph-Linked-Forward-Star.py similarity index 100% rename from Templates/08.Graph/Graph-Linked-Forward-Star.py rename to codes/python/06_graph/Graph-Linked-Forward-Star.py diff --git a/Templates/08.Graph/Graph-Prim.py b/codes/python/06_graph/Graph-Prim.py similarity index 100% rename from Templates/08.Graph/Graph-Prim.py rename to codes/python/06_graph/Graph-Prim.py diff --git a/Templates/08.Graph/Graph-Topological-Sorting-DFS.py b/codes/python/06_graph/Graph-Topological-Sorting-DFS.py similarity index 100% rename from Templates/08.Graph/Graph-Topological-Sorting-DFS.py rename to codes/python/06_graph/Graph-Topological-Sorting-DFS.py diff --git a/Templates/08.Graph/Graph-Topological-Sorting-Kahn.py b/codes/python/06_graph/Graph-Topological-Sorting-Kahn.py similarity index 100% rename from Templates/08.Graph/Graph-Topological-Sorting-Kahn.py rename to codes/python/06_graph/Graph-Topological-Sorting-Kahn.py diff --git a/Templates/10.Dynamic-Programming/Digit-DP.py b/codes/python/08_dynamic_programming/Digit-DP.py similarity index 100% rename from Templates/10.Dynamic-Programming/Digit-DP.py rename to codes/python/08_dynamic_programming/Digit-DP.py diff --git a/Templates/10.Dynamic-Programming/Pack-2DCostPack.py b/codes/python/08_dynamic_programming/Pack-2DCostPack.py similarity index 100% rename from Templates/10.Dynamic-Programming/Pack-2DCostPack.py rename to codes/python/08_dynamic_programming/Pack-2DCostPack.py diff --git a/Templates/10.Dynamic-Programming/Pack-CompletePack.py b/codes/python/08_dynamic_programming/Pack-CompletePack.py similarity index 100% rename from Templates/10.Dynamic-Programming/Pack-CompletePack.py rename to codes/python/08_dynamic_programming/Pack-CompletePack.py diff --git a/Templates/10.Dynamic-Programming/Pack-GroupPack.py b/codes/python/08_dynamic_programming/Pack-GroupPack.py similarity index 100% rename from Templates/10.Dynamic-Programming/Pack-GroupPack.py rename to codes/python/08_dynamic_programming/Pack-GroupPack.py diff --git a/Templates/10.Dynamic-Programming/Pack-MixedPack.py b/codes/python/08_dynamic_programming/Pack-MixedPack.py similarity index 100% rename from Templates/10.Dynamic-Programming/Pack-MixedPack.py rename to codes/python/08_dynamic_programming/Pack-MixedPack.py diff --git a/Templates/10.Dynamic-Programming/Pack-MultiplePack.py b/codes/python/08_dynamic_programming/Pack-MultiplePack.py similarity index 100% rename from Templates/10.Dynamic-Programming/Pack-MultiplePack.py rename to codes/python/08_dynamic_programming/Pack-MultiplePack.py diff --git a/Templates/10.Dynamic-Programming/Pack-ProblemVariants.py b/codes/python/08_dynamic_programming/Pack-ProblemVariants.py similarity index 100% rename from Templates/10.Dynamic-Programming/Pack-ProblemVariants.py rename to codes/python/08_dynamic_programming/Pack-ProblemVariants.py diff --git a/Templates/10.Dynamic-Programming/Pack-ZeroOnePack.py b/codes/python/08_dynamic_programming/Pack-ZeroOnePack.py similarity index 100% rename from Templates/10.Dynamic-Programming/Pack-ZeroOnePack.py rename to codes/python/08_dynamic_programming/Pack-ZeroOnePack.py diff --git a/docs/00_preface/00_01_preface.md b/docs/00_preface/00_01_preface.md new file mode 100644 index 00000000..274b3ade --- /dev/null +++ b/docs/00_preface/00_01_preface.md @@ -0,0 +1,52 @@ +## 1. 创作历程 + +### 1.1 创作起因 + +我想写一本通俗易懂的算法书已经很久了，久到大概有 7 年那么久。至今我还记得大学时曾立下的 flag：**我要把我所学到的算法知识总结起来，整理成册，编纂成书，然后大大方方的在封面上写上自己的名字，再将它分享给所有喜欢学习算法的朋友们看。** + +结果是万万没想到，一晃过去，毕业后参加工作都已经 6 年了，每天忙于开发需求、业务逻辑、项目文档，写算法书这件事也跟其他大多数的待办事项一样，被无限制的闲置在一旁，再也不管不顾了。 + +直到 2021 年 3 月底的时候，在朋友的怂恿下，我们建了一个算法群，制定了一个为期 3 个月的算法打卡计划（2021 年 4 月 ~ 6 月），这个计划的唯一规则就是：连续两天不刷题就会被踢出群。 + +就这样我们一群小伙伴们（39 个人）开启了为期 3 个月的刷题计划。3 个月过后，最终只有 13 个人成功完成了刷题计划，另外三分之二的人都因为打卡失败被踢出群了。**这些失败的人中也包括我自己，我是在计划即将结束的时候，一次周末忘记了打卡，惨遭淘汰。** + +虽然这次我的刷题计划失败了，但是经过这 3 个月的刷题练习，让我重新拾起了学习算法的乐趣，并且把刷题变成了自己的日常习惯。在工作之余，我总是习惯性地打开 LeetCode，刷上几道题，然后写下题解，这种感觉很充实也很有成就感。 + +在这次刷题计划结束之后，2021 年 7 月份的时候，我们重新建立了算法打卡群，并持续到了今天。 + +就这样，刷题打卡成了我们的日常，群里的小伙伴也越来越多。我们每天刷题，写题解，在群里讨论每日题目的思路，提出问题和回答问题、探讨更好的求解思路。再后来群里的一些小伙伴们开始参加周赛、双周赛，在比赛结束之后我们还会交流赛题思路、做题心得。 + +### 1.2 输出是最好的学习方法 + +在写刷算法题、写题解的过程中，我又开始写算法和数据结构的基础知识，于是就有了现在这个开源项目。后来我学会了用 hugo 搭建网站，就搭建了一个开源项目的电子书网站，方便大家在线阅读。 + +在写算法书的这个过程中，我发现一个秘籍：**只有「输出」才是最好的学习方法**。这也是「费曼学习法」的一个应用。 + +在写算法内容的时候，如果对一个概念不理解，或者有点模糊，我是不可能把它写清楚，并且也让别人看明白的。只有在参考了大量的算法书籍和大佬的博客，把其中的概念或算法理解透彻了，彻底弄明白了之后，才能够转换为通俗易懂的文字，让大家也看明白。 + +并且在刷题的过程中，也会有很多朋友和群里小伙伴，跟我一起进行算法知识探讨，帮我指正错误或者提出建议。这些指正和建议，在很大程度上帮助我改进文章内容和提高自己对算法的理解。就好像是学生在写作业，有专业的老师在帮我批改作业，帮助我进步一样。 + +就这样，经过一段时间的努力，我从 2021 年 7 月开始，到 2022 年 7 月底，历时整整 1 年，在 LeetCode 上刷了 1000 多题，并且在刷题的过程总结了一些算法知识和数据结构知识，终于写完了这本算法书，也就是 **「算法通关手册」**。 + +## 2. 为什么要学习算法和数据结构 + +### 2.1 算法是程序员的底层能力 + +**「算法和数据结构」** 是计算机程序设计的重要理论技术基础，但很多程序员忽略了它的重要性。在日常开发工作中，最多的情况是使用成熟的开发框架，利用已经封装好的接口，进行 CRUD（增删改查）操作，似乎很少会需要自己实现相应的数据结构和算法。 + +况且工作中用到的编程语言、开发框架、开发平台，更新速度堪比摩尔定律。以前端为例，React 还没学明白呢，Vue 就火起来了。Vue 2.0 的文档还在研究呢，Vue 3.0 就发布了。很多时候，连新的技术还学不过来呢，哪还有时间去专门研究算法和数据结构呢。 + +诚然，语言、技术、框架固然重要，但背后的计算机算法和理论更为重要。因为语言、技术、框架的更新日新月异，但万变不离其宗的是背后的算法和理论，例如：**数据结构**、**算法**、**编译原理**、**计算机网络**、**计算机体系结构** 等等。任凭新技术如何变化，只要掌握了这些计算机科学的核心理论，就可以见招拆招，让自己立于不败之地。从此无论是看懂底层系统的设计原理、框架背后的设计思想，还是学习新技术、提升工作实战的效率，都可以做到得心应手。 + +**学习数据结构与算法的关键，在于掌握其中的思想和精髓，学会解决实际问题的方法。** + +### 2.2 算法是技术面试的必考内容 + +在互联网行业相关的技术面试中，**算法和数据结构知识** 几乎是所有公司的必考内容。众多知名互联网公司喜欢在面试中考察 LeetCode 上的算法题目，通常需要面试者对给定问题进行深入分析并提供解题思路。有时候，面试官还会要求面试者评估相关算法的时间复杂度和空间复杂度。面试官通过检验面试者对常用算法的熟悉程度和实现能力的方式，从而评估面试者解决实际问题的思维能力水平。 + +LeetCode 等平台上的算法题目已经成为行业标准。很多公司直接从这些平台选取题目或进行改编。通过系统性地练习这些题目，可以提高解决实际问题的能力。在面试中遇到类似问题时，就能更从容地应对。 + +学习算法需要循序渐进。从基础的数据结构开始，逐步掌握常见算法思想。每学习一个新概念，都要通过实际题目来巩固理解。这样积累下来，就能建立起完整的算法知识体系。 + +这本「算法通关手册」就是为了帮助读者系统学习算法知识而编写的。书中包含基础理论讲解和大量实战题目分析。通过理论学习和实践练习相结合的方式，读者可以真正掌握算法知识，提高解决问题的能力。无论是准备面试还是提升编程能力，这本书都能提供有价值的帮助。 + diff --git a/Contents/00.Introduction/01.Data-Structures-Algorithms.md b/docs/00_preface/00_02_data_structures_algorithms.md similarity index 97% rename from Contents/00.Introduction/01.Data-Structures-Algorithms.md rename to docs/00_preface/00_02_data_structures_algorithms.md index 82da3984..3805867f 100644 --- a/Contents/00.Introduction/01.Data-Structures-Algorithms.md +++ b/docs/00_preface/00_02_data_structures_algorithms.md @@ -28,7 +28,7 @@ 数据结构的作用，就是为了提高计算机硬件的利用率。比如说：操作系统想要查找应用程序 「Microsoft Word」 在硬盘中的哪一个位置存储。如果对硬盘全部扫描一遍的话肯定效率很低，但如果使用「B+ 树」作为索引，就能很容易的搜索到 `Microsoft Word` 这个单词，然后很快的定位到 「Microsoft Word」这个应用程序的文件信息，从而从文件信息中找到对应的磁盘位置。 -而学习数据结构，就是为了帮助我们了解和掌握计算机中的数据是以何种方式进行组织、存储的。 +学习数据结构，就是为了帮助我们了解和掌握计算机中的数据是以何种方式进行组织、存储的。 --- @@ -163,7 +163,7 @@ 1. **所需运行时间更少（时间复杂度更低）**； 2. **占用内存空间更小（空间复杂度更低）**。 -假设计算机执行一条命令的时间为 $1$ 纳秒（并不科学），第一种算法需要执行 $100$ 纳秒，第二种算法则需要执行 $3$ 纳秒。如果不考虑占用内存空间的话，很明显第二种算法比第一种算法要好很多。 +假设计算机执行一条命令的时间为 $1$ 纳秒（假定值），第一种算法需要执行 $100$ 纳秒，第二种算法则需要执行 $3$ 纳秒。如果不考虑占用内存空间的话，很明显第二种算法比第一种算法要好很多。 假设计算机一个内存单元的大小为一个字节，第一种算法需要占用 $3$ 个字节大小的内存空间，第二种算法则需要占用 $100$ 个字节大小的内存空间，如果不考虑运行时间的话，很明显第一种算法比第二种算法要好很多。 @@ -180,7 +180,7 @@ ## 3. 总结 -### 3.1 数据结构总结 +### 3.1 数据结构 数据结构可以分为 **「逻辑结构」** 和 **「物理结构」**。 @@ -192,7 +192,7 @@ 例如：线性表中的「栈」，其数据元素之间的关系是一对一的，除头和尾结点之外的每个结点都有唯一的前驱和唯一的后继，这体现的是逻辑结构。而对于栈中的结点来说，可以使用顺序存储（也就是 **顺序栈**）的方式存储在计算机中，其结构在计算机中的表现形式就是一段连续的存储空间，栈中每个结点和它的前驱结点、后继结点在物理上都是相邻的。当然，栈中的结点也可以使用链式存储（也即是 **链式栈**），每个结点和它的前驱结点、后继结点在物理上不一定相邻，每个结点是靠前驱结点的指针域来进行访问的。 -### 3.2 算法总结 +### 3.2 算法 **「算法」** 指的就是解决问题的方法。算法是一系列的运算步骤，这些运算步骤可以解决特定的问题。 diff --git a/Contents/00.Introduction/02.Algorithm-Complexity.md b/docs/00_preface/00_03_algorithm_complexity.md similarity index 93% rename from Contents/00.Introduction/02.Algorithm-Complexity.md rename to docs/00_preface/00_03_algorithm_complexity.md index 8d001d38..2e1e4e94 100644 --- a/Contents/00.Introduction/02.Algorithm-Complexity.md +++ b/docs/00_preface/00_03_algorithm_complexity.md @@ -43,15 +43,24 @@ ```python def algorithm(n): - fact = 1 - for i in range(1, n + 1): - fact *= i - return fact + fact = 1 # 执行 1 次 + for i in range(1, n + 1): # 执行 n 次 + fact *= i # 执行 n 次 + return fact # 执行 1 次 ``` -把上述算法中所有语句的执行次数加起来 $1 + n + n + 1 = 2 \times n + 2$，可以用一个函数 $f(n)$ 来表达语句的执行次数：$f(n) = 2 \times n + 2$。 +在这个例子中： -则时间复杂度的函数可以表示为：$T(n) = O(f(n))$。它表示的是随着问题规模 n 的增大，算法执行时间的增长趋势跟 $f(n)$ 相同。$O$ 是一种渐进符号，$T(n)$ 称作算法的 **渐进时间复杂度（Asymptotic Time Complexity）**，简称为 **时间复杂度**。 +1. `fact = 1` 执行了 1 次。 +2. `for i in range(1, n + 1)` 执行了 n 次。 +3. `fact *= i` 执行了 n 次。 +4. `return fact` 执行了 1 次。 + +总执行次数为：$1 + n + n + 1 = 2 \times n + 2$，可以用一个函数 $f(n)$ 来表达语句的执行次数：$f(n) = 2 \times n + 2$。忽略掉 $f(n)$ 中的常数系数、低阶项、常数项，因此时间复杂度为 $O(n)$。 + +这个例子展示了如何从具体的执行次数推导出算法的时间复杂度。虽然实际执行次数是 $2 \times n + 2$，但在复杂度分析中，我们只关注增长最快的项，因此最终的时间复杂度是 $O(n)$。 + +时间复杂度的函数可以表示为：$T(n) = O(f(n))$。它表示的是随着问题规模 $n$ 的增大，算法执行时间的增长趋势跟 $f(n)$ 相同。$O$ 是一种渐进符号，与 $f(n)$ 成正比例关系，$T(n)$ 称作算法的 **渐进时间复杂度（Asymptotic Time Complexity）**，简称为 **时间复杂度**。 所谓「算法执行时间的增长趋势」是一个模糊的概念，通常我们要借助像上边公式中 $O$ 这样的「渐进符号」来表示时间复杂度。 @@ -283,7 +292,7 @@ def algorithm(n): 根据从小到大排序，常见的算法复杂度主要有：$O(1)$ < $O(\log n)$ < $O(n)$ < $O(n^2)$ < $O(2^n)$ 等。 -## 算法复杂度总结 +## 4. 总结 **「算法复杂度」** 包括 **「时间复杂度」** 和 **「空间复杂度」**，用来分析算法执行效率与输入问题规模 $n$ 的增长关系。通常采用 **「渐进符号」** 的形式来表示「算法复杂度」。 diff --git a/Contents/00.Introduction/03.LeetCode-Guide.md b/docs/00_preface/00_04_leetcode_guide.md similarity index 80% rename from Contents/00.Introduction/03.LeetCode-Guide.md rename to docs/00_preface/00_04_leetcode_guide.md index 01361a11..18407a0a 100644 --- a/Contents/00.Introduction/03.LeetCode-Guide.md +++ b/docs/00_preface/00_04_leetcode_guide.md @@ -64,7 +64,7 @@ LeetCode 提供了题目的搜索过滤功能。可以筛选相关题单、不 ![LeetCode 题目详情](https://qcdn.itcharge.cn/images/20210901155529.png) -可以看到左侧区域为题目内容描述区域，在这里可以看到题目的内容描述和一些示例数据。而右侧是代码编辑区域，代码编辑区域里边默认显示了待实现的方法。 +可以看到左侧区域为题目内容描述区域，还可以看到题目的内容描述和一些示例数据。而右侧是代码编辑区域，代码编辑区域里边默认显示了待实现的方法。 我们需要在代码编辑器中根据方法给定的参数实现对应的算法，并返回题目要求的结果。然后还要经过「执行代码」测试结果，点击「提交」后，显示执行结果为「**通过**」时，才算完成一道题目。 @@ -82,96 +82,64 @@ LeetCode 提供了题目的搜索过滤功能。可以筛选相关题单、不 - 如果执行结果显示「编译出错」、「解答错误」、「执行出错」、「超出时间限制」、「超出内存限制」等情况，则需要回到第 3 步重新思考解决思路，或者思考特殊数据，并改写代码。 7. 如果执行结果显示「通过」，恭喜你通过了这道题目。 -接下来我们将通过「[1. 两数之和 - 力扣（LeetCode）](https://leetcode.cn/problems/two-sum/)」这道题目来讲解如何在 LeetCode 上刷题。 +接下来我们将通过「[2235. 两整数相加 - 力扣（LeetCode）](https://leetcode.cn/problems/add-two-integers/)」这道题目来讲解如何在 LeetCode 上刷题。 ### 2.5 LeetCode 第一题 #### 2.5.1 题目链接 -- [1. 两数之和 - 力扣（LeetCode）](https://leetcode.cn/problems/two-sum/) +- [2235. 两整数相加 - 力扣（LeetCode）](https://leetcode.cn/problems/add-two-integers/) #### 2.5.2 题目大意 -**描述**：给定一个整数数组 $nums$ 和一个整数目标值 $target$。 +**描述**：给定两个整数 $num1$ 和 $num2$。 -**要求**：在该数组中找出和为 $target$ 的两个整数，并输出这两个整数的下标。可以按任意顺序返回答案。 +**要求**：返回这两个整数的和。 **说明**： -- $2 \le nums.length \le 10^4$。 -- $-10^9 \le nums[i] \le 10^9$。 -- $-10^9 \le target \le 10^9$。 -- 只会存在一个有效答案。 +- $-100 \le num1, num2 \le 100$。 **示例**： - 示例 1： ```python -输入：nums = [2,7,11,15], target = 9 -输出：[0,1] -解释：因为 nums[0] + nums[1] == 9 ，返回 [0, 1] 。 +示例 1： +输入：num1 = 12, num2 = 5 +输出：17 +解释：num1 是 12，num2 是 5，它们的和是 12 + 5 = 17，因此返回 17。 ``` - 示例 2： ```python -输入：nums = [3,2,4], target = 6 -输出：[1,2] +输入：num1 = -10, num2 = 4 +输出：-6 +解释：num1 + num2 = -6，因此返回 -6。 ``` #### 2.5.3 解题思路 -##### 思路 1：枚举算法 +##### 思路 1：直接计算 -1. 使用两重循环枚举数组中每一个数 $nums[i]$、$nums[j]$，判断所有的 $nums[i] + nums[j]$ 是否等于 $target$。 -2. 如果出现 $nums[i] + nums[j] == target$，则说明数组中存在和为 $target$ 的两个整数，将两个整数的下标 $i$、$j$ 输出即可。 +1. 直接计算整数 $num1$ 与 $num2$ 的和，返回 $num1 + num2$ 即可。 ##### 思路 1：代码 ```python class Solution: - def twoSum(self, nums: List[int], target: int) -> List[int]: - for i in range(len(nums)): - for j in range(i + 1, len(nums)): - if i != j and nums[i] + nums[j] == target: - return [i, j] - return [] + def sum(self, num1: int, num2: int) -> int: + return num1 + num2 ``` ##### 思路 1：复杂度分析 -- **时间复杂度**：$O(n^2)$，其中 $n$ 是数组 $nums$ 的元素数量。 +- **时间复杂度**：$O(1)$。 - **空间复杂度**：$O(1)$。 -##### 思路 2：哈希表 -哈希表中键值对信息为 $target - nums[i]: i$，其中 $i$ 为下标。 - -1. 遍历数组，对于每一个数 $nums[i]$： - 1. 先查找字典中是否存在 $target - nums[i]$，存在则输出 $target - nums[i]$ 对应的下标和当前数组的下标 $i$。 - 2. 不存在则在字典中存入 $target - nums[i]$ 的下标 $i$。 - -##### 思路 2：代码 - -```python -def twoSum(self, nums: List[int], target: int) -> List[int]: - numDict = dict() - for i in range(len(nums)): - if target-nums[i] in numDict: - return numDict[target-nums[i]], i - numDict[nums[i]] = i - return [0] -``` - -##### 思路 2：复杂度分析 - -- **时间复杂度**：$O(n)$，其中 $n$ 是数组 $nums$ 的元素数量。 -- **空间复杂度**：$O(n)$。 - -理解了上面这道题的题意，就可以试着自己编写代码，并尝试提交通过。也可以通过我的解题思路和解题代码，理解之后进行编写代码，并尝试提交通过。 - -如果提交结果显示「通过」，那么恭喜你完成了 LeetCode 上的第一题。虽然只是一道题，但这意味着刷题计划的开始！希望你能坚持下去，得到应有的收获。 +理解了上面这道题的题意，就可以试着自己编写代码，并尝试提交通过。如果提交结果显示「通过」，那么恭喜你完成了 LeetCode 上的第一题。虽然只是一道题，但这意味着刷题计划的开始！希望你能坚持下去，得到应有的收获。 ## 3. LeetCode 刷题攻略 @@ -196,7 +164,7 @@ def twoSum(self, nums: List[int], target: int) -> List[int]: 当然，也可以直接看我写的「算法通关手册」，欢迎指正和提出建议，万分感谢。 -- 「算法通关手册」GitHub 地址：[https://github.com/itcharge/LeetCode-Py](https://github.com/itcharge/LeetCode-Py) +- 「算法通关手册」GitHub 地址：[https://github.com/itcharge/AlgoNote](https://github.com/itcharge/AlgoNote) - 「算法通关手册」电子书网站地址：[https://algo.itcharge.cn](https://algo.itcharge.cn) ### 3.2 LeetCode 刷题顺序 @@ -215,20 +183,14 @@ LeetCode 的题目序号并不是按照难易程度进行排序的，所以除 或者直接按照我整理的分类刷题列表进行刷题： -- 刷题列表（GitHub 版）链接：[点击打开「GitHub 版分类刷题列表」](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/05.Categories-List.md) -- 刷题列表（网页版）链接：[点击打开「网页版分类刷题列表」](https://algo.itcharge.cn/00.Introduction/05.Categories-List/) +- LeetCode 分类刷题列表：[点击打开「LeetCode 分类刷题列表」](https://github.com/itcharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md) 正在准备面试、没有太多时间刷题的小伙伴，可以按照我总结的「LeetCode 面试最常考 100 题」、「LeetCode 面试最常考 200 题」进行刷题。 > **说明**：「LeetCode 面试最常考 100 题」、「LeetCode 面试最常考 200 题」是笔者根据「[CodeTop 企业题库](https://codetop.cc/home)」按频度从高到低进行筛选，并且去除了一部分 LeetCode 上没有的题目和重复题目后得到的题目清单。 -- 「LeetCode 面试最常考 100 题（GitHub 版）」链接：[点击打开「LeetCode 面试最常考 100 题（GitHub 版）」](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/06.Interview-100-List.md) -- 「LeetCode 面试最常考 200 题（GitHub 版）」链接：[点击打开「LeetCode 面试最常考 200 题（GitHub 版）」](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/07.Interview-200-List.md) - ---- - -- 「LeetCode 面试最常考 100 题（网页版）」链接：[点击打开「LeetCode 面试最常考 100 题（网页版）」](https://algo.itcharge.cn/00.Introduction/06.Interview-100-List/) -- 「LeetCode 面试最常考 200 题（网页版）」链接：[点击打开「LeetCode 面试最常考 200 题（网页版）」](https://algo.itcharge.cn/00.Introduction/07.Interview-200-List/) +- 「LeetCode 面试最常考 100 题：[点击打开「LeetCode 面试最常考 100 题」](https://github.com/itcharge/AlgoNote/tree/main/docs/00_preface/00_07_interview_100_list.md) +- 「LeetCode 面试最常考 200 题：[点击打开「LeetCode 面试最常考 200 题」](https://github.com/itcharge/AlgoNote/tree/main/docs/00_preface/00_08_interview_200_list.md) ### 3.3 LeetCode 刷题技巧 @@ -300,6 +262,23 @@ LeetCode 的题目序号并不是按照难易程度进行排序的，所以除 这些话有些鸡汤了，但都是我的心里话。希望大家能够一起坚持刷题，争取早日实现自己的目标。 +## 4. 总结 + +### 4.1 LeetCode + +LeetCode 是一个在线编程练习平台，主要用于提升算法和编程能力。它包含大量题目，涵盖多种编程语言，适合准备技术面试。 + +新手可以从简单题目开始，逐步学习数据结构和算法。注册后，用户可以通过题库选择题目，按标签或难度分类练习。刷题时，建议使用熟悉的编程语言，如 Python，以提高效率。 + +### 4.2 刷题技巧 + +刷题需要坚持和重复练习。按专题分类刷题效果更好，可以巩固知识点。写解题报告有助于加深理解。 + +## 练习题目 + +- [2235. 两整数相加](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2200-2299/add-two-integers.md) +- [1929. 数组串联](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/concatenation-of-array.md) + ## 参考资料 - 【文章】[What is LeetCode? - Quora](https://www.quora.com/What-is-Leetcode) diff --git a/docs/00_preface/00_05_solutions_list.md b/docs/00_preface/00_05_solutions_list.md new file mode 100644 index 00000000..9f504ed7 --- /dev/null +++ b/docs/00_preface/00_05_solutions_list.md @@ -0,0 +1,1036 @@ +# LeetCode 题解（已完成 860 道） + +### 第 1 ~ 99 题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0001. 两数之和](https://leetcode.cn/problems/two-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/two-sum.md) | 数组、哈希表 | 简单 | +| [0002. 两数相加](https://leetcode.cn/problems/add-two-numbers/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/add-two-numbers.md) | 递归、链表、数学 | 中等 | +| [0003. 无重复字符的最长子串](https://leetcode.cn/problems/longest-substring-without-repeating-characters/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-substring-without-repeating-characters.md) | 哈希表、字符串、滑动窗口 | 中等 | +| [0004. 寻找两个正序数组的中位数](https://leetcode.cn/problems/median-of-two-sorted-arrays/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/median-of-two-sorted-arrays.md) | 数组、二分查找、分治 | 困难 | +| [0005. 最长回文子串](https://leetcode.cn/problems/longest-palindromic-substring/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-palindromic-substring.md) | 双指针、字符串、动态规划 | 中等 | +| [0007. 整数反转](https://leetcode.cn/problems/reverse-integer/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/reverse-integer.md) | 数学 | 中等 | +| [0008. 字符串转换整数 (atoi)](https://leetcode.cn/problems/string-to-integer-atoi/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/string-to-integer-atoi.md) | 字符串 | 中等 | +| [0009. 回文数](https://leetcode.cn/problems/palindrome-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/palindrome-number.md) | 数学 | 简单 | +| [0010. 正则表达式匹配](https://leetcode.cn/problems/regular-expression-matching/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/regular-expression-matching.md) | 递归、字符串、动态规划 | 困难 | +| [0011. 盛最多水的容器](https://leetcode.cn/problems/container-with-most-water/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/container-with-most-water.md) | 贪心、数组、双指针 | 中等 | +| [0012. 整数转罗马数字](https://leetcode.cn/problems/integer-to-roman/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/integer-to-roman.md) | 哈希表、数学、字符串 | 中等 | +| [0013. 罗马数字转整数](https://leetcode.cn/problems/roman-to-integer/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/roman-to-integer.md) | 哈希表、数学、字符串 | 简单 | +| [0014. 最长公共前缀](https://leetcode.cn/problems/longest-common-prefix/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-common-prefix.md) | 字典树、数组、字符串 | 简单 | +| [0015. 三数之和](https://leetcode.cn/problems/3sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/3sum.md) | 数组、双指针、排序 | 中等 | +| [0016. 最接近的三数之和](https://leetcode.cn/problems/3sum-closest/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/3sum-closest.md) | 数组、双指针、排序 | 中等 | +| [0017. 电话号码的字母组合](https://leetcode.cn/problems/letter-combinations-of-a-phone-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/letter-combinations-of-a-phone-number.md) | 哈希表、字符串、回溯 | 中等 | +| [0018. 四数之和](https://leetcode.cn/problems/4sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/4sum.md) | 数组、双指针、排序 | 中等 | +| [0019. 删除链表的倒数第 N 个结点](https://leetcode.cn/problems/remove-nth-node-from-end-of-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-nth-node-from-end-of-list.md) | 链表、双指针 | 中等 | +| [0020. 有效的括号](https://leetcode.cn/problems/valid-parentheses/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/valid-parentheses.md) | 栈、字符串 | 简单 | +| [0021. 合并两个有序链表](https://leetcode.cn/problems/merge-two-sorted-lists/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-two-sorted-lists.md) | 递归、链表 | 简单 | +| [0022. 括号生成](https://leetcode.cn/problems/generate-parentheses/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/generate-parentheses.md) | 字符串、动态规划、回溯 | 中等 | +| [0023. 合并 K 个升序链表](https://leetcode.cn/problems/merge-k-sorted-lists/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-k-sorted-lists.md) | 链表、分治、堆（优先队列）、归并排序 | 困难 | +| [0024. 两两交换链表中的节点](https://leetcode.cn/problems/swap-nodes-in-pairs/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/swap-nodes-in-pairs.md) | 递归、链表 | 中等 | +| [0025. K 个一组翻转链表](https://leetcode.cn/problems/reverse-nodes-in-k-group/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/reverse-nodes-in-k-group.md) | 递归、链表 | 困难 | +| [0026. 删除有序数组中的重复项](https://leetcode.cn/problems/remove-duplicates-from-sorted-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-duplicates-from-sorted-array.md) | 数组、双指针 | 简单 | +| [0027. 移除元素](https://leetcode.cn/problems/remove-element/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-element.md) | 数组、双指针 | 简单 | +| [0028. 找出字符串中第一个匹配项的下标](https://leetcode.cn/problems/find-the-index-of-the-first-occurrence-in-a-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/find-the-index-of-the-first-occurrence-in-a-string.md) | 双指针、字符串、字符串匹配 | 简单 | +| [0029. 两数相除](https://leetcode.cn/problems/divide-two-integers/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/divide-two-integers.md) | 位运算、数学 | 中等 | +| [0032. 最长有效括号](https://leetcode.cn/problems/longest-valid-parentheses/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-valid-parentheses.md) | 栈、字符串、动态规划 | 困难 | +| [0033. 搜索旋转排序数组](https://leetcode.cn/problems/search-in-rotated-sorted-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/search-in-rotated-sorted-array.md) | 数组、二分查找 | 中等 | +| [0034. 在排序数组中查找元素的第一个和最后一个位置](https://leetcode.cn/problems/find-first-and-last-position-of-element-in-sorted-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/find-first-and-last-position-of-element-in-sorted-array.md) | 数组、二分查找 | 中等 | +| [0035. 搜索插入位置](https://leetcode.cn/problems/search-insert-position/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/search-insert-position.md) | 数组、二分查找 | 简单 | +| [0036. 有效的数独](https://leetcode.cn/problems/valid-sudoku/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/valid-sudoku.md) | 数组、哈希表、矩阵 | 中等 | +| [0037. 解数独](https://leetcode.cn/problems/sudoku-solver/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/sudoku-solver.md) | 数组、哈希表、回溯、矩阵 | 困难 | +| [0038. 外观数列](https://leetcode.cn/problems/count-and-say/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/count-and-say.md) | 字符串 | 中等 | +| [0039. 组合总和](https://leetcode.cn/problems/combination-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/combination-sum.md) | 数组、回溯 | 中等 | +| [0040. 组合总和 II](https://leetcode.cn/problems/combination-sum-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/combination-sum-ii.md) | 数组、回溯 | 中等 | +| [0041. 缺失的第一个正数](https://leetcode.cn/problems/first-missing-positive/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/first-missing-positive.md) | 数组、哈希表 | 困难 | +| [0042. 接雨水](https://leetcode.cn/problems/trapping-rain-water/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/trapping-rain-water.md) | 栈、数组、双指针、动态规划、单调栈 | 困难 | +| [0043. 字符串相乘](https://leetcode.cn/problems/multiply-strings/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/multiply-strings.md) | 数学、字符串、模拟 | 中等 | +| [0044. 通配符匹配](https://leetcode.cn/problems/wildcard-matching/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/wildcard-matching.md) | 贪心、递归、字符串、动态规划 | 困难 | +| [0045. 跳跃游戏 II](https://leetcode.cn/problems/jump-game-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/jump-game-ii.md) | 贪心、数组、动态规划 | 中等 | +| [0046. 全排列](https://leetcode.cn/problems/permutations/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/permutations.md) | 数组、回溯 | 中等 | +| [0047. 全排列 II](https://leetcode.cn/problems/permutations-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/permutations-ii.md) | 数组、回溯、排序 | 中等 | +| [0048. 旋转图像](https://leetcode.cn/problems/rotate-image/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/rotate-image.md) | 数组、数学、矩阵 | 中等 | +| [0049. 字母异位词分组](https://leetcode.cn/problems/group-anagrams/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/group-anagrams.md) | 数组、哈希表、字符串、排序 | 中等 | +| [0050. Pow(x, n)](https://leetcode.cn/problems/powx-n/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/powx-n.md) | 递归、数学 | 中等 | +| [0051. N 皇后](https://leetcode.cn/problems/n-queens/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/n-queens.md) | 数组、回溯 | 困难 | +| [0052. N 皇后 II](https://leetcode.cn/problems/n-queens-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/n-queens-ii.md) | 回溯 | 困难 | +| [0053. 最大子数组和](https://leetcode.cn/problems/maximum-subarray/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/maximum-subarray.md) | 数组、分治、动态规划 | 中等 | +| [0054. 螺旋矩阵](https://leetcode.cn/problems/spiral-matrix/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/spiral-matrix.md) | 数组、矩阵、模拟 | 中等 | +| [0055. 跳跃游戏](https://leetcode.cn/problems/jump-game/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/jump-game.md) | 贪心、数组、动态规划 | 中等 | +| [0056. 合并区间](https://leetcode.cn/problems/merge-intervals/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-intervals.md) | 数组、排序 | 中等 | +| [0058. 最后一个单词的长度](https://leetcode.cn/problems/length-of-last-word/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/length-of-last-word.md) | 字符串 | 简单 | +| [0059. 螺旋矩阵 II](https://leetcode.cn/problems/spiral-matrix-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/spiral-matrix-ii.md) | 数组、矩阵、模拟 | 中等 | +| [0061. 旋转链表](https://leetcode.cn/problems/rotate-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/rotate-list.md) | 链表、双指针 | 中等 | +| [0062. 不同路径](https://leetcode.cn/problems/unique-paths/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/unique-paths.md) | 数学、动态规划、组合数学 | 中等 | +| [0063. 不同路径 II](https://leetcode.cn/problems/unique-paths-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/unique-paths-ii.md) | 数组、动态规划、矩阵 | 中等 | +| [0064. 最小路径和](https://leetcode.cn/problems/minimum-path-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/minimum-path-sum.md) | 数组、动态规划、矩阵 | 中等 | +| [0066. 加一](https://leetcode.cn/problems/plus-one/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/plus-one.md) | 数组、数学 | 简单 | +| [0067. 二进制求和](https://leetcode.cn/problems/add-binary/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/add-binary.md) | 位运算、数学、字符串、模拟 | 简单 | +| [0069. x 的平方根](https://leetcode.cn/problems/sqrtx/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/sqrtx.md) | 数学、二分查找 | 简单 | +| [0070. 爬楼梯](https://leetcode.cn/problems/climbing-stairs/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/climbing-stairs.md) | 记忆化搜索、数学、动态规划 | 简单 | +| [0072. 编辑距离](https://leetcode.cn/problems/edit-distance/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/edit-distance.md) | 字符串、动态规划 | 中等 | +| [0073. 矩阵置零](https://leetcode.cn/problems/set-matrix-zeroes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/set-matrix-zeroes.md) | 数组、哈希表、矩阵 | 中等 | +| [0074. 搜索二维矩阵](https://leetcode.cn/problems/search-a-2d-matrix/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/search-a-2d-matrix.md) | 数组、二分查找、矩阵 | 中等 | +| [0075. 颜色分类](https://leetcode.cn/problems/sort-colors/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/sort-colors.md) | 数组、双指针、排序 | 中等 | +| [0076. 最小覆盖子串](https://leetcode.cn/problems/minimum-window-substring/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/minimum-window-substring.md) | 哈希表、字符串、滑动窗口 | 困难 | +| [0077. 组合](https://leetcode.cn/problems/combinations/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/combinations.md) | 回溯 | 中等 | +| [0078. 子集](https://leetcode.cn/problems/subsets/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/subsets.md) | 位运算、数组、回溯 | 中等 | +| [0079. 单词搜索](https://leetcode.cn/problems/word-search/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/word-search.md) | 深度优先搜索、数组、字符串、回溯、矩阵 | 中等 | +| [0080. 删除有序数组中的重复项 II](https://leetcode.cn/problems/remove-duplicates-from-sorted-array-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-duplicates-from-sorted-array-ii.md) | 数组、双指针 | 中等 | +| [0081. 搜索旋转排序数组 II](https://leetcode.cn/problems/search-in-rotated-sorted-array-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/search-in-rotated-sorted-array-ii.md) | 数组、二分查找 | 中等 | +| [0082. 删除排序链表中的重复元素 II](https://leetcode.cn/problems/remove-duplicates-from-sorted-list-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-duplicates-from-sorted-list-ii.md) | 链表、双指针 | 中等 | +| [0083. 删除排序链表中的重复元素](https://leetcode.cn/problems/remove-duplicates-from-sorted-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-duplicates-from-sorted-list.md) | 链表 | 简单 | +| [0084. 柱状图中最大的矩形](https://leetcode.cn/problems/largest-rectangle-in-histogram/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/largest-rectangle-in-histogram.md) | 栈、数组、单调栈 | 困难 | +| [0088. 合并两个有序数组](https://leetcode.cn/problems/merge-sorted-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-sorted-array.md) | 数组、双指针、排序 | 简单 | +| [0089. 格雷编码](https://leetcode.cn/problems/gray-code/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/gray-code.md) | 位运算、数学、回溯 | 中等 | +| [0090. 子集 II](https://leetcode.cn/problems/subsets-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/subsets-ii.md) | 位运算、数组、回溯 | 中等 | +| [0091. 解码方法](https://leetcode.cn/problems/decode-ways/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/decode-ways.md) | 字符串、动态规划 | 中等 | +| [0092. 反转链表 II](https://leetcode.cn/problems/reverse-linked-list-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/reverse-linked-list-ii.md) | 链表 | 中等 | +| [0093. 复原 IP 地址](https://leetcode.cn/problems/restore-ip-addresses/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/restore-ip-addresses.md) | 字符串、回溯 | 中等 | +| [0094. 二叉树的中序遍历](https://leetcode.cn/problems/binary-tree-inorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/binary-tree-inorder-traversal.md) | 栈、树、深度优先搜索、二叉树 | 简单 | +| [0095. 不同的二叉搜索树 II](https://leetcode.cn/problems/unique-binary-search-trees-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/unique-binary-search-trees-ii.md) | 树、二叉搜索树、动态规划、回溯、二叉树 | 中等 | +| [0096. 不同的二叉搜索树](https://leetcode.cn/problems/unique-binary-search-trees/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/unique-binary-search-trees.md) | 树、二叉搜索树、数学、动态规划、二叉树 | 中等 | +| [0098. 验证二叉搜索树](https://leetcode.cn/problems/validate-binary-search-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/validate-binary-search-tree.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | + + +### 第 100 ~ 199 题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0100. 相同的树](https://leetcode.cn/problems/same-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/same-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0101. 对称二叉树](https://leetcode.cn/problems/symmetric-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/symmetric-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0102. 二叉树的层序遍历](https://leetcode.cn/problems/binary-tree-level-order-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-level-order-traversal.md) | 树、广度优先搜索、二叉树 | 中等 | +| [0103. 二叉树的锯齿形层序遍历](https://leetcode.cn/problems/binary-tree-zigzag-level-order-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-zigzag-level-order-traversal.md) | 树、广度优先搜索、二叉树 | 中等 | +| [0104. 二叉树的最大深度](https://leetcode.cn/problems/maximum-depth-of-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/maximum-depth-of-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0105. 从前序与中序遍历序列构造二叉树](https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/construct-binary-tree-from-preorder-and-inorder-traversal.md) | 树、数组、哈希表、分治、二叉树 | 中等 | +| [0106. 从中序与后序遍历序列构造二叉树](https://leetcode.cn/problems/construct-binary-tree-from-inorder-and-postorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/construct-binary-tree-from-inorder-and-postorder-traversal.md) | 树、数组、哈希表、分治、二叉树 | 中等 | +| [0107. 二叉树的层序遍历 II](https://leetcode.cn/problems/binary-tree-level-order-traversal-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-level-order-traversal-ii.md) | 树、广度优先搜索、二叉树 | 中等 | +| [0108. 将有序数组转换为二叉搜索树](https://leetcode.cn/problems/convert-sorted-array-to-binary-search-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/convert-sorted-array-to-binary-search-tree.md) | 树、二叉搜索树、数组、分治、二叉树 | 简单 | +| [0110. 平衡二叉树](https://leetcode.cn/problems/balanced-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/balanced-binary-tree.md) | 树、深度优先搜索、二叉树 | 简单 | +| [0111. 二叉树的最小深度](https://leetcode.cn/problems/minimum-depth-of-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/minimum-depth-of-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0112. 路径总和](https://leetcode.cn/problems/path-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/path-sum.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0113. 路径总和 II](https://leetcode.cn/problems/path-sum-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/path-sum-ii.md) | 树、深度优先搜索、回溯、二叉树 | 中等 | +| [0115. 不同的子序列](https://leetcode.cn/problems/distinct-subsequences/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/distinct-subsequences.md) | 字符串、动态规划 | 困难 | +| [0116. 填充每个节点的下一个右侧节点指针](https://leetcode.cn/problems/populating-next-right-pointers-in-each-node/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/populating-next-right-pointers-in-each-node.md) | 树、深度优先搜索、广度优先搜索、链表、二叉树 | 中等 | +| [0117. 填充每个节点的下一个右侧节点指针 II](https://leetcode.cn/problems/populating-next-right-pointers-in-each-node-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/populating-next-right-pointers-in-each-node-ii.md) | 树、深度优先搜索、广度优先搜索、链表、二叉树 | 中等 | +| [0118. 杨辉三角](https://leetcode.cn/problems/pascals-triangle/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/pascals-triangle.md) | 数组、动态规划 | 简单 | +| [0119. 杨辉三角 II](https://leetcode.cn/problems/pascals-triangle-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/pascals-triangle-ii.md) | 数组、动态规划 | 简单 | +| [0120. 三角形最小路径和](https://leetcode.cn/problems/triangle/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/triangle.md) | 数组、动态规划 | 中等 | +| [0121. 买卖股票的最佳时机](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/best-time-to-buy-and-sell-stock.md) | 数组、动态规划 | 简单 | +| [0122. 买卖股票的最佳时机 II](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/best-time-to-buy-and-sell-stock-ii.md) | 贪心、数组、动态规划 | 中等 | +| [0123. 买卖股票的最佳时机 III](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-iii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/best-time-to-buy-and-sell-stock-iii.md) | 数组、动态规划 | 困难 | +| [0124. 二叉树中的最大路径和](https://leetcode.cn/problems/binary-tree-maximum-path-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-maximum-path-sum.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | +| [0125. 验证回文串](https://leetcode.cn/problems/valid-palindrome/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/valid-palindrome.md) | 双指针、字符串 | 简单 | +| [0127. 单词接龙](https://leetcode.cn/problems/word-ladder/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/word-ladder.md) | 广度优先搜索、哈希表、字符串 | 困难 | +| [0128. 最长连续序列](https://leetcode.cn/problems/longest-consecutive-sequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/longest-consecutive-sequence.md) | 并查集、数组、哈希表 | 中等 | +| [0129. 求根节点到叶节点数字之和](https://leetcode.cn/problems/sum-root-to-leaf-numbers/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/sum-root-to-leaf-numbers.md) | 树、深度优先搜索、二叉树 | 中等 | +| [0130. 被围绕的区域](https://leetcode.cn/problems/surrounded-regions/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/surrounded-regions.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | +| [0131. 分割回文串](https://leetcode.cn/problems/palindrome-partitioning/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/palindrome-partitioning.md) | 字符串、动态规划、回溯 | 中等 | +| [0133. 克隆图](https://leetcode.cn/problems/clone-graph/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/clone-graph.md) | 深度优先搜索、广度优先搜索、图、哈希表 | 中等 | +| [0134. 加油站](https://leetcode.cn/problems/gas-station/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/gas-station.md) | 贪心、数组 | 中等 | +| [0135. 分发糖果](https://leetcode.cn/problems/candy/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/candy.md) | 贪心、数组 | 困难 | +| [0136. 只出现一次的数字](https://leetcode.cn/problems/single-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/single-number.md) | 位运算、数组 | 简单 | +| [0137. 只出现一次的数字 II](https://leetcode.cn/problems/single-number-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/single-number-ii.md) | 位运算、数组 | 中等 | +| [0138. 随机链表的复制](https://leetcode.cn/problems/copy-list-with-random-pointer/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/copy-list-with-random-pointer.md) | 哈希表、链表 | 中等 | +| [0139. 单词拆分](https://leetcode.cn/problems/word-break/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/word-break.md) | 字典树、记忆化搜索、数组、哈希表、字符串、动态规划 | 中等 | +| [0140. 单词拆分 II](https://leetcode.cn/problems/word-break-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/word-break-ii.md) | 字典树、记忆化搜索、数组、哈希表、字符串、动态规划、回溯 | 困难 | +| [0141. 环形链表](https://leetcode.cn/problems/linked-list-cycle/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/linked-list-cycle.md) | 哈希表、链表、双指针 | 简单 | +| [0142. 环形链表 II](https://leetcode.cn/problems/linked-list-cycle-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/linked-list-cycle-ii.md) | 哈希表、链表、双指针 | 中等 | +| [0143. 重排链表](https://leetcode.cn/problems/reorder-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/reorder-list.md) | 栈、递归、链表、双指针 | 中等 | +| [0144. 二叉树的前序遍历](https://leetcode.cn/problems/binary-tree-preorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-preorder-traversal.md) | 栈、树、深度优先搜索、二叉树 | 简单 | +| [0145. 二叉树的后序遍历](https://leetcode.cn/problems/binary-tree-postorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-postorder-traversal.md) | 栈、树、深度优先搜索、二叉树 | 简单 | +| [0147. 对链表进行插入排序](https://leetcode.cn/problems/insertion-sort-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/insertion-sort-list.md) | 链表、排序 | 中等 | +| [0148. 排序链表](https://leetcode.cn/problems/sort-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/sort-list.md) | 链表、双指针、分治、排序、归并排序 | 中等 | +| [0149. 直线上最多的点数](https://leetcode.cn/problems/max-points-on-a-line/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/max-points-on-a-line.md) | 几何、数组、哈希表、数学 | 困难 | +| [0150. 逆波兰表达式求值](https://leetcode.cn/problems/evaluate-reverse-polish-notation/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/evaluate-reverse-polish-notation.md) | 栈、数组、数学 | 中等 | +| [0151. 反转字符串中的单词](https://leetcode.cn/problems/reverse-words-in-a-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/reverse-words-in-a-string.md) | 双指针、字符串 | 中等 | +| [0152. 乘积最大子数组](https://leetcode.cn/problems/maximum-product-subarray/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/maximum-product-subarray.md) | 数组、动态规划 | 中等 | +| [0153. 寻找旋转排序数组中的最小值](https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/find-minimum-in-rotated-sorted-array.md) | 数组、二分查找 | 中等 | +| [0154. 寻找旋转排序数组中的最小值 II](https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/find-minimum-in-rotated-sorted-array-ii.md) | 数组、二分查找 | 困难 | +| [0155. 最小栈](https://leetcode.cn/problems/min-stack/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/min-stack.md) | 栈、设计 | 中等 | +| [0159. 至多包含两个不同字符的最长子串](https://leetcode.cn/problems/longest-substring-with-at-most-two-distinct-characters/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/longest-substring-with-at-most-two-distinct-characters.md) | 哈希表、字符串、滑动窗口 | 中等 | +| [0160. 相交链表](https://leetcode.cn/problems/intersection-of-two-linked-lists/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/intersection-of-two-linked-lists.md) | 哈希表、链表、双指针 | 简单 | +| [0162. 寻找峰值](https://leetcode.cn/problems/find-peak-element/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/find-peak-element.md) | 数组、二分查找 | 中等 | +| [0164. 最大间距](https://leetcode.cn/problems/maximum-gap/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/maximum-gap.md) | 数组、桶排序、基数排序、排序 | 中等 | +| [0166. 分数到小数](https://leetcode.cn/problems/fraction-to-recurring-decimal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/fraction-to-recurring-decimal.md) | 哈希表、数学、字符串 | 中等 | +| [0167. 两数之和 II - 输入有序数组](https://leetcode.cn/problems/two-sum-ii-input-array-is-sorted/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/two-sum-ii-input-array-is-sorted.md) | 数组、双指针、二分查找 | 中等 | +| [0168. Excel 表列名称](https://leetcode.cn/problems/excel-sheet-column-title/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/excel-sheet-column-title.md) | 数学、字符串 | 简单 | +| [0169. 多数元素](https://leetcode.cn/problems/majority-element/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/majority-element.md) | 数组、哈希表、分治、计数、排序 | 简单 | +| [0170. 两数之和 III - 数据结构设计](https://leetcode.cn/problems/two-sum-iii-data-structure-design/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/two-sum-iii-data-structure-design.md) | 设计、数组、哈希表、双指针、数据流 | 简单 | +| [0171. Excel 表列序号](https://leetcode.cn/problems/excel-sheet-column-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/excel-sheet-column-number.md) | 数学、字符串 | 简单 | +| [0172. 阶乘后的零](https://leetcode.cn/problems/factorial-trailing-zeroes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/factorial-trailing-zeroes.md) | 数学 | 中等 | +| [0173. 二叉搜索树迭代器](https://leetcode.cn/problems/binary-search-tree-iterator/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-search-tree-iterator.md) | 栈、树、设计、二叉搜索树、二叉树、迭代器 | 中等 | +| [0179. 最大数](https://leetcode.cn/problems/largest-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/largest-number.md) | 贪心、数组、字符串、排序 | 中等 | +| [0188. 买卖股票的最佳时机 IV](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-iv/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/best-time-to-buy-and-sell-stock-iv.md) | 数组、动态规划 | 困难 | +| [0189. 轮转数组](https://leetcode.cn/problems/rotate-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/rotate-array.md) | 数组、数学、双指针 | 中等 | +| [0190. 颠倒二进制位](https://leetcode.cn/problems/reverse-bits/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/reverse-bits.md) | 位运算、分治 | 简单 | +| [0191. 位1的个数](https://leetcode.cn/problems/number-of-1-bits/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/number-of-1-bits.md) | 位运算、分治 | 简单 | +| [0198. 打家劫舍](https://leetcode.cn/problems/house-robber/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/house-robber.md) | 数组、动态规划 | 中等 | +| [0199. 二叉树的右视图](https://leetcode.cn/problems/binary-tree-right-side-view/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-right-side-view.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | + + +### 第 200 ~ 299 题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0200. 岛屿数量](https://leetcode.cn/problems/number-of-islands/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/number-of-islands.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | +| [0201. 数字范围按位与](https://leetcode.cn/problems/bitwise-and-of-numbers-range/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/bitwise-and-of-numbers-range.md) | 位运算 | 中等 | +| [0202. 快乐数](https://leetcode.cn/problems/happy-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/happy-number.md) | 哈希表、数学、双指针 | 简单 | +| [0203. 移除链表元素](https://leetcode.cn/problems/remove-linked-list-elements/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/remove-linked-list-elements.md) | 递归、链表 | 简单 | +| [0204. 计数质数](https://leetcode.cn/problems/count-primes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/count-primes.md) | 数组、数学、枚举、数论 | 中等 | +| [0205. 同构字符串](https://leetcode.cn/problems/isomorphic-strings/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/isomorphic-strings.md) | 哈希表、字符串 | 简单 | +| [0206. 反转链表](https://leetcode.cn/problems/reverse-linked-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/reverse-linked-list.md) | 递归、链表 | 简单 | +| [0207. 课程表](https://leetcode.cn/problems/course-schedule/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/course-schedule.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | +| [0208. 实现 Trie (前缀树)](https://leetcode.cn/problems/implement-trie-prefix-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/implement-trie-prefix-tree.md) | 设计、字典树、哈希表、字符串 | 中等 | +| [0209. 长度最小的子数组](https://leetcode.cn/problems/minimum-size-subarray-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/minimum-size-subarray-sum.md) | 数组、二分查找、前缀和、滑动窗口 | 中等 | +| [0210. 课程表 II](https://leetcode.cn/problems/course-schedule-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/course-schedule-ii.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | +| [0211. 添加与搜索单词 - 数据结构设计](https://leetcode.cn/problems/design-add-and-search-words-data-structure/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/design-add-and-search-words-data-structure.md) | 深度优先搜索、设计、字典树、字符串 | 中等 | +| [0212. 单词搜索 II](https://leetcode.cn/problems/word-search-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/word-search-ii.md) | 字典树、数组、字符串、回溯、矩阵 | 困难 | +| [0213. 打家劫舍 II](https://leetcode.cn/problems/house-robber-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/house-robber-ii.md) | 数组、动态规划 | 中等 | +| [0215. 数组中的第K个最大元素](https://leetcode.cn/problems/kth-largest-element-in-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/kth-largest-element-in-an-array.md) | 数组、分治、快速选择、排序、堆（优先队列） | 中等 | +| [0217. 存在重复元素](https://leetcode.cn/problems/contains-duplicate/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/contains-duplicate.md) | 数组、哈希表、排序 | 简单 | +| [0218. 天际线问题](https://leetcode.cn/problems/the-skyline-problem/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/the-skyline-problem.md) | 树状数组、线段树、数组、分治、有序集合、扫描线、堆（优先队列） | 困难 | +| [0219. 存在重复元素 II](https://leetcode.cn/problems/contains-duplicate-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/contains-duplicate-ii.md) | 数组、哈希表、滑动窗口 | 简单 | +| [0220. 存在重复元素 III](https://leetcode.cn/problems/contains-duplicate-iii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/contains-duplicate-iii.md) | 数组、桶排序、有序集合、排序、滑动窗口 | 困难 | +| [0221. 最大正方形](https://leetcode.cn/problems/maximal-square/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/maximal-square.md) | 数组、动态规划、矩阵 | 中等 | +| [0222. 完全二叉树的节点个数](https://leetcode.cn/problems/count-complete-tree-nodes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/count-complete-tree-nodes.md) | 位运算、树、二分查找、二叉树 | 简单 | +| [0223. 矩形面积](https://leetcode.cn/problems/rectangle-area/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/rectangle-area.md) | 几何、数学 | 中等 | +| [0225. 用队列实现栈](https://leetcode.cn/problems/implement-stack-using-queues/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/implement-stack-using-queues.md) | 栈、设计、队列 | 简单 | +| [0226. 翻转二叉树](https://leetcode.cn/problems/invert-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/invert-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0227. 基本计算器 II](https://leetcode.cn/problems/basic-calculator-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/basic-calculator-ii.md) | 栈、数学、字符串 | 中等 | +| [0231. 2 的幂](https://leetcode.cn/problems/power-of-two/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/power-of-two.md) | 位运算、递归、数学 | 简单 | +| [0232. 用栈实现队列](https://leetcode.cn/problems/implement-queue-using-stacks/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/implement-queue-using-stacks.md) | 栈、设计、队列 | 简单 | +| [0233. 数字 1 的个数](https://leetcode.cn/problems/number-of-digit-one/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/number-of-digit-one.md) | 递归、数学、动态规划 | 困难 | +| [0234. 回文链表](https://leetcode.cn/problems/palindrome-linked-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/palindrome-linked-list.md) | 栈、递归、链表、双指针 | 简单 | +| [0235. 二叉搜索树的最近公共祖先](https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-search-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/lowest-common-ancestor-of-a-binary-search-tree.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | +| [0236. 二叉树的最近公共祖先](https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/lowest-common-ancestor-of-a-binary-tree.md) | 树、深度优先搜索、二叉树 | 中等 | +| [0237. 删除链表中的节点](https://leetcode.cn/problems/delete-node-in-a-linked-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/delete-node-in-a-linked-list.md) | 链表 | 中等 | +| [0238. 除自身以外数组的乘积](https://leetcode.cn/problems/product-of-array-except-self/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/product-of-array-except-self.md) | 数组、前缀和 | 中等 | +| [0239. 滑动窗口最大值](https://leetcode.cn/problems/sliding-window-maximum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/sliding-window-maximum.md) | 队列、数组、滑动窗口、单调队列、堆（优先队列） | 困难 | +| [0240. 搜索二维矩阵 II](https://leetcode.cn/problems/search-a-2d-matrix-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/search-a-2d-matrix-ii.md) | 数组、二分查找、分治、矩阵 | 中等 | +| [0241. 为运算表达式设计优先级](https://leetcode.cn/problems/different-ways-to-add-parentheses/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/different-ways-to-add-parentheses.md) | 递归、记忆化搜索、数学、字符串、动态规划 | 中等 | +| [0242. 有效的字母异位词](https://leetcode.cn/problems/valid-anagram/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/valid-anagram.md) | 哈希表、字符串、排序 | 简单 | +| [0249. 移位字符串分组](https://leetcode.cn/problems/group-shifted-strings/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/group-shifted-strings.md) | 数组、哈希表、字符串 | 中等 | +| [0257. 二叉树的所有路径](https://leetcode.cn/problems/binary-tree-paths/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/binary-tree-paths.md) | 树、深度优先搜索、字符串、回溯、二叉树 | 简单 | +| [0258. 各位相加](https://leetcode.cn/problems/add-digits/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/add-digits.md) | 数学、数论、模拟 | 简单 | +| [0259. 较小的三数之和](https://leetcode.cn/problems/3sum-smaller/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/3sum-smaller.md) | 数组、双指针、二分查找、排序 | 中等 | +| [0260. 只出现一次的数字 III](https://leetcode.cn/problems/single-number-iii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/single-number-iii.md) | 位运算、数组 | 中等 | +| [0263. 丑数](https://leetcode.cn/problems/ugly-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/ugly-number.md) | 数学 | 简单 | +| [0264. 丑数 II](https://leetcode.cn/problems/ugly-number-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/ugly-number-ii.md) | 哈希表、数学、动态规划、堆（优先队列） | 中等 | +| [0268. 丢失的数字](https://leetcode.cn/problems/missing-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/missing-number.md) | 位运算、数组、哈希表、数学、二分查找、排序 | 简单 | +| [0270. 最接近的二叉搜索树值](https://leetcode.cn/problems/closest-binary-search-tree-value/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/closest-binary-search-tree-value.md) | 树、深度优先搜索、二叉搜索树、二分查找、二叉树 | 简单 | +| [0278. 第一个错误的版本](https://leetcode.cn/problems/first-bad-version/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/first-bad-version.md) | 二分查找、交互 | 简单 | +| [0279. 完全平方数](https://leetcode.cn/problems/perfect-squares/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/perfect-squares.md) | 广度优先搜索、数学、动态规划 | 中等 | +| [0283. 移动零](https://leetcode.cn/problems/move-zeroes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/move-zeroes.md) | 数组、双指针 | 简单 | +| [0285. 二叉搜索树中的中序后继](https://leetcode.cn/problems/inorder-successor-in-bst/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/inorder-successor-in-bst.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | +| [0286. 墙与门](https://leetcode.cn/problems/walls-and-gates/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/walls-and-gates.md) | 广度优先搜索、数组、矩阵 | 中等 | +| [0287. 寻找重复数](https://leetcode.cn/problems/find-the-duplicate-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/find-the-duplicate-number.md) | 位运算、数组、双指针、二分查找 | 中等 | +| [0288. 单词的唯一缩写](https://leetcode.cn/problems/unique-word-abbreviation/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/unique-word-abbreviation.md) | 设计、数组、哈希表、字符串 | 中等 | +| [0289. 生命游戏](https://leetcode.cn/problems/game-of-life/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/game-of-life.md) | 数组、矩阵、模拟 | 中等 | +| [0290. 单词规律](https://leetcode.cn/problems/word-pattern/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/word-pattern.md) | 哈希表、字符串 | 简单 | +| [0292. Nim 游戏](https://leetcode.cn/problems/nim-game/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/nim-game.md) | 脑筋急转弯、数学、博弈 | 简单 | +| [0295. 数据流的中位数](https://leetcode.cn/problems/find-median-from-data-stream/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/find-median-from-data-stream.md) | 设计、双指针、数据流、排序、堆（优先队列） | 困难 | +| [0297. 二叉树的序列化与反序列化](https://leetcode.cn/problems/serialize-and-deserialize-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/serialize-and-deserialize-binary-tree.md) | 树、深度优先搜索、广度优先搜索、设计、字符串、二叉树 | 困难 | + + +### 第 300 ~ 399 题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0300. 最长递增子序列](https://leetcode.cn/problems/longest-increasing-subsequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/longest-increasing-subsequence.md) | 数组、二分查找、动态规划 | 中等 | +| [0303. 区域和检索 - 数组不可变](https://leetcode.cn/problems/range-sum-query-immutable/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/range-sum-query-immutable.md) | 设计、数组、前缀和 | 简单 | +| [0304. 二维区域和检索 - 矩阵不可变](https://leetcode.cn/problems/range-sum-query-2d-immutable/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/range-sum-query-2d-immutable.md) | 设计、数组、矩阵、前缀和 | 中等 | +| [0307. 区域和检索 - 数组可修改](https://leetcode.cn/problems/range-sum-query-mutable/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/range-sum-query-mutable.md) | 设计、树状数组、线段树、数组 | 中等 | +| [0309. 买卖股票的最佳时机含冷冻期](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-cooldown/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/best-time-to-buy-and-sell-stock-with-cooldown.md) | 数组、动态规划 | 中等 | +| [0310. 最小高度树](https://leetcode.cn/problems/minimum-height-trees/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/minimum-height-trees.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | +| [0312. 戳气球](https://leetcode.cn/problems/burst-balloons/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/burst-balloons.md) | 数组、动态规划 | 困难 | +| [0315. 计算右侧小于当前元素的个数](https://leetcode.cn/problems/count-of-smaller-numbers-after-self/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/count-of-smaller-numbers-after-self.md) | 树状数组、线段树、数组、二分查找、分治、有序集合、归并排序 | 困难 | +| [0316. 去除重复字母](https://leetcode.cn/problems/remove-duplicate-letters/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/remove-duplicate-letters.md) | 栈、贪心、字符串、单调栈 | 中等 | +| [0318. 最大单词长度乘积](https://leetcode.cn/problems/maximum-product-of-word-lengths/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/maximum-product-of-word-lengths.md) | 位运算、数组、字符串 | 中等 | +| [0322. 零钱兑换](https://leetcode.cn/problems/coin-change/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/coin-change.md) | 广度优先搜索、数组、动态规划 | 中等 | +| [0323. 无向图中连通分量的数目](https://leetcode.cn/problems/number-of-connected-components-in-an-undirected-graph/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/number-of-connected-components-in-an-undirected-graph.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | +| [0324. 摆动排序 II](https://leetcode.cn/problems/wiggle-sort-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/wiggle-sort-ii.md) | 贪心、数组、分治、快速选择、排序 | 中等 | +| [0326. 3 的幂](https://leetcode.cn/problems/power-of-three/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/power-of-three.md) | 递归、数学 | 简单 | +| [0328. 奇偶链表](https://leetcode.cn/problems/odd-even-linked-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/odd-even-linked-list.md) | 链表 | 中等 | +| [0329. 矩阵中的最长递增路径](https://leetcode.cn/problems/longest-increasing-path-in-a-matrix/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/longest-increasing-path-in-a-matrix.md) | 深度优先搜索、广度优先搜索、图、拓扑排序、记忆化搜索、数组、动态规划、矩阵 | 困难 | +| [0334. 递增的三元子序列](https://leetcode.cn/problems/increasing-triplet-subsequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/increasing-triplet-subsequence.md) | 贪心、数组 | 中等 | +| [0336. 回文对](https://leetcode.cn/problems/palindrome-pairs/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/palindrome-pairs.md) | 字典树、数组、哈希表、字符串 | 困难 | +| [0337. 打家劫舍 III](https://leetcode.cn/problems/house-robber-iii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/house-robber-iii.md) | 树、深度优先搜索、动态规划、二叉树 | 中等 | +| [0338. 比特位计数](https://leetcode.cn/problems/counting-bits/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/counting-bits.md) | 位运算、动态规划 | 简单 | +| [0340. 至多包含 K 个不同字符的最长子串](https://leetcode.cn/problems/longest-substring-with-at-most-k-distinct-characters/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/longest-substring-with-at-most-k-distinct-characters.md) | 哈希表、字符串、滑动窗口 | 中等 | +| [0341. 扁平化嵌套列表迭代器](https://leetcode.cn/problems/flatten-nested-list-iterator/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/flatten-nested-list-iterator.md) | 栈、树、深度优先搜索、设计、队列、迭代器 | 中等 | +| [0342. 4的幂](https://leetcode.cn/problems/power-of-four/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/power-of-four.md) | 位运算、递归、数学 | 简单 | +| [0343. 整数拆分](https://leetcode.cn/problems/integer-break/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/integer-break.md) | 数学、动态规划 | 中等 | +| [0344. 反转字符串](https://leetcode.cn/problems/reverse-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/reverse-string.md) | 双指针、字符串 | 简单 | +| [0345. 反转字符串中的元音字母](https://leetcode.cn/problems/reverse-vowels-of-a-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/reverse-vowels-of-a-string.md) | 双指针、字符串 | 简单 | +| [0346. 数据流中的移动平均值](https://leetcode.cn/problems/moving-average-from-data-stream/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/moving-average-from-data-stream.md) | 设计、队列、数组、数据流 | 简单 | +| [0347. 前 K 个高频元素](https://leetcode.cn/problems/top-k-frequent-elements/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/top-k-frequent-elements.md) | 数组、哈希表、分治、桶排序、计数、快速选择、排序、堆（优先队列） | 中等 | +| [0349. 两个数组的交集](https://leetcode.cn/problems/intersection-of-two-arrays/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/intersection-of-two-arrays.md) | 数组、哈希表、双指针、二分查找、排序 | 简单 | +| [0350. 两个数组的交集 II](https://leetcode.cn/problems/intersection-of-two-arrays-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/intersection-of-two-arrays-ii.md) | 数组、哈希表、双指针、二分查找、排序 | 简单 | +| [0351. 安卓系统手势解锁](https://leetcode.cn/problems/android-unlock-patterns/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/android-unlock-patterns.md) | 位运算、动态规划、回溯、状态压缩 | 中等 | +| [0354. 俄罗斯套娃信封问题](https://leetcode.cn/problems/russian-doll-envelopes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/russian-doll-envelopes.md) | 数组、二分查找、动态规划、排序 | 困难 | +| [0357. 统计各位数字都不同的数字个数](https://leetcode.cn/problems/count-numbers-with-unique-digits/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/count-numbers-with-unique-digits.md) | 数学、动态规划、回溯 | 中等 | +| [0359. 日志速率限制器](https://leetcode.cn/problems/logger-rate-limiter/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/logger-rate-limiter.md) | 设计、哈希表、数据流 | 简单 | +| [0360. 有序转化数组](https://leetcode.cn/problems/sort-transformed-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/sort-transformed-array.md) | 数组、数学、双指针、排序 | 中等 | +| [0367. 有效的完全平方数](https://leetcode.cn/problems/valid-perfect-square/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/valid-perfect-square.md) | 数学、二分查找 | 简单 | +| [0370. 区间加法](https://leetcode.cn/problems/range-addition/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/range-addition.md) | 数组、前缀和 | 中等 | +| [0371. 两整数之和](https://leetcode.cn/problems/sum-of-two-integers/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/sum-of-two-integers.md) | 位运算、数学 | 中等 | +| [0374. 猜数字大小](https://leetcode.cn/problems/guess-number-higher-or-lower/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/guess-number-higher-or-lower.md) | 二分查找、交互 | 简单 | +| [0375. 猜数字大小 II](https://leetcode.cn/problems/guess-number-higher-or-lower-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/guess-number-higher-or-lower-ii.md) | 数学、动态规划、博弈 | 中等 | +| [0376. 摆动序列](https://leetcode.cn/problems/wiggle-subsequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/wiggle-subsequence.md) | 贪心、数组、动态规划 | 中等 | +| [0377. 组合总和 Ⅳ](https://leetcode.cn/problems/combination-sum-iv/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/combination-sum-iv.md) | 数组、动态规划 | 中等 | +| [0378. 有序矩阵中第 K 小的元素](https://leetcode.cn/problems/kth-smallest-element-in-a-sorted-matrix/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/kth-smallest-element-in-a-sorted-matrix.md) | 数组、二分查找、矩阵、排序、堆（优先队列） | 中等 | +| [0380. O(1) 时间插入、删除和获取随机元素](https://leetcode.cn/problems/insert-delete-getrandom-o1/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/insert-delete-getrandom-o1.md) | 设计、数组、哈希表、数学、随机化 | 中等 | +| [0383. 赎金信](https://leetcode.cn/problems/ransom-note/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/ransom-note.md) | 哈希表、字符串、计数 | 简单 | +| [0384. 打乱数组](https://leetcode.cn/problems/shuffle-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/shuffle-an-array.md) | 设计、数组、数学、随机化 | 中等 | +| [0386. 字典序排数](https://leetcode.cn/problems/lexicographical-numbers/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/lexicographical-numbers.md) | 深度优先搜索、字典树 | 中等 | +| [0387. 字符串中的第一个唯一字符](https://leetcode.cn/problems/first-unique-character-in-a-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/first-unique-character-in-a-string.md) | 队列、哈希表、字符串、计数 | 简单 | +| [0389. 找不同](https://leetcode.cn/problems/find-the-difference/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/find-the-difference.md) | 位运算、哈希表、字符串、排序 | 简单 | +| [0391. 完美矩形](https://leetcode.cn/problems/perfect-rectangle/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/perfect-rectangle.md) | 数组、扫描线 | 困难 | +| [0392. 判断子序列](https://leetcode.cn/problems/is-subsequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/is-subsequence.md) | 双指针、字符串、动态规划 | 简单 | +| [0394. 字符串解码](https://leetcode.cn/problems/decode-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/decode-string.md) | 栈、递归、字符串 | 中等 | +| [0395. 至少有 K 个重复字符的最长子串](https://leetcode.cn/problems/longest-substring-with-at-least-k-repeating-characters/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/longest-substring-with-at-least-k-repeating-characters.md) | 哈希表、字符串、分治、滑动窗口 | 中等 | +| [0399. 除法求值](https://leetcode.cn/problems/evaluate-division/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/evaluate-division.md) | 深度优先搜索、广度优先搜索、并查集、图、数组、字符串、最短路 | 中等 | + + +### 第 400 ~ 499 题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0400. 第 N 位数字](https://leetcode.cn/problems/nth-digit/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/nth-digit.md) | 数学、二分查找 | 中等 | +| [0403. 青蛙过河](https://leetcode.cn/problems/frog-jump/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/frog-jump.md) | 数组、动态规划 | 困难 | +| [0404. 左叶子之和](https://leetcode.cn/problems/sum-of-left-leaves/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/sum-of-left-leaves.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0405. 数字转换为十六进制数](https://leetcode.cn/problems/convert-a-number-to-hexadecimal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/convert-a-number-to-hexadecimal.md) | 位运算、数学、字符串 | 简单 | +| [0406. 根据身高重建队列](https://leetcode.cn/problems/queue-reconstruction-by-height/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/queue-reconstruction-by-height.md) | 树状数组、线段树、数组、排序 | 中等 | +| [0409. 最长回文串](https://leetcode.cn/problems/longest-palindrome/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/longest-palindrome.md) | 贪心、哈希表、字符串 | 简单 | +| [0410. 分割数组的最大值](https://leetcode.cn/problems/split-array-largest-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/split-array-largest-sum.md) | 贪心、数组、二分查找、动态规划、前缀和 | 困难 | +| [0412. Fizz Buzz](https://leetcode.cn/problems/fizz-buzz/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/fizz-buzz.md) | 数学、字符串、模拟 | 简单 | +| [0415. 字符串相加](https://leetcode.cn/problems/add-strings/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/add-strings.md) | 数学、字符串、模拟 | 简单 | +| [0416. 分割等和子集](https://leetcode.cn/problems/partition-equal-subset-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/partition-equal-subset-sum.md) | 数组、动态规划 | 中等 | +| [0417. 太平洋大西洋水流问题](https://leetcode.cn/problems/pacific-atlantic-water-flow/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/pacific-atlantic-water-flow.md) | 深度优先搜索、广度优先搜索、数组、矩阵 | 中等 | +| [0421. 数组中两个数的最大异或值](https://leetcode.cn/problems/maximum-xor-of-two-numbers-in-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/maximum-xor-of-two-numbers-in-an-array.md) | 位运算、字典树、数组、哈希表 | 中等 | +| [0424. 替换后的最长重复字符](https://leetcode.cn/problems/longest-repeating-character-replacement/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/longest-repeating-character-replacement.md) | 哈希表、字符串、滑动窗口 | 中等 | +| [0425. 单词方块](https://leetcode.cn/problems/word-squares/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/word-squares.md) | 字典树、数组、字符串、回溯 | 困难 | +| [0426. 将二叉搜索树转化为排序的双向链表](https://leetcode.cn/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/convert-binary-search-tree-to-sorted-doubly-linked-list.md) | 栈、树、深度优先搜索、二叉搜索树、链表、二叉树、双向链表 | 中等 | +| [0428. 序列化和反序列化 N 叉树](https://leetcode.cn/problems/serialize-and-deserialize-n-ary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/serialize-and-deserialize-n-ary-tree.md) | 树、深度优先搜索、广度优先搜索、字符串 | 困难 | +| [0429. N 叉树的层序遍历](https://leetcode.cn/problems/n-ary-tree-level-order-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/n-ary-tree-level-order-traversal.md) | 树、广度优先搜索 | 中等 | +| [0430. 扁平化多级双向链表](https://leetcode.cn/problems/flatten-a-multilevel-doubly-linked-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/flatten-a-multilevel-doubly-linked-list.md) | 深度优先搜索、链表、双向链表 | 中等 | +| [0435. 无重叠区间](https://leetcode.cn/problems/non-overlapping-intervals/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/non-overlapping-intervals.md) | 贪心、数组、动态规划、排序 | 中等 | +| [0437. 路径总和 III](https://leetcode.cn/problems/path-sum-iii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/path-sum-iii.md) | 树、深度优先搜索、二叉树 | 中等 | +| [0438. 找到字符串中所有字母异位词](https://leetcode.cn/problems/find-all-anagrams-in-a-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/find-all-anagrams-in-a-string.md) | 哈希表、字符串、滑动窗口 | 中等 | +| [0443. 压缩字符串](https://leetcode.cn/problems/string-compression/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/string-compression.md) | 双指针、字符串 | 中等 | +| [0445. 两数相加 II](https://leetcode.cn/problems/add-two-numbers-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/add-two-numbers-ii.md) | 栈、链表、数学 | 中等 | +| [0447. 回旋镖的数量](https://leetcode.cn/problems/number-of-boomerangs/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/number-of-boomerangs.md) | 数组、哈希表、数学 | 中等 | +| [0450. 删除二叉搜索树中的节点](https://leetcode.cn/problems/delete-node-in-a-bst/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/delete-node-in-a-bst.md) | 树、二叉搜索树、二叉树 | 中等 | +| [0451. 根据字符出现频率排序](https://leetcode.cn/problems/sort-characters-by-frequency/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/sort-characters-by-frequency.md) | 哈希表、字符串、桶排序、计数、排序、堆（优先队列） | 中等 | +| [0452. 用最少数量的箭引爆气球](https://leetcode.cn/problems/minimum-number-of-arrows-to-burst-balloons/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/minimum-number-of-arrows-to-burst-balloons.md) | 贪心、数组、排序 | 中等 | +| [0454. 四数相加 II](https://leetcode.cn/problems/4sum-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/4sum-ii.md) | 数组、哈希表 | 中等 | +| [0455. 分发饼干](https://leetcode.cn/problems/assign-cookies/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/assign-cookies.md) | 贪心、数组、双指针、排序 | 简单 | +| [0459. 重复的子字符串](https://leetcode.cn/problems/repeated-substring-pattern/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/repeated-substring-pattern.md) | 字符串、字符串匹配 | 简单 | +| [0461. 汉明距离](https://leetcode.cn/problems/hamming-distance/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/hamming-distance.md) | 位运算 | 简单 | +| [0463. 岛屿的周长](https://leetcode.cn/problems/island-perimeter/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/island-perimeter.md) | 深度优先搜索、广度优先搜索、数组、矩阵 | 简单 | +| [0464. 我能赢吗](https://leetcode.cn/problems/can-i-win/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/can-i-win.md) | 位运算、记忆化搜索、数学、动态规划、状态压缩、博弈 | 中等 | +| [0467. 环绕字符串中唯一的子字符串](https://leetcode.cn/problems/unique-substrings-in-wraparound-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/unique-substrings-in-wraparound-string.md) | 字符串、动态规划 | 中等 | +| [0468. 验证IP地址](https://leetcode.cn/problems/validate-ip-address/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/validate-ip-address.md) | 字符串 | 中等 | +| [0473. 火柴拼正方形](https://leetcode.cn/problems/matchsticks-to-square/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/matchsticks-to-square.md) | 位运算、数组、动态规划、回溯、状态压缩 | 中等 | +| [0474. 一和零](https://leetcode.cn/problems/ones-and-zeroes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/ones-and-zeroes.md) | 数组、字符串、动态规划 | 中等 | +| [0480. 滑动窗口中位数](https://leetcode.cn/problems/sliding-window-median/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/sliding-window-median.md) | 数组、哈希表、滑动窗口、堆（优先队列） | 困难 | +| [0485. 最大连续 1 的个数](https://leetcode.cn/problems/max-consecutive-ones/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/max-consecutive-ones.md) | 数组 | 简单 | +| [0486. 预测赢家](https://leetcode.cn/problems/predict-the-winner/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/predict-the-winner.md) | 递归、数组、数学、动态规划、博弈 | 中等 | +| [0487. 最大连续1的个数 II](https://leetcode.cn/problems/max-consecutive-ones-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/max-consecutive-ones-ii.md) | 数组、动态规划、滑动窗口 | 中等 | +| [0491. 非递减子序列](https://leetcode.cn/problems/non-decreasing-subsequences/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/non-decreasing-subsequences.md) | 位运算、数组、哈希表、回溯 | 中等 | +| [0494. 目标和](https://leetcode.cn/problems/target-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/target-sum.md) | 数组、动态规划、回溯 | 中等 | +| [0496. 下一个更大元素 I](https://leetcode.cn/problems/next-greater-element-i/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/next-greater-element-i.md) | 栈、数组、哈希表、单调栈 | 简单 | +| [0498. 对角线遍历](https://leetcode.cn/problems/diagonal-traverse/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/diagonal-traverse.md) | 数组、矩阵、模拟 | 中等 | + + +### 第 500 ~ 599 题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0501. 二叉搜索树中的众数](https://leetcode.cn/problems/find-mode-in-binary-search-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/find-mode-in-binary-search-tree.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 简单 | +| [0503. 下一个更大元素 II](https://leetcode.cn/problems/next-greater-element-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/next-greater-element-ii.md) | 栈、数组、单调栈 | 中等 | +| [0504. 七进制数](https://leetcode.cn/problems/base-7/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/base-7.md) | 数学、字符串 | 简单 | +| [0506. 相对名次](https://leetcode.cn/problems/relative-ranks/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/relative-ranks.md) | 数组、排序、堆（优先队列） | 简单 | +| [0509. 斐波那契数](https://leetcode.cn/problems/fibonacci-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/fibonacci-number.md) | 递归、记忆化搜索、数学、动态规划 | 简单 | +| [0513. 找树左下角的值](https://leetcode.cn/problems/find-bottom-left-tree-value/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/find-bottom-left-tree-value.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | +| [0515. 在每个树行中找最大值](https://leetcode.cn/problems/find-largest-value-in-each-tree-row/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/find-largest-value-in-each-tree-row.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | +| [0516. 最长回文子序列](https://leetcode.cn/problems/longest-palindromic-subsequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/longest-palindromic-subsequence.md) | 字符串、动态规划 | 中等 | +| [0518. 零钱兑换 II](https://leetcode.cn/problems/coin-change-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/coin-change-ii.md) | 数组、动态规划 | 中等 | +| [0525. 连续数组](https://leetcode.cn/problems/contiguous-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/contiguous-array.md) | 数组、哈希表、前缀和 | 中等 | +| [0526. 优美的排列](https://leetcode.cn/problems/beautiful-arrangement/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/beautiful-arrangement.md) | 位运算、数组、动态规划、回溯、状态压缩 | 中等 | +| [0530. 二叉搜索树的最小绝对差](https://leetcode.cn/problems/minimum-absolute-difference-in-bst/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/minimum-absolute-difference-in-bst.md) | 树、深度优先搜索、广度优先搜索、二叉搜索树、二叉树 | 简单 | +| [0538. 把二叉搜索树转换为累加树](https://leetcode.cn/problems/convert-bst-to-greater-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/convert-bst-to-greater-tree.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | +| [0539. 最小时间差](https://leetcode.cn/problems/minimum-time-difference/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/minimum-time-difference.md) | 数组、数学、字符串、排序 | 中等 | +| [0542. 01 矩阵](https://leetcode.cn/problems/01-matrix/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/01-matrix.md) | 广度优先搜索、数组、动态规划、矩阵 | 中等 | +| [0543. 二叉树的直径](https://leetcode.cn/problems/diameter-of-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/diameter-of-binary-tree.md) | 树、深度优先搜索、二叉树 | 简单 | +| [0546. 移除盒子](https://leetcode.cn/problems/remove-boxes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/remove-boxes.md) | 记忆化搜索、数组、动态规划 | 困难 | +| [0547. 省份数量](https://leetcode.cn/problems/number-of-provinces/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/number-of-provinces.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | +| [0557. 反转字符串中的单词 III](https://leetcode.cn/problems/reverse-words-in-a-string-iii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/reverse-words-in-a-string-iii.md) | 双指针、字符串 | 简单 | +| [0560. 和为 K 的子数组](https://leetcode.cn/problems/subarray-sum-equals-k/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/subarray-sum-equals-k.md) | 数组、哈希表、前缀和 | 中等 | +| [0561. 数组拆分](https://leetcode.cn/problems/array-partition/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/array-partition.md) | 贪心、数组、计数排序、排序 | 简单 | +| [0567. 字符串的排列](https://leetcode.cn/problems/permutation-in-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/permutation-in-string.md) | 哈希表、双指针、字符串、滑动窗口 | 中等 | +| [0575. 分糖果](https://leetcode.cn/problems/distribute-candies/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/distribute-candies.md) | 数组、哈希表 | 简单 | +| [0576. 出界的路径数](https://leetcode.cn/problems/out-of-boundary-paths/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/out-of-boundary-paths.md) | 动态规划 | 中等 | +| [0583. 两个字符串的删除操作](https://leetcode.cn/problems/delete-operation-for-two-strings/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/delete-operation-for-two-strings.md) | 字符串、动态规划 | 中等 | +| [0589. N 叉树的前序遍历](https://leetcode.cn/problems/n-ary-tree-preorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/n-ary-tree-preorder-traversal.md) | 栈、树、深度优先搜索 | 简单 | +| [0590. N 叉树的后序遍历](https://leetcode.cn/problems/n-ary-tree-postorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/n-ary-tree-postorder-traversal.md) | 栈、树、深度优先搜索 | 简单 | +| [0599. 两个列表的最小索引总和](https://leetcode.cn/problems/minimum-index-sum-of-two-lists/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/minimum-index-sum-of-two-lists.md) | 数组、哈希表、字符串 | 简单 | + + +### 第 600 ~ 699 题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0600. 不含连续1的非负整数](https://leetcode.cn/problems/non-negative-integers-without-consecutive-ones/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/non-negative-integers-without-consecutive-ones.md) | 动态规划 | 困难 | +| [0611. 有效三角形的个数](https://leetcode.cn/problems/valid-triangle-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/valid-triangle-number.md) | 贪心、数组、双指针、二分查找、排序 | 中等 | +| [0616. 给字符串添加加粗标签](https://leetcode.cn/problems/add-bold-tag-in-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/add-bold-tag-in-string.md) | 字典树、数组、哈希表、字符串、字符串匹配 | 中等 | +| [0617. 合并二叉树](https://leetcode.cn/problems/merge-two-binary-trees/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/merge-two-binary-trees.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0621. 任务调度器](https://leetcode.cn/problems/task-scheduler/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/task-scheduler.md) | 贪心、数组、哈希表、计数、排序、堆（优先队列） | 中等 | +| [0622. 设计循环队列](https://leetcode.cn/problems/design-circular-queue/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/design-circular-queue.md) | 设计、队列、数组、链表 | 中等 | +| [0633. 平方数之和](https://leetcode.cn/problems/sum-of-square-numbers/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/sum-of-square-numbers.md) | 数学、双指针、二分查找 | 中等 | +| [0639. 解码方法 II](https://leetcode.cn/problems/decode-ways-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/decode-ways-ii.md) | 字符串、动态规划 | 困难 | +| [0642. 设计搜索自动补全系统](https://leetcode.cn/problems/design-search-autocomplete-system/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/design-search-autocomplete-system.md) | 深度优先搜索、设计、字典树、字符串、数据流、排序、堆（优先队列） | 困难 | +| [0643. 子数组最大平均数 I](https://leetcode.cn/problems/maximum-average-subarray-i/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/maximum-average-subarray-i.md) | 数组、滑动窗口 | 简单 | +| [0647. 回文子串](https://leetcode.cn/problems/palindromic-substrings/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/palindromic-substrings.md) | 双指针、字符串、动态规划 | 中等 | +| [0648. 单词替换](https://leetcode.cn/problems/replace-words/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/replace-words.md) | 字典树、数组、哈希表、字符串 | 中等 | +| [0650. 两个键的键盘](https://leetcode.cn/problems/2-keys-keyboard/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/2-keys-keyboard.md) | 数学、动态规划 | 中等 | +| [0652. 寻找重复的子树](https://leetcode.cn/problems/find-duplicate-subtrees/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/find-duplicate-subtrees.md) | 树、深度优先搜索、哈希表、二叉树 | 中等 | +| [0653. 两数之和 IV - 输入二叉搜索树](https://leetcode.cn/problems/two-sum-iv-input-is-a-bst/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/two-sum-iv-input-is-a-bst.md) | 树、深度优先搜索、广度优先搜索、二叉搜索树、哈希表、双指针、二叉树 | 简单 | +| [0654. 最大二叉树](https://leetcode.cn/problems/maximum-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/maximum-binary-tree.md) | 栈、树、数组、分治、二叉树、单调栈 | 中等 | +| [0658. 找到 K 个最接近的元素](https://leetcode.cn/problems/find-k-closest-elements/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/find-k-closest-elements.md) | 数组、双指针、二分查找、排序、滑动窗口、堆（优先队列） | 中等 | +| [0662. 二叉树最大宽度](https://leetcode.cn/problems/maximum-width-of-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/maximum-width-of-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | +| [0664. 奇怪的打印机](https://leetcode.cn/problems/strange-printer/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/strange-printer.md) | 字符串、动态规划 | 困难 | +| [0665. 非递减数列](https://leetcode.cn/problems/non-decreasing-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/non-decreasing-array.md) | 数组 | 中等 | +| [0669. 修剪二叉搜索树](https://leetcode.cn/problems/trim-a-binary-search-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/trim-a-binary-search-tree.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | +| [0673. 最长递增子序列的个数](https://leetcode.cn/problems/number-of-longest-increasing-subsequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/number-of-longest-increasing-subsequence.md) | 树状数组、线段树、数组、动态规划 | 中等 | +| [0674. 最长连续递增序列](https://leetcode.cn/problems/longest-continuous-increasing-subsequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/longest-continuous-increasing-subsequence.md) | 数组 | 简单 | +| [0676. 实现一个魔法字典](https://leetcode.cn/problems/implement-magic-dictionary/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/implement-magic-dictionary.md) | 深度优先搜索、设计、字典树、哈希表、字符串 | 中等 | +| [0677. 键值映射](https://leetcode.cn/problems/map-sum-pairs/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/map-sum-pairs.md) | 设计、字典树、哈希表、字符串 | 中等 | +| [0678. 有效的括号字符串](https://leetcode.cn/problems/valid-parenthesis-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/valid-parenthesis-string.md) | 栈、贪心、字符串、动态规划 | 中等 | +| [0680. 验证回文串 II](https://leetcode.cn/problems/valid-palindrome-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/valid-palindrome-ii.md) | 贪心、双指针、字符串 | 简单 | +| [0683. K 个关闭的灯泡](https://leetcode.cn/problems/k-empty-slots/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/k-empty-slots.md) | 树状数组、线段树、队列、数组、有序集合、滑动窗口、单调队列、堆（优先队列） | 困难 | +| [0684. 冗余连接](https://leetcode.cn/problems/redundant-connection/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/redundant-connection.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | +| [0686. 重复叠加字符串匹配](https://leetcode.cn/problems/repeated-string-match/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/repeated-string-match.md) | 字符串、字符串匹配 | 中等 | +| [0687. 最长同值路径](https://leetcode.cn/problems/longest-univalue-path/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/longest-univalue-path.md) | 树、深度优先搜索、二叉树 | 中等 | +| [0688. 骑士在棋盘上的概率](https://leetcode.cn/problems/knight-probability-in-chessboard/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/knight-probability-in-chessboard.md) | 动态规划 | 中等 | +| [0690. 员工的重要性](https://leetcode.cn/problems/employee-importance/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/employee-importance.md) | 树、深度优先搜索、广度优先搜索、数组、哈希表 | 中等 | +| [0691. 贴纸拼词](https://leetcode.cn/problems/stickers-to-spell-word/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/stickers-to-spell-word.md) | 位运算、记忆化搜索、数组、哈希表、字符串、动态规划、回溯、状态压缩 | 困难 | +| [0695. 岛屿的最大面积](https://leetcode.cn/problems/max-area-of-island/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/max-area-of-island.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | +| [0698. 划分为k个相等的子集](https://leetcode.cn/problems/partition-to-k-equal-sum-subsets/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/partition-to-k-equal-sum-subsets.md) | 位运算、记忆化搜索、数组、动态规划、回溯、状态压缩 | 中等 | + + +### 第 700 ~ 799 题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0700. 二叉搜索树中的搜索](https://leetcode.cn/problems/search-in-a-binary-search-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/search-in-a-binary-search-tree.md) | 树、二叉搜索树、二叉树 | 简单 | +| [0701. 二叉搜索树中的插入操作](https://leetcode.cn/problems/insert-into-a-binary-search-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/insert-into-a-binary-search-tree.md) | 树、二叉搜索树、二叉树 | 中等 | +| [0702. 搜索长度未知的有序数组](https://leetcode.cn/problems/search-in-a-sorted-array-of-unknown-size/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/search-in-a-sorted-array-of-unknown-size.md) | 数组、二分查找、交互 | 中等 | +| [0703. 数据流中的第 K 大元素](https://leetcode.cn/problems/kth-largest-element-in-a-stream/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/kth-largest-element-in-a-stream.md) | 树、设计、二叉搜索树、二叉树、数据流、堆（优先队列） | 简单 | +| [0704. 二分查找](https://leetcode.cn/problems/binary-search/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/binary-search.md) | 数组、二分查找 | 简单 | +| [0705. 设计哈希集合](https://leetcode.cn/problems/design-hashset/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/design-hashset.md) | 设计、数组、哈希表、链表、哈希函数 | 简单 | +| [0706. 设计哈希映射](https://leetcode.cn/problems/design-hashmap/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/design-hashmap.md) | 设计、数组、哈希表、链表、哈希函数 | 简单 | +| [0707. 设计链表](https://leetcode.cn/problems/design-linked-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/design-linked-list.md) | 设计、链表 | 中等 | +| [0708. 循环有序列表的插入](https://leetcode.cn/problems/insert-into-a-sorted-circular-linked-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/insert-into-a-sorted-circular-linked-list.md) | 链表 | 中等 | +| [0709. 转换成小写字母](https://leetcode.cn/problems/to-lower-case/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/to-lower-case.md) | 字符串 | 简单 | +| [0713. 乘积小于 K 的子数组](https://leetcode.cn/problems/subarray-product-less-than-k/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/subarray-product-less-than-k.md) | 数组、二分查找、前缀和、滑动窗口 | 中等 | +| [0714. 买卖股票的最佳时机含手续费](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/best-time-to-buy-and-sell-stock-with-transaction-fee.md) | 贪心、数组、动态规划 | 中等 | +| [0715. Range 模块](https://leetcode.cn/problems/range-module/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/range-module.md) | 设计、线段树、有序集合 | 困难 | +| [0718. 最长重复子数组](https://leetcode.cn/problems/maximum-length-of-repeated-subarray/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/maximum-length-of-repeated-subarray.md) | 数组、二分查找、动态规划、滑动窗口、哈希函数、滚动哈希 | 中等 | +| [0719. 找出第 K 小的数对距离](https://leetcode.cn/problems/find-k-th-smallest-pair-distance/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/find-k-th-smallest-pair-distance.md) | 数组、双指针、二分查找、排序 | 困难 | +| [0720. 词典中最长的单词](https://leetcode.cn/problems/longest-word-in-dictionary/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/longest-word-in-dictionary.md) | 字典树、数组、哈希表、字符串、排序 | 中等 | +| [0724. 寻找数组的中心下标](https://leetcode.cn/problems/find-pivot-index/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/find-pivot-index.md) | 数组、前缀和 | 简单 | +| [0727. 最小窗口子序列](https://leetcode.cn/problems/minimum-window-subsequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/minimum-window-subsequence.md) | 字符串、动态规划、滑动窗口 | 困难 | +| [0729. 我的日程安排表 I](https://leetcode.cn/problems/my-calendar-i/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/my-calendar-i.md) | 设计、线段树、数组、二分查找、有序集合 | 中等 | +| [0731. 我的日程安排表 II](https://leetcode.cn/problems/my-calendar-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/my-calendar-ii.md) | 设计、线段树、数组、二分查找、有序集合、前缀和 | 中等 | +| [0732. 我的日程安排表 III](https://leetcode.cn/problems/my-calendar-iii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/my-calendar-iii.md) | 设计、线段树、二分查找、有序集合、前缀和 | 困难 | +| [0733. 图像渲染](https://leetcode.cn/problems/flood-fill/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/flood-fill.md) | 深度优先搜索、广度优先搜索、数组、矩阵 | 简单 | +| [0735. 小行星碰撞](https://leetcode.cn/problems/asteroid-collision/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/asteroid-collision.md) | 栈、数组、模拟 | 中等 | +| [0738. 单调递增的数字](https://leetcode.cn/problems/monotone-increasing-digits/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/monotone-increasing-digits.md) | 贪心、数学 | 中等 | +| [0739. 每日温度](https://leetcode.cn/problems/daily-temperatures/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/daily-temperatures.md) | 栈、数组、单调栈 | 中等 | +| [0744. 寻找比目标字母大的最小字母](https://leetcode.cn/problems/find-smallest-letter-greater-than-target/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/find-smallest-letter-greater-than-target.md) | 数组、二分查找 | 简单 | +| [0746. 使用最小花费爬楼梯](https://leetcode.cn/problems/min-cost-climbing-stairs/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/min-cost-climbing-stairs.md) | 数组、动态规划 | 简单 | +| [0752. 打开转盘锁](https://leetcode.cn/problems/open-the-lock/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/open-the-lock.md) | 广度优先搜索、数组、哈希表、字符串 | 中等 | +| [0758. 字符串中的加粗单词](https://leetcode.cn/problems/bold-words-in-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/bold-words-in-string.md) | 字典树、数组、哈希表、字符串、字符串匹配 | 中等 | +| [0763. 划分字母区间](https://leetcode.cn/problems/partition-labels/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/partition-labels.md) | 贪心、哈希表、双指针、字符串 | 中等 | +| [0765. 情侣牵手](https://leetcode.cn/problems/couples-holding-hands/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/couples-holding-hands.md) | 贪心、深度优先搜索、广度优先搜索、并查集、图 | 困难 | +| [0766. 托普利茨矩阵](https://leetcode.cn/problems/toeplitz-matrix/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/toeplitz-matrix.md) | 数组、矩阵 | 简单 | +| [0771. 宝石与石头](https://leetcode.cn/problems/jewels-and-stones/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/jewels-and-stones.md) | 哈希表、字符串 | 简单 | +| [0778. 水位上升的泳池中游泳](https://leetcode.cn/problems/swim-in-rising-water/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/swim-in-rising-water.md) | 深度优先搜索、广度优先搜索、并查集、数组、二分查找、矩阵、堆（优先队列） | 困难 | +| [0779. 第K个语法符号](https://leetcode.cn/problems/k-th-symbol-in-grammar/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/k-th-symbol-in-grammar.md) | 位运算、递归、数学 | 中等 | +| [0783. 二叉搜索树节点最小距离](https://leetcode.cn/problems/minimum-distance-between-bst-nodes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/minimum-distance-between-bst-nodes.md) | 树、深度优先搜索、广度优先搜索、二叉搜索树、二叉树 | 简单 | +| [0784. 字母大小写全排列](https://leetcode.cn/problems/letter-case-permutation/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/letter-case-permutation.md) | 位运算、字符串、回溯 | 中等 | +| [0785. 判断二分图](https://leetcode.cn/problems/is-graph-bipartite/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/is-graph-bipartite.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | +| [0788. 旋转数字](https://leetcode.cn/problems/rotated-digits/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/rotated-digits.md) | 数学、动态规划 | 中等 | +| [0795. 区间子数组个数](https://leetcode.cn/problems/number-of-subarrays-with-bounded-maximum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/number-of-subarrays-with-bounded-maximum.md) | 数组、双指针 | 中等 | +| [0796. 旋转字符串](https://leetcode.cn/problems/rotate-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/rotate-string.md) | 字符串、字符串匹配 | 简单 | +| [0797. 所有可能的路径](https://leetcode.cn/problems/all-paths-from-source-to-target/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/all-paths-from-source-to-target.md) | 深度优先搜索、广度优先搜索、图、回溯 | 中等 | + + +### 第 800 ~ 899 题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0800. 相似 RGB 颜色](https://leetcode.cn/problems/similar-rgb-color/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/similar-rgb-color.md) | 数学、字符串、枚举 | 简单 | +| [0801. 使序列递增的最小交换次数](https://leetcode.cn/problems/minimum-swaps-to-make-sequences-increasing/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/minimum-swaps-to-make-sequences-increasing.md) | 数组、动态规划 | 困难 | +| [0802. 找到最终的安全状态](https://leetcode.cn/problems/find-eventual-safe-states/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/find-eventual-safe-states.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | +| [0803. 打砖块](https://leetcode.cn/problems/bricks-falling-when-hit/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/bricks-falling-when-hit.md) | 并查集、数组、矩阵 | 困难 | +| [0804. 唯一摩尔斯密码词](https://leetcode.cn/problems/unique-morse-code-words/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/unique-morse-code-words.md) | 数组、哈希表、字符串 | 简单 | +| [0806. 写字符串需要的行数](https://leetcode.cn/problems/number-of-lines-to-write-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/number-of-lines-to-write-string.md) | 数组、字符串 | 简单 | +| [0811. 子域名访问计数](https://leetcode.cn/problems/subdomain-visit-count/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/subdomain-visit-count.md) | 数组、哈希表、字符串、计数 | 中等 | +| [0814. 二叉树剪枝](https://leetcode.cn/problems/binary-tree-pruning/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/binary-tree-pruning.md) | 树、深度优先搜索、二叉树 | 中等 | +| [0819. 最常见的单词](https://leetcode.cn/problems/most-common-word/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/most-common-word.md) | 数组、哈希表、字符串、计数 | 简单 | +| [0820. 单词的压缩编码](https://leetcode.cn/problems/short-encoding-of-words/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/short-encoding-of-words.md) | 字典树、数组、哈希表、字符串 | 中等 | +| [0821. 字符的最短距离](https://leetcode.cn/problems/shortest-distance-to-a-character/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/shortest-distance-to-a-character.md) | 数组、双指针、字符串 | 简单 | +| [0824. 山羊拉丁文](https://leetcode.cn/problems/goat-latin/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/goat-latin.md) | 字符串 | 简单 | +| [0830. 较大分组的位置](https://leetcode.cn/problems/positions-of-large-groups/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/positions-of-large-groups.md) | 字符串 | 简单 | +| [0832. 翻转图像](https://leetcode.cn/problems/flipping-an-image/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/flipping-an-image.md) | 位运算、数组、双指针、矩阵、模拟 | 简单 | +| [0834. 树中距离之和](https://leetcode.cn/problems/sum-of-distances-in-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/sum-of-distances-in-tree.md) | 树、深度优先搜索、图、动态规划 | 困难 | +| [0836. 矩形重叠](https://leetcode.cn/problems/rectangle-overlap/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/rectangle-overlap.md) | 几何、数学 | 简单 | +| [0841. 钥匙和房间](https://leetcode.cn/problems/keys-and-rooms/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/keys-and-rooms.md) | 深度优先搜索、广度优先搜索、图 | 中等 | +| [0844. 比较含退格的字符串](https://leetcode.cn/problems/backspace-string-compare/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/backspace-string-compare.md) | 栈、双指针、字符串、模拟 | 简单 | +| [0845. 数组中的最长山脉](https://leetcode.cn/problems/longest-mountain-in-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/longest-mountain-in-array.md) | 数组、双指针、动态规划、枚举 | 中等 | +| [0846. 一手顺子](https://leetcode.cn/problems/hand-of-straights/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/hand-of-straights.md) | 贪心、数组、哈希表、排序 | 中等 | +| [0847. 访问所有节点的最短路径](https://leetcode.cn/problems/shortest-path-visiting-all-nodes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/shortest-path-visiting-all-nodes.md) | 位运算、广度优先搜索、图、动态规划、状态压缩 | 困难 | +| [0850. 矩形面积 II](https://leetcode.cn/problems/rectangle-area-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/rectangle-area-ii.md) | 线段树、数组、有序集合、扫描线 | 困难 | +| [0851. 喧闹和富有](https://leetcode.cn/problems/loud-and-rich/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/loud-and-rich.md) | 深度优先搜索、图、拓扑排序、数组 | 中等 | +| [0852. 山脉数组的峰顶索引](https://leetcode.cn/problems/peak-index-in-a-mountain-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/peak-index-in-a-mountain-array.md) | 数组、二分查找 | 中等 | +| [0860. 柠檬水找零](https://leetcode.cn/problems/lemonade-change/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/lemonade-change.md) | 贪心、数组 | 简单 | +| [0861. 翻转矩阵后的得分](https://leetcode.cn/problems/score-after-flipping-matrix/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/score-after-flipping-matrix.md) | 贪心、位运算、数组、矩阵 | 中等 | +| [0862. 和至少为 K 的最短子数组](https://leetcode.cn/problems/shortest-subarray-with-sum-at-least-k/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/shortest-subarray-with-sum-at-least-k.md) | 队列、数组、二分查找、前缀和、滑动窗口、单调队列、堆（优先队列） | 困难 | +| [0867. 转置矩阵](https://leetcode.cn/problems/transpose-matrix/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/transpose-matrix.md) | 数组、矩阵、模拟 | 简单 | +| [0868. 二进制间距](https://leetcode.cn/problems/binary-gap/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/binary-gap.md) | 位运算 | 简单 | +| [0872. 叶子相似的树](https://leetcode.cn/problems/leaf-similar-trees/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/leaf-similar-trees.md) | 树、深度优先搜索、二叉树 | 简单 | +| [0873. 最长的斐波那契子序列的长度](https://leetcode.cn/problems/length-of-longest-fibonacci-subsequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/length-of-longest-fibonacci-subsequence.md) | 数组、哈希表、动态规划 | 中等 | +| [0875. 爱吃香蕉的珂珂](https://leetcode.cn/problems/koko-eating-bananas/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/koko-eating-bananas.md) | 数组、二分查找 | 中等 | +| [0876. 链表的中间结点](https://leetcode.cn/problems/middle-of-the-linked-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/middle-of-the-linked-list.md) | 链表、双指针 | 简单 | +| [0877. 石子游戏](https://leetcode.cn/problems/stone-game/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/stone-game.md) | 数组、数学、动态规划、博弈 | 中等 | +| [0881. 救生艇](https://leetcode.cn/problems/boats-to-save-people/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/boats-to-save-people.md) | 贪心、数组、双指针、排序 | 中等 | +| [0884. 两句话中的不常见单词](https://leetcode.cn/problems/uncommon-words-from-two-sentences/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/uncommon-words-from-two-sentences.md) | 哈希表、字符串、计数 | 简单 | +| [0886. 可能的二分法](https://leetcode.cn/problems/possible-bipartition/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/possible-bipartition.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | +| [0887. 鸡蛋掉落](https://leetcode.cn/problems/super-egg-drop/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/super-egg-drop.md) | 数学、二分查找、动态规划 | 困难 | +| [0889. 根据前序和后序遍历构造二叉树](https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-postorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/construct-binary-tree-from-preorder-and-postorder-traversal.md) | 树、数组、哈希表、分治、二叉树 | 中等 | +| [0892. 三维形体的表面积](https://leetcode.cn/problems/surface-area-of-3d-shapes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/surface-area-of-3d-shapes.md) | 几何、数组、数学、矩阵 | 简单 | +| [0897. 递增顺序搜索树](https://leetcode.cn/problems/increasing-order-search-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/increasing-order-search-tree.md) | 栈、树、深度优先搜索、二叉搜索树、二叉树 | 简单 | + + +### 第 900 ~ 999 题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0900. RLE 迭代器](https://leetcode.cn/problems/rle-iterator/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/rle-iterator.md) | 设计、数组、计数、迭代器 | 中等 | +| [0901. 股票价格跨度](https://leetcode.cn/problems/online-stock-span/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/online-stock-span.md) | 栈、设计、数据流、单调栈 | 中等 | +| [0902. 最大为 N 的数字组合](https://leetcode.cn/problems/numbers-at-most-n-given-digit-set/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/numbers-at-most-n-given-digit-set.md) | 数组、数学、字符串、二分查找、动态规划 | 困难 | +| [0904. 水果成篮](https://leetcode.cn/problems/fruit-into-baskets/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/fruit-into-baskets.md) | 数组、哈希表、滑动窗口 | 中等 | +| [0908. 最小差值 I](https://leetcode.cn/problems/smallest-range-i/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/smallest-range-i.md) | 数组、数学 | 简单 | +| [0912. 排序数组](https://leetcode.cn/problems/sort-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | +| [0918. 环形子数组的最大和](https://leetcode.cn/problems/maximum-sum-circular-subarray/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/maximum-sum-circular-subarray.md) | 队列、数组、分治、动态规划、单调队列 | 中等 | +| [0919. 完全二叉树插入器](https://leetcode.cn/problems/complete-binary-tree-inserter/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/complete-binary-tree-inserter.md) | 树、广度优先搜索、设计、二叉树 | 中等 | +| [0921. 使括号有效的最少添加](https://leetcode.cn/problems/minimum-add-to-make-parentheses-valid/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/minimum-add-to-make-parentheses-valid.md) | 栈、贪心、字符串 | 中等 | +| [0925. 长按键入](https://leetcode.cn/problems/long-pressed-name/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/long-pressed-name.md) | 双指针、字符串 | 简单 | +| [0932. 漂亮数组](https://leetcode.cn/problems/beautiful-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/beautiful-array.md) | 数组、数学、分治 | 中等 | +| [0933. 最近的请求次数](https://leetcode.cn/problems/number-of-recent-calls/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/number-of-recent-calls.md) | 设计、队列、数据流 | 简单 | +| [0935. 骑士拨号器](https://leetcode.cn/problems/knight-dialer/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/knight-dialer.md) | 动态规划 | 中等 | +| [0938. 二叉搜索树的范围和](https://leetcode.cn/problems/range-sum-of-bst/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/range-sum-of-bst.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 简单 | +| [0946. 验证栈序列](https://leetcode.cn/problems/validate-stack-sequences/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/validate-stack-sequences.md) | 栈、数组、模拟 | 中等 | +| [0947. 移除最多的同行或同列石头](https://leetcode.cn/problems/most-stones-removed-with-same-row-or-column/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/most-stones-removed-with-same-row-or-column.md) | 深度优先搜索、并查集、图、哈希表 | 中等 | +| [0953. 验证外星语词典](https://leetcode.cn/problems/verifying-an-alien-dictionary/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/verifying-an-alien-dictionary.md) | 数组、哈希表、字符串 | 简单 | +| [0958. 二叉树的完全性检验](https://leetcode.cn/problems/check-completeness-of-a-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/check-completeness-of-a-binary-tree.md) | 树、广度优先搜索、二叉树 | 中等 | +| [0959. 由斜杠划分区域](https://leetcode.cn/problems/regions-cut-by-slashes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/regions-cut-by-slashes.md) | 深度优先搜索、广度优先搜索、并查集、数组、哈希表、矩阵 | 中等 | +| [0968. 监控二叉树](https://leetcode.cn/problems/binary-tree-cameras/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/binary-tree-cameras.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | +| [0973. 最接近原点的 K 个点](https://leetcode.cn/problems/k-closest-points-to-origin/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/k-closest-points-to-origin.md) | 几何、数组、数学、分治、快速选择、排序、堆（优先队列） | 中等 | +| [0974. 和可被 K 整除的子数组](https://leetcode.cn/problems/subarray-sums-divisible-by-k/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/subarray-sums-divisible-by-k.md) | 数组、哈希表、前缀和 | 中等 | +| [0976. 三角形的最大周长](https://leetcode.cn/problems/largest-perimeter-triangle/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/largest-perimeter-triangle.md) | 贪心、数组、数学、排序 | 简单 | +| [0977. 有序数组的平方](https://leetcode.cn/problems/squares-of-a-sorted-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/squares-of-a-sorted-array.md) | 数组、双指针、排序 | 简单 | +| [0978. 最长湍流子数组](https://leetcode.cn/problems/longest-turbulent-subarray/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/longest-turbulent-subarray.md) | 数组、动态规划、滑动窗口 | 中等 | +| [0982. 按位与为零的三元组](https://leetcode.cn/problems/triples-with-bitwise-and-equal-to-zero/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/triples-with-bitwise-and-equal-to-zero.md) | 位运算、数组、哈希表 | 困难 | +| [0990. 等式方程的可满足性](https://leetcode.cn/problems/satisfiability-of-equality-equations/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/satisfiability-of-equality-equations.md) | 并查集、图、数组、字符串 | 中等 | +| [0992. K 个不同整数的子数组](https://leetcode.cn/problems/subarrays-with-k-different-integers/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/subarrays-with-k-different-integers.md) | 数组、哈希表、计数、滑动窗口 | 困难 | +| [0993. 二叉树的堂兄弟节点](https://leetcode.cn/problems/cousins-in-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/cousins-in-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0995. K 连续位的最小翻转次数](https://leetcode.cn/problems/minimum-number-of-k-consecutive-bit-flips/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/minimum-number-of-k-consecutive-bit-flips.md) | 位运算、队列、数组、前缀和、滑动窗口 | 困难 | +| [0999. 可以被一步捕获的棋子数](https://leetcode.cn/problems/available-captures-for-rook/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/available-captures-for-rook.md) | 数组、矩阵、模拟 | 简单 | + + +### 第 1000 ~ 1099 题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [1000. 合并石头的最低成本](https://leetcode.cn/problems/minimum-cost-to-merge-stones/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/minimum-cost-to-merge-stones.md) | 数组、动态规划、前缀和 | 困难 | +| [1002. 查找共用字符](https://leetcode.cn/problems/find-common-characters/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/find-common-characters.md) | 数组、哈希表、字符串 | 简单 | +| [1004. 最大连续1的个数 III](https://leetcode.cn/problems/max-consecutive-ones-iii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/max-consecutive-ones-iii.md) | 数组、二分查找、前缀和、滑动窗口 | 中等 | +| [1005. K 次取反后最大化的数组和](https://leetcode.cn/problems/maximize-sum-of-array-after-k-negations/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/maximize-sum-of-array-after-k-negations.md) | 贪心、数组、排序 | 简单 | +| [1008. 前序遍历构造二叉搜索树](https://leetcode.cn/problems/construct-binary-search-tree-from-preorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/construct-binary-search-tree-from-preorder-traversal.md) | 栈、树、二叉搜索树、数组、二叉树、单调栈 | 中等 | +| [1009. 十进制整数的反码](https://leetcode.cn/problems/complement-of-base-10-integer/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/complement-of-base-10-integer.md) | 位运算 | 简单 | +| [1011. 在 D 天内送达包裹的能力](https://leetcode.cn/problems/capacity-to-ship-packages-within-d-days/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/capacity-to-ship-packages-within-d-days.md) | 数组、二分查找 | 中等 | +| [1012. 至少有 1 位重复的数字](https://leetcode.cn/problems/numbers-with-repeated-digits/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/numbers-with-repeated-digits.md) | 数学、动态规划 | 困难 | +| [1014. 最佳观光组合](https://leetcode.cn/problems/best-sightseeing-pair/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/best-sightseeing-pair.md) | 数组、动态规划 | 中等 | +| [1020. 飞地的数量](https://leetcode.cn/problems/number-of-enclaves/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/number-of-enclaves.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | +| [1021. 删除最外层的括号](https://leetcode.cn/problems/remove-outermost-parentheses/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/remove-outermost-parentheses.md) | 栈、字符串 | 简单 | +| [1023. 驼峰式匹配](https://leetcode.cn/problems/camelcase-matching/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/camelcase-matching.md) | 字典树、数组、双指针、字符串、字符串匹配 | 中等 | +| [1025. 除数博弈](https://leetcode.cn/problems/divisor-game/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/divisor-game.md) | 脑筋急转弯、数学、动态规划、博弈 | 简单 | +| [1028. 从先序遍历还原二叉树](https://leetcode.cn/problems/recover-a-tree-from-preorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/recover-a-tree-from-preorder-traversal.md) | 树、深度优先搜索、字符串、二叉树 | 困难 | +| [1029. 两地调度](https://leetcode.cn/problems/two-city-scheduling/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/two-city-scheduling.md) | 贪心、数组、排序 | 中等 | +| [1034. 边界着色](https://leetcode.cn/problems/coloring-a-border/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/coloring-a-border.md) | 深度优先搜索、广度优先搜索、数组、矩阵 | 中等 | +| [1035. 不相交的线](https://leetcode.cn/problems/uncrossed-lines/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/uncrossed-lines.md) | 数组、动态规划 | 中等 | +| [1037. 有效的回旋镖](https://leetcode.cn/problems/valid-boomerang/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/valid-boomerang.md) | 几何、数组、数学 | 简单 | +| [1038. 从二叉搜索树到更大和树](https://leetcode.cn/problems/binary-search-tree-to-greater-sum-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/binary-search-tree-to-greater-sum-tree.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | +| [1039. 多边形三角剖分的最低得分](https://leetcode.cn/problems/minimum-score-triangulation-of-polygon/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/minimum-score-triangulation-of-polygon.md) | 数组、动态规划 | 中等 | +| [1041. 困于环中的机器人](https://leetcode.cn/problems/robot-bounded-in-circle/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/robot-bounded-in-circle.md) | 数学、字符串、模拟 | 中等 | +| [1047. 删除字符串中的所有相邻重复项](https://leetcode.cn/problems/remove-all-adjacent-duplicates-in-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/remove-all-adjacent-duplicates-in-string.md) | 栈、字符串 | 简单 | +| [1049. 最后一块石头的重量 II](https://leetcode.cn/problems/last-stone-weight-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/last-stone-weight-ii.md) | 数组、动态规划 | 中等 | +| [1051. 高度检查器](https://leetcode.cn/problems/height-checker/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/height-checker.md) | 数组、计数排序、排序 | 简单 | +| [1052. 爱生气的书店老板](https://leetcode.cn/problems/grumpy-bookstore-owner/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/grumpy-bookstore-owner.md) | 数组、滑动窗口 | 中等 | +| [1065. 字符串的索引对](https://leetcode.cn/problems/index-pairs-of-a-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/index-pairs-of-a-string.md) | 字典树、数组、字符串、排序 | 简单 | +| [1079. 活字印刷](https://leetcode.cn/problems/letter-tile-possibilities/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/letter-tile-possibilities.md) | 哈希表、字符串、回溯、计数 | 中等 | +| [1081. 不同字符的最小子序列](https://leetcode.cn/problems/smallest-subsequence-of-distinct-characters/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/smallest-subsequence-of-distinct-characters.md) | 栈、贪心、字符串、单调栈 | 中等 | +| [1089. 复写零](https://leetcode.cn/problems/duplicate-zeros/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/duplicate-zeros.md) | 数组、双指针 | 简单 | +| [1091. 二进制矩阵中的最短路径](https://leetcode.cn/problems/shortest-path-in-binary-matrix/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/shortest-path-in-binary-matrix.md) | 广度优先搜索、数组、矩阵 | 中等 | +| [1095. 山脉数组中查找目标值](https://leetcode.cn/problems/find-in-mountain-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/find-in-mountain-array.md) | 数组、二分查找、交互 | 困难 | +| [1099. 小于 K 的两数之和](https://leetcode.cn/problems/two-sum-less-than-k/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/two-sum-less-than-k.md) | 数组、双指针、二分查找、排序 | 简单 | + + +### 第 1100 ~ 1199 题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [1100. 长度为 K 的无重复字符子串](https://leetcode.cn/problems/find-k-length-substrings-with-no-repeated-characters/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/find-k-length-substrings-with-no-repeated-characters.md) | 哈希表、字符串、滑动窗口 | 中等 | +| [1103. 分糖果 II](https://leetcode.cn/problems/distribute-candies-to-people/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/distribute-candies-to-people.md) | 数学、模拟 | 简单 | +| [1108. IP 地址无效化](https://leetcode.cn/problems/defanging-an-ip-address/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/defanging-an-ip-address.md) | 字符串 | 简单 | +| [1109. 航班预订统计](https://leetcode.cn/problems/corporate-flight-bookings/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/corporate-flight-bookings.md) | 数组、前缀和 | 中等 | +| [1110. 删点成林](https://leetcode.cn/problems/delete-nodes-and-return-forest/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/delete-nodes-and-return-forest.md) | 树、深度优先搜索、数组、哈希表、二叉树 | 中等 | +| [1122. 数组的相对排序](https://leetcode.cn/problems/relative-sort-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/relative-sort-array.md) | 数组、哈希表、计数排序、排序 | 简单 | +| [1136. 并行课程](https://leetcode.cn/problems/parallel-courses/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/parallel-courses.md) | 图、拓扑排序 | 中等 | +| [1137. 第 N 个泰波那契数](https://leetcode.cn/problems/n-th-tribonacci-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/n-th-tribonacci-number.md) | 记忆化搜索、数学、动态规划 | 简单 | +| [1143. 最长公共子序列](https://leetcode.cn/problems/longest-common-subsequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/longest-common-subsequence.md) | 字符串、动态规划 | 中等 | +| [1151. 最少交换次数来组合所有的 1](https://leetcode.cn/problems/minimum-swaps-to-group-all-1s-together/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/minimum-swaps-to-group-all-1s-together.md) | 数组、滑动窗口 | 中等 | +| [1155. 掷骰子等于目标和的方法数](https://leetcode.cn/problems/number-of-dice-rolls-with-target-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/number-of-dice-rolls-with-target-sum.md) | 动态规划 | 中等 | +| [1161. 最大层内元素和](https://leetcode.cn/problems/maximum-level-sum-of-a-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/maximum-level-sum-of-a-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | +| [1176. 健身计划评估](https://leetcode.cn/problems/diet-plan-performance/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/diet-plan-performance.md) | 数组、滑动窗口 | 简单 | +| [1184. 公交站间的距离](https://leetcode.cn/problems/distance-between-bus-stops/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/distance-between-bus-stops.md) | 数组 | 简单 | + + +### 第 1200 ~ 1299 题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [1202. 交换字符串中的元素](https://leetcode.cn/problems/smallest-string-with-swaps/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/smallest-string-with-swaps.md) | 深度优先搜索、广度优先搜索、并查集、数组、哈希表、字符串、排序 | 中等 | +| [1208. 尽可能使字符串相等](https://leetcode.cn/problems/get-equal-substrings-within-budget/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/get-equal-substrings-within-budget.md) | 字符串、二分查找、前缀和、滑动窗口 | 中等 | +| [1217. 玩筹码](https://leetcode.cn/problems/minimum-cost-to-move-chips-to-the-same-position/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/minimum-cost-to-move-chips-to-the-same-position.md) | 贪心、数组、数学 | 简单 | +| [1220. 统计元音字母序列的数目](https://leetcode.cn/problems/count-vowels-permutation/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/count-vowels-permutation.md) | 动态规划 | 困难 | +| [1227. 飞机座位分配概率](https://leetcode.cn/problems/airplane-seat-assignment-probability/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/airplane-seat-assignment-probability.md) | 脑筋急转弯、数学、动态规划、概率与统计 | 中等 | +| [1229. 安排会议日程](https://leetcode.cn/problems/meeting-scheduler/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/meeting-scheduler.md) | 数组、双指针、排序 | 中等 | +| [1232. 缀点成线](https://leetcode.cn/problems/check-if-it-is-a-straight-line/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/check-if-it-is-a-straight-line.md) | 几何、数组、数学 | 简单 | +| [1245. 树的直径](https://leetcode.cn/problems/tree-diameter/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/tree-diameter.md) | 树、深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | +| [1247. 交换字符使得字符串相同](https://leetcode.cn/problems/minimum-swaps-to-make-strings-equal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/minimum-swaps-to-make-strings-equal.md) | 贪心、数学、字符串 | 中等 | +| [1253. 重构 2 行二进制矩阵](https://leetcode.cn/problems/reconstruct-a-2-row-binary-matrix/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/reconstruct-a-2-row-binary-matrix.md) | 贪心、数组、矩阵 | 中等 | +| [1254. 统计封闭岛屿的数目](https://leetcode.cn/problems/number-of-closed-islands/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/number-of-closed-islands.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | +| [1261. 在受污染的二叉树中查找元素](https://leetcode.cn/problems/find-elements-in-a-contaminated-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/find-elements-in-a-contaminated-binary-tree.md) | 树、深度优先搜索、广度优先搜索、设计、哈希表、二叉树 | 中等 | +| [1266. 访问所有点的最小时间](https://leetcode.cn/problems/minimum-time-visiting-all-points/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/minimum-time-visiting-all-points.md) | 几何、数组、数学 | 简单 | +| [1268. 搜索推荐系统](https://leetcode.cn/problems/search-suggestions-system/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/search-suggestions-system.md) | 字典树、数组、字符串、二分查找、排序、堆（优先队列） | 中等 | +| [1281. 整数的各位积和之差](https://leetcode.cn/problems/subtract-the-product-and-sum-of-digits-of-an-integer/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/subtract-the-product-and-sum-of-digits-of-an-integer.md) | 数学 | 简单 | +| [1296. 划分数组为连续数字的集合](https://leetcode.cn/problems/divide-array-in-sets-of-k-consecutive-numbers/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/divide-array-in-sets-of-k-consecutive-numbers.md) | 贪心、数组、哈希表、排序 | 中等 | + + +### 第 1300 ~ 1399 题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [1300. 转变数组后最接近目标值的数组和](https://leetcode.cn/problems/sum-of-mutated-array-closest-to-target/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/sum-of-mutated-array-closest-to-target.md) | 数组、二分查找、排序 | 中等 | +| [1305. 两棵二叉搜索树中的所有元素](https://leetcode.cn/problems/all-elements-in-two-binary-search-trees/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/all-elements-in-two-binary-search-trees.md) | 树、深度优先搜索、二叉搜索树、二叉树、排序 | 中等 | +| [1310. 子数组异或查询](https://leetcode.cn/problems/xor-queries-of-a-subarray/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/xor-queries-of-a-subarray.md) | 位运算、数组、前缀和 | 中等 | +| [1313. 解压缩编码列表](https://leetcode.cn/problems/decompress-run-length-encoded-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/decompress-run-length-encoded-list.md) | 数组 | 简单 | +| [1317. 将整数转换为两个无零整数的和](https://leetcode.cn/problems/convert-integer-to-the-sum-of-two-no-zero-integers/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/convert-integer-to-the-sum-of-two-no-zero-integers.md) | 数学 | 简单 | +| [1319. 连通网络的操作次数](https://leetcode.cn/problems/number-of-operations-to-make-network-connected/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/number-of-operations-to-make-network-connected.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | +| [1324. 竖直打印单词](https://leetcode.cn/problems/print-words-vertically/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/print-words-vertically.md) | 数组、字符串、模拟 | 中等 | +| [1338. 数组大小减半](https://leetcode.cn/problems/reduce-array-size-to-the-half/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/reduce-array-size-to-the-half.md) | 贪心、数组、哈希表、排序、堆（优先队列） | 中等 | +| [1343. 大小为 K 且平均值大于等于阈值的子数组数目](https://leetcode.cn/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold.md) | 数组、滑动窗口 | 中等 | +| [1344. 时钟指针的夹角](https://leetcode.cn/problems/angle-between-hands-of-a-clock/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/angle-between-hands-of-a-clock.md) | 数学 | 中等 | +| [1347. 制造字母异位词的最小步骤数](https://leetcode.cn/problems/minimum-number-of-steps-to-make-two-strings-anagram/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/minimum-number-of-steps-to-make-two-strings-anagram.md) | 哈希表、字符串、计数 | 中等 | +| [1349. 参加考试的最大学生数](https://leetcode.cn/problems/maximum-students-taking-exam/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/maximum-students-taking-exam.md) | 位运算、数组、动态规划、状态压缩、矩阵 | 困难 | +| [1358. 包含所有三种字符的子字符串数目](https://leetcode.cn/problems/number-of-substrings-containing-all-three-characters/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/number-of-substrings-containing-all-three-characters.md) | 哈希表、字符串、滑动窗口 | 中等 | +| [1362. 最接近的因数](https://leetcode.cn/problems/closest-divisors/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/closest-divisors.md) | 数学 | 中等 | +| [1381. 设计一个支持增量操作的栈](https://leetcode.cn/problems/design-a-stack-with-increment-operation/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/design-a-stack-with-increment-operation.md) | 栈、设计、数组 | 中等 | + + +### 第 1400 ~ 1499 题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [1400. 构造 K 个回文字符串](https://leetcode.cn/problems/construct-k-palindrome-strings/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/construct-k-palindrome-strings.md) | 贪心、哈希表、字符串、计数 | 中等 | +| [1408. 数组中的字符串匹配](https://leetcode.cn/problems/string-matching-in-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/string-matching-in-an-array.md) | 数组、字符串、字符串匹配 | 简单 | +| [1422. 分割字符串的最大得分](https://leetcode.cn/problems/maximum-score-after-splitting-a-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/maximum-score-after-splitting-a-string.md) | 字符串、前缀和 | 简单 | +| [1423. 可获得的最大点数](https://leetcode.cn/problems/maximum-points-you-can-obtain-from-cards/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/maximum-points-you-can-obtain-from-cards.md) | 数组、前缀和、滑动窗口 | 中等 | +| [1438. 绝对差不超过限制的最长连续子数组](https://leetcode.cn/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.md) | 队列、数组、有序集合、滑动窗口、单调队列、堆（优先队列） | 中等 | +| [1446. 连续字符](https://leetcode.cn/problems/consecutive-characters/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/consecutive-characters.md) | 字符串 | 简单 | +| [1447. 最简分数](https://leetcode.cn/problems/simplified-fractions/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/simplified-fractions.md) | 数学、字符串、数论 | 中等 | +| [1449. 数位成本和为目标值的最大数字](https://leetcode.cn/problems/form-largest-integer-with-digits-that-add-up-to-target/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/form-largest-integer-with-digits-that-add-up-to-target.md) | 数组、动态规划 | 困难 | +| [1450. 在既定时间做作业的学生人数](https://leetcode.cn/problems/number-of-students-doing-homework-at-a-given-time/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/number-of-students-doing-homework-at-a-given-time.md) | 数组 | 简单 | +| [1451. 重新排列句子中的单词](https://leetcode.cn/problems/rearrange-words-in-a-sentence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/rearrange-words-in-a-sentence.md) | 字符串、排序 | 中等 | +| [1456. 定长子串中元音的最大数目](https://leetcode.cn/problems/maximum-number-of-vowels-in-a-substring-of-given-length/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/maximum-number-of-vowels-in-a-substring-of-given-length.md) | 字符串、滑动窗口 | 中等 | +| [1476. 子矩形查询](https://leetcode.cn/problems/subrectangle-queries/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/subrectangle-queries.md) | 设计、数组、矩阵 | 中等 | +| [1480. 一维数组的动态和](https://leetcode.cn/problems/running-sum-of-1d-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/running-sum-of-1d-array.md) | 数组、前缀和 | 简单 | +| [1482. 制作 m 束花所需的最少天数](https://leetcode.cn/problems/minimum-number-of-days-to-make-m-bouquets/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/minimum-number-of-days-to-make-m-bouquets.md) | 数组、二分查找 | 中等 | +| [1486. 数组异或操作](https://leetcode.cn/problems/xor-operation-in-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/xor-operation-in-an-array.md) | 位运算、数学 | 简单 | +| [1491. 去掉最低工资和最高工资后的工资平均值](https://leetcode.cn/problems/average-salary-excluding-the-minimum-and-maximum-salary/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/average-salary-excluding-the-minimum-and-maximum-salary.md) | 数组、排序 | 简单 | +| [1493. 删掉一个元素以后全为 1 的最长子数组](https://leetcode.cn/problems/longest-subarray-of-1s-after-deleting-one-element/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/longest-subarray-of-1s-after-deleting-one-element.md) | 数组、动态规划、滑动窗口 | 中等 | +| [1496. 判断路径是否相交](https://leetcode.cn/problems/path-crossing/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/path-crossing.md) | 哈希表、字符串 | 简单 | + + +### 第 1500 ~ 1599 题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [1502. 判断能否形成等差数列](https://leetcode.cn/problems/can-make-arithmetic-progression-from-sequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/can-make-arithmetic-progression-from-sequence.md) | 数组、排序 | 简单 | +| [1507. 转变日期格式](https://leetcode.cn/problems/reformat-date/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/reformat-date.md) | 字符串 | 简单 | +| [1523. 在区间范围内统计奇数数目](https://leetcode.cn/problems/count-odd-numbers-in-an-interval-range/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/count-odd-numbers-in-an-interval-range.md) | 数学 | 简单 | +| [1534. 统计好三元组](https://leetcode.cn/problems/count-good-triplets/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/count-good-triplets.md) | 数组、枚举 | 简单 | +| [1547. 切棍子的最小成本](https://leetcode.cn/problems/minimum-cost-to-cut-a-stick/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/minimum-cost-to-cut-a-stick.md) | 数组、动态规划、排序 | 困难 | +| [1551. 使数组中所有元素相等的最小操作数](https://leetcode.cn/problems/minimum-operations-to-make-array-equal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/minimum-operations-to-make-array-equal.md) | 数学 | 中等 | +| [1556. 千位分隔数](https://leetcode.cn/problems/thousand-separator/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/thousand-separator.md) | 字符串 | 简单 | +| [1561. 你可以获得的最大硬币数目](https://leetcode.cn/problems/maximum-number-of-coins-you-can-get/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/maximum-number-of-coins-you-can-get.md) | 贪心、数组、数学、博弈、排序 | 中等 | +| [1567. 乘积为正数的最长子数组长度](https://leetcode.cn/problems/maximum-length-of-subarray-with-positive-product/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/maximum-length-of-subarray-with-positive-product.md) | 贪心、数组、动态规划 | 中等 | +| [1582. 二进制矩阵中的特殊位置](https://leetcode.cn/problems/special-positions-in-a-binary-matrix/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/special-positions-in-a-binary-matrix.md) | 数组、矩阵 | 简单 | +| [1584. 连接所有点的最小费用](https://leetcode.cn/problems/min-cost-to-connect-all-points/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/min-cost-to-connect-all-points.md) | 并查集、图、数组、最小生成树 | 中等 | +| [1593. 拆分字符串使唯一子字符串的数目最大](https://leetcode.cn/problems/split-a-string-into-the-max-number-of-unique-substrings/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/split-a-string-into-the-max-number-of-unique-substrings.md) | 哈希表、字符串、回溯 | 中等 | +| [1595. 连通两组点的最小成本](https://leetcode.cn/problems/minimum-cost-to-connect-two-groups-of-points/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/minimum-cost-to-connect-two-groups-of-points.md) | 位运算、数组、动态规划、状态压缩、矩阵 | 困难 | + + +### 第 1600 ~ 1699 题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [1603. 设计停车系统](https://leetcode.cn/problems/design-parking-system/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/design-parking-system.md) | 设计、计数、模拟 | 简单 | +| [1605. 给定行和列的和求可行矩阵](https://leetcode.cn/problems/find-valid-matrix-given-row-and-column-sums/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/find-valid-matrix-given-row-and-column-sums.md) | 贪心、数组、矩阵 | 中等 | +| [1614. 括号的最大嵌套深度](https://leetcode.cn/problems/maximum-nesting-depth-of-the-parentheses/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/maximum-nesting-depth-of-the-parentheses.md) | 栈、字符串 | 简单 | +| [1617. 统计子树中城市之间最大距离](https://leetcode.cn/problems/count-subtrees-with-max-distance-between-cities/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/count-subtrees-with-max-distance-between-cities.md) | 位运算、树、动态规划、状态压缩、枚举 | 困难 | +| [1631. 最小体力消耗路径](https://leetcode.cn/problems/path-with-minimum-effort/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/path-with-minimum-effort.md) | 深度优先搜索、广度优先搜索、并查集、数组、二分查找、矩阵、堆（优先队列） | 中等 | +| [1641. 统计字典序元音字符串的数目](https://leetcode.cn/problems/count-sorted-vowel-strings/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/count-sorted-vowel-strings.md) | 数学、动态规划、组合数学 | 中等 | +| [1646. 获取生成数组中的最大值](https://leetcode.cn/problems/get-maximum-in-generated-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/get-maximum-in-generated-array.md) | 数组、模拟 | 简单 | +| [1647. 字符频次唯一的最小删除次数](https://leetcode.cn/problems/minimum-deletions-to-make-character-frequencies-unique/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/minimum-deletions-to-make-character-frequencies-unique.md) | 贪心、哈希表、字符串、排序 | 中等 | +| [1657. 确定两个字符串是否接近](https://leetcode.cn/problems/determine-if-two-strings-are-close/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/determine-if-two-strings-are-close.md) | 哈希表、字符串、计数、排序 | 中等 | +| [1658. 将 x 减到 0 的最小操作数](https://leetcode.cn/problems/minimum-operations-to-reduce-x-to-zero/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/minimum-operations-to-reduce-x-to-zero.md) | 数组、哈希表、二分查找、前缀和、滑动窗口 | 中等 | +| [1672. 最富有客户的资产总量](https://leetcode.cn/problems/richest-customer-wealth/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/richest-customer-wealth.md) | 数组、矩阵 | 简单 | +| [1695. 删除子数组的最大得分](https://leetcode.cn/problems/maximum-erasure-value/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/maximum-erasure-value.md) | 数组、哈希表、滑动窗口 | 中等 | +| [1698. 字符串的不同子字符串个数](https://leetcode.cn/problems/number-of-distinct-substrings-in-a-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/number-of-distinct-substrings-in-a-string.md) | 字典树、字符串、后缀数组、哈希函数、滚动哈希 | 中等 | + + +### 第 1700 ~ 1799 题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [1710. 卡车上的最大单元数](https://leetcode.cn/problems/maximum-units-on-a-truck/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/maximum-units-on-a-truck.md) | 贪心、数组、排序 | 简单 | +| [1716. 计算力扣银行的钱](https://leetcode.cn/problems/calculate-money-in-leetcode-bank/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/calculate-money-in-leetcode-bank.md) | 数学 | 简单 | +| [1720. 解码异或后的数组](https://leetcode.cn/problems/decode-xored-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/decode-xored-array.md) | 位运算、数组 | 简单 | +| [1726. 同积元组](https://leetcode.cn/problems/tuple-with-same-product/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/tuple-with-same-product.md) | 数组、哈希表、计数 | 中等 | +| [1736. 替换隐藏数字得到的最晚时间](https://leetcode.cn/problems/latest-time-by-replacing-hidden-digits/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/latest-time-by-replacing-hidden-digits.md) | 贪心、字符串 | 简单 | +| [1742. 盒子中小球的最大数量](https://leetcode.cn/problems/maximum-number-of-balls-in-a-box/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/maximum-number-of-balls-in-a-box.md) | 哈希表、数学、计数 | 简单 | +| [1749. 任意子数组和的绝对值的最大值](https://leetcode.cn/problems/maximum-absolute-sum-of-any-subarray/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/maximum-absolute-sum-of-any-subarray.md) | 数组、动态规划 | 中等 | +| [1763. 最长的美好子字符串](https://leetcode.cn/problems/longest-nice-substring/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/longest-nice-substring.md) | 位运算、哈希表、字符串、分治、滑动窗口 | 简单 | +| [1779. 找到最近的有相同 X 或 Y 坐标的点](https://leetcode.cn/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/find-nearest-point-that-has-the-same-x-or-y-coordinate.md) | 数组 | 简单 | +| [1790. 仅执行一次字符串交换能否使两个字符串相等](https://leetcode.cn/problems/check-if-one-string-swap-can-make-strings-equal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/check-if-one-string-swap-can-make-strings-equal.md) | 哈希表、字符串、计数 | 简单 | +| [1791. 找出星型图的中心节点](https://leetcode.cn/problems/find-center-of-star-graph/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/find-center-of-star-graph.md) | 图 | 简单 | + + +### 第 1800 ~ 1899 题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [1822. 数组元素积的符号](https://leetcode.cn/problems/sign-of-the-product-of-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1800-1899/sign-of-the-product-of-an-array.md) | 数组、数学 | 简单 | +| [1827. 最少操作使数组递增](https://leetcode.cn/problems/minimum-operations-to-make-the-array-increasing/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1800-1899/minimum-operations-to-make-the-array-increasing.md) | 贪心、数组 | 简单 | +| [1833. 雪糕的最大数量](https://leetcode.cn/problems/maximum-ice-cream-bars/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1800-1899/maximum-ice-cream-bars.md) | 贪心、数组、计数排序、排序 | 中等 | +| [1844. 将所有数字用字符替换](https://leetcode.cn/problems/replace-all-digits-with-characters/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1800-1899/replace-all-digits-with-characters.md) | 字符串 | 简单 | +| [1858. 包含所有前缀的最长单词](https://leetcode.cn/problems/longest-word-with-all-prefixes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1800-1899/longest-word-with-all-prefixes.md) | 深度优先搜索、字典树、数组、字符串 | 中等 | +| [1859. 将句子排序](https://leetcode.cn/problems/sorting-the-sentence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1800-1899/sorting-the-sentence.md) | 字符串、排序 | 简单 | +| [1876. 长度为三且各字符不同的子字符串](https://leetcode.cn/problems/substrings-of-size-three-with-distinct-characters/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1800-1899/substrings-of-size-three-with-distinct-characters.md) | 哈希表、字符串、计数、滑动窗口 | 简单 | +| [1877. 数组中最大数对和的最小值](https://leetcode.cn/problems/minimize-maximum-pair-sum-in-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1800-1899/minimize-maximum-pair-sum-in-array.md) | 贪心、数组、双指针、排序 | 中等 | +| [1879. 两个数组最小的异或值之和](https://leetcode.cn/problems/minimum-xor-sum-of-two-arrays/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1800-1899/minimum-xor-sum-of-two-arrays.md) | 位运算、数组、动态规划、状态压缩 | 困难 | +| [1893. 检查是否区域内所有整数都被覆盖](https://leetcode.cn/problems/check-if-all-the-integers-in-a-range-are-covered/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1800-1899/check-if-all-the-integers-in-a-range-are-covered.md) | 数组、哈希表、前缀和 | 简单 | +| [1897. 重新分配字符使所有字符串都相等](https://leetcode.cn/problems/redistribute-characters-to-make-all-strings-equal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1800-1899/redistribute-characters-to-make-all-strings-equal.md) | 哈希表、字符串、计数 | 简单 | + + +### 第 1900 ~ 1999 题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [1903. 字符串中的最大奇数](https://leetcode.cn/problems/largest-odd-number-in-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/largest-odd-number-in-string.md) | 贪心、数学、字符串 | 简单 | +| [1921. 消灭怪物的最大数量](https://leetcode.cn/problems/eliminate-maximum-number-of-monsters/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/eliminate-maximum-number-of-monsters.md) | 贪心、数组、排序 | 中等 | +| [1925. 统计平方和三元组的数目](https://leetcode.cn/problems/count-square-sum-triples/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/count-square-sum-triples.md) | 数学、枚举 | 简单 | +| [1929. 数组串联](https://leetcode.cn/problems/concatenation-of-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/concatenation-of-array.md) | 数组、模拟 | 简单 | +| [1930. 长度为 3 的不同回文子序列](https://leetcode.cn/problems/unique-length-3-palindromic-subsequences/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/unique-length-3-palindromic-subsequences.md) | 位运算、哈希表、字符串、前缀和 | 中等 | +| [1936. 新增的最少台阶数](https://leetcode.cn/problems/add-minimum-number-of-rungs/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/add-minimum-number-of-rungs.md) | 贪心、数组 | 中等 | +| [1941. 检查是否所有字符出现次数相同](https://leetcode.cn/problems/check-if-all-characters-have-equal-number-of-occurrences/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/check-if-all-characters-have-equal-number-of-occurrences.md) | 哈希表、字符串、计数 | 简单 | +| [1947. 最大兼容性评分和](https://leetcode.cn/problems/maximum-compatibility-score-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/maximum-compatibility-score-sum.md) | 位运算、数组、动态规划、回溯、状态压缩 | 中等 | +| [1984. 学生分数的最小差值](https://leetcode.cn/problems/minimum-difference-between-highest-and-lowest-of-k-scores/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/minimum-difference-between-highest-and-lowest-of-k-scores.md) | 数组、排序、滑动窗口 | 简单 | +| [1986. 完成任务的最少工作时间段](https://leetcode.cn/problems/minimum-number-of-work-sessions-to-finish-the-tasks/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/minimum-number-of-work-sessions-to-finish-the-tasks.md) | 位运算、数组、动态规划、回溯、状态压缩 | 中等 | +| [1991. 找到数组的中间位置](https://leetcode.cn/problems/find-the-middle-index-in-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/find-the-middle-index-in-array.md) | 数组、前缀和 | 简单 | +| [1994. 好子集的数目](https://leetcode.cn/problems/the-number-of-good-subsets/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/the-number-of-good-subsets.md) | 位运算、数组、数学、动态规划、状态压缩 | 困难 | + + +### 第 2000 ~ 2099 题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [2011. 执行操作后的变量值](https://leetcode.cn/problems/final-value-of-variable-after-performing-operations/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2000-2099/final-value-of-variable-after-performing-operations.md) | 数组、字符串、模拟 | 简单 | +| [2023. 连接后等于目标字符串的字符串对](https://leetcode.cn/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2000-2099/number-of-pairs-of-strings-with-concatenation-equal-to-target.md) | 数组、哈希表、字符串、计数 | 中等 | +| [2050. 并行课程 III](https://leetcode.cn/problems/parallel-courses-iii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2000-2099/parallel-courses-iii.md) | 图、拓扑排序、数组、动态规划 | 困难 | + + +### 第 2100 ~ 2199 题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [2156. 查找给定哈希值的子串](https://leetcode.cn/problems/find-substring-with-given-hash-value/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2100-2199/find-substring-with-given-hash-value.md) | 字符串、滑动窗口、哈希函数、滚动哈希 | 困难 | +| [2172. 数组的最大与和](https://leetcode.cn/problems/maximum-and-sum-of-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2100-2199/maximum-and-sum-of-array.md) | 位运算、数组、动态规划、状态压缩 | 困难 | + + +### 第 2200 ~ 2299 题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [2235. 两整数相加](https://leetcode.cn/problems/add-two-integers/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2200-2299/add-two-integers.md) | 数学 | 简单 | +| [2246. 相邻字符不同的最长路径](https://leetcode.cn/problems/longest-path-with-different-adjacent-characters/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2200-2299/longest-path-with-different-adjacent-characters.md) | 树、深度优先搜索、图、拓扑排序、数组、字符串 | 困难 | +| [2249. 统计圆内格点数目](https://leetcode.cn/problems/count-lattice-points-inside-a-circle/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2200-2299/count-lattice-points-inside-a-circle.md) | 几何、数组、哈希表、数学、枚举 | 中等 | +| [2276. 统计区间中的整数数目](https://leetcode.cn/problems/count-integers-in-intervals/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2200-2299/count-integers-in-intervals.md) | 设计、线段树、有序集合 | 困难 | + + +### 第 2300 ~ 2399 题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [2376. 统计特殊整数](https://leetcode.cn/problems/count-special-integers/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2300-2399/count-special-integers.md) | 数学、动态规划 | 困难 | + + +### 第 2400 ~ 2499 题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [2427. 公因子的数目](https://leetcode.cn/problems/number-of-common-factors/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2400-2499/number-of-common-factors.md) | 数学、枚举、数论 | 简单 | + + +### 第 2500 ~ 2599 题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [2538. 最大价值和与最小价值和的差值](https://leetcode.cn/problems/difference-between-maximum-and-minimum-price-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2500-2599/difference-between-maximum-and-minimum-price-sum.md) | 树、深度优先搜索、数组、动态规划 | 困难 | +| [2585. 获得分数的方法数](https://leetcode.cn/problems/number-of-ways-to-earn-points/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2500-2599/number-of-ways-to-earn-points.md) | 数组、动态规划 | 困难 | + + +### 第 2700 ~ 2799 题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [2719. 统计整数数目](https://leetcode.cn/problems/count-of-integers/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2700-2799/count-of-integers.md) | 数学、字符串、动态规划 | 困难 | + + +### LCR 系列 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [LCR 001. 两数相除](https://leetcode.cn/problems/xoh6Oh/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/xoh6Oh.md) | 数学 | 简单 | +| [LCR 002. 二进制求和](https://leetcode.cn/problems/JFETK5/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/JFETK5.md) | 位运算、数学、字符串、模拟 | 简单 | +| [LCR 003. 比特位计数](https://leetcode.cn/problems/w3tCBm/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/w3tCBm.md) | 位运算、动态规划 | 简单 | +| [LCR 004. 只出现一次的数字 II](https://leetcode.cn/problems/WGki4K/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/WGki4K.md) | 位运算、数组 | 中等 | +| [LCR 005. 最大单词长度乘积](https://leetcode.cn/problems/aseY1I/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/aseY1I.md) | 位运算、数组、字符串 | 中等 | +| [LCR 006. 两数之和 II - 输入有序数组](https://leetcode.cn/problems/kLl5u1/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/kLl5u1.md) | 数组、双指针、二分查找 | 简单 | +| [LCR 007. 三数之和](https://leetcode.cn/problems/1fGaJU/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/1fGaJU.md) | 数组、双指针、排序 | 中等 | +| [LCR 008. 长度最小的子数组](https://leetcode.cn/problems/2VG8Kg/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/2VG8Kg.md) | 数组、二分查找、前缀和、滑动窗口 | 中等 | +| [LCR 009. 乘积小于 K 的子数组](https://leetcode.cn/problems/ZVAVXX/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/ZVAVXX.md) | 数组、滑动窗口 | 中等 | +| [LCR 010. 和为 K 的子数组](https://leetcode.cn/problems/QTMn0o/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/QTMn0o.md) | 数组、哈希表、前缀和 | 中等 | +| [LCR 011. 连续数组](https://leetcode.cn/problems/A1NYOS/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/A1NYOS.md) | 数组、哈希表、前缀和 | 中等 | +| [LCR 012. 寻找数组的中心下标](https://leetcode.cn/problems/tvdfij/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/tvdfij.md) | 数组、前缀和 | 简单 | +| [LCR 013. 二维区域和检索 - 矩阵不可变](https://leetcode.cn/problems/O4NDxx/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/O4NDxx.md) | 设计、数组、矩阵、前缀和 | 中等 | +| [LCR 016. 无重复字符的最长子串](https://leetcode.cn/problems/wtcaE1/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/wtcaE1.md) | 哈希表、字符串、滑动窗口 | 中等 | +| [LCR 017. 最小覆盖子串](https://leetcode.cn/problems/M1oyTv/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/M1oyTv.md) | 哈希表、字符串、滑动窗口 | 困难 | +| [LCR 018. 验证回文串](https://leetcode.cn/problems/XltzEq/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/XltzEq.md) | 双指针、字符串 | 简单 | +| [LCR 019. 验证回文串 II](https://leetcode.cn/problems/RQku0D/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/RQku0D.md) | 贪心、双指针、字符串 | 简单 | +| [LCR 020. 回文子串](https://leetcode.cn/problems/a7VOhD/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/a7VOhD.md) | 字符串、动态规划 | 中等 | +| [LCR 021. 删除链表的倒数第 N 个结点](https://leetcode.cn/problems/SLwz0R/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/SLwz0R.md) | 链表、双指针 | 中等 | +| [LCR 022. 环形链表 II](https://leetcode.cn/problems/c32eOV/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/c32eOV.md) | 哈希表、链表、双指针 | 中等 | +| [LCR 023. 相交链表](https://leetcode.cn/problems/3u1WK4/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/3u1WK4.md) | 哈希表、链表、双指针 | 简单 | +| [LCR 024. 反转链表](https://leetcode.cn/problems/UHnkqh/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/UHnkqh.md) | 递归、链表 | 简单 | +| [LCR 025. 两数相加 II](https://leetcode.cn/problems/lMSNwu/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/lMSNwu.md) | 栈、链表、数学 | 中等 | +| [LCR 026. 重排链表](https://leetcode.cn/problems/LGjMqU/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/LGjMqU.md) | 栈、递归、链表、双指针 | 中等 | +| [LCR 027. 回文链表](https://leetcode.cn/problems/aMhZSa/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/aMhZSa.md) | 栈、递归、链表、双指针 | 简单 | +| [LCR 028. 扁平化多级双向链表](https://leetcode.cn/problems/Qv1Da2/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/Qv1Da2.md) | 深度优先搜索、链表、双向链表 | 中等 | +| [LCR 029. 循环有序列表的插入](https://leetcode.cn/problems/4ueAj6/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/4ueAj6.md) | 链表 | 中等 | +| [LCR 030. O(1) 时间插入、删除和获取随机元素](https://leetcode.cn/problems/FortPu/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/FortPu.md) | 设计、数组、哈希表、数学、随机化 | 中等 | +| [LCR 031. LRU 缓存](https://leetcode.cn/problems/OrIXps/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/OrIXps.md) | 设计、哈希表、链表、双向链表 | 中等 | +| [LCR 032. 有效的字母异位词](https://leetcode.cn/problems/dKk3P7/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/dKk3P7.md) | 哈希表、字符串、排序 | 简单 | +| [LCR 033. 字母异位词分组](https://leetcode.cn/problems/sfvd7V/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/sfvd7V.md) | 数组、哈希表、字符串、排序 | 中等 | +| [LCR 034. 验证外星语词典](https://leetcode.cn/problems/lwyVBB/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/lwyVBB.md) | 数组、哈希表、字符串 | 简单 | +| [LCR 035. 最小时间差](https://leetcode.cn/problems/569nqc/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/569nqc.md) | 数组、数学、字符串、排序 | 中等 | +| [LCR 036. 逆波兰表达式求值](https://leetcode.cn/problems/8Zf90G/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/8Zf90G.md) | 栈、数组、数学 | 中等 | +| [LCR 037. 行星碰撞](https://leetcode.cn/problems/XagZNi/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/XagZNi.md) | 栈、数组、模拟 | 中等 | +| [LCR 038. 每日温度](https://leetcode.cn/problems/iIQa4I/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/iIQa4I.md) | 栈、数组、单调栈 | 中等 | +| [LCR 039. 柱状图中最大的矩形](https://leetcode.cn/problems/0ynMMM/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/0ynMMM.md) | 栈、数组、单调栈 | 困难 | +| [LCR 041. 数据流中的移动平均值](https://leetcode.cn/problems/qIsx9U/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/qIsx9U.md) | 设计、队列、数组、数据流 | 简单 | +| [LCR 042. 最近的请求次数](https://leetcode.cn/problems/H8086Q/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/H8086Q.md) | 设计、队列、数据流 | 简单 | +| [LCR 043. 完全二叉树插入器](https://leetcode.cn/problems/NaqhDT/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/NaqhDT.md) | 树、广度优先搜索、设计、二叉树 | 中等 | +| [LCR 044. 在每个树行中找最大值](https://leetcode.cn/problems/hPov7L/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/hPov7L.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | +| [LCR 045. 找树左下角的值](https://leetcode.cn/problems/LwUNpT/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/LwUNpT.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | +| [LCR 046. 二叉树的右视图](https://leetcode.cn/problems/WNC0Lk/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/WNC0Lk.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | +| [LCR 047. 二叉树剪枝](https://leetcode.cn/problems/pOCWxh/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/pOCWxh.md) | 树、深度优先搜索、二叉树 | 中等 | +| [LCR 048. 二叉树的序列化与反序列化](https://leetcode.cn/problems/h54YBf/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/h54YBf.md) | 树、深度优先搜索、广度优先搜索、设计、字符串、二叉树 | 困难 | +| [LCR 049. 求根节点到叶节点数字之和](https://leetcode.cn/problems/3Etpl5/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/3Etpl5.md) | 树、深度优先搜索、二叉树 | 中等 | +| [LCR 050. 路径总和 III](https://leetcode.cn/problems/6eUYwP/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/6eUYwP.md) | 树、深度优先搜索、二叉树 | 中等 | +| [LCR 051. 二叉树中的最大路径和](https://leetcode.cn/problems/jC7MId/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/jC7MId.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | +| [LCR 052. 递增顺序搜索树](https://leetcode.cn/problems/NYBBNL/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/NYBBNL.md) | 栈、树、深度优先搜索、二叉搜索树、二叉树 | 简单 | +| [LCR 053. 二叉搜索树中的中序后继](https://leetcode.cn/problems/P5rCT8/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/P5rCT8.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | +| [LCR 054. 把二叉搜索树转换为累加树](https://leetcode.cn/problems/w6cpku/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/w6cpku.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | +| [LCR 055. 二叉搜索树迭代器](https://leetcode.cn/problems/kTOapQ/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/kTOapQ.md) | 栈、树、设计、二叉搜索树、二叉树、迭代器 | 中等 | +| [LCR 056. 两数之和 IV - 输入二叉搜索树](https://leetcode.cn/problems/opLdQZ/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/opLdQZ.md) | 数组、滑动窗口 | 简单 | +| [LCR 057. 存在重复元素 III](https://leetcode.cn/problems/7WqeDu/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/7WqeDu.md) | 数组、桶排序、有序集合、排序、滑动窗口 | 中等 | +| [LCR 059. 数据流中的第 K 大元素](https://leetcode.cn/problems/jBjn9C/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/jBjn9C.md) | 树、设计、二叉搜索树、二叉树、数据流、堆（优先队列） | 简单 | +| [LCR 060. 前 K 个高频元素](https://leetcode.cn/problems/g5c51o/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/g5c51o.md) | 数组、哈希表、分治、桶排序、计数、快速选择、排序、堆（优先队列） | 中等 | +| [LCR 062. 实现 Trie (前缀树)](https://leetcode.cn/problems/QC3q1f/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/QC3q1f.md) | 设计、字典树、哈希表、字符串 | 中等 | +| [LCR 063. 单词替换](https://leetcode.cn/problems/UhWRSj/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/UhWRSj.md) | 字典树、数组、哈希表、字符串 | 中等 | +| [LCR 064. 实现一个魔法字典](https://leetcode.cn/problems/US1pGT/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/US1pGT.md) | 深度优先搜索、设计、字典树、哈希表、字符串 | 中等 | +| [LCR 065. 单词的压缩编码](https://leetcode.cn/problems/iSwD2y/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/iSwD2y.md) | 字典树、数组、哈希表、字符串 | 中等 | +| [LCR 066. 键值映射](https://leetcode.cn/problems/z1R5dt/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/z1R5dt.md) | 设计、字典树、哈希表、字符串 | 中等 | +| [LCR 067. 数组中两个数的最大异或值](https://leetcode.cn/problems/ms70jA/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/ms70jA.md) | 位运算、字典树、数组、哈希表 | 中等 | +| [LCR 068. 搜索插入位置](https://leetcode.cn/problems/N6YdxV/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/N6YdxV.md) | 数组、二分查找 | 简单 | +| [LCR 072. x 的平方根](https://leetcode.cn/problems/jJ0w9p/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/jJ0w9p.md) | 数学、二分查找 | 简单 | +| [LCR 073. 爱吃香蕉的狒狒](https://leetcode.cn/problems/nZZqjQ/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/nZZqjQ.md) | 数组、二分查找 | 中等 | +| [LCR 074. 合并区间](https://leetcode.cn/problems/SsGoHC/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/SsGoHC.md) | 数组、排序 | 中等 | +| [LCR 075. 数组的相对排序](https://leetcode.cn/problems/0H97ZC/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/0H97ZC.md) | 数组、哈希表、计数排序、排序 | 简单 | +| [LCR 076. 数组中的第 K 个最大元素](https://leetcode.cn/problems/xx4gT2/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/xx4gT2.md) | 数组、分治、快速选择、排序、堆（优先队列） | 中等 | +| [LCR 077. 排序链表](https://leetcode.cn/problems/7WHec2/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/7WHec2.md) | 链表、双指针、分治、排序、归并排序 | 中等 | +| [LCR 078. 合并 K 个升序链表](https://leetcode.cn/problems/vvXgSW/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/vvXgSW.md) | 链表、分治、堆（优先队列）、归并排序 | 困难 | +| [LCR 079. 子集](https://leetcode.cn/problems/TVdhkn/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/TVdhkn.md) | 位运算、数组、回溯 | 中等 | +| [LCR 080. 组合](https://leetcode.cn/problems/uUsW3B/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/uUsW3B.md) | 数组、回溯 | 中等 | +| [LCR 081. 组合总和](https://leetcode.cn/problems/Ygoe9J/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/Ygoe9J.md) | 数组、回溯 | 中等 | +| [LCR 082. 组合总和 II](https://leetcode.cn/problems/4sjJUc/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/4sjJUc.md) | 数组、回溯 | 中等 | +| [LCR 083. 全排列](https://leetcode.cn/problems/VvJkup/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/VvJkup.md) | 数组、回溯 | 中等 | +| [LCR 084. 全排列 II](https://leetcode.cn/problems/7p8L0Z/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/7p8L0Z.md) | 数组、回溯 | 中等 | +| [LCR 085. 括号生成](https://leetcode.cn/problems/IDBivT/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/IDBivT.md) | 字符串、动态规划、回溯 | 中等 | +| [LCR 086. 分割回文串](https://leetcode.cn/problems/M99OJA/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/M99OJA.md) | 深度优先搜索、广度优先搜索、图、哈希表 | 中等 | +| [LCR 087. 复原 IP 地址](https://leetcode.cn/problems/0on3uN/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/0on3uN.md) | 字符串、回溯 | 中等 | +| [LCR 088. 使用最小花费爬楼梯](https://leetcode.cn/problems/GzCJIP/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/GzCJIP.md) | 数组、动态规划 | 简单 | +| [LCR 089. 打家劫舍](https://leetcode.cn/problems/Gu0c2T/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/Gu0c2T.md) | 数组、动态规划 | 中等 | +| [LCR 090. 打家劫舍 II](https://leetcode.cn/problems/PzWKhm/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/PzWKhm.md) | 数组、动态规划 | 中等 | +| [LCR 093. 最长的斐波那契子序列的长度](https://leetcode.cn/problems/Q91FMA/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/Q91FMA.md) | 数组、哈希表、动态规划 | 中等 | +| [LCR 095. 最长公共子序列](https://leetcode.cn/problems/qJnOS7/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/qJnOS7.md) | 字符串、动态规划 | 中等 | +| [LCR 097. 不同的子序列](https://leetcode.cn/problems/21dk04/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/21dk04.md) | 字符串、动态规划 | 困难 | +| [LCR 098. 不同路径](https://leetcode.cn/problems/2AoeFn/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/2AoeFn.md) | 数学、动态规划、组合数学 | 中等 | +| [LCR 101. 分割等和子集](https://leetcode.cn/problems/NUPfPr/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/NUPfPr.md) | 数学、字符串、模拟 | 简单 | +| [LCR 102. 目标和](https://leetcode.cn/problems/YaVDxD/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/YaVDxD.md) | 数组、动态规划、回溯 | 中等 | +| [LCR 103. 零钱兑换](https://leetcode.cn/problems/gaM7Ch/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/gaM7Ch.md) | 广度优先搜索、数组、动态规划 | 中等 | +| [LCR 104. 组合总和 Ⅳ](https://leetcode.cn/problems/D0F0SV/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/D0F0SV.md) | 数组、动态规划 | 中等 | +| [LCR 105. 岛屿的最大面积](https://leetcode.cn/problems/ZL6zAn/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/ZL6zAn.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | +| [LCR 106. 判断二分图](https://leetcode.cn/problems/vEAB3K/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/vEAB3K.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | +| [LCR 107. 01 矩阵](https://leetcode.cn/problems/2bCMpM/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/2bCMpM.md) | 广度优先搜索、数组、动态规划、矩阵 | 中等 | +| [LCR 108. 单词接龙](https://leetcode.cn/problems/om3reC/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/om3reC.md) | 广度优先搜索、哈希表、字符串 | 困难 | +| [LCR 109. 打开转盘锁](https://leetcode.cn/problems/zlDJc7/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/zlDJc7.md) | 广度优先搜索、数组、哈希表、字符串 | 中等 | +| [LCR 111. 除法求值](https://leetcode.cn/problems/vlzXQL/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/vlzXQL.md) | 深度优先搜索、广度优先搜索、并查集、图、数组、最短路 | 中等 | +| [LCR 112. 矩阵中的最长递增路径](https://leetcode.cn/problems/fpTFWP/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/fpTFWP.md) | 深度优先搜索、广度优先搜索、图、拓扑排序、记忆化搜索、数组、动态规划、矩阵 | 困难 | +| [LCR 113. 课程表 II](https://leetcode.cn/problems/QA2IGt/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/QA2IGt.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | +| [LCR 116. 省份数量](https://leetcode.cn/problems/bLyHh0/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/bLyHh0.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | +| [LCR 118. 冗余连接](https://leetcode.cn/problems/7LpjUW/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/7LpjUW.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | +| [LCR 119. 最长连续序列](https://leetcode.cn/problems/WhsWhI/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/WhsWhI.md) | 并查集、数组、哈希表 | 中等 | +| [LCR 120. 寻找文件副本](https://leetcode.cn/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/shu-zu-zhong-zhong-fu-de-shu-zi-lcof.md) | 数组、哈希表、排序 | 简单 | +| [LCR 121. 寻找目标值 - 二维数组](https://leetcode.cn/problems/er-wei-shu-zu-zhong-de-cha-zhao-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/er-wei-shu-zu-zhong-de-cha-zhao-lcof.md) | 数组、二分查找、分治、矩阵 | 中等 | +| [LCR 122. 路径加密](https://leetcode.cn/problems/ti-huan-kong-ge-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/ti-huan-kong-ge-lcof.md) | 字符串 | 简单 | +| [LCR 123. 图书整理 I](https://leetcode.cn/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/cong-wei-dao-tou-da-yin-lian-biao-lcof.md) | 栈、递归、链表、双指针 | 简单 | +| [LCR 124. 推理二叉树](https://leetcode.cn/problems/zhong-jian-er-cha-shu-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/zhong-jian-er-cha-shu-lcof.md) | 树、数组、哈希表、分治、二叉树 | 中等 | +| [LCR 125. 图书整理 II](https://leetcode.cn/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/yong-liang-ge-zhan-shi-xian-dui-lie-lcof.md) | 栈、设计、队列 | 简单 | +| [LCR 126. 斐波那契数](https://leetcode.cn/problems/fei-bo-na-qi-shu-lie-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/fei-bo-na-qi-shu-lie-lcof.md) | 记忆化搜索、数学、动态规划 | 简单 | +| [LCR 127. 跳跃训练](https://leetcode.cn/problems/qing-wa-tiao-tai-jie-wen-ti-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/qing-wa-tiao-tai-jie-wen-ti-lcof.md) | 记忆化搜索、数学、动态规划 | 简单 | +| [LCR 128. 库存管理 I](https://leetcode.cn/problems/xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof.md) | 数组、二分查找 | 简单 | +| [LCR 129. 字母迷宫](https://leetcode.cn/problems/ju-zhen-zhong-de-lu-jing-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/ju-zhen-zhong-de-lu-jing-lcof.md) | 数组、字符串、回溯、矩阵 | 中等 | +| [LCR 130. 衣橱整理](https://leetcode.cn/problems/ji-qi-ren-de-yun-dong-fan-wei-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/ji-qi-ren-de-yun-dong-fan-wei-lcof.md) | 深度优先搜索、广度优先搜索、动态规划 | 中等 | +| [LCR 131. 砍竹子 I](https://leetcode.cn/problems/jian-sheng-zi-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/jian-sheng-zi-lcof.md) | 数学、动态规划 | 中等 | +| [LCR 133. 位 1 的个数](https://leetcode.cn/problems/er-jin-zhi-zhong-1de-ge-shu-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/er-jin-zhi-zhong-1de-ge-shu-lcof.md) | 位运算 | 简单 | +| [LCR 134. Pow(x, n)](https://leetcode.cn/problems/shu-zhi-de-zheng-shu-ci-fang-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/shu-zhi-de-zheng-shu-ci-fang-lcof.md) | 递归、数学 | 中等 | +| [LCR 135. 报数](https://leetcode.cn/problems/da-yin-cong-1dao-zui-da-de-nwei-shu-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/da-yin-cong-1dao-zui-da-de-nwei-shu-lcof.md) | 数组、数学 | 简单 | +| [LCR 136. 删除链表的节点](https://leetcode.cn/problems/shan-chu-lian-biao-de-jie-dian-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/shan-chu-lian-biao-de-jie-dian-lcof.md) | 链表 | 简单 | +| [LCR 139. 训练计划 I](https://leetcode.cn/problems/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof.md) | 数组、双指针、排序 | 简单 | +| [LCR 140. 训练计划 II](https://leetcode.cn/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof.md) | 链表、双指针 | 简单 | +| [LCR 141. 训练计划 III](https://leetcode.cn/problems/fan-zhuan-lian-biao-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/fan-zhuan-lian-biao-lcof.md) | 递归、链表 | 简单 | +| [LCR 142. 训练计划 IV](https://leetcode.cn/problems/he-bing-liang-ge-pai-xu-de-lian-biao-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/he-bing-liang-ge-pai-xu-de-lian-biao-lcof.md) | 递归、链表 | 简单 | +| [LCR 143. 子结构判断](https://leetcode.cn/problems/shu-de-zi-jie-gou-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/shu-de-zi-jie-gou-lcof.md) | 树、深度优先搜索、二叉树 | 中等 | +| [LCR 144. 翻转二叉树](https://leetcode.cn/problems/er-cha-shu-de-jing-xiang-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/er-cha-shu-de-jing-xiang-lcof.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [LCR 145. 判断对称二叉树](https://leetcode.cn/problems/dui-cheng-de-er-cha-shu-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/dui-cheng-de-er-cha-shu-lcof.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [LCR 146. 螺旋遍历二维数组](https://leetcode.cn/problems/shun-shi-zhen-da-yin-ju-zhen-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/shun-shi-zhen-da-yin-ju-zhen-lcof.md) | 数组、矩阵、模拟 | 简单 | +| [LCR 147. 最小栈](https://leetcode.cn/problems/bao-han-minhan-shu-de-zhan-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/bao-han-minhan-shu-de-zhan-lcof.md) | 栈、设计 | 简单 | +| [LCR 148. 验证图书取出顺序](https://leetcode.cn/problems/zhan-de-ya-ru-dan-chu-xu-lie-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/zhan-de-ya-ru-dan-chu-xu-lie-lcof.md) | 栈、数组、模拟 | 中等 | +| [LCR 149. 彩灯装饰记录 I](https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/cong-shang-dao-xia-da-yin-er-cha-shu-lcof.md) | 树、广度优先搜索、二叉树 | 中等 | +| [LCR 150. 彩灯装饰记录 II](https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof.md) | 树、广度优先搜索、二叉树 | 简单 | +| [LCR 151. 彩灯装饰记录 III](https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof.md) | 树、广度优先搜索、二叉树 | 中等 | +| [LCR 152. 验证二叉搜索树的后序遍历序列](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof.md) | 栈、树、二叉搜索树、递归、数组、二叉树、单调栈 | 中等 | +| [LCR 153. 二叉树中和为目标值的路径](https://leetcode.cn/problems/er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof.md) | 树、深度优先搜索、回溯、二叉树 | 中等 | +| [LCR 154. 复杂链表的复制](https://leetcode.cn/problems/fu-za-lian-biao-de-fu-zhi-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/fu-za-lian-biao-de-fu-zhi-lcof.md) | 哈希表、链表 | 中等 | +| [LCR 155. 将二叉搜索树转化为排序的双向链表](https://leetcode.cn/problems/er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof.md) | 栈、树、深度优先搜索、二叉搜索树、链表、二叉树、双向链表 | 中等 | +| [LCR 156. 序列化与反序列化二叉树](https://leetcode.cn/problems/xu-lie-hua-er-cha-shu-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/xu-lie-hua-er-cha-shu-lcof.md) | 树、深度优先搜索、广度优先搜索、设计、字符串、二叉树 | 困难 | +| [LCR 157. 套餐内商品的排列顺序](https://leetcode.cn/problems/zi-fu-chuan-de-pai-lie-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/zi-fu-chuan-de-pai-lie-lcof.md) | 字符串、回溯 | 中等 | +| [LCR 158. 库存管理 II](https://leetcode.cn/problems/shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof.md) | 数组、哈希表、分治、计数、排序 | 简单 | +| [LCR 159. 库存管理 III](https://leetcode.cn/problems/zui-xiao-de-kge-shu-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/zui-xiao-de-kge-shu-lcof.md) | 数组、分治、快速选择、排序、堆（优先队列） | 简单 | +| [LCR 160. 数据流中的中位数](https://leetcode.cn/problems/shu-ju-liu-zhong-de-zhong-wei-shu-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/shu-ju-liu-zhong-de-zhong-wei-shu-lcof.md) | 设计、双指针、数据流、排序、堆（优先队列） | 困难 | +| [LCR 161. 连续天数的最高销售额](https://leetcode.cn/problems/lian-xu-zi-shu-zu-de-zui-da-he-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/lian-xu-zi-shu-zu-de-zui-da-he-lcof.md) | 数组、分治、动态规划 | 简单 | +| [LCR 163. 找到第 k 位数字](https://leetcode.cn/problems/shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof.md) | 数学、二分查找 | 中等 | +| [LCR 164. 破解闯关密码](https://leetcode.cn/problems/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof.md) | 贪心、字符串、排序 | 中等 | +| [LCR 165. 解密数字](https://leetcode.cn/problems/ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof.md) | 字符串、动态规划 | 中等 | +| [LCR 166. 珠宝的最高价值](https://leetcode.cn/problems/li-wu-de-zui-da-jie-zhi-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/li-wu-de-zui-da-jie-zhi-lcof.md) | 数组、动态规划、矩阵 | 中等 | +| [LCR 167. 招式拆解 I](https://leetcode.cn/problems/zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof.md) | 哈希表、字符串、滑动窗口 | 中等 | +| [LCR 168. 丑数](https://leetcode.cn/problems/chou-shu-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/chou-shu-lcof.md) | 哈希表、数学、动态规划、堆（优先队列） | 中等 | +| [LCR 169. 招式拆解 II](https://leetcode.cn/problems/di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof.md) | 队列、哈希表、字符串、计数 | 简单 | +| [LCR 170. 交易逆序对的总数](https://leetcode.cn/problems/shu-zu-zhong-de-ni-xu-dui-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/shu-zu-zhong-de-ni-xu-dui-lcof.md) | 树状数组、线段树、数组、二分查找、分治、有序集合、归并排序 | 困难 | +| [LCR 171. 训练计划 V](https://leetcode.cn/problems/liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof.md) | 哈希表、链表、双指针 | 简单 | +| [LCR 172. 统计目标成绩的出现次数](https://leetcode.cn/problems/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof.md) | 数组、二分查找 | 简单 | +| [LCR 173. 点名](https://leetcode.cn/problems/que-shi-de-shu-zi-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/que-shi-de-shu-zi-lcof.md) | 位运算、数组、哈希表、数学、二分查找 | 简单 | +| [LCR 174. 寻找二叉搜索树中的目标节点](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 简单 | +| [LCR 175. 计算二叉树的深度](https://leetcode.cn/problems/er-cha-shu-de-shen-du-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/er-cha-shu-de-shen-du-lcof.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [LCR 176. 判断是否为平衡二叉树](https://leetcode.cn/problems/ping-heng-er-cha-shu-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/ping-heng-er-cha-shu-lcof.md) | 树、深度优先搜索、二叉树 | 简单 | +| [LCR 177. 撞色搭配](https://leetcode.cn/problems/shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof.md) | 位运算、数组 | 中等 | +| [LCR 179. 查找总价格为目标值的两个商品](https://leetcode.cn/problems/he-wei-sde-liang-ge-shu-zi-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/he-wei-sde-liang-ge-shu-zi-lcof.md) | 数组、双指针、二分查找 | 简单 | +| [LCR 180. 文件组合](https://leetcode.cn/problems/he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof.md) | 数学、双指针、枚举 | 简单 | +| [LCR 181. 字符串中的单词反转](https://leetcode.cn/problems/fan-zhuan-dan-ci-shun-xu-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/fan-zhuan-dan-ci-shun-xu-lcof.md) | 双指针、字符串 | 简单 | +| [LCR 182. 动态口令](https://leetcode.cn/problems/zuo-xuan-zhuan-zi-fu-chuan-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/zuo-xuan-zhuan-zi-fu-chuan-lcof.md) | 数学、双指针、字符串 | 简单 | +| [LCR 183. 望远镜中最高的海拔](https://leetcode.cn/problems/hua-dong-chuang-kou-de-zui-da-zhi-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/hua-dong-chuang-kou-de-zui-da-zhi-lcof.md) | 队列、数组、滑动窗口、单调队列、堆（优先队列） | 困难 | +| [LCR 184. 设计自助结算系统](https://leetcode.cn/problems/dui-lie-de-zui-da-zhi-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/dui-lie-de-zui-da-zhi-lcof.md) | 设计、队列、单调队列 | 中等 | +| [LCR 186. 文物朝代判断](https://leetcode.cn/problems/bu-ke-pai-zhong-de-shun-zi-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/bu-ke-pai-zhong-de-shun-zi-lcof.md) | 数组、排序 | 简单 | +| [LCR 187. 破冰游戏](https://leetcode.cn/problems/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof.md) | 递归、数学 | 简单 | +| [LCR 188. 买卖芯片的最佳时机](https://leetcode.cn/problems/gu-piao-de-zui-da-li-run-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/gu-piao-de-zui-da-li-run-lcof.md) | 数组、动态规划 | 中等 | +| [LCR 189. 设计机械累加器](https://leetcode.cn/problems/qiu-12n-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/qiu-12n-lcof.md) | 位运算、递归、脑筋急转弯 | 中等 | +| [LCR 190. 加密运算](https://leetcode.cn/problems/bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof.md) | 位运算、数学 | 简单 | +| [LCR 191. 按规则计算统计结果](https://leetcode.cn/problems/gou-jian-cheng-ji-shu-zu-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/gou-jian-cheng-ji-shu-zu-lcof.md) | 数组、前缀和 | 中等 | +| [LCR 192. 把字符串转换成整数 (atoi)](https://leetcode.cn/problems/ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof.md) | 字符串 | 中等 | +| [LCR 193. 二叉搜索树的最近公共祖先](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 简单 | +| [LCR 194. 二叉树的最近公共祖先](https://leetcode.cn/problems/er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof.md) | 树、深度优先搜索、二叉树 | 简单 | + + +### 面试题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [面试题 01.07. 旋转矩阵](https://leetcode.cn/problems/rotate-matrix-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/rotate-matrix-lcci.md) | 数组、数学、矩阵 | 中等 | +| [面试题 01.08. 零矩阵](https://leetcode.cn/problems/zero-matrix-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/zero-matrix-lcci.md) | 数组、哈希表、矩阵 | 中等 | +| [面试题 02.02. 返回倒数第 k 个节点](https://leetcode.cn/problems/kth-node-from-end-of-list-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/kth-node-from-end-of-list-lcci.md) | 链表、双指针 | 简单 | +| [面试题 02.05. 链表求和](https://leetcode.cn/problems/sum-lists-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/sum-lists-lcci.md) | 递归、链表、数学 | 中等 | +| [面试题 02.06. 回文链表](https://leetcode.cn/problems/palindrome-linked-list-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/palindrome-linked-list-lcci.md) | 栈、递归、链表、双指针 | 简单 | +| [面试题 02.07. 链表相交](https://leetcode.cn/problems/intersection-of-two-linked-lists-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/intersection-of-two-linked-lists-lcci.md) | 哈希表、链表、双指针 | 简单 | +| [面试题 02.08. 环路检测](https://leetcode.cn/problems/linked-list-cycle-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/linked-list-cycle-lcci.md) | 哈希表、链表、双指针 | 中等 | +| [面试题 03.02. 栈的最小值](https://leetcode.cn/problems/min-stack-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/min-stack-lcci.md) | 栈、设计 | 简单 | +| [面试题 03.04. 化栈为队](https://leetcode.cn/problems/implement-queue-using-stacks-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/implement-queue-using-stacks-lcci.md) | 栈、设计、队列 | 简单 | +| [面试题 04.02. 最小高度树](https://leetcode.cn/problems/minimum-height-tree-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/minimum-height-tree-lcci.md) | 树、二叉搜索树、数组、分治、二叉树 | 简单 | +| [面试题 04.05. 合法二叉搜索树](https://leetcode.cn/problems/legal-binary-search-tree-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/legal-binary-search-tree-lcci.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | +| [面试题 04.06. 后继者](https://leetcode.cn/problems/successor-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/successor-lcci.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | +| [面试题 04.08. 首个共同祖先](https://leetcode.cn/problems/first-common-ancestor-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/first-common-ancestor-lcci.md) | 树、深度优先搜索、二叉树 | 中等 | +| [面试题 04.12. 求和路径](https://leetcode.cn/problems/paths-with-sum-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/paths-with-sum-lcci.md) | 树、深度优先搜索、二叉树 | 中等 | +| [面试题 08.04. 幂集](https://leetcode.cn/problems/power-set-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/power-set-lcci.md) | 位运算、数组、回溯 | 中等 | +| [面试题 08.07. 无重复字符串的排列组合](https://leetcode.cn/problems/permutation-i-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/permutation-i-lcci.md) | 字符串、回溯 | 中等 | +| [面试题 08.08. 有重复字符串的排列组合](https://leetcode.cn/problems/permutation-ii-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/permutation-ii-lcci.md) | 字符串、回溯 | 中等 | +| [面试题 08.09. 括号](https://leetcode.cn/problems/bracket-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/bracket-lcci.md) | 字符串、动态规划、回溯 | 中等 | +| [面试题 08.10. 颜色填充](https://leetcode.cn/problems/color-fill-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/color-fill-lcci.md) | 深度优先搜索、广度优先搜索、数组、矩阵 | 简单 | +| [面试题 08.12. 八皇后](https://leetcode.cn/problems/eight-queens-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/eight-queens-lcci.md) | 数组、回溯 | 困难 | +| [面试题 10.01. 合并排序的数组](https://leetcode.cn/problems/sorted-merge-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/sorted-merge-lcci.md) | 数组、双指针、排序 | 简单 | +| [面试题 10.02. 变位词组](https://leetcode.cn/problems/group-anagrams-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/group-anagrams-lcci.md) | 数组、哈希表、字符串、排序 | 中等 | +| [面试题 10.09. 排序矩阵查找](https://leetcode.cn/problems/sorted-matrix-search-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/sorted-matrix-search-lcci.md) | 数组、二分查找、分治、矩阵 | 中等 | +| [面试题 16.02. 单词频率](https://leetcode.cn/problems/words-frequency-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/words-frequency-lcci.md) | 设计、字典树、数组、哈希表、字符串 | 中等 | +| [面试题 16.05. 阶乘尾数](https://leetcode.cn/problems/factorial-zeros-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/factorial-zeros-lcci.md) | 数学 | 简单 | +| [面试题 16.26. 计算器](https://leetcode.cn/problems/calculator-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/calculator-lcci.md) | 栈、数学、字符串 | 中等 | +| [面试题 17.06. 2出现的次数](https://leetcode.cn/problems/number-of-2s-in-range-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/number-of-2s-in-range-lcci.md) | 递归、数学、动态规划 | 困难 | +| [面试题 17.14. 最小K个数](https://leetcode.cn/problems/smallest-k-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/smallest-k-lcci.md) | 数组、分治、快速选择、排序、堆（优先队列） | 中等 | +| [面试题 17.15. 最长单词](https://leetcode.cn/problems/longest-word-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/longest-word-lcci.md) | 字典树、数组、哈希表、字符串 | 中等 | +| [面试题 17.17. 多次搜索](https://leetcode.cn/problems/multi-search-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/multi-search-lcci.md) | 字典树、数组、哈希表、字符串、字符串匹配、滑动窗口 | 中等 | + + diff --git a/docs/00_preface/00_06_categories_list.md b/docs/00_preface/00_06_categories_list.md new file mode 100644 index 00000000..8c01d8c3 --- /dev/null +++ b/docs/00_preface/00_06_categories_list.md @@ -0,0 +1,1167 @@ +# LeetCode 题解（按分类排序，推荐刷题列表 ★★★） + +## 第 1 章 数组 + +### 数组基础题目 + +#### 数组操作题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0189. 轮转数组](https://leetcode.cn/problems/rotate-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/rotate-array.md) | 数组、数学、双指针 | 中等 | +| [0066. 加一](https://leetcode.cn/problems/plus-one/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/plus-one.md) | 数组、数学 | 简单 | +| [0724. 寻找数组的中心下标](https://leetcode.cn/problems/find-pivot-index/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/find-pivot-index.md) | 数组、前缀和 | 简单 | +| [0485. 最大连续 1 的个数](https://leetcode.cn/problems/max-consecutive-ones/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/max-consecutive-ones.md) | 数组 | 简单 | +| [0238. 除自身以外数组的乘积](https://leetcode.cn/problems/product-of-array-except-self/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/product-of-array-except-self.md) | 数组、前缀和 | 中等 | + + +#### 二维数组题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0498. 对角线遍历](https://leetcode.cn/problems/diagonal-traverse/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/diagonal-traverse.md) | 数组、矩阵、模拟 | 中等 | +| [0048. 旋转图像](https://leetcode.cn/problems/rotate-image/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/rotate-image.md) | 数组、数学、矩阵 | 中等 | +| [0073. 矩阵置零](https://leetcode.cn/problems/set-matrix-zeroes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/set-matrix-zeroes.md) | 数组、哈希表、矩阵 | 中等 | +| [0054. 螺旋矩阵](https://leetcode.cn/problems/spiral-matrix/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/spiral-matrix.md) | 数组、矩阵、模拟 | 中等 | +| [0059. 螺旋矩阵 II](https://leetcode.cn/problems/spiral-matrix-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/spiral-matrix-ii.md) | 数组、矩阵、模拟 | 中等 | +| [0289. 生命游戏](https://leetcode.cn/problems/game-of-life/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/game-of-life.md) | 数组、矩阵、模拟 | 中等 | + + +### 排序算法题目 + +#### 冒泡排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [LCR 164. 破解闯关密码](https://leetcode.cn/problems/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof.md) | 贪心、字符串、排序 | 中等 | +| [0283. 移动零](https://leetcode.cn/problems/move-zeroes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/move-zeroes.md) | 数组、双指针 | 简单 | + + +#### 选择排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0215. 数组中的第K个最大元素](https://leetcode.cn/problems/kth-largest-element-in-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/kth-largest-element-in-an-array.md) | 数组、分治、快速选择、排序、堆（优先队列） | 中等 | + + +#### 插入排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0075. 颜色分类](https://leetcode.cn/problems/sort-colors/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/sort-colors.md) | 数组、双指针、排序 | 中等 | + + +#### 希尔排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0912. 排序数组](https://leetcode.cn/problems/sort-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | +| [0506. 相对名次](https://leetcode.cn/problems/relative-ranks/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/relative-ranks.md) | 数组、排序、堆（优先队列） | 简单 | + + +#### 归并排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0912. 排序数组](https://leetcode.cn/problems/sort-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | +| [0088. 合并两个有序数组](https://leetcode.cn/problems/merge-sorted-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-sorted-array.md) | 数组、双指针、排序 | 简单 | +| [LCR 170. 交易逆序对的总数](https://leetcode.cn/problems/shu-zu-zhong-de-ni-xu-dui-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/shu-zu-zhong-de-ni-xu-dui-lcof.md) | 树状数组、线段树、数组、二分查找、分治、有序集合、归并排序 | 困难 | +| [0315. 计算右侧小于当前元素的个数](https://leetcode.cn/problems/count-of-smaller-numbers-after-self/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/count-of-smaller-numbers-after-self.md) | 树状数组、线段树、数组、二分查找、分治、有序集合、归并排序 | 困难 | + + +#### 快速排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0912. 排序数组](https://leetcode.cn/problems/sort-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | +| [0169. 多数元素](https://leetcode.cn/problems/majority-element/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/majority-element.md) | 数组、哈希表、分治、计数、排序 | 简单 | + + +#### 堆排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0912. 排序数组](https://leetcode.cn/problems/sort-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | +| [0215. 数组中的第K个最大元素](https://leetcode.cn/problems/kth-largest-element-in-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/kth-largest-element-in-an-array.md) | 数组、分治、快速选择、排序、堆（优先队列） | 中等 | +| [LCR 159. 库存管理 III](https://leetcode.cn/problems/zui-xiao-de-kge-shu-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/zui-xiao-de-kge-shu-lcof.md) | 数组、分治、快速选择、排序、堆（优先队列） | 简单 | + + +#### 计数排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0912. 排序数组](https://leetcode.cn/problems/sort-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | +| [1122. 数组的相对排序](https://leetcode.cn/problems/relative-sort-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/relative-sort-array.md) | 数组、哈希表、计数排序、排序 | 简单 | + + +#### 桶排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0912. 排序数组](https://leetcode.cn/problems/sort-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | +| [0220. 存在重复元素 III](https://leetcode.cn/problems/contains-duplicate-iii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/contains-duplicate-iii.md) | 数组、桶排序、有序集合、排序、滑动窗口 | 困难 | +| [0164. 最大间距](https://leetcode.cn/problems/maximum-gap/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/maximum-gap.md) | 数组、桶排序、基数排序、排序 | 中等 | + + +#### 基数排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0164. 最大间距](https://leetcode.cn/problems/maximum-gap/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/maximum-gap.md) | 数组、桶排序、基数排序、排序 | 中等 | +| [0561. 数组拆分](https://leetcode.cn/problems/array-partition/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/array-partition.md) | 贪心、数组、计数排序、排序 | 简单 | + + +#### 其他排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0217. 存在重复元素](https://leetcode.cn/problems/contains-duplicate/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/contains-duplicate.md) | 数组、哈希表、排序 | 简单 | +| [0136. 只出现一次的数字](https://leetcode.cn/problems/single-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/single-number.md) | 位运算、数组 | 简单 | +| [0056. 合并区间](https://leetcode.cn/problems/merge-intervals/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-intervals.md) | 数组、排序 | 中等 | +| [0179. 最大数](https://leetcode.cn/problems/largest-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/largest-number.md) | 贪心、数组、字符串、排序 | 中等 | +| [0384. 打乱数组](https://leetcode.cn/problems/shuffle-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/shuffle-an-array.md) | 设计、数组、数学、随机化 | 中等 | +| [LCR 164. 破解闯关密码](https://leetcode.cn/problems/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof.md) | 贪心、字符串、排序 | 中等 | + + +### 二分查找题目 + +#### 二分下标题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0704. 二分查找](https://leetcode.cn/problems/binary-search/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/binary-search.md) | 数组、二分查找 | 简单 | +| [0374. 猜数字大小](https://leetcode.cn/problems/guess-number-higher-or-lower/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/guess-number-higher-or-lower.md) | 二分查找、交互 | 简单 | +| [0035. 搜索插入位置](https://leetcode.cn/problems/search-insert-position/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/search-insert-position.md) | 数组、二分查找 | 简单 | +| [0034. 在排序数组中查找元素的第一个和最后一个位置](https://leetcode.cn/problems/find-first-and-last-position-of-element-in-sorted-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/find-first-and-last-position-of-element-in-sorted-array.md) | 数组、二分查找 | 中等 | +| [0167. 两数之和 II - 输入有序数组](https://leetcode.cn/problems/two-sum-ii-input-array-is-sorted/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/two-sum-ii-input-array-is-sorted.md) | 数组、双指针、二分查找 | 中等 | +| [0153. 寻找旋转排序数组中的最小值](https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/find-minimum-in-rotated-sorted-array.md) | 数组、二分查找 | 中等 | +| [0154. 寻找旋转排序数组中的最小值 II](https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/find-minimum-in-rotated-sorted-array-ii.md) | 数组、二分查找 | 困难 | +| [0033. 搜索旋转排序数组](https://leetcode.cn/problems/search-in-rotated-sorted-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/search-in-rotated-sorted-array.md) | 数组、二分查找 | 中等 | +| [0081. 搜索旋转排序数组 II](https://leetcode.cn/problems/search-in-rotated-sorted-array-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/search-in-rotated-sorted-array-ii.md) | 数组、二分查找 | 中等 | +| [0278. 第一个错误的版本](https://leetcode.cn/problems/first-bad-version/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/first-bad-version.md) | 二分查找、交互 | 简单 | +| [0162. 寻找峰值](https://leetcode.cn/problems/find-peak-element/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/find-peak-element.md) | 数组、二分查找 | 中等 | +| [0852. 山脉数组的峰顶索引](https://leetcode.cn/problems/peak-index-in-a-mountain-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/peak-index-in-a-mountain-array.md) | 数组、二分查找 | 中等 | +| [1095. 山脉数组中查找目标值](https://leetcode.cn/problems/find-in-mountain-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/find-in-mountain-array.md) | 数组、二分查找、交互 | 困难 | +| [0744. 寻找比目标字母大的最小字母](https://leetcode.cn/problems/find-smallest-letter-greater-than-target/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/find-smallest-letter-greater-than-target.md) | 数组、二分查找 | 简单 | +| [0004. 寻找两个正序数组的中位数](https://leetcode.cn/problems/median-of-two-sorted-arrays/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/median-of-two-sorted-arrays.md) | 数组、二分查找、分治 | 困难 | +| [0074. 搜索二维矩阵](https://leetcode.cn/problems/search-a-2d-matrix/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/search-a-2d-matrix.md) | 数组、二分查找、矩阵 | 中等 | +| [0240. 搜索二维矩阵 II](https://leetcode.cn/problems/search-a-2d-matrix-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/search-a-2d-matrix-ii.md) | 数组、二分查找、分治、矩阵 | 中等 | + + +#### 二分答案题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0069. x 的平方根](https://leetcode.cn/problems/sqrtx/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/sqrtx.md) | 数学、二分查找 | 简单 | +| [0287. 寻找重复数](https://leetcode.cn/problems/find-the-duplicate-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/find-the-duplicate-number.md) | 位运算、数组、双指针、二分查找 | 中等 | +| [0050. Pow(x, n)](https://leetcode.cn/problems/powx-n/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/powx-n.md) | 递归、数学 | 中等 | +| [0367. 有效的完全平方数](https://leetcode.cn/problems/valid-perfect-square/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/valid-perfect-square.md) | 数学、二分查找 | 简单 | +| [1300. 转变数组后最接近目标值的数组和](https://leetcode.cn/problems/sum-of-mutated-array-closest-to-target/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/sum-of-mutated-array-closest-to-target.md) | 数组、二分查找、排序 | 中等 | +| [0400. 第 N 位数字](https://leetcode.cn/problems/nth-digit/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/nth-digit.md) | 数学、二分查找 | 中等 | + + +#### 复杂的二分查找问题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0875. 爱吃香蕉的珂珂](https://leetcode.cn/problems/koko-eating-bananas/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/koko-eating-bananas.md) | 数组、二分查找 | 中等 | +| [0410. 分割数组的最大值](https://leetcode.cn/problems/split-array-largest-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/split-array-largest-sum.md) | 贪心、数组、二分查找、动态规划、前缀和 | 困难 | +| [0209. 长度最小的子数组](https://leetcode.cn/problems/minimum-size-subarray-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/minimum-size-subarray-sum.md) | 数组、二分查找、前缀和、滑动窗口 | 中等 | +| [0658. 找到 K 个最接近的元素](https://leetcode.cn/problems/find-k-closest-elements/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/find-k-closest-elements.md) | 数组、双指针、二分查找、排序、滑动窗口、堆（优先队列） | 中等 | +| [0270. 最接近的二叉搜索树值](https://leetcode.cn/problems/closest-binary-search-tree-value/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/closest-binary-search-tree-value.md) | 树、深度优先搜索、二叉搜索树、二分查找、二叉树 | 简单 | +| [0702. 搜索长度未知的有序数组](https://leetcode.cn/problems/search-in-a-sorted-array-of-unknown-size/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/search-in-a-sorted-array-of-unknown-size.md) | 数组、二分查找、交互 | 中等 | +| [0349. 两个数组的交集](https://leetcode.cn/problems/intersection-of-two-arrays/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/intersection-of-two-arrays.md) | 数组、哈希表、双指针、二分查找、排序 | 简单 | +| [0350. 两个数组的交集 II](https://leetcode.cn/problems/intersection-of-two-arrays-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/intersection-of-two-arrays-ii.md) | 数组、哈希表、双指针、二分查找、排序 | 简单 | +| [0287. 寻找重复数](https://leetcode.cn/problems/find-the-duplicate-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/find-the-duplicate-number.md) | 位运算、数组、双指针、二分查找 | 中等 | +| [0719. 找出第 K 小的数对距离](https://leetcode.cn/problems/find-k-th-smallest-pair-distance/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/find-k-th-smallest-pair-distance.md) | 数组、双指针、二分查找、排序 | 困难 | +| [0259. 较小的三数之和](https://leetcode.cn/problems/3sum-smaller/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/3sum-smaller.md) | 数组、双指针、二分查找、排序 | 中等 | +| [1011. 在 D 天内送达包裹的能力](https://leetcode.cn/problems/capacity-to-ship-packages-within-d-days/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/capacity-to-ship-packages-within-d-days.md) | 数组、二分查找 | 中等 | +| [1482. 制作 m 束花所需的最少天数](https://leetcode.cn/problems/minimum-number-of-days-to-make-m-bouquets/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/minimum-number-of-days-to-make-m-bouquets.md) | 数组、二分查找 | 中等 | + + +### 双指针题目 + +#### 对撞指针题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0167. 两数之和 II - 输入有序数组](https://leetcode.cn/problems/two-sum-ii-input-array-is-sorted/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/two-sum-ii-input-array-is-sorted.md) | 数组、双指针、二分查找 | 中等 | +| [0344. 反转字符串](https://leetcode.cn/problems/reverse-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/reverse-string.md) | 双指针、字符串 | 简单 | +| [0345. 反转字符串中的元音字母](https://leetcode.cn/problems/reverse-vowels-of-a-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/reverse-vowels-of-a-string.md) | 双指针、字符串 | 简单 | +| [0125. 验证回文串](https://leetcode.cn/problems/valid-palindrome/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/valid-palindrome.md) | 双指针、字符串 | 简单 | +| [0011. 盛最多水的容器](https://leetcode.cn/problems/container-with-most-water/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/container-with-most-water.md) | 贪心、数组、双指针 | 中等 | +| [0611. 有效三角形的个数](https://leetcode.cn/problems/valid-triangle-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/valid-triangle-number.md) | 贪心、数组、双指针、二分查找、排序 | 中等 | +| [0015. 三数之和](https://leetcode.cn/problems/3sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/3sum.md) | 数组、双指针、排序 | 中等 | +| [0016. 最接近的三数之和](https://leetcode.cn/problems/3sum-closest/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/3sum-closest.md) | 数组、双指针、排序 | 中等 | +| [0018. 四数之和](https://leetcode.cn/problems/4sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/4sum.md) | 数组、双指针、排序 | 中等 | +| [0259. 较小的三数之和](https://leetcode.cn/problems/3sum-smaller/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/3sum-smaller.md) | 数组、双指针、二分查找、排序 | 中等 | +| [0658. 找到 K 个最接近的元素](https://leetcode.cn/problems/find-k-closest-elements/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/find-k-closest-elements.md) | 数组、双指针、二分查找、排序、滑动窗口、堆（优先队列） | 中等 | +| [1099. 小于 K 的两数之和](https://leetcode.cn/problems/two-sum-less-than-k/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/two-sum-less-than-k.md) | 数组、双指针、二分查找、排序 | 简单 | +| [0075. 颜色分类](https://leetcode.cn/problems/sort-colors/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/sort-colors.md) | 数组、双指针、排序 | 中等 | +| [0360. 有序转化数组](https://leetcode.cn/problems/sort-transformed-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/sort-transformed-array.md) | 数组、数学、双指针、排序 | 中等 | +| [0977. 有序数组的平方](https://leetcode.cn/problems/squares-of-a-sorted-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/squares-of-a-sorted-array.md) | 数组、双指针、排序 | 简单 | +| [0881. 救生艇](https://leetcode.cn/problems/boats-to-save-people/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/boats-to-save-people.md) | 贪心、数组、双指针、排序 | 中等 | +| [0042. 接雨水](https://leetcode.cn/problems/trapping-rain-water/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/trapping-rain-water.md) | 栈、数组、双指针、动态规划、单调栈 | 困难 | +| [0443. 压缩字符串](https://leetcode.cn/problems/string-compression/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/string-compression.md) | 双指针、字符串 | 中等 | + + +#### 快慢指针题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0026. 删除有序数组中的重复项](https://leetcode.cn/problems/remove-duplicates-from-sorted-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-duplicates-from-sorted-array.md) | 数组、双指针 | 简单 | +| [0080. 删除有序数组中的重复项 II](https://leetcode.cn/problems/remove-duplicates-from-sorted-array-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-duplicates-from-sorted-array-ii.md) | 数组、双指针 | 中等 | +| [0027. 移除元素](https://leetcode.cn/problems/remove-element/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-element.md) | 数组、双指针 | 简单 | +| [0283. 移动零](https://leetcode.cn/problems/move-zeroes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/move-zeroes.md) | 数组、双指针 | 简单 | +| [0845. 数组中的最长山脉](https://leetcode.cn/problems/longest-mountain-in-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/longest-mountain-in-array.md) | 数组、双指针、动态规划、枚举 | 中等 | +| [0088. 合并两个有序数组](https://leetcode.cn/problems/merge-sorted-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-sorted-array.md) | 数组、双指针、排序 | 简单 | +| [0719. 找出第 K 小的数对距离](https://leetcode.cn/problems/find-k-th-smallest-pair-distance/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/find-k-th-smallest-pair-distance.md) | 数组、双指针、二分查找、排序 | 困难 | +| [0334. 递增的三元子序列](https://leetcode.cn/problems/increasing-triplet-subsequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/increasing-triplet-subsequence.md) | 贪心、数组 | 中等 | +| [0978. 最长湍流子数组](https://leetcode.cn/problems/longest-turbulent-subarray/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/longest-turbulent-subarray.md) | 数组、动态规划、滑动窗口 | 中等 | +| [LCR 139. 训练计划 I](https://leetcode.cn/problems/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof.md) | 数组、双指针、排序 | 简单 | + + +#### 分离双指针题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0350. 两个数组的交集 II](https://leetcode.cn/problems/intersection-of-two-arrays-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/intersection-of-two-arrays-ii.md) | 数组、哈希表、双指针、二分查找、排序 | 简单 | +| [0925. 长按键入](https://leetcode.cn/problems/long-pressed-name/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/long-pressed-name.md) | 双指针、字符串 | 简单 | +| [0844. 比较含退格的字符串](https://leetcode.cn/problems/backspace-string-compare/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/backspace-string-compare.md) | 栈、双指针、字符串、模拟 | 简单 | +| [1229. 安排会议日程](https://leetcode.cn/problems/meeting-scheduler/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/meeting-scheduler.md) | 数组、双指针、排序 | 中等 | +| [0415. 字符串相加](https://leetcode.cn/problems/add-strings/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/add-strings.md) | 数学、字符串、模拟 | 简单 | +| [0392. 判断子序列](https://leetcode.cn/problems/is-subsequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/is-subsequence.md) | 双指针、字符串、动态规划 | 简单 | + + +### 滑动窗口题目 + +#### 固定长度窗口题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [1343. 大小为 K 且平均值大于等于阈值的子数组数目](https://leetcode.cn/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold.md) | 数组、滑动窗口 | 中等 | +| [0643. 子数组最大平均数 I](https://leetcode.cn/problems/maximum-average-subarray-i/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/maximum-average-subarray-i.md) | 数组、滑动窗口 | 简单 | +| [1052. 爱生气的书店老板](https://leetcode.cn/problems/grumpy-bookstore-owner/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/grumpy-bookstore-owner.md) | 数组、滑动窗口 | 中等 | +| [1423. 可获得的最大点数](https://leetcode.cn/problems/maximum-points-you-can-obtain-from-cards/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/maximum-points-you-can-obtain-from-cards.md) | 数组、前缀和、滑动窗口 | 中等 | +| [1456. 定长子串中元音的最大数目](https://leetcode.cn/problems/maximum-number-of-vowels-in-a-substring-of-given-length/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/maximum-number-of-vowels-in-a-substring-of-given-length.md) | 字符串、滑动窗口 | 中等 | +| [0567. 字符串的排列](https://leetcode.cn/problems/permutation-in-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/permutation-in-string.md) | 哈希表、双指针、字符串、滑动窗口 | 中等 | +| [1100. 长度为 K 的无重复字符子串](https://leetcode.cn/problems/find-k-length-substrings-with-no-repeated-characters/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/find-k-length-substrings-with-no-repeated-characters.md) | 哈希表、字符串、滑动窗口 | 中等 | +| [1151. 最少交换次数来组合所有的 1](https://leetcode.cn/problems/minimum-swaps-to-group-all-1s-together/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/minimum-swaps-to-group-all-1s-together.md) | 数组、滑动窗口 | 中等 | +| [1176. 健身计划评估](https://leetcode.cn/problems/diet-plan-performance/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/diet-plan-performance.md) | 数组、滑动窗口 | 简单 | +| [0438. 找到字符串中所有字母异位词](https://leetcode.cn/problems/find-all-anagrams-in-a-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/find-all-anagrams-in-a-string.md) | 哈希表、字符串、滑动窗口 | 中等 | +| [0995. K 连续位的最小翻转次数](https://leetcode.cn/problems/minimum-number-of-k-consecutive-bit-flips/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/minimum-number-of-k-consecutive-bit-flips.md) | 位运算、队列、数组、前缀和、滑动窗口 | 困难 | +| [0683. K 个关闭的灯泡](https://leetcode.cn/problems/k-empty-slots/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/k-empty-slots.md) | 树状数组、线段树、队列、数组、有序集合、滑动窗口、单调队列、堆（优先队列） | 困难 | +| [0220. 存在重复元素 III](https://leetcode.cn/problems/contains-duplicate-iii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/contains-duplicate-iii.md) | 数组、桶排序、有序集合、排序、滑动窗口 | 困难 | +| [0239. 滑动窗口最大值](https://leetcode.cn/problems/sliding-window-maximum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/sliding-window-maximum.md) | 队列、数组、滑动窗口、单调队列、堆（优先队列） | 困难 | +| [0480. 滑动窗口中位数](https://leetcode.cn/problems/sliding-window-median/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/sliding-window-median.md) | 数组、哈希表、滑动窗口、堆（优先队列） | 困难 | + + +#### 不定长度窗口题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0674. 最长连续递增序列](https://leetcode.cn/problems/longest-continuous-increasing-subsequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/longest-continuous-increasing-subsequence.md) | 数组 | 简单 | +| [0485. 最大连续 1 的个数](https://leetcode.cn/problems/max-consecutive-ones/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/max-consecutive-ones.md) | 数组 | 简单 | +| [0487. 最大连续1的个数 II](https://leetcode.cn/problems/max-consecutive-ones-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/max-consecutive-ones-ii.md) | 数组、动态规划、滑动窗口 | 中等 | +| [0076. 最小覆盖子串](https://leetcode.cn/problems/minimum-window-substring/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/minimum-window-substring.md) | 哈希表、字符串、滑动窗口 | 困难 | +| [0718. 最长重复子数组](https://leetcode.cn/problems/maximum-length-of-repeated-subarray/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/maximum-length-of-repeated-subarray.md) | 数组、二分查找、动态规划、滑动窗口、哈希函数、滚动哈希 | 中等 | +| [0209. 长度最小的子数组](https://leetcode.cn/problems/minimum-size-subarray-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/minimum-size-subarray-sum.md) | 数组、二分查找、前缀和、滑动窗口 | 中等 | +| [1004. 最大连续1的个数 III](https://leetcode.cn/problems/max-consecutive-ones-iii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/max-consecutive-ones-iii.md) | 数组、二分查找、前缀和、滑动窗口 | 中等 | +| [1658. 将 x 减到 0 的最小操作数](https://leetcode.cn/problems/minimum-operations-to-reduce-x-to-zero/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/minimum-operations-to-reduce-x-to-zero.md) | 数组、哈希表、二分查找、前缀和、滑动窗口 | 中等 | +| [0424. 替换后的最长重复字符](https://leetcode.cn/problems/longest-repeating-character-replacement/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/longest-repeating-character-replacement.md) | 哈希表、字符串、滑动窗口 | 中等 | +| [0003. 无重复字符的最长子串](https://leetcode.cn/problems/longest-substring-without-repeating-characters/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-substring-without-repeating-characters.md) | 哈希表、字符串、滑动窗口 | 中等 | +| [1695. 删除子数组的最大得分](https://leetcode.cn/problems/maximum-erasure-value/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/maximum-erasure-value.md) | 数组、哈希表、滑动窗口 | 中等 | +| [1208. 尽可能使字符串相等](https://leetcode.cn/problems/get-equal-substrings-within-budget/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/get-equal-substrings-within-budget.md) | 字符串、二分查找、前缀和、滑动窗口 | 中等 | +| [1493. 删掉一个元素以后全为 1 的最长子数组](https://leetcode.cn/problems/longest-subarray-of-1s-after-deleting-one-element/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/longest-subarray-of-1s-after-deleting-one-element.md) | 数组、动态规划、滑动窗口 | 中等 | +| [0727. 最小窗口子序列](https://leetcode.cn/problems/minimum-window-subsequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/minimum-window-subsequence.md) | 字符串、动态规划、滑动窗口 | 困难 | +| [0159. 至多包含两个不同字符的最长子串](https://leetcode.cn/problems/longest-substring-with-at-most-two-distinct-characters/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/longest-substring-with-at-most-two-distinct-characters.md) | 哈希表、字符串、滑动窗口 | 中等 | +| [0340. 至多包含 K 个不同字符的最长子串](https://leetcode.cn/problems/longest-substring-with-at-most-k-distinct-characters/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/longest-substring-with-at-most-k-distinct-characters.md) | 哈希表、字符串、滑动窗口 | 中等 | +| [0795. 区间子数组个数](https://leetcode.cn/problems/number-of-subarrays-with-bounded-maximum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/number-of-subarrays-with-bounded-maximum.md) | 数组、双指针 | 中等 | +| [0992. K 个不同整数的子数组](https://leetcode.cn/problems/subarrays-with-k-different-integers/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/subarrays-with-k-different-integers.md) | 数组、哈希表、计数、滑动窗口 | 困难 | +| [0713. 乘积小于 K 的子数组](https://leetcode.cn/problems/subarray-product-less-than-k/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/subarray-product-less-than-k.md) | 数组、二分查找、前缀和、滑动窗口 | 中等 | +| [0904. 水果成篮](https://leetcode.cn/problems/fruit-into-baskets/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/fruit-into-baskets.md) | 数组、哈希表、滑动窗口 | 中等 | +| [1358. 包含所有三种字符的子字符串数目](https://leetcode.cn/problems/number-of-substrings-containing-all-three-characters/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/number-of-substrings-containing-all-three-characters.md) | 哈希表、字符串、滑动窗口 | 中等 | +| [0467. 环绕字符串中唯一的子字符串](https://leetcode.cn/problems/unique-substrings-in-wraparound-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/unique-substrings-in-wraparound-string.md) | 字符串、动态规划 | 中等 | +| [1438. 绝对差不超过限制的最长连续子数组](https://leetcode.cn/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.md) | 队列、数组、有序集合、滑动窗口、单调队列、堆（优先队列） | 中等 | + + +## 第 2 章 链表 + +### 链表基础题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0707. 设计链表](https://leetcode.cn/problems/design-linked-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/design-linked-list.md) | 设计、链表 | 中等 | +| [0083. 删除排序链表中的重复元素](https://leetcode.cn/problems/remove-duplicates-from-sorted-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-duplicates-from-sorted-list.md) | 链表 | 简单 | +| [0082. 删除排序链表中的重复元素 II](https://leetcode.cn/problems/remove-duplicates-from-sorted-list-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-duplicates-from-sorted-list-ii.md) | 链表、双指针 | 中等 | +| [0206. 反转链表](https://leetcode.cn/problems/reverse-linked-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/reverse-linked-list.md) | 递归、链表 | 简单 | +| [0092. 反转链表 II](https://leetcode.cn/problems/reverse-linked-list-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/reverse-linked-list-ii.md) | 链表 | 中等 | +| [0025. K 个一组翻转链表](https://leetcode.cn/problems/reverse-nodes-in-k-group/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/reverse-nodes-in-k-group.md) | 递归、链表 | 困难 | +| [0203. 移除链表元素](https://leetcode.cn/problems/remove-linked-list-elements/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/remove-linked-list-elements.md) | 递归、链表 | 简单 | +| [0328. 奇偶链表](https://leetcode.cn/problems/odd-even-linked-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/odd-even-linked-list.md) | 链表 | 中等 | +| [0234. 回文链表](https://leetcode.cn/problems/palindrome-linked-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/palindrome-linked-list.md) | 栈、递归、链表、双指针 | 简单 | +| [0430. 扁平化多级双向链表](https://leetcode.cn/problems/flatten-a-multilevel-doubly-linked-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/flatten-a-multilevel-doubly-linked-list.md) | 深度优先搜索、链表、双向链表 | 中等 | +| [0138. 随机链表的复制](https://leetcode.cn/problems/copy-list-with-random-pointer/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/copy-list-with-random-pointer.md) | 哈希表、链表 | 中等 | +| [0061. 旋转链表](https://leetcode.cn/problems/rotate-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/rotate-list.md) | 链表、双指针 | 中等 | + + +### 链表排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0148. 排序链表](https://leetcode.cn/problems/sort-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/sort-list.md) | 链表、双指针、分治、排序、归并排序 | 中等 | +| [0021. 合并两个有序链表](https://leetcode.cn/problems/merge-two-sorted-lists/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-two-sorted-lists.md) | 递归、链表 | 简单 | +| [0023. 合并 K 个升序链表](https://leetcode.cn/problems/merge-k-sorted-lists/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-k-sorted-lists.md) | 链表、分治、堆（优先队列）、归并排序 | 困难 | +| [0147. 对链表进行插入排序](https://leetcode.cn/problems/insertion-sort-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/insertion-sort-list.md) | 链表、排序 | 中等 | + + +### 链表双指针题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0141. 环形链表](https://leetcode.cn/problems/linked-list-cycle/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/linked-list-cycle.md) | 哈希表、链表、双指针 | 简单 | +| [0142. 环形链表 II](https://leetcode.cn/problems/linked-list-cycle-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/linked-list-cycle-ii.md) | 哈希表、链表、双指针 | 中等 | +| [0160. 相交链表](https://leetcode.cn/problems/intersection-of-two-linked-lists/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/intersection-of-two-linked-lists.md) | 哈希表、链表、双指针 | 简单 | +| [0019. 删除链表的倒数第 N 个结点](https://leetcode.cn/problems/remove-nth-node-from-end-of-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-nth-node-from-end-of-list.md) | 链表、双指针 | 中等 | +| [0876. 链表的中间结点](https://leetcode.cn/problems/middle-of-the-linked-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/middle-of-the-linked-list.md) | 链表、双指针 | 简单 | +| [LCR 140. 训练计划 II](https://leetcode.cn/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof.md) | 链表、双指针 | 简单 | +| [0143. 重排链表](https://leetcode.cn/problems/reorder-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/reorder-list.md) | 栈、递归、链表、双指针 | 中等 | +| [0002. 两数相加](https://leetcode.cn/problems/add-two-numbers/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/add-two-numbers.md) | 递归、链表、数学 | 中等 | +| [0445. 两数相加 II](https://leetcode.cn/problems/add-two-numbers-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/add-two-numbers-ii.md) | 栈、链表、数学 | 中等 | + + +## 第 3 章 栈、队列、哈希表 + +### 栈基础题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [1047. 删除字符串中的所有相邻重复项](https://leetcode.cn/problems/remove-all-adjacent-duplicates-in-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/remove-all-adjacent-duplicates-in-string.md) | 栈、字符串 | 简单 | +| [0155. 最小栈](https://leetcode.cn/problems/min-stack/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/min-stack.md) | 栈、设计 | 中等 | +| [0020. 有效的括号](https://leetcode.cn/problems/valid-parentheses/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/valid-parentheses.md) | 栈、字符串 | 简单 | +| [0227. 基本计算器 II](https://leetcode.cn/problems/basic-calculator-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/basic-calculator-ii.md) | 栈、数学、字符串 | 中等 | +| [0739. 每日温度](https://leetcode.cn/problems/daily-temperatures/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/daily-temperatures.md) | 栈、数组、单调栈 | 中等 | +| [0150. 逆波兰表达式求值](https://leetcode.cn/problems/evaluate-reverse-polish-notation/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/evaluate-reverse-polish-notation.md) | 栈、数组、数学 | 中等 | +| [0232. 用栈实现队列](https://leetcode.cn/problems/implement-queue-using-stacks/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/implement-queue-using-stacks.md) | 栈、设计、队列 | 简单 | +| [LCR 125. 图书整理 II](https://leetcode.cn/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/yong-liang-ge-zhan-shi-xian-dui-lie-lcof.md) | 栈、设计、队列 | 简单 | +| [0394. 字符串解码](https://leetcode.cn/problems/decode-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/decode-string.md) | 栈、递归、字符串 | 中等 | +| [0032. 最长有效括号](https://leetcode.cn/problems/longest-valid-parentheses/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-valid-parentheses.md) | 栈、字符串、动态规划 | 困难 | +| [0946. 验证栈序列](https://leetcode.cn/problems/validate-stack-sequences/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/validate-stack-sequences.md) | 栈、数组、模拟 | 中等 | +| [LCR 123. 图书整理 I](https://leetcode.cn/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/cong-wei-dao-tou-da-yin-lian-biao-lcof.md) | 栈、递归、链表、双指针 | 简单 | +| [0071. 简化路径](https://leetcode.cn/problems/simplify-path/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/simplify-path.md) | 栈、字符串 | 中等 | + + +### 单调栈题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0739. 每日温度](https://leetcode.cn/problems/daily-temperatures/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/daily-temperatures.md) | 栈、数组、单调栈 | 中等 | +| [0496. 下一个更大元素 I](https://leetcode.cn/problems/next-greater-element-i/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/next-greater-element-i.md) | 栈、数组、哈希表、单调栈 | 简单 | +| [0503. 下一个更大元素 II](https://leetcode.cn/problems/next-greater-element-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/next-greater-element-ii.md) | 栈、数组、单调栈 | 中等 | +| [0901. 股票价格跨度](https://leetcode.cn/problems/online-stock-span/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/online-stock-span.md) | 栈、设计、数据流、单调栈 | 中等 | +| [0084. 柱状图中最大的矩形](https://leetcode.cn/problems/largest-rectangle-in-histogram/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/largest-rectangle-in-histogram.md) | 栈、数组、单调栈 | 困难 | +| [0316. 去除重复字母](https://leetcode.cn/problems/remove-duplicate-letters/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/remove-duplicate-letters.md) | 栈、贪心、字符串、单调栈 | 中等 | +| [0042. 接雨水](https://leetcode.cn/problems/trapping-rain-water/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/trapping-rain-water.md) | 栈、数组、双指针、动态规划、单调栈 | 困难 | +| [0085. 最大矩形](https://leetcode.cn/problems/maximal-rectangle/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/maximal-rectangle.md) | 栈、数组、动态规划、矩阵、单调栈 | 困难 | +| [0862. 和至少为 K 的最短子数组](https://leetcode.cn/problems/shortest-subarray-with-sum-at-least-k/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/shortest-subarray-with-sum-at-least-k.md) | 队列、数组、二分查找、前缀和、滑动窗口、单调队列、堆（优先队列） | 困难 | + + +### 队列基础题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0622. 设计循环队列](https://leetcode.cn/problems/design-circular-queue/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/design-circular-queue.md) | 设计、队列、数组、链表 | 中等 | +| [0346. 数据流中的移动平均值](https://leetcode.cn/problems/moving-average-from-data-stream/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/moving-average-from-data-stream.md) | 设计、队列、数组、数据流 | 简单 | +| [0225. 用队列实现栈](https://leetcode.cn/problems/implement-stack-using-queues/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/implement-stack-using-queues.md) | 栈、设计、队列 | 简单 | + + +### 优先队列题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0703. 数据流中的第 K 大元素](https://leetcode.cn/problems/kth-largest-element-in-a-stream/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/kth-largest-element-in-a-stream.md) | 树、设计、二叉搜索树、二叉树、数据流、堆（优先队列） | 简单 | +| [0347. 前 K 个高频元素](https://leetcode.cn/problems/top-k-frequent-elements/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/top-k-frequent-elements.md) | 数组、哈希表、分治、桶排序、计数、快速选择、排序、堆（优先队列） | 中等 | +| [0451. 根据字符出现频率排序](https://leetcode.cn/problems/sort-characters-by-frequency/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/sort-characters-by-frequency.md) | 哈希表、字符串、桶排序、计数、排序、堆（优先队列） | 中等 | +| [0973. 最接近原点的 K 个点](https://leetcode.cn/problems/k-closest-points-to-origin/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/k-closest-points-to-origin.md) | 几何、数组、数学、分治、快速选择、排序、堆（优先队列） | 中等 | +| [1296. 划分数组为连续数字的集合](https://leetcode.cn/problems/divide-array-in-sets-of-k-consecutive-numbers/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/divide-array-in-sets-of-k-consecutive-numbers.md) | 贪心、数组、哈希表、排序 | 中等 | +| [0239. 滑动窗口最大值](https://leetcode.cn/problems/sliding-window-maximum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/sliding-window-maximum.md) | 队列、数组、滑动窗口、单调队列、堆（优先队列） | 困难 | +| [0295. 数据流的中位数](https://leetcode.cn/problems/find-median-from-data-stream/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/find-median-from-data-stream.md) | 设计、双指针、数据流、排序、堆（优先队列） | 困难 | +| [0023. 合并 K 个升序链表](https://leetcode.cn/problems/merge-k-sorted-lists/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-k-sorted-lists.md) | 链表、分治、堆（优先队列）、归并排序 | 困难 | +| [0218. 天际线问题](https://leetcode.cn/problems/the-skyline-problem/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/the-skyline-problem.md) | 树状数组、线段树、数组、分治、有序集合、扫描线、堆（优先队列） | 困难 | + + +### 哈希表题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0705. 设计哈希集合](https://leetcode.cn/problems/design-hashset/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/design-hashset.md) | 设计、数组、哈希表、链表、哈希函数 | 简单 | +| [0706. 设计哈希映射](https://leetcode.cn/problems/design-hashmap/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/design-hashmap.md) | 设计、数组、哈希表、链表、哈希函数 | 简单 | +| [0217. 存在重复元素](https://leetcode.cn/problems/contains-duplicate/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/contains-duplicate.md) | 数组、哈希表、排序 | 简单 | +| [0219. 存在重复元素 II](https://leetcode.cn/problems/contains-duplicate-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/contains-duplicate-ii.md) | 数组、哈希表、滑动窗口 | 简单 | +| [0220. 存在重复元素 III](https://leetcode.cn/problems/contains-duplicate-iii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/contains-duplicate-iii.md) | 数组、桶排序、有序集合、排序、滑动窗口 | 困难 | +| [1941. 检查是否所有字符出现次数相同](https://leetcode.cn/problems/check-if-all-characters-have-equal-number-of-occurrences/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/check-if-all-characters-have-equal-number-of-occurrences.md) | 哈希表、字符串、计数 | 简单 | +| [0136. 只出现一次的数字](https://leetcode.cn/problems/single-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/single-number.md) | 位运算、数组 | 简单 | +| [0383. 赎金信](https://leetcode.cn/problems/ransom-note/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/ransom-note.md) | 哈希表、字符串、计数 | 简单 | +| [0349. 两个数组的交集](https://leetcode.cn/problems/intersection-of-two-arrays/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/intersection-of-two-arrays.md) | 数组、哈希表、双指针、二分查找、排序 | 简单 | +| [0350. 两个数组的交集 II](https://leetcode.cn/problems/intersection-of-two-arrays-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/intersection-of-two-arrays-ii.md) | 数组、哈希表、双指针、二分查找、排序 | 简单 | +| [0036. 有效的数独](https://leetcode.cn/problems/valid-sudoku/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/valid-sudoku.md) | 数组、哈希表、矩阵 | 中等 | +| [0001. 两数之和](https://leetcode.cn/problems/two-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/two-sum.md) | 数组、哈希表 | 简单 | +| [0015. 三数之和](https://leetcode.cn/problems/3sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/3sum.md) | 数组、双指针、排序 | 中等 | +| [0018. 四数之和](https://leetcode.cn/problems/4sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/4sum.md) | 数组、双指针、排序 | 中等 | +| [0454. 四数相加 II](https://leetcode.cn/problems/4sum-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/4sum-ii.md) | 数组、哈希表 | 中等 | +| [0041. 缺失的第一个正数](https://leetcode.cn/problems/first-missing-positive/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/first-missing-positive.md) | 数组、哈希表 | 困难 | +| [0128. 最长连续序列](https://leetcode.cn/problems/longest-consecutive-sequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/longest-consecutive-sequence.md) | 并查集、数组、哈希表 | 中等 | +| [0202. 快乐数](https://leetcode.cn/problems/happy-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/happy-number.md) | 哈希表、数学、双指针 | 简单 | +| [0242. 有效的字母异位词](https://leetcode.cn/problems/valid-anagram/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/valid-anagram.md) | 哈希表、字符串、排序 | 简单 | +| [0205. 同构字符串](https://leetcode.cn/problems/isomorphic-strings/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/isomorphic-strings.md) | 哈希表、字符串 | 简单 | +| [0442. 数组中重复的数据](https://leetcode.cn/problems/find-all-duplicates-in-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/find-all-duplicates-in-an-array.md) | 数组、哈希表 | 中等 | +| [LCR 186. 文物朝代判断](https://leetcode.cn/problems/bu-ke-pai-zhong-de-shun-zi-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/bu-ke-pai-zhong-de-shun-zi-lcof.md) | 数组、排序 | 简单 | +| [0268. 丢失的数字](https://leetcode.cn/problems/missing-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/missing-number.md) | 位运算、数组、哈希表、数学、二分查找、排序 | 简单 | +| [LCR 120. 寻找文件副本](https://leetcode.cn/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/shu-zu-zhong-zhong-fu-de-shu-zi-lcof.md) | 数组、哈希表、排序 | 简单 | +| [0451. 根据字符出现频率排序](https://leetcode.cn/problems/sort-characters-by-frequency/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/sort-characters-by-frequency.md) | 哈希表、字符串、桶排序、计数、排序、堆（优先队列） | 中等 | +| [0049. 字母异位词分组](https://leetcode.cn/problems/group-anagrams/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/group-anagrams.md) | 数组、哈希表、字符串、排序 | 中等 | +| [0599. 两个列表的最小索引总和](https://leetcode.cn/problems/minimum-index-sum-of-two-lists/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/minimum-index-sum-of-two-lists.md) | 数组、哈希表、字符串 | 简单 | +| [0387. 字符串中的第一个唯一字符](https://leetcode.cn/problems/first-unique-character-in-a-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/first-unique-character-in-a-string.md) | 队列、哈希表、字符串、计数 | 简单 | +| [0447. 回旋镖的数量](https://leetcode.cn/problems/number-of-boomerangs/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/number-of-boomerangs.md) | 数组、哈希表、数学 | 中等 | +| [0149. 直线上最多的点数](https://leetcode.cn/problems/max-points-on-a-line/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/max-points-on-a-line.md) | 几何、数组、哈希表、数学 | 困难 | +| [0359. 日志速率限制器](https://leetcode.cn/problems/logger-rate-limiter/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/logger-rate-limiter.md) | 设计、哈希表、数据流 | 简单 | +| [0811. 子域名访问计数](https://leetcode.cn/problems/subdomain-visit-count/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/subdomain-visit-count.md) | 数组、哈希表、字符串、计数 | 中等 | + + +## 第 4 章 字符串 + +### 字符串基础题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0125. 验证回文串](https://leetcode.cn/problems/valid-palindrome/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/valid-palindrome.md) | 双指针、字符串 | 简单 | +| [0005. 最长回文子串](https://leetcode.cn/problems/longest-palindromic-substring/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-palindromic-substring.md) | 双指针、字符串、动态规划 | 中等 | +| [0003. 无重复字符的最长子串](https://leetcode.cn/problems/longest-substring-without-repeating-characters/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-substring-without-repeating-characters.md) | 哈希表、字符串、滑动窗口 | 中等 | +| [0344. 反转字符串](https://leetcode.cn/problems/reverse-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/reverse-string.md) | 双指针、字符串 | 简单 | +| [0557. 反转字符串中的单词 III](https://leetcode.cn/problems/reverse-words-in-a-string-iii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/reverse-words-in-a-string-iii.md) | 双指针、字符串 | 简单 | +| [0049. 字母异位词分组](https://leetcode.cn/problems/group-anagrams/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/group-anagrams.md) | 数组、哈希表、字符串、排序 | 中等 | +| [0415. 字符串相加](https://leetcode.cn/problems/add-strings/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/add-strings.md) | 数学、字符串、模拟 | 简单 | +| [0151. 反转字符串中的单词](https://leetcode.cn/problems/reverse-words-in-a-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/reverse-words-in-a-string.md) | 双指针、字符串 | 中等 | +| [0043. 字符串相乘](https://leetcode.cn/problems/multiply-strings/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/multiply-strings.md) | 数学、字符串、模拟 | 中等 | +| [0014. 最长公共前缀](https://leetcode.cn/problems/longest-common-prefix/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-common-prefix.md) | 字典树、数组、字符串 | 简单 | + + +### 单模式串匹配题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0028. 找出字符串中第一个匹配项的下标](https://leetcode.cn/problems/find-the-index-of-the-first-occurrence-in-a-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/find-the-index-of-the-first-occurrence-in-a-string.md) | 双指针、字符串、字符串匹配 | 简单 | +| [0459. 重复的子字符串](https://leetcode.cn/problems/repeated-substring-pattern/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/repeated-substring-pattern.md) | 字符串、字符串匹配 | 简单 | +| [0686. 重复叠加字符串匹配](https://leetcode.cn/problems/repeated-string-match/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/repeated-string-match.md) | 字符串、字符串匹配 | 中等 | +| [1668. 最大重复子字符串](https://leetcode.cn/problems/maximum-repeating-substring/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/maximum-repeating-substring.md) | 字符串、动态规划、字符串匹配 | 简单 | +| [0796. 旋转字符串](https://leetcode.cn/problems/rotate-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/rotate-string.md) | 字符串、字符串匹配 | 简单 | +| [1408. 数组中的字符串匹配](https://leetcode.cn/problems/string-matching-in-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/string-matching-in-an-array.md) | 数组、字符串、字符串匹配 | 简单 | +| [2156. 查找给定哈希值的子串](https://leetcode.cn/problems/find-substring-with-given-hash-value/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2100-2199/find-substring-with-given-hash-value.md) | 字符串、滑动窗口、哈希函数、滚动哈希 | 困难 | + + +### 字典树题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0208. 实现 Trie (前缀树)](https://leetcode.cn/problems/implement-trie-prefix-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/implement-trie-prefix-tree.md) | 设计、字典树、哈希表、字符串 | 中等 | +| [0677. 键值映射](https://leetcode.cn/problems/map-sum-pairs/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/map-sum-pairs.md) | 设计、字典树、哈希表、字符串 | 中等 | +| [0648. 单词替换](https://leetcode.cn/problems/replace-words/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/replace-words.md) | 字典树、数组、哈希表、字符串 | 中等 | +| [0642. 设计搜索自动补全系统](https://leetcode.cn/problems/design-search-autocomplete-system/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/design-search-autocomplete-system.md) | 深度优先搜索、设计、字典树、字符串、数据流、排序、堆（优先队列） | 困难 | +| [0211. 添加与搜索单词 - 数据结构设计](https://leetcode.cn/problems/design-add-and-search-words-data-structure/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/design-add-and-search-words-data-structure.md) | 深度优先搜索、设计、字典树、字符串 | 中等 | +| [0421. 数组中两个数的最大异或值](https://leetcode.cn/problems/maximum-xor-of-two-numbers-in-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/maximum-xor-of-two-numbers-in-an-array.md) | 位运算、字典树、数组、哈希表 | 中等 | +| [0212. 单词搜索 II](https://leetcode.cn/problems/word-search-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/word-search-ii.md) | 字典树、数组、字符串、回溯、矩阵 | 困难 | +| [0425. 单词方块](https://leetcode.cn/problems/word-squares/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/word-squares.md) | 字典树、数组、字符串、回溯 | 困难 | +| [0336. 回文对](https://leetcode.cn/problems/palindrome-pairs/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/palindrome-pairs.md) | 字典树、数组、哈希表、字符串 | 困难 | +| [1023. 驼峰式匹配](https://leetcode.cn/problems/camelcase-matching/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/camelcase-matching.md) | 字典树、数组、双指针、字符串、字符串匹配 | 中等 | +| [0676. 实现一个魔法字典](https://leetcode.cn/problems/implement-magic-dictionary/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/implement-magic-dictionary.md) | 深度优先搜索、设计、字典树、哈希表、字符串 | 中等 | +| [0440. 字典序的第K小数字](https://leetcode.cn/problems/k-th-smallest-in-lexicographical-order/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/k-th-smallest-in-lexicographical-order.md) | 字典树 | 困难 | + + +## 第 5 章 树 + +### 二叉树的遍历题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0144. 二叉树的前序遍历](https://leetcode.cn/problems/binary-tree-preorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-preorder-traversal.md) | 栈、树、深度优先搜索、二叉树 | 简单 | +| [0094. 二叉树的中序遍历](https://leetcode.cn/problems/binary-tree-inorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/binary-tree-inorder-traversal.md) | 栈、树、深度优先搜索、二叉树 | 简单 | +| [0145. 二叉树的后序遍历](https://leetcode.cn/problems/binary-tree-postorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-postorder-traversal.md) | 栈、树、深度优先搜索、二叉树 | 简单 | +| [0102. 二叉树的层序遍历](https://leetcode.cn/problems/binary-tree-level-order-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-level-order-traversal.md) | 树、广度优先搜索、二叉树 | 中等 | +| [0103. 二叉树的锯齿形层序遍历](https://leetcode.cn/problems/binary-tree-zigzag-level-order-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-zigzag-level-order-traversal.md) | 树、广度优先搜索、二叉树 | 中等 | +| [0107. 二叉树的层序遍历 II](https://leetcode.cn/problems/binary-tree-level-order-traversal-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-level-order-traversal-ii.md) | 树、广度优先搜索、二叉树 | 中等 | +| [0104. 二叉树的最大深度](https://leetcode.cn/problems/maximum-depth-of-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/maximum-depth-of-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0111. 二叉树的最小深度](https://leetcode.cn/problems/minimum-depth-of-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/minimum-depth-of-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0124. 二叉树中的最大路径和](https://leetcode.cn/problems/binary-tree-maximum-path-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-maximum-path-sum.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | +| [0101. 对称二叉树](https://leetcode.cn/problems/symmetric-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/symmetric-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0112. 路径总和](https://leetcode.cn/problems/path-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/path-sum.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0113. 路径总和 II](https://leetcode.cn/problems/path-sum-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/path-sum-ii.md) | 树、深度优先搜索、回溯、二叉树 | 中等 | +| [0236. 二叉树的最近公共祖先](https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/lowest-common-ancestor-of-a-binary-tree.md) | 树、深度优先搜索、二叉树 | 中等 | +| [0199. 二叉树的右视图](https://leetcode.cn/problems/binary-tree-right-side-view/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-right-side-view.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | +| [0226. 翻转二叉树](https://leetcode.cn/problems/invert-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/invert-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0958. 二叉树的完全性检验](https://leetcode.cn/problems/check-completeness-of-a-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/check-completeness-of-a-binary-tree.md) | 树、广度优先搜索、二叉树 | 中等 | +| [0572. 另一棵树的子树](https://leetcode.cn/problems/subtree-of-another-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/subtree-of-another-tree.md) | 树、深度优先搜索、二叉树、字符串匹配、哈希函数 | 简单 | +| [0100. 相同的树](https://leetcode.cn/problems/same-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/same-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0116. 填充每个节点的下一个右侧节点指针](https://leetcode.cn/problems/populating-next-right-pointers-in-each-node/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/populating-next-right-pointers-in-each-node.md) | 树、深度优先搜索、广度优先搜索、链表、二叉树 | 中等 | +| [0117. 填充每个节点的下一个右侧节点指针 II](https://leetcode.cn/problems/populating-next-right-pointers-in-each-node-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/populating-next-right-pointers-in-each-node-ii.md) | 树、深度优先搜索、广度优先搜索、链表、二叉树 | 中等 | +| [0297. 二叉树的序列化与反序列化](https://leetcode.cn/problems/serialize-and-deserialize-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/serialize-and-deserialize-binary-tree.md) | 树、深度优先搜索、广度优先搜索、设计、字符串、二叉树 | 困难 | +| [0114. 二叉树展开为链表](https://leetcode.cn/problems/flatten-binary-tree-to-linked-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/flatten-binary-tree-to-linked-list.md) | 栈、树、深度优先搜索、链表、二叉树 | 中等 | + + +### 二叉树的还原题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0105. 从前序与中序遍历序列构造二叉树](https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/construct-binary-tree-from-preorder-and-inorder-traversal.md) | 树、数组、哈希表、分治、二叉树 | 中等 | +| [0106. 从中序与后序遍历序列构造二叉树](https://leetcode.cn/problems/construct-binary-tree-from-inorder-and-postorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/construct-binary-tree-from-inorder-and-postorder-traversal.md) | 树、数组、哈希表、分治、二叉树 | 中等 | +| [0889. 根据前序和后序遍历构造二叉树](https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-postorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/construct-binary-tree-from-preorder-and-postorder-traversal.md) | 树、数组、哈希表、分治、二叉树 | 中等 | + + +### 二叉搜索树题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0098. 验证二叉搜索树](https://leetcode.cn/problems/validate-binary-search-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/validate-binary-search-tree.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | +| [0173. 二叉搜索树迭代器](https://leetcode.cn/problems/binary-search-tree-iterator/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-search-tree-iterator.md) | 栈、树、设计、二叉搜索树、二叉树、迭代器 | 中等 | +| [0700. 二叉搜索树中的搜索](https://leetcode.cn/problems/search-in-a-binary-search-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/search-in-a-binary-search-tree.md) | 树、二叉搜索树、二叉树 | 简单 | +| [0701. 二叉搜索树中的插入操作](https://leetcode.cn/problems/insert-into-a-binary-search-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/insert-into-a-binary-search-tree.md) | 树、二叉搜索树、二叉树 | 中等 | +| [0450. 删除二叉搜索树中的节点](https://leetcode.cn/problems/delete-node-in-a-bst/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/delete-node-in-a-bst.md) | 树、二叉搜索树、二叉树 | 中等 | +| [0703. 数据流中的第 K 大元素](https://leetcode.cn/problems/kth-largest-element-in-a-stream/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/kth-largest-element-in-a-stream.md) | 树、设计、二叉搜索树、二叉树、数据流、堆（优先队列） | 简单 | +| [LCR 174. 寻找二叉搜索树中的目标节点](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 简单 | +| [0230. 二叉搜索树中第 K 小的元素](https://leetcode.cn/problems/kth-smallest-element-in-a-bst/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/kth-smallest-element-in-a-bst.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | +| [0235. 二叉搜索树的最近公共祖先](https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-search-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/lowest-common-ancestor-of-a-binary-search-tree.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | +| [0426. 将二叉搜索树转化为排序的双向链表](https://leetcode.cn/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/convert-binary-search-tree-to-sorted-doubly-linked-list.md) | 栈、树、深度优先搜索、二叉搜索树、链表、二叉树、双向链表 | 中等 | +| [0108. 将有序数组转换为二叉搜索树](https://leetcode.cn/problems/convert-sorted-array-to-binary-search-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/convert-sorted-array-to-binary-search-tree.md) | 树、二叉搜索树、数组、分治、二叉树 | 简单 | +| [0110. 平衡二叉树](https://leetcode.cn/problems/balanced-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/balanced-binary-tree.md) | 树、深度优先搜索、二叉树 | 简单 | + + +### 线段树题目 + +#### 单点更新题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0303. 区域和检索 - 数组不可变](https://leetcode.cn/problems/range-sum-query-immutable/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/range-sum-query-immutable.md) | 设计、数组、前缀和 | 简单 | +| [0307. 区域和检索 - 数组可修改](https://leetcode.cn/problems/range-sum-query-mutable/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/range-sum-query-mutable.md) | 设计、树状数组、线段树、数组 | 中等 | +| [0354. 俄罗斯套娃信封问题](https://leetcode.cn/problems/russian-doll-envelopes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/russian-doll-envelopes.md) | 数组、二分查找、动态规划、排序 | 困难 | + + +#### 区间更新题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0370. 区间加法](https://leetcode.cn/problems/range-addition/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/range-addition.md) | 数组、前缀和 | 中等 | +| [1109. 航班预订统计](https://leetcode.cn/problems/corporate-flight-bookings/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/corporate-flight-bookings.md) | 数组、前缀和 | 中等 | +| [1450. 在既定时间做作业的学生人数](https://leetcode.cn/problems/number-of-students-doing-homework-at-a-given-time/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/number-of-students-doing-homework-at-a-given-time.md) | 数组 | 简单 | +| [0673. 最长递增子序列的个数](https://leetcode.cn/problems/number-of-longest-increasing-subsequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/number-of-longest-increasing-subsequence.md) | 树状数组、线段树、数组、动态规划 | 中等 | +| [1310. 子数组异或查询](https://leetcode.cn/problems/xor-queries-of-a-subarray/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/xor-queries-of-a-subarray.md) | 位运算、数组、前缀和 | 中等 | +| [1851. 包含每个查询的最小区间](https://leetcode.cn/problems/minimum-interval-to-include-each-query/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1800-1899/minimum-interval-to-include-each-query.md) | 数组、二分查找、排序、扫描线、堆（优先队列） | 困难 | + + +#### 区间合并题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0729. 我的日程安排表 I](https://leetcode.cn/problems/my-calendar-i/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/my-calendar-i.md) | 设计、线段树、数组、二分查找、有序集合 | 中等 | +| [0731. 我的日程安排表 II](https://leetcode.cn/problems/my-calendar-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/my-calendar-ii.md) | 设计、线段树、数组、二分查找、有序集合、前缀和 | 中等 | +| [0732. 我的日程安排表 III](https://leetcode.cn/problems/my-calendar-iii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/my-calendar-iii.md) | 设计、线段树、二分查找、有序集合、前缀和 | 困难 | + + +#### 扫描线问题题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0218. 天际线问题](https://leetcode.cn/problems/the-skyline-problem/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/the-skyline-problem.md) | 树状数组、线段树、数组、分治、有序集合、扫描线、堆（优先队列） | 困难 | +| [0391. 完美矩形](https://leetcode.cn/problems/perfect-rectangle/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/perfect-rectangle.md) | 数组、扫描线 | 困难 | +| [0850. 矩形面积 II](https://leetcode.cn/problems/rectangle-area-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/rectangle-area-ii.md) | 线段树、数组、有序集合、扫描线 | 困难 | + + +### 树状数组题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0303. 区域和检索 - 数组不可变](https://leetcode.cn/problems/range-sum-query-immutable/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/range-sum-query-immutable.md) | 设计、数组、前缀和 | 简单 | +| [0307. 区域和检索 - 数组可修改](https://leetcode.cn/problems/range-sum-query-mutable/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/range-sum-query-mutable.md) | 设计、树状数组、线段树、数组 | 中等 | +| [0315. 计算右侧小于当前元素的个数](https://leetcode.cn/problems/count-of-smaller-numbers-after-self/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/count-of-smaller-numbers-after-self.md) | 树状数组、线段树、数组、二分查找、分治、有序集合、归并排序 | 困难 | +| [1450. 在既定时间做作业的学生人数](https://leetcode.cn/problems/number-of-students-doing-homework-at-a-given-time/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/number-of-students-doing-homework-at-a-given-time.md) | 数组 | 简单 | +| [0354. 俄罗斯套娃信封问题](https://leetcode.cn/problems/russian-doll-envelopes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/russian-doll-envelopes.md) | 数组、二分查找、动态规划、排序 | 困难 | +| [0673. 最长递增子序列的个数](https://leetcode.cn/problems/number-of-longest-increasing-subsequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/number-of-longest-increasing-subsequence.md) | 树状数组、线段树、数组、动态规划 | 中等 | +| [1310. 子数组异或查询](https://leetcode.cn/problems/xor-queries-of-a-subarray/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/xor-queries-of-a-subarray.md) | 位运算、数组、前缀和 | 中等 | +| [1893. 检查是否区域内所有整数都被覆盖](https://leetcode.cn/problems/check-if-all-the-integers-in-a-range-are-covered/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1800-1899/check-if-all-the-integers-in-a-range-are-covered.md) | 数组、哈希表、前缀和 | 简单 | + + +### 并查集题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0990. 等式方程的可满足性](https://leetcode.cn/problems/satisfiability-of-equality-equations/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/satisfiability-of-equality-equations.md) | 并查集、图、数组、字符串 | 中等 | +| [0547. 省份数量](https://leetcode.cn/problems/number-of-provinces/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/number-of-provinces.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | +| [0684. 冗余连接](https://leetcode.cn/problems/redundant-connection/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/redundant-connection.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | +| [1319. 连通网络的操作次数](https://leetcode.cn/problems/number-of-operations-to-make-network-connected/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/number-of-operations-to-make-network-connected.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | +| [0765. 情侣牵手](https://leetcode.cn/problems/couples-holding-hands/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/couples-holding-hands.md) | 贪心、深度优先搜索、广度优先搜索、并查集、图 | 困难 | +| [0399. 除法求值](https://leetcode.cn/problems/evaluate-division/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/evaluate-division.md) | 深度优先搜索、广度优先搜索、并查集、图、数组、字符串、最短路 | 中等 | +| [0959. 由斜杠划分区域](https://leetcode.cn/problems/regions-cut-by-slashes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/regions-cut-by-slashes.md) | 深度优先搜索、广度优先搜索、并查集、数组、哈希表、矩阵 | 中等 | +| [1631. 最小体力消耗路径](https://leetcode.cn/problems/path-with-minimum-effort/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/path-with-minimum-effort.md) | 深度优先搜索、广度优先搜索、并查集、数组、二分查找、矩阵、堆（优先队列） | 中等 | +| [0778. 水位上升的泳池中游泳](https://leetcode.cn/problems/swim-in-rising-water/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/swim-in-rising-water.md) | 深度优先搜索、广度优先搜索、并查集、数组、二分查找、矩阵、堆（优先队列） | 困难 | +| [1202. 交换字符串中的元素](https://leetcode.cn/problems/smallest-string-with-swaps/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/smallest-string-with-swaps.md) | 深度优先搜索、广度优先搜索、并查集、数组、哈希表、字符串、排序 | 中等 | +| [0947. 移除最多的同行或同列石头](https://leetcode.cn/problems/most-stones-removed-with-same-row-or-column/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/most-stones-removed-with-same-row-or-column.md) | 深度优先搜索、并查集、图、哈希表 | 中等 | +| [0803. 打砖块](https://leetcode.cn/problems/bricks-falling-when-hit/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/bricks-falling-when-hit.md) | 并查集、数组、矩阵 | 困难 | +| [0128. 最长连续序列](https://leetcode.cn/problems/longest-consecutive-sequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/longest-consecutive-sequence.md) | 并查集、数组、哈希表 | 中等 | + + +## 第 6 章 图论 + +### 深度优先搜索题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0797. 所有可能的路径](https://leetcode.cn/problems/all-paths-from-source-to-target/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/all-paths-from-source-to-target.md) | 深度优先搜索、广度优先搜索、图、回溯 | 中等 | +| [0200. 岛屿数量](https://leetcode.cn/problems/number-of-islands/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/number-of-islands.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | +| [0695. 岛屿的最大面积](https://leetcode.cn/problems/max-area-of-island/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/max-area-of-island.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | +| [0133. 克隆图](https://leetcode.cn/problems/clone-graph/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/clone-graph.md) | 深度优先搜索、广度优先搜索、图、哈希表 | 中等 | +| [0494. 目标和](https://leetcode.cn/problems/target-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/target-sum.md) | 数组、动态规划、回溯 | 中等 | +| [0144. 二叉树的前序遍历](https://leetcode.cn/problems/binary-tree-preorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-preorder-traversal.md) | 栈、树、深度优先搜索、二叉树 | 简单 | +| [0094. 二叉树的中序遍历](https://leetcode.cn/problems/binary-tree-inorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/binary-tree-inorder-traversal.md) | 栈、树、深度优先搜索、二叉树 | 简单 | +| [0145. 二叉树的后序遍历](https://leetcode.cn/problems/binary-tree-postorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-postorder-traversal.md) | 栈、树、深度优先搜索、二叉树 | 简单 | +| [0589. N 叉树的前序遍历](https://leetcode.cn/problems/n-ary-tree-preorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/n-ary-tree-preorder-traversal.md) | 栈、树、深度优先搜索 | 简单 | +| [0590. N 叉树的后序遍历](https://leetcode.cn/problems/n-ary-tree-postorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/n-ary-tree-postorder-traversal.md) | 栈、树、深度优先搜索 | 简单 | +| [0124. 二叉树中的最大路径和](https://leetcode.cn/problems/binary-tree-maximum-path-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-maximum-path-sum.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | +| [0199. 二叉树的右视图](https://leetcode.cn/problems/binary-tree-right-side-view/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-right-side-view.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | +| [0543. 二叉树的直径](https://leetcode.cn/problems/diameter-of-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/diameter-of-binary-tree.md) | 树、深度优先搜索、二叉树 | 简单 | +| [0662. 二叉树最大宽度](https://leetcode.cn/problems/maximum-width-of-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/maximum-width-of-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | +| [0958. 二叉树的完全性检验](https://leetcode.cn/problems/check-completeness-of-a-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/check-completeness-of-a-binary-tree.md) | 树、广度优先搜索、二叉树 | 中等 | +| [0572. 另一棵树的子树](https://leetcode.cn/problems/subtree-of-another-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/subtree-of-another-tree.md) | 树、深度优先搜索、二叉树、字符串匹配、哈希函数 | 简单 | +| [0100. 相同的树](https://leetcode.cn/problems/same-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/same-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0111. 二叉树的最小深度](https://leetcode.cn/problems/minimum-depth-of-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/minimum-depth-of-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0841. 钥匙和房间](https://leetcode.cn/problems/keys-and-rooms/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/keys-and-rooms.md) | 深度优先搜索、广度优先搜索、图 | 中等 | +| [0129. 求根节点到叶节点数字之和](https://leetcode.cn/problems/sum-root-to-leaf-numbers/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/sum-root-to-leaf-numbers.md) | 树、深度优先搜索、二叉树 | 中等 | +| [0323. 无向图中连通分量的数目](https://leetcode.cn/problems/number-of-connected-components-in-an-undirected-graph/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/number-of-connected-components-in-an-undirected-graph.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | +| [0684. 冗余连接](https://leetcode.cn/problems/redundant-connection/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/redundant-connection.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | +| [0802. 找到最终的安全状态](https://leetcode.cn/problems/find-eventual-safe-states/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/find-eventual-safe-states.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | +| [0785. 判断二分图](https://leetcode.cn/problems/is-graph-bipartite/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/is-graph-bipartite.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | +| [0886. 可能的二分法](https://leetcode.cn/problems/possible-bipartition/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/possible-bipartition.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | +| [0323. 无向图中连通分量的数目](https://leetcode.cn/problems/number-of-connected-components-in-an-undirected-graph/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/number-of-connected-components-in-an-undirected-graph.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | +| [0130. 被围绕的区域](https://leetcode.cn/problems/surrounded-regions/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/surrounded-regions.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | +| [0417. 太平洋大西洋水流问题](https://leetcode.cn/problems/pacific-atlantic-water-flow/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/pacific-atlantic-water-flow.md) | 深度优先搜索、广度优先搜索、数组、矩阵 | 中等 | +| [1020. 飞地的数量](https://leetcode.cn/problems/number-of-enclaves/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/number-of-enclaves.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | +| [1254. 统计封闭岛屿的数目](https://leetcode.cn/problems/number-of-closed-islands/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/number-of-closed-islands.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | +| [1034. 边界着色](https://leetcode.cn/problems/coloring-a-border/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/coloring-a-border.md) | 深度优先搜索、广度优先搜索、数组、矩阵 | 中等 | +| [LCR 130. 衣橱整理](https://leetcode.cn/problems/ji-qi-ren-de-yun-dong-fan-wei-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/ji-qi-ren-de-yun-dong-fan-wei-lcof.md) | 深度优先搜索、广度优先搜索、动态规划 | 中等 | +| [0529. 扫雷游戏](https://leetcode.cn/problems/minesweeper/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/minesweeper.md) | 深度优先搜索、广度优先搜索、数组、矩阵 | 中等 | + + +### 广度优先搜索题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0797. 所有可能的路径](https://leetcode.cn/problems/all-paths-from-source-to-target/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/all-paths-from-source-to-target.md) | 深度优先搜索、广度优先搜索、图、回溯 | 中等 | +| [0286. 墙与门](https://leetcode.cn/problems/walls-and-gates/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/walls-and-gates.md) | 广度优先搜索、数组、矩阵 | 中等 | +| [0200. 岛屿数量](https://leetcode.cn/problems/number-of-islands/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/number-of-islands.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | +| [0752. 打开转盘锁](https://leetcode.cn/problems/open-the-lock/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/open-the-lock.md) | 广度优先搜索、数组、哈希表、字符串 | 中等 | +| [0279. 完全平方数](https://leetcode.cn/problems/perfect-squares/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/perfect-squares.md) | 广度优先搜索、数学、动态规划 | 中等 | +| [0133. 克隆图](https://leetcode.cn/problems/clone-graph/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/clone-graph.md) | 深度优先搜索、广度优先搜索、图、哈希表 | 中等 | +| [0733. 图像渲染](https://leetcode.cn/problems/flood-fill/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/flood-fill.md) | 深度优先搜索、广度优先搜索、数组、矩阵 | 简单 | +| [0542. 01 矩阵](https://leetcode.cn/problems/01-matrix/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/01-matrix.md) | 广度优先搜索、数组、动态规划、矩阵 | 中等 | +| [0322. 零钱兑换](https://leetcode.cn/problems/coin-change/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/coin-change.md) | 广度优先搜索、数组、动态规划 | 中等 | +| [0323. 无向图中连通分量的数目](https://leetcode.cn/problems/number-of-connected-components-in-an-undirected-graph/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/number-of-connected-components-in-an-undirected-graph.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | +| [LCR 130. 衣橱整理](https://leetcode.cn/problems/ji-qi-ren-de-yun-dong-fan-wei-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/ji-qi-ren-de-yun-dong-fan-wei-lcof.md) | 深度优先搜索、广度优先搜索、动态规划 | 中等 | +| [0199. 二叉树的右视图](https://leetcode.cn/problems/binary-tree-right-side-view/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-right-side-view.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | +| [0662. 二叉树最大宽度](https://leetcode.cn/problems/maximum-width-of-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/maximum-width-of-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | +| [0958. 二叉树的完全性检验](https://leetcode.cn/problems/check-completeness-of-a-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/check-completeness-of-a-binary-tree.md) | 树、广度优先搜索、二叉树 | 中等 | +| [0572. 另一棵树的子树](https://leetcode.cn/problems/subtree-of-another-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/subtree-of-another-tree.md) | 树、深度优先搜索、二叉树、字符串匹配、哈希函数 | 简单 | +| [0100. 相同的树](https://leetcode.cn/problems/same-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/same-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0111. 二叉树的最小深度](https://leetcode.cn/problems/minimum-depth-of-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/minimum-depth-of-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [LCR 151. 彩灯装饰记录 III](https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof.md) | 树、广度优先搜索、二叉树 | 中等 | + + +### 图的拓扑排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0207. 课程表](https://leetcode.cn/problems/course-schedule/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/course-schedule.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | +| [0210. 课程表 II](https://leetcode.cn/problems/course-schedule-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/course-schedule-ii.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | +| [1136. 并行课程](https://leetcode.cn/problems/parallel-courses/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/parallel-courses.md) | 图、拓扑排序 | 中等 | +| [2050. 并行课程 III](https://leetcode.cn/problems/parallel-courses-iii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2000-2099/parallel-courses-iii.md) | 图、拓扑排序、数组、动态规划 | 困难 | +| [0802. 找到最终的安全状态](https://leetcode.cn/problems/find-eventual-safe-states/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/find-eventual-safe-states.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | +| [0851. 喧闹和富有](https://leetcode.cn/problems/loud-and-rich/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/loud-and-rich.md) | 深度优先搜索、图、拓扑排序、数组 | 中等 | + + +### 图的最小生成树题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [1584. 连接所有点的最小费用](https://leetcode.cn/problems/min-cost-to-connect-all-points/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/min-cost-to-connect-all-points.md) | 并查集、图、数组、最小生成树 | 中等 | +| [1631. 最小体力消耗路径](https://leetcode.cn/problems/path-with-minimum-effort/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/path-with-minimum-effort.md) | 深度优先搜索、广度优先搜索、并查集、数组、二分查找、矩阵、堆（优先队列） | 中等 | +| [0778. 水位上升的泳池中游泳](https://leetcode.cn/problems/swim-in-rising-water/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/swim-in-rising-water.md) | 深度优先搜索、广度优先搜索、并查集、数组、二分查找、矩阵、堆（优先队列） | 困难 | + + +### 单源最短路径题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0407. 接雨水 II](https://leetcode.cn/problems/trapping-rain-water-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/trapping-rain-water-ii.md) | 广度优先搜索、数组、矩阵、堆（优先队列） | 困难 | +| [0743. 网络延迟时间](https://leetcode.cn/problems/network-delay-time/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/network-delay-time.md) | 深度优先搜索、广度优先搜索、图、最短路、堆（优先队列） | 中等 | +| [0787. K 站中转内最便宜的航班](https://leetcode.cn/problems/cheapest-flights-within-k-stops/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/cheapest-flights-within-k-stops.md) | 深度优先搜索、广度优先搜索、图、动态规划、最短路、堆（优先队列） | 中等 | +| [1631. 最小体力消耗路径](https://leetcode.cn/problems/path-with-minimum-effort/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/path-with-minimum-effort.md) | 深度优先搜索、广度优先搜索、并查集、数组、二分查找、矩阵、堆（优先队列） | 中等 | +| [1786. 从第一个节点出发到最后一个节点的受限路径数](https://leetcode.cn/problems/number-of-restricted-paths-from-first-to-last-node/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/number-of-restricted-paths-from-first-to-last-node.md) | 图、拓扑排序、动态规划、最短路、堆（优先队列） | 中等 | + + +### 多源最短路径题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0815. 公交路线](https://leetcode.cn/problems/bus-routes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/bus-routes.md) | 广度优先搜索、数组、哈希表 | 困难 | +| [1162. 地图分析](https://leetcode.cn/problems/as-far-from-land-as-possible/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/as-far-from-land-as-possible.md) | 广度优先搜索、数组、动态规划、矩阵 | 中等 | + + +### 次短路径题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [2045. 到达目的地的第二短时间](https://leetcode.cn/problems/second-minimum-time-to-reach-destination/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2000-2099/second-minimum-time-to-reach-destination.md) | 广度优先搜索、图、最短路 | 困难 | + + +### 差分约束系统题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0995. K 连续位的最小翻转次数](https://leetcode.cn/problems/minimum-number-of-k-consecutive-bit-flips/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/minimum-number-of-k-consecutive-bit-flips.md) | 位运算、队列、数组、前缀和、滑动窗口 | 困难 | +| [1109. 航班预订统计](https://leetcode.cn/problems/corporate-flight-bookings/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/corporate-flight-bookings.md) | 数组、前缀和 | 中等 | + + +### 二分图基础题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0785. 判断二分图](https://leetcode.cn/problems/is-graph-bipartite/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/is-graph-bipartite.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 | + + +### 二分图最大匹配题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [LCP 04. 覆盖](https://leetcode.cn/problems/broken-board-dominoes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCP/broken-board-dominoes.md) | 位运算、图、数组、动态规划、状态压缩 | 困难 | +| [1947. 最大兼容性评分和](https://leetcode.cn/problems/maximum-compatibility-score-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/maximum-compatibility-score-sum.md) | 位运算、数组、动态规划、回溯、状态压缩 | 中等 | +| [1595. 连通两组点的最小成本](https://leetcode.cn/problems/minimum-cost-to-connect-two-groups-of-points/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/minimum-cost-to-connect-two-groups-of-points.md) | 位运算、数组、动态规划、状态压缩、矩阵 | 困难 | + + +## 第 7 章 基础算法 + +### 枚举算法题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0001. 两数之和](https://leetcode.cn/problems/two-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/two-sum.md) | 数组、哈希表 | 简单 | +| [0204. 计数质数](https://leetcode.cn/problems/count-primes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/count-primes.md) | 数组、数学、枚举、数论 | 中等 | +| [2427. 公因子的数目](https://leetcode.cn/problems/number-of-common-factors/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2400-2499/number-of-common-factors.md) | 数学、枚举、数论 | 简单 | +| [1925. 统计平方和三元组的数目](https://leetcode.cn/problems/count-square-sum-triples/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/count-square-sum-triples.md) | 数学、枚举 | 简单 | +| [1450. 在既定时间做作业的学生人数](https://leetcode.cn/problems/number-of-students-doing-homework-at-a-given-time/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/number-of-students-doing-homework-at-a-given-time.md) | 数组 | 简单 | +| [1620. 网络信号最好的坐标](https://leetcode.cn/problems/coordinate-with-maximum-network-quality/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/coordinate-with-maximum-network-quality.md) | 数组、枚举 | 中等 | +| [LCR 180. 文件组合](https://leetcode.cn/problems/he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof.md) | 数学、双指针、枚举 | 简单 | +| [0800. 相似 RGB 颜色](https://leetcode.cn/problems/similar-rgb-color/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/similar-rgb-color.md) | 数学、字符串、枚举 | 简单 | +| [0221. 最大正方形](https://leetcode.cn/problems/maximal-square/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/maximal-square.md) | 数组、动态规划、矩阵 | 中等 | +| [0560. 和为 K 的子数组](https://leetcode.cn/problems/subarray-sum-equals-k/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/subarray-sum-equals-k.md) | 数组、哈希表、前缀和 | 中等 | + + +### 递归算法题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0344. 反转字符串](https://leetcode.cn/problems/reverse-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/reverse-string.md) | 双指针、字符串 | 简单 | +| [0024. 两两交换链表中的节点](https://leetcode.cn/problems/swap-nodes-in-pairs/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/swap-nodes-in-pairs.md) | 递归、链表 | 中等 | +| [0118. 杨辉三角](https://leetcode.cn/problems/pascals-triangle/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/pascals-triangle.md) | 数组、动态规划 | 简单 | +| [0119. 杨辉三角 II](https://leetcode.cn/problems/pascals-triangle-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/pascals-triangle-ii.md) | 数组、动态规划 | 简单 | +| [0206. 反转链表](https://leetcode.cn/problems/reverse-linked-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/reverse-linked-list.md) | 递归、链表 | 简单 | +| [0092. 反转链表 II](https://leetcode.cn/problems/reverse-linked-list-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/reverse-linked-list-ii.md) | 链表 | 中等 | +| [0021. 合并两个有序链表](https://leetcode.cn/problems/merge-two-sorted-lists/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-two-sorted-lists.md) | 递归、链表 | 简单 | +| [0509. 斐波那契数](https://leetcode.cn/problems/fibonacci-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/fibonacci-number.md) | 递归、记忆化搜索、数学、动态规划 | 简单 | +| [0070. 爬楼梯](https://leetcode.cn/problems/climbing-stairs/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/climbing-stairs.md) | 记忆化搜索、数学、动态规划 | 简单 | +| [0104. 二叉树的最大深度](https://leetcode.cn/problems/maximum-depth-of-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/maximum-depth-of-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0124. 二叉树中的最大路径和](https://leetcode.cn/problems/binary-tree-maximum-path-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-maximum-path-sum.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | +| [0226. 翻转二叉树](https://leetcode.cn/problems/invert-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/invert-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0050. Pow(x, n)](https://leetcode.cn/problems/powx-n/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/powx-n.md) | 递归、数学 | 中等 | +| [0779. 第K个语法符号](https://leetcode.cn/problems/k-th-symbol-in-grammar/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/k-th-symbol-in-grammar.md) | 位运算、递归、数学 | 中等 | +| [0095. 不同的二叉搜索树 II](https://leetcode.cn/problems/unique-binary-search-trees-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/unique-binary-search-trees-ii.md) | 树、二叉搜索树、动态规划、回溯、二叉树 | 中等 | +| [LCR 187. 破冰游戏](https://leetcode.cn/problems/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof.md) | 递归、数学 | 简单 | + + +### 分治算法题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0004. 寻找两个正序数组的中位数](https://leetcode.cn/problems/median-of-two-sorted-arrays/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/median-of-two-sorted-arrays.md) | 数组、二分查找、分治 | 困难 | +| [0023. 合并 K 个升序链表](https://leetcode.cn/problems/merge-k-sorted-lists/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-k-sorted-lists.md) | 链表、分治、堆（优先队列）、归并排序 | 困难 | +| [0053. 最大子数组和](https://leetcode.cn/problems/maximum-subarray/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/maximum-subarray.md) | 数组、分治、动态规划 | 中等 | +| [0241. 为运算表达式设计优先级](https://leetcode.cn/problems/different-ways-to-add-parentheses/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/different-ways-to-add-parentheses.md) | 递归、记忆化搜索、数学、字符串、动态规划 | 中等 | +| [0169. 多数元素](https://leetcode.cn/problems/majority-element/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/majority-element.md) | 数组、哈希表、分治、计数、排序 | 简单 | +| [0050. Pow(x, n)](https://leetcode.cn/problems/powx-n/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/powx-n.md) | 递归、数学 | 中等 | +| [0014. 最长公共前缀](https://leetcode.cn/problems/longest-common-prefix/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-common-prefix.md) | 字典树、数组、字符串 | 简单 | +| [LCR 152. 验证二叉搜索树的后序遍历序列](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof.md) | 栈、树、二叉搜索树、递归、数组、二叉树、单调栈 | 中等 | + + +### 回溯算法题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0046. 全排列](https://leetcode.cn/problems/permutations/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/permutations.md) | 数组、回溯 | 中等 | +| [0047. 全排列 II](https://leetcode.cn/problems/permutations-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/permutations-ii.md) | 数组、回溯、排序 | 中等 | +| [0037. 解数独](https://leetcode.cn/problems/sudoku-solver/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/sudoku-solver.md) | 数组、哈希表、回溯、矩阵 | 困难 | +| [0022. 括号生成](https://leetcode.cn/problems/generate-parentheses/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/generate-parentheses.md) | 字符串、动态规划、回溯 | 中等 | +| [0017. 电话号码的字母组合](https://leetcode.cn/problems/letter-combinations-of-a-phone-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/letter-combinations-of-a-phone-number.md) | 哈希表、字符串、回溯 | 中等 | +| [0784. 字母大小写全排列](https://leetcode.cn/problems/letter-case-permutation/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/letter-case-permutation.md) | 位运算、字符串、回溯 | 中等 | +| [0039. 组合总和](https://leetcode.cn/problems/combination-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/combination-sum.md) | 数组、回溯 | 中等 | +| [0040. 组合总和 II](https://leetcode.cn/problems/combination-sum-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/combination-sum-ii.md) | 数组、回溯 | 中等 | +| [0078. 子集](https://leetcode.cn/problems/subsets/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/subsets.md) | 位运算、数组、回溯 | 中等 | +| [0090. 子集 II](https://leetcode.cn/problems/subsets-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/subsets-ii.md) | 位运算、数组、回溯 | 中等 | +| [0473. 火柴拼正方形](https://leetcode.cn/problems/matchsticks-to-square/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/matchsticks-to-square.md) | 位运算、数组、动态规划、回溯、状态压缩 | 中等 | +| [1593. 拆分字符串使唯一子字符串的数目最大](https://leetcode.cn/problems/split-a-string-into-the-max-number-of-unique-substrings/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/split-a-string-into-the-max-number-of-unique-substrings.md) | 哈希表、字符串、回溯 | 中等 | +| [1079. 活字印刷](https://leetcode.cn/problems/letter-tile-possibilities/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/letter-tile-possibilities.md) | 哈希表、字符串、回溯、计数 | 中等 | +| [0093. 复原 IP 地址](https://leetcode.cn/problems/restore-ip-addresses/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/restore-ip-addresses.md) | 字符串、回溯 | 中等 | +| [0079. 单词搜索](https://leetcode.cn/problems/word-search/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/word-search.md) | 深度优先搜索、数组、字符串、回溯、矩阵 | 中等 | +| [0679. 24 点游戏](https://leetcode.cn/problems/24-game/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/24-game.md) | 数组、数学、回溯 | 困难 | + + +### 贪心算法题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0455. 分发饼干](https://leetcode.cn/problems/assign-cookies/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/assign-cookies.md) | 贪心、数组、双指针、排序 | 简单 | +| [0860. 柠檬水找零](https://leetcode.cn/problems/lemonade-change/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/lemonade-change.md) | 贪心、数组 | 简单 | +| [0056. 合并区间](https://leetcode.cn/problems/merge-intervals/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-intervals.md) | 数组、排序 | 中等 | +| [0435. 无重叠区间](https://leetcode.cn/problems/non-overlapping-intervals/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/non-overlapping-intervals.md) | 贪心、数组、动态规划、排序 | 中等 | +| [0452. 用最少数量的箭引爆气球](https://leetcode.cn/problems/minimum-number-of-arrows-to-burst-balloons/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/minimum-number-of-arrows-to-burst-balloons.md) | 贪心、数组、排序 | 中等 | +| [0055. 跳跃游戏](https://leetcode.cn/problems/jump-game/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/jump-game.md) | 贪心、数组、动态规划 | 中等 | +| [0045. 跳跃游戏 II](https://leetcode.cn/problems/jump-game-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/jump-game-ii.md) | 贪心、数组、动态规划 | 中等 | +| [0122. 买卖股票的最佳时机 II](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/best-time-to-buy-and-sell-stock-ii.md) | 贪心、数组、动态规划 | 中等 | +| [0561. 数组拆分](https://leetcode.cn/problems/array-partition/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/array-partition.md) | 贪心、数组、计数排序、排序 | 简单 | +| [1710. 卡车上的最大单元数](https://leetcode.cn/problems/maximum-units-on-a-truck/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/maximum-units-on-a-truck.md) | 贪心、数组、排序 | 简单 | +| [1217. 玩筹码](https://leetcode.cn/problems/minimum-cost-to-move-chips-to-the-same-position/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/minimum-cost-to-move-chips-to-the-same-position.md) | 贪心、数组、数学 | 简单 | +| [1247. 交换字符使得字符串相同](https://leetcode.cn/problems/minimum-swaps-to-make-strings-equal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/minimum-swaps-to-make-strings-equal.md) | 贪心、数学、字符串 | 中等 | +| [1400. 构造 K 个回文字符串](https://leetcode.cn/problems/construct-k-palindrome-strings/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/construct-k-palindrome-strings.md) | 贪心、哈希表、字符串、计数 | 中等 | +| [0921. 使括号有效的最少添加](https://leetcode.cn/problems/minimum-add-to-make-parentheses-valid/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/minimum-add-to-make-parentheses-valid.md) | 栈、贪心、字符串 | 中等 | +| [1029. 两地调度](https://leetcode.cn/problems/two-city-scheduling/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/two-city-scheduling.md) | 贪心、数组、排序 | 中等 | +| [1605. 给定行和列的和求可行矩阵](https://leetcode.cn/problems/find-valid-matrix-given-row-and-column-sums/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/find-valid-matrix-given-row-and-column-sums.md) | 贪心、数组、矩阵 | 中等 | +| [0135. 分发糖果](https://leetcode.cn/problems/candy/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/candy.md) | 贪心、数组 | 困难 | +| [0134. 加油站](https://leetcode.cn/problems/gas-station/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/gas-station.md) | 贪心、数组 | 中等 | +| [0053. 最大子数组和](https://leetcode.cn/problems/maximum-subarray/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/maximum-subarray.md) | 数组、分治、动态规划 | 中等 | +| [0376. 摆动序列](https://leetcode.cn/problems/wiggle-subsequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/wiggle-subsequence.md) | 贪心、数组、动态规划 | 中等 | +| [0738. 单调递增的数字](https://leetcode.cn/problems/monotone-increasing-digits/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/monotone-increasing-digits.md) | 贪心、数学 | 中等 | +| [0402. 移掉 K 位数字](https://leetcode.cn/problems/remove-k-digits/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/remove-k-digits.md) | 栈、贪心、字符串、单调栈 | 中等 | +| [0861. 翻转矩阵后的得分](https://leetcode.cn/problems/score-after-flipping-matrix/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/score-after-flipping-matrix.md) | 贪心、位运算、数组、矩阵 | 中等 | +| [0670. 最大交换](https://leetcode.cn/problems/maximum-swap/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/maximum-swap.md) | 贪心、数学 | 中等 | + + +### 位运算题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0504. 七进制数](https://leetcode.cn/problems/base-7/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/base-7.md) | 数学、字符串 | 简单 | +| [0405. 数字转换为十六进制数](https://leetcode.cn/problems/convert-a-number-to-hexadecimal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/convert-a-number-to-hexadecimal.md) | 位运算、数学、字符串 | 简单 | +| [0190. 颠倒二进制位](https://leetcode.cn/problems/reverse-bits/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/reverse-bits.md) | 位运算、分治 | 简单 | +| [1009. 十进制整数的反码](https://leetcode.cn/problems/complement-of-base-10-integer/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/complement-of-base-10-integer.md) | 位运算 | 简单 | +| [0191. 位1的个数](https://leetcode.cn/problems/number-of-1-bits/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/number-of-1-bits.md) | 位运算、分治 | 简单 | +| [0371. 两整数之和](https://leetcode.cn/problems/sum-of-two-integers/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/sum-of-two-integers.md) | 位运算、数学 | 中等 | +| [0089. 格雷编码](https://leetcode.cn/problems/gray-code/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/gray-code.md) | 位运算、数学、回溯 | 中等 | +| [0201. 数字范围按位与](https://leetcode.cn/problems/bitwise-and-of-numbers-range/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/bitwise-and-of-numbers-range.md) | 位运算 | 中等 | +| [0338. 比特位计数](https://leetcode.cn/problems/counting-bits/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/counting-bits.md) | 位运算、动态规划 | 简单 | +| [0136. 只出现一次的数字](https://leetcode.cn/problems/single-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/single-number.md) | 位运算、数组 | 简单 | +| [0137. 只出现一次的数字 II](https://leetcode.cn/problems/single-number-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/single-number-ii.md) | 位运算、数组 | 中等 | +| [0260. 只出现一次的数字 III](https://leetcode.cn/problems/single-number-iii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/single-number-iii.md) | 位运算、数组 | 中等 | +| [0268. 丢失的数字](https://leetcode.cn/problems/missing-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/missing-number.md) | 位运算、数组、哈希表、数学、二分查找、排序 | 简单 | +| [1349. 参加考试的最大学生数](https://leetcode.cn/problems/maximum-students-taking-exam/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/maximum-students-taking-exam.md) | 位运算、数组、动态规划、状态压缩、矩阵 | 困难 | +| [0645. 错误的集合](https://leetcode.cn/problems/set-mismatch/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/set-mismatch.md) | 位运算、数组、哈希表、排序 | 简单 | +| [0078. 子集](https://leetcode.cn/problems/subsets/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/subsets.md) | 位运算、数组、回溯 | 中等 | +| [0090. 子集 II](https://leetcode.cn/problems/subsets-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/subsets-ii.md) | 位运算、数组、回溯 | 中等 | + + +## 第 8 章 动态规划 + +### 动态规划基础题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0509. 斐波那契数](https://leetcode.cn/problems/fibonacci-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/fibonacci-number.md) | 递归、记忆化搜索、数学、动态规划 | 简单 | +| [0070. 爬楼梯](https://leetcode.cn/problems/climbing-stairs/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/climbing-stairs.md) | 记忆化搜索、数学、动态规划 | 简单 | +| [0062. 不同路径](https://leetcode.cn/problems/unique-paths/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/unique-paths.md) | 数学、动态规划、组合数学 | 中等 | + + +### 记忆化搜索题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [1137. 第 N 个泰波那契数](https://leetcode.cn/problems/n-th-tribonacci-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/n-th-tribonacci-number.md) | 记忆化搜索、数学、动态规划 | 简单 | +| [0375. 猜数字大小 II](https://leetcode.cn/problems/guess-number-higher-or-lower-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/guess-number-higher-or-lower-ii.md) | 数学、动态规划、博弈 | 中等 | +| [0494. 目标和](https://leetcode.cn/problems/target-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/target-sum.md) | 数组、动态规划、回溯 | 中等 | +| [0576. 出界的路径数](https://leetcode.cn/problems/out-of-boundary-paths/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/out-of-boundary-paths.md) | 动态规划 | 中等 | +| [0087. 扰乱字符串](https://leetcode.cn/problems/scramble-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/scramble-string.md) | 字符串、动态规划 | 困难 | +| [0403. 青蛙过河](https://leetcode.cn/problems/frog-jump/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/frog-jump.md) | 数组、动态规划 | 困难 | +| [0552. 学生出勤记录 II](https://leetcode.cn/problems/student-attendance-record-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/student-attendance-record-ii.md) | 动态规划 | 困难 | +| [0913. 猫和老鼠](https://leetcode.cn/problems/cat-and-mouse/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/cat-and-mouse.md) | 图、拓扑排序、记忆化搜索、数学、动态规划、博弈 | 困难 | +| [0329. 矩阵中的最长递增路径](https://leetcode.cn/problems/longest-increasing-path-in-a-matrix/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/longest-increasing-path-in-a-matrix.md) | 深度优先搜索、广度优先搜索、图、拓扑排序、记忆化搜索、数组、动态规划、矩阵 | 困难 | + + +### 线性 DP 题目 + +#### 单串线性 DP 问题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0300. 最长递增子序列](https://leetcode.cn/problems/longest-increasing-subsequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/longest-increasing-subsequence.md) | 数组、二分查找、动态规划 | 中等 | +| [0673. 最长递增子序列的个数](https://leetcode.cn/problems/number-of-longest-increasing-subsequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/number-of-longest-increasing-subsequence.md) | 树状数组、线段树、数组、动态规划 | 中等 | +| [0354. 俄罗斯套娃信封问题](https://leetcode.cn/problems/russian-doll-envelopes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/russian-doll-envelopes.md) | 数组、二分查找、动态规划、排序 | 困难 | +| [0053. 最大子数组和](https://leetcode.cn/problems/maximum-subarray/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/maximum-subarray.md) | 数组、分治、动态规划 | 中等 | +| [0152. 乘积最大子数组](https://leetcode.cn/problems/maximum-product-subarray/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/maximum-product-subarray.md) | 数组、动态规划 | 中等 | +| [0918. 环形子数组的最大和](https://leetcode.cn/problems/maximum-sum-circular-subarray/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/maximum-sum-circular-subarray.md) | 队列、数组、分治、动态规划、单调队列 | 中等 | +| [0198. 打家劫舍](https://leetcode.cn/problems/house-robber/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/house-robber.md) | 数组、动态规划 | 中等 | +| [0213. 打家劫舍 II](https://leetcode.cn/problems/house-robber-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/house-robber-ii.md) | 数组、动态规划 | 中等 | +| [0740. 删除并获得点数](https://leetcode.cn/problems/delete-and-earn/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/delete-and-earn.md) | 数组、哈希表、动态规划 | 中等 | +| [1388. 3n 块披萨](https://leetcode.cn/problems/pizza-with-3n-slices/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/pizza-with-3n-slices.md) | 贪心、数组、动态规划、堆（优先队列） | 困难 | +| [0873. 最长的斐波那契子序列的长度](https://leetcode.cn/problems/length-of-longest-fibonacci-subsequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/length-of-longest-fibonacci-subsequence.md) | 数组、哈希表、动态规划 | 中等 | +| [1027. 最长等差数列](https://leetcode.cn/problems/longest-arithmetic-subsequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/longest-arithmetic-subsequence.md) | 数组、哈希表、二分查找、动态规划 | 中等 | +| [1055. 形成字符串的最短路径](https://leetcode.cn/problems/shortest-way-to-form-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/shortest-way-to-form-string.md) | 贪心、双指针、字符串、二分查找 | 中等 | +| [0368. 最大整除子集](https://leetcode.cn/problems/largest-divisible-subset/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/largest-divisible-subset.md) | 数组、数学、动态规划、排序 | 中等 | +| [0032. 最长有效括号](https://leetcode.cn/problems/longest-valid-parentheses/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-valid-parentheses.md) | 栈、字符串、动态规划 | 困难 | +| [0413. 等差数列划分](https://leetcode.cn/problems/arithmetic-slices/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/arithmetic-slices.md) | 数组、动态规划、滑动窗口 | 中等 | +| [0091. 解码方法](https://leetcode.cn/problems/decode-ways/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/decode-ways.md) | 字符串、动态规划 | 中等 | +| [0639. 解码方法 II](https://leetcode.cn/problems/decode-ways-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/decode-ways-ii.md) | 字符串、动态规划 | 困难 | +| [0132. 分割回文串 II](https://leetcode.cn/problems/palindrome-partitioning-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/palindrome-partitioning-ii.md) | 字符串、动态规划 | 困难 | +| [1220. 统计元音字母序列的数目](https://leetcode.cn/problems/count-vowels-permutation/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/count-vowels-permutation.md) | 动态规划 | 困难 | +| [0338. 比特位计数](https://leetcode.cn/problems/counting-bits/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/counting-bits.md) | 位运算、动态规划 | 简单 | +| [0801. 使序列递增的最小交换次数](https://leetcode.cn/problems/minimum-swaps-to-make-sequences-increasing/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/minimum-swaps-to-make-sequences-increasing.md) | 数组、动态规划 | 困难 | +| [0871. 最低加油次数](https://leetcode.cn/problems/minimum-number-of-refueling-stops/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/minimum-number-of-refueling-stops.md) | 贪心、数组、动态规划、堆（优先队列） | 困难 | +| [0045. 跳跃游戏 II](https://leetcode.cn/problems/jump-game-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/jump-game-ii.md) | 贪心、数组、动态规划 | 中等 | +| [0813. 最大平均值和的分组](https://leetcode.cn/problems/largest-sum-of-averages/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/largest-sum-of-averages.md) | 数组、动态规划、前缀和 | 中等 | +| [0887. 鸡蛋掉落](https://leetcode.cn/problems/super-egg-drop/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/super-egg-drop.md) | 数学、二分查找、动态规划 | 困难 | +| [0256. 粉刷房子](https://leetcode.cn/problems/paint-house/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/paint-house.md) | 数组、动态规划 | 中等 | +| [0265. 粉刷房子 II](https://leetcode.cn/problems/paint-house-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/paint-house-ii.md) | 数组、动态规划 | 困难 | +| [1473. 粉刷房子 III](https://leetcode.cn/problems/paint-house-iii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/paint-house-iii.md) | 数组、动态规划 | 困难 | +| [0975. 奇偶跳](https://leetcode.cn/problems/odd-even-jump/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/odd-even-jump.md) | 栈、数组、动态规划、有序集合、排序、单调栈 | 困难 | +| [0403. 青蛙过河](https://leetcode.cn/problems/frog-jump/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/frog-jump.md) | 数组、动态规划 | 困难 | +| [1478. 安排邮筒](https://leetcode.cn/problems/allocate-mailboxes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/allocate-mailboxes.md) | 数组、数学、动态规划、排序 | 困难 | +| [1230. 抛掷硬币](https://leetcode.cn/problems/toss-strange-coins/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/toss-strange-coins.md) | 数组、数学、动态规划、概率与统计 | 中等 | +| [0410. 分割数组的最大值](https://leetcode.cn/problems/split-array-largest-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/split-array-largest-sum.md) | 贪心、数组、二分查找、动态规划、前缀和 | 困难 | +| [1751. 最多可以参加的会议数目 II](https://leetcode.cn/problems/maximum-number-of-events-that-can-be-attended-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/maximum-number-of-events-that-can-be-attended-ii.md) | 数组、二分查找、动态规划、排序 | 困难 | +| [1787. 使所有区间的异或结果为零](https://leetcode.cn/problems/make-the-xor-of-all-segments-equal-to-zero/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/make-the-xor-of-all-segments-equal-to-zero.md) | 位运算、数组、动态规划 | 困难 | +| [0121. 买卖股票的最佳时机](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/best-time-to-buy-and-sell-stock.md) | 数组、动态规划 | 简单 | +| [0122. 买卖股票的最佳时机 II](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/best-time-to-buy-and-sell-stock-ii.md) | 贪心、数组、动态规划 | 中等 | +| [0123. 买卖股票的最佳时机 III](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-iii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/best-time-to-buy-and-sell-stock-iii.md) | 数组、动态规划 | 困难 | +| [0188. 买卖股票的最佳时机 IV](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-iv/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/best-time-to-buy-and-sell-stock-iv.md) | 数组、动态规划 | 困难 | +| [0309. 买卖股票的最佳时机含冷冻期](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-cooldown/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/best-time-to-buy-and-sell-stock-with-cooldown.md) | 数组、动态规划 | 中等 | +| [0714. 买卖股票的最佳时机含手续费](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/best-time-to-buy-and-sell-stock-with-transaction-fee.md) | 贪心、数组、动态规划 | 中等 | + + +#### 双串线性 DP 问题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [1143. 最长公共子序列](https://leetcode.cn/problems/longest-common-subsequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/longest-common-subsequence.md) | 字符串、动态规划 | 中等 | +| [0712. 两个字符串的最小ASCII删除和](https://leetcode.cn/problems/minimum-ascii-delete-sum-for-two-strings/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/minimum-ascii-delete-sum-for-two-strings.md) | 字符串、动态规划 | 中等 | +| [0718. 最长重复子数组](https://leetcode.cn/problems/maximum-length-of-repeated-subarray/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/maximum-length-of-repeated-subarray.md) | 数组、二分查找、动态规划、滑动窗口、哈希函数、滚动哈希 | 中等 | +| [0583. 两个字符串的删除操作](https://leetcode.cn/problems/delete-operation-for-two-strings/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/delete-operation-for-two-strings.md) | 字符串、动态规划 | 中等 | +| [0072. 编辑距离](https://leetcode.cn/problems/edit-distance/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/edit-distance.md) | 字符串、动态规划 | 中等 | +| [0044. 通配符匹配](https://leetcode.cn/problems/wildcard-matching/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/wildcard-matching.md) | 贪心、递归、字符串、动态规划 | 困难 | +| [0010. 正则表达式匹配](https://leetcode.cn/problems/regular-expression-matching/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/regular-expression-matching.md) | 递归、字符串、动态规划 | 困难 | +| [0097. 交错字符串](https://leetcode.cn/problems/interleaving-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/interleaving-string.md) | 字符串、动态规划 | 中等 | +| [0115. 不同的子序列](https://leetcode.cn/problems/distinct-subsequences/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/distinct-subsequences.md) | 字符串、动态规划 | 困难 | +| [0087. 扰乱字符串](https://leetcode.cn/problems/scramble-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/scramble-string.md) | 字符串、动态规划 | 困难 | + + +#### 矩阵线性 DP 问题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0118. 杨辉三角](https://leetcode.cn/problems/pascals-triangle/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/pascals-triangle.md) | 数组、动态规划 | 简单 | +| [0119. 杨辉三角 II](https://leetcode.cn/problems/pascals-triangle-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/pascals-triangle-ii.md) | 数组、动态规划 | 简单 | +| [0120. 三角形最小路径和](https://leetcode.cn/problems/triangle/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/triangle.md) | 数组、动态规划 | 中等 | +| [0064. 最小路径和](https://leetcode.cn/problems/minimum-path-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/minimum-path-sum.md) | 数组、动态规划、矩阵 | 中等 | +| [0174. 地下城游戏](https://leetcode.cn/problems/dungeon-game/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/dungeon-game.md) | 数组、动态规划、矩阵 | 困难 | +| [0221. 最大正方形](https://leetcode.cn/problems/maximal-square/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/maximal-square.md) | 数组、动态规划、矩阵 | 中等 | +| [0931. 下降路径最小和](https://leetcode.cn/problems/minimum-falling-path-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/minimum-falling-path-sum.md) | 数组、动态规划、矩阵 | 中等 | +| [0576. 出界的路径数](https://leetcode.cn/problems/out-of-boundary-paths/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/out-of-boundary-paths.md) | 动态规划 | 中等 | +| [0085. 最大矩形](https://leetcode.cn/problems/maximal-rectangle/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/maximal-rectangle.md) | 栈、数组、动态规划、矩阵、单调栈 | 困难 | +| [0363. 矩形区域不超过 K 的最大数值和](https://leetcode.cn/problems/max-sum-of-rectangle-no-larger-than-k/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/max-sum-of-rectangle-no-larger-than-k.md) | 数组、二分查找、矩阵、有序集合、前缀和 | 困难 | +| [面试题 17.24. 最大子矩阵](https://leetcode.cn/problems/max-submatrix-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/max-submatrix-lcci.md) | 数组、动态规划、矩阵、前缀和 | 困难 | +| [1444. 切披萨的方案数](https://leetcode.cn/problems/number-of-ways-of-cutting-a-pizza/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/number-of-ways-of-cutting-a-pizza.md) | 记忆化搜索、数组、动态规划、矩阵、前缀和 | 困难 | + + +#### 无串线性 DP 问题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [1137. 第 N 个泰波那契数](https://leetcode.cn/problems/n-th-tribonacci-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/n-th-tribonacci-number.md) | 记忆化搜索、数学、动态规划 | 简单 | +| [0650. 两个键的键盘](https://leetcode.cn/problems/2-keys-keyboard/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/2-keys-keyboard.md) | 数学、动态规划 | 中等 | +| [0264. 丑数 II](https://leetcode.cn/problems/ugly-number-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/ugly-number-ii.md) | 哈希表、数学、动态规划、堆（优先队列） | 中等 | +| [0279. 完全平方数](https://leetcode.cn/problems/perfect-squares/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/perfect-squares.md) | 广度优先搜索、数学、动态规划 | 中等 | +| [0343. 整数拆分](https://leetcode.cn/problems/integer-break/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/integer-break.md) | 数学、动态规划 | 中等 | + + +### 背包问题题目 + +#### 0-1 背包问题题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0416. 分割等和子集](https://leetcode.cn/problems/partition-equal-subset-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/partition-equal-subset-sum.md) | 数组、动态规划 | 中等 | +| [0494. 目标和](https://leetcode.cn/problems/target-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/target-sum.md) | 数组、动态规划、回溯 | 中等 | +| [1049. 最后一块石头的重量 II](https://leetcode.cn/problems/last-stone-weight-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/last-stone-weight-ii.md) | 数组、动态规划 | 中等 | + + +#### 完全背包问题题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0279. 完全平方数](https://leetcode.cn/problems/perfect-squares/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/perfect-squares.md) | 广度优先搜索、数学、动态规划 | 中等 | +| [0322. 零钱兑换](https://leetcode.cn/problems/coin-change/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/coin-change.md) | 广度优先搜索、数组、动态规划 | 中等 | +| [0518. 零钱兑换 II](https://leetcode.cn/problems/coin-change-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/coin-change-ii.md) | 数组、动态规划 | 中等 | +| [0139. 单词拆分](https://leetcode.cn/problems/word-break/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/word-break.md) | 字典树、记忆化搜索、数组、哈希表、字符串、动态规划 | 中等 | +| [0377. 组合总和 Ⅳ](https://leetcode.cn/problems/combination-sum-iv/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/combination-sum-iv.md) | 数组、动态规划 | 中等 | +| [0638. 大礼包](https://leetcode.cn/problems/shopping-offers/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/shopping-offers.md) | 位运算、记忆化搜索、数组、动态规划、回溯、状态压缩 | 中等 | +| [1449. 数位成本和为目标值的最大数字](https://leetcode.cn/problems/form-largest-integer-with-digits-that-add-up-to-target/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/form-largest-integer-with-digits-that-add-up-to-target.md) | 数组、动态规划 | 困难 | + + +#### 多重背包问题题目 + +#### 分组背包问题题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [1155. 掷骰子等于目标和的方法数](https://leetcode.cn/problems/number-of-dice-rolls-with-target-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/number-of-dice-rolls-with-target-sum.md) | 动态规划 | 中等 | +| [2585. 获得分数的方法数](https://leetcode.cn/problems/number-of-ways-to-earn-points/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2500-2599/number-of-ways-to-earn-points.md) | 数组、动态规划 | 困难 | + + +#### 多维背包问题题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0474. 一和零](https://leetcode.cn/problems/ones-and-zeroes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/ones-and-zeroes.md) | 数组、字符串、动态规划 | 中等 | +| [0879. 盈利计划](https://leetcode.cn/problems/profitable-schemes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/profitable-schemes.md) | 数组、动态规划 | 困难 | +| [1995. 统计特殊四元组](https://leetcode.cn/problems/count-special-quadruplets/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/count-special-quadruplets.md) | 数组、哈希表、枚举 | 简单 | + + +### 区间 DP 题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0486. 预测赢家](https://leetcode.cn/problems/predict-the-winner/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/predict-the-winner.md) | 递归、数组、数学、动态规划、博弈 | 中等 | +| [0312. 戳气球](https://leetcode.cn/problems/burst-balloons/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/burst-balloons.md) | 数组、动态规划 | 困难 | +| [0877. 石子游戏](https://leetcode.cn/problems/stone-game/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/stone-game.md) | 数组、数学、动态规划、博弈 | 中等 | +| [1000. 合并石头的最低成本](https://leetcode.cn/problems/minimum-cost-to-merge-stones/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/minimum-cost-to-merge-stones.md) | 数组、动态规划、前缀和 | 困难 | +| [1547. 切棍子的最小成本](https://leetcode.cn/problems/minimum-cost-to-cut-a-stick/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/minimum-cost-to-cut-a-stick.md) | 数组、动态规划、排序 | 困难 | +| [0664. 奇怪的打印机](https://leetcode.cn/problems/strange-printer/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/strange-printer.md) | 字符串、动态规划 | 困难 | +| [1039. 多边形三角剖分的最低得分](https://leetcode.cn/problems/minimum-score-triangulation-of-polygon/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/minimum-score-triangulation-of-polygon.md) | 数组、动态规划 | 中等 | +| [0546. 移除盒子](https://leetcode.cn/problems/remove-boxes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/remove-boxes.md) | 记忆化搜索、数组、动态规划 | 困难 | +| [0375. 猜数字大小 II](https://leetcode.cn/problems/guess-number-higher-or-lower-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/guess-number-higher-or-lower-ii.md) | 数学、动态规划、博弈 | 中等 | +| [0678. 有效的括号字符串](https://leetcode.cn/problems/valid-parenthesis-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/valid-parenthesis-string.md) | 栈、贪心、字符串、动态规划 | 中等 | +| [0005. 最长回文子串](https://leetcode.cn/problems/longest-palindromic-substring/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-palindromic-substring.md) | 双指针、字符串、动态规划 | 中等 | +| [0516. 最长回文子序列](https://leetcode.cn/problems/longest-palindromic-subsequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/longest-palindromic-subsequence.md) | 字符串、动态规划 | 中等 | +| [0730. 统计不同回文子序列](https://leetcode.cn/problems/count-different-palindromic-subsequences/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/count-different-palindromic-subsequences.md) | 字符串、动态规划 | 困难 | +| [2104. 子数组范围和](https://leetcode.cn/problems/sum-of-subarray-ranges/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2100-2199/sum-of-subarray-ranges.md) | 栈、数组、单调栈 | 中等 | + + +### 树形 DP 题目 + +#### 固定根的树形 DP 题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0543. 二叉树的直径](https://leetcode.cn/problems/diameter-of-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/diameter-of-binary-tree.md) | 树、深度优先搜索、二叉树 | 简单 | +| [0124. 二叉树中的最大路径和](https://leetcode.cn/problems/binary-tree-maximum-path-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-maximum-path-sum.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | +| [1245. 树的直径](https://leetcode.cn/problems/tree-diameter/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/tree-diameter.md) | 树、深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | +| [2246. 相邻字符不同的最长路径](https://leetcode.cn/problems/longest-path-with-different-adjacent-characters/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2200-2299/longest-path-with-different-adjacent-characters.md) | 树、深度优先搜索、图、拓扑排序、数组、字符串 | 困难 | +| [0687. 最长同值路径](https://leetcode.cn/problems/longest-univalue-path/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/longest-univalue-path.md) | 树、深度优先搜索、二叉树 | 中等 | +| [0337. 打家劫舍 III](https://leetcode.cn/problems/house-robber-iii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/house-robber-iii.md) | 树、深度优先搜索、动态规划、二叉树 | 中等 | +| [0333. 最大二叉搜索子树](https://leetcode.cn/problems/largest-bst-subtree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/largest-bst-subtree.md) | 树、深度优先搜索、二叉搜索树、动态规划、二叉树 | 中等 | +| [1617. 统计子树中城市之间最大距离](https://leetcode.cn/problems/count-subtrees-with-max-distance-between-cities/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/count-subtrees-with-max-distance-between-cities.md) | 位运算、树、动态规划、状态压缩、枚举 | 困难 | +| [2538. 最大价值和与最小价值和的差值](https://leetcode.cn/problems/difference-between-maximum-and-minimum-price-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2500-2599/difference-between-maximum-and-minimum-price-sum.md) | 树、深度优先搜索、数组、动态规划 | 困难 | +| [1569. 将子数组重新排序得到同一个二叉搜索树的方案数](https://leetcode.cn/problems/number-of-ways-to-reorder-array-to-get-same-bst/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/number-of-ways-to-reorder-array-to-get-same-bst.md) | 树、并查集、二叉搜索树、记忆化搜索、数组、数学、分治、动态规划、二叉树、组合数学 | 困难 | +| [1372. 二叉树中的最长交错路径](https://leetcode.cn/problems/longest-zigzag-path-in-a-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/longest-zigzag-path-in-a-binary-tree.md) | 树、深度优先搜索、动态规划、二叉树 | 中等 | +| [1373. 二叉搜索子树的最大键值和](https://leetcode.cn/problems/maximum-sum-bst-in-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/maximum-sum-bst-in-binary-tree.md) | 树、深度优先搜索、二叉搜索树、动态规划、二叉树 | 困难 | +| [0968. 监控二叉树](https://leetcode.cn/problems/binary-tree-cameras/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/binary-tree-cameras.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | +| [1273. 删除树节点](https://leetcode.cn/problems/delete-tree-nodes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/delete-tree-nodes.md) | 树、深度优先搜索、广度优先搜索、数组 | 中等 | +| [1519. 子树中标签相同的节点数](https://leetcode.cn/problems/number-of-nodes-in-the-sub-tree-with-the-same-label/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/number-of-nodes-in-the-sub-tree-with-the-same-label.md) | 树、深度优先搜索、广度优先搜索、哈希表、计数 | 中等 | + + +#### 不定根的树形 DP 题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0310. 最小高度树](https://leetcode.cn/problems/minimum-height-trees/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/minimum-height-trees.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | +| [0834. 树中距离之和](https://leetcode.cn/problems/sum-of-distances-in-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/sum-of-distances-in-tree.md) | 树、深度优先搜索、图、动态规划 | 困难 | +| [2581. 统计可能的树根数目](https://leetcode.cn/problems/count-number-of-possible-root-nodes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2500-2599/count-number-of-possible-root-nodes.md) | 树、深度优先搜索、数组、哈希表、动态规划 | 困难 | + + +### 状态压缩 DP 题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [1879. 两个数组最小的异或值之和](https://leetcode.cn/problems/minimum-xor-sum-of-two-arrays/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1800-1899/minimum-xor-sum-of-two-arrays.md) | 位运算、数组、动态规划、状态压缩 | 困难 | +| [2172. 数组的最大与和](https://leetcode.cn/problems/maximum-and-sum-of-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2100-2199/maximum-and-sum-of-array.md) | 位运算、数组、动态规划、状态压缩 | 困难 | +| [1947. 最大兼容性评分和](https://leetcode.cn/problems/maximum-compatibility-score-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/maximum-compatibility-score-sum.md) | 位运算、数组、动态规划、回溯、状态压缩 | 中等 | +| [1595. 连通两组点的最小成本](https://leetcode.cn/problems/minimum-cost-to-connect-two-groups-of-points/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/minimum-cost-to-connect-two-groups-of-points.md) | 位运算、数组、动态规划、状态压缩、矩阵 | 困难 | +| [1494. 并行课程 II](https://leetcode.cn/problems/parallel-courses-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/parallel-courses-ii.md) | 位运算、图、动态规划、状态压缩 | 困难 | +| [1655. 分配重复整数](https://leetcode.cn/problems/distribute-repeating-integers/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/distribute-repeating-integers.md) | 位运算、数组、动态规划、回溯、状态压缩 | 困难 | +| [1986. 完成任务的最少工作时间段](https://leetcode.cn/problems/minimum-number-of-work-sessions-to-finish-the-tasks/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/minimum-number-of-work-sessions-to-finish-the-tasks.md) | 位运算、数组、动态规划、回溯、状态压缩 | 中等 | +| [1434. 每个人戴不同帽子的方案数](https://leetcode.cn/problems/number-of-ways-to-wear-different-hats-to-each-other/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/number-of-ways-to-wear-different-hats-to-each-other.md) | 位运算、数组、动态规划、状态压缩 | 困难 | +| [1799. N 次操作后的最大分数和](https://leetcode.cn/problems/maximize-score-after-n-operations/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/maximize-score-after-n-operations.md) | 位运算、数组、数学、动态规划、回溯、状态压缩、数论 | 困难 | +| [1681. 最小不兼容性](https://leetcode.cn/problems/minimum-incompatibility/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/minimum-incompatibility.md) | 位运算、数组、动态规划、状态压缩 | 困难 | +| [0526. 优美的排列](https://leetcode.cn/problems/beautiful-arrangement/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/beautiful-arrangement.md) | 位运算、数组、动态规划、回溯、状态压缩 | 中等 | +| [0351. 安卓系统手势解锁](https://leetcode.cn/problems/android-unlock-patterns/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/android-unlock-patterns.md) | 位运算、动态规划、回溯、状态压缩 | 中等 | +| [0464. 我能赢吗](https://leetcode.cn/problems/can-i-win/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/can-i-win.md) | 位运算、记忆化搜索、数学、动态规划、状态压缩、博弈 | 中等 | +| [0847. 访问所有节点的最短路径](https://leetcode.cn/problems/shortest-path-visiting-all-nodes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/shortest-path-visiting-all-nodes.md) | 位运算、广度优先搜索、图、动态规划、状态压缩 | 困难 | +| [0638. 大礼包](https://leetcode.cn/problems/shopping-offers/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/shopping-offers.md) | 位运算、记忆化搜索、数组、动态规划、回溯、状态压缩 | 中等 | +| [1994. 好子集的数目](https://leetcode.cn/problems/the-number-of-good-subsets/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/the-number-of-good-subsets.md) | 位运算、数组、数学、动态规划、状态压缩 | 困难 | +| [1349. 参加考试的最大学生数](https://leetcode.cn/problems/maximum-students-taking-exam/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/maximum-students-taking-exam.md) | 位运算、数组、动态规划、状态压缩、矩阵 | 困难 | +| [0698. 划分为k个相等的子集](https://leetcode.cn/problems/partition-to-k-equal-sum-subsets/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/partition-to-k-equal-sum-subsets.md) | 位运算、记忆化搜索、数组、动态规划、回溯、状态压缩 | 中等 | +| [0943. 最短超级串](https://leetcode.cn/problems/find-the-shortest-superstring/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/find-the-shortest-superstring.md) | 位运算、数组、字符串、动态规划、状态压缩 | 困难 | +| [0691. 贴纸拼词](https://leetcode.cn/problems/stickers-to-spell-word/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/stickers-to-spell-word.md) | 位运算、记忆化搜索、数组、哈希表、字符串、动态规划、回溯、状态压缩 | 困难 | +| [0982. 按位与为零的三元组](https://leetcode.cn/problems/triples-with-bitwise-and-equal-to-zero/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/triples-with-bitwise-and-equal-to-zero.md) | 位运算、数组、哈希表 | 困难 | + + +### 计数 DP 题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0062. 不同路径](https://leetcode.cn/problems/unique-paths/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/unique-paths.md) | 数学、动态规划、组合数学 | 中等 | +| [0063. 不同路径 II](https://leetcode.cn/problems/unique-paths-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/unique-paths-ii.md) | 数组、动态规划、矩阵 | 中等 | +| [0343. 整数拆分](https://leetcode.cn/problems/integer-break/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/integer-break.md) | 数学、动态规划 | 中等 | +| [0096. 不同的二叉搜索树](https://leetcode.cn/problems/unique-binary-search-trees/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/unique-binary-search-trees.md) | 树、二叉搜索树、数学、动态规划、二叉树 | 中等 | +| [1259. 不相交的握手](https://leetcode.cn/problems/handshakes-that-dont-cross/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/handshakes-that-dont-cross.md) | 数学、动态规划 | 困难 | +| [0790. 多米诺和托米诺平铺](https://leetcode.cn/problems/domino-and-tromino-tiling/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/domino-and-tromino-tiling.md) | 动态规划 | 中等 | +| [0070. 爬楼梯](https://leetcode.cn/problems/climbing-stairs/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/climbing-stairs.md) | 记忆化搜索、数学、动态规划 | 简单 | +| [0746. 使用最小花费爬楼梯](https://leetcode.cn/problems/min-cost-climbing-stairs/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/min-cost-climbing-stairs.md) | 数组、动态规划 | 简单 | +| [0509. 斐波那契数](https://leetcode.cn/problems/fibonacci-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/fibonacci-number.md) | 递归、记忆化搜索、数学、动态规划 | 简单 | +| [1137. 第 N 个泰波那契数](https://leetcode.cn/problems/n-th-tribonacci-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/n-th-tribonacci-number.md) | 记忆化搜索、数学、动态规划 | 简单 | + + +### 数位 DP 题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [2376. 统计特殊整数](https://leetcode.cn/problems/count-special-integers/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2300-2399/count-special-integers.md) | 数学、动态规划 | 困难 | +| [0357. 统计各位数字都不同的数字个数](https://leetcode.cn/problems/count-numbers-with-unique-digits/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/count-numbers-with-unique-digits.md) | 数学、动态规划、回溯 | 中等 | +| [1012. 至少有 1 位重复的数字](https://leetcode.cn/problems/numbers-with-repeated-digits/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/numbers-with-repeated-digits.md) | 数学、动态规划 | 困难 | +| [0902. 最大为 N 的数字组合](https://leetcode.cn/problems/numbers-at-most-n-given-digit-set/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/numbers-at-most-n-given-digit-set.md) | 数组、数学、字符串、二分查找、动态规划 | 困难 | +| [0788. 旋转数字](https://leetcode.cn/problems/rotated-digits/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/rotated-digits.md) | 数学、动态规划 | 中等 | +| [0600. 不含连续1的非负整数](https://leetcode.cn/problems/non-negative-integers-without-consecutive-ones/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/non-negative-integers-without-consecutive-ones.md) | 动态规划 | 困难 | +| [0233. 数字 1 的个数](https://leetcode.cn/problems/number-of-digit-one/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/number-of-digit-one.md) | 递归、数学、动态规划 | 困难 | +| [2719. 统计整数数目](https://leetcode.cn/problems/count-of-integers/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2700-2799/count-of-integers.md) | 数学、字符串、动态规划 | 困难 | +| [0248. 中心对称数 III](https://leetcode.cn/problems/strobogrammatic-number-iii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/strobogrammatic-number-iii.md) | 递归、数组、字符串 | 困难 | +| [1088. 易混淆数 II](https://leetcode.cn/problems/confusing-number-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/confusing-number-ii.md) | 数学、回溯 | 困难 | +| [1067. 范围内的数字计数](https://leetcode.cn/problems/digit-count-in-range/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/digit-count-in-range.md) | 数学、动态规划 | 困难 | +| [1742. 盒子中小球的最大数量](https://leetcode.cn/problems/maximum-number-of-balls-in-a-box/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/maximum-number-of-balls-in-a-box.md) | 哈希表、数学、计数 | 简单 | +| [面试题 17.06. 2出现的次数](https://leetcode.cn/problems/number-of-2s-in-range-lcci/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/number-of-2s-in-range-lcci.md) | 递归、数学、动态规划 | 困难 | + + +### 概率 DP 题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0688. 骑士在棋盘上的概率](https://leetcode.cn/problems/knight-probability-in-chessboard/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/knight-probability-in-chessboard.md) | 动态规划 | 中等 | +| [0808. 分汤](https://leetcode.cn/problems/soup-servings/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/soup-servings.md) | 数学、动态规划、概率与统计 | 中等 | +| [0837. 新 21 点](https://leetcode.cn/problems/new-21-game/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/new-21-game.md) | 数学、动态规划、滑动窗口、概率与统计 | 中等 | +| [1230. 抛掷硬币](https://leetcode.cn/problems/toss-strange-coins/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/toss-strange-coins.md) | 数组、数学、动态规划、概率与统计 | 中等 | +| [1467. 两个盒子中球的颜色数相同的概率](https://leetcode.cn/problems/probability-of-a-two-boxes-having-the-same-number-of-distinct-balls/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/probability-of-a-two-boxes-having-the-same-number-of-distinct-balls.md) | 数组、数学、动态规划、回溯、组合数学、概率与统计 | 困难 | +| [1227. 飞机座位分配概率](https://leetcode.cn/problems/airplane-seat-assignment-probability/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/airplane-seat-assignment-probability.md) | 脑筋急转弯、数学、动态规划、概率与统计 | 中等 | +| [1377. T 秒后青蛙的位置](https://leetcode.cn/problems/frog-position-after-t-seconds/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/frog-position-after-t-seconds.md) | 树、深度优先搜索、广度优先搜索、图 | 困难 | +| [LCR 185. 统计结果概率](https://leetcode.cn/problems/nge-tou-zi-de-dian-shu-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/nge-tou-zi-de-dian-shu-lcof.md) | 数学、动态规划、概率与统计 | 中等 | + + diff --git a/docs/00_preface/00_07_interview_100_list.md b/docs/00_preface/00_07_interview_100_list.md new file mode 100644 index 00000000..18d65b8f --- /dev/null +++ b/docs/00_preface/00_07_interview_100_list.md @@ -0,0 +1,419 @@ +# LeetCode 面试最常考 100 题（按分类排序） + +## 第 1 章 数组 + +### 数组基础题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0054. 螺旋矩阵](https://leetcode.cn/problems/spiral-matrix/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/spiral-matrix.md) | 数组、矩阵、模拟 | 中等 | +| [0048. 旋转图像](https://leetcode.cn/problems/rotate-image/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/rotate-image.md) | 数组、数学、矩阵 | 中等 | + + +### 排序算法题目 + +#### 选择排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0215. 数组中的第K个最大元素](https://leetcode.cn/problems/kth-largest-element-in-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/kth-largest-element-in-an-array.md) | 数组、分治、快速选择、排序、堆（优先队列） | 中等 | + + +#### 希尔排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0912. 排序数组](https://leetcode.cn/problems/sort-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | + + +#### 归并排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0912. 排序数组](https://leetcode.cn/problems/sort-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | +| [0088. 合并两个有序数组](https://leetcode.cn/problems/merge-sorted-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-sorted-array.md) | 数组、双指针、排序 | 简单 | + + +#### 快速排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0912. 排序数组](https://leetcode.cn/problems/sort-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | +| [0169. 多数元素](https://leetcode.cn/problems/majority-element/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/majority-element.md) | 数组、哈希表、分治、计数、排序 | 简单 | + + +#### 堆排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0912. 排序数组](https://leetcode.cn/problems/sort-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | +| [0215. 数组中的第K个最大元素](https://leetcode.cn/problems/kth-largest-element-in-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/kth-largest-element-in-an-array.md) | 数组、分治、快速选择、排序、堆（优先队列） | 中等 | + + +#### 计数排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0912. 排序数组](https://leetcode.cn/problems/sort-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | + + +#### 桶排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0912. 排序数组](https://leetcode.cn/problems/sort-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | + + +#### 其他排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0136. 只出现一次的数字](https://leetcode.cn/problems/single-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/single-number.md) | 位运算、数组 | 简单 | +| [0056. 合并区间](https://leetcode.cn/problems/merge-intervals/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-intervals.md) | 数组、排序 | 中等 | +| [0179. 最大数](https://leetcode.cn/problems/largest-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/largest-number.md) | 贪心、数组、字符串、排序 | 中等 | + + +### 二分查找题目 + +#### 二分下标题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0704. 二分查找](https://leetcode.cn/problems/binary-search/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/binary-search.md) | 数组、二分查找 | 简单 | +| [0034. 在排序数组中查找元素的第一个和最后一个位置](https://leetcode.cn/problems/find-first-and-last-position-of-element-in-sorted-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/find-first-and-last-position-of-element-in-sorted-array.md) | 数组、二分查找 | 中等 | +| [0153. 寻找旋转排序数组中的最小值](https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/find-minimum-in-rotated-sorted-array.md) | 数组、二分查找 | 中等 | +| [0033. 搜索旋转排序数组](https://leetcode.cn/problems/search-in-rotated-sorted-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/search-in-rotated-sorted-array.md) | 数组、二分查找 | 中等 | +| [0162. 寻找峰值](https://leetcode.cn/problems/find-peak-element/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/find-peak-element.md) | 数组、二分查找 | 中等 | +| [0004. 寻找两个正序数组的中位数](https://leetcode.cn/problems/median-of-two-sorted-arrays/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/median-of-two-sorted-arrays.md) | 数组、二分查找、分治 | 困难 | +| [0240. 搜索二维矩阵 II](https://leetcode.cn/problems/search-a-2d-matrix-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/search-a-2d-matrix-ii.md) | 数组、二分查找、分治、矩阵 | 中等 | + + +#### 二分答案题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0069. x 的平方根](https://leetcode.cn/problems/sqrtx/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/sqrtx.md) | 数学、二分查找 | 简单 | + + +### 双指针题目 + +#### 对撞指针题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0015. 三数之和](https://leetcode.cn/problems/3sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/3sum.md) | 数组、双指针、排序 | 中等 | + + +#### 快慢指针题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0283. 移动零](https://leetcode.cn/problems/move-zeroes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/move-zeroes.md) | 数组、双指针 | 简单 | +| [0088. 合并两个有序数组](https://leetcode.cn/problems/merge-sorted-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-sorted-array.md) | 数组、双指针、排序 | 简单 | + + +#### 分离双指针题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0415. 字符串相加](https://leetcode.cn/problems/add-strings/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/add-strings.md) | 数学、字符串、模拟 | 简单 | + + +### 滑动窗口题目 + +#### 固定长度窗口题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0239. 滑动窗口最大值](https://leetcode.cn/problems/sliding-window-maximum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/sliding-window-maximum.md) | 队列、数组、滑动窗口、单调队列、堆（优先队列） | 困难 | + + +#### 不定长度窗口题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0003. 无重复字符的最长子串](https://leetcode.cn/problems/longest-substring-without-repeating-characters/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-substring-without-repeating-characters.md) | 哈希表、字符串、滑动窗口 | 中等 | +| [0076. 最小覆盖子串](https://leetcode.cn/problems/minimum-window-substring/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/minimum-window-substring.md) | 哈希表、字符串、滑动窗口 | 困难 | +| [0718. 最长重复子数组](https://leetcode.cn/problems/maximum-length-of-repeated-subarray/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/maximum-length-of-repeated-subarray.md) | 数组、二分查找、动态规划、滑动窗口、哈希函数、滚动哈希 | 中等 | + + +## 第 2 章 链表 + +### 链表基础题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0083. 删除排序链表中的重复元素](https://leetcode.cn/problems/remove-duplicates-from-sorted-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-duplicates-from-sorted-list.md) | 链表 | 简单 | +| [0082. 删除排序链表中的重复元素 II](https://leetcode.cn/problems/remove-duplicates-from-sorted-list-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-duplicates-from-sorted-list-ii.md) | 链表、双指针 | 中等 | +| [0206. 反转链表](https://leetcode.cn/problems/reverse-linked-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/reverse-linked-list.md) | 递归、链表 | 简单 | +| [0092. 反转链表 II](https://leetcode.cn/problems/reverse-linked-list-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/reverse-linked-list-ii.md) | 链表 | 中等 | +| [0025. K 个一组翻转链表](https://leetcode.cn/problems/reverse-nodes-in-k-group/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/reverse-nodes-in-k-group.md) | 递归、链表 | 困难 | +| [0234. 回文链表](https://leetcode.cn/problems/palindrome-linked-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/palindrome-linked-list.md) | 栈、递归、链表、双指针 | 简单 | + + +### 链表排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0148. 排序链表](https://leetcode.cn/problems/sort-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/sort-list.md) | 链表、双指针、分治、排序、归并排序 | 中等 | +| [0021. 合并两个有序链表](https://leetcode.cn/problems/merge-two-sorted-lists/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-two-sorted-lists.md) | 递归、链表 | 简单 | +| [0023. 合并 K 个升序链表](https://leetcode.cn/problems/merge-k-sorted-lists/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-k-sorted-lists.md) | 链表、分治、堆（优先队列）、归并排序 | 困难 | + + +### 链表双指针题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0141. 环形链表](https://leetcode.cn/problems/linked-list-cycle/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/linked-list-cycle.md) | 哈希表、链表、双指针 | 简单 | +| [0142. 环形链表 II](https://leetcode.cn/problems/linked-list-cycle-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/linked-list-cycle-ii.md) | 哈希表、链表、双指针 | 中等 | +| [0160. 相交链表](https://leetcode.cn/problems/intersection-of-two-linked-lists/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/intersection-of-two-linked-lists.md) | 哈希表、链表、双指针 | 简单 | +| [0019. 删除链表的倒数第 N 个结点](https://leetcode.cn/problems/remove-nth-node-from-end-of-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-nth-node-from-end-of-list.md) | 链表、双指针 | 中等 | +| [LCR 140. 训练计划 II](https://leetcode.cn/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof.md) | 链表、双指针 | 简单 | +| [0143. 重排链表](https://leetcode.cn/problems/reorder-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/reorder-list.md) | 栈、递归、链表、双指针 | 中等 | +| [0002. 两数相加](https://leetcode.cn/problems/add-two-numbers/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/add-two-numbers.md) | 递归、链表、数学 | 中等 | + + +## 第 3 章 栈、队列、哈希表 + +### 栈基础题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0155. 最小栈](https://leetcode.cn/problems/min-stack/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/min-stack.md) | 栈、设计 | 中等 | +| [0020. 有效的括号](https://leetcode.cn/problems/valid-parentheses/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/valid-parentheses.md) | 栈、字符串 | 简单 | +| [0227. 基本计算器 II](https://leetcode.cn/problems/basic-calculator-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/basic-calculator-ii.md) | 栈、数学、字符串 | 中等 | +| [0232. 用栈实现队列](https://leetcode.cn/problems/implement-queue-using-stacks/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/implement-queue-using-stacks.md) | 栈、设计、队列 | 简单 | +| [0394. 字符串解码](https://leetcode.cn/problems/decode-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/decode-string.md) | 栈、递归、字符串 | 中等 | +| [0032. 最长有效括号](https://leetcode.cn/problems/longest-valid-parentheses/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-valid-parentheses.md) | 栈、字符串、动态规划 | 困难 | + + +### 单调栈题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0042. 接雨水](https://leetcode.cn/problems/trapping-rain-water/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/trapping-rain-water.md) | 栈、数组、双指针、动态规划、单调栈 | 困难 | + + +### 队列基础题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0225. 用队列实现栈](https://leetcode.cn/problems/implement-stack-using-queues/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/implement-stack-using-queues.md) | 栈、设计、队列 | 简单 | + + +### 优先队列题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0023. 合并 K 个升序链表](https://leetcode.cn/problems/merge-k-sorted-lists/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-k-sorted-lists.md) | 链表、分治、堆（优先队列）、归并排序 | 困难 | +| [0239. 滑动窗口最大值](https://leetcode.cn/problems/sliding-window-maximum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/sliding-window-maximum.md) | 队列、数组、滑动窗口、单调队列、堆（优先队列） | 困难 | + + +### 哈希表题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0001. 两数之和](https://leetcode.cn/problems/two-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/two-sum.md) | 数组、哈希表 | 简单 | +| [0015. 三数之和](https://leetcode.cn/problems/3sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/3sum.md) | 数组、双指针、排序 | 中等 | +| [0041. 缺失的第一个正数](https://leetcode.cn/problems/first-missing-positive/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/first-missing-positive.md) | 数组、哈希表 | 困难 | +| [0128. 最长连续序列](https://leetcode.cn/problems/longest-consecutive-sequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/longest-consecutive-sequence.md) | 并查集、数组、哈希表 | 中等 | +| [0136. 只出现一次的数字](https://leetcode.cn/problems/single-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/single-number.md) | 位运算、数组 | 简单 | + + +## 第 4 章 字符串 + +### 字符串基础题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0003. 无重复字符的最长子串](https://leetcode.cn/problems/longest-substring-without-repeating-characters/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-substring-without-repeating-characters.md) | 哈希表、字符串、滑动窗口 | 中等 | +| [0005. 最长回文子串](https://leetcode.cn/problems/longest-palindromic-substring/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-palindromic-substring.md) | 双指针、字符串、动态规划 | 中等 | +| [0415. 字符串相加](https://leetcode.cn/problems/add-strings/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/add-strings.md) | 数学、字符串、模拟 | 简单 | +| [0151. 反转字符串中的单词](https://leetcode.cn/problems/reverse-words-in-a-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/reverse-words-in-a-string.md) | 双指针、字符串 | 中等 | +| [0043. 字符串相乘](https://leetcode.cn/problems/multiply-strings/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/multiply-strings.md) | 数学、字符串、模拟 | 中等 | +| [0014. 最长公共前缀](https://leetcode.cn/problems/longest-common-prefix/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-common-prefix.md) | 字典树、数组、字符串 | 简单 | + + +## 第 5 章 树 + +### 二叉树的遍历题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0144. 二叉树的前序遍历](https://leetcode.cn/problems/binary-tree-preorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-preorder-traversal.md) | 栈、树、深度优先搜索、二叉树 | 简单 | +| [0094. 二叉树的中序遍历](https://leetcode.cn/problems/binary-tree-inorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/binary-tree-inorder-traversal.md) | 栈、树、深度优先搜索、二叉树 | 简单 | +| [0102. 二叉树的层序遍历](https://leetcode.cn/problems/binary-tree-level-order-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-level-order-traversal.md) | 树、广度优先搜索、二叉树 | 中等 | +| [0103. 二叉树的锯齿形层序遍历](https://leetcode.cn/problems/binary-tree-zigzag-level-order-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-zigzag-level-order-traversal.md) | 树、广度优先搜索、二叉树 | 中等 | +| [0236. 二叉树的最近公共祖先](https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/lowest-common-ancestor-of-a-binary-tree.md) | 树、深度优先搜索、二叉树 | 中等 | +| [0104. 二叉树的最大深度](https://leetcode.cn/problems/maximum-depth-of-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/maximum-depth-of-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0112. 路径总和](https://leetcode.cn/problems/path-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/path-sum.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0113. 路径总和 II](https://leetcode.cn/problems/path-sum-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/path-sum-ii.md) | 树、深度优先搜索、回溯、二叉树 | 中等 | +| [0101. 对称二叉树](https://leetcode.cn/problems/symmetric-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/symmetric-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0124. 二叉树中的最大路径和](https://leetcode.cn/problems/binary-tree-maximum-path-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-maximum-path-sum.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | +| [0199. 二叉树的右视图](https://leetcode.cn/problems/binary-tree-right-side-view/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-right-side-view.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | +| [0226. 翻转二叉树](https://leetcode.cn/problems/invert-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/invert-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | + + +### 二叉树的还原题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0105. 从前序与中序遍历序列构造二叉树](https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/construct-binary-tree-from-preorder-and-inorder-traversal.md) | 树、数组、哈希表、分治、二叉树 | 中等 | + + +### 二叉搜索树题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0098. 验证二叉搜索树](https://leetcode.cn/problems/validate-binary-search-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/validate-binary-search-tree.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | +| [0110. 平衡二叉树](https://leetcode.cn/problems/balanced-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/balanced-binary-tree.md) | 树、深度优先搜索、二叉树 | 简单 | + + +### 并查集题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0128. 最长连续序列](https://leetcode.cn/problems/longest-consecutive-sequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/longest-consecutive-sequence.md) | 并查集、数组、哈希表 | 中等 | + + +## 第 6 章 图论 + +### 深度优先搜索题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0200. 岛屿数量](https://leetcode.cn/problems/number-of-islands/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/number-of-islands.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | +| [0695. 岛屿的最大面积](https://leetcode.cn/problems/max-area-of-island/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/max-area-of-island.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | +| [0144. 二叉树的前序遍历](https://leetcode.cn/problems/binary-tree-preorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-preorder-traversal.md) | 栈、树、深度优先搜索、二叉树 | 简单 | +| [0094. 二叉树的中序遍历](https://leetcode.cn/problems/binary-tree-inorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/binary-tree-inorder-traversal.md) | 栈、树、深度优先搜索、二叉树 | 简单 | +| [0129. 求根节点到叶节点数字之和](https://leetcode.cn/problems/sum-root-to-leaf-numbers/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/sum-root-to-leaf-numbers.md) | 树、深度优先搜索、二叉树 | 中等 | +| [0124. 二叉树中的最大路径和](https://leetcode.cn/problems/binary-tree-maximum-path-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-maximum-path-sum.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | +| [0199. 二叉树的右视图](https://leetcode.cn/problems/binary-tree-right-side-view/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-right-side-view.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | +| [0543. 二叉树的直径](https://leetcode.cn/problems/diameter-of-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/diameter-of-binary-tree.md) | 树、深度优先搜索、二叉树 | 简单 | +| [0662. 二叉树最大宽度](https://leetcode.cn/problems/maximum-width-of-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/maximum-width-of-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | + + +### 广度优先搜索题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0200. 岛屿数量](https://leetcode.cn/problems/number-of-islands/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/number-of-islands.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | +| [0322. 零钱兑换](https://leetcode.cn/problems/coin-change/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/coin-change.md) | 广度优先搜索、数组、动态规划 | 中等 | +| [0199. 二叉树的右视图](https://leetcode.cn/problems/binary-tree-right-side-view/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-right-side-view.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | +| [0662. 二叉树最大宽度](https://leetcode.cn/problems/maximum-width-of-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/maximum-width-of-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | + + +## 第 7 章 基础算法 + +### 枚举算法题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0001. 两数之和](https://leetcode.cn/problems/two-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/two-sum.md) | 数组、哈希表 | 简单 | +| [0078. 子集](https://leetcode.cn/problems/subsets/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/subsets.md) | 位运算、数组、回溯 | 中等 | +| [0221. 最大正方形](https://leetcode.cn/problems/maximal-square/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/maximal-square.md) | 数组、动态规划、矩阵 | 中等 | + + +### 递归算法题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0024. 两两交换链表中的节点](https://leetcode.cn/problems/swap-nodes-in-pairs/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/swap-nodes-in-pairs.md) | 递归、链表 | 中等 | +| [0206. 反转链表](https://leetcode.cn/problems/reverse-linked-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/reverse-linked-list.md) | 递归、链表 | 简单 | +| [0092. 反转链表 II](https://leetcode.cn/problems/reverse-linked-list-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/reverse-linked-list-ii.md) | 链表 | 中等 | +| [0021. 合并两个有序链表](https://leetcode.cn/problems/merge-two-sorted-lists/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-two-sorted-lists.md) | 递归、链表 | 简单 | +| [0070. 爬楼梯](https://leetcode.cn/problems/climbing-stairs/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/climbing-stairs.md) | 记忆化搜索、数学、动态规划 | 简单 | +| [0104. 二叉树的最大深度](https://leetcode.cn/problems/maximum-depth-of-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/maximum-depth-of-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0124. 二叉树中的最大路径和](https://leetcode.cn/problems/binary-tree-maximum-path-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-maximum-path-sum.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | +| [0226. 翻转二叉树](https://leetcode.cn/problems/invert-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/invert-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | + + +### 分治算法题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0053. 最大子数组和](https://leetcode.cn/problems/maximum-subarray/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/maximum-subarray.md) | 数组、分治、动态规划 | 中等 | +| [0023. 合并 K 个升序链表](https://leetcode.cn/problems/merge-k-sorted-lists/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-k-sorted-lists.md) | 链表、分治、堆（优先队列）、归并排序 | 困难 | +| [0004. 寻找两个正序数组的中位数](https://leetcode.cn/problems/median-of-two-sorted-arrays/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/median-of-two-sorted-arrays.md) | 数组、二分查找、分治 | 困难 | +| [0169. 多数元素](https://leetcode.cn/problems/majority-element/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/majority-element.md) | 数组、哈希表、分治、计数、排序 | 简单 | +| [0014. 最长公共前缀](https://leetcode.cn/problems/longest-common-prefix/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-common-prefix.md) | 字典树、数组、字符串 | 简单 | + + +### 回溯算法题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0046. 全排列](https://leetcode.cn/problems/permutations/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/permutations.md) | 数组、回溯 | 中等 | +| [0022. 括号生成](https://leetcode.cn/problems/generate-parentheses/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/generate-parentheses.md) | 字符串、动态规划、回溯 | 中等 | +| [0078. 子集](https://leetcode.cn/problems/subsets/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/subsets.md) | 位运算、数组、回溯 | 中等 | +| [0039. 组合总和](https://leetcode.cn/problems/combination-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/combination-sum.md) | 数组、回溯 | 中等 | +| [0093. 复原 IP 地址](https://leetcode.cn/problems/restore-ip-addresses/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/restore-ip-addresses.md) | 字符串、回溯 | 中等 | + + +### 贪心算法题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0053. 最大子数组和](https://leetcode.cn/problems/maximum-subarray/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/maximum-subarray.md) | 数组、分治、动态规划 | 中等 | +| [0056. 合并区间](https://leetcode.cn/problems/merge-intervals/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-intervals.md) | 数组、排序 | 中等 | +| [0122. 买卖股票的最佳时机 II](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/best-time-to-buy-and-sell-stock-ii.md) | 贪心、数组、动态规划 | 中等 | + + +### 位运算题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0136. 只出现一次的数字](https://leetcode.cn/problems/single-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/single-number.md) | 位运算、数组 | 简单 | + + +## 第 8 章 动态规划 + +### 动态规划题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0070. 爬楼梯](https://leetcode.cn/problems/climbing-stairs/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/climbing-stairs.md) | 记忆化搜索、数学、动态规划 | 简单 | +| [0121. 买卖股票的最佳时机](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/best-time-to-buy-and-sell-stock.md) | 数组、动态规划 | 简单 | +| [0322. 零钱兑换](https://leetcode.cn/problems/coin-change/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/coin-change.md) | 广度优先搜索、数组、动态规划 | 中等 | +| [0300. 最长递增子序列](https://leetcode.cn/problems/longest-increasing-subsequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/longest-increasing-subsequence.md) | 数组、二分查找、动态规划 | 中等 | +| [1143. 最长公共子序列](https://leetcode.cn/problems/longest-common-subsequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/longest-common-subsequence.md) | 字符串、动态规划 | 中等 | +| [0718. 最长重复子数组](https://leetcode.cn/problems/maximum-length-of-repeated-subarray/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/maximum-length-of-repeated-subarray.md) | 数组、二分查找、动态规划、滑动窗口、哈希函数、滚动哈希 | 中等 | +| [0064. 最小路径和](https://leetcode.cn/problems/minimum-path-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/minimum-path-sum.md) | 数组、动态规划、矩阵 | 中等 | +| [0072. 编辑距离](https://leetcode.cn/problems/edit-distance/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/edit-distance.md) | 字符串、动态规划 | 中等 | +| [0032. 最长有效括号](https://leetcode.cn/problems/longest-valid-parentheses/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-valid-parentheses.md) | 栈、字符串、动态规划 | 困难 | +| [0221. 最大正方形](https://leetcode.cn/problems/maximal-square/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/maximal-square.md) | 数组、动态规划、矩阵 | 中等 | +| [0062. 不同路径](https://leetcode.cn/problems/unique-paths/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/unique-paths.md) | 数学、动态规划、组合数学 | 中等 | +| [0152. 乘积最大子数组](https://leetcode.cn/problems/maximum-product-subarray/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/maximum-product-subarray.md) | 数组、动态规划 | 中等 | +| [0198. 打家劫舍](https://leetcode.cn/problems/house-robber/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/house-robber.md) | 数组、动态规划 | 中等 | + + +## 补充题目 + +#### 设计数据结构题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0146. LRU 缓存](https://leetcode.cn/problems/lru-cache/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/lru-cache.md) | 设计、哈希表、链表、双向链表 | 中等 | + + +#### 模拟题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0008. 字符串转换整数 (atoi)](https://leetcode.cn/problems/string-to-integer-atoi/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/string-to-integer-atoi.md) | 字符串 | 中等 | +| [0165. 比较版本号](https://leetcode.cn/problems/compare-version-numbers/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/compare-version-numbers.md) | 双指针、字符串 | 中等 | +| [0468. 验证IP地址](https://leetcode.cn/problems/validate-ip-address/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/validate-ip-address.md) | 字符串 | 中等 | + + +#### 思维锻炼题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0031. 下一个排列](https://leetcode.cn/problems/next-permutation/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/next-permutation.md) | 数组、双指针 | 中等 | +| [0470. 用 Rand7() 实现 Rand10()](https://leetcode.cn/problems/implement-rand10-using-rand7/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/implement-rand10-using-rand7.md) | 数学、拒绝采样、概率与统计、随机化 | 中等 | + + + +## 参考资料 + +- 【清单】[CodeTop 企业题库](https://codetop.cc/home) diff --git a/docs/00_preface/00_08_interview_200_list.md b/docs/00_preface/00_08_interview_200_list.md new file mode 100644 index 00000000..32360029 --- /dev/null +++ b/docs/00_preface/00_08_interview_200_list.md @@ -0,0 +1,598 @@ +# LeetCode 面试最常考 200 题（按分类排序） + +## 第 1 章 数组 + +### 数组基础题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0189. 轮转数组](https://leetcode.cn/problems/rotate-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/rotate-array.md) | 数组、数学、双指针 | 中等 | +| [0498. 对角线遍历](https://leetcode.cn/problems/diagonal-traverse/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/diagonal-traverse.md) | 数组、矩阵、模拟 | 中等 | +| [0048. 旋转图像](https://leetcode.cn/problems/rotate-image/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/rotate-image.md) | 数组、数学、矩阵 | 中等 | +| [0054. 螺旋矩阵](https://leetcode.cn/problems/spiral-matrix/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/spiral-matrix.md) | 数组、矩阵、模拟 | 中等 | +| [0059. 螺旋矩阵 II](https://leetcode.cn/problems/spiral-matrix-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/spiral-matrix-ii.md) | 数组、矩阵、模拟 | 中等 | + + +### 排序算法题目 + +#### 冒泡排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0283. 移动零](https://leetcode.cn/problems/move-zeroes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/move-zeroes.md) | 数组、双指针 | 简单 | + + +#### 选择排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0215. 数组中的第K个最大元素](https://leetcode.cn/problems/kth-largest-element-in-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/kth-largest-element-in-an-array.md) | 数组、分治、快速选择、排序、堆（优先队列） | 中等 | + + +#### 插入排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0075. 颜色分类](https://leetcode.cn/problems/sort-colors/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/sort-colors.md) | 数组、双指针、排序 | 中等 | + + +#### 希尔排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0912. 排序数组](https://leetcode.cn/problems/sort-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | + + +#### 归并排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0912. 排序数组](https://leetcode.cn/problems/sort-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | +| [0088. 合并两个有序数组](https://leetcode.cn/problems/merge-sorted-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-sorted-array.md) | 数组、双指针、排序 | 简单 | +| [LCR 170. 交易逆序对的总数](https://leetcode.cn/problems/shu-zu-zhong-de-ni-xu-dui-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/shu-zu-zhong-de-ni-xu-dui-lcof.md) | 树状数组、线段树、数组、二分查找、分治、有序集合、归并排序 | 困难 | + + +#### 快速排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0912. 排序数组](https://leetcode.cn/problems/sort-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | +| [0169. 多数元素](https://leetcode.cn/problems/majority-element/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/majority-element.md) | 数组、哈希表、分治、计数、排序 | 简单 | + + +#### 堆排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0912. 排序数组](https://leetcode.cn/problems/sort-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | +| [0215. 数组中的第K个最大元素](https://leetcode.cn/problems/kth-largest-element-in-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/kth-largest-element-in-an-array.md) | 数组、分治、快速选择、排序、堆（优先队列） | 中等 | +| [LCR 159. 库存管理 III](https://leetcode.cn/problems/zui-xiao-de-kge-shu-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/zui-xiao-de-kge-shu-lcof.md) | 数组、分治、快速选择、排序、堆（优先队列） | 简单 | + + +#### 计数排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0912. 排序数组](https://leetcode.cn/problems/sort-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | + + +#### 桶排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0912. 排序数组](https://leetcode.cn/problems/sort-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md) | 数组、分治、桶排序、计数排序、基数排序、排序、堆（优先队列）、归并排序 | 中等 | + + +#### 基数排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0164. 最大间距](https://leetcode.cn/problems/maximum-gap/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/maximum-gap.md) | 数组、桶排序、基数排序、排序 | 中等 | + + +#### 其他排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0136. 只出现一次的数字](https://leetcode.cn/problems/single-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/single-number.md) | 位运算、数组 | 简单 | +| [0056. 合并区间](https://leetcode.cn/problems/merge-intervals/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-intervals.md) | 数组、排序 | 中等 | +| [0179. 最大数](https://leetcode.cn/problems/largest-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/largest-number.md) | 贪心、数组、字符串、排序 | 中等 | +| [0384. 打乱数组](https://leetcode.cn/problems/shuffle-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/shuffle-an-array.md) | 设计、数组、数学、随机化 | 中等 | +| [LCR 164. 破解闯关密码](https://leetcode.cn/problems/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof.md) | 贪心、字符串、排序 | 中等 | + + +### 二分查找题目 + +#### 二分下标题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0704. 二分查找](https://leetcode.cn/problems/binary-search/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/binary-search.md) | 数组、二分查找 | 简单 | +| [0034. 在排序数组中查找元素的第一个和最后一个位置](https://leetcode.cn/problems/find-first-and-last-position-of-element-in-sorted-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/find-first-and-last-position-of-element-in-sorted-array.md) | 数组、二分查找 | 中等 | +| [0153. 寻找旋转排序数组中的最小值](https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/find-minimum-in-rotated-sorted-array.md) | 数组、二分查找 | 中等 | +| [0154. 寻找旋转排序数组中的最小值 II](https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/find-minimum-in-rotated-sorted-array-ii.md) | 数组、二分查找 | 困难 | +| [0033. 搜索旋转排序数组](https://leetcode.cn/problems/search-in-rotated-sorted-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/search-in-rotated-sorted-array.md) | 数组、二分查找 | 中等 | +| [0162. 寻找峰值](https://leetcode.cn/problems/find-peak-element/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/find-peak-element.md) | 数组、二分查找 | 中等 | +| [0004. 寻找两个正序数组的中位数](https://leetcode.cn/problems/median-of-two-sorted-arrays/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/median-of-two-sorted-arrays.md) | 数组、二分查找、分治 | 困难 | +| [0074. 搜索二维矩阵](https://leetcode.cn/problems/search-a-2d-matrix/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/search-a-2d-matrix.md) | 数组、二分查找、矩阵 | 中等 | +| [0240. 搜索二维矩阵 II](https://leetcode.cn/problems/search-a-2d-matrix-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/search-a-2d-matrix-ii.md) | 数组、二分查找、分治、矩阵 | 中等 | + + +#### 二分答案题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0069. x 的平方根](https://leetcode.cn/problems/sqrtx/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/sqrtx.md) | 数学、二分查找 | 简单 | +| [0287. 寻找重复数](https://leetcode.cn/problems/find-the-duplicate-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/find-the-duplicate-number.md) | 位运算、数组、双指针、二分查找 | 中等 | +| [0050. Pow(x, n)](https://leetcode.cn/problems/powx-n/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/powx-n.md) | 递归、数学 | 中等 | +| [0400. 第 N 位数字](https://leetcode.cn/problems/nth-digit/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/nth-digit.md) | 数学、二分查找 | 中等 | + + +#### 复杂的二分查找问题 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0209. 长度最小的子数组](https://leetcode.cn/problems/minimum-size-subarray-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/minimum-size-subarray-sum.md) | 数组、二分查找、前缀和、滑动窗口 | 中等 | +| [0349. 两个数组的交集](https://leetcode.cn/problems/intersection-of-two-arrays/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/intersection-of-two-arrays.md) | 数组、哈希表、双指针、二分查找、排序 | 简单 | + + +### 双指针题目 + +#### 对撞指针题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0611. 有效三角形的个数](https://leetcode.cn/problems/valid-triangle-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/valid-triangle-number.md) | 贪心、数组、双指针、二分查找、排序 | 中等 | +| [0015. 三数之和](https://leetcode.cn/problems/3sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/3sum.md) | 数组、双指针、排序 | 中等 | +| [0016. 最接近的三数之和](https://leetcode.cn/problems/3sum-closest/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/3sum-closest.md) | 数组、双指针、排序 | 中等 | +| [0125. 验证回文串](https://leetcode.cn/problems/valid-palindrome/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/valid-palindrome.md) | 双指针、字符串 | 简单 | +| [0011. 盛最多水的容器](https://leetcode.cn/problems/container-with-most-water/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/container-with-most-water.md) | 贪心、数组、双指针 | 中等 | +| [0075. 颜色分类](https://leetcode.cn/problems/sort-colors/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/sort-colors.md) | 数组、双指针、排序 | 中等 | +| [LCR 139. 训练计划 I](https://leetcode.cn/problems/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof.md) | 数组、双指针、排序 | 简单 | +| [0443. 压缩字符串](https://leetcode.cn/problems/string-compression/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/string-compression.md) | 双指针、字符串 | 中等 | + + +#### 快慢指针题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0026. 删除有序数组中的重复项](https://leetcode.cn/problems/remove-duplicates-from-sorted-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-duplicates-from-sorted-array.md) | 数组、双指针 | 简单 | +| [0283. 移动零](https://leetcode.cn/problems/move-zeroes/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/move-zeroes.md) | 数组、双指针 | 简单 | +| [0088. 合并两个有序数组](https://leetcode.cn/problems/merge-sorted-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-sorted-array.md) | 数组、双指针、排序 | 简单 | + + +#### 分离双指针题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0415. 字符串相加](https://leetcode.cn/problems/add-strings/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/add-strings.md) | 数学、字符串、模拟 | 简单 | + + +### 滑动窗口题目 + +#### 固定长度窗口题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0239. 滑动窗口最大值](https://leetcode.cn/problems/sliding-window-maximum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/sliding-window-maximum.md) | 队列、数组、滑动窗口、单调队列、堆（优先队列） | 困难 | + + +#### 不定长度窗口题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0003. 无重复字符的最长子串](https://leetcode.cn/problems/longest-substring-without-repeating-characters/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-substring-without-repeating-characters.md) | 哈希表、字符串、滑动窗口 | 中等 | +| [0076. 最小覆盖子串](https://leetcode.cn/problems/minimum-window-substring/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/minimum-window-substring.md) | 哈希表、字符串、滑动窗口 | 困难 | +| [0718. 最长重复子数组](https://leetcode.cn/problems/maximum-length-of-repeated-subarray/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/maximum-length-of-repeated-subarray.md) | 数组、二分查找、动态规划、滑动窗口、哈希函数、滚动哈希 | 中等 | +| [0209. 长度最小的子数组](https://leetcode.cn/problems/minimum-size-subarray-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/minimum-size-subarray-sum.md) | 数组、二分查找、前缀和、滑动窗口 | 中等 | +| [0862. 和至少为 K 的最短子数组](https://leetcode.cn/problems/shortest-subarray-with-sum-at-least-k/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/shortest-subarray-with-sum-at-least-k.md) | 队列、数组、二分查找、前缀和、滑动窗口、单调队列、堆（优先队列） | 困难 | +| [1004. 最大连续1的个数 III](https://leetcode.cn/problems/max-consecutive-ones-iii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/max-consecutive-ones-iii.md) | 数组、二分查找、前缀和、滑动窗口 | 中等 | + + +## 02. 链表 + +### 链表基础题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0083. 删除排序链表中的重复元素](https://leetcode.cn/problems/remove-duplicates-from-sorted-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-duplicates-from-sorted-list.md) | 链表 | 简单 | +| [0082. 删除排序链表中的重复元素 II](https://leetcode.cn/problems/remove-duplicates-from-sorted-list-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-duplicates-from-sorted-list-ii.md) | 链表、双指针 | 中等 | +| [0206. 反转链表](https://leetcode.cn/problems/reverse-linked-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/reverse-linked-list.md) | 递归、链表 | 简单 | +| [0092. 反转链表 II](https://leetcode.cn/problems/reverse-linked-list-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/reverse-linked-list-ii.md) | 链表 | 中等 | +| [0025. K 个一组翻转链表](https://leetcode.cn/problems/reverse-nodes-in-k-group/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/reverse-nodes-in-k-group.md) | 递归、链表 | 困难 | +| [0328. 奇偶链表](https://leetcode.cn/problems/odd-even-linked-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/odd-even-linked-list.md) | 链表 | 中等 | +| [0234. 回文链表](https://leetcode.cn/problems/palindrome-linked-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/palindrome-linked-list.md) | 栈、递归、链表、双指针 | 简单 | +| [0138. 随机链表的复制](https://leetcode.cn/problems/copy-list-with-random-pointer/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/copy-list-with-random-pointer.md) | 哈希表、链表 | 中等 | +| [0061. 旋转链表](https://leetcode.cn/problems/rotate-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/rotate-list.md) | 链表、双指针 | 中等 | + + +### 链表排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0148. 排序链表](https://leetcode.cn/problems/sort-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/sort-list.md) | 链表、双指针、分治、排序、归并排序 | 中等 | +| [0021. 合并两个有序链表](https://leetcode.cn/problems/merge-two-sorted-lists/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-two-sorted-lists.md) | 递归、链表 | 简单 | +| [0023. 合并 K 个升序链表](https://leetcode.cn/problems/merge-k-sorted-lists/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-k-sorted-lists.md) | 链表、分治、堆（优先队列）、归并排序 | 困难 | + + +### 链表双指针题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0141. 环形链表](https://leetcode.cn/problems/linked-list-cycle/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/linked-list-cycle.md) | 哈希表、链表、双指针 | 简单 | +| [0142. 环形链表 II](https://leetcode.cn/problems/linked-list-cycle-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/linked-list-cycle-ii.md) | 哈希表、链表、双指针 | 中等 | +| [0160. 相交链表](https://leetcode.cn/problems/intersection-of-two-linked-lists/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/intersection-of-two-linked-lists.md) | 哈希表、链表、双指针 | 简单 | +| [0019. 删除链表的倒数第 N 个结点](https://leetcode.cn/problems/remove-nth-node-from-end-of-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-nth-node-from-end-of-list.md) | 链表、双指针 | 中等 | +| [LCR 140. 训练计划 II](https://leetcode.cn/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof.md) | 链表、双指针 | 简单 | +| [0143. 重排链表](https://leetcode.cn/problems/reorder-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/reorder-list.md) | 栈、递归、链表、双指针 | 中等 | +| [0002. 两数相加](https://leetcode.cn/problems/add-two-numbers/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/add-two-numbers.md) | 递归、链表、数学 | 中等 | +| [0445. 两数相加 II](https://leetcode.cn/problems/add-two-numbers-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/add-two-numbers-ii.md) | 栈、链表、数学 | 中等 | + + +## 第 3 章 栈、队列、哈希表 + +### 栈基础题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [1047. 删除字符串中的所有相邻重复项](https://leetcode.cn/problems/remove-all-adjacent-duplicates-in-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/remove-all-adjacent-duplicates-in-string.md) | 栈、字符串 | 简单 | +| [0155. 最小栈](https://leetcode.cn/problems/min-stack/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/min-stack.md) | 栈、设计 | 中等 | +| [0020. 有效的括号](https://leetcode.cn/problems/valid-parentheses/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/valid-parentheses.md) | 栈、字符串 | 简单 | +| [0224. 基本计算器](https://leetcode.cn/problems/basic-calculator/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/basic-calculator.md) | 栈、递归、数学、字符串 | 困难 | +| [0227. 基本计算器 II](https://leetcode.cn/problems/basic-calculator-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/basic-calculator-ii.md) | 栈、数学、字符串 | 中等 | +| [0232. 用栈实现队列](https://leetcode.cn/problems/implement-queue-using-stacks/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/implement-queue-using-stacks.md) | 栈、设计、队列 | 简单 | +| [LCR 125. 图书整理 II](https://leetcode.cn/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/yong-liang-ge-zhan-shi-xian-dui-lie-lcof.md) | 栈、设计、队列 | 简单 | +| [0394. 字符串解码](https://leetcode.cn/problems/decode-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/decode-string.md) | 栈、递归、字符串 | 中等 | +| [0032. 最长有效括号](https://leetcode.cn/problems/longest-valid-parentheses/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-valid-parentheses.md) | 栈、字符串、动态规划 | 困难 | +| [0739. 每日温度](https://leetcode.cn/problems/daily-temperatures/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/daily-temperatures.md) | 栈、数组、单调栈 | 中等 | +| [0071. 简化路径](https://leetcode.cn/problems/simplify-path/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/simplify-path.md) | 栈、字符串 | 中等 | + + +### 单调栈题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0739. 每日温度](https://leetcode.cn/problems/daily-temperatures/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/daily-temperatures.md) | 栈、数组、单调栈 | 中等 | +| [0503. 下一个更大元素 II](https://leetcode.cn/problems/next-greater-element-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/next-greater-element-ii.md) | 栈、数组、单调栈 | 中等 | +| [0042. 接雨水](https://leetcode.cn/problems/trapping-rain-water/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/trapping-rain-water.md) | 栈、数组、双指针、动态规划、单调栈 | 困难 | +| [0085. 最大矩形](https://leetcode.cn/problems/maximal-rectangle/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/maximal-rectangle.md) | 栈、数组、动态规划、矩阵、单调栈 | 困难 | + + +### 队列基础题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0225. 用队列实现栈](https://leetcode.cn/problems/implement-stack-using-queues/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/implement-stack-using-queues.md) | 栈、设计、队列 | 简单 | + + +### 优先队列题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0347. 前 K 个高频元素](https://leetcode.cn/problems/top-k-frequent-elements/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/top-k-frequent-elements.md) | 数组、哈希表、分治、桶排序、计数、快速选择、排序、堆（优先队列） | 中等 | +| [0239. 滑动窗口最大值](https://leetcode.cn/problems/sliding-window-maximum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/sliding-window-maximum.md) | 队列、数组、滑动窗口、单调队列、堆（优先队列） | 困难 | +| [0295. 数据流的中位数](https://leetcode.cn/problems/find-median-from-data-stream/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/find-median-from-data-stream.md) | 设计、双指针、数据流、排序、堆（优先队列） | 困难 | +| [0023. 合并 K 个升序链表](https://leetcode.cn/problems/merge-k-sorted-lists/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-k-sorted-lists.md) | 链表、分治、堆（优先队列）、归并排序 | 困难 | + + +### 哈希表题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0001. 两数之和](https://leetcode.cn/problems/two-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/two-sum.md) | 数组、哈希表 | 简单 | +| [0015. 三数之和](https://leetcode.cn/problems/3sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/3sum.md) | 数组、双指针、排序 | 中等 | +| [0041. 缺失的第一个正数](https://leetcode.cn/problems/first-missing-positive/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/first-missing-positive.md) | 数组、哈希表 | 困难 | +| [0128. 最长连续序列](https://leetcode.cn/problems/longest-consecutive-sequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/longest-consecutive-sequence.md) | 并查集、数组、哈希表 | 中等 | +| [0136. 只出现一次的数字](https://leetcode.cn/problems/single-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/single-number.md) | 位运算、数组 | 简单 | +| [0242. 有效的字母异位词](https://leetcode.cn/problems/valid-anagram/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/valid-anagram.md) | 哈希表、字符串、排序 | 简单 | +| [0442. 数组中重复的数据](https://leetcode.cn/problems/find-all-duplicates-in-an-array/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/find-all-duplicates-in-an-array.md) | 数组、哈希表 | 中等 | +| [LCR 186. 文物朝代判断](https://leetcode.cn/problems/bu-ke-pai-zhong-de-shun-zi-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/bu-ke-pai-zhong-de-shun-zi-lcof.md) | 数组、排序 | 简单 | +| [0268. 丢失的数字](https://leetcode.cn/problems/missing-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/missing-number.md) | 位运算、数组、哈希表、数学、二分查找、排序 | 简单 | +| [LCR 120. 寻找文件副本](https://leetcode.cn/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/shu-zu-zhong-zhong-fu-de-shu-zi-lcof.md) | 数组、哈希表、排序 | 简单 | + + +## 第 4 章 字符串 + +### 字符串基础题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0125. 验证回文串](https://leetcode.cn/problems/valid-palindrome/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/valid-palindrome.md) | 双指针、字符串 | 简单 | +| [0005. 最长回文子串](https://leetcode.cn/problems/longest-palindromic-substring/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-palindromic-substring.md) | 双指针、字符串、动态规划 | 中等 | +| [0003. 无重复字符的最长子串](https://leetcode.cn/problems/longest-substring-without-repeating-characters/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-substring-without-repeating-characters.md) | 哈希表、字符串、滑动窗口 | 中等 | +| [0344. 反转字符串](https://leetcode.cn/problems/reverse-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/reverse-string.md) | 双指针、字符串 | 简单 | +| [0557. 反转字符串中的单词 III](https://leetcode.cn/problems/reverse-words-in-a-string-iii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/reverse-words-in-a-string-iii.md) | 双指针、字符串 | 简单 | +| [0415. 字符串相加](https://leetcode.cn/problems/add-strings/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/add-strings.md) | 数学、字符串、模拟 | 简单 | +| [0151. 反转字符串中的单词](https://leetcode.cn/problems/reverse-words-in-a-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/reverse-words-in-a-string.md) | 双指针、字符串 | 中等 | +| [0043. 字符串相乘](https://leetcode.cn/problems/multiply-strings/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/multiply-strings.md) | 数学、字符串、模拟 | 中等 | +| [0014. 最长公共前缀](https://leetcode.cn/problems/longest-common-prefix/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-common-prefix.md) | 字典树、数组、字符串 | 简单 | + + +### 单模式串匹配题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0459. 重复的子字符串](https://leetcode.cn/problems/repeated-substring-pattern/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/repeated-substring-pattern.md) | 字符串、字符串匹配 | 简单 | + + +### 字典树题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0208. 实现 Trie (前缀树)](https://leetcode.cn/problems/implement-trie-prefix-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/implement-trie-prefix-tree.md) | 设计、字典树、哈希表、字符串 | 中等 | +| [0440. 字典序的第K小数字](https://leetcode.cn/problems/k-th-smallest-in-lexicographical-order/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/k-th-smallest-in-lexicographical-order.md) | 字典树 | 困难 | + + +## 第 5 章 树 + +### 二叉树的遍历题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0144. 二叉树的前序遍历](https://leetcode.cn/problems/binary-tree-preorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-preorder-traversal.md) | 栈、树、深度优先搜索、二叉树 | 简单 | +| [0094. 二叉树的中序遍历](https://leetcode.cn/problems/binary-tree-inorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/binary-tree-inorder-traversal.md) | 栈、树、深度优先搜索、二叉树 | 简单 | +| [0145. 二叉树的后序遍历](https://leetcode.cn/problems/binary-tree-postorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-postorder-traversal.md) | 栈、树、深度优先搜索、二叉树 | 简单 | +| [0102. 二叉树的层序遍历](https://leetcode.cn/problems/binary-tree-level-order-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-level-order-traversal.md) | 树、广度优先搜索、二叉树 | 中等 | +| [0103. 二叉树的锯齿形层序遍历](https://leetcode.cn/problems/binary-tree-zigzag-level-order-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-zigzag-level-order-traversal.md) | 树、广度优先搜索、二叉树 | 中等 | +| [0104. 二叉树的最大深度](https://leetcode.cn/problems/maximum-depth-of-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/maximum-depth-of-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0111. 二叉树的最小深度](https://leetcode.cn/problems/minimum-depth-of-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/minimum-depth-of-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0124. 二叉树中的最大路径和](https://leetcode.cn/problems/binary-tree-maximum-path-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-maximum-path-sum.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | +| [0101. 对称二叉树](https://leetcode.cn/problems/symmetric-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/symmetric-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0112. 路径总和](https://leetcode.cn/problems/path-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/path-sum.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0113. 路径总和 II](https://leetcode.cn/problems/path-sum-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/path-sum-ii.md) | 树、深度优先搜索、回溯、二叉树 | 中等 | +| [0236. 二叉树的最近公共祖先](https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/lowest-common-ancestor-of-a-binary-tree.md) | 树、深度优先搜索、二叉树 | 中等 | +| [0199. 二叉树的右视图](https://leetcode.cn/problems/binary-tree-right-side-view/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-right-side-view.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | +| [0226. 翻转二叉树](https://leetcode.cn/problems/invert-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/invert-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0958. 二叉树的完全性检验](https://leetcode.cn/problems/check-completeness-of-a-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/check-completeness-of-a-binary-tree.md) | 树、广度优先搜索、二叉树 | 中等 | +| [0572. 另一棵树的子树](https://leetcode.cn/problems/subtree-of-another-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/subtree-of-another-tree.md) | 树、深度优先搜索、二叉树、字符串匹配、哈希函数 | 简单 | +| [0100. 相同的树](https://leetcode.cn/problems/same-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/same-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0297. 二叉树的序列化与反序列化](https://leetcode.cn/problems/serialize-and-deserialize-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/serialize-and-deserialize-binary-tree.md) | 树、深度优先搜索、广度优先搜索、设计、字符串、二叉树 | 困难 | +| [0114. 二叉树展开为链表](https://leetcode.cn/problems/flatten-binary-tree-to-linked-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/flatten-binary-tree-to-linked-list.md) | 栈、树、深度优先搜索、链表、二叉树 | 中等 | + + +### 二叉树的还原题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0105. 从前序与中序遍历序列构造二叉树](https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/construct-binary-tree-from-preorder-and-inorder-traversal.md) | 树、数组、哈希表、分治、二叉树 | 中等 | +| [0106. 从中序与后序遍历序列构造二叉树](https://leetcode.cn/problems/construct-binary-tree-from-inorder-and-postorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/construct-binary-tree-from-inorder-and-postorder-traversal.md) | 树、数组、哈希表、分治、二叉树 | 中等 | + + +### 二叉搜索树题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0098. 验证二叉搜索树](https://leetcode.cn/problems/validate-binary-search-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/validate-binary-search-tree.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | +| [0450. 删除二叉搜索树中的节点](https://leetcode.cn/problems/delete-node-in-a-bst/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/delete-node-in-a-bst.md) | 树、二叉搜索树、二叉树 | 中等 | +| [LCR 174. 寻找二叉搜索树中的目标节点](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 简单 | +| [0230. 二叉搜索树中第 K 小的元素](https://leetcode.cn/problems/kth-smallest-element-in-a-bst/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/kth-smallest-element-in-a-bst.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 中等 | +| [0426. 将二叉搜索树转化为排序的双向链表](https://leetcode.cn/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/convert-binary-search-tree-to-sorted-doubly-linked-list.md) | 栈、树、深度优先搜索、二叉搜索树、链表、二叉树、双向链表 | 中等 | +| [0110. 平衡二叉树](https://leetcode.cn/problems/balanced-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/balanced-binary-tree.md) | 树、深度优先搜索、二叉树 | 简单 | + + +### 并查集题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0128. 最长连续序列](https://leetcode.cn/problems/longest-consecutive-sequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/longest-consecutive-sequence.md) | 并查集、数组、哈希表 | 中等 | + + +## 第 6 章 图论 + +### 深度优先搜索题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0200. 岛屿数量](https://leetcode.cn/problems/number-of-islands/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/number-of-islands.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | +| [0695. 岛屿的最大面积](https://leetcode.cn/problems/max-area-of-island/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/max-area-of-island.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | +| [0144. 二叉树的前序遍历](https://leetcode.cn/problems/binary-tree-preorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-preorder-traversal.md) | 栈、树、深度优先搜索、二叉树 | 简单 | +| [0094. 二叉树的中序遍历](https://leetcode.cn/problems/binary-tree-inorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/binary-tree-inorder-traversal.md) | 栈、树、深度优先搜索、二叉树 | 简单 | +| [0145. 二叉树的后序遍历](https://leetcode.cn/problems/binary-tree-postorder-traversal/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-postorder-traversal.md) | 栈、树、深度优先搜索、二叉树 | 简单 | +| [0129. 求根节点到叶节点数字之和](https://leetcode.cn/problems/sum-root-to-leaf-numbers/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/sum-root-to-leaf-numbers.md) | 树、深度优先搜索、二叉树 | 中等 | +| [0124. 二叉树中的最大路径和](https://leetcode.cn/problems/binary-tree-maximum-path-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-maximum-path-sum.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | +| [0199. 二叉树的右视图](https://leetcode.cn/problems/binary-tree-right-side-view/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-right-side-view.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | +| [0543. 二叉树的直径](https://leetcode.cn/problems/diameter-of-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/diameter-of-binary-tree.md) | 树、深度优先搜索、二叉树 | 简单 | +| [0662. 二叉树最大宽度](https://leetcode.cn/problems/maximum-width-of-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/maximum-width-of-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | +| [0958. 二叉树的完全性检验](https://leetcode.cn/problems/check-completeness-of-a-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/check-completeness-of-a-binary-tree.md) | 树、广度优先搜索、二叉树 | 中等 | +| [0572. 另一棵树的子树](https://leetcode.cn/problems/subtree-of-another-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/subtree-of-another-tree.md) | 树、深度优先搜索、二叉树、字符串匹配、哈希函数 | 简单 | +| [0100. 相同的树](https://leetcode.cn/problems/same-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/same-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0111. 二叉树的最小深度](https://leetcode.cn/problems/minimum-depth-of-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/minimum-depth-of-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | + + +### 广度优先搜索题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0200. 岛屿数量](https://leetcode.cn/problems/number-of-islands/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/number-of-islands.md) | 深度优先搜索、广度优先搜索、并查集、数组、矩阵 | 中等 | +| [0322. 零钱兑换](https://leetcode.cn/problems/coin-change/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/coin-change.md) | 广度优先搜索、数组、动态规划 | 中等 | +| [0207. 课程表](https://leetcode.cn/problems/course-schedule/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/course-schedule.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | +| [0199. 二叉树的右视图](https://leetcode.cn/problems/binary-tree-right-side-view/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-right-side-view.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | +| [0662. 二叉树最大宽度](https://leetcode.cn/problems/maximum-width-of-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/maximum-width-of-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 中等 | +| [0958. 二叉树的完全性检验](https://leetcode.cn/problems/check-completeness-of-a-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/check-completeness-of-a-binary-tree.md) | 树、广度优先搜索、二叉树 | 中等 | +| [0572. 另一棵树的子树](https://leetcode.cn/problems/subtree-of-another-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/subtree-of-another-tree.md) | 树、深度优先搜索、二叉树、字符串匹配、哈希函数 | 简单 | +| [0100. 相同的树](https://leetcode.cn/problems/same-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/same-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0111. 二叉树的最小深度](https://leetcode.cn/problems/minimum-depth-of-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/minimum-depth-of-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [LCR 151. 彩灯装饰记录 III](https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof.md) | 树、广度优先搜索、二叉树 | 中等 | + + +### 图的拓扑排序题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0210. 课程表 II](https://leetcode.cn/problems/course-schedule-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/course-schedule-ii.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 | + + +## 第 7 章 基础算法 + +### 枚举算法题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0001. 两数之和](https://leetcode.cn/problems/two-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/two-sum.md) | 数组、哈希表 | 简单 | +| [0078. 子集](https://leetcode.cn/problems/subsets/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/subsets.md) | 位运算、数组、回溯 | 中等 | +| [0221. 最大正方形](https://leetcode.cn/problems/maximal-square/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/maximal-square.md) | 数组、动态规划、矩阵 | 中等 | +| [0560. 和为 K 的子数组](https://leetcode.cn/problems/subarray-sum-equals-k/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/subarray-sum-equals-k.md) | 数组、哈希表、前缀和 | 中等 | + + +### 递归算法题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0024. 两两交换链表中的节点](https://leetcode.cn/problems/swap-nodes-in-pairs/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/swap-nodes-in-pairs.md) | 递归、链表 | 中等 | +| [0206. 反转链表](https://leetcode.cn/problems/reverse-linked-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/reverse-linked-list.md) | 递归、链表 | 简单 | +| [0092. 反转链表 II](https://leetcode.cn/problems/reverse-linked-list-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/reverse-linked-list-ii.md) | 链表 | 中等 | +| [0021. 合并两个有序链表](https://leetcode.cn/problems/merge-two-sorted-lists/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-two-sorted-lists.md) | 递归、链表 | 简单 | +| [0509. 斐波那契数](https://leetcode.cn/problems/fibonacci-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/fibonacci-number.md) | 递归、记忆化搜索、数学、动态规划 | 简单 | +| [0070. 爬楼梯](https://leetcode.cn/problems/climbing-stairs/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/climbing-stairs.md) | 记忆化搜索、数学、动态规划 | 简单 | +| [0104. 二叉树的最大深度](https://leetcode.cn/problems/maximum-depth-of-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/maximum-depth-of-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [0124. 二叉树中的最大路径和](https://leetcode.cn/problems/binary-tree-maximum-path-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-maximum-path-sum.md) | 树、深度优先搜索、动态规划、二叉树 | 困难 | +| [0226. 翻转二叉树](https://leetcode.cn/problems/invert-binary-tree/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/invert-binary-tree.md) | 树、深度优先搜索、广度优先搜索、二叉树 | 简单 | +| [LCR 187. 破冰游戏](https://leetcode.cn/problems/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof.md) | 递归、数学 | 简单 | + + +### 分治算法题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0004. 寻找两个正序数组的中位数](https://leetcode.cn/problems/median-of-two-sorted-arrays/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/median-of-two-sorted-arrays.md) | 数组、二分查找、分治 | 困难 | +| [0023. 合并 K 个升序链表](https://leetcode.cn/problems/merge-k-sorted-lists/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-k-sorted-lists.md) | 链表、分治、堆（优先队列）、归并排序 | 困难 | +| [0053. 最大子数组和](https://leetcode.cn/problems/maximum-subarray/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/maximum-subarray.md) | 数组、分治、动态规划 | 中等 | +| [0169. 多数元素](https://leetcode.cn/problems/majority-element/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/majority-element.md) | 数组、哈希表、分治、计数、排序 | 简单 | +| [0014. 最长公共前缀](https://leetcode.cn/problems/longest-common-prefix/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-common-prefix.md) | 字典树、数组、字符串 | 简单 | +| [LCR 152. 验证二叉搜索树的后序遍历序列](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof.md) | 栈、树、二叉搜索树、递归、数组、二叉树、单调栈 | 中等 | + + +### 回溯算法题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0046. 全排列](https://leetcode.cn/problems/permutations/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/permutations.md) | 数组、回溯 | 中等 | +| [0047. 全排列 II](https://leetcode.cn/problems/permutations-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/permutations-ii.md) | 数组、回溯、排序 | 中等 | +| [0037. 解数独](https://leetcode.cn/problems/sudoku-solver/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/sudoku-solver.md) | 数组、哈希表、回溯、矩阵 | 困难 | +| [0022. 括号生成](https://leetcode.cn/problems/generate-parentheses/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/generate-parentheses.md) | 字符串、动态规划、回溯 | 中等 | +| [0078. 子集](https://leetcode.cn/problems/subsets/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/subsets.md) | 位运算、数组、回溯 | 中等 | +| [0039. 组合总和](https://leetcode.cn/problems/combination-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/combination-sum.md) | 数组、回溯 | 中等 | +| [0040. 组合总和 II](https://leetcode.cn/problems/combination-sum-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/combination-sum-ii.md) | 数组、回溯 | 中等 | +| [0093. 复原 IP 地址](https://leetcode.cn/problems/restore-ip-addresses/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/restore-ip-addresses.md) | 字符串、回溯 | 中等 | +| [0079. 单词搜索](https://leetcode.cn/problems/word-search/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/word-search.md) | 深度优先搜索、数组、字符串、回溯、矩阵 | 中等 | +| [0679. 24 点游戏](https://leetcode.cn/problems/24-game/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/24-game.md) | 数组、数学、回溯 | 困难 | + + +### 贪心算法题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0053. 最大子数组和](https://leetcode.cn/problems/maximum-subarray/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/maximum-subarray.md) | 数组、分治、动态规划 | 中等 | +| [0056. 合并区间](https://leetcode.cn/problems/merge-intervals/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-intervals.md) | 数组、排序 | 中等 | +| [0122. 买卖股票的最佳时机 II](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/best-time-to-buy-and-sell-stock-ii.md) | 贪心、数组、动态规划 | 中等 | +| [0055. 跳跃游戏](https://leetcode.cn/problems/jump-game/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/jump-game.md) | 贪心、数组、动态规划 | 中等 | +| [0402. 移掉 K 位数字](https://leetcode.cn/problems/remove-k-digits/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/remove-k-digits.md) | 栈、贪心、字符串、单调栈 | 中等 | +| [0135. 分发糖果](https://leetcode.cn/problems/candy/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/candy.md) | 贪心、数组 | 困难 | +| [0134. 加油站](https://leetcode.cn/problems/gas-station/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/gas-station.md) | 贪心、数组 | 中等 | +| [0670. 最大交换](https://leetcode.cn/problems/maximum-swap/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/maximum-swap.md) | 贪心、数学 | 中等 | + + +### 位运算题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0136. 只出现一次的数字](https://leetcode.cn/problems/single-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/single-number.md) | 位运算、数组 | 简单 | +| [0191. 位1的个数](https://leetcode.cn/problems/number-of-1-bits/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/number-of-1-bits.md) | 位运算、分治 | 简单 | +| [0268. 丢失的数字](https://leetcode.cn/problems/missing-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/missing-number.md) | 位运算、数组、哈希表、数学、二分查找、排序 | 简单 | + + +## 第 8 章 动态规划 + +### 动态规划题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0070. 爬楼梯](https://leetcode.cn/problems/climbing-stairs/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/climbing-stairs.md) | 记忆化搜索、数学、动态规划 | 简单 | +| [0509. 斐波那契数](https://leetcode.cn/problems/fibonacci-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/fibonacci-number.md) | 递归、记忆化搜索、数学、动态规划 | 简单 | +| [0121. 买卖股票的最佳时机](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/best-time-to-buy-and-sell-stock.md) | 数组、动态规划 | 简单 | +| [0322. 零钱兑换](https://leetcode.cn/problems/coin-change/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/coin-change.md) | 广度优先搜索、数组、动态规划 | 中等 | +| [0518. 零钱兑换 II](https://leetcode.cn/problems/coin-change-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/coin-change-ii.md) | 数组、动态规划 | 中等 | +| [0300. 最长递增子序列](https://leetcode.cn/problems/longest-increasing-subsequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/longest-increasing-subsequence.md) | 数组、二分查找、动态规划 | 中等 | +| [1143. 最长公共子序列](https://leetcode.cn/problems/longest-common-subsequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/longest-common-subsequence.md) | 字符串、动态规划 | 中等 | +| [0718. 最长重复子数组](https://leetcode.cn/problems/maximum-length-of-repeated-subarray/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/maximum-length-of-repeated-subarray.md) | 数组、二分查找、动态规划、滑动窗口、哈希函数、滚动哈希 | 中等 | +| [0064. 最小路径和](https://leetcode.cn/problems/minimum-path-sum/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/minimum-path-sum.md) | 数组、动态规划、矩阵 | 中等 | +| [0072. 编辑距离](https://leetcode.cn/problems/edit-distance/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/edit-distance.md) | 字符串、动态规划 | 中等 | +| [0032. 最长有效括号](https://leetcode.cn/problems/longest-valid-parentheses/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-valid-parentheses.md) | 栈、字符串、动态规划 | 困难 | +| [0221. 最大正方形](https://leetcode.cn/problems/maximal-square/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/maximal-square.md) | 数组、动态规划、矩阵 | 中等 | +| [0062. 不同路径](https://leetcode.cn/problems/unique-paths/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/unique-paths.md) | 数学、动态规划、组合数学 | 中等 | +| [0063. 不同路径 II](https://leetcode.cn/problems/unique-paths-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/unique-paths-ii.md) | 数组、动态规划、矩阵 | 中等 | +| [0152. 乘积最大子数组](https://leetcode.cn/problems/maximum-product-subarray/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/maximum-product-subarray.md) | 数组、动态规划 | 中等 | +| [0198. 打家劫舍](https://leetcode.cn/problems/house-robber/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/house-robber.md) | 数组、动态规划 | 中等 | +| [0213. 打家劫舍 II](https://leetcode.cn/problems/house-robber-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/house-robber-ii.md) | 数组、动态规划 | 中等 | +| [0091. 解码方法](https://leetcode.cn/problems/decode-ways/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/decode-ways.md) | 字符串、动态规划 | 中等 | +| [0010. 正则表达式匹配](https://leetcode.cn/problems/regular-expression-matching/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/regular-expression-matching.md) | 递归、字符串、动态规划 | 困难 | +| [0678. 有效的括号字符串](https://leetcode.cn/problems/valid-parenthesis-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/valid-parenthesis-string.md) | 栈、贪心、字符串、动态规划 | 中等 | +| [0045. 跳跃游戏 II](https://leetcode.cn/problems/jump-game-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/jump-game-ii.md) | 贪心、数组、动态规划 | 中等 | +| [0673. 最长递增子序列的个数](https://leetcode.cn/problems/number-of-longest-increasing-subsequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/number-of-longest-increasing-subsequence.md) | 树状数组、线段树、数组、动态规划 | 中等 | +| [0139. 单词拆分](https://leetcode.cn/problems/word-break/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/word-break.md) | 字典树、记忆化搜索、数组、哈希表、字符串、动态规划 | 中等 | +| [0044. 通配符匹配](https://leetcode.cn/problems/wildcard-matching/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/wildcard-matching.md) | 贪心、递归、字符串、动态规划 | 困难 | +| [0120. 三角形最小路径和](https://leetcode.cn/problems/triangle/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/triangle.md) | 数组、动态规划 | 中等 | +| [0096. 不同的二叉搜索树](https://leetcode.cn/problems/unique-binary-search-trees/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/unique-binary-search-trees.md) | 树、二叉搜索树、数学、动态规划、二叉树 | 中等 | +| [0887. 鸡蛋掉落](https://leetcode.cn/problems/super-egg-drop/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/super-egg-drop.md) | 数学、二分查找、动态规划 | 困难 | +| [0097. 交错字符串](https://leetcode.cn/problems/interleaving-string/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/interleaving-string.md) | 字符串、动态规划 | 中等 | +| [0516. 最长回文子序列](https://leetcode.cn/problems/longest-palindromic-subsequence/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/longest-palindromic-subsequence.md) | 字符串、动态规划 | 中等 | + + +### 记忆化搜索题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0329. 矩阵中的最长递增路径](https://leetcode.cn/problems/longest-increasing-path-in-a-matrix/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/longest-increasing-path-in-a-matrix.md) | 深度优先搜索、广度优先搜索、图、拓扑排序、记忆化搜索、数组、动态规划、矩阵 | 困难 | + + +## 补充题目 + +#### 设计数据结构题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0146. LRU 缓存](https://leetcode.cn/problems/lru-cache/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/lru-cache.md) | 设计、哈希表、链表、双向链表 | 中等 | +| [0460. LFU 缓存](https://leetcode.cn/problems/lfu-cache/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/lfu-cache.md) | 设计、哈希表、链表、双向链表 | 困难 | + + +#### 数学题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0007. 整数反转](https://leetcode.cn/problems/reverse-integer/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/reverse-integer.md) | 数学 | 中等 | +| [0009. 回文数](https://leetcode.cn/problems/palindrome-number/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/palindrome-number.md) | 数学 | 简单 | +| [LCR 187. 破冰游戏](https://leetcode.cn/problems/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof.md) | 递归、数学 | 简单 | +| [0168. Excel 表列名称](https://leetcode.cn/problems/excel-sheet-column-title/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/excel-sheet-column-title.md) | 数学、字符串 | 简单 | +| [0400. 第 N 位数字](https://leetcode.cn/problems/nth-digit/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/nth-digit.md) | 数学、二分查找 | 中等 | + + +#### 模拟题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0008. 字符串转换整数 (atoi)](https://leetcode.cn/problems/string-to-integer-atoi/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/string-to-integer-atoi.md) | 字符串 | 中等 | +| [0165. 比较版本号](https://leetcode.cn/problems/compare-version-numbers/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/compare-version-numbers.md) | 双指针、字符串 | 中等 | +| [0468. 验证IP地址](https://leetcode.cn/problems/validate-ip-address/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/validate-ip-address.md) | 字符串 | 中等 | +| [0086. 分隔链表](https://leetcode.cn/problems/partition-list/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/partition-list.md) | 链表、双指针 | 中等 | + + +#### 前缀和 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0560. 和为 K 的子数组](https://leetcode.cn/problems/subarray-sum-equals-k/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/subarray-sum-equals-k.md) | 数组、哈希表、前缀和 | 中等 | + + +#### 思维锻炼题目 + +| 标题 | 题解 | 标签 | 难度 | +| :--- | :--- | :--- | :--- | +| [0031. 下一个排列](https://leetcode.cn/problems/next-permutation/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/next-permutation.md) | 数组、双指针 | 中等 | +| [0556. 下一个更大元素 III](https://leetcode.cn/problems/next-greater-element-iii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/next-greater-element-iii.md) | 数学、双指针、字符串 | 中等 | +| [0470. 用 Rand7() 实现 Rand10()](https://leetcode.cn/problems/implement-rand10-using-rand7/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/implement-rand10-using-rand7.md) | 数学、拒绝采样、概率与统计、随机化 | 中等 | + + + +## 参考资料 + +- 【清单】[CodeTop 企业题库](https://codetop.cc/home) diff --git a/docs/00_preface/index.md b/docs/00_preface/index.md new file mode 100644 index 00000000..e640b2da --- /dev/null +++ b/docs/00_preface/index.md @@ -0,0 +1,10 @@ +# 本章内容 + +- [0.1 前言](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_01_preface.md) +- [0.2 算法与数据结构](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_02_data_structures_algorithms.md) +- [0.3 算法复杂度](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_03_algorithm_complexity.md) +- [0.4 LeetCode 入门与攻略](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_04_leetcode_guide.md) +- [0.5 LeetCode 题解（字典序排序，850+ 道题解）](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_05_solutions_list.md) +- [0.6 LeetCode 题解（按分类排序，推荐刷题列表 ★★★）](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md) +- [0.7 LeetCode 面试最常考 100 题（按分类排序）](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_07_interview_100_list.md) +- [0.8 LeetCode 面试最常考 200 题（按分类排序）](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_08_interview_200_list.md) \ No newline at end of file diff --git a/Contents/01.Array/01.Array-Basic/01.Array-Basic.md b/docs/01_array/01_01_array_basic.md similarity index 88% rename from Contents/01.Array/01.Array-Basic/01.Array-Basic.md rename to docs/01_array/01_01_array_basic.md index 74451466..2ab3d233 100644 --- a/Contents/01.Array/01.Array-Basic/01.Array-Basic.md +++ b/docs/01_array/01_01_array_basic.md @@ -226,11 +226,24 @@ print(arr) 到这里，有关数组的基础知识就介绍完了。下面进行一下总结。 -## 3. 数组的基础知识总结 +## 3. 总结 -数组是最基础、最简单的数据结构。数组是实现线性表的顺序结构存储的基础。它使用一组连续的内存空间，来存储一组具有相同类型的数据。 +数组是一种简单的数据结构。它使用连续的内存空间存储相同类型的数据。数组的最大特点的支持随机访问，可以根据下标快速访问元素。 -数组的最大特点的支持随机访问。访问数组元素、改变数组元素的时间复杂度为 $O(1)$，在数组尾部插入、删除元素的时间复杂度也是 $O(1)$，普通情况下插入、删除元素的时间复杂度为 $O(n)$。 +访问数组元素、修改元素的时间复杂度是 $O(1)$。在数组尾部插入、删除元素的时间复杂度也是 $O(1)$。在数组中间插入、删除元素的时间复杂度是 $O(n)$。 + +不同编程语言中数组的实现可能不同。C/C++ 的数组严格使用连续内存，Java 和 Python 的数组灵活性更高。 + +## 4. 练习题目 + +- [0066. 加一](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/plus-one.md) +- [0724. 寻找数组的中心下标](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/find-pivot-index.md) +- [0189. 轮转数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/rotate-array.md) +- [0048. 旋转图像](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/rotate-image.md) +- [0054. 螺旋矩阵](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/spiral-matrix.md) +- [0498. 对角线遍历](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/diagonal-traverse.md) + +- [数组基础题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%95%B0%E7%BB%84%E5%9F%BA%E7%A1%80%E9%A2%98%E7%9B%AE) ## 参考资料 diff --git a/docs/01_array/01_02_array_sort.md b/docs/01_array/01_02_array_sort.md new file mode 100644 index 00000000..e24125b8 --- /dev/null +++ b/docs/01_array/01_02_array_sort.md @@ -0,0 +1,54 @@ +# 1.2 数组排序 + +数组排序是计算机科学中最基本的问题之一。排序算法有很多种，每种算法都有其特点和适用场景。 + +## 1. 排序算法的分类 + +排序算法可以按照不同的标准进行分类： + +1. 按照时间复杂度分类： + - 简单排序算法：时间复杂度为 $O(n^2)$，如冒泡排序、选择排序、插入排序 + - 高级排序算法：时间复杂度为 $O(n \log n)$，如快速排序、归并排序、堆排序 + - 线性排序算法：时间复杂度为 $O(n)$，如计数排序、桶排序、基数排序 + +2. 按照空间复杂度分类： + - 原地排序算法：空间复杂度为 $O(1)$，如冒泡排序、选择排序、插入排序、快速排序、堆排序 + - 非原地排序算法：空间复杂度为 $O(n)$，如归并排序、计数排序、桶排序、基数排序 + +3. 按照稳定性分类： + - 稳定排序算法：相等元素的相对顺序在排序后保持不变，如冒泡排序、插入排序、归并排序、计数排序、桶排序、基数排序 + - 不稳定排序算法：相等元素的相对顺序在排序后可能改变，如选择排序、快速排序、堆排序 + +## 2. 排序算法的评价指标 + +评价一个排序算法的好坏，主要从以下几个方面考虑： + +1. 时间复杂度：算法执行所需的时间 +2. 空间复杂度：算法执行所需的额外空间 +3. 稳定性：相等元素的相对顺序是否保持不变 +4. 原地性：是否需要在原数组之外开辟额外空间 +5. 自适应性：算法是否能够利用输入数据的特性来提高效率 + +## 3. 常见排序算法 + +常见的排序算法包括： + +1. 冒泡排序：通过相邻元素比较和交换，将最大元素逐步"冒泡"到数组末尾 +2. 选择排序：每次从未排序区间选择最小元素，放到已排序区间末尾 +3. 插入排序：将未排序区间的元素插入到已排序区间的合适位置 +4. 快速排序：选择一个基准元素，将数组分为两部分，递归排序 +5. 归并排序：将数组分成两半，分别排序后合并 +6. 堆排序：利用堆这种数据结构进行排序 +7. 计数排序：统计每个元素出现的次数，按顺序输出 +8. 桶排序：将元素分到有限数量的桶中，对每个桶单独排序 +9. 基数排序：按照元素的位数进行排序 + +## 4. 排序算法的选择 + +在实际应用中，选择合适的排序算法需要考虑以下因素： + +1. 数据规模：小规模数据可以使用简单排序算法，大规模数据需要使用高级排序算法 +2. 数据特征：如果数据基本有序，插入排序效率较高；如果数据分布均匀，快速排序效率较高 +3. 空间限制：如果空间有限，应该选择原地排序算法 +4. 稳定性要求：如果需要保持相等元素的相对顺序，应该选择稳定排序算法 +5. 硬件环境：不同的硬件环境可能适合不同的排序算法 diff --git a/Contents/01.Array/02.Array-Sort/01.Array-Bubble-Sort.md b/docs/01_array/01_03_array_bubble_sort.md similarity index 82% rename from Contents/01.Array/02.Array-Sort/01.Array-Bubble-Sort.md rename to docs/01_array/01_03_array_bubble_sort.md index e1dd3bc9..d1153069 100644 --- a/Contents/01.Array/02.Array-Sort/01.Array-Bubble-Sort.md +++ b/docs/01_array/01_03_array_bubble_sort.md @@ -97,6 +97,23 @@ class Solution: - **冒泡排序适用情况**：冒泡排序方法在排序过程中需要移动较多次数的元素，并且排序时间效率比较低。因此，冒泡排序方法比较适合于参加排序序列的数据量较小的情况，尤其是当序列的初始状态为基本有序的情况。 - **排序稳定性**：由于元素交换是在相邻元素之间进行的，不会改变相等元素的相对顺序，因此，冒泡排序法是一种 **稳定排序算法**。 +## 5. 总结 + +冒泡排序是一种简单的排序算法。它通过多次比较相邻元素并交换位置，将较大的元素逐步移动到数组末尾。 + +冒泡排序的时间复杂度取决于数据情况。最好情况下是 $O(n)$，最坏情况下是 $O(n^2)$。它只需要常数级别的额外空间，空间复杂度是 $O(1)$。 + +冒泡排序适合数据量小的场景。当数据基本有序时，它的效率较高。由于交换只在相邻元素间进行，冒泡排序是稳定的排序算法。 + +冒泡排序容易实现，但效率较低。在实际应用中，通常选择更高效的排序算法处理大规模数据。 + +## 练习题目 + +- [0912. 排序数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md)（冒泡排序会超时，仅作练习） +- [0283. 移动零](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/move-zeroes.md)（冒泡排序会超时，仅作练习） + +- [排序算法题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【文章】[11.3. 冒泡排序 - Hello 算法](https://www.hello-algo.com/chapter_sorting/bubble_sort/) \ No newline at end of file diff --git a/Contents/01.Array/02.Array-Sort/02.Array-Selection-Sort.md b/docs/01_array/01_04_array_selection_sort.md similarity index 80% rename from Contents/01.Array/02.Array-Sort/02.Array-Selection-Sort.md rename to docs/01_array/01_04_array_selection_sort.md index 6d7ba879..b3e48d63 100644 --- a/Contents/01.Array/02.Array-Sort/02.Array-Selection-Sort.md +++ b/docs/01_array/01_04_array_selection_sort.md @@ -84,5 +84,16 @@ class Solution: - **排序稳定性**：由于值最小元素与未排序区间第 $1$ 个元素的交换动作是在不相邻的元素之间进行的，因此很有可能会改变相等元素的相对顺序，因此，选择排序法是一种 **不稳定排序算法**。 +## 5. 总结 +选择排序是一种简单的排序算法。它的工作原理是将数组分成已排序和未排序两部分。每次从未排序部分找到最小的元素，放到已排序部分的末尾。这个过程重复进行，直到所有元素排序完成。 +选择排序的时间复杂度是 $O(n^2)$，因为它需要进行 $ \frac{n(n−1)}{2}$ 次比较。空间复杂度是 $O(1)$，因为它只需要常数级的额外空间。选择排序是不稳定的排序算法，因为在交换过程中可能改变相等元素的相对顺序。 + +选择排序适合小规模数据的排序。它的优点是实现简单，不需要额外空间。缺点是效率较低，不适合大规模数据。 + +## 练习题目 + +- [0912. 排序数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md)（选择排序会超时，仅作练习） + +- [排序算法题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/Contents/01.Array/02.Array-Sort/03.Array-Insertion-Sort.md b/docs/01_array/01_05_array_insertion_sort.md similarity index 71% rename from Contents/01.Array/02.Array-Sort/03.Array-Insertion-Sort.md rename to docs/01_array/01_05_array_insertion_sort.md index 1506e567..8ab06c9b 100644 --- a/Contents/01.Array/02.Array-Sort/03.Array-Insertion-Sort.md +++ b/docs/01_array/01_05_array_insertion_sort.md @@ -14,13 +14,13 @@ 1. 初始状态下，有序区间为 $[0, 0]$，无序区间为 $[1, n - 1]$。 2. 第 $1$ 趟插入： 1. 取出无序区间 $[1, n - 1]$ 中的第 $1$ 个元素，即 $nums[1]$。 - 2. 从右到左遍历有序区间中的元素，将比 $nums[1]$ 小的元素向后移动 $1$ 位。 - 3. 如果遇到大于或等于 $nums[1]$ 的元素时，说明找到了插入位置，将 $nums[1]$ 插入到该位置。 + 2. 从右到左遍历有序区间中的元素，将比 $nums[1]$ 大的元素向后移动 $1$ 位。 + 3. 如果遇到小于或等于 $nums[1]$ 的元素时，说明找到了插入位置，将 $nums[1]$ 插入到该位置。 4. 插入元素后有序区间变为 $[0, 1]$，无序区间变为 $[2, n - 1]$。 3. 第 $2$ 趟插入： 1. 取出无序区间 $[2, n - 1]$ 中的第 $1$ 个元素，即 $nums[2]$。 - 2. 从右到左遍历有序区间中的元素，将比 $nums[2]$ 小的元素向后移动 $1$ 位。 - 3. 如果遇到大于或等于 $nums[2]$ 的元素时，说明找到了插入位置，将 $nums[2]$ 插入到该位置。 + 2. 从右到左遍历有序区间中的元素，将比 $nums[2]$ 大的元素向后移动 $1$ 位。 + 3. 如果遇到小于或等于 $nums[2]$ 的元素时，说明找到了插入位置，将 $nums[2]$ 插入到该位置。 4. 插入元素后有序区间变为 $[0, 2]$，无序区间变为 $[3, n - 1]$。 4. 依次类推，对剩余无序区间中的元素重复上述插入过程，直到所有元素都插入到有序区间中，排序结束。 @@ -57,4 +57,18 @@ class Solution: - **最差时间复杂度**：$O(n^2)$。最差的情况下（初始时区间已经是降序排列），每个元素 $nums[i]$ 都要进行 $i - 1$ 次元素之间的比较，元素之间总的比较次数达到最大值，为 $∑^n_{i=2}(i − 1) = \frac{n(n−1)}{2}$。 - **平均时间复杂度**：$O(n^2)$。如果区间的初始情况是随机的，即参加排序的区间中元素可能出现的各种排列的概率相同，则可取上述最小值和最大值的平均值作为插入排序时所进行的元素之间的比较次数，约为 $\frac{n^2}{4}$。由此得知，插入排序算法的平均时间复杂度为 $O(n^2)$。 - **空间复杂度**：$O(1)$。插入排序算法为原地排序算法，只用到指针变量 $i$、$j$ 以及表示无序区间中第 $1$ 个元素的变量等常数项的变量。 -- **排序稳定性**：在插入操作过程中，每次都讲元素插入到相等元素的右侧，并不会改变相等元素的相对顺序。因此，插入排序方法是一种 **稳定排序算法**。 \ No newline at end of file +- **排序稳定性**：在插入操作过程中，每次都讲元素插入到相等元素的右侧，并不会改变相等元素的相对顺序。因此，插入排序方法是一种 **稳定排序算法**。 + +## 5. 总结 + +插入排序是一种简单直观的排序算法。它的工作原理是将数组分为有序区间和无序区间，每次从无序区间取出一个元素，插入到有序区间的正确位置。这个过程重复进行，直到所有元素都排好序。 + +插入排序的时间复杂度取决于数据的初始顺序。最好的情况是数组已经有序，时间复杂度为 $O(n)$。最坏的情况是数组完全逆序，时间复杂度为 $O(n^2)$。平均时间复杂度也是 $O(n^2)$。空间复杂度是 $O(1)$，因为排序是在原地进行的。 + +插入排序是稳定的排序算法，因为它不会改变相等元素的相对顺序。这个算法适合小规模数据或基本有序的数据排序。对于大规模数据，插入排序的效率不如快速排序等更高级的算法。 + +## 练习题目 + +- [0912. 排序数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md)（插入排序会超时，仅作练习） + +- [排序算法题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/Contents/01.Array/02.Array-Sort/04.Array-Shell-Sort.md b/docs/01_array/01_06_array_shell_sort.md similarity index 78% rename from Contents/01.Array/02.Array-Sort/04.Array-Shell-Sort.md rename to docs/01_array/01_06_array_shell_sort.md index a203d1d7..866ba1c4 100644 --- a/Contents/01.Array/02.Array-Sort/04.Array-Shell-Sort.md +++ b/docs/01_array/01_06_array_shell_sort.md @@ -86,4 +86,19 @@ class Solution: - 从算法中也可以看到，外层 `while gap > 0` 的循环次数为 $\log n$ 数量级，内层插入排序算法循环次数为 $n$ 数量级。当子数组分得越多时，子数组内的元素就越少，内层循环的次数也就越少；反之，当所分的子数组个数减少时，子数组内的元素也随之增多，但整个数组也逐步接近有序，而循环次数却不会随之增加。因此，希尔排序算法的时间复杂度在 $O(n \times \log^2 n)$ 与 $O(n^2)$ 之间。 - **空间复杂度**：$O(1)$。希尔排序中用到的插入排序算法为原地排序算法，只用到指针变量 $i$、$j$ 以及表示无序区间中第 $1$ 个元素的变量、间隔数 $gap$ 等常数项的变量。 -- **排序稳定性**：在一次插入排序是稳定的，不会改变相等元素的相对顺序，但是在不同的插入排序中，相等元素可能在各自的插入排序中移动。因此，希尔排序方法是一种 **不稳定排序算法**。 \ No newline at end of file +- **排序稳定性**：在一次插入排序是稳定的，不会改变相等元素的相对顺序，但是在不同的插入排序中，相等元素可能在各自的插入排序中移动。因此，希尔排序方法是一种 **不稳定排序算法**。 + +## 5. 总结 + +希尔排序是插入排序的改进版本。它通过将数组分成多个子数组进行排序，逐步缩小间隔，最终对整个数组进行一次插入排序。这种方法减少了数据移动的次数，提高了排序效率。 + +希尔排序的时间复杂度取决于间隔序列的选择。使用常见的间隔序列时，时间复杂度在 $O(n \log n)$ 到 $O(n^2)$ 之间。空间复杂度是 $O(1)$，因为排序是在原地进行的。 + +希尔排序是不稳定的排序算法，因为在不同的子数组排序过程中，相等元素的相对顺序可能改变。希尔排序适合中等规模的数据排序，比简单插入排序更快，但比快速排序等高级算法稍慢。 + +## 练习题目 + +- [0912. 排序数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md) +- [0506. 相对名次](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/relative-ranks.md) + +- [排序算法题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/Contents/01.Array/02.Array-Sort/05.Array-Merge-Sort.md b/docs/01_array/01_07_array_merge_sort.md similarity index 75% rename from Contents/01.Array/02.Array-Sort/05.Array-Merge-Sort.md rename to docs/01_array/01_07_array_merge_sort.md index 6b9e7981..9fce7622 100644 --- a/Contents/01.Array/02.Array-Sort/05.Array-Merge-Sort.md +++ b/docs/01_array/01_07_array_merge_sort.md @@ -73,4 +73,23 @@ class Solution: - **时间复杂度**：$O(n \times \log n)$。归并排序算法的时间复杂度等于归并趟数与每一趟归并的时间复杂度乘积。子算法 `merge(left_nums, right_nums):` 的时间复杂度是 $O(n)$，因此，归并排序算法总的时间复杂度为 $O(n \times \log n)$。 - **空间复杂度**：$O(n)$。归并排序方法需要用到与参加排序的数组同样大小的辅助空间。因此，算法的空间复杂度为 $O(n)$。 -- **排序稳定性**：因为在两个有序子数组的归并过程中，如果两个有序数组中出现相等元素，`merge(left_nums, right_nums):` 算法能够使前一个数组中那个相等元素先被复制，从而确保这两个元素的相对顺序不发生改变。因此，归并排序算法是一种 **稳定排序算法**。 \ No newline at end of file +- **排序稳定性**：因为在两个有序子数组的归并过程中，如果两个有序数组中出现相等元素，`merge(left_nums, right_nums):` 算法能够使前一个数组中那个相等元素先被复制，从而确保这两个元素的相对顺序不发生改变。因此，归并排序算法是一种 **稳定排序算法**。 + +## 5. 总结 + +归并排序采用分治策略，将数组不断拆分为更小的子数组进行排序，再将有序子数组合并成完整的有序数组。这种方法保证了排序的稳定性。 + +归并排序的时间复杂度是 $O(n \log n)$，这是因为它需要 $\log n$ 次分解，每次合并需要 $O(n)$ 时间。空间复杂度是 $O(n)$，因为合并过程需要额外的存储空间。 + +归并排序是稳定的排序算法，在合并过程中相等元素的相对顺序不会改变。它适合处理大规模数据，但需要额外的存储空间是其缺点。归并排序常用于外部排序场景。 + +## 练习题目 + + +- [0912. 排序数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md) +- [0088. 合并两个有序数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-sorted-array.md) +- [LCR 170. 交易逆序对的总数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/shu-zu-zhong-de-ni-xu-dui-lcof.md) +- [0315. 计算右侧小于当前元素的个数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/count-of-smaller-numbers-after-self.md) + + +- [排序算法题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/Contents/01.Array/02.Array-Sort/06.Array-Quick-Sort.md b/docs/01_array/01_08_array_quick_sort.md similarity index 84% rename from Contents/01.Array/02.Array-Sort/06.Array-Quick-Sort.md rename to docs/01_array/01_08_array_quick_sort.md index 061051f2..a701de70 100644 --- a/Contents/01.Array/02.Array-Sort/06.Array-Quick-Sort.md +++ b/docs/01_array/01_08_array_quick_sort.md @@ -134,6 +134,23 @@ class Solution: - **空间复杂度**：$O(n)$。无论快速排序算法递归与否，排序过程中都需要用到堆栈或其他结构的辅助空间来存放当前待排序数组的首、尾位置。最坏的情况下，空间复杂度为 $O(n)$。如果对算法进行一些改写，在一趟排序之后比较被划分所得到的两个子数组的长度，并且首先对长度较短的子数组进行快速排序，这时候需要的空间复杂度可以达到 $O(log_2 n)$。 - **排序稳定性**：在进行哨兵划分时，基准数可能会被交换至相等元素的右侧。因此，快速排序是一种 **不稳定排序算法**。 +## 5. 总结 + +快速排序使用分治策略，通过选取基准数将数组分成两部分，一部分比基准数小，一部分比基准数大。然后对这两部分递归地进行相同操作。 + +快速排序的时间复杂度取决于基准数的选择。最好情况是每次都能平分数组，时间复杂度为 $O(n \log n)$。最坏情况是每次选择的基准数都是极值，时间复杂度为 $O(n^2)$。平均时间复杂度为 $O(n \log n)$。空间复杂度为 $O(n)$，优化后可达 $O(\log n)$。 + +快速排序是不稳定的排序算法，因为在交换过程中可能改变相等元素的相对顺序。它的优势在于平均情况下效率高，适合处理大规模数据。但最坏情况下的性能较差，可以通过随机选择基准数来优化。 + +快速排序在实际应用中很常见，是许多编程语言内置排序函数的实现基础。它的效率通常比其他 $O(n \log n)$ 算法更高，因为它的常数因子较小。 + +## 练习题目 + +- [0912. 排序数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md) +- [0169. 多数元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/majority-element.md) + +- [排序算法题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【文章】[快速排序 - OI Wiki](https://oi-wiki.org/basic/quick-sort/) diff --git a/Contents/01.Array/02.Array-Sort/07.Array-Heap-Sort.md b/docs/01_array/01_09_array_heap_sort.md similarity index 89% rename from Contents/01.Array/02.Array-Sort/07.Array-Heap-Sort.md rename to docs/01_array/01_09_array_heap_sort.md index cea58140..73530b41 100644 --- a/Contents/01.Array/02.Array-Sort/07.Array-Heap-Sort.md +++ b/docs/01_array/01_09_array_heap_sort.md @@ -367,3 +367,21 @@ print(Solution().sortArray([10, 25, 6, 8, 7, 1, 20, 23, 16, 19, 17, 3, 18, 14])) - 因此，堆积排序的时间复杂度为 $O(n \times \log n)$。 - **空间复杂度**：$O(1)$。由于在堆积排序中只需要一个记录大小的辅助空间，因此，堆积排序的空间复杂度为：$O(1)$。 - **排序稳定性**：在进行「下移调整」时，相等元素的相对位置可能会发生变化。因此，堆排序是一种 **不稳定排序算法**。 + +## 5. 总结 + +堆排序利用堆结构进行排序。堆是一种完全二叉树，分为大顶堆和小顶堆。大顶堆中每个节点的值都大于等于其子节点值，小顶堆中每个节点的值都小于等于其子节点值。 + +堆排序分为两个主要步骤：构建初始堆和交换调整堆。首先将数组构建成大顶堆，然后重复取出堆顶元素（最大值）并调整堆结构。每次取出堆顶元素后，将堆末尾元素移到堆顶，再进行下移调整保持堆的性质。 + +堆排序的时间复杂度为 $O(n \log n)$。构建初始堆需要 $O(n)$ 时间，每次调整堆需要 $O(\log n)$ 时间，共进行 $n$ 次调整。空间复杂度为 $O(1)$，因为排序是原地进行的。 + +堆排序是不稳定的排序算法，因为在调整堆的过程中可能改变相等元素的相对顺序。它的优势在于不需要额外空间，适合处理大规模数据。但相比快速排序，堆排序的常数因子较大，实际应用中可能稍慢。 + +## 练习题目 + +- [0912. 排序数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md) +- [0215. 数组中的第K个最大元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/kth-largest-element-in-an-array.md) +- [LCR 159. 库存管理 III](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/zui-xiao-de-kge-shu-lcof.md) + +- [排序算法题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/Contents/01.Array/02.Array-Sort/08.Array-Counting-Sort.md b/docs/01_array/01_10_array_counting_sort.md similarity index 77% rename from Contents/01.Array/02.Array-Sort/08.Array-Counting-Sort.md rename to docs/01_array/01_10_array_counting_sort.md index bc1ef75b..37e8292d 100644 --- a/Contents/01.Array/02.Array-Sort/08.Array-Counting-Sort.md +++ b/docs/01_array/01_10_array_counting_sort.md @@ -60,4 +60,19 @@ class Solution: - **时间复杂度**：$O(n + k)$。其中 $k$ 代表待排序数组的值域。 - **空间复杂度**：$O(k)$。其中 $k$ 代表待排序序列的值域。由于用于计数的数组 $counts$ 的长度取决于待排序数组中数据的范围（大小等于待排序数组最大值减去最小值再加 $1$）。所以计数排序算法对于数据范围很大的数组，需要大量的内存。 - **计数排序适用情况**：计数排序一般用于整数排序，不适用于按字母顺序、人名顺序排序。 -- **排序稳定性**：由于向结果数组中填充元素时使用的是逆序遍历，可以避免改变相等元素之间的相对顺序。因此，计数排序是一种 **稳定排序算法**。 \ No newline at end of file +- **排序稳定性**：由于向结果数组中填充元素时使用的是逆序遍历，可以避免改变相等元素之间的相对顺序。因此，计数排序是一种 **稳定排序算法**。 + +## 5. 总结 + +计数排序通过统计元素出现次数来实现排序。它先找出数组中的最大值和最小值，确定排序范围。然后统计每个元素的出现次数，计算累积次数，最后根据统计信息将元素放到正确位置。 + +计数排序的时间复杂度是 $O(n + k)$，其中 $n$ 是元素个数，$k$ 是数值范围。空间复杂度是 $O(k)$。当 $k$ 值较小时效率很高，但当数值范围很大时会消耗较多内存。 + +计数排序适合整数排序，不适合字符串等复杂数据。它是稳定的排序算法，能保持相等元素的原始顺序。在实际应用中，计数排序常用于数据范围不大的整数排序场景。 + +## 练习题目 + +- [0912. 排序数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md) +- [1122. 数组的相对排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/relative-sort-array.md) + +- [排序算法题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/Contents/01.Array/02.Array-Sort/09.Array-Bucket-Sort.md b/docs/01_array/01_11_array_bucket_sort.md similarity index 74% rename from Contents/01.Array/02.Array-Sort/09.Array-Bucket-Sort.md rename to docs/01_array/01_11_array_bucket_sort.md index 4fdce2e4..ed8d3d08 100644 --- a/Contents/01.Array/02.Array-Sort/09.Array-Bucket-Sort.md +++ b/docs/01_array/01_11_array_bucket_sort.md @@ -63,4 +63,20 @@ class Solution: - **时间复杂度**：$O(n)$。当输入元素个数为 $n$，桶的个数是 $m$ 时，每个桶里的数据就是 $k = \frac{n}{m}$ 个。每个桶内排序的时间复杂度为 $O(k \times \log k)$。$m$ 个桶就是 $m \times O(k \times \log k) = m \times O(\frac{n}{m} \times \log \frac{n}{m}) = O(n \times \log \frac{n}{m})$。当桶的个数 $m$ 接近于数据个数 $n$ 时，$\log \frac{n}{m}$ 就是一个较小的常数，所以排序桶排序时间复杂度接近于 $O(n)$。 - **空间复杂度**：$O(n + m)$。由于桶排序使用了辅助空间，所以桶排序的空间复杂度是 $O(n + m)$。 -- **排序稳定性**：桶排序的稳定性取决于桶内使用的排序算法。如果桶内使用稳定的排序算法（比如插入排序算法），并且在合并桶的过程中保持相等元素的相对顺序不变，则桶排序是一种 **稳定排序算法**。反之，则桶排序是一种 **不稳定排序算法**。 \ No newline at end of file +- **排序稳定性**：桶排序的稳定性取决于桶内使用的排序算法。如果桶内使用稳定的排序算法（比如插入排序算法），并且在合并桶的过程中保持相等元素的相对顺序不变，则桶排序是一种 **稳定排序算法**。反之，则桶排序是一种 **不稳定排序算法**。 + +## 5. 总结 + +桶排序将元素分散到多个桶中，每个桶单独排序后再合并。它先确定桶的数量和范围，把元素分配到对应桶中，对每个桶排序，最后合并所有桶。 + +桶排序的时间复杂度接近 $O(n)$，在数据分布均匀时效率很高。空间复杂度是 $O(n + m)$，需要额外存储桶。排序的稳定性取决于桶内使用的排序算法。 + +桶排序适合数据分布均匀的情况，当数据集中在少数桶时会降低效率。实际应用中常用于外部排序和处理大数据量的场景。合理设置桶的数量和范围对性能很重要。 + +## 练习题目 + +- [0912. 排序数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md) +- [0220. 存在重复元素 III](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/contains-duplicate-iii.md) +- [0164. 最大间距](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/maximum-gap.md) + +- [排序算法题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/Contents/01.Array/02.Array-Sort/10.Array-Radix-Sort.md b/docs/01_array/01_12_array_radix_sort.md similarity index 69% rename from Contents/01.Array/02.Array-Sort/10.Array-Radix-Sort.md rename to docs/01_array/01_12_array_radix_sort.md index a36b7a58..f21b2783 100644 --- a/Contents/01.Array/02.Array-Sort/10.Array-Radix-Sort.md +++ b/docs/01_array/01_12_array_radix_sort.md @@ -54,4 +54,20 @@ class Solution: - **时间复杂度**：$O(n \times k)$。其中 $n$ 是待排序元素的个数，$k$ 是数字位数。$k$ 的大小取决于数字位的选择（十进制位、二进制位）和待排序元素所属数据类型全集的大小。 - **空间复杂度**：$O(n + k)$。 -- **排序稳定性**：基数排序采用的桶排序是稳定的。基数排序是一种 **稳定排序算法**。 \ No newline at end of file +- **排序稳定性**：基数排序采用的桶排序是稳定的。基数排序是一种 **稳定排序算法**。 + +## 5. 总结 + +基数排序按照数字的每一位进行排序。它从最低位开始，逐位比较，直到最高位。每次排序时，将数字分配到 $0 \sim 9$ 的桶中，然后按顺序收集。 + +基数排序的时间复杂度是 $O(n \times k)$，$n$ 是元素数量，$k$ 是最大位数。空间复杂度是 $O(n + k)$。它是稳定的排序算法，能保持相同数字的相对顺序。 + +基数排序适合处理位数不多的整数排序。当数字范围很大但位数较少时效率较高。实际应用中常用于电话号码、身份证号等固定位数数据的排序。 + +## 练习题目 + +- [0912. 排序数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md) +- [0164. 最大间距](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/maximum-gap.md) +- [0561. 数组拆分](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/array-partition.md) + +- [排序算法题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/Contents/01.Array/03.Array-Binary-Search/01.Array-Binary-Search-01.md b/docs/01_array/01_13_array_binary_search_01.md similarity index 81% rename from Contents/01.Array/03.Array-Binary-Search/01.Array-Binary-Search-01.md rename to docs/01_array/01_13_array_binary_search_01.md index 2f1d1dab..f77ca0ac 100644 --- a/Contents/01.Array/03.Array-Binary-Search/01.Array-Binary-Search-01.md +++ b/docs/01_array/01_13_array_binary_search_01.md @@ -145,3 +145,22 @@ class Solution: - **时间复杂度**：$O(\log n)$。 - **空间复杂度**：$O(1)$。 + +## 3. 总结 + +二分查找是一种高效的搜索算法，适用于有序数组。它的工作原理是通过不断将搜索范围减半来快速定位目标元素。 + +二分查找的步骤包括初始化查找范围、计算中间元素、比较中间元素与目标值，并根据比较结果调整查找范围。如果中间元素等于目标值，返回其位置。如果中间元素小于目标值，搜索右半部分。如果中间元素大于目标值，搜索左半部分。重复这个过程直到找到目标值或确定目标值不存在。 + +二分查找的时间复杂度是 $O(\log n)$，比顺序查找的 $O(n)$ 更快。它的空间复杂度是 $O(1)$，因为它不需要额外的存储空间。 + +二分查找的思想是减而治之，通过排除不可能的区域来缩小搜索范围。这种方法在有序数据集中非常有效，可以显著提高搜索效率。 + +## 练习题目 + +- [0704. 二分查找](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/binary-search.md) +- [0374. 猜数字大小](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/guess-number-higher-or-lower.md) +- [0035. 搜索插入位置](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/search-insert-position.md) +- [0167. 两数之和 II - 输入有序数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/two-sum-ii-input-array-is-sorted.md) + +- [二分查找题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/Contents/01.Array/03.Array-Binary-Search/02.Array-Binary-Search-02.md b/docs/01_array/01_14_array_binary_search_02.md similarity index 87% rename from Contents/01.Array/03.Array-Binary-Search/02.Array-Binary-Search-02.md rename to docs/01_array/01_14_array_binary_search_02.md index 35dbd9b8..2f2cbf79 100644 --- a/Contents/01.Array/03.Array-Binary-Search/02.Array-Binary-Search-02.md +++ b/docs/01_array/01_14_array_binary_search_02.md @@ -234,6 +234,38 @@ class Solution: - **直接法**：因为判断语句是 `left <= right`，有时候要考虑返回是 $left$ 还是 $right$。循环体内有 3 个分支，并且一定有一个分支用于退出循环或者直接返回。这种思路适合解决简单题目。即要查找的元素性质简单，数组中都是非重复元素，且 `==`、`>`、`<` 的情况非常好写的时候。 - **排除法**：更加符合二分查找算法的减治思想。每次排除目标元素一定不存在的区间，达到减少问题规模的效果。然后在可能存在的区间内继续查找目标元素。这种思路适合解决复杂题目。比如查找一个数组里可能不存在的元素，找边界问题，可以使用这种思路。 +## 5. 总结 + +二分查找的细节问题包括区间开闭、mid取值、循环条件和搜索范围的选择。 + +**区间开闭**：建议使用左闭右闭区间，这样逻辑更简单，减少出错可能。 + +**mid取值**：通常使用 `mid = left + (right - left) // 2`，防止整型溢出。在某些情况下，如 `left = mid` 时，需向上取整，避免死循环。 + +**循环条件**： +- `left <= right`：适用于直接法，循环结束时若未找到目标，直接返回 $-1$。 +- `left < right`：适用于排除法，循环结束时需额外判断 `nums[left]` 是否为目标值。 + +**搜索范围选择**： +- 直接法：`left = mid + 1` 或 `right = mid - 1`，明确缩小范围。 +- 排除法：根据情况选择 `left = mid + 1` 或 `right = mid`，以及 `right = mid - 1` 或 `left = mid`，确保每次排除无效区间。 + +**两种思路**： +- **直接法**：简单直接，适合查找明确存在的元素。 +- **排除法**：更通用，适合复杂问题，如边界查找或不确定元素是否存在的情况。 + +掌握这些细节能更灵活地应用二分查找，避免常见错误。 + +## 练习题目 + +- [0278. 第一个错误的版本](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/first-bad-version.md) +- [0069. x 的平方根](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/sqrtx.md) +- [1011. 在 D 天内送达包裹的能力](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/capacity-to-ship-packages-within-d-days.md) +- [0033. 搜索旋转排序数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/search-in-rotated-sorted-array.md) +- [0153. 寻找旋转排序数组中的最小值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/find-minimum-in-rotated-sorted-array.md) + +- [二分查找题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【博文】[Learning-Algorithms-with-Leetcode - 第 3.1 节 二分查找算法](https://www.yuque.com/liweiwei1419/algo/wkmtx4) diff --git a/Contents/01.Array/04.Array-Two-Pointers/01.Array-Two-Pointers.md b/docs/01_array/01_15_array_two_pointers.md similarity index 93% rename from Contents/01.Array/04.Array-Two-Pointers/01.Array-Two-Pointers.md rename to docs/01_array/01_15_array_two_pointers.md index 4afd494c..af319093 100644 --- a/Contents/01.Array/04.Array-Two-Pointers/01.Array-Two-Pointers.md +++ b/docs/01_array/01_15_array_two_pointers.md @@ -491,6 +491,19 @@ class Solution: - **快慢指针**：两个指针方向相同。适合解决数组中的移动、删除元素问题，或者链表中的判断是否有环、长度问题。 - **分离双指针**：两个指针分别属于不同的数组 / 链表。适合解决有序数组合并，求交集、并集问题。 +双指针算法能有效降低时间复杂度，通常将暴力解法的 $O(n^2)$ 优化为 $O(n)$。关键在于利用数据的有序性或问题的单调性，通过指针移动排除不可能的情况，减少不必要的计算。掌握双指针技巧能高效解决许多数组和链表问题。 + +## 练习题目 + +- [0344. 反转字符串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/reverse-string.md) +- [0345. 反转字符串中的元音字母](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/reverse-vowels-of-a-string.md) +- [0015. 三数之和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/3sum.md) +- [0027. 移除元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-element.md) +- [0080. 删除有序数组中的重复项 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-duplicates-from-sorted-array-ii.md) +- [0925. 长按键入](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/long-pressed-name.md) + +- [双指针题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%8F%8C%E6%8C%87%E9%92%88%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【博文】[双指针算法之快慢指针 (yanyusoul.com)](https://yanyusoul.com/blog/cs/algorithms_fast-slow-points/) diff --git a/Contents/01.Array/05.Array-Sliding-Window/01.Array-Sliding-Window.md b/docs/01_array/01_16_array_sliding_window.md similarity index 68% rename from Contents/01.Array/05.Array-Sliding-Window/01.Array-Sliding-Window.md rename to docs/01_array/01_16_array_sliding_window.md index 910d6d5f..addc58ed 100644 --- a/Contents/01.Array/05.Array-Sliding-Window/01.Array-Sliding-Window.md +++ b/docs/01_array/01_16_array_sliding_window.md @@ -143,7 +143,7 @@ class Solution: ##### 思路 1：复杂度分析 - **时间复杂度**：$O(n)$。 -- **空间复杂度**：$O(n)$。 +- **空间复杂度**：$O(1)$。 ## 4. 不定长度滑动窗口 @@ -257,162 +257,31 @@ class Solution: - **时间复杂度**：$O(n)$。 - **空间复杂度**：$O(| \sum |)$。其中 $\sum$ 表示字符集，$| \sum |$ 表示字符集的大小。 -### 4.4 长度最小的子数组 - -#### 4.4.1 题目链接 - -- [209. 长度最小的子数组 - 力扣（LeetCode）](https://leetcode.cn/problems/minimum-size-subarray-sum/) - -#### 4.4.2 题目大意 - -**描述**：给定一个只包含正整数的数组 $nums$ 和一个正整数 $target$。 - -**要求**：找出数组中满足和大于等于 $target$ 的长度最小的「连续子数组」，并返回其长度。如果不存在符合条件的子数组，返回 $0$。 - -**说明**： - -- $1 \le target \le 10^9$。 -- $1 \le nums.length \le 10^5$。 -- $1 \le nums[i] \le 10^5$。 - -**示例**： - -- 示例 1： - -```python -输入：target = 7, nums = [2,3,1,2,4,3] -输出：2 -解释：子数组 [4,3] 是该条件下的长度最小的子数组。 -``` - -- 示例 2： - -```python -输入：target = 4, nums = [1,4,4] -输出：1 -``` - -#### 4.4.3 解题思路 - -##### 思路 1：滑动窗口（不定长度） - -最直接的做法是暴力枚举，时间复杂度为 $O(n^2)$。但是我们可以利用滑动窗口的方法，在时间复杂度为 $O(n)$ 的范围内解决问题。 - -用滑动窗口来记录连续子数组的和，设定两个指针：$left$、$right$，分别指向滑动窗口的左右边界，保证窗口中的和刚好大于等于 $target$。 - -1. 一开始，$left$、$right$ 都指向 $0$。 -2. 向右移动 $right$，将最右侧元素加入当前窗口和 $window\underline{\hspace{0.5em}}sum$ 中。 -3. 如果 $window\underline{\hspace{0.5em}}sum \ge target$，则不断右移 $left$，缩小滑动窗口长度，并更新窗口和的最小值，直到 $window\underline{\hspace{0.5em}}sum < target$。 -4. 然后继续右移 $right$，直到 $right \ge len(nums)$ 结束。 -5. 输出窗口和的最小值作为答案。 - -##### 思路 1：代码 - -```python -class Solution: - def minSubArrayLen(self, target: int, nums: List[int]) -> int: - size = len(nums) - ans = size + 1 - left = 0 - right = 0 - window_sum = 0 - - while right < size: - window_sum += nums[right] - - while window_sum >= target: - ans = min(ans, right - left + 1) - window_sum -= nums[left] - left += 1 - - right += 1 - - return ans if ans != size + 1 else 0 -``` - -##### 思路 1：复杂度分析 +## 5. 总结 -- **时间复杂度**：$O(n)$。 -- **空间复杂度**：$O(1)$。 +滑动窗口算法用于解决数组或字符串中的连续子区间问题。 -### 4.5 乘积小于K的子数组 +**固定长度窗口**：窗口大小不变。适用于需要检查固定长度子区间的问题，如计算特定长度子数组的平均值。 -#### 4.5.1 题目链接 +**不定长度窗口**：窗口大小可变。适用于寻找满足条件的最长或最短子区间，如无重复字符的最长子串。 -- [713. 乘积小于K的子数组 - 力扣（LeetCode）](https://leetcode.cn/problems/subarray-product-less-than-k/) +滑动窗口通过维护窗口的左右边界来减少重复计算，将时间复杂度从 $O(n^2)$ 优化到 $O(n)$。 -#### 4.5.2 题目大意 +使用滑动窗口时需要注意： +- 窗口的初始位置 +- 窗口扩展和收缩的条件 +- 如何更新答案 +- 边界情况的处理 -**描述**：给定一个正整数数组 $nums$ 和整数 $k$。 +掌握滑动窗口算法能高效解决许多子区间相关问题。 -**要求**：找出该数组内乘积小于 $k$ 的连续的子数组的个数。 +## 练习题目 -**说明**： - -- $1 \le nums.length \le 3 * 10^4$。 -- $1 \le nums[i] \le 1000$。 -- $0 \le k \le 10^6$。 - -**示例**： - -- 示例 1： +- [0643. 子数组最大平均数 I](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/maximum-average-subarray-i.md) +- [0674. 最长连续递增序列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/longest-continuous-increasing-subsequence.md) +- [1004. 最大连续1的个数 III](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/max-consecutive-ones-iii.md) -```python -输入：nums = [10,5,2,6], k = 100 -输出：8 -解释：8 个乘积小于 100 的子数组分别为：[10]、[5]、[2],、[6]、[10,5]、[5,2]、[2,6]、[5,2,6]。需要注意的是 [10,5,2] 并不是乘积小于 100 的子数组。 -``` - -- 示例 2： - -```python -输入：nums = [1,2,3], k = 0 -输出：0 -``` - -#### 4.5.3 解题思路 - -##### 思路 1：滑动窗口（不定长度） - -1. 设定两个指针：$left$、$right$，分别指向滑动窗口的左右边界，保证窗口内所有数的乘积 $window\underline{\hspace{0.5em}}product$ 都小于 $k$。使用 $window\underline{\hspace{0.5em}}product$ 记录窗口中的乘积值，使用 $count$ 记录符合要求的子数组个数。 -2. 一开始，$left$、$right$ 都指向 $0$。 -3. 向右移动 $right$，将最右侧元素加入当前子数组乘积 $window\underline{\hspace{0.5em}}product$ 中。 -4. 如果 $window\underline{\hspace{0.5em}}product \ge k$，则不断右移 $left$，缩小滑动窗口长度，并更新当前乘积值 $window\underline{\hspace{0.5em}}product$ 直到 $window\underline{\hspace{0.5em}}product < k$。 -5. 记录累积答案个数加 $1$，继续右移 $right$，直到 $right \ge len(nums)$ 结束。 -6. 输出累积答案个数。 - -##### 思路 1：代码 - -```python -class Solution: - def numSubarrayProductLessThanK(self, nums: List[int], k: int) -> int: - if k <= 1: - return 0 - - size = len(nums) - left = 0 - right = 0 - window_product = 1 - - count = 0 - - while right < size: - window_product *= nums[right] - - while window_product >= k: - window_product /= nums[left] - left += 1 - - count += (right - left + 1) - right += 1 - - return count -``` - -##### 思路 1：复杂度分析 - -- **时间复杂度**：$O(n)$。 -- **空间复杂度**：$O(1)$。 +- [滑动窗口题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E9%A2%98%E7%9B%AE) ## 参考资料 diff --git a/docs/01_array/index.md b/docs/01_array/index.md new file mode 100644 index 00000000..0117cdf2 --- /dev/null +++ b/docs/01_array/index.md @@ -0,0 +1,18 @@ +## 本章内容 + +- [1.1 数组基础](https://github.com/ITCharge/AlgoNote/tree/main/docs/01_array/01_01_array_basic.md) +- [1.2 数组排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/01_array/01_02_array_sort.md) +- [1.3 数组冒泡排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/01_array/01_03_array_bubble_sort.md) +- [1.4 数组选择排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/01_array/01_04_array_selection_sort.md) +- [1.5 数组插入排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/01_array//01_05_array_insertion_sort.md) +- [1.6 数组希尔排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/01_array/01_06_array_shell_sort.md) +- [1.7 数组归并排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/01_array/01_07_array_merge_sort.md) +- [1.8 数组快速排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/01_array/01_08_array_quick_sort.md) +- [1.9 数组堆排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/01_array/01_09_array_heap_sort.md) +- [1.10 数组计数排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/01_array/01_10_array_counting_sort.md) +- [1.11 数组桶排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/01_array/01_11_array_bucket_sort.md) +- [1.12 数组基数排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/01_array/01_12_array_radix_sort.md) +- [1.13 数组二分查找（一）](https://github.com/ITCharge/AlgoNote/tree/main/docs/01_array/01_13_array_binary_search_01.md) +- [1.14 数组二分查找（二）](https://github.com/ITCharge/AlgoNote/tree/main/docs/01_array/01_14_array_binary_search_02.md) +- [1.15 数组双指针](https://github.com/ITCharge/AlgoNote/tree/main/docs/01_array/01_15_array_two_pointers.md) +- [1.16 数组滑动窗口](https://github.com/ITCharge/AlgoNote/tree/main/docs/01_array/01_16_array_sliding_window.md) \ No newline at end of file diff --git a/Contents/02.Linked-List/01.Linked-List-Basic/01.Linked-List-Basic.md b/docs/02_linked_list/02_01_linked_list_basic.md similarity index 94% rename from Contents/02.Linked-List/01.Linked-List-Basic/01.Linked-List-Basic.md rename to docs/02_linked_list/02_01_linked_list_basic.md index 3f71376d..c88cf04a 100644 --- a/Contents/02.Linked-List/01.Linked-List-Basic/01.Linked-List-Basic.md +++ b/docs/02_linked_list/02_01_linked_list_basic.md @@ -348,7 +348,7 @@ def removeInside(self, index): 到这里，有关链表的基础知识就介绍完了。下面进行一下总结。 -## 3. 链表总结 +## 3. 总结 链表是最基础、最简单的数据结构。**「链表」** 是实现线性表的链式存储结构的基础。它使用一组任意的存储单元（可以是连续的，也可以是不连续的），来存储一组具有相同类型的数据。 @@ -359,6 +359,17 @@ def removeInside(self, index): - 链表进行尾部插入、尾部删除操作的时间复杂度是 $O(n)$。 - 链表在普通情况下进行插入、删除元素操作的时间复杂度为 $O(n)$。 +## 练习题目 + +- [0707. 设计链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/design-linked-list.md) +- [0206. 反转链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/reverse-linked-list.md) +- [0203. 移除链表元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/remove-linked-list-elements.md) +- [0328. 奇偶链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/odd-even-linked-list.md) +- [0234. 回文链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/palindrome-linked-list.md) +- [0138. 随机链表的复制](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/copy-list-with-random-pointer.md) + +- [链表基础题目列表](https://github.com/itcharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E9%93%BE%E8%A1%A8%E5%9F%BA%E7%A1%80%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【文章】[链表理论基础 - 代码随想录](https://programmercarl.com/链表理论基础.html#链表理论基础) diff --git a/docs/02_linked_list/02_02_linked_list_sort.md b/docs/02_linked_list/02_02_linked_list_sort.md new file mode 100644 index 00000000..b566bb44 --- /dev/null +++ b/docs/02_linked_list/02_02_linked_list_sort.md @@ -0,0 +1,51 @@ +## 1. 链表排序简介 + +在数组排序中，常见的排序算法有：冒泡排序、选择排序、插入排序、希尔排序、归并排序、快速排序、堆排序、计数排序、桶排序、基数排序等。 + +而对于链表排序而言，因为链表不支持随机访问，访问链表后面的节点只能依靠 `next` 指针从头部顺序遍历，所以相对于数组排序问题来说，链表排序问题会更加复杂一点。 + +下面先来总结一下适合链表排序与不适合链表排序的算法： + +- 适合链表的排序算法：**冒泡排序**、**选择排序**、**插入排序**、**归并排序**、**快速排序**、**计数排序**、**桶排序**、**基数排序**。 +- 不适合链表的排序算法：**希尔排序**。 +- 可以用于链表排序但不建议使用的排序算法：**堆排序**。 + +> 希尔排序为什么不适合链表排序？ + +**希尔排序**：希尔排序中经常涉及到对序列中第 $i + gap$ 的元素进行操作，其中 $gap$ 是希尔排序中当前的步长。而链表不支持随机访问的特性，导致这种操作不适合链表，因而希尔排序算法不适合进行链表排序。 + +> 为什么不建议使用堆排序？ + +**堆排序**：堆排序所使用的最大堆 / 最小堆结构本质上是一棵完全二叉树。而完全二叉树适合采用顺序存储结构（数组）。因为数组存储的完全二叉树可以很方便的通过下标序号来确定父亲节点和孩子节点，并且可以极大限度的节省存储空间。 + +而链表用在存储完全二叉树的时候，因为不支持随机访问的特性，导致其寻找子节点和父亲节点会比较耗时，如果增加指向父亲节点的变量，又会浪费大量存储空间。所以堆排序算法不适合进行链表排序。 + +如果一定要对链表进行堆排序，则可以使用额外的数组空间表示堆结构。然后将链表中各个节点的值依次添加入堆结构中，对数组进行堆排序。排序后，再按照堆中元素顺序，依次建立链表节点，构建新的链表并返回新链表头节点。 + +> 需要用到额外的辅助空间进行排序的算法 + +刚才我们说到如果一定要对链表进行堆排序，则需要使用额外的数组空间。除此之外，计数排序、桶排序、基数排序都需要用到额外的数组空间。 + +接下来，我们将对适合链表排序的 8 种算法进行一一讲解。当然，这些排序算法不用完全掌握，重点是掌握 **「链表插入排序」**、**「链表归并排序」** 这两种排序算法。 + +## 2. 常见链表排序算法 + +链表排序常用的方法有冒泡排序、选择排序、插入排序、归并排序、快速排序、计数排序、桶排序、基数排序。 + +- **链表冒泡排序**：每次比较相邻两个节点的值，大的往后移。重复多次，直到链表有序。时间复杂度 $O(n^2)$，空间复杂度 $O(1)$。 +- **链表选择排序**：每次从未排序部分找到最小的节点，和当前节点交换。重复操作，直到链表有序。时间复杂度 $O(n^2)$，空间复杂度 $O(1)$。 +- **链表插入排序**：每次取一个节点，插入到已排序部分的合适位置。不断重复，直到全部节点有序。时间复杂度 $O(n^2)$，空间复杂度 $O(1)$。 +- **链表归并排序**：把链表分成两半，递归排序，再合并。适合链表，时间复杂度 O$(n \log n)$，空间复杂度 $O(1)$。 +- **链表快速排序**：选一个基准值，把小于基准的放左边，大于的放右边。对两边递归排序。时间复杂度 $O(n \log n)$，空间复杂度 $O(1)$。 +- **链表计数排序**：先找最大最小值，用数组统计每个值出现次数，再按顺序重建链表。适合值域不大时用。时间复杂度 $O(n + k)$，空间复杂度 $O(k)$。 +- **链表桶排序**：把节点分到不同的桶里，每个桶内单独排序，再合并所有桶。适合数据分布均匀时用。时间复杂度 $O(n)$，空间复杂度 $O(n + m)$。 +- **链表基数排序**：按个位、十位、百位等分多轮，把节点分到不同的桶里，再合并。适合数字位数不多时用。时间复杂度 $O(n \times k)$，空间复杂度 $O(n + k)$。 + +## 参考资料 + +- 【文章】[单链表的冒泡排序_zhao_miao的博客 - CSDN博客](https://blog.csdn.net/zhao_miao/article/details/81708454) +- 【文章】[链表排序总结（全）（C++）- 阿祭儿 - CSDN博客](https://blog.csdn.net/qq_32523711/article/details/107402873) +- 【题解】[快排、冒泡、选择排序实现列表排序 - 排序链表 - 力扣](https://leetcode.cn/problems/sort-list/solution/kuai-pai-mou-pao-xuan-ze-pai-xu-shi-xian-ula7/) +- 【题解】[归并排序+快速排序 - 排序链表 - 力扣](https://leetcode.cn/problems/sort-list/solution/gui-bing-pai-xu-kuai-su-pai-xu-by-datacruiser/) +- 【题解】[排序链表（递归+迭代）详解 - 排序链表 - 力扣](https://leetcode.cn/problems/sort-list/solution/pai-xu-lian-biao-di-gui-die-dai-xiang-jie-by-cherr/) +- 【题解】[Sort List （归并排序链表） - 排序链表 - 力扣](https://leetcode.cn/problems/sort-list/solution/sort-list-gui-bing-pai-xu-lian-biao-by-jyd/) diff --git a/docs/02_linked_list/02_03_linked_list_bubble_sort.md b/docs/02_linked_list/02_03_linked_list_bubble_sort.md new file mode 100644 index 00000000..4e55fcc8 --- /dev/null +++ b/docs/02_linked_list/02_03_linked_list_bubble_sort.md @@ -0,0 +1,53 @@ +## 1. 链表冒泡排序算法描述 + +1. 使用三个指针 `node_i`、`node_j` 和 `tail`。其中 `node_i` 用于控制外循环次数，循环次数为链节点个数（链表长度）。`node_j` 和 `tail` 用于控制内循环次数和循环结束位置。 +2. 排序开始前，将 `node_i` 、`node_j` 置于头节点位置。`tail` 指向链表末尾，即 `None`。 +3. 比较链表中相邻两个元素 `node_j.val` 与 `node_j.next.val` 的值大小，如果 `node_j.val > node_j.next.val`，则值相互交换。否则不发生交换。然后向右移动 `node_j` 指针，直到 `node_j.next == tail` 时停止。 +4. 一次循环之后，将 `tail` 移动到 `node_j` 所在位置。相当于 `tail` 向左移动了一位。此时 `tail` 节点右侧为链表中最大的链节点。 +5. 然后移动 `node_i` 节点，并将 `node_j` 置于头节点位置。然后重复第 3、4 步操作。 +6. 直到 `node_i` 节点移动到链表末尾停止，排序结束。 +7. 返回链表的头节点 `head`。 + +## 2. 链表冒泡排序算法实现代码 + +```python +class Solution: + def bubbleSort(self, head: ListNode): + node_i = head + tail = None + # 外层循环次数为 链表节点个数 + while node_i: + node_j = head + while node_j and node_j.next != tail: + if node_j.val > node_j.next.val: + # 交换两个节点的值 + node_j.val, node_j.next.val = node_j.next.val, node_j.val + node_j = node_j.next + # 尾指针向前移动 1 位，此时尾指针右侧为排好序的链表 + tail = node_j + node_i = node_i.next + + return head + + def sortList(self, head: Optional[ListNode]) -> Optional[ListNode]: + return self.bubbleSort(head) +``` + +## 3. 链表冒泡排序算法复杂度分析 + +- **时间复杂度**：$O(n^2)$。 +- **空间复杂度**：$O(1)$。 + +## 4. 总结 + +链表冒泡排序使用三个指针进行操作。`node_i` 控制外层循环次数，`node_j` 和 `tail` 控制内层循环。每次比较相邻节点的值，需要交换时就交换。每次内循环结束后，最大的节点会移动到链表末尾。 + +这个算法的时间复杂度是 $O(n^2)$，因为需要进行两层循环。空间复杂度是 $O(1)$，因为只使用了固定数量的指针变量，没有使用额外空间。 + +链表冒泡排序适合小规模数据排序。对于大规模数据，其他排序算法可能更高效。实现时需要注意指针移动和节点交换的操作。 + +## 练习题目 + +- [0148. 排序链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/sort-list.md)(链表冒泡排序会超时，仅做练习) + +- [链表排序题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E9%93%BE%E8%A1%A8%E6%8E%92%E5%BA%8F%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/docs/02_linked_list/02_04_linked_list_selection_sort.md b/docs/02_linked_list/02_04_linked_list_selection_sort.md new file mode 100644 index 00000000..33d53773 --- /dev/null +++ b/docs/02_linked_list/02_04_linked_list_selection_sort.md @@ -0,0 +1,46 @@ +## 1. 链表选择排序算法描述 + +1. 使用两个指针 `node_i`、`node_j`。`node_i` 既可以用于控制外循环次数，又可以作为当前未排序链表的第一个链节点位置。 +2. 使用 `min_node` 记录当前未排序链表中值最小的链节点。 +3. 每一趟排序开始时，先令 `min_node = node_i`（即暂时假设链表中 `node_i` 节点为值最小的节点，经过比较后再确定最小值节点位置）。 +4. 然后依次比较未排序链表中 `node_j.val` 与 `min_node.val` 的值大小。如果 `node_j.val < min_node.val`，则更新 `min_node` 为 `node_j`。 +5. 这一趟排序结束时，未排序链表中最小值节点为 `min_node`，如果 `node_i != min_node`，则将 `node_i` 与 `min_node` 值进行交换。如果 `node_i == min_node`，则不用交换。 +6. 排序结束后，继续向右移动 `node_i`，重复上述步骤，在剩余未排序链表中寻找最小的链节点，并与 `node_i` 进行比较和交换，直到 `node_i == None` 或者 `node_i.next == None` 时，停止排序。 +7. 返回链表的头节点 `head`。 + +## 2. 链表选择排序实现代码 + +```python +class Solution: + def sectionSort(self, head: ListNode): + node_i = head + # node_i 为当前未排序链表的第一个链节点 + while node_i and node_i.next: + # min_node 为未排序链表中的值最小节点 + min_node = node_i + node_j = node_i.next + while node_j: + if node_j.val < min_node.val: + min_node = node_j + node_j = node_j.next + # 交换值最小节点与未排序链表中第一个节点的值 + if node_i != min_node: + node_i.val, min_node.val = min_node.val, node_i.val + node_i = node_i.next + + return head + + def sortList(self, head: Optional[ListNode]) -> Optional[ListNode]: + return self.sectionSort(head) +``` + +## 3. 链表选择排序算法复杂度分析 + +- **时间复杂度**：$O(n^2)$。 +- **空间复杂度**：$O(1)$。 + +## 练习题目 + +- [0148. 排序链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/sort-list.md)(链表选择排序会超时，仅做练习) + +- [链表排序题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E9%93%BE%E8%A1%A8%E6%8E%92%E5%BA%8F%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/docs/02_linked_list/02_05_linked_list_insertion_sort.md b/docs/02_linked_list/02_05_linked_list_insertion_sort.md new file mode 100644 index 00000000..4041a6d0 --- /dev/null +++ b/docs/02_linked_list/02_05_linked_list_insertion_sort.md @@ -0,0 +1,59 @@ + + +## 1. 链表插入排序算法描述 + +1. 先使用哑节点 `dummy_head` 构造一个指向 `head` 的指针，使得可以从 `head` 开始遍历。 +2. 维护 `sorted_list` 为链表的已排序部分的最后一个节点，初始时，`sorted_list = head`。 +3. 维护 `prev` 为插入元素位置的前一个节点，维护 `cur` 为待插入元素。初始时，`prev = head`，`cur = head.next`。 +4. 比较 `sorted_list` 和 `cur` 的节点值。 + + - 如果 `sorted_list.val <= cur.val`，说明 `cur` 应该插入到 `sorted_list` 之后，则将 `sorted_list` 后移一位。 + - 如果 `sorted_list.val > cur.val`，说明 `cur` 应该插入到 `head` 与 `sorted_list` 之间。则使用 `prev` 从 `head` 开始遍历，直到找到插入 `cur` 的位置的前一个节点位置。然后将 `cur` 插入。 + +5. 令 `cur = sorted_list.next`，此时 `cur` 为下一个待插入元素。 +6. 重复 4、5 步骤，直到 `cur` 遍历结束为空。返回 `dummy_head` 的下一个节点。 + +## 2. 链表插入排序实现代码 + +```python +class Solution: + def insertionSort(self, head: ListNode): + if not head or not head.next: + return head + + dummy_head = ListNode(-1) + dummy_head.next = head + sorted_list = head + cur = head.next + + while cur: + if sorted_list.val <= cur.val: + # 将 cur 插入到 sorted_list 之后 + sorted_list = sorted_list.next + else: + prev = dummy_head + while prev.next.val <= cur.val: + prev = prev.next + # 将 cur 到链表中间 + sorted_list.next = cur.next + cur.next = prev.next + prev.next = cur + cur = sorted_list.next + + return dummy_head.next + + def sortList(self, head: Optional[ListNode]) -> Optional[ListNode]: + return self.insertionSort(head) +``` + +## 3. 链表插入排序算法复杂度分析 + +- **时间复杂度**：$O(n^2)$。 +- **空间复杂度**：$O(1)$。 + +## 练习题目 + +- [0148. 排序链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/sort-list.md)(链表插入排序会超时，仅做练习) +- [0147. 对链表进行插入排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/insertion-sort-list.md) + +- [链表排序题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E9%93%BE%E8%A1%A8%E6%8E%92%E5%BA%8F%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/docs/02_linked_list/02_06_linked_list_merge_sort.md b/docs/02_linked_list/02_06_linked_list_merge_sort.md new file mode 100644 index 00000000..3a3a4edd --- /dev/null +++ b/docs/02_linked_list/02_06_linked_list_merge_sort.md @@ -0,0 +1,71 @@ +## 1. 链表归并排序算法描述 + +1. **分割环节**：找到链表中心链节点，从中心节点将链表断开，并递归进行分割。 + 1. 使用快慢指针 `fast = head.next`、`slow = head`，让 `fast` 每次移动 `2` 步，`slow` 移动 `1` 步，移动到链表末尾，从而找到链表中心链节点，即 `slow`。 + 2. 从中心位置将链表从中心位置分为左右两个链表 `left_head` 和 `right_head`，并从中心位置将其断开，即 `slow.next = None`。 + 3. 对左右两个链表分别进行递归分割，直到每个链表中只包含一个链节点。 +2. **归并环节**：将递归后的链表进行两两归并，完成一遍后每个子链表长度加倍。重复进行归并操作，直到得到完整的链表。 + 1. 使用哑节点 `dummy_head` 构造一个头节点，并使用 `cur` 指向 `dummy_head` 用于遍历。 + 2. 比较两个链表头节点 `left` 和 `right` 的值大小。将较小的头节点加入到合并后的链表中，并向后移动该链表的头节点指针。 + 3. 然后重复上一步操作，直到两个链表中出现链表为空的情况。 + 4. 将剩余链表插入到合并后的链表中。 + 5. 将哑节点 `dummy_dead` 的下一个链节点 `dummy_head.next` 作为合并后的头节点返回。 + +## 2. 链表归并排序实现代码 + +```python +class Solution: + def merge(self, left, right): + # 归并环节 + dummy_head = ListNode(-1) + cur = dummy_head + while left and right: + if left.val <= right.val: + cur.next = left + left = left.next + else: + cur.next = right + right = right.next + cur = cur.next + + if left: + cur.next = left + elif right: + cur.next = right + + return dummy_head.next + + def mergeSort(self, head: ListNode): + # 分割环节 + if not head or not head.next: + return head + + # 快慢指针找到中心链节点 + slow, fast = head, head.next + while fast and fast.next: + slow = slow.next + fast = fast.next.next + + # 断开左右链节点 + left_head, right_head = head, slow.next + slow.next = None + + # 归并操作 + return self.merge(self.mergeSort(left_head), self.mergeSort(right_head)) + + def sortList(self, head: Optional[ListNode]) -> Optional[ListNode]: + return self.mergeSort(head) +``` + +## 3. 链表归并排序算法复杂度分析 + +- **时间复杂度**：$O(n \times \log_2n)$。 +- **空间复杂度**：$O(1)$。 + +## 练习题目 + +- [0148. 排序链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/sort-list.md) +- [0021. 合并两个有序链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-two-sorted-lists.md) +- [0023. 合并 K 个升序链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-k-sorted-lists.md) + +- [链表排序题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E9%93%BE%E8%A1%A8%E6%8E%92%E5%BA%8F%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/docs/02_linked_list/02_07_linked_list_quick_sort.md b/docs/02_linked_list/02_07_linked_list_quick_sort.md new file mode 100644 index 00000000..ad7c755f --- /dev/null +++ b/docs/02_linked_list/02_07_linked_list_quick_sort.md @@ -0,0 +1,55 @@ +## 1. 链表快速排序算法描述 + +1. 从链表中找到一个基准值 `pivot`，这里以头节点为基准值。 +2. 然后通过快慢指针 `node_i`、`node_j` 在链表中移动，使得 `node_i` 之前的节点值都小于基准值，`node_i` 之后的节点值都大于基准值。从而把数组拆分为左右两个部分。 +3. 再对左右两个部分分别重复第二步，直到各个部分只有一个节点，则排序结束。 + +## 2. 链表快速排序实现代码 + +```python +class Solution: + def partition(self, left: ListNode, right: ListNode): + # 左闭右开，区间没有元素或者只有一个元素，直接返回第一个节点 + if left == right or left.next == right: + return left + # 选择头节点为基准节点 + pivot = left.val + # 使用 node_i, node_j 双指针，保证 node_i 之前的节点值都小于基准节点值，node_i 与 node_j 之间的节点值都大于等于基准节点值 + node_i, node_j = left, left.next + + while node_j != right: + # 发现一个小与基准值的元素 + if node_j.val < pivot: + # 因为 node_i 之前节点都小于基准值，所以先将 node_i 向右移动一位（此时 node_i 节点值大于等于基准节点值） + node_i = node_i.next + # 将小于基准值的元素 node_j 与当前 node_i 换位，换位后可以保证 node_i 之前的节点都小于基准节点值 + node_i.val, node_j.val = node_j.val, node_i.val + node_j = node_j.next + # 将基准节点放到正确位置上 + node_i.val, left.val = left.val, node_i.val + return node_i + + def quickSort(self, left: ListNode, right: ListNode): + if left == right or left.next == right: + return left + pi = self.partition(left, right) + self.quickSort(left, pi) + self.quickSort(pi.next, right) + return left + + def sortList(self, head: Optional[ListNode]) -> Optional[ListNode]: + if not head or not head.next: + return head + return self.quickSort(head, None) +``` + +## 3. 链表快速排序算法复杂度分析 + +- **时间复杂度**：$O(n \times \log_2n)$。 +- **空间复杂度**：$O(1)$。 + +## 练习题目 + +- [0148. 排序链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/sort-list.md)(链表快速排序会超时，仅做练习) + +- [链表排序题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E9%93%BE%E8%A1%A8%E6%8E%92%E5%BA%8F%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/docs/02_linked_list/02_08_linked_list_counting_sort.md b/docs/02_linked_list/02_08_linked_list_counting_sort.md new file mode 100644 index 00000000..146e40b8 --- /dev/null +++ b/docs/02_linked_list/02_08_linked_list_counting_sort.md @@ -0,0 +1,59 @@ +## 1. 链表计数排序算法描述 + +1. 使用 `cur` 指针遍历一遍链表。找出链表中最大值 `list_max` 和最小值 `list_min`。 +2. 使用数组 `counts` 存储节点出现次数。 +3. 再次使用 `cur` 指针遍历一遍链表。将链表中每个值为 `cur.val` 的节点出现次数，存入数组对应第 `cur.val - list_min` 项中。 +4. 反向填充目标链表： + 1. 建立一个哑节点 `dummy_head`，作为链表的头节点。使用 `cur` 指针指向 `dummy_head`。 + 2. 从小到大遍历一遍数组 `counts`。对于每个 `counts[i] != 0` 的元素建立一个链节点，值为 `i + list_min`，将其插入到 `cur.next` 上。并向右移动 `cur`。同时 `counts[i] -= 1`。直到 `counts[i] == 0` 后继续向后遍历数组 `counts`。 +5. 将哑节点 `dummy_dead` 的下一个链节点 `dummy_head.next` 作为新链表的头节点返回。 + +## 2. 链表计数排序代码实现 + +```python +class Solution: + def countingSort(self, head: ListNode): + if not head: + return head + + # 找出链表中最大值 list_max 和最小值 list_min + list_min, list_max = float('inf'), float('-inf') + cur = head + while cur: + if cur.val < list_min: + list_min = cur.val + if cur.val > list_max: + list_max = cur.val + cur = cur.next + + size = list_max - list_min + 1 + counts = [0 for _ in range(size)] + + cur = head + while cur: + counts[cur.val - list_min] += 1 + cur = cur.next + + dummy_head = ListNode(-1) + cur = dummy_head + for i in range(size): + while counts[i]: + cur.next = ListNode(i + list_min) + counts[i] -= 1 + cur = cur.next + return dummy_head.next + + def sortList(self, head: Optional[ListNode]) -> Optional[ListNode]: + return self.countingSort(head) +``` + +## 3. 链表计数排序算法复杂度分析 + +- **时间复杂度**：$O(n + k)$，其中 $k$ 代表待排序链表中所有元素的值域。 +- **空间复杂度**：$O(k)$。 + +## 练习题目 + +- [0148. 排序链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/sort-list.md) + +- [链表排序题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E9%93%BE%E8%A1%A8%E6%8E%92%E5%BA%8F%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/docs/02_linked_list/02_09_linked_list_bucket_sort.md b/docs/02_linked_list/02_09_linked_list_bucket_sort.md new file mode 100644 index 00000000..15f00c61 --- /dev/null +++ b/docs/02_linked_list/02_09_linked_list_bucket_sort.md @@ -0,0 +1,117 @@ +## 1. 链表桶排序算法描述 + + 1. 使用 `cur` 指针遍历一遍链表。找出链表中最大值 `list_max` 和最小值 `list_min`。 + 2. 通过 `(最大值 - 最小值) / 每个桶的大小` 计算出桶的个数，即 `bucket_count = (list_max - list_min) // bucket_size + 1` 个桶。 + 3. 定义数组 `buckets` 为桶，桶的个数为 `bucket_count` 个。 + 4. 使用 `cur` 指针再次遍历一遍链表，将每个元素装入对应的桶中。 + 5. 对每个桶内的元素单独排序，可以使用链表插入排序、链表归并排序、链表快速排序等算法。 + 6. 最后按照顺序将桶内的元素拼成新的链表，并返回。 + +## 2. 链表桶排序代码实现 + + ```python +class ListNode: + def __init__(self, val=0, next=None): + self.val = val + self.next = next + +class Solution: + # 将链表节点值 val 添加到对应桶 buckets[index] 中 + def insertion(self, buckets, index, val): + if not buckets[index]: + buckets[index] = ListNode(val) + return + + node = ListNode(val) + node.next = buckets[index] + buckets[index] = node + + # 归并环节 + def merge(self, left, right): + dummy_head = ListNode(-1) + cur = dummy_head + while left and right: + if left.val <= right.val: + cur.next = left + left = left.next + else: + cur.next = right + right = right.next + cur = cur.next + + if left: + cur.next = left + elif right: + cur.next = right + + return dummy_head.next + + def mergeSort(self, head: ListNode): + # 分割环节 + if not head or not head.next: + return head + + # 快慢指针找到中心链节点 + slow, fast = head, head.next + while fast and fast.next: + slow = slow.next + fast = fast.next.next + + # 断开左右链节点 + left_head, right_head = head, slow.next + slow.next = None + + # 归并操作 + return self.merge(self.mergeSort(left_head), self.mergeSort(right_head)) + + def bucketSort(self, head: ListNode, bucket_size=5): + if not head: + return head + + # 找出链表中最大值 list_max 和最小值 list_min + list_min, list_max = float('inf'), float('-inf') + cur = head + while cur: + if cur.val < list_min: + list_min = cur.val + if cur.val > list_max: + list_max = cur.val + cur = cur.next + + # 计算桶的个数，并定义桶 + bucket_count = (list_max - list_min) // bucket_size + 1 + buckets = [None for _ in range(bucket_count)] + + # 将链表节点值依次添加到对应桶中 + cur = head + while cur: + index = (cur.val - list_min) // bucket_size + self.insertion(buckets, index, cur.val) + cur = cur.next + + dummy_head = ListNode(-1) + cur = dummy_head + # 将元素依次出桶，并拼接成有序链表 + for bucket_head in buckets: + bucket_cur = self.mergeSort(bucket_head) + while bucket_cur: + cur.next = bucket_cur + cur = cur.next + bucket_cur = bucket_cur.next + + return dummy_head.next + + def sortList(self, head: Optional[ListNode]) -> Optional[ListNode]: + return self.bucketSort(head) + ``` + +## 3. 链表桶排序算法复杂度分析 + +- **时间复杂度**：$O(n)$。 +- **空间复杂度**：$O(n + m)$。$m$ 为桶的个数。 + +## 练习题目 + +- [0148. 排序链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/sort-list.md) + +- [链表排序题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E9%93%BE%E8%A1%A8%E6%8E%92%E5%BA%8F%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/docs/02_linked_list/02_10_linked_list_radix_sort.md b/docs/02_linked_list/02_10_linked_list_radix_sort.md new file mode 100644 index 00000000..8ff70d47 --- /dev/null +++ b/docs/02_linked_list/02_10_linked_list_radix_sort.md @@ -0,0 +1,56 @@ +## 1. 链表基数排序算法描述 + +1. 使用 `cur` 指针遍历链表，获取节点值位数最长的位数 `size`。 +2. 从个位到高位遍历位数。因为 `0` ~ `9` 共有 `10` 位数字，所以建立 `10` 个桶。 +3. 以每个节点对应位数上的数字为索引，将节点值放入到对应桶中。 +4. 建立一个哑节点 `dummy_head`，作为链表的头节点。使用 `cur` 指针指向 `dummy_head`。 +5. 将桶中元素依次取出，并根据元素值建立链表节点，并插入到新的链表后面。从而生成新的链表。 +6. 之后依次以十位，百位，…，直到最大值元素的最高位处值为索引，放入到对应桶中，并生成新的链表，最终完成排序。 +7. 将哑节点 `dummy_dead` 的下一个链节点 `dummy_head.next` 作为新链表的头节点返回。 + +## 2. 链表基数排序代码实现 + +```python +class Solution: + def radixSort(self, head: ListNode): + # 计算位数最长的位数 + size = 0 + cur = head + while cur: + val_len = len(str(cur.val)) + if val_len > size: + size = val_len + cur = cur.next + + # 从个位到高位遍历位数 + for i in range(size): + buckets = [[] for _ in range(10)] + cur = head + while cur: + # 以每个节点对应位数上的数字为索引，将节点值放入到对应桶中 + buckets[cur.val // (10 ** i) % 10].append(cur.val) + cur = cur.next + + # 生成新的链表 + dummy_head = ListNode(-1) + cur = dummy_head + for bucket in buckets: + for num in bucket: + cur.next = ListNode(num) + cur = cur.next + head = dummy_head.next + + return head + + def sortList(self, head: Optional[ListNode]) -> Optional[ListNode]: + return self.radixSort(head) +``` + +## 3. 链表基数排序算法复杂度分析 + +- **时间复杂度**：$O(n \times k)$。其中 $n$ 是待排序元素的个数，$k$ 是数字位数。$k$ 的大小取决于数字位的选择（十进制位、二进制位）和待排序元素所属数据类型全集的大小。 +- **空间复杂度**：$O(n + k)$。 + +## 练习题目 + +- [链表排序题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E9%93%BE%E8%A1%A8%E6%8E%92%E5%BA%8F%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/Contents/02.Linked-List/03.Linked-List-Two-Pointers/01.Linked-List-Two-Pointers.md b/docs/02_linked_list/02_11_linked_list_two_pointers.md similarity index 95% rename from Contents/02.Linked-List/03.Linked-List-Two-Pointers/01.Linked-List-Two-Pointers.md rename to docs/02_linked_list/02_11_linked_list_two_pointers.md index 95028f79..5163347c 100644 --- a/Contents/02.Linked-List/03.Linked-List-Two-Pointers/01.Linked-List-Two-Pointers.md +++ b/docs/02_linked_list/02_11_linked_list_two_pointers.md @@ -407,3 +407,10 @@ class Solution: - **时间复杂度**：$O(n)$。 - **空间复杂度**：$O(1)$。 +## 练习题目 + +- [0141. 环形链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/linked-list-cycle.md) +- [0142. 环形链表 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/linked-list-cycle-ii.md) +- [0019. 删除链表的倒数第 N 个结点](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-nth-node-from-end-of-list.md) + +- [链表双指针题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E9%93%BE%E8%A1%A8%E5%8F%8C%E6%8C%87%E9%92%88%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/docs/02_linked_list/index.md b/docs/02_linked_list/index.md new file mode 100644 index 00000000..9e76ebae --- /dev/null +++ b/docs/02_linked_list/index.md @@ -0,0 +1,13 @@ +## 本章内容 + +- [2.1 链表基础](https://github.com/ITCharge/AlgoNote/tree/main/docs/02_linked_list/02_01_linked_list_basic.md) +- [2.2 链表排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/02_linked_list/02_02_linked_list_sort.md) +- [2.3 链表冒泡排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/02_linked_list/02_03_linked_list_bubble_sort.md) +- [2.4 链表选择排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/02_linked_list/02_04_linked_list_selection_sort.md) +- [2.5 链表插入排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/02_linked_list/02_05_linked_list_insertion_sort.md) +- [2.6 链表归并排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/02_linked_list/02_06_linked_list_merge_sort.md) +- [2.7 链表快速排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/02_linked_list/02_07_linked_list_quick_sort.md) +- [2.8 链表计数排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/02_linked_list/02_08_linked_list_counting_sort.md) +- [2.9 链表桶排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/02_linked_list/02_09_linked_list_bucket_sort.md) +- [2.10 链表基数排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/02_linked_list/02_10_linked_list_radix_sort.md) +- [2.11 链表双指针](https://github.com/ITCharge/AlgoNote/tree/main/docs/02_linked_list/02_11_linked_list_two_pointers.md) diff --git a/Contents/03.Stack/01.Stack-Basic/01.Stack-Basic.md b/docs/03_stack_queue_hash_table/03_01_stack_basic.md similarity index 67% rename from Contents/03.Stack/01.Stack-Basic/01.Stack-Basic.md rename to docs/03_stack_queue_hash_table/03_01_stack_basic.md index ae4d37c9..6b081616 100644 --- a/Contents/03.Stack/01.Stack-Basic/01.Stack-Basic.md +++ b/docs/03_stack_queue_hash_table/03_01_stack_basic.md @@ -1,15 +1,15 @@ -## 1. 堆栈简介 +## 1. 栈简介 -> **堆栈（Stack）**：简称为栈。一种线性表数据结构，是一种只允许在表的一端进行插入和删除操作的线性表。 +> **栈（Stack）**：也叫做「堆栈」，是一种线性表数据结构，是一种只允许在表的一端进行插入和删除操作的线性表。 我们把栈中允许插入和删除的一端称为 **「栈顶（top）」**；另一端则称为 **「栈底（bottom）」**。当表中没有任何数据元素时，称之为 **「空栈」**。 -堆栈有两种基本操作：**「插入操作」** 和 **「删除操作」**。 +栈有两种基本操作：**「插入操作」** 和 **「删除操作」**。 - 栈的插入操作又称为「入栈」或者「进栈」。 - 栈的删除操作又称为「出栈」或者「退栈」。 -![堆栈结构](https://qcdn.itcharge.cn/images/202405092243204.png) +![栈结构](https://qcdn.itcharge.cn/images/202405092243204.png) 简单来说，栈是一种 **「后进先出（Last In First Out）」** 的线性表，简称为 **「LIFO 结构」**。 @@ -21,28 +21,28 @@ - 第二个方面是 **「后进先出原则」**。 -根据堆栈的定义，每次删除的总是堆栈中当前的栈顶元素，即最后进入堆栈的元素。而在进栈时，最先进入堆栈的元素一定在栈底，最后进入堆栈的元素一定在栈顶。也就是说，元素进入堆栈或者退出退栈是按照「后进先出（Last In First Out）」的原则进行的。 +根据栈的定义，每次删除的总是栈中当前的栈顶元素，即最后进入栈的元素。而在进栈时，最先进入栈的元素一定在栈底，最后进入栈的元素一定在栈顶。也就是说，元素进入栈或者退出退栈是按照「后进先出（Last In First Out）」的原则进行的。 -## 2. 堆栈的顺序存储与链式存储 +## 2. 栈的顺序存储与链式存储 和线性表类似，栈有两种存储表示方法：**「顺序栈」** 和 **「链式栈」**。 -- **「顺序栈」**：即堆栈的顺序存储结构。利用一组地址连续的存储单元依次存放自栈底到栈顶的元素，同时使用指针 $top$ 指示栈顶元素在顺序栈中的位置。 -- **「链式栈」**：即堆栈的链式存储结构。利用单链表的方式来实现堆栈。栈中元素按照插入顺序依次插入到链表的第一个节点之前，并使用栈顶指针 $top$ 指示栈顶元素，$top$ 永远指向链表的头节点位置。 +- **「顺序栈」**：即栈的顺序存储结构。利用一组地址连续的存储单元依次存放自栈底到栈顶的元素，同时使用指针 $top$ 指示栈顶元素在顺序栈中的位置。 +- **「链式栈」**：即栈的链式存储结构。利用单链表的方式来实现栈。栈中元素按照插入顺序依次插入到链表的第一个节点之前，并使用栈顶指针 $top$ 指示栈顶元素，$top$ 永远指向链表的头节点位置。 -在描述堆栈的顺序存储与链式存储具体实现之前，我们先来看看堆栈具有哪些基本操作。 +在描述栈的顺序存储与链式存储具体实现之前，我们先来看看栈具有哪些基本操作。 -### 2.1 堆栈的基本操作 +### 2.1 栈的基本操作 栈作为一种线性表来说，理论上应该具备线性表所有的操作特性，但由于「后进先出」的特殊性，所以针对栈的操作进行了一些变化。尤其是插入操作和删除操作，改为了入栈（push）和出栈（pop）。 -堆栈的基本操作如下： +栈的基本操作如下： - **初始化空栈**：创建一个空栈，定义栈的大小 $size$，以及栈顶元素指针 $top$。 -- **判断栈是否为空**：当堆栈为空时，返回 $True$。当堆栈不为空时，返回 $False$。一般只用于栈中删除操作和获取当前栈顶元素操作中。 +- **判断栈是否为空**：当栈为空时，返回 $True$。当栈不为空时，返回 $False$。一般只用于栈中删除操作和获取当前栈顶元素操作中。 -- **判断栈是否已满**：当堆栈已满时，返回 $True$，当堆栈未满时，返回 $False$。一般只用于顺序栈中插入元素和获取当前栈顶元素操作中。 +- **判断栈是否已满**：当栈已满时，返回 $True$，当栈未满时，返回 $False$。一般只用于顺序栈中插入元素和获取当前栈顶元素操作中。 - **插入元素（进栈、入栈）**：相当于在线性表最后元素后面插入一个新的数据元素。并改变栈顶指针 $top$ 的指向位置。 @@ -51,24 +51,24 @@ 接下来我们来看一下栈的顺序存储与链式存储两种不同的实现方式。 -### 2.2 堆栈的顺序存储实现 +### 2.2 栈的顺序存储实现 -堆栈最简单的实现方式就是借助于一个数组来描述堆栈的顺序存储结构。在 Python 中我们可以借助列表 $list$ 来实现。这种采用顺序存储结构的堆栈也被称为 **「顺序栈」**。 +栈最简单的实现方式就是借助于一个数组来描述栈的顺序存储结构。在 Python 中我们可以借助列表 $list$ 来实现。这种采用顺序存储结构的栈也被称为 **「顺序栈」**。 -#### 2.2.1 堆栈的顺序存储基本描述 +#### 2.2.1 栈的顺序存储基本描述 -![堆栈的顺序存储](https://qcdn.itcharge.cn/images/202405092243306.png) +![栈的顺序存储](https://qcdn.itcharge.cn/images/202405092243306.png) 我们约定 $self.top$ 指向栈顶元素所在位置。 - **初始化空栈**：使用列表创建一个空栈，定义栈的大小 $self.size$，并令栈顶元素指针 $self.top$ 指向 $-1$，即 $self.top = -1$。 -- **判断栈是否为空**：当 $self.top == -1$ 时，说明堆栈为空，返回 $True$，否则返回 $False$。 -- **判断栈是否已满**：当 $self.top == self.size - 1$，说明堆栈已满，返回 $True$，否则返回返回 $False$。 -- **插入元素（进栈、入栈）**：先判断堆栈是否已满，已满直接抛出异常。如果堆栈未满，则在 $self.stack$ 末尾插入新的数据元素，并令 $self.top$ 向右移动 $1$ 位。 -- **删除元素（出栈、退栈）**：先判断堆栈是否为空，为空直接抛出异常。如果堆栈不为空，则删除 $self.stack$ 末尾的数据元素，并令 $self.top$ 向左移动 $1$ 位。 -- **获取栈顶元素**：先判断堆栈是否为空，为空直接抛出异常。不为空则返回 $self.top$ 指向的栈顶元素，即 $self.stack[self.top]$。 +- **判断栈是否为空**：当 $self.top == -1$ 时，说明栈为空，返回 $True$，否则返回 $False$。 +- **判断栈是否已满**：当 $self.top == self.size - 1$，说明栈已满，返回 $True$，否则返回返回 $False$。 +- **插入元素（进栈、入栈）**：先判断栈是否已满，已满直接抛出异常。如果栈未满，则在 $self.stack$ 末尾插入新的数据元素，并令 $self.top$ 向右移动 $1$ 位。 +- **删除元素（出栈、退栈）**：先判断栈是否为空，为空直接抛出异常。如果栈不为空，则删除 $self.stack$ 末尾的数据元素，并令 $self.top$ 向左移动 $1$ 位。 +- **获取栈顶元素**：先判断栈是否为空，为空直接抛出异常。不为空则返回 $self.top$ 指向的栈顶元素，即 $self.stack[self.top]$。 -#### 2.2.2 堆栈的顺序存储实现代码 +#### 2.2.2 栈的顺序存储实现代码 ```python class Stack: @@ -110,23 +110,23 @@ class Stack: return self.stack[self.top] ``` -### 2.3 堆栈的链式存储实现 +### 2.3 栈的链式存储实现 -堆栈的顺序存储结构保留着顺序存储分配空间的固有缺陷，即在栈满或者其他需要重新调整存储空间时需要移动大量元素。为此，堆栈可以采用链式存储方式来实现。在 Python 中我们通过构造链表节点 $Node$ 的方式来实现。这种采用链式存储结构的堆栈也被称为 **「链式栈」**。 +栈的顺序存储结构保留着顺序存储分配空间的固有缺陷，即在栈满或者其他需要重新调整存储空间时需要移动大量元素。为此，栈可以采用链式存储方式来实现。在 Python 中我们通过构造链表节点 $Node$ 的方式来实现。这种采用链式存储结构的栈也被称为 **「链式栈」**。 -![堆栈的链式存储](https://qcdn.itcharge.cn/images/202405092243367.png) +![栈的链式存储](https://qcdn.itcharge.cn/images/202405092243367.png) -#### 2.3.1 堆栈的链式存储基本描述 +#### 2.3.1 栈的链式存储基本描述 我们约定 $self.top$ 指向栈顶元素所在位置。 - **初始化空栈**：使用列表创建一个空栈，并令栈顶元素指针 $self.top$ 指向 $None$，即 $self.top = None$。 -- **判断栈是否为空**：当 $self.top == None$ 时，说明堆栈为空，返回 $True$，否则返回 $False$。 +- **判断栈是否为空**：当 $self.top == None$ 时，说明栈为空，返回 $True$，否则返回 $False$。 - **插入元素（进栈、入栈）**：创建值为 $value$ 的链表节点，插入到链表头节点之前，并令栈顶指针 $self.top$ 指向新的头节点。 -- **删除元素（出栈、退栈）**：先判断堆栈是否为空，为空直接抛出异常。如果堆栈不为空，则先使用变量 $cur$ 存储当前栈顶指针 $self.top$ 指向的头节点，然后令 $self.top$ 沿着链表移动 $1$ 位，然后再删除之前保存的 $cur$ 节点。 -- **获取栈顶元素**：先判断堆栈是否为空，为空直接抛出异常。不为空则返回 $self.top$ 指向的栈顶节点的值，即 $self.top.value$。 +- **删除元素（出栈、退栈）**：先判断栈是否为空，为空直接抛出异常。如果栈不为空，则先使用变量 $cur$ 存储当前栈顶指针 $self.top$ 指向的头节点，然后令 $self.top$ 沿着链表移动 $1$ 位，然后再删除之前保存的 $cur$ 节点。 +- **获取栈顶元素**：先判断栈是否为空，为空直接抛出异常。不为空则返回 $self.top$ 指向的栈顶节点的值，即 $self.top.value$。 -#### 2.3.2 堆栈的链式存储实现代码 +#### 2.3.2 栈的链式存储实现代码 ```python class Node: @@ -166,13 +166,13 @@ class Stack: return self.top.value ``` -## 3. 堆栈的应用 +## 3. 栈的应用 -堆栈是算法和程序中最常用的辅助结构，其的应用十分广泛。堆栈基本应用于两个方面： +栈是算法和程序中最常用的辅助结构，其的应用十分广泛。栈基本应用于两个方面： -- 使用堆栈可以很方便的保存和取用信息，因此长被用作算法和程序中的辅助存储结构，临时保存信息，供后面操作中使用。 +- 使用栈可以很方便的保存和取用信息，因此长被用作算法和程序中的辅助存储结构，临时保存信息，供后面操作中使用。 - 例如：操作系统中的函数调用栈，浏览器中的前进、后退功能。 -- 堆栈的后进先出规则，可以保证特定的存取顺序。 +- 栈的后进先出规则，可以保证特定的存取顺序。 - 例如：翻转一组元素的顺序、铁路列车车辆调度。 下面我们来讲解一下栈应用的典型例子。 @@ -348,6 +348,17 @@ class Solution: - **时间复杂度**：$O(n)$。 - **空间复杂度**：$O(n)$。 +## 练习题目 + +- [0155. 最小栈](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/min-stack.md) +- [0020. 有效的括号](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/valid-parentheses.md) +- [0227. 基本计算器 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/basic-calculator-ii.md) +- [0150. 逆波兰表达式求值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/evaluate-reverse-polish-notation.md) +- [0394. 字符串解码](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/decode-string.md) +- [0946. 验证栈序列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/validate-stack-sequences.md) + +- [栈基础题目列表](https://github.com/itcharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%A0%88%E5%9F%BA%E7%A1%80%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【书籍】数据结构与算法 Python 语言描述 - 裘宗燕 著 diff --git a/Contents/03.Stack/02.Monotone-Stack/01.Monotone-Stack.md b/docs/03_stack_queue_hash_table/03_02_monotone_stack.md similarity index 96% rename from Contents/03.Stack/02.Monotone-Stack/01.Monotone-Stack.md rename to docs/03_stack_queue_hash_table/03_02_monotone_stack.md index 70699198..4fc4b9be 100644 --- a/Contents/03.Stack/02.Monotone-Stack/01.Monotone-Stack.md +++ b/docs/03_stack_queue_hash_table/03_02_monotone_stack.md @@ -268,6 +268,14 @@ class Solution: - **时间复杂度**：$O(n)$。 - **空间复杂度**：$O(n)$。 +## 练习题目 + +- [0496. 下一个更大元素 I](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/next-greater-element-i.md) +- [0739. 每日温度](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/daily-temperatures.md) +- [0316. 去除重复字母](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/remove-duplicate-letters.md) + +- [单调栈题目列表](https://github.com/itcharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%8D%95%E8%B0%83%E6%A0%88%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【博文】[动画：什么是单调栈？_- 吴师兄学编程](https://www.cxyxiaowu.com/450.html) diff --git a/Contents/04.Queue/01.Queue-Basic/01.Queue-Basic.md b/docs/03_stack_queue_hash_table/03_03_queue_basic.md similarity index 97% rename from Contents/04.Queue/01.Queue-Basic/01.Queue-Basic.md rename to docs/03_stack_queue_hash_table/03_03_queue_basic.md index 7529aa10..ad0f9319 100644 --- a/Contents/04.Queue/01.Queue-Basic/01.Queue-Basic.md +++ b/docs/03_stack_queue_hash_table/03_03_queue_basic.md @@ -327,6 +327,14 @@ class Queue: - 比如说一个带有多终端的计算机系统，当有多个用户需要各自运行各自的程序时，就分别通过终端向操作系统提出占用 CPU 的请求。操作系统通常按照每个请求在时间上的先后顺序将它们排成一个队列，每次把 CPU 分配给队头请求的用户使用；当相应的程序运行结束或用完规定的时间间隔之后，将其退出队列，再把 CPU 分配给新的队头请求的用户使用。这样既能满足多用户的请求，又能使 CPU 正常运行。 - 再比如 Linux 中的环形缓存、高性能队列 Disruptor，都用到了循环并发队列。iOS 多线程中的 GCD、NSOperationQueue 都用到了队列结构。 +## 练习题目 + +- [0622. 设计循环队列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/design-circular-queue.md) +- [0346. 数据流中的移动平均值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/moving-average-from-data-stream.md) +- [0225. 用队列实现栈](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/implement-stack-using-queues.md) + +- [队列基础题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E9%98%9F%E5%88%97%E5%9F%BA%E7%A1%80%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【书籍】数据结构与算法 Python 语言描述 - 裘宗燕 著 diff --git a/Contents/04.Queue/02.Priority-Queue/01.Priority-Queue.md b/docs/03_stack_queue_hash_table/03_04_priority_queue.md similarity index 96% rename from Contents/04.Queue/02.Priority-Queue/01.Priority-Queue.md rename to docs/03_stack_queue_hash_table/03_04_priority_queue.md index e5edcfc6..4a6d48a4 100644 --- a/Contents/04.Queue/02.Priority-Queue/01.Priority-Queue.md +++ b/docs/03_stack_queue_hash_table/03_04_priority_queue.md @@ -391,6 +391,14 @@ class Solution: - **时间复杂度**：$O(n \times \log n)$。 - **空间复杂度**：$O(n)$。 +## 练习题目 + +- [0215. 数组中的第K个最大元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/kth-largest-element-in-an-array.md) +- [0347. 前 K 个高频元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/top-k-frequent-elements.md) +- [0451. 根据字符出现频率排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/sort-characters-by-frequency.md) + +- [优先队列题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E4%BC%98%E5%85%88%E9%98%9F%E5%88%97%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【博文】[浅入浅出数据结构（15）—— 优先队列（堆） - NSpt - 博客园](https://www.cnblogs.com/mm93/p/7481782.html) diff --git a/Contents/06.String/03.String-Multi-Pattern-Matching/04.AC-Automaton-List.md b/docs/03_stack_queue_hash_table/03_05_bidirectional_queue.md similarity index 100% rename from Contents/06.String/03.String-Multi-Pattern-Matching/04.AC-Automaton-List.md rename to docs/03_stack_queue_hash_table/03_05_bidirectional_queue.md diff --git a/Contents/05.Hash-Table/01.Hash-Table.md b/docs/03_stack_queue_hash_table/03_06_hash_table.md similarity index 93% rename from Contents/05.Hash-Table/01.Hash-Table.md rename to docs/03_stack_queue_hash_table/03_06_hash_table.md index d1f3d06f..8bac1355 100644 --- a/Contents/05.Hash-Table/01.Hash-Table.md +++ b/docs/03_stack_queue_hash_table/03_06_hash_table.md @@ -153,6 +153,17 @@ $343246_{13} = 3 \times 13^5 + 4 \times 13^4 + 3 \times 13^3 + 2 \times 13^2 + 4 - 常用的哈希函数方法有：直接定址法、除留余数法、平方取中法、基数转换法、数字分析法、折叠法、随机数法、乘积法、点积法等。 - 常用的哈希冲突的解决方法有两种：开放地址法和链地址法。 +## 练习题目 + +- [0217. 存在重复元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/contains-duplicate.md) +- [0219. 存在重复元素 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/contains-duplicate-ii.md) +- [0036. 有效的数独](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/valid-sudoku.md) +- [0349. 两个数组的交集](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/intersection-of-two-arrays.md) +- [0350. 两个数组的交集 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/intersection-of-two-arrays-ii.md) +- [0706. 设计哈希映射](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/design-hashmap.md) + +- [哈希表题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%93%88%E5%B8%8C%E8%A1%A8%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【博文】[哈希算法及 python 字典的实现 – Tim's Path](https://xiaoxubeii.github.io/articles/hash/) diff --git a/docs/03_stack_queue_hash_table/index.md b/docs/03_stack_queue_hash_table/index.md new file mode 100644 index 00000000..ee936ab3 --- /dev/null +++ b/docs/03_stack_queue_hash_table/index.md @@ -0,0 +1,8 @@ +## 本章内容 + +- [3.1 栈基础](https://github.com/ITCharge/AlgoNote/tree/main/docs/03_stack_queue_hash_table/03_01_stack_basic.md) +- [3.2 单调栈](https://github.com/ITCharge/AlgoNote/tree/main/docs/03_stack_queue_hash_table/03_02_monotone_stack.md) +- [3.3 队列基础](https://github.com/ITCharge/AlgoNote/tree/main/docs/03_stack_queue_hash_table/03_03_queue_basic.md) +- [3.4 优先队列](https://github.com/ITCharge/AlgoNote/tree/main/docs/03_stack_queue_hash_table/03_04_priority_queue.md) +- [3.5 双端队列](https://github.com/ITCharge/AlgoNote/tree/main/docs/03_stack_queue_hash_table/03_05_bidirectional_queue.md) +- [3.6 哈希表](https://github.com/ITCharge/AlgoNote/tree/main/docs/03_stack_queue_hash_table/03_06_hash_table.md) \ No newline at end of file diff --git a/Contents/06.String/01.String-Basic/01.String-Basic.md b/docs/04_string/04_01_string_basic.md similarity index 96% rename from Contents/06.String/01.String-Basic/01.String-Basic.md rename to docs/04_string/04_01_string_basic.md index ea4b95d2..6a50e756 100644 --- a/Contents/06.String/01.String-Basic/01.String-Basic.md +++ b/docs/04_string/04_01_string_basic.md @@ -179,6 +179,15 @@ ASCII 编码可以解决以英语为主的语言，可是无法满足中文编 所以学习多模式匹配算法，重点是要掌握 **「字典树」** 和 **「AC 自动机算法」** 。 +## 练习题目 + +- [0125. 验证回文串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/valid-palindrome.md) +- [0344. 反转字符串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/reverse-string.md) +- [0557. 反转字符串中的单词 III](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/reverse-words-in-a-string-iii.md) + + +- [字符串基础题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%9F%BA%E7%A1%80%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【书籍】数据结构（C 语言版）- 严蔚敏 著 diff --git a/docs/04_string/04_02_string_single_pattern_matching.md b/docs/04_string/04_02_string_single_pattern_matching.md new file mode 100644 index 00000000..050b313b --- /dev/null +++ b/docs/04_string/04_02_string_single_pattern_matching.md @@ -0,0 +1,143 @@ +## 1. 单模式串匹配概述 + +> **单模式串匹配**：是指在文本串 $T$ 中查找一个模式串 $p$ 的所有出现位置的问题。这是字符串匹配中最基础、最经典的问题。 +> +> - **问题定义**：给定一个长度为 $n$ 的文本串 $T$ 和一个长度为 $m$ 的模式串 $p$，找出模式串 $p$ 在文本串 $T$ 中所有出现的位置。 + +### 1.1 问题描述 + +单模式串匹配问题是字符串匹配的基础问题，其形式化定义如下： + +- **输入**：文本串 $T = T[0...n-1]$，模式串 $p = p[0...m-1]$ +- **输出**：所有满足 $T[i...i+m-1] = p[0...m-1]$ 的位置 $i$ +- **目标**：高效地找到所有匹配位置 + +### 1.2 应用场景 + +单模式串匹配在计算机科学和实际应用中有广泛的应用： + +- **文本编辑器**：查找和替换功能 +- **生物信息学**：DNA序列匹配 +- **网络安全**：入侵检测系统中的模式识别 +- **数据挖掘**：文本挖掘和信息检索 +- **编译原理**：词法分析中的关键字识别 + +## 2. 单模式串匹配算法分类 + +根据算法的核心思想和复杂度，单模式串匹配算法可以分为以下几类： + +### 2.1 朴素算法 + +**Brute Force 算法（暴力匹配算法）** +- **时间复杂度**：$O(n \times m)$ +- **空间复杂度**：$O(1)$ +- **特点**：简单直观，但效率较低 +- **适用场景**：模式串较短或对性能要求不高的场景 + +### 2.2 基于哈希的算法 + +**Rabin Karp 算法** +- **时间复杂度**：平均 $O(n + m)$，最坏 $O(n \times m)$ +- **空间复杂度**：$O(1)$ +- **特点**：使用滚动哈希，平均性能较好 +- **适用场景**：需要处理多个模式串或对哈希冲突不敏感的场景 + +### 2.3 基于有限状态机的算法 + +**KMP 算法（Knuth-Morris-Pratt 算法）** +- **时间复杂度**：$O(n + m)$ +- **空间复杂度**：$O(m)$ +- **特点**：利用失配信息避免重复比较 +- **适用场景**：对性能要求较高的场景 + +### 2.4 基于启发式规则的算法 + +**Boyer Moore 算法** +- **时间复杂度**：平均 $O(n/m)$，最坏 $O(n \times m)$ +- **空间复杂度**：$O(k)$（$k$ 为字符集大小） +- **特点**：从右到左比较，跳跃能力强 +- **适用场景**：模式串较长，字符集较小的场景 + +**Horspool 算法** +- **时间复杂度**：平均 $O(n)$，最坏 $O(n \times m)$ +- **空间复杂度**：$O(k)$ +- **特点**：BM算法的简化版本，实现简单 +- **适用场景**：需要简单实现的场景 + +**Sunday 算法** +- **时间复杂度**：平均 $O(n)$，最坏 $O(n \times m)$ +- **空间复杂度**：$O(k)$ +- **特点**：从左到右比较，跳跃能力强 +- **适用场景**：需要从左到右匹配的场景 + +## 3. 算法复杂度对比 + +| 算法 | 预处理时间 | 匹配时间 | 空间复杂度 | 特点 | +|------|------------|----------|------------|------| +| Brute Force | $O(1)$ | $O(n \times m)$ | $O(1)$ | 简单直观 | +| Rabin Karp | $O(m)$ | 平均 $O(n)$，最坏 $O(n \times m)$ | $O(1)$ | 滚动哈希 | +| KMP | $O(m)$ | $O(n)$ | $O(m)$ | 失配信息 | +| Boyer Moore | $O(m + k)$ | 平均 $O(n/m)$，最坏 $O(n \times m)$ | $O(k)$ | 启发式跳跃 | +| Horspool | $O(m + k)$ | 平均 $O(n)$，最坏 $O(n \times m)$ | $O(k)$ | BM简化版 | +| Sunday | $O(m + k)$ | 平均 $O(n)$，最坏 $O(n \times m)$ | $O(k)$ | 从左到右 | + +## 4. 算法选择策略 + +### 4.1 根据应用场景选择 + +- **简单应用**：选择 Brute Force 算法，代码简单，易于理解和维护 +- **一般应用**：选择 KMP 算法，性能稳定，实现相对简单 +- **高性能应用**：选择 Boyer Moore 算法，平均性能最优 +- **多模式串应用**：选择 Rabin Karp 算法，易于扩展到多模式串 + +### 4.2 根据数据特征选择 + +- **模式串较短（$m < 10$）**：Brute Force 算法足够 +- **模式串较长（$m > 50$）**：Boyer Moore 算法优势明显 +- **字符集较小**：Boyer Moore、Horspool、Sunday 算法效果好 +- **字符集较大**：KMP 算法更稳定 + +### 4.3 根据实现复杂度选择 + +- **快速原型**：Brute Force 或 Horspool 算法 +- **生产环境**：KMP 或 Boyer Moore 算法 +- **教学演示**：Brute Force 或 KMP 算法 + +## 5. 实际应用中的考虑 + +### 5.1 内存使用 + +- **嵌入式系统**：选择空间复杂度低的算法 +- **大规模文本处理**：考虑算法的缓存友好性 + +### 5.2 预处理开销 + +- **一次性匹配**：预处理开销相对不重要 +- **多次匹配**：预处理开销分摊后影响较小 + +### 5.3 字符集特性 + +- **ASCII 字符**：所有算法都适用 +- **Unicode 字符**：需要考虑字符编码问题 +- **二进制数据**：需要特殊处理 + +## 6. 总结 + +单模式串匹配是字符串算法的基础问题，不同的算法各有优缺点： + +- **Brute Force**：最简单，适合学习和简单应用 +- **Rabin Karp**：适合多模式串和哈希应用 +- **KMP**：理论最优，实际应用广泛 +- **Boyer Moore**：平均性能最优，适合长模式串 +- **Horspool/Sunday**：BM的简化版本，实现简单 + +## 练习题目 + +- [单模式串匹配题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%8D%95%E6%A8%A1%E5%BC%8F%E4%B8%B2%E5%8C%B9%E9%85%8D%E9%A2%98%E7%9B%AE) + +## 参考资料 + +- 【书籍】算法导论 - Thomas H. Cormen 等著 +- 【书籍】柔性字符串匹配 - 中科院计算所网络信息安全研究组 译 +- 【文章】[字符串匹配基础（上）- 数据结构与算法之美 - 极客时间](https://time.geekbang.org/column/article/71187) +- 【文章】[字符串匹配算法总结 - 阮一峰的网络日志](http://www.ruanyifeng.com/blog/2013/05/boyer-moore_string_search_algorithm.html) diff --git a/Contents/06.String/02.String-Single-Pattern-Matching/01.String-Brute-Force.md b/docs/04_string/04_03_string_brute_force.md similarity index 76% rename from Contents/06.String/02.String-Single-Pattern-Matching/01.String-Brute-Force.md rename to docs/04_string/04_03_string_brute_force.md index bdabf56f..d90bd989 100644 --- a/Contents/06.String/02.String-Single-Pattern-Matching/01.String-Brute-Force.md +++ b/docs/04_string/04_03_string_brute_force.md @@ -43,7 +43,18 @@ BF 算法非常简单，容易理解，但其效率很低。主要是因为在 在最理想的情况下（第一次匹配直接匹配成功），BF 算法的最佳时间复杂度是 $O(m)$。 -在一般情况下，根据等概率原则，平均搜索次数为 $\frac{(n + m)}{2}$，所以 Brute Force 算法的平均时间复杂度为 $O(n + m)$。 +在一般情况下，根据等概率原则，平均搜索次数为 $\frac{(n + m)}{2}$，所以 Brute Force 算法的平均时间复杂度为 $O(n \times m)$。 + +## 练习题目 + +- [0028. 找出字符串中第一个匹配项的下标](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/find-the-index-of-the-first-occurrence-in-a-string.md) +- [0459. 重复的子字符串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/repeated-substring-pattern.md) +- [0686. 重复叠加字符串匹配](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/repeated-string-match.md) +- [0796. 旋转字符串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/rotate-string.md) +- [1408. 数组中的字符串匹配](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/string-matching-in-an-array.md) +- [2156. 查找给定哈希值的子串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2100-2199/find-substring-with-given-hash-value.md) + +- [单模式串匹配题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%8D%95%E6%A8%A1%E5%BC%8F%E4%B8%B2%E5%8C%B9%E9%85%8D%E9%A2%98%E7%9B%AE) ## 参考资料 diff --git a/Contents/06.String/02.String-Single-Pattern-Matching/02.String-Rabin-Karp.md b/docs/04_string/04_04_string_rabin_karp.md similarity index 87% rename from Contents/06.String/02.String-Single-Pattern-Matching/02.String-Rabin-Karp.md rename to docs/04_string/04_04_string_rabin_karp.md index 9df54f97..f7cbf381 100644 --- a/Contents/06.String/02.String-Single-Pattern-Matching/02.String-Rabin-Karp.md +++ b/docs/04_string/04_04_string_rabin_karp.md @@ -96,6 +96,17 @@ RK 算法可以看做是 BF 算法的一种改进。在 BF 算法中，每一个 但是如果存在冲突的情况下，算法的效率会降低。最坏情况是每一次比较模式串的哈希值和子串的哈希值时都相等，但是每一次都会出现冲突，那么每一次都需要验证模式串和子串每个字符是否完全相同，那么总的比较次数就是 $m \times (n - m + 1)$，时间复杂度就会退化为 $O(m \times n)$。 +## 练习题目 + +- [0028. 找出字符串中第一个匹配项的下标](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/find-the-index-of-the-first-occurrence-in-a-string.md) +- [0459. 重复的子字符串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/repeated-substring-pattern.md) +- [0686. 重复叠加字符串匹配](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/repeated-string-match.md) +- [0796. 旋转字符串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/rotate-string.md) +- [1408. 数组中的字符串匹配](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/string-matching-in-an-array.md) +- [2156. 查找给定哈希值的子串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2100-2199/find-substring-with-given-hash-value.md) + +- [单模式串匹配题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%8D%95%E6%A8%A1%E5%BC%8F%E4%B8%B2%E5%8C%B9%E9%85%8D%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【书籍】数据结构与算法 Python 语言描述 - 裘宗燕 著 diff --git a/Contents/06.String/02.String-Single-Pattern-Matching/03.String-KMP.md b/docs/04_string/04_05_string_kmp.md similarity index 91% rename from Contents/06.String/02.String-Single-Pattern-Matching/03.String-KMP.md rename to docs/04_string/04_05_string_kmp.md index 56b3bf3e..cfc3f9c9 100644 --- a/Contents/06.String/02.String-Single-Pattern-Matching/03.String-KMP.md +++ b/docs/04_string/04_05_string_kmp.md @@ -144,6 +144,17 @@ print(kmp("ababbbbaaabbbaaa", "bbbb")) - KMP 算法在匹配阶段，是根据前缀表不断调整匹配的位置，文本串的下标 $i$ 并没有进行回退，可以看出匹配阶段的时间复杂度是 $O(n)$，其中 $n$ 是文本串 $T$ 的长度。 - 所以 KMP 整个算法的时间复杂度是 $O(n + m)$，相对于朴素匹配算法的 $O(n \times m)$ 的时间复杂度，KMP 算法的效率有了很大的提升。 +## 练习题目 + +- [0028. 找出字符串中第一个匹配项的下标](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/find-the-index-of-the-first-occurrence-in-a-string.md) +- [0459. 重复的子字符串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/repeated-substring-pattern.md) +- [0686. 重复叠加字符串匹配](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/repeated-string-match.md) +- [0796. 旋转字符串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/rotate-string.md) +- [1408. 数组中的字符串匹配](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/string-matching-in-an-array.md) +- [2156. 查找给定哈希值的子串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2100-2199/find-substring-with-given-hash-value.md) + +- [单模式串匹配题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%8D%95%E6%A8%A1%E5%BC%8F%E4%B8%B2%E5%8C%B9%E9%85%8D%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【书籍】柔性字符串匹配 - 中科院计算所网络信息安全研究组 译 diff --git a/Contents/06.String/02.String-Single-Pattern-Matching/04.String-Boyer-Moore.md b/docs/04_string/04_06_string_boyer_moore.md similarity index 95% rename from Contents/06.String/02.String-Single-Pattern-Matching/04.String-Boyer-Moore.md rename to docs/04_string/04_06_string_boyer_moore.md index d12149b9..4588486a 100644 --- a/Contents/06.String/02.String-Single-Pattern-Matching/04.String-Boyer-Moore.md +++ b/docs/04_string/04_06_string_boyer_moore.md @@ -323,6 +323,17 @@ print(boyerMoore("", "")) - BM 算法在搜索阶段最差情况是文本串 $T$ 中有多个重复的字符，并且模式串 $p$ 中有 $m - 1$ 个相同字符前加一个不同的字符组成。这时的时间复杂度为 $O(m * n)$。 - 当模式串 $p$ 是非周期性的，在最坏情况下，BM 算法最多需要进行 $3 * n$ 次字符比较操作。 +## 练习题目 + +- [0028. 找出字符串中第一个匹配项的下标](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/find-the-index-of-the-first-occurrence-in-a-string.md) +- [0459. 重复的子字符串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/repeated-substring-pattern.md) +- [0686. 重复叠加字符串匹配](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/repeated-string-match.md) +- [0796. 旋转字符串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/rotate-string.md) +- [1408. 数组中的字符串匹配](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/string-matching-in-an-array.md) +- [2156. 查找给定哈希值的子串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2100-2199/find-substring-with-given-hash-value.md) + +- [单模式串匹配题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%8D%95%E6%A8%A1%E5%BC%8F%E4%B8%B2%E5%8C%B9%E9%85%8D%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【书籍】柔性字符串匹配 - 中科院计算所网络信息安全研究组 译 diff --git a/Contents/06.String/02.String-Single-Pattern-Matching/05.String-Horspool.md b/docs/04_string/04_07_string_horspool.md similarity index 84% rename from Contents/06.String/02.String-Single-Pattern-Matching/05.String-Horspool.md rename to docs/04_string/04_07_string_horspool.md index fa272ee8..33554449 100644 --- a/Contents/06.String/02.String-Single-Pattern-Matching/05.String-Horspool.md +++ b/docs/04_string/04_07_string_horspool.md @@ -96,6 +96,17 @@ print(horspool("abbcfdddbddcaddebc", "bcf")) - Horspool 算法在平均情况下的时间复杂度为 $O(n)$，但是在最坏情况下时间复杂度会退化为 $O(n * m)$。 +## 练习题目 + +- [0028. 找出字符串中第一个匹配项的下标](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/find-the-index-of-the-first-occurrence-in-a-string.md) +- [0459. 重复的子字符串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/repeated-substring-pattern.md) +- [0686. 重复叠加字符串匹配](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/repeated-string-match.md) +- [0796. 旋转字符串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/rotate-string.md) +- [1408. 数组中的字符串匹配](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/string-matching-in-an-array.md) +- [2156. 查找给定哈希值的子串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2100-2199/find-substring-with-given-hash-value.md) + +- [单模式串匹配题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%8D%95%E6%A8%A1%E5%BC%8F%E4%B8%B2%E5%8C%B9%E9%85%8D%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【书籍】柔性字符串匹配 - 中科院计算所网络信息安全研究组 译 diff --git a/Contents/06.String/02.String-Single-Pattern-Matching/06.String-Sunday.md b/docs/04_string/04_08_string_sunday.md similarity index 85% rename from Contents/06.String/02.String-Single-Pattern-Matching/06.String-Sunday.md rename to docs/04_string/04_08_string_sunday.md index 984b72c8..0bb79d8d 100644 --- a/Contents/06.String/02.String-Single-Pattern-Matching/06.String-Sunday.md +++ b/docs/04_string/04_08_string_sunday.md @@ -101,3 +101,14 @@ print(sunday("abbcfdddbddcaddebc", "bcf")) - 【书籍】柔性字符串匹配 - 中科院计算所网络信息安全研究组 译 - 【博文】[字符串模式匹配算法：BM、Horspool、Sunday、KMP、KR、AC算法 - schips - 博客园](https://www.cnblogs.com/schips/p/11098041.html) - 【博文】[字符串匹配——Sunday 算法 - Switch 的博客 - CSDN 博客](https://blog.csdn.net/q547550831/article/details/51860017) + +## 练习题目 + +- [0028. 找出字符串中第一个匹配项的下标](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/find-the-index-of-the-first-occurrence-in-a-string.md) +- [0459. 重复的子字符串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/repeated-substring-pattern.md) +- [0686. 重复叠加字符串匹配](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/repeated-string-match.md) +- [0796. 旋转字符串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/rotate-string.md) +- [1408. 数组中的字符串匹配](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/string-matching-in-an-array.md) +- [2156. 查找给定哈希值的子串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2100-2199/find-substring-with-given-hash-value.md) + +- [单模式串匹配题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%8D%95%E6%A8%A1%E5%BC%8F%E4%B8%B2%E5%8C%B9%E9%85%8D%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/docs/04_string/04_09_string_multi_pattern_matching.md b/docs/04_string/04_09_string_multi_pattern_matching.md new file mode 100644 index 00000000..943a9cf6 --- /dev/null +++ b/docs/04_string/04_09_string_multi_pattern_matching.md @@ -0,0 +1,62 @@ +# 多模式串匹配 + +## 1. 多模式串匹配的定义 + +多模式串匹配（Multiple Pattern Matching）是指在文本串中同时查找多个模式串的问题。与单模式串匹配（如 KMP 算法）不同，多模式串匹配需要在一个文本串中同时查找多个模式串的所有出现位置。 + +## 2. 主要算法介绍 + +### 2.1 字典树（Trie） + +字典树是一种树形数据结构，用于高效地存储和检索字符串集合。它的主要特点是： + +- 每个节点代表一个字符 +- 从根节点到某个节点的路径上的字符连接起来，就是该节点对应的字符串 +- 每个节点的所有子节点包含的字符都不相同 + +字典树的主要应用： +- 字符串检索 +- 词频统计 +- 字符串排序 +- 前缀匹配 + +### 2.2 AC 自动机（Aho-Corasick） + +AC 自动机是在字典树的基础上，结合了 KMP 算法的思想，用于多模式串匹配的算法。它的主要特点是： + +- 基于字典树构建 +- 添加了失败指针（fail pointer），类似于 KMP 的 next 数组 +- 可以同时匹配多个模式串 +- 时间复杂度为 O(n + k)，其中 n 是文本串长度，k 是所有模式串的总长度 + +AC 自动机的主要应用： +- 敏感词过滤 +- 病毒特征码匹配 +- 文本分析 + +### 2.3 后缀数组（Suffix Array） + +后缀数组是一种数据结构，用于高效地处理字符串的后缀。它的主要特点是： + +- 将字符串的所有后缀按字典序排序 +- 可以快速查找子串 +- 支持最长公共前缀（LCP）查询 + +后缀数组的主要应用： +- 字符串匹配 +- 最长重复子串 +- 最长公共子串 +- 字符串压缩 + +## 3. 算法比较 + +| 算法 | 预处理时间复杂度 | 匹配时间复杂度 | 空间复杂度 | 适用场景 | +|------|----------------|--------------|------------|----------| +| 字典树 | O(k) | O(m) | O(k) | 前缀匹配、字符串集合操作 | +| AC 自动机 | O(k) | O(n + k) | O(k) | 多模式串精确匹配 | +| 后缀数组 | O(n log n) | O(m + log n) | O(n) | 子串匹配、后缀操作 | + +其中： +- n 为文本串长度 +- m 为模式串长度 +- k 为所有模式串的总长度 diff --git a/Contents/06.String/03.String-Multi-Pattern-Matching/01.Trie.md b/docs/04_string/04_10_trie.md similarity index 93% rename from Contents/06.String/03.String-Multi-Pattern-Matching/01.Trie.md rename to docs/04_string/04_10_trie.md index fd1ecfa0..9ef8e618 100644 --- a/Contents/06.String/03.String-Multi-Pattern-Matching/01.Trie.md +++ b/docs/04_string/04_10_trie.md @@ -212,6 +212,17 @@ class Trie: # 字典树 - **最长公共前缀问题**：利用字典树求解多个字符串的最长公共前缀问题。将⼤量字符串都存储到⼀棵字典树上时， 可以快速得到某些字符串的公共前缀。对所有字符串都建⽴字典树，两个串的最长公共前缀的长度就是它们所在节点最近公共祖先的长度，于是转变为最近公共祖先问题。 - **字符串排序**：利⽤字典树进⾏串排序。例如，给定多个互不相同的仅由⼀个单词构成的英⽂名，将它们按字典序从⼩到⼤输出。采⽤数组⽅式创建字典树，字典树中每个节点的所有⼦节点都是按照其字母⼤⼩排序的。然后对字典树进⾏先序遍历，输出的相应字符串就是按字典序排序的结果。 +## 练习题目 + +- [0208. 实现 Trie (前缀树)](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/implement-trie-prefix-tree.md) +- [0677. 键值映射](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/map-sum-pairs.md) +- [1023. 驼峰式匹配](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/camelcase-matching.md) +- [0211. 添加与搜索单词 - 数据结构设计](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/design-add-and-search-words-data-structure.md) +- [0648. 单词替换](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/replace-words.md) +- [0676. 实现一个魔法字典](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/implement-magic-dictionary.md) + +- [字典树题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%AD%97%E5%85%B8%E6%A0%91%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【书籍】算法训练营 陈小玉 著 diff --git a/docs/04_string/04_11_ac_automaton.md b/docs/04_string/04_11_ac_automaton.md new file mode 100644 index 00000000..fd2d3550 --- /dev/null +++ b/docs/04_string/04_11_ac_automaton.md @@ -0,0 +1,136 @@ +## 1. AC 自动机简介 + +> **AC 自动机（Aho-Corasick Automaton）**：该算法在 1975 年产生于贝尔实验室，是最著名的多模式匹配算法之一。简单来说，AC 自动机是以 **字典树（Trie）** 的结构为基础，结合 **KMP 算法思想** 建立的。 + +AC 自动机的构造有 3 个步骤： + +1. 构造一棵字典树（Trie），作为 AC 自动机的搜索数据结构。 +2. 利用 KMP 算法思想，构造失配指针。使得当前字符失配时可以通过失配指针跳转到具有最长公共前后缀的字符位置上继续匹配。 +3. 扫描文本串进行匹配。 + +## 2. AC 自动机原理 + +接下来我们以一个例子来说明一下 AC 自动机的原理。 + +> 描述：给定 5 个单词，分别是 `say`、`she`、`shr`、`he`、`her`，再给定一个文本串 `yasherhs`。 +> +> 要求：计算出有多少个单词在文本串中出现过。 + +### 2.1 构造一棵字典树（Trie） + +首先我们需要建立一棵字典树。字典树是一种树形数据结构，用于高效地存储和检索字符串集合。每个节点代表一个字符，从根节点到某个节点的路径上的字符连接起来，就是该节点对应的字符串。 + +对于给定的 5 个单词，构造的字典树如下： + +``` + root + / \ + s h + / \ | + a h e + / / \ \ + y e r r +``` + +### 2.2 构造失配指针 + +失配指针（fail pointer）是 AC 自动机的核心。当在字典树中匹配失败时，失配指针指向另一个节点，该节点对应的字符串是当前节点对应字符串的最长后缀。 + +失配指针的构造过程： +1. 根节点的失配指针指向空 +2. 对于每个节点，其失配指针指向其父节点的失配指针指向的节点的对应子节点 +3. 如果对应子节点不存在，则继续沿着失配指针向上查找 + +### 2.3 扫描文本串 + +扫描文本串的过程： +1. 从根节点开始，按照文本串的字符顺序在字典树中移动 +2. 如果当前字符匹配成功，继续移动到下一个字符 +3. 如果当前字符匹配失败，通过失配指针跳转到另一个节点继续匹配 +4. 当到达某个单词的结束节点时，说明找到了一个匹配的单词 + +## 3. AC 自动机的应用 + +AC 自动机在以下场景中有着广泛的应用： + +1. **多模式字符串匹配**：在文本中查找多个模式串 +2. **敏感词过滤**：检测文本中是否包含敏感词 +3. **DNA序列分析**：在生物信息学中用于DNA序列的模式匹配 +4. **网络入侵检测**：检测网络数据包中的恶意模式 +5. **拼写检查**：检查文本中的拼写错误 + +## 4. AC 自动机的实现 + +### 4.1 时间复杂度 + +- 构建字典树：O(Σ|P|)，其中 P 是所有模式串的集合 +- 构建失配指针：O(Σ|P|) +- 文本串匹配：O(n + k)，其中 n 是文本串长度，k 是匹配的模式串数量 + +### 4.2 空间复杂度 + +- O(Σ|P|)，其中 Σ 是字符集大小 + +## 5. 代码实现 + +```python +class TrieNode: + def __init__(self): + self.children = {} # 子节点 + self.fail = None # 失配指针 + self.is_end = False # 是否是单词结尾 + self.word = "" # 存储完整的单词 + +class AC_Automaton: + def __init__(self): + self.root = TrieNode() + + def add_word(self, word): + node = self.root + for char in word: + if char not in node.children: + node.children[char] = TrieNode() + node = node.children[char] + node.is_end = True + node.word = word + + def build_fail_pointers(self): + queue = [] + # 将根节点的子节点的失配指针指向根节点 + for char, node in self.root.children.items(): + node.fail = self.root + queue.append(node) + + # 广度优先搜索构建失配指针 + while queue: + current = queue.pop(0) + for char, child in current.children.items(): + fail = current.fail + while fail and char not in fail.children: + fail = fail.fail + child.fail = fail.children[char] if fail else self.root + queue.append(child) + + def search(self, text): + result = [] + current = self.root + + for char in text: + while current is not self.root and char not in current.children: + current = current.fail + if char in current.children: + current = current.children[char] + + # 检查当前节点是否是某个单词的结尾 + temp = current + while temp is not self.root: + if temp.is_end: + result.append(temp.word) + temp = temp.fail + + return result +``` + +## 6. 总结 + +AC 自动机是一种高效的多模式匹配算法，它通过结合字典树和 KMP 算法的思想，实现了在文本串中快速查找多个模式串的功能。虽然其实现相对复杂，但在需要多模式匹配的场景下，AC 自动机提供了最优的时间复杂度。 \ No newline at end of file diff --git a/docs/04_string/04_12_suffix_array.md b/docs/04_string/04_12_suffix_array.md new file mode 100644 index 00000000..71b35211 --- /dev/null +++ b/docs/04_string/04_12_suffix_array.md @@ -0,0 +1,136 @@ +## 1. 后缀数组简介 + +> **后缀数组（Suffix Array）**：是一种高效处理字符串后缀相关问题的数据结构。它将字符串的所有后缀按字典序排序，并记录每个后缀在原串中的起始位置，便于实现高效的子串查找、最长重复子串、最长公共子串等操作。 + +后缀数组常与 **LCP（Longest Common Prefix）数组** 配合使用，进一步提升字符串处理的效率。 + +--- + +## 2. 基本原理与定义 + +给定一个长度为 $n$ 的字符串 $S$，其后缀数组 $SA$ 是一个长度为 $n$ 的整数数组，$SA[i]$ 表示 $S$ 的第 $i$ 小后缀在原串中的起始下标。 + +例如： + +> $S = "banana"$ +> +> $S$ 的所有后缀及其下标： +> - 0: banana +> - 1: anana +> - 2: nana +> - 3: ana +> - 4: na +> - 5: a +> +> 按字典序排序后： +> 1. a (5) +> 2. ana (3) +> 3. anana (1) +> 4. banana (0) +> 5. na (4) +> 6. nana (2) +> +> 所以 $SA = [5, 3, 1, 0, 4, 2]$ + +--- + +## 3. 后缀数组的构建方法 + +后缀数组的构建有多种方法，常见的有： + +- **朴素排序法**：直接生成所有后缀并排序，时间复杂度 $O(n^2 \log n)$，适合短串。 +- **倍增算法**：利用基数排序思想，时间复杂度 $O(n \log n)$。 +- **DC3/Skew 算法**：线性时间 $O(n)$ 构建，适合大数据量。 + +### 3.1 朴素法（适合理解原理） + +```python +# 朴素法构建后缀数组 +S = "banana" +suffixes = [(S[i:], i) for i in range(len(S))] +suffixes.sort() +SA = [idx for (suf, idx) in suffixes] +print(SA) # 输出: [5, 3, 1, 0, 4, 2] +``` + +### 3.2 倍增算法（常用高效实现） + +```python +def build_suffix_array(s): + n = len(s) + k = 1 + rank = [ord(c) for c in s] + tmp = [0] * n + sa = list(range(n)) + while True: + sa.sort(key=lambda x: (rank[x], rank[x + k] if x + k < n else -1)) + tmp[sa[0]] = 0 + for i in range(1, n): + tmp[sa[i]] = tmp[sa[i-1]] + \ + ((rank[sa[i]] != rank[sa[i-1]]) or + (rank[sa[i]+k] if sa[i]+k < n else -1) != (rank[sa[i-1]+k] if sa[i-1]+k < n else -1)) + rank = tmp[:] + if rank[sa[-1]] == n-1: + break + k <<= 1 + return sa + +# 示例 +S = "banana" +print(build_suffix_array(S)) # 输出: [5, 3, 1, 0, 4, 2] +``` + +--- + +## 4. LCP（最长公共前缀）数组 + +> **LCP 数组**：LCP[i] 表示 $SA[i]$ 和 $SA[i-1]$ 所指向的两个后缀的最长公共前缀长度。 + +LCP 数组常用于： +- 快速查找最长重复子串 +- 计算不同子串个数 +- 字符串压缩等 + +### LCP 数组的构建 + +```python +def build_lcp(s, sa): + n = len(s) + rank = [0] * n + for i in range(n): + rank[sa[i]] = i + h = 0 + lcp = [0] * n + for i in range(n): + if rank[i] == 0: + lcp[0] = 0 + else: + j = sa[rank[i] - 1] + while i + h < n and j + h < n and s[i + h] == s[j + h]: + h += 1 + lcp[rank[i]] = h + if h > 0: + h -= 1 + return lcp + +# 示例 +S = "banana" +SA = build_suffix_array(S) +LCP = build_lcp(S, SA) +print(LCP) # 输出: [0, 1, 3, 0, 0, 2] +``` + +## 5. 算法复杂度分析 + +- **朴素法**：$O(n^2 \log n)$ +- **倍增法**：$O(n \log n)$ +- **DC3/Skew**：$O(n)$ +- **LCP 构建**：$O(n)$ + +## 参考资料 + +- 《算法竞赛进阶指南》—— 胡策 +- 《算法竞赛入门经典》—— 刘汝佳 +- [OI Wiki - 后缀数组](https://oi-wiki.org/string/sa/) + + diff --git a/docs/04_string/index.md b/docs/04_string/index.md new file mode 100644 index 00000000..831e5155 --- /dev/null +++ b/docs/04_string/index.md @@ -0,0 +1,14 @@ +## 本章内容 + +- [4.1 字符串基础](https://github.com/ITCharge/AlgoNote/tree/main/docs/04_string/04_01_string_basic.md) +- [4.2 单模式串匹配](https://github.com/ITCharge/AlgoNote/tree/main/docs/04_string/04_02_string_single_pattern_matching.md) +- [4.3 Brute Force 算法](https://github.com/ITCharge/AlgoNote/tree/main/docs/04_string/04_03_string_brute_force.md) +- [4.4 Rabin Karp 算法](https://github.com/ITCharge/AlgoNote/tree/main/docs/04_string/04_04_string_rabin_karp.md) +- [4.5 KMP 算法](https://github.com/ITCharge/AlgoNote/tree/main/docs/04_string/04_05_string_kmp.md) +- [4.6 Boyer Moore 算法](https://github.com/ITCharge/AlgoNote/tree/main/docs/04_string/04_06_string_boyer_moore.md) +- [4.7 Horspool 算法](https://github.com/ITCharge/AlgoNote/tree/main/docs/04_string/04_07_string_horspool.md) +- [4.8 Sunday 算法](https://github.com/ITCharge/AlgoNote/tree/main/docs/04_string/04_08_string_sunday.md) +- [4.9 多模式串匹配](https://github.com/ITCharge/AlgoNote/tree/main/docs/04_string/04_09_string_multi_pattern_matching.md) +- [4.10 字典树](https://github.com/ITCharge/AlgoNote/tree/main/docs/04_string/04_10_trie.md) +- [4.11 AC 自动机](https://github.com/ITCharge/AlgoNote/tree/main/docs/04_string/04_11_ac_automaton.md) +- [4.12 后缀数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/04_string/04_12_suffix_array.md) diff --git a/Contents/07.Tree/01.Binary-Tree/01.Binary-Tree-Basic.md b/docs/05_tree/05_01_tree_basic.md similarity index 98% rename from Contents/07.Tree/01.Binary-Tree/01.Binary-Tree-Basic.md rename to docs/05_tree/05_01_tree_basic.md index 982c2f06..25235fc8 100644 --- a/Contents/07.Tree/01.Binary-Tree/01.Binary-Tree-Basic.md +++ b/docs/05_tree/05_01_tree_basic.md @@ -11,7 +11,7 @@ 「树」具有以下的特点： - 有且仅有一个节点没有前驱节点，该节点被称为树的 **「根节点（Root）」** 。 -- 除了根节点以之，每个节点有且仅有一个直接前驱节点。 +- 除了根节点以外，每个节点有且仅有一个直接前驱节点。 - 包括根节点在内，每个节点可以有多个后继节点。 - 当 $n > 1$ 时，除了根节点之外的其他节点，可分为 $m(m > 0)$ 个互不相交的有限集合 $T_1, T_2, ..., T_m$，其中每一个集合本身又是一棵树，并且被称为根的 **「子树（SubTree）」**。 @@ -118,7 +118,7 @@ - 叶子节点只能出现在最下面两层。 - 最下层的叶子节点一定集中在该层最左边的位置上。 - 倒数第二层如果有叶子节点，则该层的叶子节点一定集中在右边的位置上。 -- 如果节点的度为 $1$，则该节点只偶遇左孩子节点，即不存在只有右子树的情况。 +- 如果节点的度为 $1$，则该节点只有左孩子节点，即不存在只有右孩子节点的情况。 - 同等节点数的二叉树中，完全二叉树的深度最小。 完全二叉树也可以使用类似满二叉树的节点编号的方式来定义。即从根节点编号为 $1$ 开始，按照层次从上至下，每一层从左至右进行编号。对于深度为 $i$ 且有 $n$ 个节点的二叉树，当且仅当每一个节点都与深度为 $k$ 的满二叉树中编号从 $1$ 至 $n$ 的节点意义对应时，该二叉树为完全二叉树。 diff --git a/Contents/07.Tree/01.Binary-Tree/02.Binary-Tree-Traverse.md b/docs/05_tree/05_02_binary_tree_traverse.md similarity index 93% rename from Contents/07.Tree/01.Binary-Tree/02.Binary-Tree-Traverse.md rename to docs/05_tree/05_02_binary_tree_traverse.md index 5a2b2ccc..b22704a2 100644 --- a/Contents/07.Tree/01.Binary-Tree/02.Binary-Tree-Traverse.md +++ b/docs/05_tree/05_02_binary_tree_traverse.md @@ -307,6 +307,17 @@ class Solution: return order ``` +## 练习题目 + +- [0144. 二叉树的前序遍历](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-preorder-traversal.md) +- [0094. 二叉树的中序遍历](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/binary-tree-inorder-traversal.md) +- [0145. 二叉树的后序遍历](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-postorder-traversal.md) +- [0102. 二叉树的层序遍历](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-level-order-traversal.md) +- [0104. 二叉树的最大深度](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/maximum-depth-of-binary-tree.md) +- [0112. 路径总和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/path-sum.md) + +- [二叉树的遍历题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%81%8D%E5%8E%86%E9%A2%98%E7%9B%AE) + ## 参考资料 1. 【书籍】数据结构教程 第 3 版 - 唐发根 著 diff --git a/Contents/07.Tree/01.Binary-Tree/04.Binary-Tree-Reduction.md b/docs/05_tree/05_03_binary_tree_reduction.md similarity index 93% rename from Contents/07.Tree/01.Binary-Tree/04.Binary-Tree-Reduction.md rename to docs/05_tree/05_03_binary_tree_reduction.md index ebe67db4..4803395d 100644 --- a/Contents/07.Tree/01.Binary-Tree/04.Binary-Tree-Reduction.md +++ b/docs/05_tree/05_03_binary_tree_reduction.md @@ -159,6 +159,14 @@ class Solution: return createTree(preorder, postorder, len(preorder)) ``` +## 练习题目 + +- [0105. 从前序与中序遍历序列构造二叉树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/construct-binary-tree-from-preorder-and-inorder-traversal.md) +- [0106. 从中序与后序遍历序列构造二叉树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/construct-binary-tree-from-inorder-and-postorder-traversal.md) +- [0889. 根据前序和后序遍历构造二叉树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/construct-binary-tree-from-preorder-and-postorder-traversal.md) + +- [二叉树的还原题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E8%BF%98%E5%8E%9F%E9%A2%98%E7%9B%AE) + ## 参考资料 1. 【书籍】数据结构教程 第 3 版 - 唐发根 著 diff --git a/Contents/07.Tree/02.Binary-Search-Tree/01.Binary-Search-Tree.md b/docs/05_tree/05_04_binary_search_tree.md similarity index 88% rename from Contents/07.Tree/02.Binary-Search-Tree/01.Binary-Search-Tree.md rename to docs/05_tree/05_04_binary_search_tree.md index 3764b423..8e97b8fa 100644 --- a/Contents/07.Tree/02.Binary-Search-Tree/01.Binary-Search-Tree.md +++ b/docs/05_tree/05_04_binary_search_tree.md @@ -189,6 +189,17 @@ class Solution: return root.right ``` +## 练习题目 + +- [0700. 二叉搜索树中的搜索](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/search-in-a-binary-search-tree.md) +- [0701. 二叉搜索树中的插入操作](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/insert-into-a-binary-search-tree.md) +- [0450. 删除二叉搜索树中的节点](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/delete-node-in-a-bst.md) +- [0098. 验证二叉搜索树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/validate-binary-search-tree.md) +- [0108. 将有序数组转换为二叉搜索树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/convert-sorted-array-to-binary-search-tree.md) +- [0235. 二叉搜索树的最近公共祖先](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/lowest-common-ancestor-of-a-binary-search-tree.md) + +- [二叉搜索树题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【书籍】算法训练营 陈小玉 著 diff --git a/Contents/07.Tree/03.Segment-Tree/01.Segment-Tree.md b/docs/05_tree/05_05_segment_tree_01.md similarity index 69% rename from Contents/07.Tree/03.Segment-Tree/01.Segment-Tree.md rename to docs/05_tree/05_05_segment_tree_01.md index 26216110..09789901 100644 --- a/Contents/07.Tree/03.Segment-Tree/01.Segment-Tree.md +++ b/docs/05_tree/05_05_segment_tree_01.md @@ -142,8 +142,8 @@ class SegmentTree: 1. 如果区间 $[q\underline{\hspace{0.5em}}left, q\underline{\hspace{0.5em}}right]$ 完全覆盖了当前节点所在区间 $[left, right]$ ，即 $left \ge q\underline{\hspace{0.5em}}left$ 并且 $right \le q\underline{\hspace{0.5em}}right$，则返回该节点的区间值。 2. 如果区间 $[q\underline{\hspace{0.5em}}left, q\underline{\hspace{0.5em}}right]$ 与当前节点所在区间 $[left, right]$ 毫无关系，即 $right < q\underline{\hspace{0.5em}}left$ 或者 $left > q\underline{\hspace{0.5em}}right$，则返回 $0$。 3. 如果区间 $[q\underline{\hspace{0.5em}}left, q\underline{\hspace{0.5em}}right]$ 与当前节点所在区间有交集，则： - 1. 如果区间 $[q\underline{\hspace{0.5em}}left, q\underline{\hspace{0.5em}}right]$ 与左子节点所在区间 $[left, mid]$ 有交集，即 $q\underline{\hspace{0.5em}}left \le mid$，则在当前节点的左子树中进行查询并保存查询结果 $res_\underline{\hspace{0.5em}}left$。 - 2. 如果区间 $[q\underline{\hspace{0.5em}}left, q\underline{\hspace{0.5em}}right]$ 与右子节点所在区间 $[mid + 1, right]$ 有交集，即 $q\underline{\hspace{0.5em}}right > mid$，则在当前节点的右子树中进行查询并保存查询结果 $res_\underline{\hspace{0.5em}}right$。 + 1. 如果区间 $[q\underline{\hspace{0.5em}}left, q\underline{\hspace{0.5em}}right]$ 与左子节点所在区间 $[left, mid]$ 有交集，即 $q\underline{\hspace{0.5em}}left \le mid$，则在当前节点的左子树中进行查询并保存查询结果 $res\underline{\hspace{0.5em}}left$。 + 2. 如果区间 $[q\underline{\hspace{0.5em}}left, q\underline{\hspace{0.5em}}right]$ 与右子节点所在区间 $[mid + 1, right]$ 有交集，即 $q\underline{\hspace{0.5em}}right > mid$，则在当前节点的右子树中进行查询并保存查询结果 $res\underline{\hspace{0.5em}}right$。 3. 最后返回左右子树元素区间值的聚合计算结果。 线段树的区间查询代码如下： @@ -325,194 +325,9 @@ class SegmentTree: self.tree[index].lazy_tag = None # 更新当前节点的懒惰标记 ``` -## 4. 线段树的常见题型 +## 练习题目 -### 4.1 RMQ 问题 - -> **RMQ 问题**：Range Maximum / Minimum Query 的缩写，指的是对于长度为 $n$ 的数组序列 $nums$，回答若干个询问问题 `RMQ(nums, q_left, q_right)`，要求返回数组序列 $nums$ 在区间 $[q\underline{\hspace{0.5em}}left, q\underline{\hspace{0.5em}}right]$ 中的最大（最小）值。也就是求区间最大（最小）值问题。 - -假设查询次数为 $q$，则使用朴素算法解决 RMQ 问题的时间复杂度为 $O(q \times n)$。而使用线段树解决 RMQ 问题的时间复杂度为 $O(q \times n) \sim Q(q \times \log_2n)$ 之间。 - -### 4.2 单点更新，区间查询问题 - -> **单点更新，区间查询问题**： -> -> 1. 修改某一个元素的值。 -> 2. 查询区间为 $[q\underline{\hspace{0.5em}}left, q\underline{\hspace{0.5em}}right]$ 的区间值。 - -这类问题直接使用「3.1 线段树的单点更新」和「3.2 线段树的区间查询」即可解决。 - -### 4.3 区间更新，区间查询问题 - -> **区间更新，区间查询问题**： -> -> 1. 修改某一个区间的值。 -> 2. 查询区间为 $[q\underline{\hspace{0.5em}}left, q\underline{\hspace{0.5em}}right]$ 的区间值。 - -这类问题直接使用「3.3 线段树的区间更新」和「3.2 线段树的区间查询」即可解决。 - -### 4.4 区间合并问题 - -> **区间合并，区间查询问题**： -> -> 1. 修改某一个区间的值。 -> 2. 查询区间为 $[q\underline{\hspace{0.5em}}left, q\underline{\hspace{0.5em}}right]$ 中满足条件的连续最长区间值。 - -这类问题需要在「3.3 线段树的区间更新」和「3.2 线段树的区间查询」的基础上增加变动，在进行向上更新时需要对左右子节点的区间进行合并。 - -### 4.5 扫描线问题 - -> **扫描线问题**：虚拟扫描线或扫描面来解决欧几里德空间中的各种问题，一般被用来解决图形面积，周长等问题。 -> -> 主要思想为：想象一条线（通常是一条垂直线）在平面上扫过或移动，在某些点停止。几何操作仅限于几何对象，无论何时停止，它们都与扫描线相交或紧邻扫描线，并且一旦线穿过所有对象，就可以获得完整的解。 - -这类问题通常坐标跨度很大，需要先对每条扫描线的坐标进行离散化处理，将 $y$ 坐标映射到 $0, 1, 2, ...$ 中。然后将每条竖线的端点作为区间范围，使用线段树存储每条竖线的信息（$x$ 坐标、是左竖线还是右竖线等），然后再进行区间合并，并统计相关信息。 - -## 5. 线段树的拓展 - -### 5.1 动态开点线段树 - -在有些情况下，线段树需要维护的区间很大（例如 $[1, 10^9]$），在实际中用到的节点却很少。 - -如果使用之前数组形式实现线段树，则需要 $4 \times n$ 大小的空间，空间消耗有点过大了。 - -这时候我们就可以使用动态开点的思想来构建线段树。 - -动态开点线段树的算法思想如下： - -- 开始时只建立一个根节点，代表整个区间。 -- 当需要访问线段树的某棵子树（某个子区间）时，再建立代表这个子区间的节点。 - -动态开点线段树实现代码如下： - -```python -# 线段树的节点类 -class TreeNode: - def __init__(self, left=-1, right=-1, val=0): - self.left = left # 区间左边界 - self.right = right # 区间右边界 - self.mid = left + (right - left) // 2 - self.leftNode = None # 区间左节点 - self.rightNode = None # 区间右节点 - self.val = val # 节点值（区间值） - self.lazy_tag = None # 区间问题的延迟更新标记 - - -# 线段树类 -class SegmentTree: - def __init__(self, function): - self.tree = TreeNode(0, int(1e9)) - self.function = function # function 是一个函数，左右区间的聚合方法 - - # 向上更新 node 节点区间值，节点的区间值等于该节点左右子节点元素值的聚合计算结果 - def __pushup(self, node): - leftNode = node.leftNode - rightNode = node.rightNode - if leftNode and rightNode: - node.val = self.function(leftNode.val, rightNode.val) - - # 单点更新，将 nums[i] 更改为 val - def update_point(self, i, val): - self.__update_point(i, val, self.tree) - - # 单点更新，将 nums[i] 更改为 val。node 节点的区间为 [node.left, node.right] - def __update_point(self, i, val, node): - if node.left == node.right: - node.val = val # 叶子节点，节点值修改为 val - return - - if i <= node.mid: # 在左子树中更新节点值 - if not node.leftNode: - node.leftNode = TreeNode(node.left, node.mid) - self.__update_point(i, val, node.leftNode) - else: # 在右子树中更新节点值 - if not node.rightNode: - node.rightNode = TreeNode(node.mid + 1, node.right) - self.__update_point(i, val, node.rightNode) - self.__pushup(node) # 向上更新节点的区间值 - - # 区间查询，查询区间为 [q_left, q_right] 的区间值 - def query_interval(self, q_left, q_right): - return self.__query_interval(q_left, q_right, self.tree) - - # 区间查询，在线段树的 [left, right] 区间范围中搜索区间为 [q_left, q_right] 的区间值 - def __query_interval(self, q_left, q_right, node): - if node.left >= q_left and node.right <= q_right: # 节点所在区间被 [q_left, q_right] 所覆盖 - return node.val # 直接返回节点值 - if node.right < q_left or node.left > q_right: # 节点所在区间与 [q_left, q_right] 无关 - return 0 - - self.__pushdown(node) # 向下更新节点所在区间的左右子节点的值和懒惰标记 - - res_left = 0 # 左子树查询结果 - res_right = 0 # 右子树查询结果 - if q_left <= node.mid: # 在左子树中查询 - if not node.leftNode: - node.leftNode = TreeNode(node.left, node.mid) - res_left = self.__query_interval(q_left, q_right, node.leftNode) - if q_right > node.mid: # 在右子树中查询 - if not node.rightNode: - node.rightNode = TreeNode(node.mid + 1, node.right) - res_right = self.__query_interval(q_left, q_right, node.rightNode) - return self.function(res_left, res_right) # 返回左右子树元素值的聚合计算结果 - - # 区间更新，将区间为 [q_left, q_right] 上的元素值修改为 val - def update_interval(self, q_left, q_right, val): - self.__update_interval(q_left, q_right, val, self.tree) - - # 区间更新 - def __update_interval(self, q_left, q_right, val, node): - if node.left >= q_left and node.right <= q_right: # 节点所在区间被 [q_left, q_right] 所覆盖 - if node.lazy_tag: - node.lazy_tag += val # 将当前节点的延迟标记增加 val - else: - node.lazy_tag = val # 将当前节点的延迟标记增加 val - interval_size = (node.right - node.left + 1) # 当前节点所在区间大小 - node.val += val * interval_size # 当前节点所在区间每个元素值增加 val - return - if node.right < q_left or node.left > q_right: # 节点所在区间与 [q_left, q_right] 无关 - return 0 - - self.__pushdown(node) # 向下更新节点所在区间的左右子节点的值和懒惰标记 - - if q_left <= node.mid: # 在左子树中更新区间值 - if not node.leftNode: - node.leftNode = TreeNode(node.left, node.mid) - self.__update_interval(q_left, q_right, val, node.leftNode) - if q_right > node.mid: # 在右子树中更新区间值 - if not node.rightNode: - node.rightNode = TreeNode(node.mid + 1, node.right) - self.__update_interval(q_left, q_right, val, node.rightNode) - - self.__pushup(node) - - # 向下更新 node 节点所在区间的左右子节点的值和懒惰标记 - def __pushdown(self, node): - lazy_tag = node.lazy_tag - if not node.lazy_tag: - return - - if not node.leftNode: - node.leftNode = TreeNode(node.left, node.mid) - if not node.rightNode: - node.rightNode = TreeNode(node.mid + 1, node.right) - - if node.leftNode.lazy_tag: - node.leftNode.lazy_tag += lazy_tag # 更新左子节点懒惰标记 - else: - node.leftNode.lazy_tag = lazy_tag # 更新左子节点懒惰标记 - left_size = (node.leftNode.right - node.leftNode.left + 1) - node.leftNode.val += lazy_tag * left_size # 左子节点每个元素值增加 lazy_tag - - if node.rightNode.lazy_tag: - node.rightNode.lazy_tag += lazy_tag # 更新右子节点懒惰标记 - else: - node.rightNode.lazy_tag = lazy_tag # 更新右子节点懒惰标记 - right_size = (node.rightNode.right - node.rightNode.left + 1) - node.rightNode.val += lazy_tag * right_size # 右子节点每个元素值增加 lazy_tag - - node.lazy_tag = None # 更新当前节点的懒惰标记 -``` +- [线段树题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E7%BA%BF%E6%AE%B5%E6%A0%91%E9%A2%98%E7%9B%AE) ## 参考资料 diff --git a/docs/05_tree/05_06_segment_tree_02.md b/docs/05_tree/05_06_segment_tree_02.md new file mode 100644 index 00000000..7851b63f --- /dev/null +++ b/docs/05_tree/05_06_segment_tree_02.md @@ -0,0 +1,203 @@ +## 1. 线段树的常见题型 + +### 1.1 RMQ 问题 + +> **RMQ 问题**：Range Maximum / Minimum Query 的缩写，指的是对于长度为 $n$ 的数组序列 $nums$，回答若干个询问问题 `RMQ(nums, q_left, q_right)`，要求返回数组序列 $nums$ 在区间 $[q\underline{\hspace{0.5em}}left, q\underline{\hspace{0.5em}}right]$ 中的最大（最小）值。也就是求区间最大（最小）值问题。 + +假设查询次数为 $q$，则使用朴素算法解决 RMQ 问题的时间复杂度为 $O(q \times n)$。而使用线段树解决 RMQ 问题的时间复杂度为 $O(q \times n) \sim Q(q \times \log_2n)$ 之间。 + +### 1.2 单点更新，区间查询问题 + +> **单点更新，区间查询问题**： +> +> 1. 修改某一个元素的值。 +> 2. 查询区间为 $[q\underline{\hspace{0.5em}}left, q\underline{\hspace{0.5em}}right]$ 的区间值。 + +这类问题直接使用「3.1 线段树的单点更新」和「3.2 线段树的区间查询」即可解决。 + +### 1.3 区间更新，区间查询问题 + +> **区间更新，区间查询问题**： +> +> 1. 修改某一个区间的值。 +> 2. 查询区间为 $[q\underline{\hspace{0.5em}}left, q\underline{\hspace{0.5em}}right]$ 的区间值。 + +这类问题直接使用「3.3 线段树的区间更新」和「3.2 线段树的区间查询」即可解决。 + +### 1.4 区间合并问题 + +> **区间合并，区间查询问题**： +> +> 1. 修改某一个区间的值。 +> 2. 查询区间为 $[q\underline{\hspace{0.5em}}left, q\underline{\hspace{0.5em}}right]$ 中满足条件的连续最长区间值。 + +这类问题需要在「3.3 线段树的区间更新」和「3.2 线段树的区间查询」的基础上增加变动，在进行向上更新时需要对左右子节点的区间进行合并。 + +### 1.5 扫描线问题 + +> **扫描线问题**：虚拟扫描线或扫描面来解决欧几里德空间中的各种问题，一般被用来解决图形面积，周长等问题。 +> +> 主要思想为：想象一条线（通常是一条垂直线）在平面上扫过或移动，在某些点停止。几何操作仅限于几何对象，无论何时停止，它们都与扫描线相交或紧邻扫描线，并且一旦线穿过所有对象，就可以获得完整的解。 + +这类问题通常坐标跨度很大，需要先对每条扫描线的坐标进行离散化处理，将 $y$ 坐标映射到 $0, 1, 2, ...$ 中。然后将每条竖线的端点作为区间范围，使用线段树存储每条竖线的信息（$x$ 坐标、是左竖线还是右竖线等），然后再进行区间合并，并统计相关信息。 + +## 2. 线段树的拓展 + +### 2.1 动态开点线段树 + +在有些情况下，线段树需要维护的区间很大（例如 $[1, 10^9]$），在实际中用到的节点却很少。 + +如果使用之前数组形式实现线段树，则需要 $4 \times n$ 大小的空间，空间消耗有点过大了。 + +这时候我们就可以使用动态开点的思想来构建线段树。 + +动态开点线段树的算法思想如下： + +- 开始时只建立一个根节点，代表整个区间。 +- 当需要访问线段树的某棵子树（某个子区间）时，再建立代表这个子区间的节点。 + +动态开点线段树实现代码如下： + +```python +# 线段树的节点类 +class TreeNode: + def __init__(self, left=-1, right=-1, val=0): + self.left = left # 区间左边界 + self.right = right # 区间右边界 + self.mid = left + (right - left) // 2 + self.leftNode = None # 区间左节点 + self.rightNode = None # 区间右节点 + self.val = val # 节点值（区间值） + self.lazy_tag = None # 区间问题的延迟更新标记 + + +# 线段树类 +class SegmentTree: + def __init__(self, function): + self.tree = TreeNode(0, int(1e9)) + self.function = function # function 是一个函数，左右区间的聚合方法 + + # 向上更新 node 节点区间值，节点的区间值等于该节点左右子节点元素值的聚合计算结果 + def __pushup(self, node): + leftNode = node.leftNode + rightNode = node.rightNode + if leftNode and rightNode: + node.val = self.function(leftNode.val, rightNode.val) + + # 单点更新，将 nums[i] 更改为 val + def update_point(self, i, val): + self.__update_point(i, val, self.tree) + + # 单点更新，将 nums[i] 更改为 val。node 节点的区间为 [node.left, node.right] + def __update_point(self, i, val, node): + if node.left == node.right: + node.val = val # 叶子节点，节点值修改为 val + return + + if i <= node.mid: # 在左子树中更新节点值 + if not node.leftNode: + node.leftNode = TreeNode(node.left, node.mid) + self.__update_point(i, val, node.leftNode) + else: # 在右子树中更新节点值 + if not node.rightNode: + node.rightNode = TreeNode(node.mid + 1, node.right) + self.__update_point(i, val, node.rightNode) + self.__pushup(node) # 向上更新节点的区间值 + + # 区间查询，查询区间为 [q_left, q_right] 的区间值 + def query_interval(self, q_left, q_right): + return self.__query_interval(q_left, q_right, self.tree) + + # 区间查询，在线段树的 [left, right] 区间范围中搜索区间为 [q_left, q_right] 的区间值 + def __query_interval(self, q_left, q_right, node): + if node.left >= q_left and node.right <= q_right: # 节点所在区间被 [q_left, q_right] 所覆盖 + return node.val # 直接返回节点值 + if node.right < q_left or node.left > q_right: # 节点所在区间与 [q_left, q_right] 无关 + return 0 + + self.__pushdown(node) # 向下更新节点所在区间的左右子节点的值和懒惰标记 + + res_left = 0 # 左子树查询结果 + res_right = 0 # 右子树查询结果 + if q_left <= node.mid: # 在左子树中查询 + if not node.leftNode: + node.leftNode = TreeNode(node.left, node.mid) + res_left = self.__query_interval(q_left, q_right, node.leftNode) + if q_right > node.mid: # 在右子树中查询 + if not node.rightNode: + node.rightNode = TreeNode(node.mid + 1, node.right) + res_right = self.__query_interval(q_left, q_right, node.rightNode) + return self.function(res_left, res_right) # 返回左右子树元素值的聚合计算结果 + + # 区间更新，将区间为 [q_left, q_right] 上的元素值修改为 val + def update_interval(self, q_left, q_right, val): + self.__update_interval(q_left, q_right, val, self.tree) + + # 区间更新 + def __update_interval(self, q_left, q_right, val, node): + if node.left >= q_left and node.right <= q_right: # 节点所在区间被 [q_left, q_right] 所覆盖 + if node.lazy_tag: + node.lazy_tag += val # 将当前节点的延迟标记增加 val + else: + node.lazy_tag = val # 将当前节点的延迟标记增加 val + interval_size = (node.right - node.left + 1) # 当前节点所在区间大小 + node.val += val * interval_size # 当前节点所在区间每个元素值增加 val + return + if node.right < q_left or node.left > q_right: # 节点所在区间与 [q_left, q_right] 无关 + return 0 + + self.__pushdown(node) # 向下更新节点所在区间的左右子节点的值和懒惰标记 + + if q_left <= node.mid: # 在左子树中更新区间值 + if not node.leftNode: + node.leftNode = TreeNode(node.left, node.mid) + self.__update_interval(q_left, q_right, val, node.leftNode) + if q_right > node.mid: # 在右子树中更新区间值 + if not node.rightNode: + node.rightNode = TreeNode(node.mid + 1, node.right) + self.__update_interval(q_left, q_right, val, node.rightNode) + + self.__pushup(node) + + # 向下更新 node 节点所在区间的左右子节点的值和懒惰标记 + def __pushdown(self, node): + lazy_tag = node.lazy_tag + if not node.lazy_tag: + return + + if not node.leftNode: + node.leftNode = TreeNode(node.left, node.mid) + if not node.rightNode: + node.rightNode = TreeNode(node.mid + 1, node.right) + + if node.leftNode.lazy_tag: + node.leftNode.lazy_tag += lazy_tag # 更新左子节点懒惰标记 + else: + node.leftNode.lazy_tag = lazy_tag # 更新左子节点懒惰标记 + left_size = (node.leftNode.right - node.leftNode.left + 1) + node.leftNode.val += lazy_tag * left_size # 左子节点每个元素值增加 lazy_tag + + if node.rightNode.lazy_tag: + node.rightNode.lazy_tag += lazy_tag # 更新右子节点懒惰标记 + else: + node.rightNode.lazy_tag = lazy_tag # 更新右子节点懒惰标记 + right_size = (node.rightNode.right - node.rightNode.left + 1) + node.rightNode.val += lazy_tag * right_size # 右子节点每个元素值增加 lazy_tag + + node.lazy_tag = None # 更新当前节点的懒惰标记 +``` + +## 练习题目 + +- [线段树题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E7%BA%BF%E6%AE%B5%E6%A0%91%E9%A2%98%E7%9B%AE) + +## 参考资料 + +- 【书籍】ACM-ICPC 程序设计系列 - 算法设计与实现 - 陈宇 吴昊 主编 +- 【书籍】算法训练营 陈小玉 著 +- 【博文】[史上最详细的线段树教程 - 知乎](https://zhuanlan.zhihu.com/p/34150142) +- 【博文】[线段树 Segment Tree 实战 - halfrost](https://halfrost.com/segment_tree/) +- 【博文】[线段树 - OI Wiki](https://oi-wiki.org/ds/seg/) +- 【博文】[线段树的 python 实现 - 年糕的博客 - CSDN博客](https://blog.csdn.net/qq_33935895/article/details/102806357) +- 【博文】[线段树 从入门到进阶 - Dijkstra·Liu - 博客园](https://www.cnblogs.com/dijkstra2003/p/9676729.html) + diff --git a/docs/05_tree/05_07_binary_indexed_tree.md b/docs/05_tree/05_07_binary_indexed_tree.md new file mode 100644 index 00000000..5d1a87ad --- /dev/null +++ b/docs/05_tree/05_07_binary_indexed_tree.md @@ -0,0 +1,235 @@ +## 1. 树状数组简介 + +### 1.1 树状数组的定义 + +> **树状数组（Binary Indexed Tree）**：也因其发明者命名为 Fenwick 树，最早 Peter M. Fenwick 于 1994 年以 A New Data Structure for Cumulative Frequency Tables 为题发表在 SOFTWARE PRACTICE AND EXPERIENCE。其初衷是解决数据压缩里的累积频率（Cumulative Frequency）的计算问题，现多用于高效计算数列的前缀和，区间和。它可以以 $O(\log n)$ 的时间得到任意前缀 $\sum_{i=1}^{j}A[i], 1 \le j \le n$，并同时支持在 $O(\log n)$ 时间内支持动态单点值的修改。空间复杂度为 $O(n)$。 + +### 1.2 树状数组的原理 + +树状数组的核心思想是利用二进制数的特性，将前缀和分解成多个子区间的和。具体来说： + +1. 每个节点存储的是以该节点为根的子树中所有节点的和 +2. 对于任意一个数 $x$，其二进制表示中最低位的 1 所在的位置决定了该节点在树中的层级 +3. 通过位运算可以快速找到需要更新的节点和需要求和的区间 + +例如，对于数组 $[1, 2, 3, 4, 5]$，其树状数组的结构如下： +``` + [15] + / \ + [3] [12] + / \ / \ +[1] [2] [3] [9] + / \ + [4] [5] +``` + +## 2. 树状数组的基本操作 + +### 2.1 树状数组的建立 + +```python +class BinaryIndexedTree: + def __init__(self, n): + self.n = n + self.tree = [0] * (n + 1) + + def lowbit(self, x): + return x & (-x) + + def build(self, arr): + for i in range(len(arr)): + self.update(i + 1, arr[i]) +``` + +### 2.2 树状数组的修改 + +```python +def update(self, index, val): + while index <= self.n: + self.tree[index] += val + index += self.lowbit(index) +``` + +### 2.3 树状数组的求和 + +```python +def query(self, index): + res = 0 + while index > 0: + res += self.tree[index] + index -= self.lowbit(index) + return res +``` + +## 3. 树状数组的应用 + +### 3.1 单点更新 + 区间求值 + +这是树状数组最基本的应用，可以高效地： +1. 修改某个位置的值 +2. 查询任意区间的和 + +时间复杂度： +- 单点更新：$O(\log n)$ +- 区间查询：$O(\log n)$ + +具体实现： +```python +class BinaryIndexedTree: + def __init__(self, n): + self.n = n + self.tree = [0] * (n + 1) + + def lowbit(self, x): + return x & (-x) + + def update(self, index, val): + while index <= self.n: + self.tree[index] += val + index += self.lowbit(index) + + def query(self, index): + res = 0 + while index > 0: + res += self.tree[index] + index -= self.lowbit(index) + return res + + def query_range(self, left, right): + return self.query(right) - self.query(left - 1) + +# 使用示例 +def example_single_point_update(): + # 初始化数组 [1, 2, 3, 4, 5] + arr = [1, 2, 3, 4, 5] + n = len(arr) + bit = BinaryIndexedTree(n) + + # 构建树状数组 + for i in range(n): + bit.update(i + 1, arr[i]) + + # 单点更新：将第3个元素加2 + bit.update(3, 2) # arr[2] += 2 + + # 查询区间和：查询[2,4]的和 + sum_range = bit.query_range(2, 4) + print(f"区间[2,4]的和为：{sum_range}") # 输出：区间[2,4]的和为：11 +``` + +### 3.2 区间更新 + 单点求值 + +通过差分数组的思想，可以实现： +1. 区间更新：将区间 $[l, r]$ 的所有值加上 $val$ +2. 单点查询：查询某个位置的值 + +时间复杂度： +- 区间更新：$O(\log n)$ +- 单点查询：$O(\log n)$ + +具体实现： +```python +class RangeUpdateBIT: + def __init__(self, n): + self.n = n + self.tree = [0] * (n + 1) + + def lowbit(self, x): + return x & (-x) + + def update(self, index, val): + while index <= self.n: + self.tree[index] += val + index += self.lowbit(index) + + def query(self, index): + res = 0 + while index > 0: + res += self.tree[index] + index -= self.lowbit(index) + return res + + def range_update(self, left, right, val): + # 在left位置加上val + self.update(left, val) + # 在right+1位置减去val + self.update(right + 1, -val) + +# 使用示例 +def example_range_update(): + # 初始化数组 [0, 0, 0, 0, 0] + n = 5 + bit = RangeUpdateBIT(n) + + # 区间更新：[2,4]区间所有元素加3 + bit.range_update(2, 4, 3) + + # 单点查询：查询第3个元素的值 + value = bit.query(3) + print(f"第3个元素的值为：{value}") # 输出：第3个元素的值为：3 +``` + +### 3.3 求逆序对数 + +利用树状数组可以高效求解数组中的逆序对数量： +1. 对数组进行离散化处理 +2. 从后向前遍历，统计每个数前面比它大的数的个数 +3. 将统计结果累加得到逆序对总数 + +时间复杂度：$O(n \log n)$ + +具体实现： +```python +class InversionCountBIT: + def __init__(self, n): + self.n = n + self.tree = [0] * (n + 1) + + def lowbit(self, x): + return x & (-x) + + def update(self, index, val): + while index <= self.n: + self.tree[index] += val + index += self.lowbit(index) + + def query(self, index): + res = 0 + while index > 0: + res += self.tree[index] + index -= self.lowbit(index) + return res + + def count_inversions(self, arr): + # 离散化处理 + sorted_arr = sorted(set(arr)) + rank = {val: i + 1 for i, val in enumerate(sorted_arr)} + + # 从后向前遍历，统计逆序对 + count = 0 + for i in range(len(arr) - 1, -1, -1): + # 查询当前数前面比它大的数的个数 + count += self.query(rank[arr[i]] - 1) + # 更新当前数的出现次数 + self.update(rank[arr[i]], 1) + + return count + +# 使用示例 +def example_inversion_count(): + # 测试数组 [5, 2, 6, 1, 3] + arr = [5, 2, 6, 1, 3] + n = len(arr) + bit = InversionCountBIT(n) + + # 计算逆序对数量 + inversions = bit.count_inversions(arr) + print(f"数组中的逆序对数量为：{inversions}") # 输出：数组中的逆序对数量为：6 +``` + +## 参考资料 + +- 【书籍】ACM-ICPC 程序设计系列 - 算法设计与实现 - 陈宇 吴昊 主编 +- 【书籍】算法训练营 陈小玉 著 +- 【博文】[聊聊树状数组 Binary Indexed Tree - halfrost](https://halfrost.com/binary_indexed_tree/) +- 【博文】[树状数组学习笔记 - AcWing](https://www.acwing.com/blog/content/80/) diff --git a/Contents/07.Tree/05.Union-Find/01.Union-Find.md b/docs/05_tree/05_08_union_find.md similarity index 97% rename from Contents/07.Tree/05.Union-Find/01.Union-Find.md rename to docs/05_tree/05_08_union_find.md index 54351d57..ce0f3a3b 100644 --- a/Contents/07.Tree/05.Union-Find/01.Union-Find.md +++ b/docs/05_tree/05_08_union_find.md @@ -561,6 +561,17 @@ class Solution: return len(res) ``` +## 练习题目 + +- [0990. 等式方程的可满足性](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/satisfiability-of-equality-equations.md) +- [1202. 交换字符串中的元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/smallest-string-with-swaps.md) +- [0947. 移除最多的同行或同列石头](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/most-stones-removed-with-same-row-or-column.md) +- [0547. 省份数量](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/number-of-provinces.md) +- [0684. 冗余连接](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/redundant-connection.md) +- [0765. 情侣牵手](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/couples-holding-hands.md) + +- [并查集题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%B9%B6%E6%9F%A5%E9%9B%86%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【博文】[并查集 - OI Wiki](https://oi-wiki.org/ds/dsu/) diff --git a/docs/05_tree/index.md b/docs/05_tree/index.md new file mode 100644 index 00000000..80ec4609 --- /dev/null +++ b/docs/05_tree/index.md @@ -0,0 +1,10 @@ +## 本章内容 + +- [5.1 树与二叉树基础](https://github.com/ITCharge/AlgoNote/tree/main/docs/05_tree/05_01_tree_basic.md) +- [5.2 二叉树的遍历](https://github.com/ITCharge/AlgoNote/tree/main/docs/05_tree/05_02_binary_tree_traverse.md) +- [5.3 二叉树的还原](https://github.com/ITCharge/AlgoNote/tree/main/docs/05_tree/05_03_binary_tree_reduction.md) +- [5.4 二叉搜索树](https://github.com/ITCharge/AlgoNote/tree/main/docs/05_tree/05_04_binary_search_tree.md) +- [5.5 线段树（一）](https://github.com/ITCharge/AlgoNote/tree/main/docs/05_tree/05_05_segment_tree_01.md) +- [5.6 线段树（二）](https://github.com/ITCharge/AlgoNote/tree/main/docs/05_tree/05_06_segment_tree_02.md) +- [5.7 树状数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/05_tree/05_07_binary_indexed_tree.md) +- [5.8 并查集](https://github.com/ITCharge/AlgoNote/tree/main/docs/05_tree/05_08_union_find.md) \ No newline at end of file diff --git a/Contents/08.Graph/01.Graph-Basic/01.Graph-Basic.md b/docs/06_graph/06_01_graph_basic.md similarity index 100% rename from Contents/08.Graph/01.Graph-Basic/01.Graph-Basic.md rename to docs/06_graph/06_01_graph_basic.md diff --git a/Contents/08.Graph/01.Graph-Basic/02.Graph-Structure.md b/docs/06_graph/06_02_graph_structure.md similarity index 100% rename from Contents/08.Graph/01.Graph-Basic/02.Graph-Structure.md rename to docs/06_graph/06_02_graph_structure.md diff --git a/Contents/08.Graph/02.Graph-Traversal/01.Graph-DFS.md b/docs/06_graph/06_03_graph_dfs.md similarity index 91% rename from Contents/08.Graph/02.Graph-Traversal/01.Graph-DFS.md rename to docs/06_graph/06_03_graph_dfs.md index 19e365f0..f3f0634b 100644 --- a/Contents/08.Graph/02.Graph-Traversal/01.Graph-DFS.md +++ b/docs/06_graph/06_03_graph_dfs.md @@ -324,6 +324,20 @@ class Solution: - **时间复杂度**：$O(n)$。其中 $n$ 为图中节点数量。 - **空间复杂度**：$O(n)$。 +## 练习题目 + +- [0200. 岛屿数量](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/number-of-islands.md) +- [0133. 克隆图](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/clone-graph.md) +- [0494. 目标和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/target-sum.md) +- [0841. 钥匙和房间](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/keys-and-rooms.md) +- [0695. 岛屿的最大面积](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/max-area-of-island.md) +- [0130. 被围绕的区域](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/surrounded-regions.md) +- [0417. 太平洋大西洋水流问题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/pacific-atlantic-water-flow.md) +- [1020. 飞地的数量](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/number-of-enclaves.md) +- [1254. 统计封闭岛屿的数目](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/number-of-closed-islands.md) + +- [深度优先搜索题目列表](https://github.com/itcharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%B7%B1%E5%BA%A6%E4%BC%98%E5%85%88%E6%90%9C%E7%B4%A2%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【文章】[深度优先搜索 - LeetBook - 力扣（LeetCode）](https://leetcode.cn/leetbook/read/dfs/egx6xc/) diff --git a/Contents/08.Graph/02.Graph-Traversal/03.Graph-BFS.md b/docs/06_graph/06_04_graph_bfs.md similarity index 91% rename from Contents/08.Graph/02.Graph-Traversal/03.Graph-BFS.md rename to docs/06_graph/06_04_graph_bfs.md index 85410ed6..7f1e8aff 100644 --- a/Contents/08.Graph/02.Graph-Traversal/03.Graph-BFS.md +++ b/docs/06_graph/06_04_graph_bfs.md @@ -269,6 +269,17 @@ class Solution: - **时间复杂度**：$O(n \times m)$，其中 $m$ 和 $n$ 分别为行数和列数。 - **空间复杂度**：$O(n \times m)$。 +## 练习题目 + +- [0463. 岛屿的周长](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/island-perimeter.md) +- [0752. 打开转盘锁](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/open-the-lock.md) +- [0279. 完全平方数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/perfect-squares.md) +- [0542. 01 矩阵](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/01-matrix.md) +- [0322. 零钱兑换](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/coin-change.md) +- [LCR 130. 衣橱整理](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/ji-qi-ren-de-yun-dong-fan-wei-lcof.md) + +- [广度优先搜索题目列表](https://github.com/itcharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%B9%BF%E5%BA%A6%E4%BC%98%E5%85%88%E6%90%9C%E7%B4%A2%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【文章】[广度优先搜索 - LeetBook - 力扣（LeetCode）](https://leetcode.cn/leetbook/read/bfs/e69rh1/) diff --git a/Contents/08.Graph/02.Graph-Traversal/05.Graph-Topological-Sorting.md b/docs/06_graph/06_05_graph_topological_sorting.md similarity index 96% rename from Contents/08.Graph/02.Graph-Traversal/05.Graph-Topological-Sorting.md rename to docs/06_graph/06_05_graph_topological_sorting.md index 1827ab2f..710ea820 100644 --- a/Contents/08.Graph/02.Graph-Traversal/05.Graph-Topological-Sorting.md +++ b/docs/06_graph/06_05_graph_topological_sorting.md @@ -344,3 +344,11 @@ class Solution: - **时间复杂度**：$O(n + m)$，其中 $n$ 是图中节点数目，$m$ 是图中边数目。 - **空间复杂度**：$O(n + m)$。 + +## 练习题目 + +- [0207. 课程表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/course-schedule.md) +- [0210. 课程表 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/course-schedule-ii.md) +- [0802. 找到最终的安全状态](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/find-eventual-safe-states.md) + +- [拓扑排序题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%9B%BE%E7%9A%84%E6%8B%93%E6%89%91%E6%8E%92%E5%BA%8F%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/docs/06_graph/06_06_graph_minimum_spanning_tree.md b/docs/06_graph/06_06_graph_minimum_spanning_tree.md new file mode 100644 index 00000000..7485f2a8 --- /dev/null +++ b/docs/06_graph/06_06_graph_minimum_spanning_tree.md @@ -0,0 +1,219 @@ +## 1. 最小生成树的定义 + +在了解「最小生成树」之前，我们需要要先理解 「生成树」的概念。 + +> **生成树（Spanning Tree）**：如果无向连通图 G 的一个子图是一棵包含图 G 所有顶点的树，则称该子图为 G 的生成树。生成树是连通图的包含图中的所有顶点的极小连通子图。图的生成树不惟一。从不同的顶点出发进行遍历，可以得到不同的生成树。 + +换句话说，生成树是原图 G 的一个子图，它包含了原图 G 的所有顶点，并且通过选择图中一部分边连接这些顶点，使得子图中没有环。 + +生成树有以下特点： + +1. **包含所有顶点**：生成树中包含了原图的所有顶点。 +2. **连通性**：生成树是原图的一个连通子图，意味着任意两个顶点之间都存在一条路径。 +3. **无环图**：生成树一个无环图。 +4. **边数最少**：在包含所有顶点的情况下，生成树的边数最少，其边数为顶点数减 $1$。 + +![](https://qcdn.itcharge.cn/images/20231211100145.png) + +如上图所示，左侧图 $G$ 是包含 $v_1…v_6$ 共 $6$ 个顶点 $7$ 条边在内的有权图。右侧是图 $G$ 的两个生成树，两者都包含了 $6$ 个顶点 $5$ 条边。 + +> **最小生成树（Minimum Spanning Tree）**：无向连通图 G 的所有生成树中，边的权值之和最小的生成树，被称为最小生成树。 + +最小生成树除了包含生成树的特点之外，还具有一个特点。 + +1. **边的权值之和最小**：在包含所有顶点的情况下，最小生成树的边的权重之和是所有可能的生成树中最小的。 + +![](https://qcdn.itcharge.cn/images/20231211101937.png) + +如上图所示，左侧图 $G$ 是包含 $v_1…v_6$ 共 $6$ 个顶点 $7$ 条边在内的有权图。右侧是图 $G$ 的最小生成树，包含了 $6$ 个顶点 $5$ 条边，并且所有边的权值和最小。 + +为了找到无向图的最小生成树，常用的算法有「Prim 算法」和「Kruskal 算法」。 + +- **Prim 算法**：从一个起始顶点出发，逐步选择与已经构建的树连接的最短边，直到包含所有顶点为止。 +- **Kruskal 算法**：基于边的排序和并查集数据结构，逐步添加边，并保证所选边不会构成环路，直到构建出最小生成树。 + +这两个算法都可以帮助我们找到图中的最小生成树，以满足连接所有顶点的要求同时使得总权重最小。 + +## 2. Prim 算法 + +### 2.1 Prim 算法的算法思想 + +> **Prim 算法的算法思想**：每次选择最短边来扩展最小生成树，从而保证生成树的总权重最小。算法通过不断扩展小生成树的顶点集合 $MST$，逐步构建出最小生成树。 + +### 2.2 Prim 算法的实现步骤 + +1. 将图 $G$ 中所有的顶点 $V$ 分为两个顶点集合 $V_A$ 和 $V_B$。其中 $V_A$ 为已经加入到最小生成树的顶点集合，$V_B$ 是还未加入生成树的顶点集合。 +2. 选择起始顶点 $start$，将其加入到最小生成树的顶点集合 $V_A$ 中。 +3. 从 $V_A$ 的顶点集合中选择一个顶点 $u$，然后找到连接顶点 $u$ 与 $V_B$ 之间的边中权重最小的边。 +4. 让上一步中找到的顶点和边加入到 $MST$ 中，更新 $MST$ 的顶点集合和边集合。 +5. 重复第 $3 \sim 4$ 步，直到 $MST$ 的顶点集合中包含了图中的所有顶点为止。 + +### 2.3 Prim 算法的实现代码 + +```python +class Solution: + # graph 为图的邻接矩阵，start 为起始顶点 + def Prim(self, graph, start): + size = len(graph) + vis = set() + dist = [float('inf') for _ in range(size)] + + ans = 0 # 最小生成树的边权和 + dist[start] = 0 # 初始化起始顶点到起始顶点的边权值为 0 + + for i in range(1, size): # 初始化起始顶点到其他顶点的边权值 + dist[i] = graph[start][i] + vis.add(start) # 将 start 顶点标记为已访问 + + for _ in range(size - 1): + min_dis = float('inf') + min_dis_pos = -1 + for i in range(size): + if i not in vis and dist[i] < min_dis: + min_dis = dist[i] + min_dis_pos = i + if min_dis_pos == -1: # 没有顶点可以加入 MST，图 G 不连通 + return -1 + ans += min_dis # 将顶点加入 MST，并将边权值加入到答案中 + vis.add(min_dis_pos) + for i in range(size): + if i not in vis and dist[i] > graph[min_dis_pos][i]: + dist[i] = graph[min_dis_pos][i] + return ans + +points = [[0,0]] +graph = dict() +size = len(points) +for i in range(size): + x1, y1 = points[i] + for j in range(size): + x2, y2 = points[j] + dist = abs(x2 - x1) + abs(y2 - y1) + if i not in graph: + graph[i] = dict() + if j not in graph: + graph[j] = dict() + graph[i][j] = dist + graph[j][i] = dist + + +print(Solution().Prim(graph)) +``` + +### 2.4 Prim 算法复杂度分析 + +Prim 算法的时间复杂度主要取决于以下几个因素： + +1. **初始化阶段**： + - 初始化距离数组和访问数组的时间复杂度为 $O(V)$，其中 $V$ 是图中的顶点数。 + +2. **主循环阶段**： + - 外层循环需要执行 $V-1$ 次，用于选择 $V-1$ 条边。 + - 每次循环中需要： + - 找到未访问顶点中距离最小的顶点，时间复杂度为 $O(V)$。 + - 更新相邻顶点的距离，时间复杂度为 $O(V)$。 + +因此，Prim 算法的总体复杂度为： +- 时间复杂度：$O(V^2)$，其中 $V$ 是图中的顶点数。 +- 空间复杂度：$O(V)$，主要用于存储距离数组和访问数组。 + +## 3. Kruskal 算法 + +### 3.1 Kruskal 算法的算法思想 + +> **Kruskal 算法的算法思想**：通过依次选择权重最小的边并判断其两个端点是否连接在同一集合中，从而逐步构建最小生成树。这个过程保证了最终生成的树是无环的，并且总权重最小。 + +在实际实现中，我们通常使用并查集数据结构来管理顶点的集合信息，以便高效地判断两个顶点是否在同一个集合中，以及合并集合。 + +### 3.2 Kruskal 算法的实现步骤 + +1. 将图中所有边按照权重从小到大进行排序。 +2. 将每个顶点看做是一个单独集合，即初始时每个顶点自成一个集合。 +3. 按照排好序的边顺序，按照权重从小到大，依次遍历每一条边。 +4. 对于每条边，检查其连接的两个顶点所属的集合： + 1. 如果两个顶点属于同一个集合，则跳过这条边，以免形成环路。 + 2. 如果两个顶点不属于同一个集合，则将这条边加入到最小生成树中，同时合并这两个顶点所属的集合。 +5. 重复第 $3 \sim 4$ 步，直到最小生成树中的变数等于所有节点数减 $1$ 为止。 + +### 3.3 Kruskal 算法的实现代码 + +```python +class UnionFind: + + def __init__(self, n): + self.parent = [i for i in range(n)] + self.count = n + + def find(self, x): + while x != self.parent[x]: + self.parent[x] = self.parent[self.parent[x]] + x = self.parent[x] + return x + + def union(self, x, y): + root_x = self.find(x) + root_y = self.find(y) + if root_x == root_y: + return + + self.parent[root_x] = root_y + self.count -= 1 + + def is_connected(self, x, y): + return self.find(x) == self.find(y) + + +class Solution: + def Kruskal(self, edges, size): + union_find = UnionFind(size) + + edges.sort(key=lambda x: x[2]) + + res, cnt = 0, 1 + for x, y, dist in edges: + if union_find.is_connected(x, y): + continue + ans += dist + cnt += 1 + union_find.union(x, y) + if cnt == size - 1: + return ans + return ans + + def minCostConnectPoints(self, points: List[List[int]]) -> int: + size = len(points) + edges = [] + for i in range(size): + xi, yi = points[i] + for j in range(i + 1, size): + xj, yj = points[j] + dist = abs(xi - xj) + abs(yi - yj) + edges.append([i, j, dist]) + + ans = Solution().Kruskal(edges, size) + return ans +``` + +### 3.4 Kruskal 算法复杂度分析 + +Kruskal 算法的时间复杂度主要取决于以下几个因素： + +1. **边的排序**：对 $E$ 条边进行排序的时间复杂度为 $O(E \log E)$。 + +2. **并查集操作**： + - 查找操作（find）的时间复杂度为 $O(\alpha(n))$，其中 $\alpha(n)$ 是阿克曼函数的反函数，增长极其缓慢，可以近似认为是常数时间。 + - 合并操作（union）的时间复杂度也是 $O(\alpha(n))$。 + +3. **遍历边的过程**：需要遍历所有边，时间复杂度为 $O(E)$。 + +因此，Kruskal 算法的总体时间复杂度为： +- 时间复杂度：$O(E \log E)$，其中 $E$ 是图中的边数。 +- 空间复杂度：$O(V)$，其中 $V$ 是图中的顶点数，主要用于存储并查集数据结构。 + +## 练习题目 + +- [1584. 连接所有点的最小费用](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/min-cost-to-connect-all-points.md) +- [1631. 最小体力消耗路径](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/path-with-minimum-effort.md) +- [0778. 水位上升的泳池中游泳](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/swim-in-rising-water.md) + +- [图的最小生成树题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%9B%BE%E7%9A%84%E6%9C%80%E5%B0%8F%E7%94%9F%E6%88%90%E6%A0%91%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/docs/06_graph/06_07_graph_shortest_path_01.md b/docs/06_graph/06_07_graph_shortest_path_01.md new file mode 100644 index 00000000..233593ce --- /dev/null +++ b/docs/06_graph/06_07_graph_shortest_path_01.md @@ -0,0 +1,212 @@ +## 1. 单源最短路径简介 + +> **单源最短路径（Single Source Shortest Path）**：对于一个带权图 $G = (V, E)$，其中每条边的权重是一个实数。另外，给定 $v$ 中的一个顶点，称之为源点。则源点到其他所有各个顶点之间的最短路径长度，称为单源最短路径。 + +这里的路径长度，指的是路径上各边权之和。 + +单源最短路径问题的核心是找到从源点到其他各个顶点的路径，使得路径上边的权重之和最小。这个问题在许多实际应用中都非常重要，比如网络路由、地图导航、通信网络优化等。 + +常见的解决单源最短路径问题的算法包括： + +1. **Dijkstra 算法**：一种贪心算法，用于解决无负权边的情况。它逐步扩展当前已知最短路径的范围，选择当前距离起始节点最近的节点，并更新与该节点相邻的节点的距离。 +2. **Bellman-Ford 算法**：适用于有负权边的情况。它通过多次迭代来逐步逼近最短路径，每次迭代都尝试通过更新边的权重来缩短路径。 +3. **SPFA 算法**：优化的 Bellman-Ford 算法，它在每次迭代中不遍历所有的边，而是选择性地更新与当前节点相关的边，从而提高了算法的效率。 + +这些算法根据图的特点和问题的需求有所不同，选择适合的算法可以在不同情况下有效地解决单源最短路径问题。 + +## 2. Dijkstra 算法 + +### 2.1 Dijkstra 算法的算法思想 + +> **Dijkstra 算法的算法思想**：通过逐步选择距离起始节点最近的节点，并根据这些节点的路径更新其他节点的距离，从而逐步找到最短路径。 + +Dijkstra 算法是一种用来解决单源最短路径问题的算法。这个算法适用于没有负权边的图。算法的核心思想是从源点出发，逐步找到到其他所有点的最短路径。它通过不断选择当前距离源点最近的节点，并更新与该节点相邻的节点的距离，最终得到所有节点的最短路径。 + +Dijkstra 算法使用贪心的策略。它每次选择当前未处理的节点中距离源点最近的节点，认为这个节点的最短路径已经确定。然后，它用这个节点的最短路径去更新其他相邻节点的距离。这个过程重复进行，直到所有节点的最短路径都被确定。 + +Dijkstra 算法的一个重要特点是它不能处理有负权边的图。因为负权边可能导致已经确定的最短路径被破坏。如果图中存在负权边，应该使用 Bellman-Ford 算法或 SPFA 算法。 + +### 2.2 Dijkstra 算法的实现步骤 + +1. 初始化距离数组，将源节点 $source$ 的距离设为 $0$，其他节点的距离设为无穷大。 +2. 维护一个访问数组 $visited$，记录节点是否已经被访问。 +3. 每次从未访问的节点中找到距离最小的节点，标记为已访问。 +4. 更新该节点的所有相邻节点的距离。 +5. 重复步骤 $3 \sim 4$，直到所有节点都被访问。 +6. 最后返回所有节点中最大的距离值，如果存在无法到达的节点则返回 $-1$。 + + + +### 2.3 Dijkstra 算法的实现代码 + +```python +class Solution: + def dijkstra(self, graph, n, source): + # 初始化距离数组 + dist = [float('inf') for _ in range(n + 1)] + dist[source] = 0 + # 记录已处理的节点 + visited = set() + + while len(visited) < n: + # 选择当前未处理的、距离源点最近的节点 + current_node = None + min_distance = float('inf') + for i in range(1, n + 1): + if i not in visited and dist[i] < min_distance: + min_distance = dist[i] + current_node = i + + # 如果没有可处理的节点（非连通图），提前结束 + if current_node is None: + break + + # 标记当前节点为已处理 + visited.add(current_node) + + # 更新相邻节点的距离 + for neighbor, weight in graph[current_node].items(): + new_distance = dist[current_node] + weight + if new_distance < dist[neighbor]: + dist[neighbor] = new_distance + + return dist + +# 使用示例 +# 创建一个有向图，使用邻接表表示 +graph = { + 1: {2: 2, 3: 4}, + 2: {3: 1, 4: 7}, + 3: {4: 3}, + 4: {} +} +n = 4 # 图中节点数量 +source = 1 # 源节点 + +dist = Solution().dijkstra(graph, n, source) +print("从节点", source, "到其他节点的最短距离：") +for i in range(1, n + 1): + if dist[i] == float('inf'): + print(f"到节点 {i} 的距离：不可达") + else: + print(f"到节点 {i} 的距离：{dist[i]}") +``` + +### 2.4 Dijkstra 算法复杂度分析 + +- **时间复杂度**：$O(V^2)$ + - 外层循环需要遍历所有节点，时间复杂度为 $O(V)$ + - 内层循环需要遍历所有未访问的节点来找到距离最小的节点，时间复杂度为 $O(V)$ + - 因此总时间复杂度为 $O(V^2)$ + +- **空间复杂度**：$O(V)$ + - 需要存储距离数组 `dist`，大小为 $O(V)$ + - 需要存储访问集合 `visited`，大小为 $O(V)$ + - 因此总空间复杂度为 $O(V)$ + + +## 3. 堆优化的 Dijkstra 算法 + +### 3.1 堆优化的 Dijkstra 算法思想 + +> **堆优化的 Dijkstra 算法**：通过使用优先队列（堆）来优化选择最小距离节点的过程，从而降低算法的时间复杂度。 + +在原始的 Dijkstra 算法中，每次都需要遍历所有未访问的节点来找到距离最小的节点，这个过程的时间复杂度是 $O(V)$。通过使用优先队列（堆）来维护当前已知的最短距离，我们可以将这个过程的时间复杂度优化到 $O(\log V)$。 + +堆优化的主要思想是： +1. 使用优先队列存储当前已知的最短距离 +2. 每次从队列中取出距离最小的节点进行处理 +3. 当发现更短的路径时，将新的距离加入队列 +4. 通过优先队列的特性，保证每次取出的都是当前最小的距离 + +### 3.2 堆优化的 Dijkstra 算法实现步骤 + +1. 初始化距离数组，将源节点的距离设为 $0$，其他节点的距离设为无穷大。 +2. 创建一个优先队列，将源节点及其距离 $(0, source)$ 加入队列。 +3. 当队列不为空时： + - 取出队列中距离最小的节点 + - 如果该节点的距离大于已知的最短距离，则跳过 + - 否则，遍历该节点的所有相邻节点 + - 如果通过当前节点到达相邻节点的距离更短，则更新距离并将新的距离加入队列 +4. 重复步骤 3，直到队列为空 +5. 返回所有节点的最短距离 + +### 3.3 堆优化的 Dijkstra 算法实现代码 + +```python +import heapq + +class Solution: + def dijkstra(self, graph, n, source): + # 初始化距离数组 + dist = [float('inf') for _ in range(n + 1)] + dist[source] = 0 + + # 创建优先队列，存储 (距离, 节点) 的元组 + priority_queue = [(0, source)] + + while priority_queue: + current_distance, current_node = heapq.heappop(priority_queue) + + # 如果当前距离大于已知的最短距离，跳过 + if current_distance > dist[current_node]: + continue + + # 遍历当前节点的所有相邻节点 + for neighbor, weight in graph[current_node].items(): + distance = current_distance + weight + if distance < dist[neighbor]: + dist[neighbor] = distance + heapq.heappush(priority_queue, (distance, neighbor)) + + return dist + +# 使用示例 +# 创建一个有向图，使用邻接表表示 +graph = { + 1: {2: 2, 3: 4}, + 2: {3: 1, 4: 7}, + 3: {4: 3}, + 4: {} +} +n = 4 # 图中节点数量 +source = 1 # 源节点 + +dist = Solution().dijkstra(graph, n, source) +print("从节点", source, "到其他节点的最短距离：") +for i in range(1, n + 1): + if dist[i] == float('inf'): + print(f"到节点 {i} 的距离：不可达") + else: + print(f"到节点 {i} 的距离：{dist[i]}") +``` + +代码解释： + +1. `graph` 是一个字典，表示图的邻接表。例如，`graph[1] = {2: 3, 3: 4}` 表示从节点 1 到节点 2 的边权重为 3，到节点 3 的边权重为 4。 +2. `n` 是图中顶点的数量。 +3. `source` 是源节点的编号。 +4. `dist` 数组存储源点到各个节点的最短距离。 +5. `priority_queue` 是一个优先队列，用来选择当前距离源点最近的节点。队列中的元素是 (距离, 节点) 的元组。 +6. 主循环中，每次从队列中取出距离最小的节点。如果该节点的距离已经被更新过，跳过。 +7. 对于当前节点的每一个邻居，计算通过当前节点到达邻居的距离。如果这个距离比已知的更短，更新距离并将邻居加入队列。 +8. 最终，`dist` 数组中存储的就是源点到所有节点的最短距离。 + +### 3.4 堆优化的 Dijkstra 算法复杂度分析 + +- **时间复杂度**：$O((V + E) \log V)$ + - 每个节点最多被加入优先队列一次，每次操作的时间复杂度为 $O(\log V)$ + - 每条边最多被处理一次，每次处理的时间复杂度为 $O(\log V)$ + - 因此总时间复杂度为 $O((V + E) \log V)$ + +- **空间复杂度**：$O(V)$ + - 需要存储距离数组，大小为 $O(V)$。 + - 优先队列在最坏情况下可能存储所有节点，大小为 $O(V)$。 + +## 练习题目 + +- [0743. 网络延迟时间](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/network-delay-time.md) +- [0787. K 站中转内最便宜的航班](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/cheapest-flights-within-k-stops.md) +- [1631. 最小体力消耗路径](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/path-with-minimum-effort.md) + +- [单源最短路径题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%8D%95%E6%BA%90%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/docs/06_graph/06_08_graph_shortest_path_02.md b/docs/06_graph/06_08_graph_shortest_path_02.md new file mode 100644 index 00000000..8bb4c6df --- /dev/null +++ b/docs/06_graph/06_08_graph_shortest_path_02.md @@ -0,0 +1,169 @@ +## 1. Bellman-Ford 算法 + +### 1.1 Bellman-Ford 算法的算法思想 + +> **Bellman-Ford 算法**：一种用于计算单源最短路径的算法，可以处理图中存在负权边的情况，并且能够检测负权环。 + +Bellman-Ford 算法的核心思想是： +1. 对图中的所有边进行 $V-1$ 次松弛操作，其中 $V$ 是图中顶点的数量 +2. 每次松弛操作都会尝试通过当前边来缩短源点到目标顶点的距离 +3. 如果在 $V-1$ 次松弛后还能继续松弛，说明图中存在负权环 +4. 算法可以处理负权边，但不能处理负权环 + +### 1.2 Bellman-Ford 算法的实现步骤 + +1. 初始化距离数组，将源节点的距离设为 $0$，其他节点的距离设为无穷大 +2. 进行 $V-1$ 次迭代，每次迭代： + - 遍历图中的所有边 + - 对每条边进行松弛操作：如果通过当前边可以缩短源点到目标顶点的距离，则更新距离 +3. 进行第 $V$ 次迭代，检查是否还能继续松弛： + - 如果还能松弛，说明图中存在负权环 + - 如果不能松弛，说明已经找到最短路径 +4. 返回最短路径距离数组 + +### 1.3 Bellman-Ford 算法的实现代码 + +```python +class Solution: + def bellmanFord(self, graph, n, source): + # 初始化距离数组 + dist = [float('inf') for _ in range(n + 1)] + dist[source] = 0 + + # 进行 V-1 次迭代 + for i in range(n - 1): + # 遍历所有边 + for vi in graph: + for vj in graph[vi]: + # 松弛操作 + if dist[vj] > graph[vi][vj] + dist[vi]: + dist[vj] = graph[vi][vj] + dist[vi] + + # 检查是否存在负权环 + for vi in graph: + for vj in graph[vi]: + if dist[vj] > dist[vi] + graph[vi][vj]: + return None # 存在负权环 + + return dist +``` + +代码解释： + +1. `graph` 是一个字典，表示图的邻接表。例如，`graph[1] = {2: 3, 3: 4}` 表示从节点 1 到节点 2 的边权重为 3，到节点 3 的边权重为 4。 +2. `n` 是图中顶点的数量。 +3. `source` 是源节点的编号。 +4. `dist` 数组存储源点到各个节点的最短距离。 +5. 外层循环进行 $V-1$ 次迭代，确保所有可能的最短路径都被找到。 +6. 内层循环遍历所有边，进行松弛操作。 +7. 最后检查是否存在负权环，如果存在则返回 None。 + +### 1.4 Bellman-Ford 算法复杂度分析 + +- **时间复杂度**：$O(VE)$ + - 需要进行 $V-1$ 次迭代 + - 每次迭代需要遍历所有边 $E$ + - 因此总时间复杂度为 $O(VE)$ + +- **空间复杂度**：$O(V)$ + - 需要存储距离数组，大小为 $O(V)$ + - 不需要额外的空间来存储图的结构，因为使用邻接表表示 + + +## 2. SPFA 算法 + +### 2.1 SPFA 算法的算法思想 + +> **SPFA 算法（Shortest Path Faster Algorithm）**：是 Bellman-Ford 算法的一种队列优化版本，通过使用队列来维护待更新的节点，从而减少不必要的松弛操作。 + +SPFA 算法的核心思想是： +1. 使用队列来维护待更新的节点，而不是像 Bellman-Ford 算法那样遍历所有边 +2. 只有当某个节点的距离被更新时，才将其加入队列 +3. 通过这种方式，避免了大量不必要的松弛操作，提高了算法的效率 +4. 算法可以处理负权边，并且能够检测负权环 + +### 2.2 SPFA 算法的实现步骤 + +1. 初始化距离数组，将源节点的距离设为 $0$，其他节点的距离设为无穷大 +2. 创建一个队列，将源节点加入队列 +3. 当队列不为空时： + - 取出队首节点 + - 遍历该节点的所有相邻节点 + - 如果通过当前节点可以缩短到相邻节点的距离，则更新距离 + - 如果相邻节点不在队列中，则将其加入队列 +4. 重复步骤 3，直到队列为空 +5. 返回最短路径距离数组 + +### 2.3 SPFA 算法的实现代码 + +```python +from collections import deque + +def spfa(graph, n, source): + # 初始化距离数组 + dist = [float('inf') for _ in range(n + 1)] + dist[source] = 0 + + # 初始化队列和访问数组 + queue = deque([source]) + in_queue = [False] * (n + 1) + in_queue[source] = True + + # 记录每个节点入队次数，用于检测负环 + count = [0] * (n + 1) + + while queue: + # 取出队首节点 + current = queue.popleft() + in_queue[current] = False + + # 遍历当前节点的所有相邻节点 + for neighbor, weight in graph[current].items(): + # 如果通过当前节点可以缩短距离 + if dist[neighbor] > dist[current] + weight: + dist[neighbor] = dist[current] + weight + count[neighbor] += 1 + + # 如果节点入队次数超过 n-1 次，说明存在负环 + if count[neighbor] >= n: + return None + + # 如果相邻节点不在队列中，将其加入队列 + if not in_queue[neighbor]: + queue.append(neighbor) + in_queue[neighbor] = True + + return dist +``` + +代码解释： + +1. `graph` 是一个字典，表示图的邻接表。例如，`graph[1] = {2: 3, 3: 4}` 表示从节点 1 到节点 2 的边权重为 3，到节点 3 的边权重为 4。 +2. `n` 是图中顶点的数量。 +3. `source` 是源节点的编号。 +4. `dist` 数组存储源点到各个节点的最短距离。 +5. `queue` 是一个双端队列，用于维护待更新的节点。 +6. `in_queue` 数组用于记录节点是否在队列中，避免重复入队。 +7. `count` 数组用于记录每个节点的入队次数，用于检测负环。 +8. 主循环中，每次从队列中取出一个节点，遍历其所有相邻节点，如果发现更短的路径则更新距离并将相邻节点加入队列。 +9. 如果某个节点的入队次数超过 $n-1$ 次，说明图中存在负环，返回 None。 + +### 2.4 SPFA 算法复杂度分析 + +- **时间复杂度**： + - 平均情况下：$O(kE)$，其中 $k$ 是每个节点的平均入队次数 + - 最坏情况下：$O(VE)$，与 Bellman-Ford 算法相同 + - 实际运行中，SPFA 算法通常比 Bellman-Ford 算法快很多 + +- **空间复杂度**：$O(V)$ + - 需要存储距离数组，大小为 $O(V)$ + - 需要存储队列和访问数组，大小为 $O(V)$ + - 因此总空间复杂度为 $O(V)$ + +## 练习题目 + +- [0743. 网络延迟时间](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/network-delay-time.md) +- [0787. K 站中转内最便宜的航班](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/cheapest-flights-within-k-stops.md) +- [1631. 最小体力消耗路径](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/path-with-minimum-effort.md) + +- [单源最短路径题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%8D%95%E6%BA%90%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/docs/06_graph/06_09_graph_multi_source_shortest_path.md b/docs/06_graph/06_09_graph_multi_source_shortest_path.md new file mode 100644 index 00000000..c0c7db58 --- /dev/null +++ b/docs/06_graph/06_09_graph_multi_source_shortest_path.md @@ -0,0 +1,209 @@ +## 1. 多源最短路径简介 + +> **多源最短路径（All-Pairs Shortest Paths）**：对于一个带权图 $G = (V, E)$，计算图中任意两个顶点之间的最短路径长度。 + +多源最短路径问题的核心是找到图中任意两个顶点之间的最短路径。这个问题在许多实际应用中都非常重要，比如： + +1. 网络路由中的路由表计算 +2. 地图导航系统中的距离矩阵计算 +3. 社交网络中的最短关系链分析 +4. 交通网络中的最优路径规划 + +常见的解决多源最短路径问题的算法包括： + +1. **Floyd-Warshall 算法**：一种动态规划算法，可以处理负权边，但不能处理负权环。 +2. **Johnson 算法**：结合了 Bellman-Ford 算法和 Dijkstra 算法，可以处理负权边，但不能处理负权环。 +3. **重复 Dijkstra 算法**：对每个顶点运行一次 Dijkstra 算法，适用于无负权边的图。 + +## 2. Floyd-Warshall 算法 + +### 2.1 Floyd-Warshall 算法的算法思想 + +> **Floyd-Warshall 算法**：一种动态规划算法，通过逐步考虑中间顶点来更新任意两点之间的最短路径。 + +Floyd-Warshall 算法的核心思想是： + +1. 对于图中的任意两个顶点 $i$ 和 $j$，考虑是否存在一个顶点 $k$，使得从 $i$ 到 $k$ 再到 $j$ 的路径比已知的从 $i$ 到 $j$ 的路径更短 +2. 如果存在这样的顶点 $k$，则更新从 $i$ 到 $j$ 的最短路径 +3. 通过考虑所有可能的中间顶点 $k$，最终得到任意两点之间的最短路径 + +### 2.2 Floyd-Warshall 算法的实现步骤 + +1. 初始化距离矩阵 $dist$，其中 $dist[i][j]$ 表示从顶点 $i$ 到顶点 $j$ 的最短路径长度 +2. 对于每对顶点 $(i, j)$，如果存在边 $(i, j)$，则 $dist[i][j]$ 设为边的权重，否则设为无穷大 +3. 对于每个顶点 $k$，作为中间顶点： + - 对于每对顶点 $(i, j)$，如果 $dist[i][k] + dist[k][j] < dist[i][j]$，则更新 $dist[i][j]$ +4. 重复步骤 3，直到考虑完所有可能的中间顶点 +5. 返回最终的距离矩阵 + +### 2.3 Floyd-Warshall 算法的实现代码 + +```python +def floyd_warshall(graph, n): + # 初始化距离矩阵 + dist = [[float('inf') for _ in range(n)] for _ in range(n)] + + # 设置直接相连的顶点之间的距离 + for i in range(n): + dist[i][i] = 0 + for j, weight in graph[i].items(): + dist[i][j] = weight + + # 考虑每个顶点作为中间顶点 + for k in range(n): + for i in range(n): + for j in range(n): + if dist[i][k] != float('inf') and dist[k][j] != float('inf'): + dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]) + + return dist +``` + +代码解释： + +1. `graph` 是一个字典，表示图的邻接表。例如，`graph[0] = {1: 3, 2: 4}` 表示从节点 0 到节点 1 的边权重为 3，到节点 2 的边权重为 4。 +2. `n` 是图中顶点的数量。 +3. `dist` 是一个二维数组，存储任意两点之间的最短路径长度。 +4. 首先初始化距离矩阵，将对角线元素设为 0，表示顶点到自身的距离为 0。 +5. 然后设置直接相连的顶点之间的距离。 +6. 主循环中，对于每个顶点 $k$，考虑它作为中间顶点时，是否能缩短其他顶点之间的距离。 +7. 最终返回的距离矩阵中，$dist[i][j]$ 表示从顶点 $i$ 到顶点 $j$ 的最短路径长度。 + +### 2.4 Floyd-Warshall 算法复杂度分析 + +- **时间复杂度**：$O(V^3)$ + - 需要三层嵌套循环，分别遍历所有顶点 + - 因此总时间复杂度为 $O(V^3)$ + +- **空间复杂度**：$O(V^2)$ + - 需要存储距离矩阵，大小为 $O(V^2)$ + - 不需要额外的空间来存储图的结构，因为使用邻接表表示 + +Floyd-Warshall 算法的主要优势在于： + +1. 实现简单，容易理解 +2. 可以处理负权边 +3. 可以检测负权环（如果某个顶点到自身的距离变为负数，说明存在负权环） +4. 适用于稠密图 + +主要缺点： + +1. 时间复杂度较高，不适用于大规模图 +2. 空间复杂度较高，需要存储完整的距离矩阵 +3. 不能处理负权环 + +## 3. Johnson 算法 + +### 3.1 Johnson 算法的算法思想 + +> **Johnson 算法**：一种结合了 Bellman-Ford 算法和 Dijkstra 算法的多源最短路径算法，可以处理负权边，但不能处理负权环。 + +Johnson 算法的核心思想是： + +1. 通过重新赋权，将图中的负权边转换为非负权边 +2. 对每个顶点运行一次 Dijkstra 算法，计算最短路径 +3. 将结果转换回原始权重 + +### 3.2 Johnson 算法的实现步骤 + +1. 添加一个新的顶点 $s$，并添加从 $s$ 到所有其他顶点的边，权重为 0 +2. 使用 Bellman-Ford 算法计算从 $s$ 到所有顶点的最短路径 $h(v)$ +3. 重新赋权：对于每条边 $(u, v)$，新的权重为 $w(u, v) + h(u) - h(v)$ +4. 对每个顶点 $v$，使用 Dijkstra 算法计算从 $v$ 到所有其他顶点的最短路径 +5. 将结果转换回原始权重：对于从 $u$ 到 $v$ 的最短路径，原始权重为 $d(u, v) - h(u) + h(v)$ + +### 3.3 Johnson 算法的实现代码 + +```python +from collections import defaultdict +import heapq + +def johnson(graph, n): + # 添加新顶点 s + new_graph = defaultdict(dict) + for u in graph: + for v, w in graph[u].items(): + new_graph[u][v] = w + new_graph[n][u] = 0 # 从 s 到所有顶点的边权重为 0 + + # 使用 Bellman-Ford 算法计算 h(v) + h = [float('inf')] * (n + 1) + h[n] = 0 + + for _ in range(n): + for u in new_graph: + for v, w in new_graph[u].items(): + if h[v] > h[u] + w: + h[v] = h[u] + w + + # 检查是否存在负权环 + for u in new_graph: + for v, w in new_graph[u].items(): + if h[v] > h[u] + w: + return None # 存在负权环 + + # 重新赋权 + reweighted_graph = defaultdict(dict) + for u in graph: + for v, w in graph[u].items(): + reweighted_graph[u][v] = w + h[u] - h[v] + + # 对每个顶点运行 Dijkstra 算法 + dist = [[float('inf') for _ in range(n)] for _ in range(n)] + for source in range(n): + # 初始化距离数组 + d = [float('inf')] * n + d[source] = 0 + + # 使用优先队列 + pq = [(0, source)] + visited = set() + + while pq: + current_dist, u = heapq.heappop(pq) + if u in visited: + continue + visited.add(u) + + for v, w in reweighted_graph[u].items(): + if d[v] > current_dist + w: + d[v] = current_dist + w + heapq.heappush(pq, (d[v], v)) + + # 转换回原始权重 + for v in range(n): + if d[v] != float('inf'): + dist[source][v] = d[v] - h[source] + h[v] + + return dist +``` + +代码解释： + +1. `graph` 是一个字典，表示图的邻接表。 +2. `n` 是图中顶点的数量。 +3. 首先添加一个新的顶点 $s$，并添加从 $s$ 到所有其他顶点的边，权重为 0。 +4. 使用 Bellman-Ford 算法计算从 $s$ 到所有顶点的最短路径 $h(v)$。 +5. 检查是否存在负权环，如果存在则返回 None。 +6. 重新赋权，将图中的负权边转换为非负权边。 +7. 对每个顶点运行一次 Dijkstra 算法，计算最短路径。 +8. 将结果转换回原始权重，得到最终的距离矩阵。 + +### 3.4 Johnson 算法复杂度分析 + +- **时间复杂度**：$O(VE \log V)$ + - 需要运行一次 Bellman-Ford 算法，时间复杂度为 $O(VE)$ + - 需要运行 $V$ 次 Dijkstra 算法，每次时间复杂度为 $O(E \log V)$ + - 因此总时间复杂度为 $O(VE \log V)$ + +- **空间复杂度**：$O(V^2)$ + - 需要存储距离矩阵，大小为 $O(V^2)$ + - 需要存储重新赋权后的图，大小为 $O(E)$ + - 因此总空间复杂度为 $O(V^2)$ + +## 练习题目 + +- [0815. 公交路线](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/bus-routes.md) +- [1162. 地图分析](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/as-far-from-land-as-possible.md) + +- [多源最短路径题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%A4%9A%E6%BA%90%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/docs/06_graph/06_10_graph_the_second_shortest_path.md b/docs/06_graph/06_10_graph_the_second_shortest_path.md new file mode 100644 index 00000000..47864e21 --- /dev/null +++ b/docs/06_graph/06_10_graph_the_second_shortest_path.md @@ -0,0 +1,137 @@ +## 1.1 次短路径简介 + +> **次短路径**：给定一个带权有向图，求从起点到终点的次短路径。次短路径是指长度严格大于最短路径的所有路径中长度最小的那条路径。 + +### 1.1.1 问题特点 + +- 次短路径必须严格大于最短路径 +- 可能存在多条最短路径，但次短路径是唯一的 +- 如果不存在次短路径（如最短路径是唯一的），则返回 $-1$。 + +### 1.1.2 常见变体 + +1. 允许重复边的次短路径 +2. 不允许重复边的次短路径 +3. 带约束条件的次短路径（如必须经过某些节点） + +## 1.2 次短路径基本思路 + +求解次短路径的常用方法是使用 Dijkstra 算法的变体。基本思路如下： + +1. 使用 Dijkstra 算法找到最短路径。 +2. 在寻找最短路径的过程中，同时维护次短路径。 +3. 对于每个节点，我们需要维护两个距离值： + - $dist1[u]$：从起点到节点 u 的最短距离。 + - $dist2[u]$：从起点到节点 u 的次短距离。 + +### 1.2.1 具体实现步骤 + +1. 初始化 $dist1$ 和 $dist2$ 数组，所有值设为无穷大。 +2. 将起点加入优先队列，距离为 $0$。 +3. 每次从队列中取出距离最小的节点 $u$。 +4. 遍历 $u$ 的所有邻接节点 $v$： + - 如果找到更短的路径，更新 $dist1[v]$。 + - 如果找到次短的路径，更新 $dist2[v]$。 +5. 最终 $dist2[target]$ 即为所求的次短路径长度。 + +### 1.2.2 算法正确性证明 + +1. 对于任意节点 $u$，$dist1[u]$ 一定是最短路径长度。 +2. 对于任意节点 $u$，$dist2[u]$ 一定是次短路径长度。 +3. 算法会考虑所有可能的路径，因此不会遗漏次短路径。 + +## 1.3 次短路径代码实现 + +```python +import heapq + +def second_shortest_path(n: int, edges: List[List[int]], start: int, end: int) -> int: + """ + 计算从起点到终点的次短路径长度 + + 参数: + n: 节点数量 + edges: 边列表，每个元素为 [起点, 终点, 权重] + start: 起始节点 + end: 目标节点 + + 返回: + 次短路径的长度，如果不存在则返回 -1 + """ + # 构建邻接表 + graph = [[] for _ in range(n)] + for u, v, w in edges: + graph[u].append((v, w)) + + # 初始化距离数组 + dist1 = [float('inf')] * n # 最短距离 + dist2 = [float('inf')] * n # 次短距离 + dist1[start] = 0 + + # 优先队列，存储 (距离, 节点) 的元组 + pq = [(0, start)] + + while pq: + d, u = heapq.heappop(pq) + + # 如果当前距离大于次短距离，跳过 + if d > dist2[u]: + continue + + # 遍历所有邻接节点 + for v, w in graph[u]: + # 计算新的距离 + new_dist = d + w + + # 如果找到更短的路径 + if new_dist < dist1[v]: + dist2[v] = dist1[v] # 原来的最短路径变成次短路径 + dist1[v] = new_dist # 更新最短路径 + heapq.heappush(pq, (new_dist, v)) + # 如果找到次短的路径 + elif new_dist > dist1[v] and new_dist < dist2[v]: + dist2[v] = new_dist + heapq.heappush(pq, (new_dist, v)) + + return dist2[end] if dist2[end] != float('inf') else -1 + +# 使用示例 +n = 4 +edges = [ + [0, 1, 1], + [1, 2, 2], + [2, 3, 1], + [0, 2, 4], + [1, 3, 5] +] +start = 0 +end = 3 + +result = second_shortest_path(n, edges, start, end) +print(f"次短路径长度: {result}") +``` + +## 1.4 算法复杂度分析 + +- 时间复杂度：$O((V + E)\log V)$，其中 $V$ 是节点数，$E$ 是边数。 +- 空间复杂度：$O(V)$，用于存储距离数组和优先队列。 + +## 1.5 应用场景 + +1. 网络路由：寻找备用路径。 +2. 交通规划：寻找替代路线。 +3. 通信网络：寻找备用通信路径。 +4. 物流配送：规划备用配送路线。 + +## 1.6 注意事项 + +1. 次短路径必须严格大于最短路径。 +2. 如果不存在次短路径，返回 $-1$。 +3. 图中可能存在负权边，此时需要使用 Bellman-Ford 算法的变体。 +4. 对于无向图，需要将每条边都加入两次。 + +## 练习题目 + +- [2045. 到达目的地的第二短时间](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2000-2099/second-minimum-time-to-reach-destination.md) + +- [次短路径题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%AC%A1%E7%9F%AD%E8%B7%AF%E5%BE%84%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/docs/06_graph/06_11_graph_system_of_difference_constraints.md b/docs/06_graph/06_11_graph_system_of_difference_constraints.md new file mode 100644 index 00000000..8a3b184b --- /dev/null +++ b/docs/06_graph/06_11_graph_system_of_difference_constraints.md @@ -0,0 +1,127 @@ +## 1.1 差分约束系统简介 + +> **差分约束系统（System of Difference Constraints）**：一种特殊的线性规划问题，其中每个约束条件都是形如 $x_i - x_j \leq c$ 的不等式。这类问题可以通过图论中的最短路径算法来求解。 + +## 1.2 问题形式 + +给定一组形如 $x_i - x_j \leq c$ 的约束条件，其中： + +- $x_i, x_j$ 是变量。 +- $c$ 是常数。 + +我们的目标是找到一组满足所有约束条件的变量值。 + +## 1.3 图论建模 + +差分约束系统可以转化为有向图问题： + +1. 将每个变量 $x_i$ 看作图中的一个顶点。 +2. 对于约束 $x_i - x_j \leq c$，添加一条从 $j$ 到 $i$ 的边，权重为 $c$。 +3. 添加一个虚拟源点 $s$，向所有顶点连一条权重为 $0$ 的边。 + +## 1.4 求解方法 + +1. **Bellman-Ford 算法**： + - 如果图中存在负环，则无解。 + - 否则，从源点到各点的最短路径长度即为对应变量的解。 + +2. **SPFA 算法**： + - 队列优化的 Bellman-Ford 算法。 + - 适用于稀疏图。 + +## 1.5 应用场景 + +1. 任务调度问题 +2. 区间约束问题 +3. 资源分配问题 +4. 时间序列分析 + +## 1.6 代码实现 + +```python +def solve_difference_constraints(n, constraints): + # 构建图 + graph = [[] for _ in range(n + 1)] + for i, j, c in constraints: + graph[j].append((i, c)) + + # 添加虚拟源点 + for i in range(n): + graph[n].append((i, 0)) + + # Bellman-Ford 算法 + dist = [float('inf')] * (n + 1) + dist[n] = 0 + + # 松弛操作 + for _ in range(n): + for u in range(n + 1): + for v, w in graph[u]: + if dist[u] + w < dist[v]: + dist[v] = dist[u] + w + + # 检查负环 + for u in range(n + 1): + for v, w in graph[u]: + if dist[u] + w < dist[v]: + return None # 存在负环，无解 + + return dist[:n] # 返回前 n 个变量的解 +``` + +## 1.7 算法复杂度 + +- 时间复杂度： + + - **Bellman-Ford 算法**： + + - 最坏情况：$O(VE)$。 + + - 其中 $V$ 为顶点数，$E$ 为边数。 + + - 需要进行 $V-1$ 次松弛操作，每次操作遍历所有边。 + + - **SPFA 算法**： + - 平均情况：$O(kE)$，其中 $k$ 为每个点的平均入队次数。 + - 最坏情况：$O(VE)$。 + - 实际运行时间通常优于 Bellman-Ford 算法。 + +- 空间复杂度： + + - **Bellman-Ford 算法**： + + - $O(V + E)$ + + - 需要存储图结构：$O(V + E)$。 + + - 需要存储距离数组：$O(V)$。 + + - **SPFA 算法**： + + - $O(V + E)$。 + + - 需要存储图结构：$O(V + E)$。 + + - 需要存储距离数组：$O(V)$。 + + - 需要存储队列：$O(V)$。 + +### 1.8 优化建议 + +1. 对于稀疏图，优先使用 SPFA 算法。 +2. 对于稠密图，可以考虑使用 Bellman-Ford 算法。 +3. 如果问题规模较大，可以考虑使用其他优化算法或启发式方法。 + +### 1.9 注意事项 + +1. 差分约束系统可能有多个解 +2. 如果存在负环，则无解 +3. 实际应用中需要注意数值精度问题 +4. 对于大规模问题，可以考虑使用其他优化算法 + +## 练习题目 + +- [0995. K 连续位的最小翻转次数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/minimum-number-of-k-consecutive-bit-flips.md) +- [1109. 航班预订统计](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/corporate-flight-bookings.md) + +- [差分约束系统题目列表](https://github.com/itcharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%B7%AE%E5%88%86%E7%BA%A6%E6%9D%9F%E7%B3%BB%E7%BB%9F%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/docs/06_graph/06_12_graph_bipartite_basic.md b/docs/06_graph/06_12_graph_bipartite_basic.md new file mode 100644 index 00000000..65824e5e --- /dev/null +++ b/docs/06_graph/06_12_graph_bipartite_basic.md @@ -0,0 +1,78 @@ +## 1.1 二分图的定义 + +> **二分图（Bipartite Graph）**：一种特殊的图，其顶点集可以被划分为两个互不相交的子集，使得图中的每一条边都连接着这两个子集中的顶点。换句话说，二分图中的顶点可以被分成两组，使得同一组内的顶点之间没有边相连。 + +## 1.2 二分图的性质 + +1. **染色性质**：二分图是二色的，即可以用两种颜色对顶点进行着色，使得相邻顶点颜色不同。 +2. **无奇环**：二分图中不存在长度为奇数的环。 +3. **最大匹配**：二分图的最大匹配问题可以通过匈牙利算法或网络流算法高效求解。 + +## 1.3 二分图的判定 + +判断一个图是否为二分图的方法： + +1. 使用深度优先搜索（DFS）或广度优先搜索（BFS）进行二着色 +2. 如果在染色过程中发现相邻顶点颜色相同，则该图不是二分图 +3. 如果能够成功完成二着色，则该图是二分图 + +## 1.4 二分图的应用场景 + +1. **任务分配**：将工人和任务分别作为两个顶点集，边表示工人可以完成的任务 +2. **婚姻匹配**：将男性和女性分别作为两个顶点集，边表示可能的配对关系 +3. **网络流问题**：许多网络流问题可以转化为二分图最大匹配问题 +4. **资源分配**：将资源和需求分别作为两个顶点集，边表示资源可以满足的需求 + +## 1.5 二分图的基本算法 + +1. **匈牙利算法**：用于求解二分图的最大匹配 +2. **Hopcroft-Karp算法**：用于求解二分图的最大匹配，时间复杂度更优 +3. **网络流算法**：将二分图最大匹配问题转化为最大流问题求解 + +## 1.6 二分图的判定代码 + +```python +def is_bipartite(graph): + """ + 判断图是否为二分图 + :param graph: 邻接表表示的图 + :return: 是否为二分图 + """ + n = len(graph) + colors = [0] * n # 0表示未染色，1和-1表示两种不同的颜色 + + def dfs(node, color): + colors[node] = color + for neighbor in graph[node]: + if colors[neighbor] == color: + return False + if colors[neighbor] == 0 and not dfs(neighbor, -color): + return False + return True + + for i in range(n): + if colors[i] == 0 and not dfs(i, 1): + return False + return True +``` + +## 1.7 常见问题类型 + +1. 判断图是否为二分图 +2. 求二分图的最大匹配 +3. 求二分图的最小点覆盖 +4. 求二分图的最大独立集 +5. 求二分图的最小路径覆盖 + +## 1.8 注意事项 + +1. 在实现二分图算法时，需要注意图的表示方式（邻接表或邻接矩阵） +2. 对于大规模图，需要考虑算法的空间复杂度 +3. 在实际应用中，可能需要根据具体问题对基本算法进行优化 +4. 处理有向图时，需要先将其转换为无向图再判断是否为二分图 + +## 练习题目 + +- [0785. 判断二分图](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/is-graph-bipartite.md) + +- [二分图基础题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E4%BA%8C%E5%88%86%E5%9B%BE%E5%9F%BA%E7%A1%80%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/docs/06_graph/06_13_graph_bipartite_matching.md b/docs/06_graph/06_13_graph_bipartite_matching.md new file mode 100644 index 00000000..ce29d25d --- /dev/null +++ b/docs/06_graph/06_13_graph_bipartite_matching.md @@ -0,0 +1,285 @@ +## 1. 二分图最大匹配简介 + +> **二分图最大匹配（Maximum Bipartite Matching）**：图论中的一个重要问题。在二分图中，我们需要找到最大的匹配数，即最多可以有多少对顶点之间形成匹配。 + +- **二分图**：图中的顶点可以被分成两个独立的集合，使得每条边的两个端点分别属于这两个集合。 +- **匹配**：一组边的集合，其中任意两条边都没有共同的顶点。 +- **最大匹配**：包含边数最多的匹配。 + +### 1.1 应用场景 + +二分图最大匹配在实际应用中有广泛的应用： + +1. **任务分配**：将任务分配给工人，每个工人只能完成一个任务 +2. **婚姻匹配**：将男生和女生进行配对 +3. **网络流问题**：可以转化为最大流问题求解 +4. **资源分配**：将资源分配给需求方 +5. **学生选课**：将学生与课程进行匹配 +6. **网络路由**：将数据包与可用路径进行匹配 + +### 1.2 优化方法 + +1. **使用邻接表**：对于稀疏图，使用邻接表可以显著减少空间复杂度 +2. **双向搜索**：同时从左右两侧进行搜索，可以减少搜索次数 +3. **预处理**：对图进行预处理，去除不可能形成匹配的边 +4. **贪心匹配**：先进行贪心匹配，减少后续搜索的复杂度 +5. **并行处理**：对于大规模图，可以使用并行算法提高效率 + +## 2. 匈牙利算法 + +### 2.1 匈牙利算法基本思想 + +匈牙利算法（Hungarian Algorithm）是求解二分图最大匹配的经典算法。其基本思想是： + +1. 从左侧集合中任选一个未匹配的点开始 +2. 尝试寻找增广路径 +3. 如果找到增广路径，则更新匹配 +4. 重复以上步骤直到无法找到增广路径 + +### 2.2 匈牙利算法实现代码 + +```python +def max_bipartite_matching(graph, left_size, right_size): + # 初始化匹配数组 + match_right = [-1] * right_size + result = 0 + + # 对左侧每个顶点尝试匹配 + for left in range(left_size): + # 记录右侧顶点是否被访问过 + visited = [False] * right_size + + # 如果找到增广路径，则匹配数加1 + if find_augmenting_path(graph, left, visited, match_right): + result += 1 + + return result + +def find_augmenting_path(graph, left, visited, match_right): + # 遍历右侧所有顶点 + for right in range(len(graph[left])): + # 如果存在边且右侧顶点未被访问 + if graph[left][right] and not visited[right]: + visited[right] = True + + # 如果右侧顶点未匹配，或者可以找到新的匹配 + if match_right[right] == -1 or find_augmenting_path(graph, match_right[right], visited, match_right): + match_right[right] = left + return True + + return False +``` + +### 2.3 匈牙利算法时间复杂度 + +- 匈牙利算法的时间复杂度为 O(VE)，其中 V 是顶点数，E 是边数 +- 使用邻接矩阵存储图时，空间复杂度为 O(V²) +- 使用邻接表存储图时，空间复杂度为 O(V + E) + + +## 3. Hopcroft-Karp 算法 + +### 3.1 Hopcroft-Karp 算法基本思想 + +Hopcroft-Karp 算法是求解二分图最大匹配的一个更高效的算法，时间复杂度为 O(√VE)。其基本思想是： + +1. 同时寻找多条不相交的增广路径 +2. 使用 BFS 分层，然后使用 DFS 寻找增广路径 +3. 每次迭代可以找到多条增广路径 + + +### 3.2 Hopcroft-Karp 算法实现代码 + +```python +from collections import deque + +def hopcroft_karp(graph, left_size, right_size): + # 初始化匹配数组 + match_left = [-1] * left_size + match_right = [-1] * right_size + result = 0 + + while True: + # 使用 BFS 寻找增广路径 + dist = [-1] * left_size + queue = deque() + + # 将未匹配的左侧顶点加入队列 + for i in range(left_size): + if match_left[i] == -1: + dist[i] = 0 + queue.append(i) + + # BFS 分层 + while queue: + left = queue.popleft() + for right in graph[left]: + if match_right[right] == -1: + # 找到增广路径 + break + if dist[match_right[right]] == -1: + dist[match_right[right]] = dist[left] + 1 + queue.append(match_right[right]) + + # 使用 DFS 寻找增广路径 + def dfs(left): + for right in graph[left]: + if match_right[right] == -1 or \ + (dist[match_right[right]] == dist[left] + 1 and \ + dfs(match_right[right])): + match_left[left] = right + match_right[right] = left + return True + return False + + # 尝试为每个未匹配的左侧顶点寻找增广路径 + found = False + for i in range(left_size): + if match_left[i] == -1 and dfs(i): + found = True + result += 1 + + if not found: + break + + return result +``` + +### 3.3 Hopcroft-Karp 算法复杂度 + +- **时间复杂度**：O(√VE)，其中 V 是顶点数，E 是边数 +- **空间复杂度**：O(V + E) +- **优点**： + 1. 比匈牙利算法更高效 + 2. 适合处理大规模图 + 3. 可以并行化实现 +- **缺点**： + 1. 实现相对复杂 + 2. 常数因子较大 + 3. 对于小规模图可能不如匈牙利算法 + +### 3.4 Hopcroft-Karp 算法优化 + +1. **双向 BFS**：同时从左右两侧进行 BFS，减少搜索空间 +2. **动态分层**：根据当前匹配状态动态调整分层策略 +3. **预处理**：使用贪心算法进行初始匹配 +4. **并行化**：利用多线程或分布式计算提高效率 + +## 4. 网络流算法 + +### 4.1 网络流算法实现步骤 + +二分图最大匹配问题可以转化为最大流问题来求解。具体步骤如下： + +1. 添加源点和汇点 +2. 将二分图转化为网络流图 +3. 使用最大流算法求解 + +### 4.2 网络流算法实现代码 + +```python +from collections import defaultdict + +def max_flow_bipartite_matching(graph, left_size, right_size): + # 构建网络流图 + flow_graph = defaultdict(dict) + source = left_size + right_size + sink = source + 1 + + # 添加源点到左侧顶点的边 + for i in range(left_size): + flow_graph[source][i] = 1 + flow_graph[i][source] = 0 + + # 添加右侧顶点到汇点的边 + for i in range(right_size): + flow_graph[left_size + i][sink] = 1 + flow_graph[sink][left_size + i] = 0 + + # 添加二分图中的边 + for i in range(left_size): + for j in graph[i]: + flow_graph[i][left_size + j] = 1 + flow_graph[left_size + j][i] = 0 + + # 使用 Ford-Fulkerson 算法求解最大流 + def bfs(): + parent = [-1] * (sink + 1) + queue = deque([source]) + parent[source] = -2 + + while queue: + u = queue.popleft() + for v, capacity in flow_graph[u].items(): + if parent[v] == -1 and capacity > 0: + parent[v] = u + if v == sink: + return parent + queue.append(v) + return None + + def ford_fulkerson(): + max_flow = 0 + while True: + parent = bfs() + if not parent: + break + + # 找到增广路径上的最小容量 + v = sink + min_capacity = float('inf') + while v != source: + u = parent[v] + min_capacity = min(min_capacity, flow_graph[u][v]) + v = u + + # 更新流量 + v = sink + while v != source: + u = parent[v] + flow_graph[u][v] -= min_capacity + flow_graph[v][u] += min_capacity + v = u + + max_flow += min_capacity + + return max_flow + + return ford_fulkerson() +``` + +### 4.3 网络流算法复杂度 + +- **时间复杂度**： + 1. Ford-Fulkerson 算法：O(VE²) + 2. Dinic 算法：O(V²E) + 3. ISAP 算法：O(V²E) +- **空间复杂度**：O(V + E) + +## 5. 算法复杂度分析 + +1. **匈牙利算法** + - 时间复杂度：O(VE) + - 优点：实现简单，容易理解 + - 缺点：对于大规模图效率较低 + - 适用场景：小规模图，需要快速实现 + +2. **Hopcroft-Karp 算法** + - 时间复杂度：O(√VE) + - 优点：效率更高，适合大规模图 + - 缺点：实现相对复杂 + - 适用场景：大规模图，需要高效算法 + +3. **网络流算法** + - 时间复杂度：O(VE²) 或 O(V²E) + - 优点：可以处理更复杂的问题，如带权匹配 + - 缺点：实现复杂，常数较大 + - 适用场景：带权匹配，复杂约束条件 + +## 练习题目 + +- [LCP 04. 覆盖](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCP/broken-board-dominoes.md) +- [1947. 最大兼容性评分和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/maximum-compatibility-score-sum.md) +- [1595. 连通两组点的最小成本](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/minimum-cost-to-connect-two-groups-of-points.md) + +- [二分图最大匹配题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E4%BA%8C%E5%88%86%E5%9B%BE%E6%9C%80%E5%A4%A7%E5%8C%B9%E9%85%8D%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/docs/06_graph/index.md b/docs/06_graph/index.md new file mode 100644 index 00000000..249691cd --- /dev/null +++ b/docs/06_graph/index.md @@ -0,0 +1,15 @@ +## 本章内容 + +- [6.1 图的定义和分类](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_01_graph_basic.md) +- [6.2 图的存储结构和问题应用](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_02_graph_structure.md) +- [6.3 深度优先搜索](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_03_graph_dfs.md) +- [6.4 广度优先搜索](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_04_graph_bfs.md) +- [6.5 图的拓扑排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_05_graph_topological_sorting.md) +- [6.6 图的最小生成树](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_06_graph_minimum_spanning_tree.md) +- [6.7 单源最短路径（一）](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_07_graph_shortest_path_01.md) +- [6.8 单源最短路径（二）](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_08_graph_shortest_path_02.md) +- [6.9 多源最短路径](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_09_graph_multi_source_shortest_path.md) +- [6.10 次短路径](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_10_graph_the_second_shortest_path.md) +- [6.11 差分约束系统](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_11_graph_system_of_difference_constraints.md) +- [6.12 二分图基础](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_12_graph_bipartite_basic.md) +- [6.13 二分图最大匹配](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_13_graph_bipartite_matching.md) diff --git a/Contents/09.Algorithm-Base/01.Enumeration-Algorithm/01.Enumeration-Algorithm.md b/docs/07_algorithm/07_01_enumeration_algorithm.md similarity index 91% rename from Contents/09.Algorithm-Base/01.Enumeration-Algorithm/01.Enumeration-Algorithm.md rename to docs/07_algorithm/07_01_enumeration_algorithm.md index dbd4679f..bf8b5080 100644 --- a/Contents/09.Algorithm-Base/01.Enumeration-Algorithm/01.Enumeration-Algorithm.md +++ b/docs/07_algorithm/07_01_enumeration_algorithm.md @@ -277,4 +277,15 @@ class Solution: ##### 思路 1：复杂度分析 - **时间复杂度**：$O(n^2)$。 -- **空间复杂度**：$O(1)$。 \ No newline at end of file +- **空间复杂度**：$O(1)$。 + +## 练习题目 + +- [0001. 两数之和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/two-sum.md) +- [0204. 计数质数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/count-primes.md) +- [1925. 统计平方和三元组的数目](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/count-square-sum-triples.md) +- [2427. 公因子的数目](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2400-2499/number-of-common-factors.md) +- [LCR 180. 文件组合](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof.md) +- [2249. 统计圆内格点数目](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2200-2299/count-lattice-points-inside-a-circle.md) + +- [枚举算法题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%9E%9A%E4%B8%BE%E7%AE%97%E6%B3%95%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/Contents/09.Algorithm-Base/02.Recursive-Algorithm/01.Recursive-Algorithm.md b/docs/07_algorithm/07_02_recursive_algorithm.md similarity index 94% rename from Contents/09.Algorithm-Base/02.Recursive-Algorithm/01.Recursive-Algorithm.md rename to docs/07_algorithm/07_02_recursive_algorithm.md index 2884b423..050e9061 100644 --- a/Contents/09.Algorithm-Base/02.Recursive-Algorithm/01.Recursive-Algorithm.md +++ b/docs/07_algorithm/07_02_recursive_algorithm.md @@ -315,6 +315,17 @@ class Solution: - **时间复杂度**：$O(n)$，其中 $n$ 是二叉树的节点数目。 - **空间复杂度**：$O(n)$。递归函数需要用到栈空间，栈空间取决于递归深度，最坏情况下递归深度为 $n$，所以空间复杂度为 $O(n)$。 +## 练习题目 + +- [0509. 斐波那契数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/fibonacci-number.md) +- [0070. 爬楼梯](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/climbing-stairs.md) +- [0226. 翻转二叉树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/invert-binary-tree.md) +- [0206. 反转链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/reverse-linked-list.md) +- [0092. 反转链表 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/reverse-linked-list-ii.md) +- [0779. 第K个语法符号](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/k-th-symbol-in-grammar.md) + +- [递归算法题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E9%80%92%E5%BD%92%E7%AE%97%E6%B3%95%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【书籍】算法竞赛入门经典：训练指南 - 刘汝佳，陈锋 著 diff --git a/Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/01.Divide-And-Conquer-Algorithm.md b/docs/07_algorithm/07_03_divide_and_conquer_algorithm.md similarity index 93% rename from Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/01.Divide-And-Conquer-Algorithm.md rename to docs/07_algorithm/07_03_divide_and_conquer_algorithm.md index 574ba248..fb1d8b90 100644 --- a/Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/01.Divide-And-Conquer-Algorithm.md +++ b/docs/07_algorithm/07_03_divide_and_conquer_algorithm.md @@ -246,6 +246,17 @@ class Solution: return left if nums[left] == target else -1 ``` +## 练习题目 + +- [0050. Pow(x, n)](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/powx-n.md) +- [0169. 多数元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/majority-element.md) +- [0053. 最大子数组和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/maximum-subarray.md) +- [0932. 漂亮数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/beautiful-array.md) +- [0241. 为运算表达式设计优先级](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/different-ways-to-add-parentheses.md) +- [0023. 合并 K 个升序链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-k-sorted-lists.md) + +- [分治算法题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%88%86%E6%B2%BB%E7%AE%97%E6%B3%95%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【书籍】趣学算法 - 陈小玉 著 diff --git a/Contents/09.Algorithm-Base/04.Backtracking-Algorithm/01.Backtracking-Algorithm.md b/docs/07_algorithm/07_04_backtracking_algorithm.md similarity index 87% rename from Contents/09.Algorithm-Base/04.Backtracking-Algorithm/01.Backtracking-Algorithm.md rename to docs/07_algorithm/07_04_backtracking_algorithm.md index 8a9dde5e..0950bf5e 100644 --- a/Contents/09.Algorithm-Base/04.Backtracking-Algorithm/01.Backtracking-Algorithm.md +++ b/docs/07_algorithm/07_04_backtracking_algorithm.md @@ -104,7 +104,7 @@ backtracking(nums) 1. **明确所有选择**：画出搜索过程的决策树，根据决策树来确定搜索路径。 2. **明确终止条件**：推敲出递归的终止条件，以及递归终止时的要执行的处理方法。 -3. **将决策树和终止条件翻译成代码：** +3. **将决策树和终止条件翻译成代码**： 1. 定义回溯函数（明确函数意义、传入参数、返回结果等）。 2. 书写回溯函数主体（给出约束条件、选择元素、递归搜索、撤销选择部分）。 3. 明确递归终止条件（给出递归终止条件，以及递归终止时的处理方法）。 @@ -203,18 +203,14 @@ for i in range(len(nums)): # 枚举可选元素列表 下面我们根据回溯算法三步走，写出对应的回溯算法。 -1. **明确所有选择**：根据数组中每个位置上的元素选与不选两种选择，画出决策树，如下图所示。 - - - ![子集的决策树](https://qcdn.itcharge.cn/images/20220425210640.png) +![子集的决策树](https://qcdn.itcharge.cn/images/20220425210640.png) +1. **明确所有选择**：根据数组中每个位置上的元素选与不选两种选择，画出决策树，如上图所示。 2. **明确终止条件**： - - 当遍历到决策树的叶子节点时，就终止了。即当前路径搜索到末尾时，递归终止。 - -3. **将决策树和终止条件翻译成代码：** +3. **将决策树和终止条件翻译成代码**： 1. 定义回溯函数： - - - `backtracking(nums, index):` 函数的传入参数是 $nums$（可选数组列表）和 $index$（代表当前正在考虑元素是 $nums[i]$ ），全局变量是 $res$（存放所有符合条件结果的集合数组）和 $path$（存放当前符合条件的结果）。 + - `backtracking(nums, index):` 函数的传入参数是 $nums$（可选数组列表）和 $index$（代表当前正在考虑元素是 $nums[i]$），全局变量是 $res$（存放所有符合条件结果的集合数组）和 $path$（存放当前符合条件的结果）。 - `backtracking(nums, index):` 函数代表的含义是：在选择 $nums[index]$ 的情况下，递归选择剩下的元素。 2. 书写回溯函数主体（给出选择元素、递归搜索、撤销选择部分）。 - 从当前正在考虑元素，到数组结束为止，枚举出所有可选的元素。对于每一个可选元素： @@ -228,7 +224,6 @@ for i in range(len(nums)): # 枚举可选元素列表 backtracking(nums, i + 1) # 递归搜索 path.pop() # 撤销选择 ``` - 3. 明确递归终止条件（给出递归终止条件，以及递归终止时的处理方法）。 - 当遍历到决策树的叶子节点时，就终止了。也就是当正在考虑的元素位置到达数组末尾（即 $start \ge len(nums)$）时，递归停止。 - 从决策树中也可以看出，子集需要存储的答案集合应该包含决策树上所有的节点，应该需要保存递归搜索的所有状态。所以无论是否达到终止条件，我们都应该将当前符合条件的结果放入到集合中。 @@ -301,19 +296,14 @@ class Solution: 下面我们根据回溯算法三步走，写出对应的回溯算法。 -1. **明确所有选择**：根据棋盘中当前行的所有列位置上是否选择放置皇后，画出决策树，如下图所示。 - - - ![n 皇后问题的决策树](https://qcdn.itcharge.cn/images/20220426095225.png) +![](https://qcdn.itcharge.cn/images/20220426095225.png) +1. **明确所有选择**：根据棋盘中当前行的所有列位置上是否选择放置皇后，画出决策树，如上图所示。 2. **明确终止条件**： - - 当遍历到决策树的叶子节点时，就终止了。也就是在最后一行放置完皇后时，递归终止。 - 3. **将决策树和终止条件翻译成代码：** - 1. 定义回溯函数： - - - 首先我们先使用一个 $n * n$ 大小的二维矩阵 $chessboard$ 来表示当前棋盘，$chessboard$ 中的字符 `Q` 代表皇后，`.` 代表空位，初始都为 `.`。 + - 首先我们先使用一个 $n \times n$ 大小的二维矩阵 $chessboard$ 来表示当前棋盘，$chessboard$ 中的字符 `Q` 代表皇后，`.` 代表空位，初始都为 `.`。 - 然后定义回溯函数 `backtrack(chessboard, row): ` 函数的传入参数是 $chessboard$（棋盘数组）和 $row$（代表当前正在考虑放置第 $row$ 行皇后），全局变量是 $res$（存放所有符合条件结果的集合数组）。 - `backtrack(chessboard, row):` 函数代表的含义是：在放置好第 $row$ 行皇后的情况下，递归放置剩下行的皇后。 2. 书写回溯函数主体（给出选择元素、递归搜索、撤销选择部分）。 @@ -322,38 +312,36 @@ class Solution: - 选择元素：选择 $row, col$ 位置放置皇后，将其棋盘对应位置设置为 `Q`。 - 递归搜索：在该位置放置皇后的情况下，继续递归考虑下一行。 - 撤销选择：将棋盘上 $row, col$ 位置设置为 `.`。 + ```python + # 判断当前位置 row, col 是否与之前放置的皇后发生冲突 + def isValid(self, n: int, row: int, col: int, chessboard: List[List[str]]): + for i in range(row): + if chessboard[i][col] == 'Q': + return False + + i, j = row - 1, col - 1 + while i >= 0 and j >= 0: + if chessboard[i][j] == 'Q': + return False + i -= 1 + j -= 1 + i, j = row - 1, col + 1 + while i >= 0 and j < n: + if chessboard[i][j] == 'Q': + return False + i -= 1 + j += 1 - ```python - # 判断当前位置 row, col 是否与之前放置的皇后发生冲突 - def isValid(self, n: int, row: int, col: int, chessboard: List[List[str]]): - for i in range(row): - if chessboard[i][col] == 'Q': - return False - - i, j = row - 1, col - 1 - while i >= 0 and j >= 0: - if chessboard[i][j] == 'Q': - return False - i -= 1 - j -= 1 - i, j = row - 1, col + 1 - while i >= 0 and j < n: - if chessboard[i][j] == 'Q': - return False - i -= 1 - j += 1 - - return True - ``` + return True + ``` ```python - for col in range(n): # 枚举可放置皇后的列 - if self.isValid(n, row, col, chessboard): # 如果该位置与之前放置的皇后不发生冲突 - chessboard[row][col] = 'Q' # 选择 row, col 位置放置皇后 - backtrack(row + 1, chessboard) # 递归放置 row + 1 行之后的皇后 - chessboard[row][col] = '.' # 撤销选择 row, col 位置 + for col in range(n): # 枚举可放置皇后的列 + if self.isValid(n, row, col, chessboard): # 如果该位置与之前放置的皇后不发生冲突 + chessboard[row][col] = 'Q' # 选择 row, col 位置放置皇后 + backtrack(row + 1, chessboard) # 递归放置 row + 1 行之后的皇后 + chessboard[row][col] = '.' # 撤销选择 row, col 位置 ``` - 3. 明确递归终止条件（给出递归终止条件，以及递归终止时的处理方法）。 - 当遍历到决策树的叶子节点时，就终止了。也就是在最后一行放置完皇后（即 $row == n$）时，递归停止。 - 递归停止时，将当前符合条件的棋盘转换为答案需要的形式，然后将其存入答案数组 $res$ 中即可。 @@ -409,6 +397,20 @@ class Solution: - **时间复杂度**：$O(n!)$，其中 $n$ 是皇后数量。 - **空间复杂度**：$O(n^2)$，其中 $n$ 是皇后数量。递归调用层数不会超过 $n$，每个棋盘的空间复杂度为 $O(n^2)$，所以空间复杂度为 $O(n^2)$。 +## 练习题目 + +- [0046. 全排列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/permutations.md) +- [0047. 全排列 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/permutations-ii.md) +- [0022. 括号生成](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/generate-parentheses.md) +- [0017. 电话号码的字母组合](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/letter-combinations-of-a-phone-number.md) +- [0039. 组合总和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/combination-sum.md) +- [0040. 组合总和 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/combination-sum-ii.md) +- [0078. 子集](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/subsets.md) +- [0090. 子集 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/subsets-ii.md) +- [0079. 单词搜索](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/word-search.md) + +- [回溯算法题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%9B%9E%E6%BA%AF%E7%AE%97%E6%B3%95%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【题解】[回溯算法入门级详解 + 练习（持续更新） - 全排列 - 力扣](https://leetcode.cn/problems/permutations/solution/hui-su-suan-fa-python-dai-ma-java-dai-ma-by-liweiw/) diff --git a/Contents/09.Algorithm-Base/05.Greedy-Algorithm/01.Greedy-Algorithm.md b/docs/07_algorithm/07_05_greedy_algorithm.md similarity index 91% rename from Contents/09.Algorithm-Base/05.Greedy-Algorithm/01.Greedy-Algorithm.md rename to docs/07_algorithm/07_05_greedy_algorithm.md index d735adc7..9ea54759 100644 --- a/Contents/09.Algorithm-Base/05.Greedy-Algorithm/01.Greedy-Algorithm.md +++ b/docs/07_algorithm/07_05_greedy_algorithm.md @@ -231,6 +231,20 @@ class Solution: - **时间复杂度**：$O(n \times \log n)$，其中 $n$ 是区间的数量。 - **空间复杂度**：$O(\log n)$。 +## 练习题目 + +- [0455. 分发饼干](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/assign-cookies.md) +- [0860. 柠檬水找零](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/lemonade-change.md) +- [0135. 分发糖果](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/candy.md) +- [0055. 跳跃游戏](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/jump-game.md) +- [0045. 跳跃游戏 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/jump-game-ii.md) +- [0881. 救生艇](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/boats-to-save-people.md) +- [0435. 无重叠区间](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/non-overlapping-intervals.md) +- [0452. 用最少数量的箭引爆气球](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/minimum-number-of-arrows-to-burst-balloons.md) +- [1710. 卡车上的最大单元数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/maximum-units-on-a-truck.md) + +- [贪心算法题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E8%B4%AA%E5%BF%83%E7%AE%97%E6%B3%95%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【博文】[贪心 - OI Wiki](https://oi-wiki.org/basic/greedy/) diff --git a/Contents/09.Algorithm-Base/06.Bit-Operation/01.Bit-Operation.md b/docs/07_algorithm/07_06_bit_operation.md similarity index 95% rename from Contents/09.Algorithm-Base/06.Bit-Operation/01.Bit-Operation.md rename to docs/07_algorithm/07_06_bit_operation.md index 2966ebbe..52bd9791 100644 --- a/Contents/09.Algorithm-Base/06.Bit-Operation/01.Bit-Operation.md +++ b/docs/07_algorithm/07_06_bit_operation.md @@ -310,6 +310,17 @@ class Solution: return sub_sets # 返回所有子集 ``` +## 练习题目 + +- [0190. 颠倒二进制位](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/reverse-bits.md) +- [0191. 位1的个数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/number-of-1-bits.md) +- [0201. 数字范围按位与](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/bitwise-and-of-numbers-range.md) +- [0136. 只出现一次的数字](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/single-number.md) +- [0137. 只出现一次的数字 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/single-number-ii.md) +- [0260. 只出现一次的数字 III](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/single-number-iii.md) + +- [位运算题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E4%BD%8D%E8%BF%90%E7%AE%97%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【博文】[Python 中的按位运算符 |【生长吧！Python!】- 云社区 - 华为云](https://bbs.huaweicloud.com/blogs/280901) diff --git a/docs/07_algorithm/index.md b/docs/07_algorithm/index.md new file mode 100644 index 00000000..1e2d7463 --- /dev/null +++ b/docs/07_algorithm/index.md @@ -0,0 +1,8 @@ +## 本章内容 + +- [7.1 枚举算法](https://github.com/ITCharge/AlgoNote/tree/main/docs/07_algorithm/07_01_enumeration_algorithm.md) +- [7.2 递归算法](https://github.com/ITCharge/AlgoNote/tree/main/docs/07_algorithm/07_02_recursive_algorithm.md) +- [7.3 分治算法](https://github.com/ITCharge/AlgoNote/tree/main/docs/07_algorithm/07_03_divide_and_conquer_algorithm.md) +- [7.4 回溯算法](https://github.com/ITCharge/AlgoNote/tree/main/docs/07_algorithm/07_04_backtracking_algorithm.md) +- [7.5 贪心算法](https://github.com/ITCharge/AlgoNote/tree/main/docs/07_algorithm/07_05_greedy_algorithm.md) +- [7.6 位运算](https://github.com/ITCharge/AlgoNote/tree/main/docs/07_algorithm/07_06_bit_operation.md) diff --git a/Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/01.Dynamic-Programming-Basic.md b/docs/08_dynamic_programming/08_01_dynamic_programming_basic.md similarity index 96% rename from Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/01.Dynamic-Programming-Basic.md rename to docs/08_dynamic_programming/08_01_dynamic_programming_basic.md index f1480280..4d4e4402 100644 --- a/Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/01.Dynamic-Programming-Basic.md +++ b/docs/08_dynamic_programming/08_01_dynamic_programming_basic.md @@ -384,6 +384,14 @@ class Solution: - **时间复杂度**：$O(m \times n)$。初始条件赋值的时间复杂度为 $O(m + n)$，两重循环遍历的时间复杂度为 $O(m \times n)$，所以总体时间复杂度为 $O(m \times n)$。 - **空间复杂度**：$O(m \times n)$。用到了二维数组保存状态，所以总体空间复杂度为 $O(m \times n)$。因为 $dp[i][j]$ 的状态只依赖于上方值 $dp[i - 1][j]$ 和左侧值 $dp[i][j - 1]$，而我们在进行遍历时的顺序刚好是从上至下、从左到右。所以我们可以使用长度为 $n$ 的一维数组来保存状态，从而将空间复杂度优化到 $O(n)$。 +## 题目练习 + +- [0509. 斐波那契数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/fibonacci-number.md) +- [0070. 爬楼梯](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/climbing-stairs.md) +- [0062. 不同路径](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/unique-paths.md) + +- [动态规划基础题目](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92%E5%9F%BA%E7%A1%80%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【文章】[动态规划基础 - OI Wiki](https://oi-wiki.org/dp/basic/) diff --git a/Contents/10.Dynamic-Programming/02.Memoization/01.Memoization.md b/docs/08_dynamic_programming/08_02_memoization_search.md similarity index 95% rename from Contents/10.Dynamic-Programming/02.Memoization/01.Memoization.md rename to docs/08_dynamic_programming/08_02_memoization_search.md index fdfb05a0..b305026f 100644 --- a/Contents/10.Dynamic-Programming/02.Memoization/01.Memoization.md +++ b/docs/08_dynamic_programming/08_02_memoization_search.md @@ -277,6 +277,15 @@ class Solution: - **时间复杂度**：$O(n)$。 - **空间复杂度**：$O(n)$。 +## 题目练习 + +- [0494. 目标和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/target-sum.md) +- [1137. 第 N 个泰波那契数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/n-th-tribonacci-number.md) +- [0576. 出界的路径数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/out-of-boundary-paths.md) + + +- [记忆化搜索题目](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E8%AE%B0%E5%BF%86%E5%8C%96%E6%90%9C%E7%B4%A2%E9%A2%98%E7%9B%AE) + ## 参考资料 1. 【文章】[记忆化搜索 - OI Wiki](https://oi-wiki.org/dp/memo/) diff --git a/Contents/10.Dynamic-Programming/03.Linear-DP/01.Linear-DP-01.md b/docs/08_dynamic_programming/08_03_linear_dp_01.md similarity index 96% rename from Contents/10.Dynamic-Programming/03.Linear-DP/01.Linear-DP-01.md rename to docs/08_dynamic_programming/08_03_linear_dp_01.md index 2d63f589..3a2e1705 100644 --- a/Contents/10.Dynamic-Programming/03.Linear-DP/01.Linear-DP-01.md +++ b/docs/08_dynamic_programming/08_03_linear_dp_01.md @@ -739,6 +739,18 @@ class Solution: - **时间复杂度**：$O(n \times m)$，其中 $n$、$m$ 分别是字符串 $word1$、$word2$ 的长度。两重循环遍历的时间复杂度是 $O(n \times m)$，所以总的时间复杂度为 $O(n \times m)$。 - **空间复杂度**：$O(n \times m)$。用到了二维数组保存状态，所以总体空间复杂度为 $O(n \times m)$。 +## 题目练习 + +- [0300. 最长递增子序列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/longest-increasing-subsequence.md) +- [0053. 最大子数组和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/maximum-subarray.md) +- [0198. 打家劫舍](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/house-robber.md) +- [0213. 打家劫舍 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/house-robber-ii.md) +- [0873. 最长的斐波那契子序列的长度](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/length-of-longest-fibonacci-subsequence.md) +- [1143. 最长公共子序列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/longest-common-subsequence.md) + +- [单串线性 DP 问题题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%8D%95%E4%B8%B2%E7%BA%BF%E6%80%A7-dp-%E9%97%AE%E9%A2%98) +- [双串线性 DP 问题题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%8F%8C%E4%B8%B2%E7%BA%BF%E6%80%A7-dp-%E9%97%AE%E9%A2%98) + ## 参考资料 - 【书籍】算法竞赛进阶指南 diff --git a/Contents/10.Dynamic-Programming/03.Linear-DP/02.Linear-DP-02.md b/docs/08_dynamic_programming/08_04_linear_dp_02.md similarity index 91% rename from Contents/10.Dynamic-Programming/03.Linear-DP/02.Linear-DP-02.md rename to docs/08_dynamic_programming/08_04_linear_dp_02.md index 209222d9..ee77a993 100644 --- a/Contents/10.Dynamic-Programming/03.Linear-DP/02.Linear-DP-02.md +++ b/docs/08_dynamic_programming/08_04_linear_dp_02.md @@ -370,6 +370,18 @@ class Solution: - **时间复杂度**：$O(n \sqrt{n})$。外层循环遍历的时间复杂度是 $O(n)$，内层循环遍历的时间复杂度是 $O(\sqrt{n})$，所以总体时间复杂度为 $O(n \sqrt{n})$。 - **空间复杂度**：$O(n)$。用到了一维数组保存状态，所以总体空间复杂度为 $O(n)$。 +## 题目练习 + +- [0718. 最长重复子数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/maximum-length-of-repeated-subarray.md) +- [0072. 编辑距离](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/edit-distance.md) +- [0064. 最小路径和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/minimum-path-sum.md) +- [0221. 最大正方形](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/maximal-square.md) +- [0343. 整数拆分](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/integer-break.md) +- [0650. 两个键的键盘](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/2-keys-keyboard.md) + +- [矩阵线性 DP 问题题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E7%9F%A9%E9%98%B5%E7%BA%BF%E6%80%A7-dp-%E9%97%AE%E9%A2%98) +- [矩阵线性 DP 问题题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%97%A0%E4%B8%B2%E7%BA%BF%E6%80%A7-dp-%E9%97%AE%E9%A2%98) + ## 参考资料 - 【书籍】算法竞赛进阶指南 diff --git a/Contents/10.Dynamic-Programming/04.Knapsack-Problem/01.Knapsack-Problem-01.md b/docs/08_dynamic_programming/08_05_knapsack_problem_01.md similarity index 96% rename from Contents/10.Dynamic-Programming/04.Knapsack-Problem/01.Knapsack-Problem-01.md rename to docs/08_dynamic_programming/08_05_knapsack_problem_01.md index 71e90168..bc825b04 100644 --- a/Contents/10.Dynamic-Programming/04.Knapsack-Problem/01.Knapsack-Problem-01.md +++ b/docs/08_dynamic_programming/08_05_knapsack_problem_01.md @@ -262,6 +262,15 @@ class Solution: - **时间复杂度**：$O(n \times target)$，其中 $n$ 为数组 $nums$ 的元素个数，$target$ 是整个数组元素和的一半。 - **空间复杂度**：$O(target)$。 +## 练习题目 + +- [0416. 分割等和子集](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/partition-equal-subset-sum.md) +- [0494. 目标和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/target-sum.md) +- [1049. 最后一块石头的重量 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/last-stone-weight-ii.md) + +- [0-1 背包问题题目列表](https://github.com/itcharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#0-1-%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98%E9%A2%98%E7%9B%AE) + + ## 参考资料 - 【资料】[背包九讲 - 崔添翼](https://github.com/tianyicui/pack) diff --git a/Contents/10.Dynamic-Programming/04.Knapsack-Problem/02.Knapsack-Problem-02.md b/docs/08_dynamic_programming/08_06_knapsack_problem_02.md similarity index 97% rename from Contents/10.Dynamic-Programming/04.Knapsack-Problem/02.Knapsack-Problem-02.md rename to docs/08_dynamic_programming/08_06_knapsack_problem_02.md index 5563041b..c6e11f91 100644 --- a/Contents/10.Dynamic-Programming/04.Knapsack-Problem/02.Knapsack-Problem-02.md +++ b/docs/08_dynamic_programming/08_06_knapsack_problem_02.md @@ -236,6 +236,15 @@ class Solution: - **时间复杂度**：$O(n \times W)$，其中 $n$ 为物品种类数量，$W$ 为背包的载重上限。 - **空间复杂度**：$O(W)$。 +## 练习题目 + +- [0279. 完全平方数]() +- [0322. 零钱兑换]() +- [0518. 零钱兑换 II]() +- [0377. 组合总和 IV]() + +- [完全背包问题题目列表](https://github.com/itcharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%AE%8C%E5%85%A8%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【资料】[背包九讲 - 崔添翼](https://github.com/tianyicui/pack) diff --git a/Contents/10.Dynamic-Programming/04.Knapsack-Problem/03.Knapsack-Problem-03.md b/docs/08_dynamic_programming/08_07_knapsack_problem_03.md similarity index 98% rename from Contents/10.Dynamic-Programming/04.Knapsack-Problem/03.Knapsack-Problem-03.md rename to docs/08_dynamic_programming/08_07_knapsack_problem_03.md index d2a8762e..51a3231f 100644 --- a/Contents/10.Dynamic-Programming/04.Knapsack-Problem/03.Knapsack-Problem-03.md +++ b/docs/08_dynamic_programming/08_07_knapsack_problem_03.md @@ -204,6 +204,10 @@ class Solution: - **时间复杂度**：$O(W \times \sum \log_2{count[i]})$，其中 $W$ 为背包的载重上限，$count[i]$ 是第 $i$ 种物品的数量。 - **空间复杂度**：$O(W)$。 +## 练习题目 + +- [多重背包问题题目列表](https://github.com/itcharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%A4%9A%E9%87%8D%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【资料】[背包九讲 - 崔添翼](https://github.com/tianyicui/pack) diff --git a/Contents/10.Dynamic-Programming/04.Knapsack-Problem/04.Knapsack-Problem-04.md b/docs/08_dynamic_programming/08_08_knapsack_problem_04.md similarity index 96% rename from Contents/10.Dynamic-Programming/04.Knapsack-Problem/04.Knapsack-Problem-04.md rename to docs/08_dynamic_programming/08_08_knapsack_problem_04.md index 96b2bd7c..af9fee9f 100644 --- a/Contents/10.Dynamic-Programming/04.Knapsack-Problem/04.Knapsack-Problem-04.md +++ b/docs/08_dynamic_programming/08_08_knapsack_problem_04.md @@ -322,6 +322,14 @@ class Solution: - **时间复杂度**：$O(n \times W \times V)$，其中 $n$ 为物品分组数量，$W$ 为背包的载重上限，$V$ 为背包的容量上限。 - **空间复杂度**：$O(W \times V)$。 +## 练习题目 + +- [1155. 掷骰子等于目标和的方法数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/number-of-dice-rolls-with-target-sum.md) +- [0474. 一和零](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/ones-and-zeroes.md) + +- [分组背包问题题目列表](https://github.com/itcharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%88%86%E7%BB%84%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98%E9%A2%98%E7%9B%AE) +- [多维背包问题题目列表](https://github.com/itcharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%A4%9A%E7%BB%B4%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【资料】[背包九讲 - 崔添翼](https://github.com/tianyicui/pack) diff --git a/Contents/10.Dynamic-Programming/04.Knapsack-Problem/05.Knapsack-Problem-05.md b/docs/08_dynamic_programming/08_09_knapsack_problem_05.md similarity index 99% rename from Contents/10.Dynamic-Programming/04.Knapsack-Problem/05.Knapsack-Problem-05.md rename to docs/08_dynamic_programming/08_09_knapsack_problem_05.md index 37e198e1..af0d35ba 100644 --- a/Contents/10.Dynamic-Programming/04.Knapsack-Problem/05.Knapsack-Problem-05.md +++ b/docs/08_dynamic_programming/08_09_knapsack_problem_05.md @@ -318,6 +318,7 @@ class Solution: - **时间复杂度**：$O(n \times W)$，其中 $n$ 为物品种类数量，$W$ 为背包的载重上限。 - **空间复杂度**：$O(n \times W)$。 + ## 参考资料 - 【资料】[背包九讲 - 崔添翼](https://github.com/tianyicui/pack) diff --git a/Contents/10.Dynamic-Programming/05.Interval-DP/01.Interval-DP.md b/docs/08_dynamic_programming/08_10_interval_dp.md similarity index 93% rename from Contents/10.Dynamic-Programming/05.Interval-DP/01.Interval-DP.md rename to docs/08_dynamic_programming/08_10_interval_dp.md index 2cf479c7..fa594b83 100644 --- a/Contents/10.Dynamic-Programming/05.Interval-DP/01.Interval-DP.md +++ b/docs/08_dynamic_programming/08_10_interval_dp.md @@ -377,4 +377,15 @@ class Solution: ##### 思路 1：复杂度分析 - **时间复杂度**：$O(m^3)$，其中 $m$ 为数组 $cuts$ 的元素个数。 -- **空间复杂度**：$O(m^2)$。 \ No newline at end of file +- **空间复杂度**：$O(m^2)$。 + +## 练习题目 + +- [0005. 最长回文子串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-palindromic-substring.md) +- [0516. 最长回文子序列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/longest-palindromic-subsequence.md) +- [0312. 戳气球](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/burst-balloons.md) +- [0486. 预测赢家](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/predict-the-winner.md) +- [1547. 切棍子的最小成本](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/minimum-cost-to-cut-a-stick.md) +- [0664. 奇怪的打印机](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/strange-printer.md) + +- [区间 DP 题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%8C%BA%E9%97%B4-dp-%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/Contents/10.Dynamic-Programming/06.Tree-DP/01.Tree-DP.md b/docs/08_dynamic_programming/08_11_tree_dp.md similarity index 97% rename from Contents/10.Dynamic-Programming/06.Tree-DP/01.Tree-DP.md rename to docs/08_dynamic_programming/08_11_tree_dp.md index d638ffc9..8229820b 100644 --- a/Contents/10.Dynamic-Programming/06.Tree-DP/01.Tree-DP.md +++ b/docs/08_dynamic_programming/08_11_tree_dp.md @@ -392,6 +392,14 @@ class Solution: - **时间复杂度**：$O(n)$。 - **空间复杂度**：$O(n)$。 +## 练习题目 + +- [0687. 最长同值路径](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/longest-univalue-path.md) +- [1617. 统计子树中城市之间最大距离](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/count-subtrees-with-max-distance-between-cities.md) +- [0834. 树中距离之和]https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/sum-of-distances-in-tree.md) + +- [树形 DP 题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E7%8A%B6%E6%80%81%E5%8E%8B%E7%BC%A9-dp-%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【题解】[C++ 容易理解的换根动态规划解法 - 最小高度树](https://leetcode.cn/problems/minimum-height-trees/solution/c-huan-gen-by-vclip-sa84/) diff --git a/Contents/10.Dynamic-Programming/07.State-DP/01.State-DP.md b/docs/08_dynamic_programming/08_12_state_compression_dp.md similarity index 96% rename from Contents/10.Dynamic-Programming/07.State-DP/01.State-DP.md rename to docs/08_dynamic_programming/08_12_state_compression_dp.md index 74ccfd64..2f54b02c 100644 --- a/Contents/10.Dynamic-Programming/07.State-DP/01.State-DP.md +++ b/docs/08_dynamic_programming/08_12_state_compression_dp.md @@ -321,3 +321,11 @@ class Solution: - **时间复杂度**：$O(2^m \times m)$，其中 $m = 2 \times numSlots$。 - **空间复杂度**：$O(2^m)$。 + +## 练习题目 + +- [1879. 两个数组最小的异或值之和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1800-1899/minimum-xor-sum-of-two-arrays.md) +- [1947. 最大兼容性评分和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/maximum-compatibility-score-sum.md) +- [0526. 优美的排列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/beautiful-arrangement.md) + +- [状态压缩 DP 题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E7%8A%B6%E6%80%81%E5%8E%8B%E7%BC%A9-dp-%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/Contents/10.Dynamic-Programming/08.Counting-DP/01.Counting-DP.md b/docs/08_dynamic_programming/08_13_counting_dp.md similarity index 92% rename from Contents/10.Dynamic-Programming/08.Counting-DP/01.Counting-DP.md rename to docs/08_dynamic_programming/08_13_counting_dp.md index 98dcb5da..0c1f9997 100644 --- a/Contents/10.Dynamic-Programming/08.Counting-DP/01.Counting-DP.md +++ b/docs/08_dynamic_programming/08_13_counting_dp.md @@ -201,3 +201,12 @@ class Solution: - **时间复杂度**：$O(n^2)$。 - **空间复杂度**：$O(n)$。 + +## 练习题目 + +- [0063. 不同路径 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/unique-paths-ii.md) +- [0343. 整数拆分](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/integer-break.md) +- [1137. 第 N 个泰波那契数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/n-th-tribonacci-number.md) + + +- [计数 DP 题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%95%B0%E4%BD%8D-dp-%E9%A2%98%E7%9B%AE) \ No newline at end of file diff --git a/Contents/10.Dynamic-Programming/09.Digit-DP/01.Digit-DP.md b/docs/08_dynamic_programming/08_14_digit_dp.md similarity index 96% rename from Contents/10.Dynamic-Programming/09.Digit-DP/01.Digit-DP.md rename to docs/08_dynamic_programming/08_14_digit_dp.md index 54baf941..386283f4 100644 --- a/Contents/10.Dynamic-Programming/09.Digit-DP/01.Digit-DP.md +++ b/docs/08_dynamic_programming/08_14_digit_dp.md @@ -366,6 +366,14 @@ class Solution: - **时间复杂度**：$O(\log n)$。 - **空间复杂度**：$O(\log n)$。 +## 练习题目 + +- [0357. 统计各位数字都不同的数字个数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/count-numbers-with-unique-digits.md) +- [0788. 旋转数字](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/rotated-digits.md) +- [2719. 统计整数数目](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2700-2799/count-of-integers.md) + +- [数位 DP 题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%95%B0%E4%BD%8D-dp-%E9%A2%98%E7%9B%AE) + ## 参考资料 - 【文章】[AcWing 1081. 度的数量【数位DP基本概念+数位DP记忆化搜索】](https://www.acwing.com/solution/content/66855/) diff --git a/Contents/10.Dynamic-Programming/10.Probability-DP/01.Probability-DP.md b/docs/08_dynamic_programming/08_15_probability_dp.md similarity index 89% rename from Contents/10.Dynamic-Programming/10.Probability-DP/01.Probability-DP.md rename to docs/08_dynamic_programming/08_15_probability_dp.md index b1165944..bc83084d 100644 --- a/Contents/10.Dynamic-Programming/10.Probability-DP/01.Probability-DP.md +++ b/docs/08_dynamic_programming/08_15_probability_dp.md @@ -62,9 +62,12 @@ - 其中 $dp[i]$ 对应全概率公式中的 $E(Y)$，$p[i][j]$ 对应了 $P(x_j)$，$dp[j]$ 则对应了 $E(Y \text{ | } x_j)$。 -## 3. 概率 DP 的应用 +## 练习题目 -### 3.1 +- [0688. 骑士在棋盘上的概率](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/knight-probability-in-chessboard.md) +- [1227. 飞机座位分配概率](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/airplane-seat-assignment-probability.md) + +- [概率 DP 题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%A6%82%E7%8E%87-dp-%E9%A2%98%E7%9B%AE) ## 参考资料 diff --git a/docs/08_dynamic_programming/index.md b/docs/08_dynamic_programming/index.md new file mode 100644 index 00000000..a029dc20 --- /dev/null +++ b/docs/08_dynamic_programming/index.md @@ -0,0 +1,17 @@ +## 本章内容 + +- [8.1 动态规划基础](https://github.com/ITCharge/AlgoNote/tree/main/Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/01.Dynamic-Programming-Basic.md) +- [8.2 记忆化搜索](https://github.com/ITCharge/AlgoNote/tree/main/Contents/10.Dynamic-Programming/02.Memoization/01.Memoization.md) +- [8.3 线性 DP（一）](https://github.com/ITCharge/AlgoNote/tree/main/Contents/10.Dynamic-Programming/03.Linear-DP/01.Linear-DP-01.md) +- [8.4 线性 DP（二）](https://github.com/ITCharge/AlgoNote/tree/main/Contents/10.Dynamic-Programming/03.Linear-DP/02.Linear-DP-02.md) +- [8.5 背包问题知识（一）](https://github.com/ITCharge/AlgoNote/tree/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/01.Knapsack-Problem-01.md) +- [8.6 背包问题知识（二）](https://github.com/ITCharge/AlgoNote/tree/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/02.Knapsack-Problem-02.md) +- [8.7 背包问题知识（三）](https://github.com/ITCharge/AlgoNote/tree/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/03.Knapsack-Problem-03.md) +- [8.8 背包问题知识（四）](https://github.com/ITCharge/AlgoNote/tree/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/04.Knapsack-Problem-04.md) +- [8.9 背包问题知识（五）](https://github.com/ITCharge/AlgoNote/tree/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/05.Knapsack-Problem-05.md) +- [8.10 区间 DP](https://github.com/ITCharge/AlgoNote/tree/main/Contents/10.Dynamic-Programming/05.Interval-DP/01.Interval-DP.md) +- [8.11 树形 DP](https://github.com/ITCharge/AlgoNote/tree/main/Contents/10.Dynamic-Programming/06.Tree-DP/01.Tree-DP.md) +- [8.12 状态压缩 DP](https://github.com/ITCharge/AlgoNote/tree/main/Contents/10.Dynamic-Programming/07.State-DP/01.State-DP.md) +- [8.13 计数 DP](https://github.com/ITCharge/AlgoNote/tree/main/Contents/10.Dynamic-Programming/08.Counting-DP/01.Counting-DP.md) +- [8.14 数位 DP](https://github.com/ITCharge/AlgoNote/tree/main/Contents/10.Dynamic-Programming/09.Digit-DP/01.Digit-DP.md) +- [8.15 概率 DP](https://github.com/ITCharge/AlgoNote/tree/main/Contents/10.Dynamic-Programming/10.Probability-DP/01.Probability-DP.md) diff --git a/docs/README.md b/docs/README.md new file mode 100644 index 00000000..752473e7 --- /dev/null +++ b/docs/README.md @@ -0,0 +1,67 @@ +## 1. 本书简介 + +本书不仅仅只是一本算法题解书，更是一本算法与数据结构基础知识的讲解书。 + +- 超详细的 **「算法与数据结构」** 基础讲解教程，**「LeetCode 800+ 道」** 经典题目详细解析。 +- 本项目易于理解，没有大跨度的思维跳跃，项目中使用大量图示、例子来帮助理解。 +- 本项目先从基础的数据结构和算法开始讲解，再针对不同分类的数据结构和算法，进行具体题目的讲解分析。让读者可以通过「算法基础理论学习」和「编程实战学习」相结合的方式，彻底的掌握算法知识。 +- 本项目从各大知名互联网公司面试算法题中整理汇总了 **「LeetCode 200 道高频面试题」**，帮助面试者更有针对性的准备面试。 + +### 1.1 源码地址 + +本书内容及代码都放在 [Github repo](https://github.com/itcharge/AlgoNote) 中，欢迎在下方项目中 **「Star ⭐️ 」** 和 **「Fork」**，这是对我最大的鼓励和支持。 + +- Github 地址：[https://github.com/itcharge/AlgoNote](https://github.com/itcharge/AlgoNote) + +### 1.2 目标读者 + +- 拥有 Python 编程基础或其他编程语言基础的编程爱好者 +- 对 LeetCode 刷题感兴趣或准备算法面试的面试人员 +- 对算法感兴趣的计算机专业学生或程序员 +- 想要提升编程思维和问题解决能力的开发者 + +### 1.3 内容结构 + +本书采用算法与数据结构相结合的方法，把内容分为如下几个主要部分： + +- **0. 序言**：介绍数据结构与算法的基础知识、算法复杂度、LeetCode 的入门和攻略，为后面的学习打好基础。 +- **1. 数组**：讲解数组的基本概念、数组的基本操作。 +- **2. 链表**：讲解链表的基本概念、操作和应用，包括单链表、双向链表、循环链表等。 +- **3. 栈、队列、哈希表**：详细介绍栈、队列、哈希表这三种数据结构，包括它们的基本概念、实现方式、应用场景以及相关的经典算法题。 +- **4. 字符串**：讲解字符串的基本操作、单字符串匹配算法、多字符串匹配算法，以及字符串相关的经典算法题。 +- **5. 树结构**：介绍树的基本概念、二叉树、二叉搜索树、线段树、树状数组、并查集等数据结构。 +- **6. 图论**：讲解图的基本概念、表示方法、遍历算法和经典应用。 +- **7. 基础算法**：介绍基本的算法思想。包括枚举、递归、分治、回溯、贪心以及位运算。 +- **8. 动态规划**：介绍动态规划的基础知识、各种动态规划题型的解法。 +- **9. 附加内容**：作为全书的扩展模块。 +- **10. 题目解析**：讲解 LeetCode 上刷过的所有题目，可按照对应题号进行检索和学习。 + +### 1.4 使用说明 + +- 本电子书的左侧为所有章节目录导航，可直接点击对应章节跳转阅读。 +- 本电子书左上角有搜索栏，可以帮你迅速找到想看的章节和题解文章。 +- 本电子书每页都接入了 giscus 评论系统，可在每页下方的评论框进行评论（需使用 GitHub 账号登录）。 +- 建议按照章节顺序学习，循序渐进地掌握各个知识点。 +- 每章末尾都配有练习题，建议及时完成以巩固所学知识。 + +## 2. 相关说明 + +### 2.1 关于作者 + +我是一名 iOS / macOS 的开发程序员，研究生毕业于北航软件学院。曾在大学期间学习过算法知识，并参加过 3 年的 ACM 比赛， 但水平有限，未能取得理想成绩。但是这 3 年的 ACM 经历，给我最大的收获是锻炼了自己的逻辑思维和解决实际问题的能力，这种能力为我今后的工作、学习打下了坚实的基础。 + +我从 2021 年 03 月 30 日开始每日在 LeetCode 刷题，到 2022 年 06 月 08 日已经刷了 1000+ 道题目，并且完成了 800+ 道题解。努力向着 1000+、1500+、2000+ 道题解前进。 + +### 2.2 互助与勘误 + +限于本人的水平和经验，书中一定不乏纰漏和谬误之处。恳切希望读者给予批评指正。这将有利于我改进和提高，以帮助更多的读者。如果您对本书有任何评论和建议，或者遇到问题需要帮助，可在每页评论区留言，或者致信作者邮箱 [i@itcharge.cn](mailto:i@itcharge.cn)，我将不胜感激。 + +### 2.3 版权说明 + +- 本书采用 [知识署名—非商业性使用—禁止演绎（BY-NC-ND）4.0 协议国际许可协议](https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode.zh-Hans) 进行许可。 +- 本书题解中的所有题目版权均归 [LeetCode](https://leetcode.com/) 和 [力扣中国](https://leetcode.cn/) 所有。 + +### 2.4 致谢 + +在本书构思与写作阶段，很多朋友给我提出了有益的意见和建议。这些意见和建议令我受益匪浅。感谢在本书著作准备过程中，帮助过我的朋友，以及一起陪我刷题打卡的朋友，还有提供宝贵意见的读者。谢谢诸位。 + diff --git a/Contents/Others/Update-Time.md b/docs/others/update_time.md similarity index 98% rename from Contents/Others/Update-Time.md rename to docs/others/update_time.md index 9d252961..16ec7759 100644 --- a/Contents/Others/Update-Time.md +++ b/docs/others/update_time.md @@ -109,7 +109,7 @@ - 2022-12-12 完成「链表双指针」相关内容 - 2022-12-10 完成「链表排序」相关内容 - 2022-12-04 完成「队列基础知识」相关内容 -- 2022-12-04 完成「堆栈基础知识」相关内容 +- 2022-12-04 完成「栈基础知识」相关内容 ## 2021-11 diff --git "a/Solutions/0016. \346\234\200\346\216\245\350\277\221\347\232\204\344\270\211\346\225\260\344\271\213\345\222\214.md" b/docs/solutions/0001-0099/3sum-closest.md similarity index 100% rename from "Solutions/0016. \346\234\200\346\216\245\350\277\221\347\232\204\344\270\211\346\225\260\344\271\213\345\222\214.md" rename to docs/solutions/0001-0099/3sum-closest.md diff --git "a/Solutions/0015. \344\270\211\346\225\260\344\271\213\345\222\214.md" b/docs/solutions/0001-0099/3sum.md similarity index 100% rename from "Solutions/0015. \344\270\211\346\225\260\344\271\213\345\222\214.md" rename to docs/solutions/0001-0099/3sum.md diff --git "a/Solutions/0018. \345\233\233\346\225\260\344\271\213\345\222\214.md" b/docs/solutions/0001-0099/4sum.md similarity index 100% rename from "Solutions/0018. \345\233\233\346\225\260\344\271\213\345\222\214.md" rename to docs/solutions/0001-0099/4sum.md diff --git "a/Solutions/0067. \344\272\214\350\277\233\345\210\266\346\261\202\345\222\214.md" b/docs/solutions/0001-0099/add-binary.md similarity index 100% rename from "Solutions/0067. \344\272\214\350\277\233\345\210\266\346\261\202\345\222\214.md" rename to docs/solutions/0001-0099/add-binary.md diff --git "a/Solutions/0002. \344\270\244\346\225\260\347\233\270\345\212\240.md" b/docs/solutions/0001-0099/add-two-numbers.md similarity index 100% rename from "Solutions/0002. \344\270\244\346\225\260\347\233\270\345\212\240.md" rename to docs/solutions/0001-0099/add-two-numbers.md diff --git "a/Solutions/0094. \344\272\214\345\217\211\346\240\221\347\232\204\344\270\255\345\272\217\351\201\215\345\216\206.md" b/docs/solutions/0001-0099/binary-tree-inorder-traversal.md similarity index 100% rename from "Solutions/0094. \344\272\214\345\217\211\346\240\221\347\232\204\344\270\255\345\272\217\351\201\215\345\216\206.md" rename to docs/solutions/0001-0099/binary-tree-inorder-traversal.md diff --git "a/Solutions/0070. \347\210\254\346\245\274\346\242\257.md" b/docs/solutions/0001-0099/climbing-stairs.md similarity index 100% rename from "Solutions/0070. \347\210\254\346\245\274\346\242\257.md" rename to docs/solutions/0001-0099/climbing-stairs.md diff --git "a/Solutions/0040. \347\273\204\345\220\210\346\200\273\345\222\214 II.md" b/docs/solutions/0001-0099/combination-sum-ii.md similarity index 100% rename from "Solutions/0040. \347\273\204\345\220\210\346\200\273\345\222\214 II.md" rename to docs/solutions/0001-0099/combination-sum-ii.md diff --git "a/Solutions/0039. \347\273\204\345\220\210\346\200\273\345\222\214.md" b/docs/solutions/0001-0099/combination-sum.md similarity index 100% rename from "Solutions/0039. \347\273\204\345\220\210\346\200\273\345\222\214.md" rename to docs/solutions/0001-0099/combination-sum.md diff --git "a/Solutions/0077. \347\273\204\345\220\210.md" b/docs/solutions/0001-0099/combinations.md similarity index 100% rename from "Solutions/0077. \347\273\204\345\220\210.md" rename to docs/solutions/0001-0099/combinations.md diff --git "a/Solutions/0011. \347\233\233\346\234\200\345\244\232\346\260\264\347\232\204\345\256\271\345\231\250.md" b/docs/solutions/0001-0099/container-with-most-water.md similarity index 100% rename from "Solutions/0011. \347\233\233\346\234\200\345\244\232\346\260\264\347\232\204\345\256\271\345\231\250.md" rename to docs/solutions/0001-0099/container-with-most-water.md diff --git "a/Solutions/0038. \345\244\226\350\247\202\346\225\260\345\210\227.md" b/docs/solutions/0001-0099/count-and-say.md similarity index 100% rename from "Solutions/0038. \345\244\226\350\247\202\346\225\260\345\210\227.md" rename to docs/solutions/0001-0099/count-and-say.md diff --git "a/Solutions/0091. \350\247\243\347\240\201\346\226\271\346\263\225.md" b/docs/solutions/0001-0099/decode-ways.md similarity index 100% rename from "Solutions/0091. \350\247\243\347\240\201\346\226\271\346\263\225.md" rename to docs/solutions/0001-0099/decode-ways.md diff --git "a/Solutions/0029. \344\270\244\346\225\260\347\233\270\351\231\244.md" b/docs/solutions/0001-0099/divide-two-integers.md similarity index 100% rename from "Solutions/0029. \344\270\244\346\225\260\347\233\270\351\231\244.md" rename to docs/solutions/0001-0099/divide-two-integers.md diff --git "a/Solutions/0072. \347\274\226\350\276\221\350\267\235\347\246\273.md" b/docs/solutions/0001-0099/edit-distance.md similarity index 100% rename from "Solutions/0072. \347\274\226\350\276\221\350\267\235\347\246\273.md" rename to docs/solutions/0001-0099/edit-distance.md diff --git "a/Solutions/0034. \345\234\250\346\216\222\345\272\217\346\225\260\347\273\204\344\270\255\346\237\245\346\211\276\345\205\203\347\264\240\347\232\204\347\254\254\344\270\200\344\270\252\345\222\214\346\234\200\345\220\216\344\270\200\344\270\252\344\275\215\347\275\256.md" b/docs/solutions/0001-0099/find-first-and-last-position-of-element-in-sorted-array.md similarity index 100% rename from "Solutions/0034. \345\234\250\346\216\222\345\272\217\346\225\260\347\273\204\344\270\255\346\237\245\346\211\276\345\205\203\347\264\240\347\232\204\347\254\254\344\270\200\344\270\252\345\222\214\346\234\200\345\220\216\344\270\200\344\270\252\344\275\215\347\275\256.md" rename to docs/solutions/0001-0099/find-first-and-last-position-of-element-in-sorted-array.md diff --git "a/Solutions/0028. \346\211\276\345\207\272\345\255\227\347\254\246\344\270\262\344\270\255\347\254\254\344\270\200\344\270\252\345\214\271\351\205\215\351\241\271\347\232\204\344\270\213\346\240\207.md" b/docs/solutions/0001-0099/find-the-index-of-the-first-occurrence-in-a-string.md similarity index 100% rename from "Solutions/0028. \346\211\276\345\207\272\345\255\227\347\254\246\344\270\262\344\270\255\347\254\254\344\270\200\344\270\252\345\214\271\351\205\215\351\241\271\347\232\204\344\270\213\346\240\207.md" rename to docs/solutions/0001-0099/find-the-index-of-the-first-occurrence-in-a-string.md diff --git "a/Solutions/0041. \347\274\272\345\244\261\347\232\204\347\254\254\344\270\200\344\270\252\346\255\243\346\225\260.md" b/docs/solutions/0001-0099/first-missing-positive.md similarity index 100% rename from "Solutions/0041. \347\274\272\345\244\261\347\232\204\347\254\254\344\270\200\344\270\252\346\255\243\346\225\260.md" rename to docs/solutions/0001-0099/first-missing-positive.md diff --git "a/Solutions/0022. \346\213\254\345\217\267\347\224\237\346\210\220.md" b/docs/solutions/0001-0099/generate-parentheses.md similarity index 100% rename from "Solutions/0022. \346\213\254\345\217\267\347\224\237\346\210\220.md" rename to docs/solutions/0001-0099/generate-parentheses.md diff --git "a/Solutions/0089. \346\240\274\351\233\267\347\274\226\347\240\201.md" b/docs/solutions/0001-0099/gray-code.md similarity index 100% rename from "Solutions/0089. \346\240\274\351\233\267\347\274\226\347\240\201.md" rename to docs/solutions/0001-0099/gray-code.md diff --git "a/Solutions/0049. \345\255\227\346\257\215\345\274\202\344\275\215\350\257\215\345\210\206\347\273\204.md" b/docs/solutions/0001-0099/group-anagrams.md similarity index 100% rename from "Solutions/0049. \345\255\227\346\257\215\345\274\202\344\275\215\350\257\215\345\210\206\347\273\204.md" rename to docs/solutions/0001-0099/group-anagrams.md diff --git a/docs/solutions/0001-0099/index.md b/docs/solutions/0001-0099/index.md new file mode 100644 index 00000000..b5de5604 --- /dev/null +++ b/docs/solutions/0001-0099/index.md @@ -0,0 +1,88 @@ +## 本章内容 + +- [0001. 两数之和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/two-sum.md) +- [0002. 两数相加](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/add-two-numbers.md) +- [0003. 无重复字符的最长子串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-substring-without-repeating-characters.md) +- [0004. 寻找两个正序数组的中位数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/median-of-two-sorted-arrays.md) +- [0005. 最长回文子串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-palindromic-substring.md) +- [0007. 整数反转](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/reverse-integer.md) +- [0008. 字符串转换整数 (atoi)](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/string-to-integer-atoi.md) +- [0009. 回文数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/palindrome-number.md) +- [0010. 正则表达式匹配](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/regular-expression-matching.md) +- [0011. 盛最多水的容器](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/container-with-most-water.md) +- [0012. 整数转罗马数字](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/integer-to-roman.md) +- [0013. 罗马数字转整数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/roman-to-integer.md) +- [0014. 最长公共前缀](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-common-prefix.md) +- [0015. 三数之和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/3sum.md) +- [0016. 最接近的三数之和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/3sum-closest.md) +- [0017. 电话号码的字母组合](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/letter-combinations-of-a-phone-number.md) +- [0018. 四数之和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/4sum.md) +- [0019. 删除链表的倒数第 N 个结点](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-nth-node-from-end-of-list.md) +- [0020. 有效的括号](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/valid-parentheses.md) +- [0021. 合并两个有序链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-two-sorted-lists.md) +- [0022. 括号生成](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/generate-parentheses.md) +- [0023. 合并 K 个升序链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-k-sorted-lists.md) +- [0024. 两两交换链表中的节点](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/swap-nodes-in-pairs.md) +- [0025. K 个一组翻转链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/reverse-nodes-in-k-group.md) +- [0026. 删除有序数组中的重复项](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-duplicates-from-sorted-array.md) +- [0027. 移除元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-element.md) +- [0028. 找出字符串中第一个匹配项的下标](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/find-the-index-of-the-first-occurrence-in-a-string.md) +- [0029. 两数相除](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/divide-two-integers.md) +- [0032. 最长有效括号](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-valid-parentheses.md) +- [0033. 搜索旋转排序数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/search-in-rotated-sorted-array.md) +- [0034. 在排序数组中查找元素的第一个和最后一个位置](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/find-first-and-last-position-of-element-in-sorted-array.md) +- [0035. 搜索插入位置](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/search-insert-position.md) +- [0036. 有效的数独](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/valid-sudoku.md) +- [0037. 解数独](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/sudoku-solver.md) +- [0038. 外观数列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/count-and-say.md) +- [0039. 组合总和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/combination-sum.md) +- [0040. 组合总和 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/combination-sum-ii.md) +- [0041. 缺失的第一个正数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/first-missing-positive.md) +- [0042. 接雨水](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/trapping-rain-water.md) +- [0043. 字符串相乘](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/multiply-strings.md) +- [0044. 通配符匹配](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/wildcard-matching.md) +- [0045. 跳跃游戏 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/jump-game-ii.md) +- [0046. 全排列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/permutations.md) +- [0047. 全排列 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/permutations-ii.md) +- [0048. 旋转图像](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/rotate-image.md) +- [0049. 字母异位词分组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/group-anagrams.md) +- [0050. Pow(x, n)](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/powx-n.md) +- [0051. N 皇后](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/n-queens.md) +- [0052. N 皇后 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/n-queens-ii.md) +- [0053. 最大子数组和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/maximum-subarray.md) +- [0054. 螺旋矩阵](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/spiral-matrix.md) +- [0055. 跳跃游戏](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/jump-game.md) +- [0056. 合并区间](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-intervals.md) +- [0058. 最后一个单词的长度](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/length-of-last-word.md) +- [0059. 螺旋矩阵 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/spiral-matrix-ii.md) +- [0061. 旋转链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/rotate-list.md) +- [0062. 不同路径](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/unique-paths.md) +- [0063. 不同路径 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/unique-paths-ii.md) +- [0064. 最小路径和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/minimum-path-sum.md) +- [0066. 加一](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/plus-one.md) +- [0067. 二进制求和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/add-binary.md) +- [0069. x 的平方根](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/sqrtx.md) +- [0070. 爬楼梯](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/climbing-stairs.md) +- [0072. 编辑距离](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/edit-distance.md) +- [0073. 矩阵置零](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/set-matrix-zeroes.md) +- [0074. 搜索二维矩阵](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/search-a-2d-matrix.md) +- [0075. 颜色分类](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/sort-colors.md) +- [0076. 最小覆盖子串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/minimum-window-substring.md) +- [0077. 组合](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/combinations.md) +- [0078. 子集](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/subsets.md) +- [0079. 单词搜索](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/word-search.md) +- [0080. 删除有序数组中的重复项 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-duplicates-from-sorted-array-ii.md) +- [0081. 搜索旋转排序数组 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/search-in-rotated-sorted-array-ii.md) +- [0082. 删除排序链表中的重复元素 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-duplicates-from-sorted-list-ii.md) +- [0083. 删除排序链表中的重复元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-duplicates-from-sorted-list.md) +- [0084. 柱状图中最大的矩形](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/largest-rectangle-in-histogram.md) +- [0088. 合并两个有序数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-sorted-array.md) +- [0089. 格雷编码](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/gray-code.md) +- [0090. 子集 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/subsets-ii.md) +- [0091. 解码方法](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/decode-ways.md) +- [0092. 反转链表 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/reverse-linked-list-ii.md) +- [0093. 复原 IP 地址](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/restore-ip-addresses.md) +- [0094. 二叉树的中序遍历](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/binary-tree-inorder-traversal.md) +- [0095. 不同的二叉搜索树 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/unique-binary-search-trees-ii.md) +- [0096. 不同的二叉搜索树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/unique-binary-search-trees.md) +- [0098. 验证二叉搜索树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/validate-binary-search-tree.md) diff --git "a/Solutions/0012. \346\225\264\346\225\260\350\275\254\347\275\227\351\251\254\346\225\260\345\255\227.md" b/docs/solutions/0001-0099/integer-to-roman.md similarity index 100% rename from "Solutions/0012. \346\225\264\346\225\260\350\275\254\347\275\227\351\251\254\346\225\260\345\255\227.md" rename to docs/solutions/0001-0099/integer-to-roman.md diff --git "a/Solutions/0045. \350\267\263\350\267\203\346\270\270\346\210\217 II.md" b/docs/solutions/0001-0099/jump-game-ii.md similarity index 100% rename from "Solutions/0045. \350\267\263\350\267\203\346\270\270\346\210\217 II.md" rename to docs/solutions/0001-0099/jump-game-ii.md diff --git "a/Solutions/0055. \350\267\263\350\267\203\346\270\270\346\210\217.md" b/docs/solutions/0001-0099/jump-game.md similarity index 100% rename from "Solutions/0055. \350\267\263\350\267\203\346\270\270\346\210\217.md" rename to docs/solutions/0001-0099/jump-game.md diff --git "a/Solutions/0084. \346\237\261\347\212\266\345\233\276\344\270\255\346\234\200\345\244\247\347\232\204\347\237\251\345\275\242.md" b/docs/solutions/0001-0099/largest-rectangle-in-histogram.md similarity index 100% rename from "Solutions/0084. \346\237\261\347\212\266\345\233\276\344\270\255\346\234\200\345\244\247\347\232\204\347\237\251\345\275\242.md" rename to docs/solutions/0001-0099/largest-rectangle-in-histogram.md diff --git "a/Solutions/0058. \346\234\200\345\220\216\344\270\200\344\270\252\345\215\225\350\257\215\347\232\204\351\225\277\345\272\246.md" b/docs/solutions/0001-0099/length-of-last-word.md similarity index 100% rename from "Solutions/0058. \346\234\200\345\220\216\344\270\200\344\270\252\345\215\225\350\257\215\347\232\204\351\225\277\345\272\246.md" rename to docs/solutions/0001-0099/length-of-last-word.md diff --git "a/Solutions/0017. \347\224\265\350\257\235\345\217\267\347\240\201\347\232\204\345\255\227\346\257\215\347\273\204\345\220\210.md" b/docs/solutions/0001-0099/letter-combinations-of-a-phone-number.md similarity index 100% rename from "Solutions/0017. \347\224\265\350\257\235\345\217\267\347\240\201\347\232\204\345\255\227\346\257\215\347\273\204\345\220\210.md" rename to docs/solutions/0001-0099/letter-combinations-of-a-phone-number.md diff --git "a/Solutions/0014. \346\234\200\351\225\277\345\205\254\345\205\261\345\211\215\347\274\200.md" b/docs/solutions/0001-0099/longest-common-prefix.md similarity index 100% rename from "Solutions/0014. \346\234\200\351\225\277\345\205\254\345\205\261\345\211\215\347\274\200.md" rename to docs/solutions/0001-0099/longest-common-prefix.md diff --git "a/Solutions/0005. \346\234\200\351\225\277\345\233\236\346\226\207\345\255\220\344\270\262.md" b/docs/solutions/0001-0099/longest-palindromic-substring.md similarity index 100% rename from "Solutions/0005. \346\234\200\351\225\277\345\233\236\346\226\207\345\255\220\344\270\262.md" rename to docs/solutions/0001-0099/longest-palindromic-substring.md diff --git "a/Solutions/0003. \346\227\240\351\207\215\345\244\215\345\255\227\347\254\246\347\232\204\346\234\200\351\225\277\345\255\220\344\270\262.md" b/docs/solutions/0001-0099/longest-substring-without-repeating-characters.md similarity index 100% rename from "Solutions/0003. \346\227\240\351\207\215\345\244\215\345\255\227\347\254\246\347\232\204\346\234\200\351\225\277\345\255\220\344\270\262.md" rename to docs/solutions/0001-0099/longest-substring-without-repeating-characters.md diff --git "a/Solutions/0032. \346\234\200\351\225\277\346\234\211\346\225\210\346\213\254\345\217\267.md" b/docs/solutions/0001-0099/longest-valid-parentheses.md similarity index 100% rename from "Solutions/0032. \346\234\200\351\225\277\346\234\211\346\225\210\346\213\254\345\217\267.md" rename to docs/solutions/0001-0099/longest-valid-parentheses.md diff --git "a/Solutions/0053. \346\234\200\345\244\247\345\255\220\346\225\260\347\273\204\345\222\214.md" b/docs/solutions/0001-0099/maximum-subarray.md similarity index 100% rename from "Solutions/0053. \346\234\200\345\244\247\345\255\220\346\225\260\347\273\204\345\222\214.md" rename to docs/solutions/0001-0099/maximum-subarray.md diff --git "a/Solutions/0004. \345\257\273\346\211\276\344\270\244\344\270\252\346\255\243\345\272\217\346\225\260\347\273\204\347\232\204\344\270\255\344\275\215\346\225\260.md" b/docs/solutions/0001-0099/median-of-two-sorted-arrays.md similarity index 100% rename from "Solutions/0004. \345\257\273\346\211\276\344\270\244\344\270\252\346\255\243\345\272\217\346\225\260\347\273\204\347\232\204\344\270\255\344\275\215\346\225\260.md" rename to docs/solutions/0001-0099/median-of-two-sorted-arrays.md diff --git "a/Solutions/0056. \345\220\210\345\271\266\345\214\272\351\227\264.md" b/docs/solutions/0001-0099/merge-intervals.md similarity index 100% rename from "Solutions/0056. \345\220\210\345\271\266\345\214\272\351\227\264.md" rename to docs/solutions/0001-0099/merge-intervals.md diff --git "a/Solutions/0023. \345\220\210\345\271\266 K \344\270\252\345\215\207\345\272\217\351\223\276\350\241\250.md" b/docs/solutions/0001-0099/merge-k-sorted-lists.md similarity index 100% rename from "Solutions/0023. \345\220\210\345\271\266 K \344\270\252\345\215\207\345\272\217\351\223\276\350\241\250.md" rename to docs/solutions/0001-0099/merge-k-sorted-lists.md diff --git "a/Solutions/0088. \345\220\210\345\271\266\344\270\244\344\270\252\346\234\211\345\272\217\346\225\260\347\273\204.md" b/docs/solutions/0001-0099/merge-sorted-array.md similarity index 100% rename from "Solutions/0088. \345\220\210\345\271\266\344\270\244\344\270\252\346\234\211\345\272\217\346\225\260\347\273\204.md" rename to docs/solutions/0001-0099/merge-sorted-array.md diff --git "a/Solutions/0021. \345\220\210\345\271\266\344\270\244\344\270\252\346\234\211\345\272\217\351\223\276\350\241\250.md" b/docs/solutions/0001-0099/merge-two-sorted-lists.md similarity index 100% rename from "Solutions/0021. \345\220\210\345\271\266\344\270\244\344\270\252\346\234\211\345\272\217\351\223\276\350\241\250.md" rename to docs/solutions/0001-0099/merge-two-sorted-lists.md diff --git "a/Solutions/0064. \346\234\200\345\260\217\350\267\257\345\276\204\345\222\214.md" b/docs/solutions/0001-0099/minimum-path-sum.md similarity index 100% rename from "Solutions/0064. \346\234\200\345\260\217\350\267\257\345\276\204\345\222\214.md" rename to docs/solutions/0001-0099/minimum-path-sum.md diff --git "a/Solutions/0076. \346\234\200\345\260\217\350\246\206\347\233\226\345\255\220\344\270\262.md" b/docs/solutions/0001-0099/minimum-window-substring.md similarity index 100% rename from "Solutions/0076. \346\234\200\345\260\217\350\246\206\347\233\226\345\255\220\344\270\262.md" rename to docs/solutions/0001-0099/minimum-window-substring.md diff --git "a/Solutions/0043. \345\255\227\347\254\246\344\270\262\347\233\270\344\271\230.md" b/docs/solutions/0001-0099/multiply-strings.md similarity index 100% rename from "Solutions/0043. \345\255\227\347\254\246\344\270\262\347\233\270\344\271\230.md" rename to docs/solutions/0001-0099/multiply-strings.md diff --git "a/Solutions/0052. N \347\232\207\345\220\216 II.md" b/docs/solutions/0001-0099/n-queens-ii.md similarity index 93% rename from "Solutions/0052. N \347\232\207\345\220\216 II.md" rename to docs/solutions/0001-0099/n-queens-ii.md index d9dc0711..eff2a297 100644 --- "a/Solutions/0052. N \347\232\207\345\220\216 II.md" +++ b/docs/solutions/0001-0099/n-queens-ii.md @@ -45,19 +45,14 @@ 下面我们根据回溯算法三步走，写出对应的回溯算法。 -1. **明确所有选择**：根据棋盘中当前行的所有列位置上是否选择放置皇后，画出决策树，如下图所示。 - - - ![](https://qcdn.itcharge.cn/images/20220426095225.png) +![](https://qcdn.itcharge.cn/images/20220426095225.png) +1. **明确所有选择**：根据棋盘中当前行的所有列位置上是否选择放置皇后，画出决策树，如上图所示。 2. **明确终止条件**： - - 当遍历到决策树的叶子节点时，就终止了。也就是在最后一行放置完皇后时，递归终止。 - -3. **将决策树和终止条件翻译成代码：** - +3. **将决策树和终止条件翻译成代码**： 1. 定义回溯函数： - - - 首先我们先使用一个 `n * n` 大小的二维矩阵 `chessboard` 来表示当前棋盘，`chessboard` 中的字符 `Q` 代表皇后，`.` 代表空位，初始都为 `.`。 + - 首先我们先使用一个 $n \times n$ 大小的二维矩阵 `chessboard` 来表示当前棋盘，`chessboard` 中的字符 `Q` 代表皇后，`.` 代表空位，初始都为 `.`。 - 然后定义回溯函数 `backtrack(chessboard, row): ` 函数的传入参数是 `chessboard`（棋盘数组）和 `row`（代表当前正在考虑放置第 `row` 行皇后），全局变量是 `ans`（所有可行方案的数量）。 - `backtrack(chessboard, row):` 函数代表的含义是：在放置好第 `row` 行皇后的情况下，递归放置剩下行的皇后。 2. 书写回溯函数主体（给出选择元素、递归搜索、撤销选择部分）。 diff --git "a/Solutions/0051. N \347\232\207\345\220\216.md" b/docs/solutions/0001-0099/n-queens.md similarity index 94% rename from "Solutions/0051. N \347\232\207\345\220\216.md" rename to docs/solutions/0001-0099/n-queens.md index abd79e7b..72aae45c 100644 --- "a/Solutions/0051. N \347\232\207\345\220\216.md" +++ b/docs/solutions/0001-0099/n-queens.md @@ -43,19 +43,14 @@ 下面我们根据回溯算法三步走，写出对应的回溯算法。 -1. **明确所有选择**：根据棋盘中当前行的所有列位置上是否选择放置皇后，画出决策树，如下图所示。 - - - ![](https://qcdn.itcharge.cn/images/20220426095225.png) +![](https://qcdn.itcharge.cn/images/20220426095225.png) +1. **明确所有选择**：根据棋盘中当前行的所有列位置上是否选择放置皇后，画出决策树，如上图所示。 2. **明确终止条件**： - - 当遍历到决策树的叶子节点时，就终止了。也就是在最后一行放置完皇后时，递归终止。 - -3. **将决策树和终止条件翻译成代码：** - +3. **将决策树和终止条件翻译成代码**： 1. 定义回溯函数： - - - 首先我们先使用一个 `n * n` 大小的二维矩阵 `chessboard` 来表示当前棋盘，`chessboard` 中的字符 `Q` 代表皇后，`.` 代表空位，初始都为 `.`。 + - 首先我们先使用一个 $n \times n$ 大小的二维矩阵 `chessboard` 来表示当前棋盘，`chessboard` 中的字符 `Q` 代表皇后，`.` 代表空位，初始都为 `.`。 - 然后定义回溯函数 `backtrack(chessboard, row): ` 函数的传入参数是 `chessboard`（棋盘数组）和 `row`（代表当前正在考虑放置第 `row` 行皇后），全局变量是 `res`（存放所有符合条件结果的集合数组）。 - `backtrack(chessboard, row):` 函数代表的含义是：在放置好第 `row` 行皇后的情况下，递归放置剩下行的皇后。 2. 书写回溯函数主体（给出选择元素、递归搜索、撤销选择部分）。 diff --git "a/Solutions/0009. \345\233\236\346\226\207\346\225\260.md" b/docs/solutions/0001-0099/palindrome-number.md similarity index 100% rename from "Solutions/0009. \345\233\236\346\226\207\346\225\260.md" rename to docs/solutions/0001-0099/palindrome-number.md diff --git "a/Solutions/0047. \345\205\250\346\216\222\345\210\227 II.md" b/docs/solutions/0001-0099/permutations-ii.md similarity index 100% rename from "Solutions/0047. \345\205\250\346\216\222\345\210\227 II.md" rename to docs/solutions/0001-0099/permutations-ii.md diff --git "a/Solutions/0046. \345\205\250\346\216\222\345\210\227.md" b/docs/solutions/0001-0099/permutations.md similarity index 89% rename from "Solutions/0046. \345\205\250\346\216\222\345\210\227.md" rename to docs/solutions/0001-0099/permutations.md index 57890942..f76d625e 100644 --- "a/Solutions/0046. \345\205\250\346\216\222\345\210\227.md" +++ b/docs/solutions/0001-0099/permutations.md @@ -41,18 +41,13 @@ 根据回溯算法三步走，写出对应的回溯算法。 -1. **明确所有选择**：全排列中每个位置上的元素都可以从剩余可选元素中选出，对此画出决策树，如下图所示。 - - - ![](https://qcdn.itcharge.cn/images/20220425102048.png) +![](https://qcdn.itcharge.cn/images/20220425102048.png) +1. **明确所有选择**：全排列中每个位置上的元素都可以从剩余可选元素中选出，对此画出决策树，如上图所示。 2. **明确终止条件**： - - 当遍历到决策树的叶子节点时，就终止了。即当前路径搜索到末尾时，递归终止。 - 3. **将决策树和终止条件翻译成代码：** - 1. 定义回溯函数： - - `backtracking(nums):` 函数的传入参数是 `nums`（可选数组列表），全局变量是 `res`（存放所有符合条件结果的集合数组）和 `path`（存放当前符合条件的结果）。 - `backtracking(nums):` 函数代表的含义是：递归在 `nums` 中选择剩下的元素。 2. 书写回溯函数主体（给出选择元素、递归搜索、撤销选择部分）。 @@ -61,15 +56,13 @@ - 选择元素：将其添加到当前子集数组 `path` 中。 - 递归搜索：在选择该元素的情况下，继续递归选择剩下元素。 - 撤销选择：将该元素从当前结果数组 `path` 中移除。 - ```python - for i in range(len(nums)): # 枚举可选元素列表 - if nums[i] not in path: # 从当前路径中没有出现的数字中选择 - path.append(nums[i]) # 选择元素 - backtracking(nums) # 递归搜索 - path.pop() # 撤销选择 + for i in range(len(nums)): # 枚举可选元素列表 + if nums[i] not in path: # 从当前路径中没有出现的数字中选择 + path.append(nums[i]) # 选择元素 + backtracking(nums) # 递归搜索 + path.pop() # 撤销选择 ``` - 3. 明确递归终止条件（给出递归终止条件，以及递归终止时的处理方法）。 - 当遍历到决策树的叶子节点时，就终止了。也就是存放当前结果的数组 `path` 的长度等于给定数组 `nums` 的长度（即 `len(path) == len(nums)`）时，递归停止。 diff --git "a/Solutions/0066. \345\212\240\344\270\200.md" b/docs/solutions/0001-0099/plus-one.md similarity index 100% rename from "Solutions/0066. \345\212\240\344\270\200.md" rename to docs/solutions/0001-0099/plus-one.md diff --git a/Solutions/0050. Pow(x, n).md b/docs/solutions/0001-0099/powx-n.md similarity index 100% rename from Solutions/0050. Pow(x, n).md rename to docs/solutions/0001-0099/powx-n.md diff --git "a/Solutions/0010. \346\255\243\345\210\231\350\241\250\350\276\276\345\274\217\345\214\271\351\205\215.md" b/docs/solutions/0001-0099/regular-expression-matching.md similarity index 100% rename from "Solutions/0010. \346\255\243\345\210\231\350\241\250\350\276\276\345\274\217\345\214\271\351\205\215.md" rename to docs/solutions/0001-0099/regular-expression-matching.md diff --git "a/Solutions/0080. \345\210\240\351\231\244\346\234\211\345\272\217\346\225\260\347\273\204\344\270\255\347\232\204\351\207\215\345\244\215\351\241\271 II.md" b/docs/solutions/0001-0099/remove-duplicates-from-sorted-array-ii.md similarity index 100% rename from "Solutions/0080. \345\210\240\351\231\244\346\234\211\345\272\217\346\225\260\347\273\204\344\270\255\347\232\204\351\207\215\345\244\215\351\241\271 II.md" rename to docs/solutions/0001-0099/remove-duplicates-from-sorted-array-ii.md diff --git "a/Solutions/0026. \345\210\240\351\231\244\346\234\211\345\272\217\346\225\260\347\273\204\344\270\255\347\232\204\351\207\215\345\244\215\351\241\271.md" b/docs/solutions/0001-0099/remove-duplicates-from-sorted-array.md similarity index 100% rename from "Solutions/0026. \345\210\240\351\231\244\346\234\211\345\272\217\346\225\260\347\273\204\344\270\255\347\232\204\351\207\215\345\244\215\351\241\271.md" rename to docs/solutions/0001-0099/remove-duplicates-from-sorted-array.md diff --git "a/Solutions/0082. \345\210\240\351\231\244\346\216\222\345\272\217\351\223\276\350\241\250\344\270\255\347\232\204\351\207\215\345\244\215\345\205\203\347\264\240 II.md" b/docs/solutions/0001-0099/remove-duplicates-from-sorted-list-ii.md similarity index 100% rename from "Solutions/0082. \345\210\240\351\231\244\346\216\222\345\272\217\351\223\276\350\241\250\344\270\255\347\232\204\351\207\215\345\244\215\345\205\203\347\264\240 II.md" rename to docs/solutions/0001-0099/remove-duplicates-from-sorted-list-ii.md diff --git "a/Solutions/0083. \345\210\240\351\231\244\346\216\222\345\272\217\351\223\276\350\241\250\344\270\255\347\232\204\351\207\215\345\244\215\345\205\203\347\264\240.md" b/docs/solutions/0001-0099/remove-duplicates-from-sorted-list.md similarity index 100% rename from "Solutions/0083. \345\210\240\351\231\244\346\216\222\345\272\217\351\223\276\350\241\250\344\270\255\347\232\204\351\207\215\345\244\215\345\205\203\347\264\240.md" rename to docs/solutions/0001-0099/remove-duplicates-from-sorted-list.md diff --git "a/Solutions/0027. \347\247\273\351\231\244\345\205\203\347\264\240.md" b/docs/solutions/0001-0099/remove-element.md similarity index 100% rename from "Solutions/0027. \347\247\273\351\231\244\345\205\203\347\264\240.md" rename to docs/solutions/0001-0099/remove-element.md diff --git "a/Solutions/0019. \345\210\240\351\231\244\351\223\276\350\241\250\347\232\204\345\200\222\346\225\260\347\254\254 N \344\270\252\347\273\223\347\202\271.md" b/docs/solutions/0001-0099/remove-nth-node-from-end-of-list.md similarity index 100% rename from "Solutions/0019. \345\210\240\351\231\244\351\223\276\350\241\250\347\232\204\345\200\222\346\225\260\347\254\254 N \344\270\252\347\273\223\347\202\271.md" rename to docs/solutions/0001-0099/remove-nth-node-from-end-of-list.md diff --git "a/Solutions/0093. \345\244\215\345\216\237 IP \345\234\260\345\235\200.md" b/docs/solutions/0001-0099/restore-ip-addresses.md similarity index 85% rename from "Solutions/0093. \345\244\215\345\216\237 IP \345\234\260\345\235\200.md" rename to docs/solutions/0001-0099/restore-ip-addresses.md index 59f4723b..c5a335ae 100644 --- "a/Solutions/0093. \345\244\215\345\216\237 IP \345\234\260\345\235\200.md" +++ b/docs/solutions/0001-0099/restore-ip-addresses.md @@ -43,16 +43,11 @@ 根据回溯算法三步走，写出对应的回溯算法。 -1. **明确所有选择**：全排列中每个位置上的元素都可以从剩余可选元素中选出，对此画出决策树，如下图所示。 - +1. **明确所有选择**：全排列中每个位置上的元素都可以从剩余可选元素中选出。 2. **明确终止条件**： - - 当遍历到决策树的叶子节点时，就终止了。即当前路径搜索到末尾时，递归终止。 - -3. **将决策树和终止条件翻译成代码：** - +3. **将决策树和终止条件翻译成代码**： 1. 定义回溯函数： - - `backtracking(index):` 函数的传入参数是 `index`（剩余字符开始位置），全局变量是 `res`（存放所有符合条件结果的集合数组）和 `path`（存放当前符合条件的结果）。 - `backtracking(index):` 函数代表的含义是：递归从 `index` 位置开始，从剩下字符中，选择当前子段的值。 2. 书写回溯函数主体（给出选择元素、递归搜索、撤销选择部分）。 @@ -61,25 +56,23 @@ - 选择元素：将其添加到当前子集数组 `path` 中。 - 递归搜索：在选择该子段值的情况下，继续递归从剩下字符中，选择下一个子段值。 - 撤销选择：将该子段值从当前结果数组 `path` 中移除。 - ```python - for i in range(index, len(s)): # 枚举可选元素列表 - sub = s[index: i + 1] - # 如果当前值不在 0 ~ 255 之间，直接跳过 - if int(sub) > 255: - continue - # 如果当前值为 0，但不是单个 0（"00..."），直接跳过 - if int(sub) == 0 and i != index: - continue - # 如果当前值大于 0，但是以 0 开头（"0XX..."），直接跳过 - if int(sub) > 0 and s[index] == '0': - continue - - path.append(sub) # 选择元素 - backtracking(i + 1) # 递归搜索 - path.pop() # 撤销选择 + for i in range(index, len(s)): # 枚举可选元素列表 + sub = s[index: i + 1] + # 如果当前值不在 0 ~ 255 之间，直接跳过 + if int(sub) > 255: + continue + # 如果当前值为 0，但不是单个 0（"00..."），直接跳过 + if int(sub) == 0 and i != index: + continue + # 如果当前值大于 0，但是以 0 开头（"0XX..."），直接跳过 + if int(sub) > 0 and s[index] == '0': + continue + + path.append(sub) # 选择元素 + backtracking(i + 1) # 递归搜索 + path.pop() # 撤销选择 ``` - 3. 明确递归终止条件（给出递归终止条件，以及递归终止时的处理方法）。 - 当遍历到决策树的叶子节点时，就终止了。也就是存放当前结果的数组 `path` 的长度等于 $4$，并且剩余字符开始位置为字符串结束位置（即 `len(path) == 4 and index == len(s)`）时，递归停止。 - 如果回溯过程中，切割次数大于 4（即 `len(path) > 4`），递归停止，直接返回。 diff --git "a/Solutions/0007. \346\225\264\346\225\260\345\217\215\350\275\254.md" b/docs/solutions/0001-0099/reverse-integer.md similarity index 100% rename from "Solutions/0007. \346\225\264\346\225\260\345\217\215\350\275\254.md" rename to docs/solutions/0001-0099/reverse-integer.md diff --git "a/Solutions/0092. \345\217\215\350\275\254\351\223\276\350\241\250 II.md" b/docs/solutions/0001-0099/reverse-linked-list-ii.md similarity index 100% rename from "Solutions/0092. \345\217\215\350\275\254\351\223\276\350\241\250 II.md" rename to docs/solutions/0001-0099/reverse-linked-list-ii.md diff --git "a/Solutions/0025. K \344\270\252\344\270\200\347\273\204\347\277\273\350\275\254\351\223\276\350\241\250.md" b/docs/solutions/0001-0099/reverse-nodes-in-k-group.md similarity index 100% rename from "Solutions/0025. K \344\270\252\344\270\200\347\273\204\347\277\273\350\275\254\351\223\276\350\241\250.md" rename to docs/solutions/0001-0099/reverse-nodes-in-k-group.md diff --git "a/Solutions/0013. \347\275\227\351\251\254\346\225\260\345\255\227\350\275\254\346\225\264\346\225\260.md" b/docs/solutions/0001-0099/roman-to-integer.md similarity index 100% rename from "Solutions/0013. \347\275\227\351\251\254\346\225\260\345\255\227\350\275\254\346\225\264\346\225\260.md" rename to docs/solutions/0001-0099/roman-to-integer.md diff --git "a/Solutions/0048. \346\227\213\350\275\254\345\233\276\345\203\217.md" b/docs/solutions/0001-0099/rotate-image.md similarity index 100% rename from "Solutions/0048. \346\227\213\350\275\254\345\233\276\345\203\217.md" rename to docs/solutions/0001-0099/rotate-image.md diff --git "a/Solutions/0061. \346\227\213\350\275\254\351\223\276\350\241\250.md" b/docs/solutions/0001-0099/rotate-list.md similarity index 100% rename from "Solutions/0061. \346\227\213\350\275\254\351\223\276\350\241\250.md" rename to docs/solutions/0001-0099/rotate-list.md diff --git "a/Solutions/0074. \346\220\234\347\264\242\344\272\214\347\273\264\347\237\251\351\230\265.md" b/docs/solutions/0001-0099/search-a-2d-matrix.md similarity index 100% rename from "Solutions/0074. \346\220\234\347\264\242\344\272\214\347\273\264\347\237\251\351\230\265.md" rename to docs/solutions/0001-0099/search-a-2d-matrix.md diff --git "a/Solutions/0081. \346\220\234\347\264\242\346\227\213\350\275\254\346\216\222\345\272\217\346\225\260\347\273\204 II.md" b/docs/solutions/0001-0099/search-in-rotated-sorted-array-ii.md similarity index 100% rename from "Solutions/0081. \346\220\234\347\264\242\346\227\213\350\275\254\346\216\222\345\272\217\346\225\260\347\273\204 II.md" rename to docs/solutions/0001-0099/search-in-rotated-sorted-array-ii.md diff --git "a/Solutions/0033. \346\220\234\347\264\242\346\227\213\350\275\254\346\216\222\345\272\217\346\225\260\347\273\204.md" b/docs/solutions/0001-0099/search-in-rotated-sorted-array.md similarity index 100% rename from "Solutions/0033. \346\220\234\347\264\242\346\227\213\350\275\254\346\216\222\345\272\217\346\225\260\347\273\204.md" rename to docs/solutions/0001-0099/search-in-rotated-sorted-array.md diff --git "a/Solutions/0035. \346\220\234\347\264\242\346\217\222\345\205\245\344\275\215\347\275\256.md" b/docs/solutions/0001-0099/search-insert-position.md similarity index 100% rename from "Solutions/0035. \346\220\234\347\264\242\346\217\222\345\205\245\344\275\215\347\275\256.md" rename to docs/solutions/0001-0099/search-insert-position.md diff --git "a/Solutions/0073. \347\237\251\351\230\265\347\275\256\351\233\266.md" b/docs/solutions/0001-0099/set-matrix-zeroes.md similarity index 98% rename from "Solutions/0073. \347\237\251\351\230\265\347\275\256\351\233\266.md" rename to docs/solutions/0001-0099/set-matrix-zeroes.md index 6b70f58f..4dde4a72 100644 --- "a/Solutions/0073. \347\237\251\351\230\265\347\275\256\351\233\266.md" +++ b/docs/solutions/0001-0099/set-matrix-zeroes.md @@ -29,7 +29,8 @@ **示例**： - 示例 1： -- ![](https://assets.leetcode.com/uploads/2020/08/17/mat1.jpg) + +![](https://assets.leetcode.com/uploads/2020/08/17/mat1.jpg) ```python 输入：matrix = [[1,1,1],[1,0,1],[1,1,1]] diff --git "a/Solutions/0075. \351\242\234\350\211\262\345\210\206\347\261\273.md" b/docs/solutions/0001-0099/sort-colors.md similarity index 100% rename from "Solutions/0075. \351\242\234\350\211\262\345\210\206\347\261\273.md" rename to docs/solutions/0001-0099/sort-colors.md diff --git "a/Solutions/0059. \350\236\272\346\227\213\347\237\251\351\230\265 II.md" b/docs/solutions/0001-0099/spiral-matrix-ii.md similarity index 96% rename from "Solutions/0059. \350\236\272\346\227\213\347\237\251\351\230\265 II.md" rename to docs/solutions/0001-0099/spiral-matrix-ii.md index d6efabe7..b61ba7f4 100644 --- "a/Solutions/0059. \350\236\272\346\227\213\347\237\251\351\230\265 II.md" +++ b/docs/solutions/0001-0099/spiral-matrix-ii.md @@ -20,7 +20,7 @@ 这道题跟「[54. 螺旋矩阵](https://leetcode.cn/problems/spiral-matrix/)」思路是一样的。 1. 构建一个 $n \times n$ 大小的数组 $matrix$ 存储答案。然后定义一下上、下、左、右的边界。 -2. 然后按照逆时针的顺序从边界上依次给数组 $matrix$ 相应位置赋值。 +2. 然后按照顺时针的顺序从边界上依次给数组 $matrix$ 相应位置赋值。 3. 当访问完当前边界之后，要更新一下边界位置，缩小范围，方便下一轮进行访问。 4. 最后返回 $matrix$。 diff --git "a/Solutions/0054. \350\236\272\346\227\213\347\237\251\351\230\265.md" b/docs/solutions/0001-0099/spiral-matrix.md similarity index 97% rename from "Solutions/0054. \350\236\272\346\227\213\347\237\251\351\230\265.md" rename to docs/solutions/0001-0099/spiral-matrix.md index 36303602..b1dcba57 100644 --- "a/Solutions/0054. \350\236\272\346\227\213\347\237\251\351\230\265.md" +++ b/docs/solutions/0001-0099/spiral-matrix.md @@ -45,7 +45,7 @@ ### 思路 1：模拟 1. 使用数组 $ans$ 存储答案。然后定义一下上、下、左、右的边界。 -2. 然后按照逆时针的顺序从边界上依次访问元素。 +2. 然后按照顺时针的顺序从边界上依次访问元素。 3. 当访问完当前边界之后，要更新一下边界位置，缩小范围，方便下一轮进行访问。 4. 最后返回答案数组 $ans$。 diff --git "a/Solutions/0069. x \347\232\204\345\271\263\346\226\271\346\240\271.md" b/docs/solutions/0001-0099/sqrtx.md similarity index 100% rename from "Solutions/0069. x \347\232\204\345\271\263\346\226\271\346\240\271.md" rename to docs/solutions/0001-0099/sqrtx.md diff --git "a/Solutions/0008. \345\255\227\347\254\246\344\270\262\350\275\254\346\215\242\346\225\264\346\225\260 (atoi).md" b/docs/solutions/0001-0099/string-to-integer-atoi.md similarity index 100% rename from "Solutions/0008. \345\255\227\347\254\246\344\270\262\350\275\254\346\215\242\346\225\264\346\225\260 (atoi).md" rename to docs/solutions/0001-0099/string-to-integer-atoi.md diff --git "a/Solutions/0090. \345\255\220\351\233\206 II.md" b/docs/solutions/0001-0099/subsets-ii.md similarity index 100% rename from "Solutions/0090. \345\255\220\351\233\206 II.md" rename to docs/solutions/0001-0099/subsets-ii.md diff --git "a/Solutions/0078. \345\255\220\351\233\206.md" b/docs/solutions/0001-0099/subsets.md similarity index 97% rename from "Solutions/0078. \345\255\220\351\233\206.md" rename to docs/solutions/0001-0099/subsets.md index 386ad101..c75d2791 100644 --- "a/Solutions/0078. \345\255\220\351\233\206.md" +++ b/docs/solutions/0001-0099/subsets.md @@ -45,17 +45,13 @@ 下面我们根据回溯算法三步走，写出对应的回溯算法。 -1. **明确所有选择**：根据数组中每个位置上的元素选与不选两种选择，画出决策树，如下图所示。 - - - ![](https://qcdn.itcharge.cn/images/20220425210640.png) +![](https://qcdn.itcharge.cn/images/20220425210640.png) +1. **明确所有选择**：根据数组中每个位置上的元素选与不选两种选择，画出决策树，如上图所示。 2. **明确终止条件**： - - 当遍历到决策树的叶子节点时，就终止了。即当前路径搜索到末尾时，递归终止。 - -3. **将决策树和终止条件翻译成代码：** +3. **将决策树和终止条件翻译成代码**： 1. 定义回溯函数： - - `backtracking(nums, index):` 函数的传入参数是 `nums`（可选数组列表）和 `index`（代表当前正在考虑元素是 `nums[i]` ），全局变量是 `res`（存放所有符合条件结果的集合数组）和 `path`（存放当前符合条件的结果）。 - `backtracking(nums, index):` 函数代表的含义是：在选择 `nums[index]` 的情况下，递归选择剩下的元素。 2. 书写回溯函数主体（给出选择元素、递归搜索、撤销选择部分）。 @@ -70,7 +66,6 @@ backtracking(nums, i + 1) # 递归搜索 path.pop() # 撤销选择 ``` - 3. 明确递归终止条件（给出递归终止条件，以及递归终止时的处理方法）。 - 当遍历到决策树的叶子节点时，就终止了。也就是当正在考虑的元素位置到达数组末尾（即 `start >= len(nums)`）时，递归停止。 - 从决策树中也可以看出，子集需要存储的答案集合应该包含决策树上所有的节点，应该需要保存递归搜索的所有状态。所以无论是否达到终止条件，我们都应该将当前符合条件的结果放入到集合中。 diff --git "a/Solutions/0037. \350\247\243\346\225\260\347\213\254.md" b/docs/solutions/0001-0099/sudoku-solver.md similarity index 100% rename from "Solutions/0037. \350\247\243\346\225\260\347\213\254.md" rename to docs/solutions/0001-0099/sudoku-solver.md diff --git "a/Solutions/0024. \344\270\244\344\270\244\344\272\244\346\215\242\351\223\276\350\241\250\344\270\255\347\232\204\350\212\202\347\202\271.md" b/docs/solutions/0001-0099/swap-nodes-in-pairs.md similarity index 100% rename from "Solutions/0024. \344\270\244\344\270\244\344\272\244\346\215\242\351\223\276\350\241\250\344\270\255\347\232\204\350\212\202\347\202\271.md" rename to docs/solutions/0001-0099/swap-nodes-in-pairs.md diff --git "a/Solutions/0042. \346\216\245\351\233\250\346\260\264.md" b/docs/solutions/0001-0099/trapping-rain-water.md similarity index 100% rename from "Solutions/0042. \346\216\245\351\233\250\346\260\264.md" rename to docs/solutions/0001-0099/trapping-rain-water.md diff --git "a/Solutions/0001. \344\270\244\346\225\260\344\271\213\345\222\214.md" b/docs/solutions/0001-0099/two-sum.md similarity index 100% rename from "Solutions/0001. \344\270\244\346\225\260\344\271\213\345\222\214.md" rename to docs/solutions/0001-0099/two-sum.md diff --git "a/Solutions/0095. \344\270\215\345\220\214\347\232\204\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221 II.md" b/docs/solutions/0001-0099/unique-binary-search-trees-ii.md similarity index 100% rename from "Solutions/0095. \344\270\215\345\220\214\347\232\204\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221 II.md" rename to docs/solutions/0001-0099/unique-binary-search-trees-ii.md diff --git "a/Solutions/0096. \344\270\215\345\220\214\347\232\204\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221.md" b/docs/solutions/0001-0099/unique-binary-search-trees.md similarity index 100% rename from "Solutions/0096. \344\270\215\345\220\214\347\232\204\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221.md" rename to docs/solutions/0001-0099/unique-binary-search-trees.md diff --git "a/Solutions/0063. \344\270\215\345\220\214\350\267\257\345\276\204 II.md" b/docs/solutions/0001-0099/unique-paths-ii.md similarity index 100% rename from "Solutions/0063. \344\270\215\345\220\214\350\267\257\345\276\204 II.md" rename to docs/solutions/0001-0099/unique-paths-ii.md diff --git "a/Solutions/0062. \344\270\215\345\220\214\350\267\257\345\276\204.md" b/docs/solutions/0001-0099/unique-paths.md similarity index 100% rename from "Solutions/0062. \344\270\215\345\220\214\350\267\257\345\276\204.md" rename to docs/solutions/0001-0099/unique-paths.md diff --git "a/Solutions/0020. \346\234\211\346\225\210\347\232\204\346\213\254\345\217\267.md" b/docs/solutions/0001-0099/valid-parentheses.md similarity index 100% rename from "Solutions/0020. \346\234\211\346\225\210\347\232\204\346\213\254\345\217\267.md" rename to docs/solutions/0001-0099/valid-parentheses.md diff --git "a/Solutions/0036. \346\234\211\346\225\210\347\232\204\346\225\260\347\213\254.md" b/docs/solutions/0001-0099/valid-sudoku.md similarity index 100% rename from "Solutions/0036. \346\234\211\346\225\210\347\232\204\346\225\260\347\213\254.md" rename to docs/solutions/0001-0099/valid-sudoku.md diff --git "a/Solutions/0098. \351\252\214\350\257\201\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221.md" b/docs/solutions/0001-0099/validate-binary-search-tree.md similarity index 100% rename from "Solutions/0098. \351\252\214\350\257\201\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221.md" rename to docs/solutions/0001-0099/validate-binary-search-tree.md diff --git "a/Solutions/0044. \351\200\232\351\205\215\347\254\246\345\214\271\351\205\215.md" b/docs/solutions/0001-0099/wildcard-matching.md similarity index 100% rename from "Solutions/0044. \351\200\232\351\205\215\347\254\246\345\214\271\351\205\215.md" rename to docs/solutions/0001-0099/wildcard-matching.md diff --git "a/Solutions/0079. \345\215\225\350\257\215\346\220\234\347\264\242.md" b/docs/solutions/0001-0099/word-search.md similarity index 100% rename from "Solutions/0079. \345\215\225\350\257\215\346\220\234\347\264\242.md" rename to docs/solutions/0001-0099/word-search.md diff --git "a/Solutions/0110. \345\271\263\350\241\241\344\272\214\345\217\211\346\240\221.md" b/docs/solutions/0100-0199/balanced-binary-tree.md similarity index 100% rename from "Solutions/0110. \345\271\263\350\241\241\344\272\214\345\217\211\346\240\221.md" rename to docs/solutions/0100-0199/balanced-binary-tree.md diff --git "a/Solutions/0122. \344\271\260\345\215\226\350\202\241\347\245\250\347\232\204\346\234\200\344\275\263\346\227\266\346\234\272 II.md" b/docs/solutions/0100-0199/best-time-to-buy-and-sell-stock-ii.md similarity index 100% rename from "Solutions/0122. \344\271\260\345\215\226\350\202\241\347\245\250\347\232\204\346\234\200\344\275\263\346\227\266\346\234\272 II.md" rename to docs/solutions/0100-0199/best-time-to-buy-and-sell-stock-ii.md diff --git "a/Solutions/0123. \344\271\260\345\215\226\350\202\241\347\245\250\347\232\204\346\234\200\344\275\263\346\227\266\346\234\272 III.md" b/docs/solutions/0100-0199/best-time-to-buy-and-sell-stock-iii.md similarity index 100% rename from "Solutions/0123. \344\271\260\345\215\226\350\202\241\347\245\250\347\232\204\346\234\200\344\275\263\346\227\266\346\234\272 III.md" rename to docs/solutions/0100-0199/best-time-to-buy-and-sell-stock-iii.md diff --git "a/Solutions/0188. \344\271\260\345\215\226\350\202\241\347\245\250\347\232\204\346\234\200\344\275\263\346\227\266\346\234\272 IV.md" b/docs/solutions/0100-0199/best-time-to-buy-and-sell-stock-iv.md similarity index 100% rename from "Solutions/0188. \344\271\260\345\215\226\350\202\241\347\245\250\347\232\204\346\234\200\344\275\263\346\227\266\346\234\272 IV.md" rename to docs/solutions/0100-0199/best-time-to-buy-and-sell-stock-iv.md diff --git "a/Solutions/0121. \344\271\260\345\215\226\350\202\241\347\245\250\347\232\204\346\234\200\344\275\263\346\227\266\346\234\272.md" b/docs/solutions/0100-0199/best-time-to-buy-and-sell-stock.md similarity index 100% rename from "Solutions/0121. \344\271\260\345\215\226\350\202\241\347\245\250\347\232\204\346\234\200\344\275\263\346\227\266\346\234\272.md" rename to docs/solutions/0100-0199/best-time-to-buy-and-sell-stock.md diff --git "a/Solutions/0173. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\350\277\255\344\273\243\345\231\250.md" b/docs/solutions/0100-0199/binary-search-tree-iterator.md similarity index 100% rename from "Solutions/0173. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\350\277\255\344\273\243\345\231\250.md" rename to docs/solutions/0100-0199/binary-search-tree-iterator.md diff --git "a/Solutions/0107. \344\272\214\345\217\211\346\240\221\347\232\204\345\261\202\345\272\217\351\201\215\345\216\206 II.md" b/docs/solutions/0100-0199/binary-tree-level-order-traversal-ii.md similarity index 100% rename from "Solutions/0107. \344\272\214\345\217\211\346\240\221\347\232\204\345\261\202\345\272\217\351\201\215\345\216\206 II.md" rename to docs/solutions/0100-0199/binary-tree-level-order-traversal-ii.md diff --git "a/Solutions/0102. \344\272\214\345\217\211\346\240\221\347\232\204\345\261\202\345\272\217\351\201\215\345\216\206.md" b/docs/solutions/0100-0199/binary-tree-level-order-traversal.md similarity index 100% rename from "Solutions/0102. \344\272\214\345\217\211\346\240\221\347\232\204\345\261\202\345\272\217\351\201\215\345\216\206.md" rename to docs/solutions/0100-0199/binary-tree-level-order-traversal.md diff --git "a/Solutions/0124. \344\272\214\345\217\211\346\240\221\344\270\255\347\232\204\346\234\200\345\244\247\350\267\257\345\276\204\345\222\214.md" b/docs/solutions/0100-0199/binary-tree-maximum-path-sum.md similarity index 100% rename from "Solutions/0124. \344\272\214\345\217\211\346\240\221\344\270\255\347\232\204\346\234\200\345\244\247\350\267\257\345\276\204\345\222\214.md" rename to docs/solutions/0100-0199/binary-tree-maximum-path-sum.md diff --git "a/Solutions/0145. \344\272\214\345\217\211\346\240\221\347\232\204\345\220\216\345\272\217\351\201\215\345\216\206.md" b/docs/solutions/0100-0199/binary-tree-postorder-traversal.md similarity index 100% rename from "Solutions/0145. \344\272\214\345\217\211\346\240\221\347\232\204\345\220\216\345\272\217\351\201\215\345\216\206.md" rename to docs/solutions/0100-0199/binary-tree-postorder-traversal.md diff --git "a/Solutions/0144. \344\272\214\345\217\211\346\240\221\347\232\204\345\211\215\345\272\217\351\201\215\345\216\206.md" b/docs/solutions/0100-0199/binary-tree-preorder-traversal.md similarity index 100% rename from "Solutions/0144. \344\272\214\345\217\211\346\240\221\347\232\204\345\211\215\345\272\217\351\201\215\345\216\206.md" rename to docs/solutions/0100-0199/binary-tree-preorder-traversal.md diff --git "a/Solutions/0199. \344\272\214\345\217\211\346\240\221\347\232\204\345\217\263\350\247\206\345\233\276.md" b/docs/solutions/0100-0199/binary-tree-right-side-view.md similarity index 100% rename from "Solutions/0199. \344\272\214\345\217\211\346\240\221\347\232\204\345\217\263\350\247\206\345\233\276.md" rename to docs/solutions/0100-0199/binary-tree-right-side-view.md diff --git "a/Solutions/0103. \344\272\214\345\217\211\346\240\221\347\232\204\351\224\257\351\275\277\345\275\242\345\261\202\345\272\217\351\201\215\345\216\206.md" b/docs/solutions/0100-0199/binary-tree-zigzag-level-order-traversal.md similarity index 100% rename from "Solutions/0103. \344\272\214\345\217\211\346\240\221\347\232\204\351\224\257\351\275\277\345\275\242\345\261\202\345\272\217\351\201\215\345\216\206.md" rename to docs/solutions/0100-0199/binary-tree-zigzag-level-order-traversal.md diff --git "a/Solutions/0135. \345\210\206\345\217\221\347\263\226\346\236\234.md" b/docs/solutions/0100-0199/candy.md similarity index 100% rename from "Solutions/0135. \345\210\206\345\217\221\347\263\226\346\236\234.md" rename to docs/solutions/0100-0199/candy.md diff --git "a/Solutions/0133. \345\205\213\351\232\206\345\233\276.md" b/docs/solutions/0100-0199/clone-graph.md similarity index 100% rename from "Solutions/0133. \345\205\213\351\232\206\345\233\276.md" rename to docs/solutions/0100-0199/clone-graph.md diff --git "a/Solutions/0106. \344\273\216\344\270\255\345\272\217\344\270\216\345\220\216\345\272\217\351\201\215\345\216\206\345\272\217\345\210\227\346\236\204\351\200\240\344\272\214\345\217\211\346\240\221.md" b/docs/solutions/0100-0199/construct-binary-tree-from-inorder-and-postorder-traversal.md similarity index 100% rename from "Solutions/0106. \344\273\216\344\270\255\345\272\217\344\270\216\345\220\216\345\272\217\351\201\215\345\216\206\345\272\217\345\210\227\346\236\204\351\200\240\344\272\214\345\217\211\346\240\221.md" rename to docs/solutions/0100-0199/construct-binary-tree-from-inorder-and-postorder-traversal.md diff --git "a/Solutions/0105. \344\273\216\345\211\215\345\272\217\344\270\216\344\270\255\345\272\217\351\201\215\345\216\206\345\272\217\345\210\227\346\236\204\351\200\240\344\272\214\345\217\211\346\240\221.md" b/docs/solutions/0100-0199/construct-binary-tree-from-preorder-and-inorder-traversal.md similarity index 100% rename from "Solutions/0105. \344\273\216\345\211\215\345\272\217\344\270\216\344\270\255\345\272\217\351\201\215\345\216\206\345\272\217\345\210\227\346\236\204\351\200\240\344\272\214\345\217\211\346\240\221.md" rename to docs/solutions/0100-0199/construct-binary-tree-from-preorder-and-inorder-traversal.md diff --git "a/Solutions/0108. \345\260\206\346\234\211\345\272\217\346\225\260\347\273\204\350\275\254\346\215\242\344\270\272\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221.md" b/docs/solutions/0100-0199/convert-sorted-array-to-binary-search-tree.md similarity index 100% rename from "Solutions/0108. \345\260\206\346\234\211\345\272\217\346\225\260\347\273\204\350\275\254\346\215\242\344\270\272\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221.md" rename to docs/solutions/0100-0199/convert-sorted-array-to-binary-search-tree.md diff --git "a/Solutions/0138. \345\244\215\345\210\266\345\270\246\351\232\217\346\234\272\346\214\207\351\222\210\347\232\204\351\223\276\350\241\250.md" b/docs/solutions/0100-0199/copy-list-with-random-pointer.md similarity index 91% rename from "Solutions/0138. \345\244\215\345\210\266\345\270\246\351\232\217\346\234\272\346\214\207\351\222\210\347\232\204\351\223\276\350\241\250.md" rename to docs/solutions/0100-0199/copy-list-with-random-pointer.md index 7bea1029..b5db18c4 100644 --- "a/Solutions/0138. \345\244\215\345\210\266\345\270\246\351\232\217\346\234\272\346\214\207\351\222\210\347\232\204\351\223\276\350\241\250.md" +++ b/docs/solutions/0100-0199/copy-list-with-random-pointer.md @@ -1,11 +1,11 @@ -# [0138. 复制带随机指针的链表](https://leetcode.cn/problems/copy-list-with-random-pointer/) +# [0138. 随机链表的复制](https://leetcode.cn/problems/copy-list-with-random-pointer/) - 标签：哈希表、链表 - 难度：中等 ## 题目链接 -- [0138. 复制带随机指针的链表 - 力扣](https://leetcode.cn/problems/copy-list-with-random-pointer/) +- [0138. 随机链表的复制 - 力扣](https://leetcode.cn/problems/copy-list-with-random-pointer/) ## 题目大意 diff --git "a/Solutions/0115. \344\270\215\345\220\214\347\232\204\345\255\220\345\272\217\345\210\227.md" b/docs/solutions/0100-0199/distinct-subsequences.md similarity index 100% rename from "Solutions/0115. \344\270\215\345\220\214\347\232\204\345\255\220\345\272\217\345\210\227.md" rename to docs/solutions/0100-0199/distinct-subsequences.md diff --git "a/Solutions/0150. \351\200\206\346\263\242\345\205\260\350\241\250\350\276\276\345\274\217\346\261\202\345\200\274.md" b/docs/solutions/0100-0199/evaluate-reverse-polish-notation.md similarity index 100% rename from "Solutions/0150. \351\200\206\346\263\242\345\205\260\350\241\250\350\276\276\345\274\217\346\261\202\345\200\274.md" rename to docs/solutions/0100-0199/evaluate-reverse-polish-notation.md diff --git "a/Solutions/0171. Excel \350\241\250\345\210\227\345\272\217\345\217\267.md" b/docs/solutions/0100-0199/excel-sheet-column-number.md similarity index 100% rename from "Solutions/0171. Excel \350\241\250\345\210\227\345\272\217\345\217\267.md" rename to docs/solutions/0100-0199/excel-sheet-column-number.md diff --git "a/Solutions/0168. Excel\350\241\250\345\210\227\345\220\215\347\247\260.md" b/docs/solutions/0100-0199/excel-sheet-column-title.md similarity index 82% rename from "Solutions/0168. Excel\350\241\250\345\210\227\345\220\215\347\247\260.md" rename to docs/solutions/0100-0199/excel-sheet-column-title.md index 0b18c679..bbbcb500 100644 --- "a/Solutions/0168. Excel\350\241\250\345\210\227\345\220\215\347\247\260.md" +++ b/docs/solutions/0100-0199/excel-sheet-column-title.md @@ -1,11 +1,11 @@ -# [0168. Excel表列名称](https://leetcode.cn/problems/excel-sheet-column-title/) +# [0168. Excel 表列名称](https://leetcode.cn/problems/excel-sheet-column-title/) - 标签：数学、字符串 - 难度：简单 ## 题目链接 -- [0168. Excel表列名称 - 力扣](https://leetcode.cn/problems/excel-sheet-column-title/) +- [0168. Excel 表列名称 - 力扣](https://leetcode.cn/problems/excel-sheet-column-title/) ## 题目大意 diff --git "a/Solutions/0172. \351\230\266\344\271\230\345\220\216\347\232\204\351\233\266.md" b/docs/solutions/0100-0199/factorial-trailing-zeroes.md similarity index 100% rename from "Solutions/0172. \351\230\266\344\271\230\345\220\216\347\232\204\351\233\266.md" rename to docs/solutions/0100-0199/factorial-trailing-zeroes.md diff --git "a/Solutions/0154. \345\257\273\346\211\276\346\227\213\350\275\254\346\216\222\345\272\217\346\225\260\347\273\204\344\270\255\347\232\204\346\234\200\345\260\217\345\200\274 II.md" b/docs/solutions/0100-0199/find-minimum-in-rotated-sorted-array-ii.md similarity index 100% rename from "Solutions/0154. \345\257\273\346\211\276\346\227\213\350\275\254\346\216\222\345\272\217\346\225\260\347\273\204\344\270\255\347\232\204\346\234\200\345\260\217\345\200\274 II.md" rename to docs/solutions/0100-0199/find-minimum-in-rotated-sorted-array-ii.md diff --git "a/Solutions/0153. \345\257\273\346\211\276\346\227\213\350\275\254\346\216\222\345\272\217\346\225\260\347\273\204\344\270\255\347\232\204\346\234\200\345\260\217\345\200\274.md" b/docs/solutions/0100-0199/find-minimum-in-rotated-sorted-array.md similarity index 100% rename from "Solutions/0153. \345\257\273\346\211\276\346\227\213\350\275\254\346\216\222\345\272\217\346\225\260\347\273\204\344\270\255\347\232\204\346\234\200\345\260\217\345\200\274.md" rename to docs/solutions/0100-0199/find-minimum-in-rotated-sorted-array.md diff --git "a/Solutions/0162. \345\257\273\346\211\276\345\263\260\345\200\274.md" b/docs/solutions/0100-0199/find-peak-element.md similarity index 100% rename from "Solutions/0162. \345\257\273\346\211\276\345\263\260\345\200\274.md" rename to docs/solutions/0100-0199/find-peak-element.md diff --git "a/Solutions/0166. \345\210\206\346\225\260\345\210\260\345\260\217\346\225\260.md" b/docs/solutions/0100-0199/fraction-to-recurring-decimal.md similarity index 100% rename from "Solutions/0166. \345\210\206\346\225\260\345\210\260\345\260\217\346\225\260.md" rename to docs/solutions/0100-0199/fraction-to-recurring-decimal.md diff --git "a/Solutions/0134. \345\212\240\346\262\271\347\253\231.md" b/docs/solutions/0100-0199/gas-station.md similarity index 100% rename from "Solutions/0134. \345\212\240\346\262\271\347\253\231.md" rename to docs/solutions/0100-0199/gas-station.md diff --git "a/Solutions/0198. \346\211\223\345\256\266\345\212\253\350\210\215.md" b/docs/solutions/0100-0199/house-robber.md similarity index 100% rename from "Solutions/0198. \346\211\223\345\256\266\345\212\253\350\210\215.md" rename to docs/solutions/0100-0199/house-robber.md diff --git a/docs/solutions/0100-0199/index.md b/docs/solutions/0100-0199/index.md new file mode 100644 index 00000000..61dcf2cf --- /dev/null +++ b/docs/solutions/0100-0199/index.md @@ -0,0 +1,72 @@ +## 本章内容 + +- [0100. 相同的树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/same-tree.md) +- [0101. 对称二叉树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/symmetric-tree.md) +- [0102. 二叉树的层序遍历](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-level-order-traversal.md) +- [0103. 二叉树的锯齿形层序遍历](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-zigzag-level-order-traversal.md) +- [0104. 二叉树的最大深度](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/maximum-depth-of-binary-tree.md) +- [0105. 从前序与中序遍历序列构造二叉树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/construct-binary-tree-from-preorder-and-inorder-traversal.md) +- [0106. 从中序与后序遍历序列构造二叉树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/construct-binary-tree-from-inorder-and-postorder-traversal.md) +- [0107. 二叉树的层序遍历 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-level-order-traversal-ii.md) +- [0108. 将有序数组转换为二叉搜索树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/convert-sorted-array-to-binary-search-tree.md) +- [0110. 平衡二叉树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/balanced-binary-tree.md) +- [0111. 二叉树的最小深度](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/minimum-depth-of-binary-tree.md) +- [0112. 路径总和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/path-sum.md) +- [0113. 路径总和 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/path-sum-ii.md) +- [0115. 不同的子序列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/distinct-subsequences.md) +- [0116. 填充每个节点的下一个右侧节点指针](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/populating-next-right-pointers-in-each-node.md) +- [0117. 填充每个节点的下一个右侧节点指针 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/populating-next-right-pointers-in-each-node-ii.md) +- [0118. 杨辉三角](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/pascals-triangle.md) +- [0119. 杨辉三角 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/pascals-triangle-ii.md) +- [0120. 三角形最小路径和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/triangle.md) +- [0121. 买卖股票的最佳时机](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/best-time-to-buy-and-sell-stock.md) +- [0122. 买卖股票的最佳时机 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/best-time-to-buy-and-sell-stock-ii.md) +- [0123. 买卖股票的最佳时机 III](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/best-time-to-buy-and-sell-stock-iii.md) +- [0124. 二叉树中的最大路径和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-maximum-path-sum.md) +- [0125. 验证回文串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/valid-palindrome.md) +- [0127. 单词接龙](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/word-ladder.md) +- [0128. 最长连续序列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/longest-consecutive-sequence.md) +- [0129. 求根节点到叶节点数字之和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/sum-root-to-leaf-numbers.md) +- [0130. 被围绕的区域](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/surrounded-regions.md) +- [0131. 分割回文串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/palindrome-partitioning.md) +- [0133. 克隆图](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/clone-graph.md) +- [0134. 加油站](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/gas-station.md) +- [0135. 分发糖果](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/candy.md) +- [0136. 只出现一次的数字](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/single-number.md) +- [0137. 只出现一次的数字 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/single-number-ii.md) +- [0138. 随机链表的复制](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/copy-list-with-random-pointer.md) +- [0139. 单词拆分](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/word-break.md) +- [0140. 单词拆分 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/word-break-ii.md) +- [0141. 环形链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/linked-list-cycle.md) +- [0142. 环形链表 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/linked-list-cycle-ii.md) +- [0143. 重排链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/reorder-list.md) +- [0144. 二叉树的前序遍历](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-preorder-traversal.md) +- [0145. 二叉树的后序遍历](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-postorder-traversal.md) +- [0147. 对链表进行插入排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/insertion-sort-list.md) +- [0148. 排序链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/sort-list.md) +- [0149. 直线上最多的点数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/max-points-on-a-line.md) +- [0150. 逆波兰表达式求值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/evaluate-reverse-polish-notation.md) +- [0151. 反转字符串中的单词](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/reverse-words-in-a-string.md) +- [0152. 乘积最大子数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/maximum-product-subarray.md) +- [0153. 寻找旋转排序数组中的最小值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/find-minimum-in-rotated-sorted-array.md) +- [0154. 寻找旋转排序数组中的最小值 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/find-minimum-in-rotated-sorted-array-ii.md) +- [0155. 最小栈](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/min-stack.md) +- [0159. 至多包含两个不同字符的最长子串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/longest-substring-with-at-most-two-distinct-characters.md) +- [0160. 相交链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/intersection-of-two-linked-lists.md) +- [0162. 寻找峰值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/find-peak-element.md) +- [0164. 最大间距](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/maximum-gap.md) +- [0166. 分数到小数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/fraction-to-recurring-decimal.md) +- [0167. 两数之和 II - 输入有序数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/two-sum-ii-input-array-is-sorted.md) +- [0168. Excel 表列名称](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/excel-sheet-column-title.md) +- [0169. 多数元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/majority-element.md) +- [0170. 两数之和 III - 数据结构设计](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/two-sum-iii-data-structure-design.md) +- [0171. Excel 表列序号](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/excel-sheet-column-number.md) +- [0172. 阶乘后的零](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/factorial-trailing-zeroes.md) +- [0173. 二叉搜索树迭代器](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-search-tree-iterator.md) +- [0179. 最大数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/largest-number.md) +- [0188. 买卖股票的最佳时机 IV](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/best-time-to-buy-and-sell-stock-iv.md) +- [0189. 轮转数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/rotate-array.md) +- [0190. 颠倒二进制位](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/reverse-bits.md) +- [0191. 位1的个数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/number-of-1-bits.md) +- [0198. 打家劫舍](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/house-robber.md) +- [0199. 二叉树的右视图](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/binary-tree-right-side-view.md) diff --git "a/Solutions/0147. \345\257\271\351\223\276\350\241\250\350\277\233\350\241\214\346\217\222\345\205\245\346\216\222\345\272\217.md" b/docs/solutions/0100-0199/insertion-sort-list.md similarity index 100% rename from "Solutions/0147. \345\257\271\351\223\276\350\241\250\350\277\233\350\241\214\346\217\222\345\205\245\346\216\222\345\272\217.md" rename to docs/solutions/0100-0199/insertion-sort-list.md diff --git "a/Solutions/0160. \347\233\270\344\272\244\351\223\276\350\241\250.md" b/docs/solutions/0100-0199/intersection-of-two-linked-lists.md similarity index 100% rename from "Solutions/0160. \347\233\270\344\272\244\351\223\276\350\241\250.md" rename to docs/solutions/0100-0199/intersection-of-two-linked-lists.md diff --git "a/Solutions/0179. \346\234\200\345\244\247\346\225\260.md" b/docs/solutions/0100-0199/largest-number.md similarity index 100% rename from "Solutions/0179. \346\234\200\345\244\247\346\225\260.md" rename to docs/solutions/0100-0199/largest-number.md diff --git "a/Solutions/0142. \347\216\257\345\275\242\351\223\276\350\241\250 II.md" b/docs/solutions/0100-0199/linked-list-cycle-ii.md similarity index 100% rename from "Solutions/0142. \347\216\257\345\275\242\351\223\276\350\241\250 II.md" rename to docs/solutions/0100-0199/linked-list-cycle-ii.md diff --git "a/Solutions/0141. \347\216\257\345\275\242\351\223\276\350\241\250.md" b/docs/solutions/0100-0199/linked-list-cycle.md similarity index 100% rename from "Solutions/0141. \347\216\257\345\275\242\351\223\276\350\241\250.md" rename to docs/solutions/0100-0199/linked-list-cycle.md diff --git "a/Solutions/0128. \346\234\200\351\225\277\350\277\236\347\273\255\345\272\217\345\210\227.md" b/docs/solutions/0100-0199/longest-consecutive-sequence.md similarity index 100% rename from "Solutions/0128. \346\234\200\351\225\277\350\277\236\347\273\255\345\272\217\345\210\227.md" rename to docs/solutions/0100-0199/longest-consecutive-sequence.md diff --git "a/Solutions/0159. \350\207\263\345\244\232\345\214\205\345\220\253\344\270\244\344\270\252\344\270\215\345\220\214\345\255\227\347\254\246\347\232\204\346\234\200\351\225\277\345\255\220\344\270\262.md" b/docs/solutions/0100-0199/longest-substring-with-at-most-two-distinct-characters.md similarity index 100% rename from "Solutions/0159. \350\207\263\345\244\232\345\214\205\345\220\253\344\270\244\344\270\252\344\270\215\345\220\214\345\255\227\347\254\246\347\232\204\346\234\200\351\225\277\345\255\220\344\270\262.md" rename to docs/solutions/0100-0199/longest-substring-with-at-most-two-distinct-characters.md diff --git "a/Solutions/0169. \345\244\232\346\225\260\345\205\203\347\264\240.md" b/docs/solutions/0100-0199/majority-element.md similarity index 100% rename from "Solutions/0169. \345\244\232\346\225\260\345\205\203\347\264\240.md" rename to docs/solutions/0100-0199/majority-element.md diff --git "a/Solutions/0149. \347\233\264\347\272\277\344\270\212\346\234\200\345\244\232\347\232\204\347\202\271\346\225\260.md" b/docs/solutions/0100-0199/max-points-on-a-line.md similarity index 100% rename from "Solutions/0149. \347\233\264\347\272\277\344\270\212\346\234\200\345\244\232\347\232\204\347\202\271\346\225\260.md" rename to docs/solutions/0100-0199/max-points-on-a-line.md diff --git "a/Solutions/0104. \344\272\214\345\217\211\346\240\221\347\232\204\346\234\200\345\244\247\346\267\261\345\272\246.md" b/docs/solutions/0100-0199/maximum-depth-of-binary-tree.md similarity index 100% rename from "Solutions/0104. \344\272\214\345\217\211\346\240\221\347\232\204\346\234\200\345\244\247\346\267\261\345\272\246.md" rename to docs/solutions/0100-0199/maximum-depth-of-binary-tree.md diff --git "a/Solutions/0164. \346\234\200\345\244\247\351\227\264\350\267\235.md" b/docs/solutions/0100-0199/maximum-gap.md similarity index 100% rename from "Solutions/0164. \346\234\200\345\244\247\351\227\264\350\267\235.md" rename to docs/solutions/0100-0199/maximum-gap.md diff --git "a/Solutions/0152. \344\271\230\347\247\257\346\234\200\345\244\247\345\255\220\346\225\260\347\273\204.md" b/docs/solutions/0100-0199/maximum-product-subarray.md similarity index 100% rename from "Solutions/0152. \344\271\230\347\247\257\346\234\200\345\244\247\345\255\220\346\225\260\347\273\204.md" rename to docs/solutions/0100-0199/maximum-product-subarray.md diff --git "a/Solutions/0155. \346\234\200\345\260\217\346\240\210.md" b/docs/solutions/0100-0199/min-stack.md similarity index 100% rename from "Solutions/0155. \346\234\200\345\260\217\346\240\210.md" rename to docs/solutions/0100-0199/min-stack.md diff --git "a/Solutions/0111. \344\272\214\345\217\211\346\240\221\347\232\204\346\234\200\345\260\217\346\267\261\345\272\246.md" b/docs/solutions/0100-0199/minimum-depth-of-binary-tree.md similarity index 100% rename from "Solutions/0111. \344\272\214\345\217\211\346\240\221\347\232\204\346\234\200\345\260\217\346\267\261\345\272\246.md" rename to docs/solutions/0100-0199/minimum-depth-of-binary-tree.md diff --git "a/Solutions/0191. \344\275\2151\347\232\204\344\270\252\346\225\260.md" b/docs/solutions/0100-0199/number-of-1-bits.md similarity index 100% rename from "Solutions/0191. \344\275\2151\347\232\204\344\270\252\346\225\260.md" rename to docs/solutions/0100-0199/number-of-1-bits.md diff --git "a/Solutions/0131. \345\210\206\345\211\262\345\233\236\346\226\207\344\270\262.md" b/docs/solutions/0100-0199/palindrome-partitioning.md similarity index 100% rename from "Solutions/0131. \345\210\206\345\211\262\345\233\236\346\226\207\344\270\262.md" rename to docs/solutions/0100-0199/palindrome-partitioning.md diff --git "a/Solutions/0119. \346\235\250\350\276\211\344\270\211\350\247\222 II.md" b/docs/solutions/0100-0199/pascals-triangle-ii.md similarity index 100% rename from "Solutions/0119. \346\235\250\350\276\211\344\270\211\350\247\222 II.md" rename to docs/solutions/0100-0199/pascals-triangle-ii.md diff --git "a/Solutions/0118. \346\235\250\350\276\211\344\270\211\350\247\222.md" b/docs/solutions/0100-0199/pascals-triangle.md similarity index 100% rename from "Solutions/0118. \346\235\250\350\276\211\344\270\211\350\247\222.md" rename to docs/solutions/0100-0199/pascals-triangle.md diff --git "a/Solutions/0113. \350\267\257\345\276\204\346\200\273\345\222\214 II.md" b/docs/solutions/0100-0199/path-sum-ii.md similarity index 100% rename from "Solutions/0113. \350\267\257\345\276\204\346\200\273\345\222\214 II.md" rename to docs/solutions/0100-0199/path-sum-ii.md diff --git "a/Solutions/0112. \350\267\257\345\276\204\346\200\273\345\222\214.md" b/docs/solutions/0100-0199/path-sum.md similarity index 100% rename from "Solutions/0112. \350\267\257\345\276\204\346\200\273\345\222\214.md" rename to docs/solutions/0100-0199/path-sum.md diff --git "a/Solutions/0117. \345\241\253\345\205\205\346\257\217\344\270\252\350\212\202\347\202\271\347\232\204\344\270\213\344\270\200\344\270\252\345\217\263\344\276\247\350\212\202\347\202\271\346\214\207\351\222\210 II.md" b/docs/solutions/0100-0199/populating-next-right-pointers-in-each-node-ii.md similarity index 100% rename from "Solutions/0117. \345\241\253\345\205\205\346\257\217\344\270\252\350\212\202\347\202\271\347\232\204\344\270\213\344\270\200\344\270\252\345\217\263\344\276\247\350\212\202\347\202\271\346\214\207\351\222\210 II.md" rename to docs/solutions/0100-0199/populating-next-right-pointers-in-each-node-ii.md diff --git "a/Solutions/0116. \345\241\253\345\205\205\346\257\217\344\270\252\350\212\202\347\202\271\347\232\204\344\270\213\344\270\200\344\270\252\345\217\263\344\276\247\350\212\202\347\202\271\346\214\207\351\222\210.md" b/docs/solutions/0100-0199/populating-next-right-pointers-in-each-node.md similarity index 100% rename from "Solutions/0116. \345\241\253\345\205\205\346\257\217\344\270\252\350\212\202\347\202\271\347\232\204\344\270\213\344\270\200\344\270\252\345\217\263\344\276\247\350\212\202\347\202\271\346\214\207\351\222\210.md" rename to docs/solutions/0100-0199/populating-next-right-pointers-in-each-node.md diff --git "a/Solutions/0143. \351\207\215\346\216\222\351\223\276\350\241\250.md" b/docs/solutions/0100-0199/reorder-list.md similarity index 100% rename from "Solutions/0143. \351\207\215\346\216\222\351\223\276\350\241\250.md" rename to docs/solutions/0100-0199/reorder-list.md diff --git "a/Solutions/0190. \351\242\240\345\200\222\344\272\214\350\277\233\345\210\266\344\275\215.md" b/docs/solutions/0100-0199/reverse-bits.md similarity index 100% rename from "Solutions/0190. \351\242\240\345\200\222\344\272\214\350\277\233\345\210\266\344\275\215.md" rename to docs/solutions/0100-0199/reverse-bits.md diff --git "a/Solutions/0151. \345\217\215\350\275\254\345\255\227\347\254\246\344\270\262\344\270\255\347\232\204\345\215\225\350\257\215.md" b/docs/solutions/0100-0199/reverse-words-in-a-string.md similarity index 100% rename from "Solutions/0151. \345\217\215\350\275\254\345\255\227\347\254\246\344\270\262\344\270\255\347\232\204\345\215\225\350\257\215.md" rename to docs/solutions/0100-0199/reverse-words-in-a-string.md diff --git "a/Solutions/0189. \350\275\256\350\275\254\346\225\260\347\273\204.md" b/docs/solutions/0100-0199/rotate-array.md similarity index 100% rename from "Solutions/0189. \350\275\256\350\275\254\346\225\260\347\273\204.md" rename to docs/solutions/0100-0199/rotate-array.md diff --git "a/Solutions/0100. \347\233\270\345\220\214\347\232\204\346\240\221.md" b/docs/solutions/0100-0199/same-tree.md similarity index 100% rename from "Solutions/0100. \347\233\270\345\220\214\347\232\204\346\240\221.md" rename to docs/solutions/0100-0199/same-tree.md diff --git "a/Solutions/0137. \345\217\252\345\207\272\347\216\260\344\270\200\346\254\241\347\232\204\346\225\260\345\255\227 II.md" b/docs/solutions/0100-0199/single-number-ii.md similarity index 100% rename from "Solutions/0137. \345\217\252\345\207\272\347\216\260\344\270\200\346\254\241\347\232\204\346\225\260\345\255\227 II.md" rename to docs/solutions/0100-0199/single-number-ii.md diff --git "a/Solutions/0136. \345\217\252\345\207\272\347\216\260\344\270\200\346\254\241\347\232\204\346\225\260\345\255\227.md" b/docs/solutions/0100-0199/single-number.md similarity index 100% rename from "Solutions/0136. \345\217\252\345\207\272\347\216\260\344\270\200\346\254\241\347\232\204\346\225\260\345\255\227.md" rename to docs/solutions/0100-0199/single-number.md diff --git "a/Solutions/0148. \346\216\222\345\272\217\351\223\276\350\241\250.md" b/docs/solutions/0100-0199/sort-list.md similarity index 100% rename from "Solutions/0148. \346\216\222\345\272\217\351\223\276\350\241\250.md" rename to docs/solutions/0100-0199/sort-list.md diff --git "a/Solutions/0129. \346\261\202\346\240\271\350\212\202\347\202\271\345\210\260\345\217\266\350\212\202\347\202\271\346\225\260\345\255\227\344\271\213\345\222\214.md" b/docs/solutions/0100-0199/sum-root-to-leaf-numbers.md similarity index 100% rename from "Solutions/0129. \346\261\202\346\240\271\350\212\202\347\202\271\345\210\260\345\217\266\350\212\202\347\202\271\346\225\260\345\255\227\344\271\213\345\222\214.md" rename to docs/solutions/0100-0199/sum-root-to-leaf-numbers.md diff --git "a/Solutions/0130. \350\242\253\345\233\264\347\273\225\347\232\204\345\214\272\345\237\237.md" b/docs/solutions/0100-0199/surrounded-regions.md similarity index 100% rename from "Solutions/0130. \350\242\253\345\233\264\347\273\225\347\232\204\345\214\272\345\237\237.md" rename to docs/solutions/0100-0199/surrounded-regions.md diff --git "a/Solutions/0101. \345\257\271\347\247\260\344\272\214\345\217\211\346\240\221.md" b/docs/solutions/0100-0199/symmetric-tree.md similarity index 100% rename from "Solutions/0101. \345\257\271\347\247\260\344\272\214\345\217\211\346\240\221.md" rename to docs/solutions/0100-0199/symmetric-tree.md diff --git "a/Solutions/0120. \344\270\211\350\247\222\345\275\242\346\234\200\345\260\217\350\267\257\345\276\204\345\222\214.md" b/docs/solutions/0100-0199/triangle.md similarity index 100% rename from "Solutions/0120. \344\270\211\350\247\222\345\275\242\346\234\200\345\260\217\350\267\257\345\276\204\345\222\214.md" rename to docs/solutions/0100-0199/triangle.md diff --git "a/Solutions/0167. \344\270\244\346\225\260\344\271\213\345\222\214 II - \350\276\223\345\205\245\346\234\211\345\272\217\346\225\260\347\273\204.md" b/docs/solutions/0100-0199/two-sum-ii-input-array-is-sorted.md similarity index 100% rename from "Solutions/0167. \344\270\244\346\225\260\344\271\213\345\222\214 II - \350\276\223\345\205\245\346\234\211\345\272\217\346\225\260\347\273\204.md" rename to docs/solutions/0100-0199/two-sum-ii-input-array-is-sorted.md diff --git "a/Solutions/0170. \344\270\244\346\225\260\344\271\213\345\222\214 III - \346\225\260\346\215\256\347\273\223\346\236\204\350\256\276\350\256\241.md" b/docs/solutions/0100-0199/two-sum-iii-data-structure-design.md similarity index 100% rename from "Solutions/0170. \344\270\244\346\225\260\344\271\213\345\222\214 III - \346\225\260\346\215\256\347\273\223\346\236\204\350\256\276\350\256\241.md" rename to docs/solutions/0100-0199/two-sum-iii-data-structure-design.md diff --git "a/Solutions/0125. \351\252\214\350\257\201\345\233\236\346\226\207\344\270\262.md" b/docs/solutions/0100-0199/valid-palindrome.md similarity index 100% rename from "Solutions/0125. \351\252\214\350\257\201\345\233\236\346\226\207\344\270\262.md" rename to docs/solutions/0100-0199/valid-palindrome.md diff --git "a/Solutions/0140. \345\215\225\350\257\215\346\213\206\345\210\206 II.md" b/docs/solutions/0100-0199/word-break-ii.md similarity index 100% rename from "Solutions/0140. \345\215\225\350\257\215\346\213\206\345\210\206 II.md" rename to docs/solutions/0100-0199/word-break-ii.md diff --git "a/Solutions/0139. \345\215\225\350\257\215\346\213\206\345\210\206.md" b/docs/solutions/0100-0199/word-break.md similarity index 100% rename from "Solutions/0139. \345\215\225\350\257\215\346\213\206\345\210\206.md" rename to docs/solutions/0100-0199/word-break.md diff --git "a/Solutions/0127. \345\215\225\350\257\215\346\216\245\351\276\231.md" b/docs/solutions/0100-0199/word-ladder.md similarity index 100% rename from "Solutions/0127. \345\215\225\350\257\215\346\216\245\351\276\231.md" rename to docs/solutions/0100-0199/word-ladder.md diff --git "a/Solutions/0259. \350\276\203\345\260\217\347\232\204\344\270\211\346\225\260\344\271\213\345\222\214.md" b/docs/solutions/0200-0299/3sum-smaller.md similarity index 100% rename from "Solutions/0259. \350\276\203\345\260\217\347\232\204\344\270\211\346\225\260\344\271\213\345\222\214.md" rename to docs/solutions/0200-0299/3sum-smaller.md diff --git "a/Solutions/0258. \345\220\204\344\275\215\347\233\270\345\212\240.md" b/docs/solutions/0200-0299/add-digits.md similarity index 100% rename from "Solutions/0258. \345\220\204\344\275\215\347\233\270\345\212\240.md" rename to docs/solutions/0200-0299/add-digits.md diff --git "a/Solutions/0227. \345\237\272\346\234\254\350\256\241\347\256\227\345\231\250 II.md" b/docs/solutions/0200-0299/basic-calculator-ii.md similarity index 100% rename from "Solutions/0227. \345\237\272\346\234\254\350\256\241\347\256\227\345\231\250 II.md" rename to docs/solutions/0200-0299/basic-calculator-ii.md diff --git "a/Solutions/0257. \344\272\214\345\217\211\346\240\221\347\232\204\346\211\200\346\234\211\350\267\257\345\276\204.md" b/docs/solutions/0200-0299/binary-tree-paths.md similarity index 100% rename from "Solutions/0257. \344\272\214\345\217\211\346\240\221\347\232\204\346\211\200\346\234\211\350\267\257\345\276\204.md" rename to docs/solutions/0200-0299/binary-tree-paths.md diff --git "a/Solutions/0201. \346\225\260\345\255\227\350\214\203\345\233\264\346\214\211\344\275\215\344\270\216.md" b/docs/solutions/0200-0299/bitwise-and-of-numbers-range.md similarity index 100% rename from "Solutions/0201. \346\225\260\345\255\227\350\214\203\345\233\264\346\214\211\344\275\215\344\270\216.md" rename to docs/solutions/0200-0299/bitwise-and-of-numbers-range.md diff --git "a/Solutions/0270. \346\234\200\346\216\245\350\277\221\347\232\204\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\345\200\274.md" b/docs/solutions/0200-0299/closest-binary-search-tree-value.md similarity index 100% rename from "Solutions/0270. \346\234\200\346\216\245\350\277\221\347\232\204\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\345\200\274.md" rename to docs/solutions/0200-0299/closest-binary-search-tree-value.md diff --git "a/Solutions/0219. \345\255\230\345\234\250\351\207\215\345\244\215\345\205\203\347\264\240 II.md" b/docs/solutions/0200-0299/contains-duplicate-ii.md similarity index 100% rename from "Solutions/0219. \345\255\230\345\234\250\351\207\215\345\244\215\345\205\203\347\264\240 II.md" rename to docs/solutions/0200-0299/contains-duplicate-ii.md diff --git "a/Solutions/0220. \345\255\230\345\234\250\351\207\215\345\244\215\345\205\203\347\264\240 III.md" b/docs/solutions/0200-0299/contains-duplicate-iii.md similarity index 100% rename from "Solutions/0220. \345\255\230\345\234\250\351\207\215\345\244\215\345\205\203\347\264\240 III.md" rename to docs/solutions/0200-0299/contains-duplicate-iii.md diff --git "a/Solutions/0217. \345\255\230\345\234\250\351\207\215\345\244\215\345\205\203\347\264\240.md" b/docs/solutions/0200-0299/contains-duplicate.md similarity index 100% rename from "Solutions/0217. \345\255\230\345\234\250\351\207\215\345\244\215\345\205\203\347\264\240.md" rename to docs/solutions/0200-0299/contains-duplicate.md diff --git "a/Solutions/0222. \345\256\214\345\205\250\344\272\214\345\217\211\346\240\221\347\232\204\350\212\202\347\202\271\344\270\252\346\225\260.md" b/docs/solutions/0200-0299/count-complete-tree-nodes.md similarity index 100% rename from "Solutions/0222. \345\256\214\345\205\250\344\272\214\345\217\211\346\240\221\347\232\204\350\212\202\347\202\271\344\270\252\346\225\260.md" rename to docs/solutions/0200-0299/count-complete-tree-nodes.md diff --git "a/Solutions/0204. \350\256\241\346\225\260\350\264\250\346\225\260.md" b/docs/solutions/0200-0299/count-primes.md similarity index 100% rename from "Solutions/0204. \350\256\241\346\225\260\350\264\250\346\225\260.md" rename to docs/solutions/0200-0299/count-primes.md diff --git "a/Solutions/0210. \350\257\276\347\250\213\350\241\250 II.md" b/docs/solutions/0200-0299/course-schedule-ii.md similarity index 100% rename from "Solutions/0210. \350\257\276\347\250\213\350\241\250 II.md" rename to docs/solutions/0200-0299/course-schedule-ii.md diff --git "a/Solutions/0207. \350\257\276\347\250\213\350\241\250.md" b/docs/solutions/0200-0299/course-schedule.md similarity index 100% rename from "Solutions/0207. \350\257\276\347\250\213\350\241\250.md" rename to docs/solutions/0200-0299/course-schedule.md diff --git "a/Solutions/0237. \345\210\240\351\231\244\351\223\276\350\241\250\344\270\255\347\232\204\350\212\202\347\202\271.md" b/docs/solutions/0200-0299/delete-node-in-a-linked-list.md similarity index 100% rename from "Solutions/0237. \345\210\240\351\231\244\351\223\276\350\241\250\344\270\255\347\232\204\350\212\202\347\202\271.md" rename to docs/solutions/0200-0299/delete-node-in-a-linked-list.md diff --git "a/Solutions/0211. \346\267\273\345\212\240\344\270\216\346\220\234\347\264\242\345\215\225\350\257\215 - \346\225\260\346\215\256\347\273\223\346\236\204\350\256\276\350\256\241.md" b/docs/solutions/0200-0299/design-add-and-search-words-data-structure.md similarity index 100% rename from "Solutions/0211. \346\267\273\345\212\240\344\270\216\346\220\234\347\264\242\345\215\225\350\257\215 - \346\225\260\346\215\256\347\273\223\346\236\204\350\256\276\350\256\241.md" rename to docs/solutions/0200-0299/design-add-and-search-words-data-structure.md diff --git "a/Solutions/0241. \344\270\272\350\277\220\347\256\227\350\241\250\350\276\276\345\274\217\350\256\276\350\256\241\344\274\230\345\205\210\347\272\247.md" b/docs/solutions/0200-0299/different-ways-to-add-parentheses.md similarity index 100% rename from "Solutions/0241. \344\270\272\350\277\220\347\256\227\350\241\250\350\276\276\345\274\217\350\256\276\350\256\241\344\274\230\345\205\210\347\272\247.md" rename to docs/solutions/0200-0299/different-ways-to-add-parentheses.md diff --git "a/Solutions/0295. \346\225\260\346\215\256\346\265\201\347\232\204\344\270\255\344\275\215\346\225\260.md" b/docs/solutions/0200-0299/find-median-from-data-stream.md similarity index 100% rename from "Solutions/0295. \346\225\260\346\215\256\346\265\201\347\232\204\344\270\255\344\275\215\346\225\260.md" rename to docs/solutions/0200-0299/find-median-from-data-stream.md diff --git "a/Solutions/0287. \345\257\273\346\211\276\351\207\215\345\244\215\346\225\260.md" b/docs/solutions/0200-0299/find-the-duplicate-number.md similarity index 100% rename from "Solutions/0287. \345\257\273\346\211\276\351\207\215\345\244\215\346\225\260.md" rename to docs/solutions/0200-0299/find-the-duplicate-number.md diff --git "a/Solutions/0278. \347\254\254\344\270\200\344\270\252\351\224\231\350\257\257\347\232\204\347\211\210\346\234\254.md" b/docs/solutions/0200-0299/first-bad-version.md similarity index 100% rename from "Solutions/0278. \347\254\254\344\270\200\344\270\252\351\224\231\350\257\257\347\232\204\347\211\210\346\234\254.md" rename to docs/solutions/0200-0299/first-bad-version.md diff --git "a/Solutions/0289. \347\224\237\345\221\275\346\270\270\346\210\217.md" b/docs/solutions/0200-0299/game-of-life.md similarity index 100% rename from "Solutions/0289. \347\224\237\345\221\275\346\270\270\346\210\217.md" rename to docs/solutions/0200-0299/game-of-life.md diff --git "a/Solutions/0249. \347\247\273\344\275\215\345\255\227\347\254\246\344\270\262\345\210\206\347\273\204.md" b/docs/solutions/0200-0299/group-shifted-strings.md similarity index 100% rename from "Solutions/0249. \347\247\273\344\275\215\345\255\227\347\254\246\344\270\262\345\210\206\347\273\204.md" rename to docs/solutions/0200-0299/group-shifted-strings.md diff --git "a/Solutions/0202. \345\277\253\344\271\220\346\225\260.md" b/docs/solutions/0200-0299/happy-number.md similarity index 100% rename from "Solutions/0202. \345\277\253\344\271\220\346\225\260.md" rename to docs/solutions/0200-0299/happy-number.md diff --git "a/Solutions/0213. \346\211\223\345\256\266\345\212\253\350\210\215 II.md" b/docs/solutions/0200-0299/house-robber-ii.md similarity index 100% rename from "Solutions/0213. \346\211\223\345\256\266\345\212\253\350\210\215 II.md" rename to docs/solutions/0200-0299/house-robber-ii.md diff --git "a/Solutions/0232. \347\224\250\346\240\210\345\256\236\347\216\260\351\230\237\345\210\227.md" b/docs/solutions/0200-0299/implement-queue-using-stacks.md similarity index 100% rename from "Solutions/0232. \347\224\250\346\240\210\345\256\236\347\216\260\351\230\237\345\210\227.md" rename to docs/solutions/0200-0299/implement-queue-using-stacks.md diff --git "a/Solutions/0225. \347\224\250\351\230\237\345\210\227\345\256\236\347\216\260\346\240\210.md" b/docs/solutions/0200-0299/implement-stack-using-queues.md similarity index 100% rename from "Solutions/0225. \347\224\250\351\230\237\345\210\227\345\256\236\347\216\260\346\240\210.md" rename to docs/solutions/0200-0299/implement-stack-using-queues.md diff --git "a/Solutions/0208. \345\256\236\347\216\260 Trie (\345\211\215\347\274\200\346\240\221).md" b/docs/solutions/0200-0299/implement-trie-prefix-tree.md similarity index 100% rename from "Solutions/0208. \345\256\236\347\216\260 Trie (\345\211\215\347\274\200\346\240\221).md" rename to docs/solutions/0200-0299/implement-trie-prefix-tree.md diff --git a/docs/solutions/0200-0299/index.md b/docs/solutions/0200-0299/index.md new file mode 100644 index 00000000..ebd58d96 --- /dev/null +++ b/docs/solutions/0200-0299/index.md @@ -0,0 +1,60 @@ +## 本章内容 + +- [0200. 岛屿数量](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/number-of-islands.md) +- [0201. 数字范围按位与](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/bitwise-and-of-numbers-range.md) +- [0202. 快乐数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/happy-number.md) +- [0203. 移除链表元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/remove-linked-list-elements.md) +- [0204. 计数质数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/count-primes.md) +- [0205. 同构字符串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/isomorphic-strings.md) +- [0206. 反转链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/reverse-linked-list.md) +- [0207. 课程表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/course-schedule.md) +- [0208. 实现 Trie (前缀树)](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/implement-trie-prefix-tree.md) +- [0209. 长度最小的子数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/minimum-size-subarray-sum.md) +- [0210. 课程表 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/course-schedule-ii.md) +- [0211. 添加与搜索单词 - 数据结构设计](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/design-add-and-search-words-data-structure.md) +- [0212. 单词搜索 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/word-search-ii.md) +- [0213. 打家劫舍 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/house-robber-ii.md) +- [0215. 数组中的第K个最大元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/kth-largest-element-in-an-array.md) +- [0217. 存在重复元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/contains-duplicate.md) +- [0218. 天际线问题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/the-skyline-problem.md) +- [0219. 存在重复元素 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/contains-duplicate-ii.md) +- [0220. 存在重复元素 III](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/contains-duplicate-iii.md) +- [0221. 最大正方形](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/maximal-square.md) +- [0222. 完全二叉树的节点个数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/count-complete-tree-nodes.md) +- [0223. 矩形面积](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/rectangle-area.md) +- [0225. 用队列实现栈](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/implement-stack-using-queues.md) +- [0226. 翻转二叉树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/invert-binary-tree.md) +- [0227. 基本计算器 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/basic-calculator-ii.md) +- [0231. 2 的幂](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/power-of-two.md) +- [0232. 用栈实现队列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/implement-queue-using-stacks.md) +- [0233. 数字 1 的个数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/number-of-digit-one.md) +- [0234. 回文链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/palindrome-linked-list.md) +- [0235. 二叉搜索树的最近公共祖先](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/lowest-common-ancestor-of-a-binary-search-tree.md) +- [0236. 二叉树的最近公共祖先](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/lowest-common-ancestor-of-a-binary-tree.md) +- [0237. 删除链表中的节点](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/delete-node-in-a-linked-list.md) +- [0238. 除自身以外数组的乘积](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/product-of-array-except-self.md) +- [0239. 滑动窗口最大值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/sliding-window-maximum.md) +- [0240. 搜索二维矩阵 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/search-a-2d-matrix-ii.md) +- [0241. 为运算表达式设计优先级](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/different-ways-to-add-parentheses.md) +- [0242. 有效的字母异位词](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/valid-anagram.md) +- [0249. 移位字符串分组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/group-shifted-strings.md) +- [0257. 二叉树的所有路径](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/binary-tree-paths.md) +- [0258. 各位相加](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/add-digits.md) +- [0259. 较小的三数之和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/3sum-smaller.md) +- [0260. 只出现一次的数字 III](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/single-number-iii.md) +- [0263. 丑数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/ugly-number.md) +- [0264. 丑数 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/ugly-number-ii.md) +- [0268. 丢失的数字](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/missing-number.md) +- [0270. 最接近的二叉搜索树值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/closest-binary-search-tree-value.md) +- [0278. 第一个错误的版本](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/first-bad-version.md) +- [0279. 完全平方数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/perfect-squares.md) +- [0283. 移动零](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/move-zeroes.md) +- [0285. 二叉搜索树中的中序后继](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/inorder-successor-in-bst.md) +- [0286. 墙与门](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/walls-and-gates.md) +- [0287. 寻找重复数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/find-the-duplicate-number.md) +- [0288. 单词的唯一缩写](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/unique-word-abbreviation.md) +- [0289. 生命游戏](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/game-of-life.md) +- [0290. 单词规律](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/word-pattern.md) +- [0292. Nim 游戏](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/nim-game.md) +- [0295. 数据流的中位数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/find-median-from-data-stream.md) +- [0297. 二叉树的序列化与反序列化](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/serialize-and-deserialize-binary-tree.md) diff --git "a/Solutions/0285. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\344\270\255\347\232\204\344\270\255\345\272\217\345\220\216\347\273\247.md" b/docs/solutions/0200-0299/inorder-successor-in-bst.md similarity index 100% rename from "Solutions/0285. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\344\270\255\347\232\204\344\270\255\345\272\217\345\220\216\347\273\247.md" rename to docs/solutions/0200-0299/inorder-successor-in-bst.md diff --git "a/Solutions/0226. \347\277\273\350\275\254\344\272\214\345\217\211\346\240\221.md" b/docs/solutions/0200-0299/invert-binary-tree.md similarity index 100% rename from "Solutions/0226. \347\277\273\350\275\254\344\272\214\345\217\211\346\240\221.md" rename to docs/solutions/0200-0299/invert-binary-tree.md diff --git "a/Solutions/0205. \345\220\214\346\236\204\345\255\227\347\254\246\344\270\262.md" b/docs/solutions/0200-0299/isomorphic-strings.md similarity index 100% rename from "Solutions/0205. \345\220\214\346\236\204\345\255\227\347\254\246\344\270\262.md" rename to docs/solutions/0200-0299/isomorphic-strings.md diff --git "a/Solutions/0215. \346\225\260\347\273\204\344\270\255\347\232\204\347\254\254K\344\270\252\346\234\200\345\244\247\345\205\203\347\264\240.md" b/docs/solutions/0200-0299/kth-largest-element-in-an-array.md similarity index 100% rename from "Solutions/0215. \346\225\260\347\273\204\344\270\255\347\232\204\347\254\254K\344\270\252\346\234\200\345\244\247\345\205\203\347\264\240.md" rename to docs/solutions/0200-0299/kth-largest-element-in-an-array.md diff --git "a/Solutions/0235. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\347\232\204\346\234\200\350\277\221\345\205\254\345\205\261\347\245\226\345\205\210.md" b/docs/solutions/0200-0299/lowest-common-ancestor-of-a-binary-search-tree.md similarity index 100% rename from "Solutions/0235. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\347\232\204\346\234\200\350\277\221\345\205\254\345\205\261\347\245\226\345\205\210.md" rename to docs/solutions/0200-0299/lowest-common-ancestor-of-a-binary-search-tree.md diff --git "a/Solutions/0236. \344\272\214\345\217\211\346\240\221\347\232\204\346\234\200\350\277\221\345\205\254\345\205\261\347\245\226\345\205\210.md" b/docs/solutions/0200-0299/lowest-common-ancestor-of-a-binary-tree.md similarity index 100% rename from "Solutions/0236. \344\272\214\345\217\211\346\240\221\347\232\204\346\234\200\350\277\221\345\205\254\345\205\261\347\245\226\345\205\210.md" rename to docs/solutions/0200-0299/lowest-common-ancestor-of-a-binary-tree.md diff --git "a/Solutions/0221. \346\234\200\345\244\247\346\255\243\346\226\271\345\275\242.md" b/docs/solutions/0200-0299/maximal-square.md similarity index 100% rename from "Solutions/0221. \346\234\200\345\244\247\346\255\243\346\226\271\345\275\242.md" rename to docs/solutions/0200-0299/maximal-square.md diff --git "a/Solutions/0209. \351\225\277\345\272\246\346\234\200\345\260\217\347\232\204\345\255\220\346\225\260\347\273\204.md" b/docs/solutions/0200-0299/minimum-size-subarray-sum.md similarity index 100% rename from "Solutions/0209. \351\225\277\345\272\246\346\234\200\345\260\217\347\232\204\345\255\220\346\225\260\347\273\204.md" rename to docs/solutions/0200-0299/minimum-size-subarray-sum.md diff --git "a/Solutions/0268. \344\270\242\345\244\261\347\232\204\346\225\260\345\255\227.md" b/docs/solutions/0200-0299/missing-number.md similarity index 100% rename from "Solutions/0268. \344\270\242\345\244\261\347\232\204\346\225\260\345\255\227.md" rename to docs/solutions/0200-0299/missing-number.md diff --git "a/Solutions/0283. \347\247\273\345\212\250\351\233\266.md" b/docs/solutions/0200-0299/move-zeroes.md similarity index 100% rename from "Solutions/0283. \347\247\273\345\212\250\351\233\266.md" rename to docs/solutions/0200-0299/move-zeroes.md diff --git "a/Solutions/0292. Nim \346\270\270\346\210\217.md" b/docs/solutions/0200-0299/nim-game.md similarity index 100% rename from "Solutions/0292. Nim \346\270\270\346\210\217.md" rename to docs/solutions/0200-0299/nim-game.md diff --git "a/Solutions/0233. \346\225\260\345\255\227 1 \347\232\204\344\270\252\346\225\260.md" b/docs/solutions/0200-0299/number-of-digit-one.md similarity index 100% rename from "Solutions/0233. \346\225\260\345\255\227 1 \347\232\204\344\270\252\346\225\260.md" rename to docs/solutions/0200-0299/number-of-digit-one.md diff --git "a/Solutions/0200. \345\262\233\345\261\277\346\225\260\351\207\217.md" b/docs/solutions/0200-0299/number-of-islands.md similarity index 100% rename from "Solutions/0200. \345\262\233\345\261\277\346\225\260\351\207\217.md" rename to docs/solutions/0200-0299/number-of-islands.md diff --git "a/Solutions/0234. \345\233\236\346\226\207\351\223\276\350\241\250.md" b/docs/solutions/0200-0299/palindrome-linked-list.md similarity index 100% rename from "Solutions/0234. \345\233\236\346\226\207\351\223\276\350\241\250.md" rename to docs/solutions/0200-0299/palindrome-linked-list.md diff --git "a/Solutions/0279. \345\256\214\345\205\250\345\271\263\346\226\271\346\225\260.md" b/docs/solutions/0200-0299/perfect-squares.md similarity index 100% rename from "Solutions/0279. \345\256\214\345\205\250\345\271\263\346\226\271\346\225\260.md" rename to docs/solutions/0200-0299/perfect-squares.md diff --git "a/Solutions/0231. 2 \347\232\204\345\271\202.md" b/docs/solutions/0200-0299/power-of-two.md similarity index 100% rename from "Solutions/0231. 2 \347\232\204\345\271\202.md" rename to docs/solutions/0200-0299/power-of-two.md diff --git "a/Solutions/0238. \351\231\244\350\207\252\350\272\253\344\273\245\345\244\226\346\225\260\347\273\204\347\232\204\344\271\230\347\247\257.md" b/docs/solutions/0200-0299/product-of-array-except-self.md similarity index 100% rename from "Solutions/0238. \351\231\244\350\207\252\350\272\253\344\273\245\345\244\226\346\225\260\347\273\204\347\232\204\344\271\230\347\247\257.md" rename to docs/solutions/0200-0299/product-of-array-except-self.md diff --git "a/Solutions/0223. \347\237\251\345\275\242\351\235\242\347\247\257.md" b/docs/solutions/0200-0299/rectangle-area.md similarity index 100% rename from "Solutions/0223. \347\237\251\345\275\242\351\235\242\347\247\257.md" rename to docs/solutions/0200-0299/rectangle-area.md diff --git "a/Solutions/0203. \347\247\273\351\231\244\351\223\276\350\241\250\345\205\203\347\264\240.md" b/docs/solutions/0200-0299/remove-linked-list-elements.md similarity index 100% rename from "Solutions/0203. \347\247\273\351\231\244\351\223\276\350\241\250\345\205\203\347\264\240.md" rename to docs/solutions/0200-0299/remove-linked-list-elements.md diff --git "a/Solutions/0206. \345\217\215\350\275\254\351\223\276\350\241\250.md" b/docs/solutions/0200-0299/reverse-linked-list.md similarity index 100% rename from "Solutions/0206. \345\217\215\350\275\254\351\223\276\350\241\250.md" rename to docs/solutions/0200-0299/reverse-linked-list.md diff --git "a/Solutions/0240. \346\220\234\347\264\242\344\272\214\347\273\264\347\237\251\351\230\265 II.md" b/docs/solutions/0200-0299/search-a-2d-matrix-ii.md similarity index 100% rename from "Solutions/0240. \346\220\234\347\264\242\344\272\214\347\273\264\347\237\251\351\230\265 II.md" rename to docs/solutions/0200-0299/search-a-2d-matrix-ii.md diff --git "a/Solutions/0297. \344\272\214\345\217\211\346\240\221\347\232\204\345\272\217\345\210\227\345\214\226\344\270\216\345\217\215\345\272\217\345\210\227\345\214\226.md" b/docs/solutions/0200-0299/serialize-and-deserialize-binary-tree.md similarity index 100% rename from "Solutions/0297. \344\272\214\345\217\211\346\240\221\347\232\204\345\272\217\345\210\227\345\214\226\344\270\216\345\217\215\345\272\217\345\210\227\345\214\226.md" rename to docs/solutions/0200-0299/serialize-and-deserialize-binary-tree.md diff --git "a/Solutions/0260. \345\217\252\345\207\272\347\216\260\344\270\200\346\254\241\347\232\204\346\225\260\345\255\227 III.md" b/docs/solutions/0200-0299/single-number-iii.md similarity index 100% rename from "Solutions/0260. \345\217\252\345\207\272\347\216\260\344\270\200\346\254\241\347\232\204\346\225\260\345\255\227 III.md" rename to docs/solutions/0200-0299/single-number-iii.md diff --git "a/Solutions/0239. \346\273\221\345\212\250\347\252\227\345\217\243\346\234\200\345\244\247\345\200\274.md" b/docs/solutions/0200-0299/sliding-window-maximum.md similarity index 100% rename from "Solutions/0239. \346\273\221\345\212\250\347\252\227\345\217\243\346\234\200\345\244\247\345\200\274.md" rename to docs/solutions/0200-0299/sliding-window-maximum.md diff --git "a/Solutions/0218. \345\244\251\351\231\205\347\272\277\351\227\256\351\242\230.md" b/docs/solutions/0200-0299/the-skyline-problem.md similarity index 100% rename from "Solutions/0218. \345\244\251\351\231\205\347\272\277\351\227\256\351\242\230.md" rename to docs/solutions/0200-0299/the-skyline-problem.md diff --git "a/Solutions/0264. \344\270\221\346\225\260 II.md" b/docs/solutions/0200-0299/ugly-number-ii.md similarity index 100% rename from "Solutions/0264. \344\270\221\346\225\260 II.md" rename to docs/solutions/0200-0299/ugly-number-ii.md diff --git "a/Solutions/0263. \344\270\221\346\225\260.md" b/docs/solutions/0200-0299/ugly-number.md similarity index 100% rename from "Solutions/0263. \344\270\221\346\225\260.md" rename to docs/solutions/0200-0299/ugly-number.md diff --git "a/Solutions/0288. \345\215\225\350\257\215\347\232\204\345\224\257\344\270\200\347\274\251\345\206\231.md" b/docs/solutions/0200-0299/unique-word-abbreviation.md similarity index 100% rename from "Solutions/0288. \345\215\225\350\257\215\347\232\204\345\224\257\344\270\200\347\274\251\345\206\231.md" rename to docs/solutions/0200-0299/unique-word-abbreviation.md diff --git "a/Solutions/0242. \346\234\211\346\225\210\347\232\204\345\255\227\346\257\215\345\274\202\344\275\215\350\257\215.md" b/docs/solutions/0200-0299/valid-anagram.md similarity index 100% rename from "Solutions/0242. \346\234\211\346\225\210\347\232\204\345\255\227\346\257\215\345\274\202\344\275\215\350\257\215.md" rename to docs/solutions/0200-0299/valid-anagram.md diff --git "a/Solutions/0286. \345\242\231\344\270\216\351\227\250.md" b/docs/solutions/0200-0299/walls-and-gates.md similarity index 100% rename from "Solutions/0286. \345\242\231\344\270\216\351\227\250.md" rename to docs/solutions/0200-0299/walls-and-gates.md diff --git "a/Solutions/0290. \345\215\225\350\257\215\350\247\204\345\276\213.md" b/docs/solutions/0200-0299/word-pattern.md similarity index 100% rename from "Solutions/0290. \345\215\225\350\257\215\350\247\204\345\276\213.md" rename to docs/solutions/0200-0299/word-pattern.md diff --git "a/Solutions/0212. \345\215\225\350\257\215\346\220\234\347\264\242 II.md" b/docs/solutions/0200-0299/word-search-ii.md similarity index 100% rename from "Solutions/0212. \345\215\225\350\257\215\346\220\234\347\264\242 II.md" rename to docs/solutions/0200-0299/word-search-ii.md diff --git "a/Solutions/0351. \345\256\211\345\215\223\347\263\273\347\273\237\346\211\213\345\212\277\350\247\243\351\224\201.md" b/docs/solutions/0300-0399/android-unlock-patterns.md similarity index 97% rename from "Solutions/0351. \345\256\211\345\215\223\347\263\273\347\273\237\346\211\213\345\212\277\350\247\243\351\224\201.md" rename to docs/solutions/0300-0399/android-unlock-patterns.md index 21491f10..e29b9f99 100644 --- "a/Solutions/0351. \345\256\211\345\215\223\347\263\273\347\273\237\346\211\213\345\212\277\350\247\243\351\224\201.md" +++ b/docs/solutions/0300-0399/android-unlock-patterns.md @@ -19,8 +19,7 @@ - 解锁模式中所有点不能重复。 - 如果解锁模式中两个点是按顺序经过的，那么这两个点之间的手势轨迹不能跨过其他任何未被经过的点。 -- 一些有效和无效解锁模式示例： - - ![](https://assets.leetcode.com/uploads/2018/10/12/android-unlock.png) +- 一些有效和无效解锁模式示例：![](https://assets.leetcode.com/uploads/2018/10/12/android-unlock.png) - 无效手势：$[4,1,3,6]$，连接点 $1$ 和点 $3$ 时经过了未被连接过的 $2$ 号点。 - 无效手势：$[4,1,9,2]$，连接点 $1$ 和点 $9$ 时经过了未被连接过的 $5$ 号点。 - 有效手势：$[2,4,1,3,6]$，连接点 $1$ 和点 $3$ 是有效的，因为虽然它经过了点 $2$，但是点 $2$ 在该手势中之前已经被连过了。 diff --git "a/Solutions/0309. \346\234\200\344\275\263\344\271\260\345\215\226\350\202\241\347\245\250\346\227\266\346\234\272\345\220\253\345\206\267\345\206\273\346\234\237.md" b/docs/solutions/0300-0399/best-time-to-buy-and-sell-stock-with-cooldown.md similarity index 93% rename from "Solutions/0309. \346\234\200\344\275\263\344\271\260\345\215\226\350\202\241\347\245\250\346\227\266\346\234\272\345\220\253\345\206\267\345\206\273\346\234\237.md" rename to docs/solutions/0300-0399/best-time-to-buy-and-sell-stock-with-cooldown.md index d70a62b5..6d0c1530 100644 --- "a/Solutions/0309. \346\234\200\344\275\263\344\271\260\345\215\226\350\202\241\347\245\250\346\227\266\346\234\272\345\220\253\345\206\267\345\206\273\346\234\237.md" +++ b/docs/solutions/0300-0399/best-time-to-buy-and-sell-stock-with-cooldown.md @@ -1,11 +1,11 @@ -# [0309. 最佳买卖股票时机含冷冻期](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-cooldown/) +# [0309. 买卖股票的最佳时机含冷冻期](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-cooldown/) - 标签：数组、动态规划 - 难度：中等 ## 题目链接 -- [0309. 最佳买卖股票时机含冷冻期 - 力扣](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-cooldown/) +- [0309. 买卖股票的最佳时机含冷冻期 - 力扣](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-cooldown/) ## 题目大意 diff --git "a/Solutions/0312. \346\210\263\346\260\224\347\220\203.md" b/docs/solutions/0300-0399/burst-balloons.md similarity index 100% rename from "Solutions/0312. \346\210\263\346\260\224\347\220\203.md" rename to docs/solutions/0300-0399/burst-balloons.md diff --git "a/Solutions/0322. \351\233\266\351\222\261\345\205\221\346\215\242.md" b/docs/solutions/0300-0399/coin-change.md similarity index 100% rename from "Solutions/0322. \351\233\266\351\222\261\345\205\221\346\215\242.md" rename to docs/solutions/0300-0399/coin-change.md diff --git "a/Solutions/0377. \347\273\204\345\220\210\346\200\273\345\222\214 \342\205\243.md" b/docs/solutions/0300-0399/combination-sum-iv.md similarity index 100% rename from "Solutions/0377. \347\273\204\345\220\210\346\200\273\345\222\214 \342\205\243.md" rename to docs/solutions/0300-0399/combination-sum-iv.md diff --git "a/Solutions/0357. \347\273\237\350\256\241\345\220\204\344\275\215\346\225\260\345\255\227\351\203\275\344\270\215\345\220\214\347\232\204\346\225\260\345\255\227\344\270\252\346\225\260.md" b/docs/solutions/0300-0399/count-numbers-with-unique-digits.md similarity index 100% rename from "Solutions/0357. \347\273\237\350\256\241\345\220\204\344\275\215\346\225\260\345\255\227\351\203\275\344\270\215\345\220\214\347\232\204\346\225\260\345\255\227\344\270\252\346\225\260.md" rename to docs/solutions/0300-0399/count-numbers-with-unique-digits.md diff --git "a/Solutions/0315. \350\256\241\347\256\227\345\217\263\344\276\247\345\260\217\344\272\216\345\275\223\345\211\215\345\205\203\347\264\240\347\232\204\344\270\252\346\225\260.md" b/docs/solutions/0300-0399/count-of-smaller-numbers-after-self.md similarity index 100% rename from "Solutions/0315. \350\256\241\347\256\227\345\217\263\344\276\247\345\260\217\344\272\216\345\275\223\345\211\215\345\205\203\347\264\240\347\232\204\344\270\252\346\225\260.md" rename to docs/solutions/0300-0399/count-of-smaller-numbers-after-self.md diff --git "a/Solutions/0338. \346\257\224\347\211\271\344\275\215\350\256\241\346\225\260.md" b/docs/solutions/0300-0399/counting-bits.md similarity index 100% rename from "Solutions/0338. \346\257\224\347\211\271\344\275\215\350\256\241\346\225\260.md" rename to docs/solutions/0300-0399/counting-bits.md diff --git "a/Solutions/0394. \345\255\227\347\254\246\344\270\262\350\247\243\347\240\201.md" b/docs/solutions/0300-0399/decode-string.md similarity index 100% rename from "Solutions/0394. \345\255\227\347\254\246\344\270\262\350\247\243\347\240\201.md" rename to docs/solutions/0300-0399/decode-string.md diff --git "a/Solutions/0399. \351\231\244\346\263\225\346\261\202\345\200\274.md" b/docs/solutions/0300-0399/evaluate-division.md similarity index 100% rename from "Solutions/0399. \351\231\244\346\263\225\346\261\202\345\200\274.md" rename to docs/solutions/0300-0399/evaluate-division.md diff --git "a/Solutions/0389. \346\211\276\344\270\215\345\220\214.md" b/docs/solutions/0300-0399/find-the-difference.md similarity index 100% rename from "Solutions/0389. \346\211\276\344\270\215\345\220\214.md" rename to docs/solutions/0300-0399/find-the-difference.md diff --git "a/Solutions/0387. \345\255\227\347\254\246\344\270\262\344\270\255\347\232\204\347\254\254\344\270\200\344\270\252\345\224\257\344\270\200\345\255\227\347\254\246.md" b/docs/solutions/0300-0399/first-unique-character-in-a-string.md similarity index 100% rename from "Solutions/0387. \345\255\227\347\254\246\344\270\262\344\270\255\347\232\204\347\254\254\344\270\200\344\270\252\345\224\257\344\270\200\345\255\227\347\254\246.md" rename to docs/solutions/0300-0399/first-unique-character-in-a-string.md diff --git "a/Solutions/0341. \346\211\201\345\271\263\345\214\226\345\265\214\345\245\227\345\210\227\350\241\250\350\277\255\344\273\243\345\231\250.md" b/docs/solutions/0300-0399/flatten-nested-list-iterator.md similarity index 100% rename from "Solutions/0341. \346\211\201\345\271\263\345\214\226\345\265\214\345\245\227\345\210\227\350\241\250\350\277\255\344\273\243\345\231\250.md" rename to docs/solutions/0300-0399/flatten-nested-list-iterator.md diff --git "a/Solutions/0375. \347\214\234\346\225\260\345\255\227\345\244\247\345\260\217 II.md" b/docs/solutions/0300-0399/guess-number-higher-or-lower-ii.md similarity index 100% rename from "Solutions/0375. \347\214\234\346\225\260\345\255\227\345\244\247\345\260\217 II.md" rename to docs/solutions/0300-0399/guess-number-higher-or-lower-ii.md diff --git "a/Solutions/0374. \347\214\234\346\225\260\345\255\227\345\244\247\345\260\217.md" b/docs/solutions/0300-0399/guess-number-higher-or-lower.md similarity index 100% rename from "Solutions/0374. \347\214\234\346\225\260\345\255\227\345\244\247\345\260\217.md" rename to docs/solutions/0300-0399/guess-number-higher-or-lower.md diff --git "a/Solutions/0337. \346\211\223\345\256\266\345\212\253\350\210\215 III.md" b/docs/solutions/0300-0399/house-robber-iii.md similarity index 100% rename from "Solutions/0337. \346\211\223\345\256\266\345\212\253\350\210\215 III.md" rename to docs/solutions/0300-0399/house-robber-iii.md diff --git "a/Solutions/0334. \351\200\222\345\242\236\347\232\204\344\270\211\345\205\203\345\255\220\345\272\217\345\210\227.md" b/docs/solutions/0300-0399/increasing-triplet-subsequence.md similarity index 100% rename from "Solutions/0334. \351\200\222\345\242\236\347\232\204\344\270\211\345\205\203\345\255\220\345\272\217\345\210\227.md" rename to docs/solutions/0300-0399/increasing-triplet-subsequence.md diff --git a/docs/solutions/0300-0399/index.md b/docs/solutions/0300-0399/index.md new file mode 100644 index 00000000..6bd837d2 --- /dev/null +++ b/docs/solutions/0300-0399/index.md @@ -0,0 +1,56 @@ +## 本章内容 + +- [0300. 最长递增子序列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/longest-increasing-subsequence.md) +- [0303. 区域和检索 - 数组不可变](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/range-sum-query-immutable.md) +- [0304. 二维区域和检索 - 矩阵不可变](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/range-sum-query-2d-immutable.md) +- [0307. 区域和检索 - 数组可修改](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/range-sum-query-mutable.md) +- [0309. 买卖股票的最佳时机含冷冻期](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/best-time-to-buy-and-sell-stock-with-cooldown.md) +- [0310. 最小高度树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/minimum-height-trees.md) +- [0312. 戳气球](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/burst-balloons.md) +- [0315. 计算右侧小于当前元素的个数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/count-of-smaller-numbers-after-self.md) +- [0316. 去除重复字母](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/remove-duplicate-letters.md) +- [0318. 最大单词长度乘积](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/maximum-product-of-word-lengths.md) +- [0322. 零钱兑换](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/coin-change.md) +- [0323. 无向图中连通分量的数目](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/number-of-connected-components-in-an-undirected-graph.md) +- [0324. 摆动排序 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/wiggle-sort-ii.md) +- [0326. 3 的幂](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/power-of-three.md) +- [0328. 奇偶链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/odd-even-linked-list.md) +- [0329. 矩阵中的最长递增路径](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/longest-increasing-path-in-a-matrix.md) +- [0334. 递增的三元子序列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/increasing-triplet-subsequence.md) +- [0336. 回文对](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/palindrome-pairs.md) +- [0337. 打家劫舍 III](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/house-robber-iii.md) +- [0338. 比特位计数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/counting-bits.md) +- [0340. 至多包含 K 个不同字符的最长子串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/longest-substring-with-at-most-k-distinct-characters.md) +- [0341. 扁平化嵌套列表迭代器](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/flatten-nested-list-iterator.md) +- [0342. 4的幂](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/power-of-four.md) +- [0343. 整数拆分](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/integer-break.md) +- [0344. 反转字符串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/reverse-string.md) +- [0345. 反转字符串中的元音字母](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/reverse-vowels-of-a-string.md) +- [0346. 数据流中的移动平均值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/moving-average-from-data-stream.md) +- [0347. 前 K 个高频元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/top-k-frequent-elements.md) +- [0349. 两个数组的交集](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/intersection-of-two-arrays.md) +- [0350. 两个数组的交集 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/intersection-of-two-arrays-ii.md) +- [0351. 安卓系统手势解锁](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/android-unlock-patterns.md) +- [0354. 俄罗斯套娃信封问题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/russian-doll-envelopes.md) +- [0357. 统计各位数字都不同的数字个数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/count-numbers-with-unique-digits.md) +- [0359. 日志速率限制器](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/logger-rate-limiter.md) +- [0360. 有序转化数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/sort-transformed-array.md) +- [0367. 有效的完全平方数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/valid-perfect-square.md) +- [0370. 区间加法](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/range-addition.md) +- [0371. 两整数之和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/sum-of-two-integers.md) +- [0374. 猜数字大小](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/guess-number-higher-or-lower.md) +- [0375. 猜数字大小 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/guess-number-higher-or-lower-ii.md) +- [0376. 摆动序列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/wiggle-subsequence.md) +- [0377. 组合总和 Ⅳ](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/combination-sum-iv.md) +- [0378. 有序矩阵中第 K 小的元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/kth-smallest-element-in-a-sorted-matrix.md) +- [0380. O(1) 时间插入、删除和获取随机元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/insert-delete-getrandom-o1.md) +- [0383. 赎金信](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/ransom-note.md) +- [0384. 打乱数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/shuffle-an-array.md) +- [0386. 字典序排数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/lexicographical-numbers.md) +- [0387. 字符串中的第一个唯一字符](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/first-unique-character-in-a-string.md) +- [0389. 找不同](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/find-the-difference.md) +- [0391. 完美矩形](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/perfect-rectangle.md) +- [0392. 判断子序列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/is-subsequence.md) +- [0394. 字符串解码](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/decode-string.md) +- [0395. 至少有 K 个重复字符的最长子串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/longest-substring-with-at-least-k-repeating-characters.md) +- [0399. 除法求值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/evaluate-division.md) diff --git "a/Solutions/0380. O(1) \346\227\266\351\227\264\346\217\222\345\205\245\343\200\201\345\210\240\351\231\244\345\222\214\350\216\267\345\217\226\351\232\217\346\234\272\345\205\203\347\264\240.md" b/docs/solutions/0300-0399/insert-delete-getrandom-o1.md similarity index 100% rename from "Solutions/0380. O(1) \346\227\266\351\227\264\346\217\222\345\205\245\343\200\201\345\210\240\351\231\244\345\222\214\350\216\267\345\217\226\351\232\217\346\234\272\345\205\203\347\264\240.md" rename to docs/solutions/0300-0399/insert-delete-getrandom-o1.md diff --git "a/Solutions/0343. \346\225\264\346\225\260\346\213\206\345\210\206.md" b/docs/solutions/0300-0399/integer-break.md similarity index 100% rename from "Solutions/0343. \346\225\264\346\225\260\346\213\206\345\210\206.md" rename to docs/solutions/0300-0399/integer-break.md diff --git "a/Solutions/0350. \344\270\244\344\270\252\346\225\260\347\273\204\347\232\204\344\272\244\351\233\206 II.md" b/docs/solutions/0300-0399/intersection-of-two-arrays-ii.md similarity index 100% rename from "Solutions/0350. \344\270\244\344\270\252\346\225\260\347\273\204\347\232\204\344\272\244\351\233\206 II.md" rename to docs/solutions/0300-0399/intersection-of-two-arrays-ii.md diff --git "a/Solutions/0349. \344\270\244\344\270\252\346\225\260\347\273\204\347\232\204\344\272\244\351\233\206.md" b/docs/solutions/0300-0399/intersection-of-two-arrays.md similarity index 100% rename from "Solutions/0349. \344\270\244\344\270\252\346\225\260\347\273\204\347\232\204\344\272\244\351\233\206.md" rename to docs/solutions/0300-0399/intersection-of-two-arrays.md diff --git "a/Solutions/0392. \345\210\244\346\226\255\345\255\220\345\272\217\345\210\227.md" b/docs/solutions/0300-0399/is-subsequence.md similarity index 100% rename from "Solutions/0392. \345\210\244\346\226\255\345\255\220\345\272\217\345\210\227.md" rename to docs/solutions/0300-0399/is-subsequence.md diff --git "a/Solutions/0378. \346\234\211\345\272\217\347\237\251\351\230\265\344\270\255\347\254\254 K \345\260\217\347\232\204\345\205\203\347\264\240.md" b/docs/solutions/0300-0399/kth-smallest-element-in-a-sorted-matrix.md similarity index 100% rename from "Solutions/0378. \346\234\211\345\272\217\347\237\251\351\230\265\344\270\255\347\254\254 K \345\260\217\347\232\204\345\205\203\347\264\240.md" rename to docs/solutions/0300-0399/kth-smallest-element-in-a-sorted-matrix.md diff --git "a/Solutions/0386. \345\255\227\345\205\270\345\272\217\346\216\222\346\225\260.md" b/docs/solutions/0300-0399/lexicographical-numbers.md similarity index 100% rename from "Solutions/0386. \345\255\227\345\205\270\345\272\217\346\216\222\346\225\260.md" rename to docs/solutions/0300-0399/lexicographical-numbers.md diff --git "a/Solutions/0359. \346\227\245\345\277\227\351\200\237\347\216\207\351\231\220\345\210\266\345\231\250.md" b/docs/solutions/0300-0399/logger-rate-limiter.md similarity index 100% rename from "Solutions/0359. \346\227\245\345\277\227\351\200\237\347\216\207\351\231\220\345\210\266\345\231\250.md" rename to docs/solutions/0300-0399/logger-rate-limiter.md diff --git "a/Solutions/0329. \347\237\251\351\230\265\344\270\255\347\232\204\346\234\200\351\225\277\351\200\222\345\242\236\350\267\257\345\276\204.md" b/docs/solutions/0300-0399/longest-increasing-path-in-a-matrix.md similarity index 100% rename from "Solutions/0329. \347\237\251\351\230\265\344\270\255\347\232\204\346\234\200\351\225\277\351\200\222\345\242\236\350\267\257\345\276\204.md" rename to docs/solutions/0300-0399/longest-increasing-path-in-a-matrix.md diff --git "a/Solutions/0300. \346\234\200\351\225\277\351\200\222\345\242\236\345\255\220\345\272\217\345\210\227.md" b/docs/solutions/0300-0399/longest-increasing-subsequence.md similarity index 100% rename from "Solutions/0300. \346\234\200\351\225\277\351\200\222\345\242\236\345\255\220\345\272\217\345\210\227.md" rename to docs/solutions/0300-0399/longest-increasing-subsequence.md diff --git "a/Solutions/0395. \350\207\263\345\260\221\346\234\211 K \344\270\252\351\207\215\345\244\215\345\255\227\347\254\246\347\232\204\346\234\200\351\225\277\345\255\220\344\270\262.md" b/docs/solutions/0300-0399/longest-substring-with-at-least-k-repeating-characters.md similarity index 100% rename from "Solutions/0395. \350\207\263\345\260\221\346\234\211 K \344\270\252\351\207\215\345\244\215\345\255\227\347\254\246\347\232\204\346\234\200\351\225\277\345\255\220\344\270\262.md" rename to docs/solutions/0300-0399/longest-substring-with-at-least-k-repeating-characters.md diff --git "a/Solutions/0340. \350\207\263\345\244\232\345\214\205\345\220\253 K \344\270\252\344\270\215\345\220\214\345\255\227\347\254\246\347\232\204\346\234\200\351\225\277\345\255\220\344\270\262.md" b/docs/solutions/0300-0399/longest-substring-with-at-most-k-distinct-characters.md similarity index 100% rename from "Solutions/0340. \350\207\263\345\244\232\345\214\205\345\220\253 K \344\270\252\344\270\215\345\220\214\345\255\227\347\254\246\347\232\204\346\234\200\351\225\277\345\255\220\344\270\262.md" rename to docs/solutions/0300-0399/longest-substring-with-at-most-k-distinct-characters.md diff --git "a/Solutions/0318. \346\234\200\345\244\247\345\215\225\350\257\215\351\225\277\345\272\246\344\271\230\347\247\257.md" b/docs/solutions/0300-0399/maximum-product-of-word-lengths.md similarity index 100% rename from "Solutions/0318. \346\234\200\345\244\247\345\215\225\350\257\215\351\225\277\345\272\246\344\271\230\347\247\257.md" rename to docs/solutions/0300-0399/maximum-product-of-word-lengths.md diff --git "a/Solutions/0310. \346\234\200\345\260\217\351\253\230\345\272\246\346\240\221.md" b/docs/solutions/0300-0399/minimum-height-trees.md similarity index 100% rename from "Solutions/0310. \346\234\200\345\260\217\351\253\230\345\272\246\346\240\221.md" rename to docs/solutions/0300-0399/minimum-height-trees.md diff --git "a/Solutions/0346. \346\225\260\346\215\256\346\265\201\344\270\255\347\232\204\347\247\273\345\212\250\345\271\263\345\235\207\345\200\274.md" b/docs/solutions/0300-0399/moving-average-from-data-stream.md similarity index 100% rename from "Solutions/0346. \346\225\260\346\215\256\346\265\201\344\270\255\347\232\204\347\247\273\345\212\250\345\271\263\345\235\207\345\200\274.md" rename to docs/solutions/0300-0399/moving-average-from-data-stream.md diff --git "a/Solutions/0323. \346\227\240\345\220\221\345\233\276\344\270\255\350\277\236\351\200\232\345\210\206\351\207\217\347\232\204\346\225\260\347\233\256.md" b/docs/solutions/0300-0399/number-of-connected-components-in-an-undirected-graph.md similarity index 100% rename from "Solutions/0323. \346\227\240\345\220\221\345\233\276\344\270\255\350\277\236\351\200\232\345\210\206\351\207\217\347\232\204\346\225\260\347\233\256.md" rename to docs/solutions/0300-0399/number-of-connected-components-in-an-undirected-graph.md diff --git "a/Solutions/0328. \345\245\207\345\201\266\351\223\276\350\241\250.md" b/docs/solutions/0300-0399/odd-even-linked-list.md similarity index 100% rename from "Solutions/0328. \345\245\207\345\201\266\351\223\276\350\241\250.md" rename to docs/solutions/0300-0399/odd-even-linked-list.md diff --git "a/Solutions/0336. \345\233\236\346\226\207\345\257\271.md" b/docs/solutions/0300-0399/palindrome-pairs.md similarity index 100% rename from "Solutions/0336. \345\233\236\346\226\207\345\257\271.md" rename to docs/solutions/0300-0399/palindrome-pairs.md diff --git "a/Solutions/0391. \345\256\214\347\276\216\347\237\251\345\275\242.md" b/docs/solutions/0300-0399/perfect-rectangle.md similarity index 100% rename from "Solutions/0391. \345\256\214\347\276\216\347\237\251\345\275\242.md" rename to docs/solutions/0300-0399/perfect-rectangle.md diff --git "a/Solutions/0342. 4\347\232\204\345\271\202.md" b/docs/solutions/0300-0399/power-of-four.md similarity index 100% rename from "Solutions/0342. 4\347\232\204\345\271\202.md" rename to docs/solutions/0300-0399/power-of-four.md diff --git "a/Solutions/0326. 3 \347\232\204\345\271\202.md" b/docs/solutions/0300-0399/power-of-three.md similarity index 100% rename from "Solutions/0326. 3 \347\232\204\345\271\202.md" rename to docs/solutions/0300-0399/power-of-three.md diff --git "a/Solutions/0370. \345\214\272\351\227\264\345\212\240\346\263\225.md" b/docs/solutions/0300-0399/range-addition.md similarity index 100% rename from "Solutions/0370. \345\214\272\351\227\264\345\212\240\346\263\225.md" rename to docs/solutions/0300-0399/range-addition.md diff --git "a/Solutions/0304. \344\272\214\347\273\264\345\214\272\345\237\237\345\222\214\346\243\200\347\264\242 - \347\237\251\351\230\265\344\270\215\345\217\257\345\217\230.md" b/docs/solutions/0300-0399/range-sum-query-2d-immutable.md similarity index 100% rename from "Solutions/0304. \344\272\214\347\273\264\345\214\272\345\237\237\345\222\214\346\243\200\347\264\242 - \347\237\251\351\230\265\344\270\215\345\217\257\345\217\230.md" rename to docs/solutions/0300-0399/range-sum-query-2d-immutable.md diff --git "a/Solutions/0303. \345\214\272\345\237\237\345\222\214\346\243\200\347\264\242 - \346\225\260\347\273\204\344\270\215\345\217\257\345\217\230.md" b/docs/solutions/0300-0399/range-sum-query-immutable.md similarity index 100% rename from "Solutions/0303. \345\214\272\345\237\237\345\222\214\346\243\200\347\264\242 - \346\225\260\347\273\204\344\270\215\345\217\257\345\217\230.md" rename to docs/solutions/0300-0399/range-sum-query-immutable.md diff --git "a/Solutions/0307. \345\214\272\345\237\237\345\222\214\346\243\200\347\264\242 - \346\225\260\347\273\204\345\217\257\344\277\256\346\224\271.md" b/docs/solutions/0300-0399/range-sum-query-mutable.md similarity index 100% rename from "Solutions/0307. \345\214\272\345\237\237\345\222\214\346\243\200\347\264\242 - \346\225\260\347\273\204\345\217\257\344\277\256\346\224\271.md" rename to docs/solutions/0300-0399/range-sum-query-mutable.md diff --git "a/Solutions/0383. \350\265\216\351\207\221\344\277\241.md" b/docs/solutions/0300-0399/ransom-note.md similarity index 100% rename from "Solutions/0383. \350\265\216\351\207\221\344\277\241.md" rename to docs/solutions/0300-0399/ransom-note.md diff --git "a/Solutions/0316. \345\216\273\351\231\244\351\207\215\345\244\215\345\255\227\346\257\215.md" b/docs/solutions/0300-0399/remove-duplicate-letters.md similarity index 100% rename from "Solutions/0316. \345\216\273\351\231\244\351\207\215\345\244\215\345\255\227\346\257\215.md" rename to docs/solutions/0300-0399/remove-duplicate-letters.md diff --git "a/Solutions/0344. \345\217\215\350\275\254\345\255\227\347\254\246\344\270\262.md" b/docs/solutions/0300-0399/reverse-string.md similarity index 100% rename from "Solutions/0344. \345\217\215\350\275\254\345\255\227\347\254\246\344\270\262.md" rename to docs/solutions/0300-0399/reverse-string.md diff --git "a/Solutions/0345. \345\217\215\350\275\254\345\255\227\347\254\246\344\270\262\344\270\255\347\232\204\345\205\203\351\237\263\345\255\227\346\257\215.md" b/docs/solutions/0300-0399/reverse-vowels-of-a-string.md similarity index 100% rename from "Solutions/0345. \345\217\215\350\275\254\345\255\227\347\254\246\344\270\262\344\270\255\347\232\204\345\205\203\351\237\263\345\255\227\346\257\215.md" rename to docs/solutions/0300-0399/reverse-vowels-of-a-string.md diff --git "a/Solutions/0354. \344\277\204\347\275\227\346\226\257\345\245\227\345\250\203\344\277\241\345\260\201\351\227\256\351\242\230.md" b/docs/solutions/0300-0399/russian-doll-envelopes.md similarity index 100% rename from "Solutions/0354. \344\277\204\347\275\227\346\226\257\345\245\227\345\250\203\344\277\241\345\260\201\351\227\256\351\242\230.md" rename to docs/solutions/0300-0399/russian-doll-envelopes.md diff --git "a/Solutions/0384. \346\211\223\344\271\261\346\225\260\347\273\204.md" b/docs/solutions/0300-0399/shuffle-an-array.md similarity index 100% rename from "Solutions/0384. \346\211\223\344\271\261\346\225\260\347\273\204.md" rename to docs/solutions/0300-0399/shuffle-an-array.md diff --git "a/Solutions/0360. \346\234\211\345\272\217\350\275\254\345\214\226\346\225\260\347\273\204.md" b/docs/solutions/0300-0399/sort-transformed-array.md similarity index 100% rename from "Solutions/0360. \346\234\211\345\272\217\350\275\254\345\214\226\346\225\260\347\273\204.md" rename to docs/solutions/0300-0399/sort-transformed-array.md diff --git "a/Solutions/0371. \344\270\244\346\225\264\346\225\260\344\271\213\345\222\214.md" b/docs/solutions/0300-0399/sum-of-two-integers.md similarity index 100% rename from "Solutions/0371. \344\270\244\346\225\264\346\225\260\344\271\213\345\222\214.md" rename to docs/solutions/0300-0399/sum-of-two-integers.md diff --git "a/Solutions/0347. \345\211\215 K \344\270\252\351\253\230\351\242\221\345\205\203\347\264\240.md" b/docs/solutions/0300-0399/top-k-frequent-elements.md similarity index 100% rename from "Solutions/0347. \345\211\215 K \344\270\252\351\253\230\351\242\221\345\205\203\347\264\240.md" rename to docs/solutions/0300-0399/top-k-frequent-elements.md diff --git "a/Solutions/0367. \346\234\211\346\225\210\347\232\204\345\256\214\345\205\250\345\271\263\346\226\271\346\225\260.md" b/docs/solutions/0300-0399/valid-perfect-square.md similarity index 100% rename from "Solutions/0367. \346\234\211\346\225\210\347\232\204\345\256\214\345\205\250\345\271\263\346\226\271\346\225\260.md" rename to docs/solutions/0300-0399/valid-perfect-square.md diff --git "a/Solutions/0324. \346\221\206\345\212\250\346\216\222\345\272\217 II.md" b/docs/solutions/0300-0399/wiggle-sort-ii.md similarity index 100% rename from "Solutions/0324. \346\221\206\345\212\250\346\216\222\345\272\217 II.md" rename to docs/solutions/0300-0399/wiggle-sort-ii.md diff --git "a/Solutions/0376. \346\221\206\345\212\250\345\272\217\345\210\227.md" b/docs/solutions/0300-0399/wiggle-subsequence.md similarity index 100% rename from "Solutions/0376. \346\221\206\345\212\250\345\272\217\345\210\227.md" rename to docs/solutions/0300-0399/wiggle-subsequence.md diff --git "a/Solutions/0454. \345\233\233\346\225\260\347\233\270\345\212\240 II.md" b/docs/solutions/0400-0499/4sum-ii.md similarity index 100% rename from "Solutions/0454. \345\233\233\346\225\260\347\233\270\345\212\240 II.md" rename to docs/solutions/0400-0499/4sum-ii.md diff --git "a/Solutions/0415. \345\255\227\347\254\246\344\270\262\347\233\270\345\212\240.md" b/docs/solutions/0400-0499/add-strings.md similarity index 100% rename from "Solutions/0415. \345\255\227\347\254\246\344\270\262\347\233\270\345\212\240.md" rename to docs/solutions/0400-0499/add-strings.md diff --git "a/Solutions/0445. \344\270\244\346\225\260\347\233\270\345\212\240 II.md" b/docs/solutions/0400-0499/add-two-numbers-ii.md similarity index 100% rename from "Solutions/0445. \344\270\244\346\225\260\347\233\270\345\212\240 II.md" rename to docs/solutions/0400-0499/add-two-numbers-ii.md diff --git "a/Solutions/0455. \345\210\206\345\217\221\351\245\274\345\271\262.md" b/docs/solutions/0400-0499/assign-cookies.md similarity index 100% rename from "Solutions/0455. \345\210\206\345\217\221\351\245\274\345\271\262.md" rename to docs/solutions/0400-0499/assign-cookies.md diff --git "a/Solutions/0464. \346\210\221\350\203\275\350\265\242\345\220\227.md" b/docs/solutions/0400-0499/can-i-win.md similarity index 100% rename from "Solutions/0464. \346\210\221\350\203\275\350\265\242\345\220\227.md" rename to docs/solutions/0400-0499/can-i-win.md diff --git "a/Solutions/0405. \346\225\260\345\255\227\350\275\254\346\215\242\344\270\272\345\215\201\345\205\255\350\277\233\345\210\266\346\225\260.md" b/docs/solutions/0400-0499/convert-a-number-to-hexadecimal.md similarity index 100% rename from "Solutions/0405. \346\225\260\345\255\227\350\275\254\346\215\242\344\270\272\345\215\201\345\205\255\350\277\233\345\210\266\346\225\260.md" rename to docs/solutions/0400-0499/convert-a-number-to-hexadecimal.md diff --git "a/Solutions/0426. \345\260\206\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\350\275\254\345\214\226\344\270\272\346\216\222\345\272\217\347\232\204\345\217\214\345\220\221\351\223\276\350\241\250.md" b/docs/solutions/0400-0499/convert-binary-search-tree-to-sorted-doubly-linked-list.md similarity index 100% rename from "Solutions/0426. \345\260\206\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\350\275\254\345\214\226\344\270\272\346\216\222\345\272\217\347\232\204\345\217\214\345\220\221\351\223\276\350\241\250.md" rename to docs/solutions/0400-0499/convert-binary-search-tree-to-sorted-doubly-linked-list.md diff --git "a/Solutions/0450. \345\210\240\351\231\244\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\344\270\255\347\232\204\350\212\202\347\202\271.md" b/docs/solutions/0400-0499/delete-node-in-a-bst.md similarity index 100% rename from "Solutions/0450. \345\210\240\351\231\244\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\344\270\255\347\232\204\350\212\202\347\202\271.md" rename to docs/solutions/0400-0499/delete-node-in-a-bst.md diff --git "a/Solutions/0498. \345\257\271\350\247\222\347\272\277\351\201\215\345\216\206.md" b/docs/solutions/0400-0499/diagonal-traverse.md similarity index 100% rename from "Solutions/0498. \345\257\271\350\247\222\347\272\277\351\201\215\345\216\206.md" rename to docs/solutions/0400-0499/diagonal-traverse.md diff --git "a/Solutions/0438. \346\211\276\345\210\260\345\255\227\347\254\246\344\270\262\344\270\255\346\211\200\346\234\211\345\255\227\346\257\215\345\274\202\344\275\215\350\257\215.md" b/docs/solutions/0400-0499/find-all-anagrams-in-a-string.md similarity index 100% rename from "Solutions/0438. \346\211\276\345\210\260\345\255\227\347\254\246\344\270\262\344\270\255\346\211\200\346\234\211\345\255\227\346\257\215\345\274\202\344\275\215\350\257\215.md" rename to docs/solutions/0400-0499/find-all-anagrams-in-a-string.md diff --git a/Solutions/0412. Fizz Buzz.md b/docs/solutions/0400-0499/fizz-buzz.md similarity index 100% rename from Solutions/0412. Fizz Buzz.md rename to docs/solutions/0400-0499/fizz-buzz.md diff --git "a/Solutions/0430. \346\211\201\345\271\263\345\214\226\345\244\232\347\272\247\345\217\214\345\220\221\351\223\276\350\241\250.md" b/docs/solutions/0400-0499/flatten-a-multilevel-doubly-linked-list.md similarity index 100% rename from "Solutions/0430. \346\211\201\345\271\263\345\214\226\345\244\232\347\272\247\345\217\214\345\220\221\351\223\276\350\241\250.md" rename to docs/solutions/0400-0499/flatten-a-multilevel-doubly-linked-list.md diff --git "a/Solutions/0403. \351\235\222\350\233\231\350\277\207\346\262\263.md" b/docs/solutions/0400-0499/frog-jump.md similarity index 100% rename from "Solutions/0403. \351\235\222\350\233\231\350\277\207\346\262\263.md" rename to docs/solutions/0400-0499/frog-jump.md diff --git "a/Solutions/0461. \346\261\211\346\230\216\350\267\235\347\246\273.md" b/docs/solutions/0400-0499/hamming-distance.md similarity index 100% rename from "Solutions/0461. \346\261\211\346\230\216\350\267\235\347\246\273.md" rename to docs/solutions/0400-0499/hamming-distance.md diff --git a/docs/solutions/0400-0499/index.md b/docs/solutions/0400-0499/index.md new file mode 100644 index 00000000..8b26bf6f --- /dev/null +++ b/docs/solutions/0400-0499/index.md @@ -0,0 +1,47 @@ +## 本章内容 + +- [0400. 第 N 位数字](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/nth-digit.md) +- [0403. 青蛙过河](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/frog-jump.md) +- [0404. 左叶子之和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/sum-of-left-leaves.md) +- [0405. 数字转换为十六进制数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/convert-a-number-to-hexadecimal.md) +- [0406. 根据身高重建队列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/queue-reconstruction-by-height.md) +- [0409. 最长回文串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/longest-palindrome.md) +- [0410. 分割数组的最大值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/split-array-largest-sum.md) +- [0412. Fizz Buzz](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/fizz-buzz.md) +- [0415. 字符串相加](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/add-strings.md) +- [0416. 分割等和子集](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/partition-equal-subset-sum.md) +- [0417. 太平洋大西洋水流问题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/pacific-atlantic-water-flow.md) +- [0421. 数组中两个数的最大异或值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/maximum-xor-of-two-numbers-in-an-array.md) +- [0424. 替换后的最长重复字符](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/longest-repeating-character-replacement.md) +- [0425. 单词方块](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/word-squares.md) +- [0426. 将二叉搜索树转化为排序的双向链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/convert-binary-search-tree-to-sorted-doubly-linked-list.md) +- [0428. 序列化和反序列化 N 叉树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/serialize-and-deserialize-n-ary-tree.md) +- [0429. N 叉树的层序遍历](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/n-ary-tree-level-order-traversal.md) +- [0430. 扁平化多级双向链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/flatten-a-multilevel-doubly-linked-list.md) +- [0435. 无重叠区间](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/non-overlapping-intervals.md) +- [0437. 路径总和 III](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/path-sum-iii.md) +- [0438. 找到字符串中所有字母异位词](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/find-all-anagrams-in-a-string.md) +- [0443. 压缩字符串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/string-compression.md) +- [0445. 两数相加 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/add-two-numbers-ii.md) +- [0447. 回旋镖的数量](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/number-of-boomerangs.md) +- [0450. 删除二叉搜索树中的节点](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/delete-node-in-a-bst.md) +- [0451. 根据字符出现频率排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/sort-characters-by-frequency.md) +- [0452. 用最少数量的箭引爆气球](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/minimum-number-of-arrows-to-burst-balloons.md) +- [0454. 四数相加 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/4sum-ii.md) +- [0455. 分发饼干](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/assign-cookies.md) +- [0459. 重复的子字符串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/repeated-substring-pattern.md) +- [0461. 汉明距离](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/hamming-distance.md) +- [0463. 岛屿的周长](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/island-perimeter.md) +- [0464. 我能赢吗](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/can-i-win.md) +- [0467. 环绕字符串中唯一的子字符串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/unique-substrings-in-wraparound-string.md) +- [0468. 验证IP地址](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/validate-ip-address.md) +- [0473. 火柴拼正方形](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/matchsticks-to-square.md) +- [0474. 一和零](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/ones-and-zeroes.md) +- [0480. 滑动窗口中位数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/sliding-window-median.md) +- [0485. 最大连续 1 的个数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/max-consecutive-ones.md) +- [0486. 预测赢家](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/predict-the-winner.md) +- [0487. 最大连续1的个数 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/max-consecutive-ones-ii.md) +- [0491. 非递减子序列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/non-decreasing-subsequences.md) +- [0494. 目标和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/target-sum.md) +- [0496. 下一个更大元素 I](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/next-greater-element-i.md) +- [0498. 对角线遍历](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/diagonal-traverse.md) diff --git "a/Solutions/0463. \345\262\233\345\261\277\347\232\204\345\221\250\351\225\277.md" b/docs/solutions/0400-0499/island-perimeter.md similarity index 100% rename from "Solutions/0463. \345\262\233\345\261\277\347\232\204\345\221\250\351\225\277.md" rename to docs/solutions/0400-0499/island-perimeter.md diff --git "a/Solutions/0409. \346\234\200\351\225\277\345\233\236\346\226\207\344\270\262.md" b/docs/solutions/0400-0499/longest-palindrome.md similarity index 100% rename from "Solutions/0409. \346\234\200\351\225\277\345\233\236\346\226\207\344\270\262.md" rename to docs/solutions/0400-0499/longest-palindrome.md diff --git "a/Solutions/0424. \346\233\277\346\215\242\345\220\216\347\232\204\346\234\200\351\225\277\351\207\215\345\244\215\345\255\227\347\254\246.md" b/docs/solutions/0400-0499/longest-repeating-character-replacement.md similarity index 100% rename from "Solutions/0424. \346\233\277\346\215\242\345\220\216\347\232\204\346\234\200\351\225\277\351\207\215\345\244\215\345\255\227\347\254\246.md" rename to docs/solutions/0400-0499/longest-repeating-character-replacement.md diff --git "a/Solutions/0473. \347\201\253\346\237\264\346\213\274\346\255\243\346\226\271\345\275\242.md" b/docs/solutions/0400-0499/matchsticks-to-square.md similarity index 100% rename from "Solutions/0473. \347\201\253\346\237\264\346\213\274\346\255\243\346\226\271\345\275\242.md" rename to docs/solutions/0400-0499/matchsticks-to-square.md diff --git "a/Solutions/0487. \346\234\200\345\244\247\350\277\236\347\273\2551\347\232\204\344\270\252\346\225\260 II.md" b/docs/solutions/0400-0499/max-consecutive-ones-ii.md similarity index 100% rename from "Solutions/0487. \346\234\200\345\244\247\350\277\236\347\273\2551\347\232\204\344\270\252\346\225\260 II.md" rename to docs/solutions/0400-0499/max-consecutive-ones-ii.md diff --git "a/Solutions/0485. \346\234\200\345\244\247\350\277\236\347\273\255 1 \347\232\204\344\270\252\346\225\260.md" b/docs/solutions/0400-0499/max-consecutive-ones.md similarity index 100% rename from "Solutions/0485. \346\234\200\345\244\247\350\277\236\347\273\255 1 \347\232\204\344\270\252\346\225\260.md" rename to docs/solutions/0400-0499/max-consecutive-ones.md diff --git "a/Solutions/0421. \346\225\260\347\273\204\344\270\255\344\270\244\344\270\252\346\225\260\347\232\204\346\234\200\345\244\247\345\274\202\346\210\226\345\200\274.md" b/docs/solutions/0400-0499/maximum-xor-of-two-numbers-in-an-array.md similarity index 100% rename from "Solutions/0421. \346\225\260\347\273\204\344\270\255\344\270\244\344\270\252\346\225\260\347\232\204\346\234\200\345\244\247\345\274\202\346\210\226\345\200\274.md" rename to docs/solutions/0400-0499/maximum-xor-of-two-numbers-in-an-array.md diff --git "a/Solutions/0452. \347\224\250\346\234\200\345\260\221\346\225\260\351\207\217\347\232\204\347\256\255\345\274\225\347\210\206\346\260\224\347\220\203.md" b/docs/solutions/0400-0499/minimum-number-of-arrows-to-burst-balloons.md similarity index 100% rename from "Solutions/0452. \347\224\250\346\234\200\345\260\221\346\225\260\351\207\217\347\232\204\347\256\255\345\274\225\347\210\206\346\260\224\347\220\203.md" rename to docs/solutions/0400-0499/minimum-number-of-arrows-to-burst-balloons.md diff --git "a/Solutions/0429. N \345\217\211\346\240\221\347\232\204\345\261\202\345\272\217\351\201\215\345\216\206.md" b/docs/solutions/0400-0499/n-ary-tree-level-order-traversal.md similarity index 100% rename from "Solutions/0429. N \345\217\211\346\240\221\347\232\204\345\261\202\345\272\217\351\201\215\345\216\206.md" rename to docs/solutions/0400-0499/n-ary-tree-level-order-traversal.md diff --git "a/Solutions/0496. \344\270\213\344\270\200\344\270\252\346\233\264\345\244\247\345\205\203\347\264\240 I.md" b/docs/solutions/0400-0499/next-greater-element-i.md similarity index 100% rename from "Solutions/0496. \344\270\213\344\270\200\344\270\252\346\233\264\345\244\247\345\205\203\347\264\240 I.md" rename to docs/solutions/0400-0499/next-greater-element-i.md diff --git "a/Solutions/0491. \351\200\222\345\242\236\345\255\220\345\272\217\345\210\227.md" b/docs/solutions/0400-0499/non-decreasing-subsequences.md similarity index 89% rename from "Solutions/0491. \351\200\222\345\242\236\345\255\220\345\272\217\345\210\227.md" rename to docs/solutions/0400-0499/non-decreasing-subsequences.md index b4130690..0943125c 100644 --- "a/Solutions/0491. \351\200\222\345\242\236\345\255\220\345\272\217\345\210\227.md" +++ b/docs/solutions/0400-0499/non-decreasing-subsequences.md @@ -1,11 +1,11 @@ -# [0491. 递增子序列](https://leetcode.cn/problems/increasing-subsequences/) +# [0491. 非递减子序列](https://leetcode.cn/problems/non-decreasing-subsequences/) - 标签：位运算、数组、哈希表、回溯 - 难度：中等 ## 题目链接 -- [0491. 递增子序列 - 力扣](https://leetcode.cn/problems/increasing-subsequences/) +- [0491. 非递减子序列 - 力扣](https://leetcode.cn/problems/non-decreasing-subsequences/) ## 题目大意 diff --git "a/Solutions/0435. \346\227\240\351\207\215\345\217\240\345\214\272\351\227\264.md" b/docs/solutions/0400-0499/non-overlapping-intervals.md similarity index 100% rename from "Solutions/0435. \346\227\240\351\207\215\345\217\240\345\214\272\351\227\264.md" rename to docs/solutions/0400-0499/non-overlapping-intervals.md diff --git "a/Solutions/0400. \347\254\254 N \344\275\215\346\225\260\345\255\227.md" b/docs/solutions/0400-0499/nth-digit.md similarity index 100% rename from "Solutions/0400. \347\254\254 N \344\275\215\346\225\260\345\255\227.md" rename to docs/solutions/0400-0499/nth-digit.md diff --git "a/Solutions/0447. \345\233\236\346\227\213\351\225\226\347\232\204\346\225\260\351\207\217.md" b/docs/solutions/0400-0499/number-of-boomerangs.md similarity index 100% rename from "Solutions/0447. \345\233\236\346\227\213\351\225\226\347\232\204\346\225\260\351\207\217.md" rename to docs/solutions/0400-0499/number-of-boomerangs.md diff --git "a/Solutions/0474. \344\270\200\345\222\214\351\233\266.md" b/docs/solutions/0400-0499/ones-and-zeroes.md similarity index 100% rename from "Solutions/0474. \344\270\200\345\222\214\351\233\266.md" rename to docs/solutions/0400-0499/ones-and-zeroes.md diff --git "a/Solutions/0417. \345\244\252\345\271\263\346\264\213\345\244\247\350\245\277\346\264\213\346\260\264\346\265\201\351\227\256\351\242\230.md" b/docs/solutions/0400-0499/pacific-atlantic-water-flow.md similarity index 100% rename from "Solutions/0417. \345\244\252\345\271\263\346\264\213\345\244\247\350\245\277\346\264\213\346\260\264\346\265\201\351\227\256\351\242\230.md" rename to docs/solutions/0400-0499/pacific-atlantic-water-flow.md diff --git "a/Solutions/0416. \345\210\206\345\211\262\347\255\211\345\222\214\345\255\220\351\233\206.md" b/docs/solutions/0400-0499/partition-equal-subset-sum.md similarity index 100% rename from "Solutions/0416. \345\210\206\345\211\262\347\255\211\345\222\214\345\255\220\351\233\206.md" rename to docs/solutions/0400-0499/partition-equal-subset-sum.md diff --git "a/Solutions/0437. \350\267\257\345\276\204\346\200\273\345\222\214 III.md" b/docs/solutions/0400-0499/path-sum-iii.md similarity index 100% rename from "Solutions/0437. \350\267\257\345\276\204\346\200\273\345\222\214 III.md" rename to docs/solutions/0400-0499/path-sum-iii.md diff --git "a/Solutions/0486. \351\242\204\346\265\213\350\265\242\345\256\266.md" b/docs/solutions/0400-0499/predict-the-winner.md similarity index 100% rename from "Solutions/0486. \351\242\204\346\265\213\350\265\242\345\256\266.md" rename to docs/solutions/0400-0499/predict-the-winner.md diff --git "a/Solutions/0406. \346\240\271\346\215\256\350\272\253\351\253\230\351\207\215\345\273\272\351\230\237\345\210\227.md" b/docs/solutions/0400-0499/queue-reconstruction-by-height.md similarity index 100% rename from "Solutions/0406. \346\240\271\346\215\256\350\272\253\351\253\230\351\207\215\345\273\272\351\230\237\345\210\227.md" rename to docs/solutions/0400-0499/queue-reconstruction-by-height.md diff --git "a/Solutions/0459. \351\207\215\345\244\215\347\232\204\345\255\220\345\255\227\347\254\246\344\270\262.md" b/docs/solutions/0400-0499/repeated-substring-pattern.md similarity index 100% rename from "Solutions/0459. \351\207\215\345\244\215\347\232\204\345\255\220\345\255\227\347\254\246\344\270\262.md" rename to docs/solutions/0400-0499/repeated-substring-pattern.md diff --git "a/Solutions/0428. \345\272\217\345\210\227\345\214\226\345\222\214\345\217\215\345\272\217\345\210\227\345\214\226 N \345\217\211\346\240\221.md" b/docs/solutions/0400-0499/serialize-and-deserialize-n-ary-tree.md similarity index 100% rename from "Solutions/0428. \345\272\217\345\210\227\345\214\226\345\222\214\345\217\215\345\272\217\345\210\227\345\214\226 N \345\217\211\346\240\221.md" rename to docs/solutions/0400-0499/serialize-and-deserialize-n-ary-tree.md diff --git "a/Solutions/0480. \346\273\221\345\212\250\347\252\227\345\217\243\344\270\255\344\275\215\346\225\260.md" b/docs/solutions/0400-0499/sliding-window-median.md similarity index 100% rename from "Solutions/0480. \346\273\221\345\212\250\347\252\227\345\217\243\344\270\255\344\275\215\346\225\260.md" rename to docs/solutions/0400-0499/sliding-window-median.md diff --git "a/Solutions/0451. \346\240\271\346\215\256\345\255\227\347\254\246\345\207\272\347\216\260\351\242\221\347\216\207\346\216\222\345\272\217.md" b/docs/solutions/0400-0499/sort-characters-by-frequency.md similarity index 100% rename from "Solutions/0451. \346\240\271\346\215\256\345\255\227\347\254\246\345\207\272\347\216\260\351\242\221\347\216\207\346\216\222\345\272\217.md" rename to docs/solutions/0400-0499/sort-characters-by-frequency.md diff --git "a/Solutions/0410. \345\210\206\345\211\262\346\225\260\347\273\204\347\232\204\346\234\200\345\244\247\345\200\274.md" b/docs/solutions/0400-0499/split-array-largest-sum.md similarity index 100% rename from "Solutions/0410. \345\210\206\345\211\262\346\225\260\347\273\204\347\232\204\346\234\200\345\244\247\345\200\274.md" rename to docs/solutions/0400-0499/split-array-largest-sum.md diff --git "a/Solutions/0443. \345\216\213\347\274\251\345\255\227\347\254\246\344\270\262.md" b/docs/solutions/0400-0499/string-compression.md similarity index 100% rename from "Solutions/0443. \345\216\213\347\274\251\345\255\227\347\254\246\344\270\262.md" rename to docs/solutions/0400-0499/string-compression.md diff --git "a/Solutions/0404. \345\267\246\345\217\266\345\255\220\344\271\213\345\222\214.md" b/docs/solutions/0400-0499/sum-of-left-leaves.md similarity index 100% rename from "Solutions/0404. \345\267\246\345\217\266\345\255\220\344\271\213\345\222\214.md" rename to docs/solutions/0400-0499/sum-of-left-leaves.md diff --git "a/Solutions/0494. \347\233\256\346\240\207\345\222\214.md" b/docs/solutions/0400-0499/target-sum.md similarity index 100% rename from "Solutions/0494. \347\233\256\346\240\207\345\222\214.md" rename to docs/solutions/0400-0499/target-sum.md diff --git "a/Solutions/0467. \347\216\257\347\273\225\345\255\227\347\254\246\344\270\262\344\270\255\345\224\257\344\270\200\347\232\204\345\255\220\345\255\227\347\254\246\344\270\262.md" b/docs/solutions/0400-0499/unique-substrings-in-wraparound-string.md similarity index 100% rename from "Solutions/0467. \347\216\257\347\273\225\345\255\227\347\254\246\344\270\262\344\270\255\345\224\257\344\270\200\347\232\204\345\255\220\345\255\227\347\254\246\344\270\262.md" rename to docs/solutions/0400-0499/unique-substrings-in-wraparound-string.md diff --git "a/Solutions/0468. \351\252\214\350\257\201IP\345\234\260\345\235\200.md" b/docs/solutions/0400-0499/validate-ip-address.md similarity index 100% rename from "Solutions/0468. \351\252\214\350\257\201IP\345\234\260\345\235\200.md" rename to docs/solutions/0400-0499/validate-ip-address.md diff --git "a/Solutions/0425. \345\215\225\350\257\215\346\226\271\345\235\227.md" b/docs/solutions/0400-0499/word-squares.md similarity index 100% rename from "Solutions/0425. \345\215\225\350\257\215\346\226\271\345\235\227.md" rename to docs/solutions/0400-0499/word-squares.md diff --git "a/Solutions/0542. 01 \347\237\251\351\230\265.md" b/docs/solutions/0500-0599/01-matrix.md similarity index 100% rename from "Solutions/0542. 01 \347\237\251\351\230\265.md" rename to docs/solutions/0500-0599/01-matrix.md diff --git "a/Solutions/0561. \346\225\260\347\273\204\346\213\206\345\210\206.md" b/docs/solutions/0500-0599/array-partition.md similarity index 100% rename from "Solutions/0561. \346\225\260\347\273\204\346\213\206\345\210\206.md" rename to docs/solutions/0500-0599/array-partition.md diff --git "a/Solutions/0504. \344\270\203\350\277\233\345\210\266\346\225\260.md" b/docs/solutions/0500-0599/base-7.md similarity index 100% rename from "Solutions/0504. \344\270\203\350\277\233\345\210\266\346\225\260.md" rename to docs/solutions/0500-0599/base-7.md diff --git "a/Solutions/0526. \344\274\230\347\276\216\347\232\204\346\216\222\345\210\227.md" b/docs/solutions/0500-0599/beautiful-arrangement.md similarity index 100% rename from "Solutions/0526. \344\274\230\347\276\216\347\232\204\346\216\222\345\210\227.md" rename to docs/solutions/0500-0599/beautiful-arrangement.md diff --git "a/Solutions/0518. \351\233\266\351\222\261\345\205\221\346\215\242 II.md" b/docs/solutions/0500-0599/coin-change-ii.md similarity index 100% rename from "Solutions/0518. \351\233\266\351\222\261\345\205\221\346\215\242 II.md" rename to docs/solutions/0500-0599/coin-change-ii.md diff --git "a/Solutions/0525. \350\277\236\347\273\255\346\225\260\347\273\204.md" b/docs/solutions/0500-0599/contiguous-array.md similarity index 100% rename from "Solutions/0525. \350\277\236\347\273\255\346\225\260\347\273\204.md" rename to docs/solutions/0500-0599/contiguous-array.md diff --git "a/Solutions/0538. \346\212\212\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\350\275\254\346\215\242\344\270\272\347\264\257\345\212\240\346\240\221.md" b/docs/solutions/0500-0599/convert-bst-to-greater-tree.md similarity index 100% rename from "Solutions/0538. \346\212\212\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\350\275\254\346\215\242\344\270\272\347\264\257\345\212\240\346\240\221.md" rename to docs/solutions/0500-0599/convert-bst-to-greater-tree.md diff --git "a/Solutions/0583. \344\270\244\344\270\252\345\255\227\347\254\246\344\270\262\347\232\204\345\210\240\351\231\244\346\223\215\344\275\234.md" b/docs/solutions/0500-0599/delete-operation-for-two-strings.md similarity index 100% rename from "Solutions/0583. \344\270\244\344\270\252\345\255\227\347\254\246\344\270\262\347\232\204\345\210\240\351\231\244\346\223\215\344\275\234.md" rename to docs/solutions/0500-0599/delete-operation-for-two-strings.md diff --git "a/Solutions/0543. \344\272\214\345\217\211\346\240\221\347\232\204\347\233\264\345\276\204.md" b/docs/solutions/0500-0599/diameter-of-binary-tree.md similarity index 100% rename from "Solutions/0543. \344\272\214\345\217\211\346\240\221\347\232\204\347\233\264\345\276\204.md" rename to docs/solutions/0500-0599/diameter-of-binary-tree.md diff --git "a/Solutions/0575. \345\210\206\347\263\226\346\236\234.md" b/docs/solutions/0500-0599/distribute-candies.md similarity index 100% rename from "Solutions/0575. \345\210\206\347\263\226\346\236\234.md" rename to docs/solutions/0500-0599/distribute-candies.md diff --git "a/Solutions/0509. \346\226\220\346\263\242\351\202\243\345\245\221\346\225\260.md" b/docs/solutions/0500-0599/fibonacci-number.md similarity index 100% rename from "Solutions/0509. \346\226\220\346\263\242\351\202\243\345\245\221\346\225\260.md" rename to docs/solutions/0500-0599/fibonacci-number.md diff --git "a/Solutions/0513. \346\211\276\346\240\221\345\267\246\344\270\213\350\247\222\347\232\204\345\200\274.md" b/docs/solutions/0500-0599/find-bottom-left-tree-value.md similarity index 100% rename from "Solutions/0513. \346\211\276\346\240\221\345\267\246\344\270\213\350\247\222\347\232\204\345\200\274.md" rename to docs/solutions/0500-0599/find-bottom-left-tree-value.md diff --git "a/Solutions/0515. \345\234\250\346\257\217\344\270\252\346\240\221\350\241\214\344\270\255\346\211\276\346\234\200\345\244\247\345\200\274.md" b/docs/solutions/0500-0599/find-largest-value-in-each-tree-row.md similarity index 100% rename from "Solutions/0515. \345\234\250\346\257\217\344\270\252\346\240\221\350\241\214\344\270\255\346\211\276\346\234\200\345\244\247\345\200\274.md" rename to docs/solutions/0500-0599/find-largest-value-in-each-tree-row.md diff --git "a/Solutions/0501. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\344\270\255\347\232\204\344\274\227\346\225\260.md" b/docs/solutions/0500-0599/find-mode-in-binary-search-tree.md similarity index 100% rename from "Solutions/0501. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\344\270\255\347\232\204\344\274\227\346\225\260.md" rename to docs/solutions/0500-0599/find-mode-in-binary-search-tree.md diff --git a/docs/solutions/0500-0599/index.md b/docs/solutions/0500-0599/index.md new file mode 100644 index 00000000..04bdf8a7 --- /dev/null +++ b/docs/solutions/0500-0599/index.md @@ -0,0 +1,30 @@ +## 本章内容 + +- [0501. 二叉搜索树中的众数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/find-mode-in-binary-search-tree.md) +- [0503. 下一个更大元素 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/next-greater-element-ii.md) +- [0504. 七进制数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/base-7.md) +- [0506. 相对名次](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/relative-ranks.md) +- [0509. 斐波那契数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/fibonacci-number.md) +- [0513. 找树左下角的值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/find-bottom-left-tree-value.md) +- [0515. 在每个树行中找最大值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/find-largest-value-in-each-tree-row.md) +- [0516. 最长回文子序列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/longest-palindromic-subsequence.md) +- [0518. 零钱兑换 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/coin-change-ii.md) +- [0525. 连续数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/contiguous-array.md) +- [0526. 优美的排列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/beautiful-arrangement.md) +- [0530. 二叉搜索树的最小绝对差](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/minimum-absolute-difference-in-bst.md) +- [0538. 把二叉搜索树转换为累加树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/convert-bst-to-greater-tree.md) +- [0539. 最小时间差](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/minimum-time-difference.md) +- [0542. 01 矩阵](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/01-matrix.md) +- [0543. 二叉树的直径](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/diameter-of-binary-tree.md) +- [0546. 移除盒子](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/remove-boxes.md) +- [0547. 省份数量](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/number-of-provinces.md) +- [0557. 反转字符串中的单词 III](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/reverse-words-in-a-string-iii.md) +- [0560. 和为 K 的子数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/subarray-sum-equals-k.md) +- [0561. 数组拆分](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/array-partition.md) +- [0567. 字符串的排列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/permutation-in-string.md) +- [0575. 分糖果](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/distribute-candies.md) +- [0576. 出界的路径数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/out-of-boundary-paths.md) +- [0583. 两个字符串的删除操作](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/delete-operation-for-two-strings.md) +- [0589. N 叉树的前序遍历](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/n-ary-tree-preorder-traversal.md) +- [0590. N 叉树的后序遍历](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/n-ary-tree-postorder-traversal.md) +- [0599. 两个列表的最小索引总和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/minimum-index-sum-of-two-lists.md) diff --git "a/Solutions/0516. \346\234\200\351\225\277\345\233\236\346\226\207\345\255\220\345\272\217\345\210\227.md" b/docs/solutions/0500-0599/longest-palindromic-subsequence.md similarity index 100% rename from "Solutions/0516. \346\234\200\351\225\277\345\233\236\346\226\207\345\255\220\345\272\217\345\210\227.md" rename to docs/solutions/0500-0599/longest-palindromic-subsequence.md diff --git "a/Solutions/0530. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\347\232\204\346\234\200\345\260\217\347\273\235\345\257\271\345\267\256.md" b/docs/solutions/0500-0599/minimum-absolute-difference-in-bst.md similarity index 100% rename from "Solutions/0530. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\347\232\204\346\234\200\345\260\217\347\273\235\345\257\271\345\267\256.md" rename to docs/solutions/0500-0599/minimum-absolute-difference-in-bst.md diff --git "a/Solutions/0599. \344\270\244\344\270\252\345\210\227\350\241\250\347\232\204\346\234\200\345\260\217\347\264\242\345\274\225\346\200\273\345\222\214.md" b/docs/solutions/0500-0599/minimum-index-sum-of-two-lists.md similarity index 100% rename from "Solutions/0599. \344\270\244\344\270\252\345\210\227\350\241\250\347\232\204\346\234\200\345\260\217\347\264\242\345\274\225\346\200\273\345\222\214.md" rename to docs/solutions/0500-0599/minimum-index-sum-of-two-lists.md diff --git "a/Solutions/0539. \346\234\200\345\260\217\346\227\266\351\227\264\345\267\256.md" b/docs/solutions/0500-0599/minimum-time-difference.md similarity index 100% rename from "Solutions/0539. \346\234\200\345\260\217\346\227\266\351\227\264\345\267\256.md" rename to docs/solutions/0500-0599/minimum-time-difference.md diff --git "a/Solutions/0590. N \345\217\211\346\240\221\347\232\204\345\220\216\345\272\217\351\201\215\345\216\206.md" b/docs/solutions/0500-0599/n-ary-tree-postorder-traversal.md similarity index 100% rename from "Solutions/0590. N \345\217\211\346\240\221\347\232\204\345\220\216\345\272\217\351\201\215\345\216\206.md" rename to docs/solutions/0500-0599/n-ary-tree-postorder-traversal.md diff --git "a/Solutions/0589. N \345\217\211\346\240\221\347\232\204\345\211\215\345\272\217\351\201\215\345\216\206.md" b/docs/solutions/0500-0599/n-ary-tree-preorder-traversal.md similarity index 100% rename from "Solutions/0589. N \345\217\211\346\240\221\347\232\204\345\211\215\345\272\217\351\201\215\345\216\206.md" rename to docs/solutions/0500-0599/n-ary-tree-preorder-traversal.md diff --git "a/Solutions/0503. \344\270\213\344\270\200\344\270\252\346\233\264\345\244\247\345\205\203\347\264\240 II.md" b/docs/solutions/0500-0599/next-greater-element-ii.md similarity index 100% rename from "Solutions/0503. \344\270\213\344\270\200\344\270\252\346\233\264\345\244\247\345\205\203\347\264\240 II.md" rename to docs/solutions/0500-0599/next-greater-element-ii.md diff --git "a/Solutions/0547. \347\234\201\344\273\275\346\225\260\351\207\217.md" b/docs/solutions/0500-0599/number-of-provinces.md similarity index 100% rename from "Solutions/0547. \347\234\201\344\273\275\346\225\260\351\207\217.md" rename to docs/solutions/0500-0599/number-of-provinces.md diff --git "a/Solutions/0576. \345\207\272\347\225\214\347\232\204\350\267\257\345\276\204\346\225\260.md" b/docs/solutions/0500-0599/out-of-boundary-paths.md similarity index 100% rename from "Solutions/0576. \345\207\272\347\225\214\347\232\204\350\267\257\345\276\204\346\225\260.md" rename to docs/solutions/0500-0599/out-of-boundary-paths.md diff --git "a/Solutions/0567. \345\255\227\347\254\246\344\270\262\347\232\204\346\216\222\345\210\227.md" b/docs/solutions/0500-0599/permutation-in-string.md similarity index 100% rename from "Solutions/0567. \345\255\227\347\254\246\344\270\262\347\232\204\346\216\222\345\210\227.md" rename to docs/solutions/0500-0599/permutation-in-string.md diff --git "a/Solutions/0506. \347\233\270\345\257\271\345\220\215\346\254\241.md" b/docs/solutions/0500-0599/relative-ranks.md similarity index 100% rename from "Solutions/0506. \347\233\270\345\257\271\345\220\215\346\254\241.md" rename to docs/solutions/0500-0599/relative-ranks.md diff --git "a/Solutions/0546. \347\247\273\351\231\244\347\233\222\345\255\220.md" b/docs/solutions/0500-0599/remove-boxes.md similarity index 100% rename from "Solutions/0546. \347\247\273\351\231\244\347\233\222\345\255\220.md" rename to docs/solutions/0500-0599/remove-boxes.md diff --git "a/Solutions/0557. \345\217\215\350\275\254\345\255\227\347\254\246\344\270\262\344\270\255\347\232\204\345\215\225\350\257\215 III.md" b/docs/solutions/0500-0599/reverse-words-in-a-string-iii.md similarity index 100% rename from "Solutions/0557. \345\217\215\350\275\254\345\255\227\347\254\246\344\270\262\344\270\255\347\232\204\345\215\225\350\257\215 III.md" rename to docs/solutions/0500-0599/reverse-words-in-a-string-iii.md diff --git "a/Solutions/0560. \345\222\214\344\270\272 K \347\232\204\345\255\220\346\225\260\347\273\204.md" b/docs/solutions/0500-0599/subarray-sum-equals-k.md similarity index 100% rename from "Solutions/0560. \345\222\214\344\270\272 K \347\232\204\345\255\220\346\225\260\347\273\204.md" rename to docs/solutions/0500-0599/subarray-sum-equals-k.md diff --git "a/Solutions/0650. \345\217\252\346\234\211\344\270\244\344\270\252\351\224\256\347\232\204\351\224\256\347\233\230.md" b/docs/solutions/0600-0699/2-keys-keyboard.md similarity index 94% rename from "Solutions/0650. \345\217\252\346\234\211\344\270\244\344\270\252\351\224\256\347\232\204\351\224\256\347\233\230.md" rename to docs/solutions/0600-0699/2-keys-keyboard.md index a40067e7..b8fd3ea0 100644 --- "a/Solutions/0650. \345\217\252\346\234\211\344\270\244\344\270\252\351\224\256\347\232\204\351\224\256\347\233\230.md" +++ b/docs/solutions/0600-0699/2-keys-keyboard.md @@ -1,11 +1,11 @@ -# [0650. 只有两个键的键盘](https://leetcode.cn/problems/2-keys-keyboard/) +# [0650. 两个键的键盘](https://leetcode.cn/problems/2-keys-keyboard/) - 标签：数学、动态规划 - 难度：中等 ## 题目链接 -- [0650. 只有两个键的键盘 - 力扣](https://leetcode.cn/problems/2-keys-keyboard/) +- [0650. 两个键的键盘 - 力扣](https://leetcode.cn/problems/2-keys-keyboard/) ## 题目大意 diff --git "a/Solutions/0616. \347\273\231\345\255\227\347\254\246\344\270\262\346\267\273\345\212\240\345\212\240\347\262\227\346\240\207\347\255\276.md" b/docs/solutions/0600-0699/add-bold-tag-in-string.md similarity index 100% rename from "Solutions/0616. \347\273\231\345\255\227\347\254\246\344\270\262\346\267\273\345\212\240\345\212\240\347\262\227\346\240\207\347\255\276.md" rename to docs/solutions/0600-0699/add-bold-tag-in-string.md diff --git "a/Solutions/0639. \350\247\243\347\240\201\346\226\271\346\263\225 II.md" b/docs/solutions/0600-0699/decode-ways-ii.md similarity index 100% rename from "Solutions/0639. \350\247\243\347\240\201\346\226\271\346\263\225 II.md" rename to docs/solutions/0600-0699/decode-ways-ii.md diff --git "a/Solutions/0622. \350\256\276\350\256\241\345\276\252\347\216\257\351\230\237\345\210\227.md" b/docs/solutions/0600-0699/design-circular-queue.md similarity index 100% rename from "Solutions/0622. \350\256\276\350\256\241\345\276\252\347\216\257\351\230\237\345\210\227.md" rename to docs/solutions/0600-0699/design-circular-queue.md diff --git "a/Solutions/0642. \350\256\276\350\256\241\346\220\234\347\264\242\350\207\252\345\212\250\350\241\245\345\205\250\347\263\273\347\273\237.md" b/docs/solutions/0600-0699/design-search-autocomplete-system.md similarity index 100% rename from "Solutions/0642. \350\256\276\350\256\241\346\220\234\347\264\242\350\207\252\345\212\250\350\241\245\345\205\250\347\263\273\347\273\237.md" rename to docs/solutions/0600-0699/design-search-autocomplete-system.md diff --git "a/Solutions/0690. \345\221\230\345\267\245\347\232\204\351\207\215\350\246\201\346\200\247.md" b/docs/solutions/0600-0699/employee-importance.md similarity index 100% rename from "Solutions/0690. \345\221\230\345\267\245\347\232\204\351\207\215\350\246\201\346\200\247.md" rename to docs/solutions/0600-0699/employee-importance.md diff --git "a/Solutions/0652. \345\257\273\346\211\276\351\207\215\345\244\215\347\232\204\345\255\220\346\240\221.md" b/docs/solutions/0600-0699/find-duplicate-subtrees.md similarity index 100% rename from "Solutions/0652. \345\257\273\346\211\276\351\207\215\345\244\215\347\232\204\345\255\220\346\240\221.md" rename to docs/solutions/0600-0699/find-duplicate-subtrees.md diff --git "a/Solutions/0658. \346\211\276\345\210\260 K \344\270\252\346\234\200\346\216\245\350\277\221\347\232\204\345\205\203\347\264\240.md" b/docs/solutions/0600-0699/find-k-closest-elements.md similarity index 100% rename from "Solutions/0658. \346\211\276\345\210\260 K \344\270\252\346\234\200\346\216\245\350\277\221\347\232\204\345\205\203\347\264\240.md" rename to docs/solutions/0600-0699/find-k-closest-elements.md diff --git "a/Solutions/0676. \345\256\236\347\216\260\344\270\200\344\270\252\351\255\224\346\263\225\345\255\227\345\205\270.md" b/docs/solutions/0600-0699/implement-magic-dictionary.md similarity index 100% rename from "Solutions/0676. \345\256\236\347\216\260\344\270\200\344\270\252\351\255\224\346\263\225\345\255\227\345\205\270.md" rename to docs/solutions/0600-0699/implement-magic-dictionary.md diff --git a/docs/solutions/0600-0699/index.md b/docs/solutions/0600-0699/index.md new file mode 100644 index 00000000..28cf22ed --- /dev/null +++ b/docs/solutions/0600-0699/index.md @@ -0,0 +1,38 @@ +## 本章内容 + +- [0600. 不含连续1的非负整数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/non-negative-integers-without-consecutive-ones.md) +- [0611. 有效三角形的个数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/valid-triangle-number.md) +- [0616. 给字符串添加加粗标签](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/add-bold-tag-in-string.md) +- [0617. 合并二叉树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/merge-two-binary-trees.md) +- [0621. 任务调度器](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/task-scheduler.md) +- [0622. 设计循环队列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/design-circular-queue.md) +- [0633. 平方数之和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/sum-of-square-numbers.md) +- [0639. 解码方法 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/decode-ways-ii.md) +- [0642. 设计搜索自动补全系统](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/design-search-autocomplete-system.md) +- [0643. 子数组最大平均数 I](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/maximum-average-subarray-i.md) +- [0647. 回文子串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/palindromic-substrings.md) +- [0648. 单词替换](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/replace-words.md) +- [0650. 两个键的键盘](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/2-keys-keyboard.md) +- [0652. 寻找重复的子树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/find-duplicate-subtrees.md) +- [0653. 两数之和 IV - 输入二叉搜索树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/two-sum-iv-input-is-a-bst.md) +- [0654. 最大二叉树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/maximum-binary-tree.md) +- [0658. 找到 K 个最接近的元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/find-k-closest-elements.md) +- [0662. 二叉树最大宽度](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/maximum-width-of-binary-tree.md) +- [0664. 奇怪的打印机](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/strange-printer.md) +- [0665. 非递减数列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/non-decreasing-array.md) +- [0669. 修剪二叉搜索树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/trim-a-binary-search-tree.md) +- [0673. 最长递增子序列的个数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/number-of-longest-increasing-subsequence.md) +- [0674. 最长连续递增序列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/longest-continuous-increasing-subsequence.md) +- [0676. 实现一个魔法字典](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/implement-magic-dictionary.md) +- [0677. 键值映射](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/map-sum-pairs.md) +- [0678. 有效的括号字符串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/valid-parenthesis-string.md) +- [0680. 验证回文串 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/valid-palindrome-ii.md) +- [0683. K 个关闭的灯泡](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/k-empty-slots.md) +- [0684. 冗余连接](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/redundant-connection.md) +- [0686. 重复叠加字符串匹配](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/repeated-string-match.md) +- [0687. 最长同值路径](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/longest-univalue-path.md) +- [0688. 骑士在棋盘上的概率](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/knight-probability-in-chessboard.md) +- [0690. 员工的重要性](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/employee-importance.md) +- [0691. 贴纸拼词](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/stickers-to-spell-word.md) +- [0695. 岛屿的最大面积](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/max-area-of-island.md) +- [0698. 划分为k个相等的子集](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/partition-to-k-equal-sum-subsets.md) diff --git "a/Solutions/0683. K \344\270\252\345\205\263\351\227\255\347\232\204\347\201\257\346\263\241.md" b/docs/solutions/0600-0699/k-empty-slots.md similarity index 100% rename from "Solutions/0683. K \344\270\252\345\205\263\351\227\255\347\232\204\347\201\257\346\263\241.md" rename to docs/solutions/0600-0699/k-empty-slots.md diff --git "a/Solutions/0688. \351\252\221\345\243\253\345\234\250\346\243\213\347\233\230\344\270\212\347\232\204\346\246\202\347\216\207.md" b/docs/solutions/0600-0699/knight-probability-in-chessboard.md similarity index 100% rename from "Solutions/0688. \351\252\221\345\243\253\345\234\250\346\243\213\347\233\230\344\270\212\347\232\204\346\246\202\347\216\207.md" rename to docs/solutions/0600-0699/knight-probability-in-chessboard.md diff --git "a/Solutions/0674. \346\234\200\351\225\277\350\277\236\347\273\255\351\200\222\345\242\236\345\272\217\345\210\227.md" b/docs/solutions/0600-0699/longest-continuous-increasing-subsequence.md similarity index 100% rename from "Solutions/0674. \346\234\200\351\225\277\350\277\236\347\273\255\351\200\222\345\242\236\345\272\217\345\210\227.md" rename to docs/solutions/0600-0699/longest-continuous-increasing-subsequence.md diff --git "a/Solutions/0687. \346\234\200\351\225\277\345\220\214\345\200\274\350\267\257\345\276\204.md" b/docs/solutions/0600-0699/longest-univalue-path.md similarity index 100% rename from "Solutions/0687. \346\234\200\351\225\277\345\220\214\345\200\274\350\267\257\345\276\204.md" rename to docs/solutions/0600-0699/longest-univalue-path.md diff --git "a/Solutions/0677. \351\224\256\345\200\274\346\230\240\345\260\204.md" b/docs/solutions/0600-0699/map-sum-pairs.md similarity index 100% rename from "Solutions/0677. \351\224\256\345\200\274\346\230\240\345\260\204.md" rename to docs/solutions/0600-0699/map-sum-pairs.md diff --git "a/Solutions/0695. \345\262\233\345\261\277\347\232\204\346\234\200\345\244\247\351\235\242\347\247\257.md" b/docs/solutions/0600-0699/max-area-of-island.md similarity index 100% rename from "Solutions/0695. \345\262\233\345\261\277\347\232\204\346\234\200\345\244\247\351\235\242\347\247\257.md" rename to docs/solutions/0600-0699/max-area-of-island.md diff --git "a/Solutions/0643. \345\255\220\346\225\260\347\273\204\346\234\200\345\244\247\345\271\263\345\235\207\346\225\260 I.md" b/docs/solutions/0600-0699/maximum-average-subarray-i.md similarity index 100% rename from "Solutions/0643. \345\255\220\346\225\260\347\273\204\346\234\200\345\244\247\345\271\263\345\235\207\346\225\260 I.md" rename to docs/solutions/0600-0699/maximum-average-subarray-i.md diff --git "a/Solutions/0654. \346\234\200\345\244\247\344\272\214\345\217\211\346\240\221.md" b/docs/solutions/0600-0699/maximum-binary-tree.md similarity index 100% rename from "Solutions/0654. \346\234\200\345\244\247\344\272\214\345\217\211\346\240\221.md" rename to docs/solutions/0600-0699/maximum-binary-tree.md diff --git "a/Solutions/0662. \344\272\214\345\217\211\346\240\221\346\234\200\345\244\247\345\256\275\345\272\246.md" b/docs/solutions/0600-0699/maximum-width-of-binary-tree.md similarity index 100% rename from "Solutions/0662. \344\272\214\345\217\211\346\240\221\346\234\200\345\244\247\345\256\275\345\272\246.md" rename to docs/solutions/0600-0699/maximum-width-of-binary-tree.md diff --git "a/Solutions/0617. \345\220\210\345\271\266\344\272\214\345\217\211\346\240\221.md" b/docs/solutions/0600-0699/merge-two-binary-trees.md similarity index 100% rename from "Solutions/0617. \345\220\210\345\271\266\344\272\214\345\217\211\346\240\221.md" rename to docs/solutions/0600-0699/merge-two-binary-trees.md diff --git "a/Solutions/0665. \351\235\236\351\200\222\345\207\217\346\225\260\345\210\227.md" b/docs/solutions/0600-0699/non-decreasing-array.md similarity index 100% rename from "Solutions/0665. \351\235\236\351\200\222\345\207\217\346\225\260\345\210\227.md" rename to docs/solutions/0600-0699/non-decreasing-array.md diff --git "a/Solutions/0600. \344\270\215\345\220\253\350\277\236\347\273\2551\347\232\204\351\235\236\350\264\237\346\225\264\346\225\260.md" b/docs/solutions/0600-0699/non-negative-integers-without-consecutive-ones.md similarity index 100% rename from "Solutions/0600. \344\270\215\345\220\253\350\277\236\347\273\2551\347\232\204\351\235\236\350\264\237\346\225\264\346\225\260.md" rename to docs/solutions/0600-0699/non-negative-integers-without-consecutive-ones.md diff --git "a/Solutions/0673. \346\234\200\351\225\277\351\200\222\345\242\236\345\255\220\345\272\217\345\210\227\347\232\204\344\270\252\346\225\260.md" b/docs/solutions/0600-0699/number-of-longest-increasing-subsequence.md similarity index 100% rename from "Solutions/0673. \346\234\200\351\225\277\351\200\222\345\242\236\345\255\220\345\272\217\345\210\227\347\232\204\344\270\252\346\225\260.md" rename to docs/solutions/0600-0699/number-of-longest-increasing-subsequence.md diff --git "a/Solutions/0647. \345\233\236\346\226\207\345\255\220\344\270\262.md" b/docs/solutions/0600-0699/palindromic-substrings.md similarity index 100% rename from "Solutions/0647. \345\233\236\346\226\207\345\255\220\344\270\262.md" rename to docs/solutions/0600-0699/palindromic-substrings.md diff --git "a/Solutions/0698. \345\210\222\345\210\206\344\270\272k\344\270\252\347\233\270\347\255\211\347\232\204\345\255\220\351\233\206.md" b/docs/solutions/0600-0699/partition-to-k-equal-sum-subsets.md similarity index 100% rename from "Solutions/0698. \345\210\222\345\210\206\344\270\272k\344\270\252\347\233\270\347\255\211\347\232\204\345\255\220\351\233\206.md" rename to docs/solutions/0600-0699/partition-to-k-equal-sum-subsets.md diff --git "a/Solutions/0684. \345\206\227\344\275\231\350\277\236\346\216\245.md" b/docs/solutions/0600-0699/redundant-connection.md similarity index 100% rename from "Solutions/0684. \345\206\227\344\275\231\350\277\236\346\216\245.md" rename to docs/solutions/0600-0699/redundant-connection.md diff --git "a/Solutions/0686. \351\207\215\345\244\215\345\217\240\345\212\240\345\255\227\347\254\246\344\270\262\345\214\271\351\205\215.md" b/docs/solutions/0600-0699/repeated-string-match.md similarity index 100% rename from "Solutions/0686. \351\207\215\345\244\215\345\217\240\345\212\240\345\255\227\347\254\246\344\270\262\345\214\271\351\205\215.md" rename to docs/solutions/0600-0699/repeated-string-match.md diff --git "a/Solutions/0648. \345\215\225\350\257\215\346\233\277\346\215\242.md" b/docs/solutions/0600-0699/replace-words.md similarity index 100% rename from "Solutions/0648. \345\215\225\350\257\215\346\233\277\346\215\242.md" rename to docs/solutions/0600-0699/replace-words.md diff --git "a/Solutions/0691. \350\264\264\347\272\270\346\213\274\350\257\215.md" b/docs/solutions/0600-0699/stickers-to-spell-word.md similarity index 100% rename from "Solutions/0691. \350\264\264\347\272\270\346\213\274\350\257\215.md" rename to docs/solutions/0600-0699/stickers-to-spell-word.md diff --git "a/Solutions/0664. \345\245\207\346\200\252\347\232\204\346\211\223\345\215\260\346\234\272.md" b/docs/solutions/0600-0699/strange-printer.md similarity index 100% rename from "Solutions/0664. \345\245\207\346\200\252\347\232\204\346\211\223\345\215\260\346\234\272.md" rename to docs/solutions/0600-0699/strange-printer.md diff --git "a/Solutions/0633. \345\271\263\346\226\271\346\225\260\344\271\213\345\222\214.md" b/docs/solutions/0600-0699/sum-of-square-numbers.md similarity index 100% rename from "Solutions/0633. \345\271\263\346\226\271\346\225\260\344\271\213\345\222\214.md" rename to docs/solutions/0600-0699/sum-of-square-numbers.md diff --git "a/Solutions/0621. \344\273\273\345\212\241\350\260\203\345\272\246\345\231\250.md" b/docs/solutions/0600-0699/task-scheduler.md similarity index 100% rename from "Solutions/0621. \344\273\273\345\212\241\350\260\203\345\272\246\345\231\250.md" rename to docs/solutions/0600-0699/task-scheduler.md diff --git "a/Solutions/0669. \344\277\256\345\211\252\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221.md" b/docs/solutions/0600-0699/trim-a-binary-search-tree.md similarity index 100% rename from "Solutions/0669. \344\277\256\345\211\252\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221.md" rename to docs/solutions/0600-0699/trim-a-binary-search-tree.md diff --git "a/Solutions/0653. \344\270\244\346\225\260\344\271\213\345\222\214 IV - \350\276\223\345\205\245\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221.md" b/docs/solutions/0600-0699/two-sum-iv-input-is-a-bst.md similarity index 100% rename from "Solutions/0653. \344\270\244\346\225\260\344\271\213\345\222\214 IV - \350\276\223\345\205\245\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221.md" rename to docs/solutions/0600-0699/two-sum-iv-input-is-a-bst.md diff --git "a/Solutions/0680. \351\252\214\350\257\201\345\233\236\346\226\207\344\270\262 II.md" b/docs/solutions/0600-0699/valid-palindrome-ii.md similarity index 100% rename from "Solutions/0680. \351\252\214\350\257\201\345\233\236\346\226\207\344\270\262 II.md" rename to docs/solutions/0600-0699/valid-palindrome-ii.md diff --git "a/Solutions/0678. \346\234\211\346\225\210\347\232\204\346\213\254\345\217\267\345\255\227\347\254\246\344\270\262.md" b/docs/solutions/0600-0699/valid-parenthesis-string.md similarity index 100% rename from "Solutions/0678. \346\234\211\346\225\210\347\232\204\346\213\254\345\217\267\345\255\227\347\254\246\344\270\262.md" rename to docs/solutions/0600-0699/valid-parenthesis-string.md diff --git "a/Solutions/0611. \346\234\211\346\225\210\344\270\211\350\247\222\345\275\242\347\232\204\344\270\252\346\225\260.md" b/docs/solutions/0600-0699/valid-triangle-number.md similarity index 100% rename from "Solutions/0611. \346\234\211\346\225\210\344\270\211\350\247\222\345\275\242\347\232\204\344\270\252\346\225\260.md" rename to docs/solutions/0600-0699/valid-triangle-number.md diff --git "a/Solutions/0797. \346\211\200\346\234\211\345\217\257\350\203\275\347\232\204\350\267\257\345\276\204.md" b/docs/solutions/0700-0799/all-paths-from-source-to-target.md similarity index 100% rename from "Solutions/0797. \346\211\200\346\234\211\345\217\257\350\203\275\347\232\204\350\267\257\345\276\204.md" rename to docs/solutions/0700-0799/all-paths-from-source-to-target.md diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 037. \345\260\217\350\241\214\346\230\237\347\242\260\346\222\236.md" b/docs/solutions/0700-0799/asteroid-collision.md similarity index 92% rename from "Solutions/\345\211\221\346\214\207 Offer II 037. \345\260\217\350\241\214\346\230\237\347\242\260\346\222\236.md" rename to docs/solutions/0700-0799/asteroid-collision.md index c5ce82f8..647d0583 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 037. \345\260\217\350\241\214\346\230\237\347\242\260\346\222\236.md" +++ b/docs/solutions/0700-0799/asteroid-collision.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 037. 小行星碰撞](https://leetcode.cn/problems/XagZNi/) +# [0735. 小行星碰撞](https://leetcode.cn/problems/asteroid-collision/) - 标签：栈、数组 - 难度：中等 ## 题目链接 -- [剑指 Offer II 037. 小行星碰撞 - 力扣](https://leetcode.cn/problems/XagZNi/) +- [0735. 小行星碰撞 - 力扣](https://leetcode.cn/problems/asteroid-collision/) ## 题目大意 diff --git "a/Solutions/0714. \344\271\260\345\215\226\350\202\241\347\245\250\347\232\204\346\234\200\344\275\263\346\227\266\346\234\272\345\220\253\346\211\213\347\273\255\350\264\271.md" b/docs/solutions/0700-0799/best-time-to-buy-and-sell-stock-with-transaction-fee.md similarity index 100% rename from "Solutions/0714. \344\271\260\345\215\226\350\202\241\347\245\250\347\232\204\346\234\200\344\275\263\346\227\266\346\234\272\345\220\253\346\211\213\347\273\255\350\264\271.md" rename to docs/solutions/0700-0799/best-time-to-buy-and-sell-stock-with-transaction-fee.md diff --git "a/Solutions/0704. \344\272\214\345\210\206\346\237\245\346\211\276.md" b/docs/solutions/0700-0799/binary-search.md similarity index 100% rename from "Solutions/0704. \344\272\214\345\210\206\346\237\245\346\211\276.md" rename to docs/solutions/0700-0799/binary-search.md diff --git "a/Solutions/0758. \345\255\227\347\254\246\344\270\262\344\270\255\347\232\204\345\212\240\347\262\227\345\215\225\350\257\215.md" b/docs/solutions/0700-0799/bold-words-in-string.md similarity index 100% rename from "Solutions/0758. \345\255\227\347\254\246\344\270\262\344\270\255\347\232\204\345\212\240\347\262\227\345\215\225\350\257\215.md" rename to docs/solutions/0700-0799/bold-words-in-string.md diff --git "a/Solutions/0765. \346\203\205\344\276\243\347\211\265\346\211\213.md" b/docs/solutions/0700-0799/couples-holding-hands.md similarity index 100% rename from "Solutions/0765. \346\203\205\344\276\243\347\211\265\346\211\213.md" rename to docs/solutions/0700-0799/couples-holding-hands.md diff --git "a/Solutions/0739. \346\257\217\346\227\245\346\270\251\345\272\246.md" b/docs/solutions/0700-0799/daily-temperatures.md similarity index 100% rename from "Solutions/0739. \346\257\217\346\227\245\346\270\251\345\272\246.md" rename to docs/solutions/0700-0799/daily-temperatures.md diff --git "a/Solutions/0706. \350\256\276\350\256\241\345\223\210\345\270\214\346\230\240\345\260\204.md" b/docs/solutions/0700-0799/design-hashmap.md similarity index 100% rename from "Solutions/0706. \350\256\276\350\256\241\345\223\210\345\270\214\346\230\240\345\260\204.md" rename to docs/solutions/0700-0799/design-hashmap.md diff --git "a/Solutions/0705. \350\256\276\350\256\241\345\223\210\345\270\214\351\233\206\345\220\210.md" b/docs/solutions/0700-0799/design-hashset.md similarity index 100% rename from "Solutions/0705. \350\256\276\350\256\241\345\223\210\345\270\214\351\233\206\345\220\210.md" rename to docs/solutions/0700-0799/design-hashset.md diff --git "a/Solutions/0707. \350\256\276\350\256\241\351\223\276\350\241\250.md" b/docs/solutions/0700-0799/design-linked-list.md similarity index 100% rename from "Solutions/0707. \350\256\276\350\256\241\351\223\276\350\241\250.md" rename to docs/solutions/0700-0799/design-linked-list.md diff --git "a/Solutions/0719. \346\211\276\345\207\272\347\254\254 K \345\260\217\347\232\204\346\225\260\345\257\271\350\267\235\347\246\273.md" b/docs/solutions/0700-0799/find-k-th-smallest-pair-distance.md similarity index 100% rename from "Solutions/0719. \346\211\276\345\207\272\347\254\254 K \345\260\217\347\232\204\346\225\260\345\257\271\350\267\235\347\246\273.md" rename to docs/solutions/0700-0799/find-k-th-smallest-pair-distance.md diff --git "a/Solutions/0724. \345\257\273\346\211\276\346\225\260\347\273\204\347\232\204\344\270\255\345\277\203\344\270\213\346\240\207.md" b/docs/solutions/0700-0799/find-pivot-index.md similarity index 100% rename from "Solutions/0724. \345\257\273\346\211\276\346\225\260\347\273\204\347\232\204\344\270\255\345\277\203\344\270\213\346\240\207.md" rename to docs/solutions/0700-0799/find-pivot-index.md diff --git "a/Solutions/0744. \345\257\273\346\211\276\346\257\224\347\233\256\346\240\207\345\255\227\346\257\215\345\244\247\347\232\204\346\234\200\345\260\217\345\255\227\346\257\215.md" b/docs/solutions/0700-0799/find-smallest-letter-greater-than-target.md similarity index 100% rename from "Solutions/0744. \345\257\273\346\211\276\346\257\224\347\233\256\346\240\207\345\255\227\346\257\215\345\244\247\347\232\204\346\234\200\345\260\217\345\255\227\346\257\215.md" rename to docs/solutions/0700-0799/find-smallest-letter-greater-than-target.md diff --git "a/Solutions/0733. \345\233\276\345\203\217\346\270\262\346\237\223.md" b/docs/solutions/0700-0799/flood-fill.md similarity index 100% rename from "Solutions/0733. \345\233\276\345\203\217\346\270\262\346\237\223.md" rename to docs/solutions/0700-0799/flood-fill.md diff --git a/docs/solutions/0700-0799/index.md b/docs/solutions/0700-0799/index.md new file mode 100644 index 00000000..9697d8e8 --- /dev/null +++ b/docs/solutions/0700-0799/index.md @@ -0,0 +1,44 @@ +## 本章内容 + +- [0700. 二叉搜索树中的搜索](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/search-in-a-binary-search-tree.md) +- [0701. 二叉搜索树中的插入操作](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/insert-into-a-binary-search-tree.md) +- [0702. 搜索长度未知的有序数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/search-in-a-sorted-array-of-unknown-size.md) +- [0703. 数据流中的第 K 大元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/kth-largest-element-in-a-stream.md) +- [0704. 二分查找](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/binary-search.md) +- [0705. 设计哈希集合](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/design-hashset.md) +- [0706. 设计哈希映射](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/design-hashmap.md) +- [0707. 设计链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/design-linked-list.md) +- [0708. 循环有序列表的插入](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/insert-into-a-sorted-circular-linked-list.md) +- [0709. 转换成小写字母](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/to-lower-case.md) +- [0713. 乘积小于 K 的子数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/subarray-product-less-than-k.md) +- [0714. 买卖股票的最佳时机含手续费](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/best-time-to-buy-and-sell-stock-with-transaction-fee.md) +- [0715. Range 模块](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/range-module.md) +- [0718. 最长重复子数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/maximum-length-of-repeated-subarray.md) +- [0719. 找出第 K 小的数对距离](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/find-k-th-smallest-pair-distance.md) +- [0720. 词典中最长的单词](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/longest-word-in-dictionary.md) +- [0724. 寻找数组的中心下标](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/find-pivot-index.md) +- [0727. 最小窗口子序列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/minimum-window-subsequence.md) +- [0729. 我的日程安排表 I](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/my-calendar-i.md) +- [0731. 我的日程安排表 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/my-calendar-ii.md) +- [0732. 我的日程安排表 III](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/my-calendar-iii.md) +- [0733. 图像渲染](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/flood-fill.md) +- [0735. 小行星碰撞](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/asteroid-collision.md) +- [0738. 单调递增的数字](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/monotone-increasing-digits.md) +- [0739. 每日温度](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/daily-temperatures.md) +- [0744. 寻找比目标字母大的最小字母](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/find-smallest-letter-greater-than-target.md) +- [0746. 使用最小花费爬楼梯](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/min-cost-climbing-stairs.md) +- [0752. 打开转盘锁](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/open-the-lock.md) +- [0758. 字符串中的加粗单词](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/bold-words-in-string.md) +- [0763. 划分字母区间](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/partition-labels.md) +- [0765. 情侣牵手](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/couples-holding-hands.md) +- [0766. 托普利茨矩阵](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/toeplitz-matrix.md) +- [0771. 宝石与石头](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/jewels-and-stones.md) +- [0778. 水位上升的泳池中游泳](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/swim-in-rising-water.md) +- [0779. 第K个语法符号](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/k-th-symbol-in-grammar.md) +- [0783. 二叉搜索树节点最小距离](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/minimum-distance-between-bst-nodes.md) +- [0784. 字母大小写全排列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/letter-case-permutation.md) +- [0785. 判断二分图](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/is-graph-bipartite.md) +- [0788. 旋转数字](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/rotated-digits.md) +- [0795. 区间子数组个数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/number-of-subarrays-with-bounded-maximum.md) +- [0796. 旋转字符串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/rotate-string.md) +- [0797. 所有可能的路径](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/all-paths-from-source-to-target.md) diff --git "a/Solutions/0701. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\344\270\255\347\232\204\346\217\222\345\205\245\346\223\215\344\275\234.md" b/docs/solutions/0700-0799/insert-into-a-binary-search-tree.md similarity index 100% rename from "Solutions/0701. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\344\270\255\347\232\204\346\217\222\345\205\245\346\223\215\344\275\234.md" rename to docs/solutions/0700-0799/insert-into-a-binary-search-tree.md diff --git "a/Solutions/0708. \345\276\252\347\216\257\346\234\211\345\272\217\345\210\227\350\241\250\347\232\204\346\217\222\345\205\245.md" b/docs/solutions/0700-0799/insert-into-a-sorted-circular-linked-list.md similarity index 100% rename from "Solutions/0708. \345\276\252\347\216\257\346\234\211\345\272\217\345\210\227\350\241\250\347\232\204\346\217\222\345\205\245.md" rename to docs/solutions/0700-0799/insert-into-a-sorted-circular-linked-list.md diff --git "a/Solutions/0785. \345\210\244\346\226\255\344\272\214\345\210\206\345\233\276.md" b/docs/solutions/0700-0799/is-graph-bipartite.md similarity index 100% rename from "Solutions/0785. \345\210\244\346\226\255\344\272\214\345\210\206\345\233\276.md" rename to docs/solutions/0700-0799/is-graph-bipartite.md diff --git "a/Solutions/0771. \345\256\235\347\237\263\344\270\216\347\237\263\345\244\264.md" b/docs/solutions/0700-0799/jewels-and-stones.md similarity index 100% rename from "Solutions/0771. \345\256\235\347\237\263\344\270\216\347\237\263\345\244\264.md" rename to docs/solutions/0700-0799/jewels-and-stones.md diff --git "a/Solutions/0779. \347\254\254K\344\270\252\350\257\255\346\263\225\347\254\246\345\217\267.md" b/docs/solutions/0700-0799/k-th-symbol-in-grammar.md similarity index 100% rename from "Solutions/0779. \347\254\254K\344\270\252\350\257\255\346\263\225\347\254\246\345\217\267.md" rename to docs/solutions/0700-0799/k-th-symbol-in-grammar.md diff --git "a/Solutions/0703. \346\225\260\346\215\256\346\265\201\344\270\255\347\232\204\347\254\254 K \345\244\247\345\205\203\347\264\240.md" b/docs/solutions/0700-0799/kth-largest-element-in-a-stream.md similarity index 100% rename from "Solutions/0703. \346\225\260\346\215\256\346\265\201\344\270\255\347\232\204\347\254\254 K \345\244\247\345\205\203\347\264\240.md" rename to docs/solutions/0700-0799/kth-largest-element-in-a-stream.md diff --git "a/Solutions/0784. \345\255\227\346\257\215\345\244\247\345\260\217\345\206\231\345\205\250\346\216\222\345\210\227.md" b/docs/solutions/0700-0799/letter-case-permutation.md similarity index 100% rename from "Solutions/0784. \345\255\227\346\257\215\345\244\247\345\260\217\345\206\231\345\205\250\346\216\222\345\210\227.md" rename to docs/solutions/0700-0799/letter-case-permutation.md diff --git "a/Solutions/0720. \350\257\215\345\205\270\344\270\255\346\234\200\351\225\277\347\232\204\345\215\225\350\257\215.md" b/docs/solutions/0700-0799/longest-word-in-dictionary.md similarity index 100% rename from "Solutions/0720. \350\257\215\345\205\270\344\270\255\346\234\200\351\225\277\347\232\204\345\215\225\350\257\215.md" rename to docs/solutions/0700-0799/longest-word-in-dictionary.md diff --git "a/Solutions/0718. \346\234\200\351\225\277\351\207\215\345\244\215\345\255\220\346\225\260\347\273\204.md" b/docs/solutions/0700-0799/maximum-length-of-repeated-subarray.md similarity index 100% rename from "Solutions/0718. \346\234\200\351\225\277\351\207\215\345\244\215\345\255\220\346\225\260\347\273\204.md" rename to docs/solutions/0700-0799/maximum-length-of-repeated-subarray.md diff --git "a/Solutions/0746. \344\275\277\347\224\250\346\234\200\345\260\217\350\212\261\350\264\271\347\210\254\346\245\274\346\242\257.md" b/docs/solutions/0700-0799/min-cost-climbing-stairs.md similarity index 100% rename from "Solutions/0746. \344\275\277\347\224\250\346\234\200\345\260\217\350\212\261\350\264\271\347\210\254\346\245\274\346\242\257.md" rename to docs/solutions/0700-0799/min-cost-climbing-stairs.md diff --git "a/Solutions/0783. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\350\212\202\347\202\271\346\234\200\345\260\217\350\267\235\347\246\273.md" b/docs/solutions/0700-0799/minimum-distance-between-bst-nodes.md similarity index 100% rename from "Solutions/0783. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\350\212\202\347\202\271\346\234\200\345\260\217\350\267\235\347\246\273.md" rename to docs/solutions/0700-0799/minimum-distance-between-bst-nodes.md diff --git "a/Solutions/0727. \346\234\200\345\260\217\347\252\227\345\217\243\345\255\220\345\272\217\345\210\227.md" b/docs/solutions/0700-0799/minimum-window-subsequence.md similarity index 100% rename from "Solutions/0727. \346\234\200\345\260\217\347\252\227\345\217\243\345\255\220\345\272\217\345\210\227.md" rename to docs/solutions/0700-0799/minimum-window-subsequence.md diff --git "a/Solutions/0738. \345\215\225\350\260\203\351\200\222\345\242\236\347\232\204\346\225\260\345\255\227.md" b/docs/solutions/0700-0799/monotone-increasing-digits.md similarity index 100% rename from "Solutions/0738. \345\215\225\350\260\203\351\200\222\345\242\236\347\232\204\346\225\260\345\255\227.md" rename to docs/solutions/0700-0799/monotone-increasing-digits.md diff --git "a/Solutions/0729. \346\210\221\347\232\204\346\227\245\347\250\213\345\256\211\346\216\222\350\241\250 I.md" b/docs/solutions/0700-0799/my-calendar-i.md similarity index 100% rename from "Solutions/0729. \346\210\221\347\232\204\346\227\245\347\250\213\345\256\211\346\216\222\350\241\250 I.md" rename to docs/solutions/0700-0799/my-calendar-i.md diff --git "a/Solutions/0731. \346\210\221\347\232\204\346\227\245\347\250\213\345\256\211\346\216\222\350\241\250 II.md" b/docs/solutions/0700-0799/my-calendar-ii.md similarity index 100% rename from "Solutions/0731. \346\210\221\347\232\204\346\227\245\347\250\213\345\256\211\346\216\222\350\241\250 II.md" rename to docs/solutions/0700-0799/my-calendar-ii.md diff --git "a/Solutions/0732. \346\210\221\347\232\204\346\227\245\347\250\213\345\256\211\346\216\222\350\241\250 III.md" b/docs/solutions/0700-0799/my-calendar-iii.md similarity index 100% rename from "Solutions/0732. \346\210\221\347\232\204\346\227\245\347\250\213\345\256\211\346\216\222\350\241\250 III.md" rename to docs/solutions/0700-0799/my-calendar-iii.md diff --git "a/Solutions/0795. \345\214\272\351\227\264\345\255\220\346\225\260\347\273\204\344\270\252\346\225\260.md" b/docs/solutions/0700-0799/number-of-subarrays-with-bounded-maximum.md similarity index 100% rename from "Solutions/0795. \345\214\272\351\227\264\345\255\220\346\225\260\347\273\204\344\270\252\346\225\260.md" rename to docs/solutions/0700-0799/number-of-subarrays-with-bounded-maximum.md diff --git "a/Solutions/0752. \346\211\223\345\274\200\350\275\254\347\233\230\351\224\201.md" b/docs/solutions/0700-0799/open-the-lock.md similarity index 100% rename from "Solutions/0752. \346\211\223\345\274\200\350\275\254\347\233\230\351\224\201.md" rename to docs/solutions/0700-0799/open-the-lock.md diff --git "a/Solutions/0763. \345\210\222\345\210\206\345\255\227\346\257\215\345\214\272\351\227\264.md" b/docs/solutions/0700-0799/partition-labels.md similarity index 100% rename from "Solutions/0763. \345\210\222\345\210\206\345\255\227\346\257\215\345\214\272\351\227\264.md" rename to docs/solutions/0700-0799/partition-labels.md diff --git "a/Solutions/0715. Range \346\250\241\345\235\227.md" b/docs/solutions/0700-0799/range-module.md similarity index 100% rename from "Solutions/0715. Range \346\250\241\345\235\227.md" rename to docs/solutions/0700-0799/range-module.md diff --git "a/Solutions/0796. \346\227\213\350\275\254\345\255\227\347\254\246\344\270\262.md" b/docs/solutions/0700-0799/rotate-string.md similarity index 100% rename from "Solutions/0796. \346\227\213\350\275\254\345\255\227\347\254\246\344\270\262.md" rename to docs/solutions/0700-0799/rotate-string.md diff --git "a/Solutions/0788. \346\227\213\350\275\254\346\225\260\345\255\227.md" b/docs/solutions/0700-0799/rotated-digits.md similarity index 100% rename from "Solutions/0788. \346\227\213\350\275\254\346\225\260\345\255\227.md" rename to docs/solutions/0700-0799/rotated-digits.md diff --git "a/Solutions/0700. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\344\270\255\347\232\204\346\220\234\347\264\242.md" b/docs/solutions/0700-0799/search-in-a-binary-search-tree.md similarity index 100% rename from "Solutions/0700. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\344\270\255\347\232\204\346\220\234\347\264\242.md" rename to docs/solutions/0700-0799/search-in-a-binary-search-tree.md diff --git "a/Solutions/0702. \346\220\234\347\264\242\351\225\277\345\272\246\346\234\252\347\237\245\347\232\204\346\234\211\345\272\217\346\225\260\347\273\204.md" b/docs/solutions/0700-0799/search-in-a-sorted-array-of-unknown-size.md similarity index 100% rename from "Solutions/0702. \346\220\234\347\264\242\351\225\277\345\272\246\346\234\252\347\237\245\347\232\204\346\234\211\345\272\217\346\225\260\347\273\204.md" rename to docs/solutions/0700-0799/search-in-a-sorted-array-of-unknown-size.md diff --git "a/Solutions/0713. \344\271\230\347\247\257\345\260\217\344\272\216 K \347\232\204\345\255\220\346\225\260\347\273\204.md" b/docs/solutions/0700-0799/subarray-product-less-than-k.md similarity index 100% rename from "Solutions/0713. \344\271\230\347\247\257\345\260\217\344\272\216 K \347\232\204\345\255\220\346\225\260\347\273\204.md" rename to docs/solutions/0700-0799/subarray-product-less-than-k.md diff --git "a/Solutions/0778. \346\260\264\344\275\215\344\270\212\345\215\207\347\232\204\346\263\263\346\261\240\344\270\255\346\270\270\346\263\263.md" b/docs/solutions/0700-0799/swim-in-rising-water.md similarity index 100% rename from "Solutions/0778. \346\260\264\344\275\215\344\270\212\345\215\207\347\232\204\346\263\263\346\261\240\344\270\255\346\270\270\346\263\263.md" rename to docs/solutions/0700-0799/swim-in-rising-water.md diff --git "a/Solutions/0709. \350\275\254\346\215\242\346\210\220\345\260\217\345\206\231\345\255\227\346\257\215.md" b/docs/solutions/0700-0799/to-lower-case.md similarity index 100% rename from "Solutions/0709. \350\275\254\346\215\242\346\210\220\345\260\217\345\206\231\345\255\227\346\257\215.md" rename to docs/solutions/0700-0799/to-lower-case.md diff --git "a/Solutions/0766. \346\211\230\346\231\256\345\210\251\350\214\250\347\237\251\351\230\265.md" b/docs/solutions/0700-0799/toeplitz-matrix.md similarity index 100% rename from "Solutions/0766. \346\211\230\346\231\256\345\210\251\350\214\250\347\237\251\351\230\265.md" rename to docs/solutions/0700-0799/toeplitz-matrix.md diff --git "a/Solutions/0844. \346\257\224\350\276\203\345\220\253\351\200\200\346\240\274\347\232\204\345\255\227\347\254\246\344\270\262.md" b/docs/solutions/0800-0899/backspace-string-compare.md similarity index 100% rename from "Solutions/0844. \346\257\224\350\276\203\345\220\253\351\200\200\346\240\274\347\232\204\345\255\227\347\254\246\344\270\262.md" rename to docs/solutions/0800-0899/backspace-string-compare.md diff --git "a/Solutions/0868. \344\272\214\350\277\233\345\210\266\351\227\264\350\267\235.md" b/docs/solutions/0800-0899/binary-gap.md similarity index 100% rename from "Solutions/0868. \344\272\214\350\277\233\345\210\266\351\227\264\350\267\235.md" rename to docs/solutions/0800-0899/binary-gap.md diff --git "a/Solutions/0814. \344\272\214\345\217\211\346\240\221\345\211\252\346\236\235.md" b/docs/solutions/0800-0899/binary-tree-pruning.md similarity index 100% rename from "Solutions/0814. \344\272\214\345\217\211\346\240\221\345\211\252\346\236\235.md" rename to docs/solutions/0800-0899/binary-tree-pruning.md diff --git "a/Solutions/0881. \346\225\221\347\224\237\350\211\207.md" b/docs/solutions/0800-0899/boats-to-save-people.md similarity index 100% rename from "Solutions/0881. \346\225\221\347\224\237\350\211\207.md" rename to docs/solutions/0800-0899/boats-to-save-people.md diff --git "a/Solutions/0803. \346\211\223\347\240\226\345\235\227.md" b/docs/solutions/0800-0899/bricks-falling-when-hit.md similarity index 100% rename from "Solutions/0803. \346\211\223\347\240\226\345\235\227.md" rename to docs/solutions/0800-0899/bricks-falling-when-hit.md diff --git "a/Solutions/0889. \346\240\271\346\215\256\345\211\215\345\272\217\345\222\214\345\220\216\345\272\217\351\201\215\345\216\206\346\236\204\351\200\240\344\272\214\345\217\211\346\240\221.md" b/docs/solutions/0800-0899/construct-binary-tree-from-preorder-and-postorder-traversal.md similarity index 100% rename from "Solutions/0889. \346\240\271\346\215\256\345\211\215\345\272\217\345\222\214\345\220\216\345\272\217\351\201\215\345\216\206\346\236\204\351\200\240\344\272\214\345\217\211\346\240\221.md" rename to docs/solutions/0800-0899/construct-binary-tree-from-preorder-and-postorder-traversal.md diff --git "a/Solutions/0802. \346\211\276\345\210\260\346\234\200\347\273\210\347\232\204\345\256\211\345\205\250\347\212\266\346\200\201.md" b/docs/solutions/0800-0899/find-eventual-safe-states.md similarity index 100% rename from "Solutions/0802. \346\211\276\345\210\260\346\234\200\347\273\210\347\232\204\345\256\211\345\205\250\347\212\266\346\200\201.md" rename to docs/solutions/0800-0899/find-eventual-safe-states.md diff --git "a/Solutions/0832. \347\277\273\350\275\254\345\233\276\345\203\217.md" b/docs/solutions/0800-0899/flipping-an-image.md similarity index 100% rename from "Solutions/0832. \347\277\273\350\275\254\345\233\276\345\203\217.md" rename to docs/solutions/0800-0899/flipping-an-image.md diff --git "a/Solutions/0824. \345\261\261\347\276\212\346\213\211\344\270\201\346\226\207.md" b/docs/solutions/0800-0899/goat-latin.md similarity index 100% rename from "Solutions/0824. \345\261\261\347\276\212\346\213\211\344\270\201\346\226\207.md" rename to docs/solutions/0800-0899/goat-latin.md diff --git "a/Solutions/0846. \344\270\200\346\211\213\351\241\272\345\255\220.md" b/docs/solutions/0800-0899/hand-of-straights.md similarity index 100% rename from "Solutions/0846. \344\270\200\346\211\213\351\241\272\345\255\220.md" rename to docs/solutions/0800-0899/hand-of-straights.md diff --git "a/Solutions/0897. \351\200\222\345\242\236\351\241\272\345\272\217\346\220\234\347\264\242\346\240\221.md" b/docs/solutions/0800-0899/increasing-order-search-tree.md similarity index 100% rename from "Solutions/0897. \351\200\222\345\242\236\351\241\272\345\272\217\346\220\234\347\264\242\346\240\221.md" rename to docs/solutions/0800-0899/increasing-order-search-tree.md diff --git a/docs/solutions/0800-0899/index.md b/docs/solutions/0800-0899/index.md new file mode 100644 index 00000000..21ad6d7e --- /dev/null +++ b/docs/solutions/0800-0899/index.md @@ -0,0 +1,43 @@ +## 本章内容 + +- [0800. 相似 RGB 颜色](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/similar-rgb-color.md) +- [0801. 使序列递增的最小交换次数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/minimum-swaps-to-make-sequences-increasing.md) +- [0802. 找到最终的安全状态](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/find-eventual-safe-states.md) +- [0803. 打砖块](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/bricks-falling-when-hit.md) +- [0804. 唯一摩尔斯密码词](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/unique-morse-code-words.md) +- [0806. 写字符串需要的行数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/number-of-lines-to-write-string.md) +- [0811. 子域名访问计数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/subdomain-visit-count.md) +- [0814. 二叉树剪枝](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/binary-tree-pruning.md) +- [0819. 最常见的单词](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/most-common-word.md) +- [0820. 单词的压缩编码](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/short-encoding-of-words.md) +- [0821. 字符的最短距离](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/shortest-distance-to-a-character.md) +- [0824. 山羊拉丁文](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/goat-latin.md) +- [0830. 较大分组的位置](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/positions-of-large-groups.md) +- [0832. 翻转图像](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/flipping-an-image.md) +- [0834. 树中距离之和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/sum-of-distances-in-tree.md) +- [0836. 矩形重叠](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/rectangle-overlap.md) +- [0841. 钥匙和房间](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/keys-and-rooms.md) +- [0844. 比较含退格的字符串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/backspace-string-compare.md) +- [0845. 数组中的最长山脉](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/longest-mountain-in-array.md) +- [0846. 一手顺子](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/hand-of-straights.md) +- [0847. 访问所有节点的最短路径](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/shortest-path-visiting-all-nodes.md) +- [0850. 矩形面积 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/rectangle-area-ii.md) +- [0851. 喧闹和富有](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/loud-and-rich.md) +- [0852. 山脉数组的峰顶索引](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/peak-index-in-a-mountain-array.md) +- [0860. 柠檬水找零](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/lemonade-change.md) +- [0861. 翻转矩阵后的得分](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/score-after-flipping-matrix.md) +- [0862. 和至少为 K 的最短子数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/shortest-subarray-with-sum-at-least-k.md) +- [0867. 转置矩阵](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/transpose-matrix.md) +- [0868. 二进制间距](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/binary-gap.md) +- [0872. 叶子相似的树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/leaf-similar-trees.md) +- [0873. 最长的斐波那契子序列的长度](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/length-of-longest-fibonacci-subsequence.md) +- [0875. 爱吃香蕉的珂珂](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/koko-eating-bananas.md) +- [0876. 链表的中间结点](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/middle-of-the-linked-list.md) +- [0877. 石子游戏](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/stone-game.md) +- [0881. 救生艇](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/boats-to-save-people.md) +- [0884. 两句话中的不常见单词](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/uncommon-words-from-two-sentences.md) +- [0886. 可能的二分法](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/possible-bipartition.md) +- [0887. 鸡蛋掉落](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/super-egg-drop.md) +- [0889. 根据前序和后序遍历构造二叉树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/construct-binary-tree-from-preorder-and-postorder-traversal.md) +- [0892. 三维形体的表面积](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/surface-area-of-3d-shapes.md) +- [0897. 递增顺序搜索树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/increasing-order-search-tree.md) diff --git "a/Solutions/0841. \351\222\245\345\214\231\345\222\214\346\210\277\351\227\264.md" b/docs/solutions/0800-0899/keys-and-rooms.md similarity index 100% rename from "Solutions/0841. \351\222\245\345\214\231\345\222\214\346\210\277\351\227\264.md" rename to docs/solutions/0800-0899/keys-and-rooms.md diff --git "a/Solutions/0875. \347\210\261\345\220\203\351\246\231\350\225\211\347\232\204\347\217\202\347\217\202.md" b/docs/solutions/0800-0899/koko-eating-bananas.md similarity index 100% rename from "Solutions/0875. \347\210\261\345\220\203\351\246\231\350\225\211\347\232\204\347\217\202\347\217\202.md" rename to docs/solutions/0800-0899/koko-eating-bananas.md diff --git "a/Solutions/0872. \345\217\266\345\255\220\347\233\270\344\274\274\347\232\204\346\240\221.md" b/docs/solutions/0800-0899/leaf-similar-trees.md similarity index 100% rename from "Solutions/0872. \345\217\266\345\255\220\347\233\270\344\274\274\347\232\204\346\240\221.md" rename to docs/solutions/0800-0899/leaf-similar-trees.md diff --git "a/Solutions/0860. \346\237\240\346\252\254\346\260\264\346\211\276\351\233\266.md" b/docs/solutions/0800-0899/lemonade-change.md similarity index 100% rename from "Solutions/0860. \346\237\240\346\252\254\346\260\264\346\211\276\351\233\266.md" rename to docs/solutions/0800-0899/lemonade-change.md diff --git "a/Solutions/0873. \346\234\200\351\225\277\347\232\204\346\226\220\346\263\242\351\202\243\345\245\221\345\255\220\345\272\217\345\210\227\347\232\204\351\225\277\345\272\246.md" b/docs/solutions/0800-0899/length-of-longest-fibonacci-subsequence.md similarity index 100% rename from "Solutions/0873. \346\234\200\351\225\277\347\232\204\346\226\220\346\263\242\351\202\243\345\245\221\345\255\220\345\272\217\345\210\227\347\232\204\351\225\277\345\272\246.md" rename to docs/solutions/0800-0899/length-of-longest-fibonacci-subsequence.md diff --git "a/Solutions/0845. \346\225\260\347\273\204\344\270\255\347\232\204\346\234\200\351\225\277\345\261\261\350\204\211.md" b/docs/solutions/0800-0899/longest-mountain-in-array.md similarity index 100% rename from "Solutions/0845. \346\225\260\347\273\204\344\270\255\347\232\204\346\234\200\351\225\277\345\261\261\350\204\211.md" rename to docs/solutions/0800-0899/longest-mountain-in-array.md diff --git "a/Solutions/0851. \345\226\247\351\227\271\345\222\214\345\257\214\346\234\211.md" b/docs/solutions/0800-0899/loud-and-rich.md similarity index 100% rename from "Solutions/0851. \345\226\247\351\227\271\345\222\214\345\257\214\346\234\211.md" rename to docs/solutions/0800-0899/loud-and-rich.md diff --git "a/Solutions/0876. \351\223\276\350\241\250\347\232\204\344\270\255\351\227\264\347\273\223\347\202\271.md" b/docs/solutions/0800-0899/middle-of-the-linked-list.md similarity index 100% rename from "Solutions/0876. \351\223\276\350\241\250\347\232\204\344\270\255\351\227\264\347\273\223\347\202\271.md" rename to docs/solutions/0800-0899/middle-of-the-linked-list.md diff --git "a/Solutions/0801. \344\275\277\345\272\217\345\210\227\351\200\222\345\242\236\347\232\204\346\234\200\345\260\217\344\272\244\346\215\242\346\254\241\346\225\260.md" b/docs/solutions/0800-0899/minimum-swaps-to-make-sequences-increasing.md similarity index 100% rename from "Solutions/0801. \344\275\277\345\272\217\345\210\227\351\200\222\345\242\236\347\232\204\346\234\200\345\260\217\344\272\244\346\215\242\346\254\241\346\225\260.md" rename to docs/solutions/0800-0899/minimum-swaps-to-make-sequences-increasing.md diff --git "a/Solutions/0819. \346\234\200\345\270\270\350\247\201\347\232\204\345\215\225\350\257\215.md" b/docs/solutions/0800-0899/most-common-word.md similarity index 100% rename from "Solutions/0819. \346\234\200\345\270\270\350\247\201\347\232\204\345\215\225\350\257\215.md" rename to docs/solutions/0800-0899/most-common-word.md diff --git "a/Solutions/0806. \345\206\231\345\255\227\347\254\246\344\270\262\351\234\200\350\246\201\347\232\204\350\241\214\346\225\260.md" b/docs/solutions/0800-0899/number-of-lines-to-write-string.md similarity index 100% rename from "Solutions/0806. \345\206\231\345\255\227\347\254\246\344\270\262\351\234\200\350\246\201\347\232\204\350\241\214\346\225\260.md" rename to docs/solutions/0800-0899/number-of-lines-to-write-string.md diff --git "a/Solutions/0852. \345\261\261\350\204\211\346\225\260\347\273\204\347\232\204\345\263\260\351\241\266\347\264\242\345\274\225.md" b/docs/solutions/0800-0899/peak-index-in-a-mountain-array.md similarity index 100% rename from "Solutions/0852. \345\261\261\350\204\211\346\225\260\347\273\204\347\232\204\345\263\260\351\241\266\347\264\242\345\274\225.md" rename to docs/solutions/0800-0899/peak-index-in-a-mountain-array.md diff --git "a/Solutions/0830. \350\276\203\345\244\247\345\210\206\347\273\204\347\232\204\344\275\215\347\275\256.md" b/docs/solutions/0800-0899/positions-of-large-groups.md similarity index 100% rename from "Solutions/0830. \350\276\203\345\244\247\345\210\206\347\273\204\347\232\204\344\275\215\347\275\256.md" rename to docs/solutions/0800-0899/positions-of-large-groups.md diff --git "a/Solutions/0886. \345\217\257\350\203\275\347\232\204\344\272\214\345\210\206\346\263\225.md" b/docs/solutions/0800-0899/possible-bipartition.md similarity index 100% rename from "Solutions/0886. \345\217\257\350\203\275\347\232\204\344\272\214\345\210\206\346\263\225.md" rename to docs/solutions/0800-0899/possible-bipartition.md diff --git "a/Solutions/0850. \347\237\251\345\275\242\351\235\242\347\247\257 II.md" b/docs/solutions/0800-0899/rectangle-area-ii.md similarity index 100% rename from "Solutions/0850. \347\237\251\345\275\242\351\235\242\347\247\257 II.md" rename to docs/solutions/0800-0899/rectangle-area-ii.md diff --git "a/Solutions/0836. \347\237\251\345\275\242\351\207\215\345\217\240.md" b/docs/solutions/0800-0899/rectangle-overlap.md similarity index 100% rename from "Solutions/0836. \347\237\251\345\275\242\351\207\215\345\217\240.md" rename to docs/solutions/0800-0899/rectangle-overlap.md diff --git "a/Solutions/0861. \347\277\273\350\275\254\347\237\251\351\230\265\345\220\216\347\232\204\345\276\227\345\210\206.md" b/docs/solutions/0800-0899/score-after-flipping-matrix.md similarity index 100% rename from "Solutions/0861. \347\277\273\350\275\254\347\237\251\351\230\265\345\220\216\347\232\204\345\276\227\345\210\206.md" rename to docs/solutions/0800-0899/score-after-flipping-matrix.md diff --git "a/Solutions/0820. \345\215\225\350\257\215\347\232\204\345\216\213\347\274\251\347\274\226\347\240\201.md" b/docs/solutions/0800-0899/short-encoding-of-words.md similarity index 100% rename from "Solutions/0820. \345\215\225\350\257\215\347\232\204\345\216\213\347\274\251\347\274\226\347\240\201.md" rename to docs/solutions/0800-0899/short-encoding-of-words.md diff --git "a/Solutions/0821. \345\255\227\347\254\246\347\232\204\346\234\200\347\237\255\350\267\235\347\246\273.md" b/docs/solutions/0800-0899/shortest-distance-to-a-character.md similarity index 100% rename from "Solutions/0821. \345\255\227\347\254\246\347\232\204\346\234\200\347\237\255\350\267\235\347\246\273.md" rename to docs/solutions/0800-0899/shortest-distance-to-a-character.md diff --git "a/Solutions/0847. \350\256\277\351\227\256\346\211\200\346\234\211\350\212\202\347\202\271\347\232\204\346\234\200\347\237\255\350\267\257\345\276\204.md" b/docs/solutions/0800-0899/shortest-path-visiting-all-nodes.md similarity index 100% rename from "Solutions/0847. \350\256\277\351\227\256\346\211\200\346\234\211\350\212\202\347\202\271\347\232\204\346\234\200\347\237\255\350\267\257\345\276\204.md" rename to docs/solutions/0800-0899/shortest-path-visiting-all-nodes.md diff --git "a/Solutions/0862. \345\222\214\350\207\263\345\260\221\344\270\272 K \347\232\204\346\234\200\347\237\255\345\255\220\346\225\260\347\273\204.md" b/docs/solutions/0800-0899/shortest-subarray-with-sum-at-least-k.md similarity index 100% rename from "Solutions/0862. \345\222\214\350\207\263\345\260\221\344\270\272 K \347\232\204\346\234\200\347\237\255\345\255\220\346\225\260\347\273\204.md" rename to docs/solutions/0800-0899/shortest-subarray-with-sum-at-least-k.md diff --git "a/Solutions/0800. \347\233\270\344\274\274 RGB \351\242\234\350\211\262.md" b/docs/solutions/0800-0899/similar-rgb-color.md similarity index 100% rename from "Solutions/0800. \347\233\270\344\274\274 RGB \351\242\234\350\211\262.md" rename to docs/solutions/0800-0899/similar-rgb-color.md diff --git "a/Solutions/0877. \347\237\263\345\255\220\346\270\270\346\210\217.md" b/docs/solutions/0800-0899/stone-game.md similarity index 100% rename from "Solutions/0877. \347\237\263\345\255\220\346\270\270\346\210\217.md" rename to docs/solutions/0800-0899/stone-game.md diff --git "a/Solutions/0811. \345\255\220\345\237\237\345\220\215\350\256\277\351\227\256\350\256\241\346\225\260.md" b/docs/solutions/0800-0899/subdomain-visit-count.md similarity index 100% rename from "Solutions/0811. \345\255\220\345\237\237\345\220\215\350\256\277\351\227\256\350\256\241\346\225\260.md" rename to docs/solutions/0800-0899/subdomain-visit-count.md diff --git "a/Solutions/0834. \346\240\221\344\270\255\350\267\235\347\246\273\344\271\213\345\222\214.md" b/docs/solutions/0800-0899/sum-of-distances-in-tree.md similarity index 100% rename from "Solutions/0834. \346\240\221\344\270\255\350\267\235\347\246\273\344\271\213\345\222\214.md" rename to docs/solutions/0800-0899/sum-of-distances-in-tree.md diff --git "a/Solutions/0887. \351\270\241\350\233\213\346\216\211\350\220\275.md" b/docs/solutions/0800-0899/super-egg-drop.md similarity index 100% rename from "Solutions/0887. \351\270\241\350\233\213\346\216\211\350\220\275.md" rename to docs/solutions/0800-0899/super-egg-drop.md diff --git "a/Solutions/0892. \344\270\211\347\273\264\345\275\242\344\275\223\347\232\204\350\241\250\351\235\242\347\247\257.md" b/docs/solutions/0800-0899/surface-area-of-3d-shapes.md similarity index 100% rename from "Solutions/0892. \344\270\211\347\273\264\345\275\242\344\275\223\347\232\204\350\241\250\351\235\242\347\247\257.md" rename to docs/solutions/0800-0899/surface-area-of-3d-shapes.md diff --git "a/Solutions/0867. \350\275\254\347\275\256\347\237\251\351\230\265.md" b/docs/solutions/0800-0899/transpose-matrix.md similarity index 100% rename from "Solutions/0867. \350\275\254\347\275\256\347\237\251\351\230\265.md" rename to docs/solutions/0800-0899/transpose-matrix.md diff --git "a/Solutions/0884. \344\270\244\345\217\245\350\257\235\344\270\255\347\232\204\344\270\215\345\270\270\350\247\201\345\215\225\350\257\215.md" b/docs/solutions/0800-0899/uncommon-words-from-two-sentences.md similarity index 100% rename from "Solutions/0884. \344\270\244\345\217\245\350\257\235\344\270\255\347\232\204\344\270\215\345\270\270\350\247\201\345\215\225\350\257\215.md" rename to docs/solutions/0800-0899/uncommon-words-from-two-sentences.md diff --git "a/Solutions/0804. \345\224\257\344\270\200\346\221\251\345\260\224\346\226\257\345\257\206\347\240\201\350\257\215.md" b/docs/solutions/0800-0899/unique-morse-code-words.md similarity index 100% rename from "Solutions/0804. \345\224\257\344\270\200\346\221\251\345\260\224\346\226\257\345\257\206\347\240\201\350\257\215.md" rename to docs/solutions/0800-0899/unique-morse-code-words.md diff --git "a/Solutions/0999. \345\217\257\344\273\245\350\242\253\344\270\200\346\255\245\346\215\225\350\216\267\347\232\204\346\243\213\345\255\220\346\225\260.md" b/docs/solutions/0900-0999/available-captures-for-rook.md similarity index 100% rename from "Solutions/0999. \345\217\257\344\273\245\350\242\253\344\270\200\346\255\245\346\215\225\350\216\267\347\232\204\346\243\213\345\255\220\346\225\260.md" rename to docs/solutions/0900-0999/available-captures-for-rook.md diff --git "a/Solutions/0932. \346\274\202\344\272\256\346\225\260\347\273\204.md" b/docs/solutions/0900-0999/beautiful-array.md similarity index 100% rename from "Solutions/0932. \346\274\202\344\272\256\346\225\260\347\273\204.md" rename to docs/solutions/0900-0999/beautiful-array.md diff --git "a/Solutions/0968. \347\233\221\346\216\247\344\272\214\345\217\211\346\240\221.md" b/docs/solutions/0900-0999/binary-tree-cameras.md similarity index 100% rename from "Solutions/0968. \347\233\221\346\216\247\344\272\214\345\217\211\346\240\221.md" rename to docs/solutions/0900-0999/binary-tree-cameras.md diff --git "a/Solutions/0958. \344\272\214\345\217\211\346\240\221\347\232\204\345\256\214\345\205\250\346\200\247\346\243\200\351\252\214.md" b/docs/solutions/0900-0999/check-completeness-of-a-binary-tree.md similarity index 100% rename from "Solutions/0958. \344\272\214\345\217\211\346\240\221\347\232\204\345\256\214\345\205\250\346\200\247\346\243\200\351\252\214.md" rename to docs/solutions/0900-0999/check-completeness-of-a-binary-tree.md diff --git "a/Solutions/0919. \345\256\214\345\205\250\344\272\214\345\217\211\346\240\221\346\217\222\345\205\245\345\231\250.md" b/docs/solutions/0900-0999/complete-binary-tree-inserter.md similarity index 100% rename from "Solutions/0919. \345\256\214\345\205\250\344\272\214\345\217\211\346\240\221\346\217\222\345\205\245\345\231\250.md" rename to docs/solutions/0900-0999/complete-binary-tree-inserter.md diff --git "a/Solutions/0993. \344\272\214\345\217\211\346\240\221\347\232\204\345\240\202\345\205\204\345\274\237\350\212\202\347\202\271.md" b/docs/solutions/0900-0999/cousins-in-binary-tree.md similarity index 100% rename from "Solutions/0993. \344\272\214\345\217\211\346\240\221\347\232\204\345\240\202\345\205\204\345\274\237\350\212\202\347\202\271.md" rename to docs/solutions/0900-0999/cousins-in-binary-tree.md diff --git "a/Solutions/0904. \346\260\264\346\236\234\346\210\220\347\257\256.md" b/docs/solutions/0900-0999/fruit-into-baskets.md similarity index 100% rename from "Solutions/0904. \346\260\264\346\236\234\346\210\220\347\257\256.md" rename to docs/solutions/0900-0999/fruit-into-baskets.md diff --git a/docs/solutions/0900-0999/index.md b/docs/solutions/0900-0999/index.md new file mode 100644 index 00000000..3904cd2a --- /dev/null +++ b/docs/solutions/0900-0999/index.md @@ -0,0 +1,33 @@ +## 本章内容 + +- [0900. RLE 迭代器](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/rle-iterator.md) +- [0901. 股票价格跨度](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/online-stock-span.md) +- [0902. 最大为 N 的数字组合](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/numbers-at-most-n-given-digit-set.md) +- [0904. 水果成篮](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/fruit-into-baskets.md) +- [0908. 最小差值 I](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/smallest-range-i.md) +- [0912. 排序数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md) +- [0918. 环形子数组的最大和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/maximum-sum-circular-subarray.md) +- [0919. 完全二叉树插入器](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/complete-binary-tree-inserter.md) +- [0921. 使括号有效的最少添加](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/minimum-add-to-make-parentheses-valid.md) +- [0925. 长按键入](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/long-pressed-name.md) +- [0932. 漂亮数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/beautiful-array.md) +- [0933. 最近的请求次数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/number-of-recent-calls.md) +- [0935. 骑士拨号器](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/knight-dialer.md) +- [0938. 二叉搜索树的范围和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/range-sum-of-bst.md) +- [0946. 验证栈序列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/validate-stack-sequences.md) +- [0947. 移除最多的同行或同列石头](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/most-stones-removed-with-same-row-or-column.md) +- [0953. 验证外星语词典](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/verifying-an-alien-dictionary.md) +- [0958. 二叉树的完全性检验](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/check-completeness-of-a-binary-tree.md) +- [0959. 由斜杠划分区域](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/regions-cut-by-slashes.md) +- [0968. 监控二叉树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/binary-tree-cameras.md) +- [0973. 最接近原点的 K 个点](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/k-closest-points-to-origin.md) +- [0974. 和可被 K 整除的子数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/subarray-sums-divisible-by-k.md) +- [0976. 三角形的最大周长](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/largest-perimeter-triangle.md) +- [0977. 有序数组的平方](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/squares-of-a-sorted-array.md) +- [0978. 最长湍流子数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/longest-turbulent-subarray.md) +- [0982. 按位与为零的三元组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/triples-with-bitwise-and-equal-to-zero.md) +- [0990. 等式方程的可满足性](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/satisfiability-of-equality-equations.md) +- [0992. K 个不同整数的子数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/subarrays-with-k-different-integers.md) +- [0993. 二叉树的堂兄弟节点](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/cousins-in-binary-tree.md) +- [0995. K 连续位的最小翻转次数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/minimum-number-of-k-consecutive-bit-flips.md) +- [0999. 可以被一步捕获的棋子数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/available-captures-for-rook.md) diff --git "a/Solutions/0973. \346\234\200\346\216\245\350\277\221\345\216\237\347\202\271\347\232\204 K \344\270\252\347\202\271.md" b/docs/solutions/0900-0999/k-closest-points-to-origin.md similarity index 100% rename from "Solutions/0973. \346\234\200\346\216\245\350\277\221\345\216\237\347\202\271\347\232\204 K \344\270\252\347\202\271.md" rename to docs/solutions/0900-0999/k-closest-points-to-origin.md diff --git "a/Solutions/0935. \351\252\221\345\243\253\346\213\250\345\217\267\345\231\250.md" b/docs/solutions/0900-0999/knight-dialer.md similarity index 100% rename from "Solutions/0935. \351\252\221\345\243\253\346\213\250\345\217\267\345\231\250.md" rename to docs/solutions/0900-0999/knight-dialer.md diff --git "a/Solutions/0976. \344\270\211\350\247\222\345\275\242\347\232\204\346\234\200\345\244\247\345\221\250\351\225\277.md" b/docs/solutions/0900-0999/largest-perimeter-triangle.md similarity index 100% rename from "Solutions/0976. \344\270\211\350\247\222\345\275\242\347\232\204\346\234\200\345\244\247\345\221\250\351\225\277.md" rename to docs/solutions/0900-0999/largest-perimeter-triangle.md diff --git "a/Solutions/0925. \351\225\277\346\214\211\351\224\256\345\205\245.md" b/docs/solutions/0900-0999/long-pressed-name.md similarity index 100% rename from "Solutions/0925. \351\225\277\346\214\211\351\224\256\345\205\245.md" rename to docs/solutions/0900-0999/long-pressed-name.md diff --git "a/Solutions/0978. \346\234\200\351\225\277\346\271\215\346\265\201\345\255\220\346\225\260\347\273\204.md" b/docs/solutions/0900-0999/longest-turbulent-subarray.md similarity index 100% rename from "Solutions/0978. \346\234\200\351\225\277\346\271\215\346\265\201\345\255\220\346\225\260\347\273\204.md" rename to docs/solutions/0900-0999/longest-turbulent-subarray.md diff --git "a/Solutions/0918. \347\216\257\345\275\242\345\255\220\346\225\260\347\273\204\347\232\204\346\234\200\345\244\247\345\222\214.md" b/docs/solutions/0900-0999/maximum-sum-circular-subarray.md similarity index 100% rename from "Solutions/0918. \347\216\257\345\275\242\345\255\220\346\225\260\347\273\204\347\232\204\346\234\200\345\244\247\345\222\214.md" rename to docs/solutions/0900-0999/maximum-sum-circular-subarray.md diff --git "a/Solutions/0921. \344\275\277\346\213\254\345\217\267\346\234\211\346\225\210\347\232\204\346\234\200\345\260\221\346\267\273\345\212\240.md" b/docs/solutions/0900-0999/minimum-add-to-make-parentheses-valid.md similarity index 100% rename from "Solutions/0921. \344\275\277\346\213\254\345\217\267\346\234\211\346\225\210\347\232\204\346\234\200\345\260\221\346\267\273\345\212\240.md" rename to docs/solutions/0900-0999/minimum-add-to-make-parentheses-valid.md diff --git "a/Solutions/0995. K \350\277\236\347\273\255\344\275\215\347\232\204\346\234\200\345\260\217\347\277\273\350\275\254\346\254\241\346\225\260.md" b/docs/solutions/0900-0999/minimum-number-of-k-consecutive-bit-flips.md similarity index 100% rename from "Solutions/0995. K \350\277\236\347\273\255\344\275\215\347\232\204\346\234\200\345\260\217\347\277\273\350\275\254\346\254\241\346\225\260.md" rename to docs/solutions/0900-0999/minimum-number-of-k-consecutive-bit-flips.md diff --git "a/Solutions/0947. \347\247\273\351\231\244\346\234\200\345\244\232\347\232\204\345\220\214\350\241\214\346\210\226\345\220\214\345\210\227\347\237\263\345\244\264.md" b/docs/solutions/0900-0999/most-stones-removed-with-same-row-or-column.md similarity index 100% rename from "Solutions/0947. \347\247\273\351\231\244\346\234\200\345\244\232\347\232\204\345\220\214\350\241\214\346\210\226\345\220\214\345\210\227\347\237\263\345\244\264.md" rename to docs/solutions/0900-0999/most-stones-removed-with-same-row-or-column.md diff --git "a/Solutions/0933. \346\234\200\350\277\221\347\232\204\350\257\267\346\261\202\346\254\241\346\225\260.md" b/docs/solutions/0900-0999/number-of-recent-calls.md similarity index 100% rename from "Solutions/0933. \346\234\200\350\277\221\347\232\204\350\257\267\346\261\202\346\254\241\346\225\260.md" rename to docs/solutions/0900-0999/number-of-recent-calls.md diff --git "a/Solutions/0902. \346\234\200\345\244\247\344\270\272 N \347\232\204\346\225\260\345\255\227\347\273\204\345\220\210.md" b/docs/solutions/0900-0999/numbers-at-most-n-given-digit-set.md similarity index 100% rename from "Solutions/0902. \346\234\200\345\244\247\344\270\272 N \347\232\204\346\225\260\345\255\227\347\273\204\345\220\210.md" rename to docs/solutions/0900-0999/numbers-at-most-n-given-digit-set.md diff --git "a/Solutions/0901. \350\202\241\347\245\250\344\273\267\346\240\274\350\267\250\345\272\246.md" b/docs/solutions/0900-0999/online-stock-span.md similarity index 100% rename from "Solutions/0901. \350\202\241\347\245\250\344\273\267\346\240\274\350\267\250\345\272\246.md" rename to docs/solutions/0900-0999/online-stock-span.md diff --git "a/Solutions/0938. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\347\232\204\350\214\203\345\233\264\345\222\214.md" b/docs/solutions/0900-0999/range-sum-of-bst.md similarity index 100% rename from "Solutions/0938. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\347\232\204\350\214\203\345\233\264\345\222\214.md" rename to docs/solutions/0900-0999/range-sum-of-bst.md diff --git "a/Solutions/0959. \347\224\261\346\226\234\346\235\240\345\210\222\345\210\206\345\214\272\345\237\237.md" b/docs/solutions/0900-0999/regions-cut-by-slashes.md similarity index 100% rename from "Solutions/0959. \347\224\261\346\226\234\346\235\240\345\210\222\345\210\206\345\214\272\345\237\237.md" rename to docs/solutions/0900-0999/regions-cut-by-slashes.md diff --git "a/Solutions/0900. RLE \350\277\255\344\273\243\345\231\250.md" b/docs/solutions/0900-0999/rle-iterator.md similarity index 100% rename from "Solutions/0900. RLE \350\277\255\344\273\243\345\231\250.md" rename to docs/solutions/0900-0999/rle-iterator.md diff --git "a/Solutions/0990. \347\255\211\345\274\217\346\226\271\347\250\213\347\232\204\345\217\257\346\273\241\350\266\263\346\200\247.md" b/docs/solutions/0900-0999/satisfiability-of-equality-equations.md similarity index 100% rename from "Solutions/0990. \347\255\211\345\274\217\346\226\271\347\250\213\347\232\204\345\217\257\346\273\241\350\266\263\346\200\247.md" rename to docs/solutions/0900-0999/satisfiability-of-equality-equations.md diff --git "a/Solutions/0908. \346\234\200\345\260\217\345\267\256\345\200\274 I.md" b/docs/solutions/0900-0999/smallest-range-i.md similarity index 100% rename from "Solutions/0908. \346\234\200\345\260\217\345\267\256\345\200\274 I.md" rename to docs/solutions/0900-0999/smallest-range-i.md diff --git "a/Solutions/0912. \346\216\222\345\272\217\346\225\260\347\273\204.md" b/docs/solutions/0900-0999/sort-an-array.md similarity index 100% rename from "Solutions/0912. \346\216\222\345\272\217\346\225\260\347\273\204.md" rename to docs/solutions/0900-0999/sort-an-array.md diff --git "a/Solutions/0977. \346\234\211\345\272\217\346\225\260\347\273\204\347\232\204\345\271\263\346\226\271.md" b/docs/solutions/0900-0999/squares-of-a-sorted-array.md similarity index 100% rename from "Solutions/0977. \346\234\211\345\272\217\346\225\260\347\273\204\347\232\204\345\271\263\346\226\271.md" rename to docs/solutions/0900-0999/squares-of-a-sorted-array.md diff --git "a/Solutions/0974. \345\222\214\345\217\257\350\242\253 K \346\225\264\351\231\244\347\232\204\345\255\220\346\225\260\347\273\204.md" b/docs/solutions/0900-0999/subarray-sums-divisible-by-k.md similarity index 100% rename from "Solutions/0974. \345\222\214\345\217\257\350\242\253 K \346\225\264\351\231\244\347\232\204\345\255\220\346\225\260\347\273\204.md" rename to docs/solutions/0900-0999/subarray-sums-divisible-by-k.md diff --git "a/Solutions/0992. K \344\270\252\344\270\215\345\220\214\346\225\264\346\225\260\347\232\204\345\255\220\346\225\260\347\273\204.md" b/docs/solutions/0900-0999/subarrays-with-k-different-integers.md similarity index 100% rename from "Solutions/0992. K \344\270\252\344\270\215\345\220\214\346\225\264\346\225\260\347\232\204\345\255\220\346\225\260\347\273\204.md" rename to docs/solutions/0900-0999/subarrays-with-k-different-integers.md diff --git "a/Solutions/0982. \346\214\211\344\275\215\344\270\216\344\270\272\351\233\266\347\232\204\344\270\211\345\205\203\347\273\204.md" b/docs/solutions/0900-0999/triples-with-bitwise-and-equal-to-zero.md similarity index 100% rename from "Solutions/0982. \346\214\211\344\275\215\344\270\216\344\270\272\351\233\266\347\232\204\344\270\211\345\205\203\347\273\204.md" rename to docs/solutions/0900-0999/triples-with-bitwise-and-equal-to-zero.md diff --git "a/Solutions/0946. \351\252\214\350\257\201\346\240\210\345\272\217\345\210\227.md" b/docs/solutions/0900-0999/validate-stack-sequences.md similarity index 100% rename from "Solutions/0946. \351\252\214\350\257\201\346\240\210\345\272\217\345\210\227.md" rename to docs/solutions/0900-0999/validate-stack-sequences.md diff --git "a/Solutions/0953. \351\252\214\350\257\201\345\244\226\346\230\237\350\257\255\350\257\215\345\205\270.md" b/docs/solutions/0900-0999/verifying-an-alien-dictionary.md similarity index 100% rename from "Solutions/0953. \351\252\214\350\257\201\345\244\226\346\230\237\350\257\255\350\257\215\345\205\270.md" rename to docs/solutions/0900-0999/verifying-an-alien-dictionary.md diff --git "a/Solutions/1014. \346\234\200\344\275\263\350\247\202\345\205\211\347\273\204\345\220\210.md" b/docs/solutions/1000-1099/best-sightseeing-pair.md similarity index 100% rename from "Solutions/1014. \346\234\200\344\275\263\350\247\202\345\205\211\347\273\204\345\220\210.md" rename to docs/solutions/1000-1099/best-sightseeing-pair.md diff --git "a/Solutions/1038. \344\273\216\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\345\210\260\346\233\264\345\244\247\345\222\214\346\240\221.md" b/docs/solutions/1000-1099/binary-search-tree-to-greater-sum-tree.md similarity index 100% rename from "Solutions/1038. \344\273\216\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\345\210\260\346\233\264\345\244\247\345\222\214\346\240\221.md" rename to docs/solutions/1000-1099/binary-search-tree-to-greater-sum-tree.md diff --git "a/Solutions/1023. \351\251\274\345\263\260\345\274\217\345\214\271\351\205\215.md" b/docs/solutions/1000-1099/camelcase-matching.md similarity index 100% rename from "Solutions/1023. \351\251\274\345\263\260\345\274\217\345\214\271\351\205\215.md" rename to docs/solutions/1000-1099/camelcase-matching.md diff --git "a/Solutions/1011. \345\234\250 D \345\244\251\345\206\205\351\200\201\350\276\276\345\214\205\350\243\271\347\232\204\350\203\275\345\212\233.md" b/docs/solutions/1000-1099/capacity-to-ship-packages-within-d-days.md similarity index 100% rename from "Solutions/1011. \345\234\250 D \345\244\251\345\206\205\351\200\201\350\276\276\345\214\205\350\243\271\347\232\204\350\203\275\345\212\233.md" rename to docs/solutions/1000-1099/capacity-to-ship-packages-within-d-days.md diff --git "a/Solutions/1034. \350\276\271\347\225\214\347\235\200\350\211\262.md" b/docs/solutions/1000-1099/coloring-a-border.md similarity index 100% rename from "Solutions/1034. \350\276\271\347\225\214\347\235\200\350\211\262.md" rename to docs/solutions/1000-1099/coloring-a-border.md diff --git "a/Solutions/1009. \345\215\201\350\277\233\345\210\266\346\225\264\346\225\260\347\232\204\345\217\215\347\240\201.md" b/docs/solutions/1000-1099/complement-of-base-10-integer.md similarity index 100% rename from "Solutions/1009. \345\215\201\350\277\233\345\210\266\346\225\264\346\225\260\347\232\204\345\217\215\347\240\201.md" rename to docs/solutions/1000-1099/complement-of-base-10-integer.md diff --git "a/Solutions/1008. \345\211\215\345\272\217\351\201\215\345\216\206\346\236\204\351\200\240\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221.md" b/docs/solutions/1000-1099/construct-binary-search-tree-from-preorder-traversal.md similarity index 100% rename from "Solutions/1008. \345\211\215\345\272\217\351\201\215\345\216\206\346\236\204\351\200\240\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221.md" rename to docs/solutions/1000-1099/construct-binary-search-tree-from-preorder-traversal.md diff --git "a/Solutions/1025. \351\231\244\346\225\260\345\215\232\345\274\210.md" b/docs/solutions/1000-1099/divisor-game.md similarity index 100% rename from "Solutions/1025. \351\231\244\346\225\260\345\215\232\345\274\210.md" rename to docs/solutions/1000-1099/divisor-game.md diff --git "a/Solutions/1089. \345\244\215\345\206\231\351\233\266.md" b/docs/solutions/1000-1099/duplicate-zeros.md similarity index 100% rename from "Solutions/1089. \345\244\215\345\206\231\351\233\266.md" rename to docs/solutions/1000-1099/duplicate-zeros.md diff --git "a/Solutions/1002. \346\237\245\346\211\276\345\205\261\347\224\250\345\255\227\347\254\246.md" b/docs/solutions/1000-1099/find-common-characters.md similarity index 100% rename from "Solutions/1002. \346\237\245\346\211\276\345\205\261\347\224\250\345\255\227\347\254\246.md" rename to docs/solutions/1000-1099/find-common-characters.md diff --git "a/Solutions/1095. \345\261\261\350\204\211\346\225\260\347\273\204\344\270\255\346\237\245\346\211\276\347\233\256\346\240\207\345\200\274.md" b/docs/solutions/1000-1099/find-in-mountain-array.md similarity index 100% rename from "Solutions/1095. \345\261\261\350\204\211\346\225\260\347\273\204\344\270\255\346\237\245\346\211\276\347\233\256\346\240\207\345\200\274.md" rename to docs/solutions/1000-1099/find-in-mountain-array.md diff --git "a/Solutions/1052. \347\210\261\347\224\237\346\260\224\347\232\204\344\271\246\345\272\227\350\200\201\346\235\277.md" b/docs/solutions/1000-1099/grumpy-bookstore-owner.md similarity index 100% rename from "Solutions/1052. \347\210\261\347\224\237\346\260\224\347\232\204\344\271\246\345\272\227\350\200\201\346\235\277.md" rename to docs/solutions/1000-1099/grumpy-bookstore-owner.md diff --git "a/Solutions/1051. \351\253\230\345\272\246\346\243\200\346\237\245\345\231\250.md" b/docs/solutions/1000-1099/height-checker.md similarity index 100% rename from "Solutions/1051. \351\253\230\345\272\246\346\243\200\346\237\245\345\231\250.md" rename to docs/solutions/1000-1099/height-checker.md diff --git "a/Solutions/1065. \345\255\227\347\254\246\344\270\262\347\232\204\347\264\242\345\274\225\345\257\271.md" b/docs/solutions/1000-1099/index-pairs-of-a-string.md similarity index 100% rename from "Solutions/1065. \345\255\227\347\254\246\344\270\262\347\232\204\347\264\242\345\274\225\345\257\271.md" rename to docs/solutions/1000-1099/index-pairs-of-a-string.md diff --git a/docs/solutions/1000-1099/index.md b/docs/solutions/1000-1099/index.md new file mode 100644 index 00000000..009d52e9 --- /dev/null +++ b/docs/solutions/1000-1099/index.md @@ -0,0 +1,34 @@ +## 本章内容 + +- [1000. 合并石头的最低成本](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/minimum-cost-to-merge-stones.md) +- [1002. 查找共用字符](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/find-common-characters.md) +- [1004. 最大连续1的个数 III](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/max-consecutive-ones-iii.md) +- [1005. K 次取反后最大化的数组和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/maximize-sum-of-array-after-k-negations.md) +- [1008. 前序遍历构造二叉搜索树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/construct-binary-search-tree-from-preorder-traversal.md) +- [1009. 十进制整数的反码](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/complement-of-base-10-integer.md) +- [1011. 在 D 天内送达包裹的能力](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/capacity-to-ship-packages-within-d-days.md) +- [1012. 至少有 1 位重复的数字](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/numbers-with-repeated-digits.md) +- [1014. 最佳观光组合](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/best-sightseeing-pair.md) +- [1020. 飞地的数量](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/number-of-enclaves.md) +- [1021. 删除最外层的括号](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/remove-outermost-parentheses.md) +- [1023. 驼峰式匹配](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/camelcase-matching.md) +- [1025. 除数博弈](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/divisor-game.md) +- [1028. 从先序遍历还原二叉树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/recover-a-tree-from-preorder-traversal.md) +- [1029. 两地调度](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/two-city-scheduling.md) +- [1034. 边界着色](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/coloring-a-border.md) +- [1035. 不相交的线](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/uncrossed-lines.md) +- [1037. 有效的回旋镖](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/valid-boomerang.md) +- [1038. 从二叉搜索树到更大和树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/binary-search-tree-to-greater-sum-tree.md) +- [1039. 多边形三角剖分的最低得分](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/minimum-score-triangulation-of-polygon.md) +- [1041. 困于环中的机器人](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/robot-bounded-in-circle.md) +- [1047. 删除字符串中的所有相邻重复项](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/remove-all-adjacent-duplicates-in-string.md) +- [1049. 最后一块石头的重量 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/last-stone-weight-ii.md) +- [1051. 高度检查器](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/height-checker.md) +- [1052. 爱生气的书店老板](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/grumpy-bookstore-owner.md) +- [1065. 字符串的索引对](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/index-pairs-of-a-string.md) +- [1079. 活字印刷](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/letter-tile-possibilities.md) +- [1081. 不同字符的最小子序列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/smallest-subsequence-of-distinct-characters.md) +- [1089. 复写零](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/duplicate-zeros.md) +- [1091. 二进制矩阵中的最短路径](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/shortest-path-in-binary-matrix.md) +- [1095. 山脉数组中查找目标值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/find-in-mountain-array.md) +- [1099. 小于 K 的两数之和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/two-sum-less-than-k.md) diff --git "a/Solutions/1049. \346\234\200\345\220\216\344\270\200\345\235\227\347\237\263\345\244\264\347\232\204\351\207\215\351\207\217 II.md" b/docs/solutions/1000-1099/last-stone-weight-ii.md similarity index 100% rename from "Solutions/1049. \346\234\200\345\220\216\344\270\200\345\235\227\347\237\263\345\244\264\347\232\204\351\207\215\351\207\217 II.md" rename to docs/solutions/1000-1099/last-stone-weight-ii.md diff --git "a/Solutions/1079. \346\264\273\345\255\227\345\215\260\345\210\267.md" b/docs/solutions/1000-1099/letter-tile-possibilities.md similarity index 100% rename from "Solutions/1079. \346\264\273\345\255\227\345\215\260\345\210\267.md" rename to docs/solutions/1000-1099/letter-tile-possibilities.md diff --git "a/Solutions/1004. \346\234\200\345\244\247\350\277\236\347\273\2551\347\232\204\344\270\252\346\225\260 III.md" b/docs/solutions/1000-1099/max-consecutive-ones-iii.md similarity index 100% rename from "Solutions/1004. \346\234\200\345\244\247\350\277\236\347\273\2551\347\232\204\344\270\252\346\225\260 III.md" rename to docs/solutions/1000-1099/max-consecutive-ones-iii.md diff --git "a/Solutions/1005. K \346\254\241\345\217\226\345\217\215\345\220\216\346\234\200\345\244\247\345\214\226\347\232\204\346\225\260\347\273\204\345\222\214.md" b/docs/solutions/1000-1099/maximize-sum-of-array-after-k-negations.md similarity index 100% rename from "Solutions/1005. K \346\254\241\345\217\226\345\217\215\345\220\216\346\234\200\345\244\247\345\214\226\347\232\204\346\225\260\347\273\204\345\222\214.md" rename to docs/solutions/1000-1099/maximize-sum-of-array-after-k-negations.md diff --git "a/Solutions/1000. \345\220\210\345\271\266\347\237\263\345\244\264\347\232\204\346\234\200\344\275\216\346\210\220\346\234\254.md" b/docs/solutions/1000-1099/minimum-cost-to-merge-stones.md similarity index 100% rename from "Solutions/1000. \345\220\210\345\271\266\347\237\263\345\244\264\347\232\204\346\234\200\344\275\216\346\210\220\346\234\254.md" rename to docs/solutions/1000-1099/minimum-cost-to-merge-stones.md diff --git "a/Solutions/1039. \345\244\232\350\276\271\345\275\242\344\270\211\350\247\222\345\211\226\345\210\206\347\232\204\346\234\200\344\275\216\345\276\227\345\210\206.md" b/docs/solutions/1000-1099/minimum-score-triangulation-of-polygon.md similarity index 100% rename from "Solutions/1039. \345\244\232\350\276\271\345\275\242\344\270\211\350\247\222\345\211\226\345\210\206\347\232\204\346\234\200\344\275\216\345\276\227\345\210\206.md" rename to docs/solutions/1000-1099/minimum-score-triangulation-of-polygon.md diff --git "a/Solutions/1020. \351\243\236\345\234\260\347\232\204\346\225\260\351\207\217.md" b/docs/solutions/1000-1099/number-of-enclaves.md similarity index 100% rename from "Solutions/1020. \351\243\236\345\234\260\347\232\204\346\225\260\351\207\217.md" rename to docs/solutions/1000-1099/number-of-enclaves.md diff --git "a/Solutions/1012. \350\207\263\345\260\221\346\234\211 1 \344\275\215\351\207\215\345\244\215\347\232\204\346\225\260\345\255\227.md" b/docs/solutions/1000-1099/numbers-with-repeated-digits.md similarity index 100% rename from "Solutions/1012. \350\207\263\345\260\221\346\234\211 1 \344\275\215\351\207\215\345\244\215\347\232\204\346\225\260\345\255\227.md" rename to docs/solutions/1000-1099/numbers-with-repeated-digits.md diff --git "a/Solutions/1028. \344\273\216\345\205\210\345\272\217\351\201\215\345\216\206\350\277\230\345\216\237\344\272\214\345\217\211\346\240\221.md" b/docs/solutions/1000-1099/recover-a-tree-from-preorder-traversal.md similarity index 100% rename from "Solutions/1028. \344\273\216\345\205\210\345\272\217\351\201\215\345\216\206\350\277\230\345\216\237\344\272\214\345\217\211\346\240\221.md" rename to docs/solutions/1000-1099/recover-a-tree-from-preorder-traversal.md diff --git "a/Solutions/1047. \345\210\240\351\231\244\345\255\227\347\254\246\344\270\262\344\270\255\347\232\204\346\211\200\346\234\211\347\233\270\351\202\273\351\207\215\345\244\215\351\241\271.md" b/docs/solutions/1000-1099/remove-all-adjacent-duplicates-in-string.md similarity index 100% rename from "Solutions/1047. \345\210\240\351\231\244\345\255\227\347\254\246\344\270\262\344\270\255\347\232\204\346\211\200\346\234\211\347\233\270\351\202\273\351\207\215\345\244\215\351\241\271.md" rename to docs/solutions/1000-1099/remove-all-adjacent-duplicates-in-string.md diff --git "a/Solutions/1021. \345\210\240\351\231\244\346\234\200\345\244\226\345\261\202\347\232\204\346\213\254\345\217\267.md" b/docs/solutions/1000-1099/remove-outermost-parentheses.md similarity index 100% rename from "Solutions/1021. \345\210\240\351\231\244\346\234\200\345\244\226\345\261\202\347\232\204\346\213\254\345\217\267.md" rename to docs/solutions/1000-1099/remove-outermost-parentheses.md diff --git "a/Solutions/1041. \345\233\260\344\272\216\347\216\257\344\270\255\347\232\204\346\234\272\345\231\250\344\272\272.md" b/docs/solutions/1000-1099/robot-bounded-in-circle.md similarity index 100% rename from "Solutions/1041. \345\233\260\344\272\216\347\216\257\344\270\255\347\232\204\346\234\272\345\231\250\344\272\272.md" rename to docs/solutions/1000-1099/robot-bounded-in-circle.md diff --git "a/Solutions/1091. \344\272\214\350\277\233\345\210\266\347\237\251\351\230\265\344\270\255\347\232\204\346\234\200\347\237\255\350\267\257\345\276\204.md" b/docs/solutions/1000-1099/shortest-path-in-binary-matrix.md similarity index 100% rename from "Solutions/1091. \344\272\214\350\277\233\345\210\266\347\237\251\351\230\265\344\270\255\347\232\204\346\234\200\347\237\255\350\267\257\345\276\204.md" rename to docs/solutions/1000-1099/shortest-path-in-binary-matrix.md diff --git "a/Solutions/1081. \344\270\215\345\220\214\345\255\227\347\254\246\347\232\204\346\234\200\345\260\217\345\255\220\345\272\217\345\210\227.md" b/docs/solutions/1000-1099/smallest-subsequence-of-distinct-characters.md similarity index 100% rename from "Solutions/1081. \344\270\215\345\220\214\345\255\227\347\254\246\347\232\204\346\234\200\345\260\217\345\255\220\345\272\217\345\210\227.md" rename to docs/solutions/1000-1099/smallest-subsequence-of-distinct-characters.md diff --git "a/Solutions/1029. \344\270\244\345\234\260\350\260\203\345\272\246.md" b/docs/solutions/1000-1099/two-city-scheduling.md similarity index 100% rename from "Solutions/1029. \344\270\244\345\234\260\350\260\203\345\272\246.md" rename to docs/solutions/1000-1099/two-city-scheduling.md diff --git "a/Solutions/1099. \345\260\217\344\272\216 K \347\232\204\344\270\244\346\225\260\344\271\213\345\222\214.md" b/docs/solutions/1000-1099/two-sum-less-than-k.md similarity index 100% rename from "Solutions/1099. \345\260\217\344\272\216 K \347\232\204\344\270\244\346\225\260\344\271\213\345\222\214.md" rename to docs/solutions/1000-1099/two-sum-less-than-k.md diff --git "a/Solutions/1035. \344\270\215\347\233\270\344\272\244\347\232\204\347\272\277.md" b/docs/solutions/1000-1099/uncrossed-lines.md similarity index 100% rename from "Solutions/1035. \344\270\215\347\233\270\344\272\244\347\232\204\347\272\277.md" rename to docs/solutions/1000-1099/uncrossed-lines.md diff --git "a/Solutions/1037. \346\234\211\346\225\210\347\232\204\345\233\236\346\227\213\351\225\226.md" b/docs/solutions/1000-1099/valid-boomerang.md similarity index 100% rename from "Solutions/1037. \346\234\211\346\225\210\347\232\204\345\233\236\346\227\213\351\225\226.md" rename to docs/solutions/1000-1099/valid-boomerang.md diff --git "a/Solutions/1109. \350\210\252\347\217\255\351\242\204\350\256\242\347\273\237\350\256\241.md" b/docs/solutions/1100-1199/corporate-flight-bookings.md similarity index 100% rename from "Solutions/1109. \350\210\252\347\217\255\351\242\204\350\256\242\347\273\237\350\256\241.md" rename to docs/solutions/1100-1199/corporate-flight-bookings.md diff --git "a/Solutions/1108. IP \345\234\260\345\235\200\346\227\240\346\225\210\345\214\226.md" b/docs/solutions/1100-1199/defanging-an-ip-address.md similarity index 100% rename from "Solutions/1108. IP \345\234\260\345\235\200\346\227\240\346\225\210\345\214\226.md" rename to docs/solutions/1100-1199/defanging-an-ip-address.md diff --git "a/Solutions/1110. \345\210\240\347\202\271\346\210\220\346\236\227.md" b/docs/solutions/1100-1199/delete-nodes-and-return-forest.md similarity index 100% rename from "Solutions/1110. \345\210\240\347\202\271\346\210\220\346\236\227.md" rename to docs/solutions/1100-1199/delete-nodes-and-return-forest.md diff --git "a/Solutions/1176. \345\201\245\350\272\253\350\256\241\345\210\222\350\257\204\344\274\260.md" b/docs/solutions/1100-1199/diet-plan-performance.md similarity index 100% rename from "Solutions/1176. \345\201\245\350\272\253\350\256\241\345\210\222\350\257\204\344\274\260.md" rename to docs/solutions/1100-1199/diet-plan-performance.md diff --git "a/Solutions/1184. \345\205\254\344\272\244\347\253\231\351\227\264\347\232\204\350\267\235\347\246\273.md" b/docs/solutions/1100-1199/distance-between-bus-stops.md similarity index 100% rename from "Solutions/1184. \345\205\254\344\272\244\347\253\231\351\227\264\347\232\204\350\267\235\347\246\273.md" rename to docs/solutions/1100-1199/distance-between-bus-stops.md diff --git "a/Solutions/1103. \345\210\206\347\263\226\346\236\234 II.md" b/docs/solutions/1100-1199/distribute-candies-to-people.md similarity index 100% rename from "Solutions/1103. \345\210\206\347\263\226\346\236\234 II.md" rename to docs/solutions/1100-1199/distribute-candies-to-people.md diff --git "a/Solutions/1100. \351\225\277\345\272\246\344\270\272 K \347\232\204\346\227\240\351\207\215\345\244\215\345\255\227\347\254\246\345\255\220\344\270\262.md" b/docs/solutions/1100-1199/find-k-length-substrings-with-no-repeated-characters.md similarity index 100% rename from "Solutions/1100. \351\225\277\345\272\246\344\270\272 K \347\232\204\346\227\240\351\207\215\345\244\215\345\255\227\347\254\246\345\255\220\344\270\262.md" rename to docs/solutions/1100-1199/find-k-length-substrings-with-no-repeated-characters.md diff --git a/docs/solutions/1100-1199/index.md b/docs/solutions/1100-1199/index.md new file mode 100644 index 00000000..4b5bcd0f --- /dev/null +++ b/docs/solutions/1100-1199/index.md @@ -0,0 +1,16 @@ +## 本章内容 + +- [1100. 长度为 K 的无重复字符子串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/find-k-length-substrings-with-no-repeated-characters.md) +- [1103. 分糖果 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/distribute-candies-to-people.md) +- [1108. IP 地址无效化](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/defanging-an-ip-address.md) +- [1109. 航班预订统计](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/corporate-flight-bookings.md) +- [1110. 删点成林](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/delete-nodes-and-return-forest.md) +- [1122. 数组的相对排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/relative-sort-array.md) +- [1136. 并行课程](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/parallel-courses.md) +- [1137. 第 N 个泰波那契数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/n-th-tribonacci-number.md) +- [1143. 最长公共子序列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/longest-common-subsequence.md) +- [1151. 最少交换次数来组合所有的 1](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/minimum-swaps-to-group-all-1s-together.md) +- [1155. 掷骰子等于目标和的方法数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/number-of-dice-rolls-with-target-sum.md) +- [1161. 最大层内元素和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/maximum-level-sum-of-a-binary-tree.md) +- [1176. 健身计划评估](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/diet-plan-performance.md) +- [1184. 公交站间的距离](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/distance-between-bus-stops.md) diff --git "a/Solutions/1143. \346\234\200\351\225\277\345\205\254\345\205\261\345\255\220\345\272\217\345\210\227.md" b/docs/solutions/1100-1199/longest-common-subsequence.md similarity index 100% rename from "Solutions/1143. \346\234\200\351\225\277\345\205\254\345\205\261\345\255\220\345\272\217\345\210\227.md" rename to docs/solutions/1100-1199/longest-common-subsequence.md diff --git "a/Solutions/1161. \346\234\200\345\244\247\345\261\202\345\206\205\345\205\203\347\264\240\345\222\214.md" b/docs/solutions/1100-1199/maximum-level-sum-of-a-binary-tree.md similarity index 100% rename from "Solutions/1161. \346\234\200\345\244\247\345\261\202\345\206\205\345\205\203\347\264\240\345\222\214.md" rename to docs/solutions/1100-1199/maximum-level-sum-of-a-binary-tree.md diff --git "a/Solutions/1151. \346\234\200\345\260\221\344\272\244\346\215\242\346\254\241\346\225\260\346\235\245\347\273\204\345\220\210\346\211\200\346\234\211\347\232\204 1.md" b/docs/solutions/1100-1199/minimum-swaps-to-group-all-1s-together.md similarity index 100% rename from "Solutions/1151. \346\234\200\345\260\221\344\272\244\346\215\242\346\254\241\346\225\260\346\235\245\347\273\204\345\220\210\346\211\200\346\234\211\347\232\204 1.md" rename to docs/solutions/1100-1199/minimum-swaps-to-group-all-1s-together.md diff --git "a/Solutions/1137. \347\254\254 N \344\270\252\346\263\260\346\263\242\351\202\243\345\245\221\346\225\260.md" b/docs/solutions/1100-1199/n-th-tribonacci-number.md similarity index 100% rename from "Solutions/1137. \347\254\254 N \344\270\252\346\263\260\346\263\242\351\202\243\345\245\221\346\225\260.md" rename to docs/solutions/1100-1199/n-th-tribonacci-number.md diff --git "a/Solutions/1155. \346\216\267\351\252\260\345\255\220\347\255\211\344\272\216\347\233\256\346\240\207\345\222\214\347\232\204\346\226\271\346\263\225\346\225\260.md" b/docs/solutions/1100-1199/number-of-dice-rolls-with-target-sum.md similarity index 100% rename from "Solutions/1155. \346\216\267\351\252\260\345\255\220\347\255\211\344\272\216\347\233\256\346\240\207\345\222\214\347\232\204\346\226\271\346\263\225\346\225\260.md" rename to docs/solutions/1100-1199/number-of-dice-rolls-with-target-sum.md diff --git "a/Solutions/1136. \345\271\266\350\241\214\350\257\276\347\250\213.md" b/docs/solutions/1100-1199/parallel-courses.md similarity index 100% rename from "Solutions/1136. \345\271\266\350\241\214\350\257\276\347\250\213.md" rename to docs/solutions/1100-1199/parallel-courses.md diff --git "a/Solutions/1122. \346\225\260\347\273\204\347\232\204\347\233\270\345\257\271\346\216\222\345\272\217.md" b/docs/solutions/1100-1199/relative-sort-array.md similarity index 100% rename from "Solutions/1122. \346\225\260\347\273\204\347\232\204\347\233\270\345\257\271\346\216\222\345\272\217.md" rename to docs/solutions/1100-1199/relative-sort-array.md diff --git "a/Solutions/1227. \351\243\236\346\234\272\345\272\247\344\275\215\345\210\206\351\205\215\346\246\202\347\216\207.md" b/docs/solutions/1200-1299/airplane-seat-assignment-probability.md similarity index 100% rename from "Solutions/1227. \351\243\236\346\234\272\345\272\247\344\275\215\345\210\206\351\205\215\346\246\202\347\216\207.md" rename to docs/solutions/1200-1299/airplane-seat-assignment-probability.md diff --git "a/Solutions/1232. \347\274\200\347\202\271\346\210\220\347\272\277.md" b/docs/solutions/1200-1299/check-if-it-is-a-straight-line.md similarity index 100% rename from "Solutions/1232. \347\274\200\347\202\271\346\210\220\347\272\277.md" rename to docs/solutions/1200-1299/check-if-it-is-a-straight-line.md diff --git "a/Solutions/1220. \347\273\237\350\256\241\345\205\203\351\237\263\345\255\227\346\257\215\345\272\217\345\210\227\347\232\204\346\225\260\347\233\256.md" b/docs/solutions/1200-1299/count-vowels-permutation.md similarity index 100% rename from "Solutions/1220. \347\273\237\350\256\241\345\205\203\351\237\263\345\255\227\346\257\215\345\272\217\345\210\227\347\232\204\346\225\260\347\233\256.md" rename to docs/solutions/1200-1299/count-vowels-permutation.md diff --git "a/Solutions/1296. \345\210\222\345\210\206\346\225\260\347\273\204\344\270\272\350\277\236\347\273\255\346\225\260\345\255\227\347\232\204\351\233\206\345\220\210.md" b/docs/solutions/1200-1299/divide-array-in-sets-of-k-consecutive-numbers.md similarity index 100% rename from "Solutions/1296. \345\210\222\345\210\206\346\225\260\347\273\204\344\270\272\350\277\236\347\273\255\346\225\260\345\255\227\347\232\204\351\233\206\345\220\210.md" rename to docs/solutions/1200-1299/divide-array-in-sets-of-k-consecutive-numbers.md diff --git "a/Solutions/1261. \345\234\250\345\217\227\346\261\241\346\237\223\347\232\204\344\272\214\345\217\211\346\240\221\344\270\255\346\237\245\346\211\276\345\205\203\347\264\240.md" b/docs/solutions/1200-1299/find-elements-in-a-contaminated-binary-tree.md similarity index 100% rename from "Solutions/1261. \345\234\250\345\217\227\346\261\241\346\237\223\347\232\204\344\272\214\345\217\211\346\240\221\344\270\255\346\237\245\346\211\276\345\205\203\347\264\240.md" rename to docs/solutions/1200-1299/find-elements-in-a-contaminated-binary-tree.md diff --git "a/Solutions/1208. \345\260\275\345\217\257\350\203\275\344\275\277\345\255\227\347\254\246\344\270\262\347\233\270\347\255\211.md" b/docs/solutions/1200-1299/get-equal-substrings-within-budget.md similarity index 100% rename from "Solutions/1208. \345\260\275\345\217\257\350\203\275\344\275\277\345\255\227\347\254\246\344\270\262\347\233\270\347\255\211.md" rename to docs/solutions/1200-1299/get-equal-substrings-within-budget.md diff --git a/docs/solutions/1200-1299/index.md b/docs/solutions/1200-1299/index.md new file mode 100644 index 00000000..80fddc7e --- /dev/null +++ b/docs/solutions/1200-1299/index.md @@ -0,0 +1,18 @@ +## 本章内容 + +- [1202. 交换字符串中的元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/smallest-string-with-swaps.md) +- [1208. 尽可能使字符串相等](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/get-equal-substrings-within-budget.md) +- [1217. 玩筹码](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/minimum-cost-to-move-chips-to-the-same-position.md) +- [1220. 统计元音字母序列的数目](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/count-vowels-permutation.md) +- [1227. 飞机座位分配概率](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/airplane-seat-assignment-probability.md) +- [1229. 安排会议日程](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/meeting-scheduler.md) +- [1232. 缀点成线](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/check-if-it-is-a-straight-line.md) +- [1245. 树的直径](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/tree-diameter.md) +- [1247. 交换字符使得字符串相同](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/minimum-swaps-to-make-strings-equal.md) +- [1253. 重构 2 行二进制矩阵](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/reconstruct-a-2-row-binary-matrix.md) +- [1254. 统计封闭岛屿的数目](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/number-of-closed-islands.md) +- [1261. 在受污染的二叉树中查找元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/find-elements-in-a-contaminated-binary-tree.md) +- [1266. 访问所有点的最小时间](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/minimum-time-visiting-all-points.md) +- [1268. 搜索推荐系统](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/search-suggestions-system.md) +- [1281. 整数的各位积和之差](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/subtract-the-product-and-sum-of-digits-of-an-integer.md) +- [1296. 划分数组为连续数字的集合](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/divide-array-in-sets-of-k-consecutive-numbers.md) diff --git "a/Solutions/1229. \345\256\211\346\216\222\344\274\232\350\256\256\346\227\245\347\250\213.md" b/docs/solutions/1200-1299/meeting-scheduler.md similarity index 100% rename from "Solutions/1229. \345\256\211\346\216\222\344\274\232\350\256\256\346\227\245\347\250\213.md" rename to docs/solutions/1200-1299/meeting-scheduler.md diff --git "a/Solutions/1217. \347\216\251\347\255\271\347\240\201.md" b/docs/solutions/1200-1299/minimum-cost-to-move-chips-to-the-same-position.md similarity index 100% rename from "Solutions/1217. \347\216\251\347\255\271\347\240\201.md" rename to docs/solutions/1200-1299/minimum-cost-to-move-chips-to-the-same-position.md diff --git "a/Solutions/1247. \344\272\244\346\215\242\345\255\227\347\254\246\344\275\277\345\276\227\345\255\227\347\254\246\344\270\262\347\233\270\345\220\214.md" b/docs/solutions/1200-1299/minimum-swaps-to-make-strings-equal.md similarity index 100% rename from "Solutions/1247. \344\272\244\346\215\242\345\255\227\347\254\246\344\275\277\345\276\227\345\255\227\347\254\246\344\270\262\347\233\270\345\220\214.md" rename to docs/solutions/1200-1299/minimum-swaps-to-make-strings-equal.md diff --git "a/Solutions/1266. \350\256\277\351\227\256\346\211\200\346\234\211\347\202\271\347\232\204\346\234\200\345\260\217\346\227\266\351\227\264.md" b/docs/solutions/1200-1299/minimum-time-visiting-all-points.md similarity index 100% rename from "Solutions/1266. \350\256\277\351\227\256\346\211\200\346\234\211\347\202\271\347\232\204\346\234\200\345\260\217\346\227\266\351\227\264.md" rename to docs/solutions/1200-1299/minimum-time-visiting-all-points.md diff --git "a/Solutions/1254. \347\273\237\350\256\241\345\260\201\351\227\255\345\262\233\345\261\277\347\232\204\346\225\260\347\233\256.md" b/docs/solutions/1200-1299/number-of-closed-islands.md similarity index 100% rename from "Solutions/1254. \347\273\237\350\256\241\345\260\201\351\227\255\345\262\233\345\261\277\347\232\204\346\225\260\347\233\256.md" rename to docs/solutions/1200-1299/number-of-closed-islands.md diff --git "a/Solutions/1253. \351\207\215\346\236\204 2 \350\241\214\344\272\214\350\277\233\345\210\266\347\237\251\351\230\265.md" b/docs/solutions/1200-1299/reconstruct-a-2-row-binary-matrix.md similarity index 100% rename from "Solutions/1253. \351\207\215\346\236\204 2 \350\241\214\344\272\214\350\277\233\345\210\266\347\237\251\351\230\265.md" rename to docs/solutions/1200-1299/reconstruct-a-2-row-binary-matrix.md diff --git "a/Solutions/1268. \346\220\234\347\264\242\346\216\250\350\215\220\347\263\273\347\273\237.md" b/docs/solutions/1200-1299/search-suggestions-system.md similarity index 100% rename from "Solutions/1268. \346\220\234\347\264\242\346\216\250\350\215\220\347\263\273\347\273\237.md" rename to docs/solutions/1200-1299/search-suggestions-system.md diff --git "a/Solutions/1202. \344\272\244\346\215\242\345\255\227\347\254\246\344\270\262\344\270\255\347\232\204\345\205\203\347\264\240.md" b/docs/solutions/1200-1299/smallest-string-with-swaps.md similarity index 100% rename from "Solutions/1202. \344\272\244\346\215\242\345\255\227\347\254\246\344\270\262\344\270\255\347\232\204\345\205\203\347\264\240.md" rename to docs/solutions/1200-1299/smallest-string-with-swaps.md diff --git "a/Solutions/1281. \346\225\264\346\225\260\347\232\204\345\220\204\344\275\215\347\247\257\345\222\214\344\271\213\345\267\256.md" b/docs/solutions/1200-1299/subtract-the-product-and-sum-of-digits-of-an-integer.md similarity index 100% rename from "Solutions/1281. \346\225\264\346\225\260\347\232\204\345\220\204\344\275\215\347\247\257\345\222\214\344\271\213\345\267\256.md" rename to docs/solutions/1200-1299/subtract-the-product-and-sum-of-digits-of-an-integer.md diff --git "a/Solutions/1245. \346\240\221\347\232\204\347\233\264\345\276\204.md" b/docs/solutions/1200-1299/tree-diameter.md similarity index 100% rename from "Solutions/1245. \346\240\221\347\232\204\347\233\264\345\276\204.md" rename to docs/solutions/1200-1299/tree-diameter.md diff --git "a/Solutions/1305. \344\270\244\346\243\265\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\344\270\255\347\232\204\346\211\200\346\234\211\345\205\203\347\264\240.md" b/docs/solutions/1300-1399/all-elements-in-two-binary-search-trees.md similarity index 100% rename from "Solutions/1305. \344\270\244\346\243\265\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\344\270\255\347\232\204\346\211\200\346\234\211\345\205\203\347\264\240.md" rename to docs/solutions/1300-1399/all-elements-in-two-binary-search-trees.md diff --git "a/Solutions/1344. \346\227\266\351\222\237\346\214\207\351\222\210\347\232\204\345\244\271\350\247\222.md" b/docs/solutions/1300-1399/angle-between-hands-of-a-clock.md similarity index 100% rename from "Solutions/1344. \346\227\266\351\222\237\346\214\207\351\222\210\347\232\204\345\244\271\350\247\222.md" rename to docs/solutions/1300-1399/angle-between-hands-of-a-clock.md diff --git "a/Solutions/1362. \346\234\200\346\216\245\350\277\221\347\232\204\345\233\240\346\225\260.md" b/docs/solutions/1300-1399/closest-divisors.md similarity index 100% rename from "Solutions/1362. \346\234\200\346\216\245\350\277\221\347\232\204\345\233\240\346\225\260.md" rename to docs/solutions/1300-1399/closest-divisors.md diff --git "a/Solutions/1317. \345\260\206\346\225\264\346\225\260\350\275\254\346\215\242\344\270\272\344\270\244\344\270\252\346\227\240\351\233\266\346\225\264\346\225\260\347\232\204\345\222\214.md" b/docs/solutions/1300-1399/convert-integer-to-the-sum-of-two-no-zero-integers.md similarity index 100% rename from "Solutions/1317. \345\260\206\346\225\264\346\225\260\350\275\254\346\215\242\344\270\272\344\270\244\344\270\252\346\227\240\351\233\266\346\225\264\346\225\260\347\232\204\345\222\214.md" rename to docs/solutions/1300-1399/convert-integer-to-the-sum-of-two-no-zero-integers.md diff --git "a/Solutions/1313. \350\247\243\345\216\213\347\274\251\347\274\226\347\240\201\345\210\227\350\241\250.md" b/docs/solutions/1300-1399/decompress-run-length-encoded-list.md similarity index 100% rename from "Solutions/1313. \350\247\243\345\216\213\347\274\251\347\274\226\347\240\201\345\210\227\350\241\250.md" rename to docs/solutions/1300-1399/decompress-run-length-encoded-list.md diff --git "a/Solutions/1381. \350\256\276\350\256\241\344\270\200\344\270\252\346\224\257\346\214\201\345\242\236\351\207\217\346\223\215\344\275\234\347\232\204\346\240\210.md" b/docs/solutions/1300-1399/design-a-stack-with-increment-operation.md similarity index 100% rename from "Solutions/1381. \350\256\276\350\256\241\344\270\200\344\270\252\346\224\257\346\214\201\345\242\236\351\207\217\346\223\215\344\275\234\347\232\204\346\240\210.md" rename to docs/solutions/1300-1399/design-a-stack-with-increment-operation.md diff --git a/docs/solutions/1300-1399/index.md b/docs/solutions/1300-1399/index.md new file mode 100644 index 00000000..041f59ce --- /dev/null +++ b/docs/solutions/1300-1399/index.md @@ -0,0 +1,17 @@ +## 本章内容 + +- [1300. 转变数组后最接近目标值的数组和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/sum-of-mutated-array-closest-to-target.md) +- [1305. 两棵二叉搜索树中的所有元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/all-elements-in-two-binary-search-trees.md) +- [1310. 子数组异或查询](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/xor-queries-of-a-subarray.md) +- [1313. 解压缩编码列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/decompress-run-length-encoded-list.md) +- [1317. 将整数转换为两个无零整数的和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/convert-integer-to-the-sum-of-two-no-zero-integers.md) +- [1319. 连通网络的操作次数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/number-of-operations-to-make-network-connected.md) +- [1324. 竖直打印单词](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/print-words-vertically.md) +- [1338. 数组大小减半](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/reduce-array-size-to-the-half.md) +- [1343. 大小为 K 且平均值大于等于阈值的子数组数目](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold.md) +- [1344. 时钟指针的夹角](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/angle-between-hands-of-a-clock.md) +- [1347. 制造字母异位词的最小步骤数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/minimum-number-of-steps-to-make-two-strings-anagram.md) +- [1349. 参加考试的最大学生数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/maximum-students-taking-exam.md) +- [1358. 包含所有三种字符的子字符串数目](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/number-of-substrings-containing-all-three-characters.md) +- [1362. 最接近的因数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/closest-divisors.md) +- [1381. 设计一个支持增量操作的栈](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/design-a-stack-with-increment-operation.md) diff --git "a/Solutions/1349. \345\217\202\345\212\240\350\200\203\350\257\225\347\232\204\346\234\200\345\244\247\345\255\246\347\224\237\346\225\260.md" b/docs/solutions/1300-1399/maximum-students-taking-exam.md similarity index 100% rename from "Solutions/1349. \345\217\202\345\212\240\350\200\203\350\257\225\347\232\204\346\234\200\345\244\247\345\255\246\347\224\237\346\225\260.md" rename to docs/solutions/1300-1399/maximum-students-taking-exam.md diff --git "a/Solutions/1347. \345\210\266\351\200\240\345\255\227\346\257\215\345\274\202\344\275\215\350\257\215\347\232\204\346\234\200\345\260\217\346\255\245\351\252\244\346\225\260.md" b/docs/solutions/1300-1399/minimum-number-of-steps-to-make-two-strings-anagram.md similarity index 100% rename from "Solutions/1347. \345\210\266\351\200\240\345\255\227\346\257\215\345\274\202\344\275\215\350\257\215\347\232\204\346\234\200\345\260\217\346\255\245\351\252\244\346\225\260.md" rename to docs/solutions/1300-1399/minimum-number-of-steps-to-make-two-strings-anagram.md diff --git "a/Solutions/1319. \350\277\236\351\200\232\347\275\221\347\273\234\347\232\204\346\223\215\344\275\234\346\254\241\346\225\260.md" b/docs/solutions/1300-1399/number-of-operations-to-make-network-connected.md similarity index 100% rename from "Solutions/1319. \350\277\236\351\200\232\347\275\221\347\273\234\347\232\204\346\223\215\344\275\234\346\254\241\346\225\260.md" rename to docs/solutions/1300-1399/number-of-operations-to-make-network-connected.md diff --git "a/Solutions/1343. \345\244\247\345\260\217\344\270\272 K \344\270\224\345\271\263\345\235\207\345\200\274\345\244\247\344\272\216\347\255\211\344\272\216\351\230\210\345\200\274\347\232\204\345\255\220\346\225\260\347\273\204\346\225\260\347\233\256.md" b/docs/solutions/1300-1399/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold.md similarity index 100% rename from "Solutions/1343. \345\244\247\345\260\217\344\270\272 K \344\270\224\345\271\263\345\235\207\345\200\274\345\244\247\344\272\216\347\255\211\344\272\216\351\230\210\345\200\274\347\232\204\345\255\220\346\225\260\347\273\204\346\225\260\347\233\256.md" rename to docs/solutions/1300-1399/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold.md diff --git "a/Solutions/1358. \345\214\205\345\220\253\346\211\200\346\234\211\344\270\211\347\247\215\345\255\227\347\254\246\347\232\204\345\255\220\345\255\227\347\254\246\344\270\262\346\225\260\347\233\256.md" b/docs/solutions/1300-1399/number-of-substrings-containing-all-three-characters.md similarity index 100% rename from "Solutions/1358. \345\214\205\345\220\253\346\211\200\346\234\211\344\270\211\347\247\215\345\255\227\347\254\246\347\232\204\345\255\220\345\255\227\347\254\246\344\270\262\346\225\260\347\233\256.md" rename to docs/solutions/1300-1399/number-of-substrings-containing-all-three-characters.md diff --git "a/Solutions/1324. \347\253\226\347\233\264\346\211\223\345\215\260\345\215\225\350\257\215.md" b/docs/solutions/1300-1399/print-words-vertically.md similarity index 100% rename from "Solutions/1324. \347\253\226\347\233\264\346\211\223\345\215\260\345\215\225\350\257\215.md" rename to docs/solutions/1300-1399/print-words-vertically.md diff --git "a/Solutions/1338. \346\225\260\347\273\204\345\244\247\345\260\217\345\207\217\345\215\212.md" b/docs/solutions/1300-1399/reduce-array-size-to-the-half.md similarity index 100% rename from "Solutions/1338. \346\225\260\347\273\204\345\244\247\345\260\217\345\207\217\345\215\212.md" rename to docs/solutions/1300-1399/reduce-array-size-to-the-half.md diff --git "a/Solutions/1300. \350\275\254\345\217\230\346\225\260\347\273\204\345\220\216\346\234\200\346\216\245\350\277\221\347\233\256\346\240\207\345\200\274\347\232\204\346\225\260\347\273\204\345\222\214.md" b/docs/solutions/1300-1399/sum-of-mutated-array-closest-to-target.md similarity index 100% rename from "Solutions/1300. \350\275\254\345\217\230\346\225\260\347\273\204\345\220\216\346\234\200\346\216\245\350\277\221\347\233\256\346\240\207\345\200\274\347\232\204\346\225\260\347\273\204\345\222\214.md" rename to docs/solutions/1300-1399/sum-of-mutated-array-closest-to-target.md diff --git "a/Solutions/1310. \345\255\220\346\225\260\347\273\204\345\274\202\346\210\226\346\237\245\350\257\242.md" b/docs/solutions/1300-1399/xor-queries-of-a-subarray.md similarity index 100% rename from "Solutions/1310. \345\255\220\346\225\260\347\273\204\345\274\202\346\210\226\346\237\245\350\257\242.md" rename to docs/solutions/1300-1399/xor-queries-of-a-subarray.md diff --git "a/Solutions/1491. \345\216\273\346\216\211\346\234\200\344\275\216\345\267\245\350\265\204\345\222\214\346\234\200\351\253\230\345\267\245\350\265\204\345\220\216\347\232\204\345\267\245\350\265\204\345\271\263\345\235\207\345\200\274.md" b/docs/solutions/1400-1499/average-salary-excluding-the-minimum-and-maximum-salary.md similarity index 100% rename from "Solutions/1491. \345\216\273\346\216\211\346\234\200\344\275\216\345\267\245\350\265\204\345\222\214\346\234\200\351\253\230\345\267\245\350\265\204\345\220\216\347\232\204\345\267\245\350\265\204\345\271\263\345\235\207\345\200\274.md" rename to docs/solutions/1400-1499/average-salary-excluding-the-minimum-and-maximum-salary.md diff --git "a/Solutions/1446. \350\277\236\347\273\255\345\255\227\347\254\246.md" b/docs/solutions/1400-1499/consecutive-characters.md similarity index 100% rename from "Solutions/1446. \350\277\236\347\273\255\345\255\227\347\254\246.md" rename to docs/solutions/1400-1499/consecutive-characters.md diff --git "a/Solutions/1400. \346\236\204\351\200\240 K \344\270\252\345\233\236\346\226\207\345\255\227\347\254\246\344\270\262.md" b/docs/solutions/1400-1499/construct-k-palindrome-strings.md similarity index 100% rename from "Solutions/1400. \346\236\204\351\200\240 K \344\270\252\345\233\236\346\226\207\345\255\227\347\254\246\344\270\262.md" rename to docs/solutions/1400-1499/construct-k-palindrome-strings.md diff --git "a/Solutions/1449. \346\225\260\344\275\215\346\210\220\346\234\254\345\222\214\344\270\272\347\233\256\346\240\207\345\200\274\347\232\204\346\234\200\345\244\247\346\225\260\345\255\227.md" b/docs/solutions/1400-1499/form-largest-integer-with-digits-that-add-up-to-target.md similarity index 100% rename from "Solutions/1449. \346\225\260\344\275\215\346\210\220\346\234\254\345\222\214\344\270\272\347\233\256\346\240\207\345\200\274\347\232\204\346\234\200\345\244\247\346\225\260\345\255\227.md" rename to docs/solutions/1400-1499/form-largest-integer-with-digits-that-add-up-to-target.md diff --git a/docs/solutions/1400-1499/index.md b/docs/solutions/1400-1499/index.md new file mode 100644 index 00000000..f6c0e4b4 --- /dev/null +++ b/docs/solutions/1400-1499/index.md @@ -0,0 +1,20 @@ +## 本章内容 + +- [1400. 构造 K 个回文字符串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/construct-k-palindrome-strings.md) +- [1408. 数组中的字符串匹配](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/string-matching-in-an-array.md) +- [1422. 分割字符串的最大得分](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/maximum-score-after-splitting-a-string.md) +- [1423. 可获得的最大点数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/maximum-points-you-can-obtain-from-cards.md) +- [1438. 绝对差不超过限制的最长连续子数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.md) +- [1446. 连续字符](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/consecutive-characters.md) +- [1447. 最简分数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/simplified-fractions.md) +- [1449. 数位成本和为目标值的最大数字](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/form-largest-integer-with-digits-that-add-up-to-target.md) +- [1450. 在既定时间做作业的学生人数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/number-of-students-doing-homework-at-a-given-time.md) +- [1451. 重新排列句子中的单词](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/rearrange-words-in-a-sentence.md) +- [1456. 定长子串中元音的最大数目](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/maximum-number-of-vowels-in-a-substring-of-given-length.md) +- [1476. 子矩形查询](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/subrectangle-queries.md) +- [1480. 一维数组的动态和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/running-sum-of-1d-array.md) +- [1482. 制作 m 束花所需的最少天数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/minimum-number-of-days-to-make-m-bouquets.md) +- [1486. 数组异或操作](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/xor-operation-in-an-array.md) +- [1491. 去掉最低工资和最高工资后的工资平均值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/average-salary-excluding-the-minimum-and-maximum-salary.md) +- [1493. 删掉一个元素以后全为 1 的最长子数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/longest-subarray-of-1s-after-deleting-one-element.md) +- [1496. 判断路径是否相交](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/path-crossing.md) diff --git "a/Solutions/1438. \347\273\235\345\257\271\345\267\256\344\270\215\350\266\205\350\277\207\351\231\220\345\210\266\347\232\204\346\234\200\351\225\277\350\277\236\347\273\255\345\255\220\346\225\260\347\273\204.md" b/docs/solutions/1400-1499/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.md similarity index 100% rename from "Solutions/1438. \347\273\235\345\257\271\345\267\256\344\270\215\350\266\205\350\277\207\351\231\220\345\210\266\347\232\204\346\234\200\351\225\277\350\277\236\347\273\255\345\255\220\346\225\260\347\273\204.md" rename to docs/solutions/1400-1499/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.md diff --git "a/Solutions/1493. \345\210\240\346\216\211\344\270\200\344\270\252\345\205\203\347\264\240\344\273\245\345\220\216\345\205\250\344\270\272 1 \347\232\204\346\234\200\351\225\277\345\255\220\346\225\260\347\273\204.md" b/docs/solutions/1400-1499/longest-subarray-of-1s-after-deleting-one-element.md similarity index 100% rename from "Solutions/1493. \345\210\240\346\216\211\344\270\200\344\270\252\345\205\203\347\264\240\344\273\245\345\220\216\345\205\250\344\270\272 1 \347\232\204\346\234\200\351\225\277\345\255\220\346\225\260\347\273\204.md" rename to docs/solutions/1400-1499/longest-subarray-of-1s-after-deleting-one-element.md diff --git "a/Solutions/1456. \345\256\232\351\225\277\345\255\220\344\270\262\344\270\255\345\205\203\351\237\263\347\232\204\346\234\200\345\244\247\346\225\260\347\233\256.md" b/docs/solutions/1400-1499/maximum-number-of-vowels-in-a-substring-of-given-length.md similarity index 100% rename from "Solutions/1456. \345\256\232\351\225\277\345\255\220\344\270\262\344\270\255\345\205\203\351\237\263\347\232\204\346\234\200\345\244\247\346\225\260\347\233\256.md" rename to docs/solutions/1400-1499/maximum-number-of-vowels-in-a-substring-of-given-length.md diff --git "a/Solutions/1423. \345\217\257\350\216\267\345\276\227\347\232\204\346\234\200\345\244\247\347\202\271\346\225\260.md" b/docs/solutions/1400-1499/maximum-points-you-can-obtain-from-cards.md similarity index 100% rename from "Solutions/1423. \345\217\257\350\216\267\345\276\227\347\232\204\346\234\200\345\244\247\347\202\271\346\225\260.md" rename to docs/solutions/1400-1499/maximum-points-you-can-obtain-from-cards.md diff --git "a/Solutions/1422. \345\210\206\345\211\262\345\255\227\347\254\246\344\270\262\347\232\204\346\234\200\345\244\247\345\276\227\345\210\206.md" b/docs/solutions/1400-1499/maximum-score-after-splitting-a-string.md similarity index 100% rename from "Solutions/1422. \345\210\206\345\211\262\345\255\227\347\254\246\344\270\262\347\232\204\346\234\200\345\244\247\345\276\227\345\210\206.md" rename to docs/solutions/1400-1499/maximum-score-after-splitting-a-string.md diff --git "a/Solutions/1482. \345\210\266\344\275\234 m \346\235\237\350\212\261\346\211\200\351\234\200\347\232\204\346\234\200\345\260\221\345\244\251\346\225\260.md" b/docs/solutions/1400-1499/minimum-number-of-days-to-make-m-bouquets.md similarity index 100% rename from "Solutions/1482. \345\210\266\344\275\234 m \346\235\237\350\212\261\346\211\200\351\234\200\347\232\204\346\234\200\345\260\221\345\244\251\346\225\260.md" rename to docs/solutions/1400-1499/minimum-number-of-days-to-make-m-bouquets.md diff --git "a/Solutions/1450. \345\234\250\346\227\242\345\256\232\346\227\266\351\227\264\345\201\232\344\275\234\344\270\232\347\232\204\345\255\246\347\224\237\344\272\272\346\225\260.md" b/docs/solutions/1400-1499/number-of-students-doing-homework-at-a-given-time.md similarity index 100% rename from "Solutions/1450. \345\234\250\346\227\242\345\256\232\346\227\266\351\227\264\345\201\232\344\275\234\344\270\232\347\232\204\345\255\246\347\224\237\344\272\272\346\225\260.md" rename to docs/solutions/1400-1499/number-of-students-doing-homework-at-a-given-time.md diff --git "a/Solutions/1496. \345\210\244\346\226\255\350\267\257\345\276\204\346\230\257\345\220\246\347\233\270\344\272\244.md" b/docs/solutions/1400-1499/path-crossing.md similarity index 100% rename from "Solutions/1496. \345\210\244\346\226\255\350\267\257\345\276\204\346\230\257\345\220\246\347\233\270\344\272\244.md" rename to docs/solutions/1400-1499/path-crossing.md diff --git "a/Solutions/1451. \351\207\215\346\226\260\346\216\222\345\210\227\345\217\245\345\255\220\344\270\255\347\232\204\345\215\225\350\257\215.md" b/docs/solutions/1400-1499/rearrange-words-in-a-sentence.md similarity index 100% rename from "Solutions/1451. \351\207\215\346\226\260\346\216\222\345\210\227\345\217\245\345\255\220\344\270\255\347\232\204\345\215\225\350\257\215.md" rename to docs/solutions/1400-1499/rearrange-words-in-a-sentence.md diff --git "a/Solutions/1480. \344\270\200\347\273\264\346\225\260\347\273\204\347\232\204\345\212\250\346\200\201\345\222\214.md" b/docs/solutions/1400-1499/running-sum-of-1d-array.md similarity index 100% rename from "Solutions/1480. \344\270\200\347\273\264\346\225\260\347\273\204\347\232\204\345\212\250\346\200\201\345\222\214.md" rename to docs/solutions/1400-1499/running-sum-of-1d-array.md diff --git "a/Solutions/1447. \346\234\200\347\256\200\345\210\206\346\225\260.md" b/docs/solutions/1400-1499/simplified-fractions.md similarity index 100% rename from "Solutions/1447. \346\234\200\347\256\200\345\210\206\346\225\260.md" rename to docs/solutions/1400-1499/simplified-fractions.md diff --git "a/Solutions/1408. \346\225\260\347\273\204\344\270\255\347\232\204\345\255\227\347\254\246\344\270\262\345\214\271\351\205\215.md" b/docs/solutions/1400-1499/string-matching-in-an-array.md similarity index 100% rename from "Solutions/1408. \346\225\260\347\273\204\344\270\255\347\232\204\345\255\227\347\254\246\344\270\262\345\214\271\351\205\215.md" rename to docs/solutions/1400-1499/string-matching-in-an-array.md diff --git "a/Solutions/1476. \345\255\220\347\237\251\345\275\242\346\237\245\350\257\242.md" b/docs/solutions/1400-1499/subrectangle-queries.md similarity index 100% rename from "Solutions/1476. \345\255\220\347\237\251\345\275\242\346\237\245\350\257\242.md" rename to docs/solutions/1400-1499/subrectangle-queries.md diff --git "a/Solutions/1486. \346\225\260\347\273\204\345\274\202\346\210\226\346\223\215\344\275\234.md" b/docs/solutions/1400-1499/xor-operation-in-an-array.md similarity index 100% rename from "Solutions/1486. \346\225\260\347\273\204\345\274\202\346\210\226\346\223\215\344\275\234.md" rename to docs/solutions/1400-1499/xor-operation-in-an-array.md diff --git "a/Solutions/1502. \345\210\244\346\226\255\350\203\275\345\220\246\345\275\242\346\210\220\347\255\211\345\267\256\346\225\260\345\210\227.md" b/docs/solutions/1500-1599/can-make-arithmetic-progression-from-sequence.md similarity index 100% rename from "Solutions/1502. \345\210\244\346\226\255\350\203\275\345\220\246\345\275\242\346\210\220\347\255\211\345\267\256\346\225\260\345\210\227.md" rename to docs/solutions/1500-1599/can-make-arithmetic-progression-from-sequence.md diff --git "a/Solutions/1534. \347\273\237\350\256\241\345\245\275\344\270\211\345\205\203\347\273\204.md" b/docs/solutions/1500-1599/count-good-triplets.md similarity index 100% rename from "Solutions/1534. \347\273\237\350\256\241\345\245\275\344\270\211\345\205\203\347\273\204.md" rename to docs/solutions/1500-1599/count-good-triplets.md diff --git "a/Solutions/1523. \345\234\250\345\214\272\351\227\264\350\214\203\345\233\264\345\206\205\347\273\237\350\256\241\345\245\207\346\225\260\346\225\260\347\233\256.md" b/docs/solutions/1500-1599/count-odd-numbers-in-an-interval-range.md similarity index 100% rename from "Solutions/1523. \345\234\250\345\214\272\351\227\264\350\214\203\345\233\264\345\206\205\347\273\237\350\256\241\345\245\207\346\225\260\346\225\260\347\233\256.md" rename to docs/solutions/1500-1599/count-odd-numbers-in-an-interval-range.md diff --git a/docs/solutions/1500-1599/index.md b/docs/solutions/1500-1599/index.md new file mode 100644 index 00000000..e1361df0 --- /dev/null +++ b/docs/solutions/1500-1599/index.md @@ -0,0 +1,15 @@ +## 本章内容 + +- [1502. 判断能否形成等差数列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/can-make-arithmetic-progression-from-sequence.md) +- [1507. 转变日期格式](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/reformat-date.md) +- [1523. 在区间范围内统计奇数数目](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/count-odd-numbers-in-an-interval-range.md) +- [1534. 统计好三元组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/count-good-triplets.md) +- [1547. 切棍子的最小成本](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/minimum-cost-to-cut-a-stick.md) +- [1551. 使数组中所有元素相等的最小操作数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/minimum-operations-to-make-array-equal.md) +- [1556. 千位分隔数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/thousand-separator.md) +- [1561. 你可以获得的最大硬币数目](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/maximum-number-of-coins-you-can-get.md) +- [1567. 乘积为正数的最长子数组长度](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/maximum-length-of-subarray-with-positive-product.md) +- [1582. 二进制矩阵中的特殊位置](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/special-positions-in-a-binary-matrix.md) +- [1584. 连接所有点的最小费用](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/min-cost-to-connect-all-points.md) +- [1593. 拆分字符串使唯一子字符串的数目最大](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/split-a-string-into-the-max-number-of-unique-substrings.md) +- [1595. 连通两组点的最小成本](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/minimum-cost-to-connect-two-groups-of-points.md) diff --git "a/Solutions/1567. \344\271\230\347\247\257\344\270\272\346\255\243\346\225\260\347\232\204\346\234\200\351\225\277\345\255\220\346\225\260\347\273\204\351\225\277\345\272\246.md" b/docs/solutions/1500-1599/maximum-length-of-subarray-with-positive-product.md similarity index 100% rename from "Solutions/1567. \344\271\230\347\247\257\344\270\272\346\255\243\346\225\260\347\232\204\346\234\200\351\225\277\345\255\220\346\225\260\347\273\204\351\225\277\345\272\246.md" rename to docs/solutions/1500-1599/maximum-length-of-subarray-with-positive-product.md diff --git "a/Solutions/1561. \344\275\240\345\217\257\344\273\245\350\216\267\345\276\227\347\232\204\346\234\200\345\244\247\347\241\254\345\270\201\346\225\260\347\233\256.md" b/docs/solutions/1500-1599/maximum-number-of-coins-you-can-get.md similarity index 100% rename from "Solutions/1561. \344\275\240\345\217\257\344\273\245\350\216\267\345\276\227\347\232\204\346\234\200\345\244\247\347\241\254\345\270\201\346\225\260\347\233\256.md" rename to docs/solutions/1500-1599/maximum-number-of-coins-you-can-get.md diff --git "a/Solutions/1584. \350\277\236\346\216\245\346\211\200\346\234\211\347\202\271\347\232\204\346\234\200\345\260\217\350\264\271\347\224\250.md" b/docs/solutions/1500-1599/min-cost-to-connect-all-points.md similarity index 100% rename from "Solutions/1584. \350\277\236\346\216\245\346\211\200\346\234\211\347\202\271\347\232\204\346\234\200\345\260\217\350\264\271\347\224\250.md" rename to docs/solutions/1500-1599/min-cost-to-connect-all-points.md diff --git "a/Solutions/1595. \350\277\236\351\200\232\344\270\244\347\273\204\347\202\271\347\232\204\346\234\200\345\260\217\346\210\220\346\234\254.md" b/docs/solutions/1500-1599/minimum-cost-to-connect-two-groups-of-points.md similarity index 100% rename from "Solutions/1595. \350\277\236\351\200\232\344\270\244\347\273\204\347\202\271\347\232\204\346\234\200\345\260\217\346\210\220\346\234\254.md" rename to docs/solutions/1500-1599/minimum-cost-to-connect-two-groups-of-points.md diff --git "a/Solutions/1547. \345\210\207\346\243\215\345\255\220\347\232\204\346\234\200\345\260\217\346\210\220\346\234\254.md" b/docs/solutions/1500-1599/minimum-cost-to-cut-a-stick.md similarity index 100% rename from "Solutions/1547. \345\210\207\346\243\215\345\255\220\347\232\204\346\234\200\345\260\217\346\210\220\346\234\254.md" rename to docs/solutions/1500-1599/minimum-cost-to-cut-a-stick.md diff --git "a/Solutions/1551. \344\275\277\346\225\260\347\273\204\344\270\255\346\211\200\346\234\211\345\205\203\347\264\240\347\233\270\347\255\211\347\232\204\346\234\200\345\260\217\346\223\215\344\275\234\346\225\260.md" b/docs/solutions/1500-1599/minimum-operations-to-make-array-equal.md similarity index 100% rename from "Solutions/1551. \344\275\277\346\225\260\347\273\204\344\270\255\346\211\200\346\234\211\345\205\203\347\264\240\347\233\270\347\255\211\347\232\204\346\234\200\345\260\217\346\223\215\344\275\234\346\225\260.md" rename to docs/solutions/1500-1599/minimum-operations-to-make-array-equal.md diff --git "a/Solutions/1507. \350\275\254\345\217\230\346\227\245\346\234\237\346\240\274\345\274\217.md" b/docs/solutions/1500-1599/reformat-date.md similarity index 100% rename from "Solutions/1507. \350\275\254\345\217\230\346\227\245\346\234\237\346\240\274\345\274\217.md" rename to docs/solutions/1500-1599/reformat-date.md diff --git "a/Solutions/1582. \344\272\214\350\277\233\345\210\266\347\237\251\351\230\265\344\270\255\347\232\204\347\211\271\346\256\212\344\275\215\347\275\256.md" b/docs/solutions/1500-1599/special-positions-in-a-binary-matrix.md similarity index 100% rename from "Solutions/1582. \344\272\214\350\277\233\345\210\266\347\237\251\351\230\265\344\270\255\347\232\204\347\211\271\346\256\212\344\275\215\347\275\256.md" rename to docs/solutions/1500-1599/special-positions-in-a-binary-matrix.md diff --git "a/Solutions/1593. \346\213\206\345\210\206\345\255\227\347\254\246\344\270\262\344\275\277\345\224\257\344\270\200\345\255\220\345\255\227\347\254\246\344\270\262\347\232\204\346\225\260\347\233\256\346\234\200\345\244\247.md" b/docs/solutions/1500-1599/split-a-string-into-the-max-number-of-unique-substrings.md similarity index 100% rename from "Solutions/1593. \346\213\206\345\210\206\345\255\227\347\254\246\344\270\262\344\275\277\345\224\257\344\270\200\345\255\220\345\255\227\347\254\246\344\270\262\347\232\204\346\225\260\347\233\256\346\234\200\345\244\247.md" rename to docs/solutions/1500-1599/split-a-string-into-the-max-number-of-unique-substrings.md diff --git "a/Solutions/1556. \345\215\203\344\275\215\345\210\206\351\232\224\346\225\260.md" b/docs/solutions/1500-1599/thousand-separator.md similarity index 100% rename from "Solutions/1556. \345\215\203\344\275\215\345\210\206\351\232\224\346\225\260.md" rename to docs/solutions/1500-1599/thousand-separator.md diff --git "a/Solutions/1641. \347\273\237\350\256\241\345\255\227\345\205\270\345\272\217\345\205\203\351\237\263\345\255\227\347\254\246\344\270\262\347\232\204\346\225\260\347\233\256.md" b/docs/solutions/1600-1699/count-sorted-vowel-strings.md similarity index 100% rename from "Solutions/1641. \347\273\237\350\256\241\345\255\227\345\205\270\345\272\217\345\205\203\351\237\263\345\255\227\347\254\246\344\270\262\347\232\204\346\225\260\347\233\256.md" rename to docs/solutions/1600-1699/count-sorted-vowel-strings.md diff --git "a/Solutions/1617. \347\273\237\350\256\241\345\255\220\346\240\221\344\270\255\345\237\216\345\270\202\344\271\213\351\227\264\346\234\200\345\244\247\350\267\235\347\246\273.md" b/docs/solutions/1600-1699/count-subtrees-with-max-distance-between-cities.md similarity index 100% rename from "Solutions/1617. \347\273\237\350\256\241\345\255\220\346\240\221\344\270\255\345\237\216\345\270\202\344\271\213\351\227\264\346\234\200\345\244\247\350\267\235\347\246\273.md" rename to docs/solutions/1600-1699/count-subtrees-with-max-distance-between-cities.md diff --git "a/Solutions/1603. \350\256\276\350\256\241\345\201\234\350\275\246\347\263\273\347\273\237.md" b/docs/solutions/1600-1699/design-parking-system.md similarity index 100% rename from "Solutions/1603. \350\256\276\350\256\241\345\201\234\350\275\246\347\263\273\347\273\237.md" rename to docs/solutions/1600-1699/design-parking-system.md diff --git "a/Solutions/1657. \347\241\256\345\256\232\344\270\244\344\270\252\345\255\227\347\254\246\344\270\262\346\230\257\345\220\246\346\216\245\350\277\221.md" b/docs/solutions/1600-1699/determine-if-two-strings-are-close.md similarity index 100% rename from "Solutions/1657. \347\241\256\345\256\232\344\270\244\344\270\252\345\255\227\347\254\246\344\270\262\346\230\257\345\220\246\346\216\245\350\277\221.md" rename to docs/solutions/1600-1699/determine-if-two-strings-are-close.md diff --git "a/Solutions/1605. \347\273\231\345\256\232\350\241\214\345\222\214\345\210\227\347\232\204\345\222\214\346\261\202\345\217\257\350\241\214\347\237\251\351\230\265.md" b/docs/solutions/1600-1699/find-valid-matrix-given-row-and-column-sums.md similarity index 100% rename from "Solutions/1605. \347\273\231\345\256\232\350\241\214\345\222\214\345\210\227\347\232\204\345\222\214\346\261\202\345\217\257\350\241\214\347\237\251\351\230\265.md" rename to docs/solutions/1600-1699/find-valid-matrix-given-row-and-column-sums.md diff --git "a/Solutions/1646. \350\216\267\345\217\226\347\224\237\346\210\220\346\225\260\347\273\204\344\270\255\347\232\204\346\234\200\345\244\247\345\200\274.md" b/docs/solutions/1600-1699/get-maximum-in-generated-array.md similarity index 100% rename from "Solutions/1646. \350\216\267\345\217\226\347\224\237\346\210\220\346\225\260\347\273\204\344\270\255\347\232\204\346\234\200\345\244\247\345\200\274.md" rename to docs/solutions/1600-1699/get-maximum-in-generated-array.md diff --git a/docs/solutions/1600-1699/index.md b/docs/solutions/1600-1699/index.md new file mode 100644 index 00000000..88784af4 --- /dev/null +++ b/docs/solutions/1600-1699/index.md @@ -0,0 +1,15 @@ +## 本章内容 + +- [1603. 设计停车系统](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/design-parking-system.md) +- [1605. 给定行和列的和求可行矩阵](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/find-valid-matrix-given-row-and-column-sums.md) +- [1614. 括号的最大嵌套深度](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/maximum-nesting-depth-of-the-parentheses.md) +- [1617. 统计子树中城市之间最大距离](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/count-subtrees-with-max-distance-between-cities.md) +- [1631. 最小体力消耗路径](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/path-with-minimum-effort.md) +- [1641. 统计字典序元音字符串的数目](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/count-sorted-vowel-strings.md) +- [1646. 获取生成数组中的最大值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/get-maximum-in-generated-array.md) +- [1647. 字符频次唯一的最小删除次数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/minimum-deletions-to-make-character-frequencies-unique.md) +- [1657. 确定两个字符串是否接近](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/determine-if-two-strings-are-close.md) +- [1658. 将 x 减到 0 的最小操作数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/minimum-operations-to-reduce-x-to-zero.md) +- [1672. 最富有客户的资产总量](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/richest-customer-wealth.md) +- [1695. 删除子数组的最大得分](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/maximum-erasure-value.md) +- [1698. 字符串的不同子字符串个数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/number-of-distinct-substrings-in-a-string.md) diff --git "a/Solutions/1695. \345\210\240\351\231\244\345\255\220\346\225\260\347\273\204\347\232\204\346\234\200\345\244\247\345\276\227\345\210\206.md" b/docs/solutions/1600-1699/maximum-erasure-value.md similarity index 100% rename from "Solutions/1695. \345\210\240\351\231\244\345\255\220\346\225\260\347\273\204\347\232\204\346\234\200\345\244\247\345\276\227\345\210\206.md" rename to docs/solutions/1600-1699/maximum-erasure-value.md diff --git "a/Solutions/1614. \346\213\254\345\217\267\347\232\204\346\234\200\345\244\247\345\265\214\345\245\227\346\267\261\345\272\246.md" b/docs/solutions/1600-1699/maximum-nesting-depth-of-the-parentheses.md similarity index 100% rename from "Solutions/1614. \346\213\254\345\217\267\347\232\204\346\234\200\345\244\247\345\265\214\345\245\227\346\267\261\345\272\246.md" rename to docs/solutions/1600-1699/maximum-nesting-depth-of-the-parentheses.md diff --git "a/Solutions/1647. \345\255\227\347\254\246\351\242\221\346\254\241\345\224\257\344\270\200\347\232\204\346\234\200\345\260\217\345\210\240\351\231\244\346\254\241\346\225\260.md" b/docs/solutions/1600-1699/minimum-deletions-to-make-character-frequencies-unique.md similarity index 100% rename from "Solutions/1647. \345\255\227\347\254\246\351\242\221\346\254\241\345\224\257\344\270\200\347\232\204\346\234\200\345\260\217\345\210\240\351\231\244\346\254\241\346\225\260.md" rename to docs/solutions/1600-1699/minimum-deletions-to-make-character-frequencies-unique.md diff --git "a/Solutions/1658. \345\260\206 x \345\207\217\345\210\260 0 \347\232\204\346\234\200\345\260\217\346\223\215\344\275\234\346\225\260.md" b/docs/solutions/1600-1699/minimum-operations-to-reduce-x-to-zero.md similarity index 100% rename from "Solutions/1658. \345\260\206 x \345\207\217\345\210\260 0 \347\232\204\346\234\200\345\260\217\346\223\215\344\275\234\346\225\260.md" rename to docs/solutions/1600-1699/minimum-operations-to-reduce-x-to-zero.md diff --git "a/Solutions/1698. \345\255\227\347\254\246\344\270\262\347\232\204\344\270\215\345\220\214\345\255\220\345\255\227\347\254\246\344\270\262\344\270\252\346\225\260.md" b/docs/solutions/1600-1699/number-of-distinct-substrings-in-a-string.md similarity index 100% rename from "Solutions/1698. \345\255\227\347\254\246\344\270\262\347\232\204\344\270\215\345\220\214\345\255\220\345\255\227\347\254\246\344\270\262\344\270\252\346\225\260.md" rename to docs/solutions/1600-1699/number-of-distinct-substrings-in-a-string.md diff --git "a/Solutions/1631. \346\234\200\345\260\217\344\275\223\345\212\233\346\266\210\350\200\227\350\267\257\345\276\204.md" b/docs/solutions/1600-1699/path-with-minimum-effort.md similarity index 100% rename from "Solutions/1631. \346\234\200\345\260\217\344\275\223\345\212\233\346\266\210\350\200\227\350\267\257\345\276\204.md" rename to docs/solutions/1600-1699/path-with-minimum-effort.md diff --git "a/Solutions/1672. \346\234\200\345\257\214\346\234\211\345\256\242\346\210\267\347\232\204\350\265\204\344\272\247\346\200\273\351\207\217.md" b/docs/solutions/1600-1699/richest-customer-wealth.md similarity index 100% rename from "Solutions/1672. \346\234\200\345\257\214\346\234\211\345\256\242\346\210\267\347\232\204\350\265\204\344\272\247\346\200\273\351\207\217.md" rename to docs/solutions/1600-1699/richest-customer-wealth.md diff --git "a/Solutions/1716. \350\256\241\347\256\227\345\212\233\346\211\243\351\223\266\350\241\214\347\232\204\351\222\261.md" b/docs/solutions/1700-1799/calculate-money-in-leetcode-bank.md similarity index 100% rename from "Solutions/1716. \350\256\241\347\256\227\345\212\233\346\211\243\351\223\266\350\241\214\347\232\204\351\222\261.md" rename to docs/solutions/1700-1799/calculate-money-in-leetcode-bank.md diff --git "a/Solutions/1790. \344\273\205\346\211\247\350\241\214\344\270\200\346\254\241\345\255\227\347\254\246\344\270\262\344\272\244\346\215\242\350\203\275\345\220\246\344\275\277\344\270\244\344\270\252\345\255\227\347\254\246\344\270\262\347\233\270\347\255\211.md" b/docs/solutions/1700-1799/check-if-one-string-swap-can-make-strings-equal.md similarity index 100% rename from "Solutions/1790. \344\273\205\346\211\247\350\241\214\344\270\200\346\254\241\345\255\227\347\254\246\344\270\262\344\272\244\346\215\242\350\203\275\345\220\246\344\275\277\344\270\244\344\270\252\345\255\227\347\254\246\344\270\262\347\233\270\347\255\211.md" rename to docs/solutions/1700-1799/check-if-one-string-swap-can-make-strings-equal.md diff --git "a/Solutions/1720. \350\247\243\347\240\201\345\274\202\346\210\226\345\220\216\347\232\204\346\225\260\347\273\204.md" b/docs/solutions/1700-1799/decode-xored-array.md similarity index 100% rename from "Solutions/1720. \350\247\243\347\240\201\345\274\202\346\210\226\345\220\216\347\232\204\346\225\260\347\273\204.md" rename to docs/solutions/1700-1799/decode-xored-array.md diff --git "a/Solutions/1791. \346\211\276\345\207\272\346\230\237\345\236\213\345\233\276\347\232\204\344\270\255\345\277\203\350\212\202\347\202\271.md" b/docs/solutions/1700-1799/find-center-of-star-graph.md similarity index 100% rename from "Solutions/1791. \346\211\276\345\207\272\346\230\237\345\236\213\345\233\276\347\232\204\344\270\255\345\277\203\350\212\202\347\202\271.md" rename to docs/solutions/1700-1799/find-center-of-star-graph.md diff --git "a/Solutions/1779. \346\211\276\345\210\260\346\234\200\350\277\221\347\232\204\346\234\211\347\233\270\345\220\214 X \346\210\226 Y \345\235\220\346\240\207\347\232\204\347\202\271.md" b/docs/solutions/1700-1799/find-nearest-point-that-has-the-same-x-or-y-coordinate.md similarity index 100% rename from "Solutions/1779. \346\211\276\345\210\260\346\234\200\350\277\221\347\232\204\346\234\211\347\233\270\345\220\214 X \346\210\226 Y \345\235\220\346\240\207\347\232\204\347\202\271.md" rename to docs/solutions/1700-1799/find-nearest-point-that-has-the-same-x-or-y-coordinate.md diff --git a/docs/solutions/1700-1799/index.md b/docs/solutions/1700-1799/index.md new file mode 100644 index 00000000..032c55e2 --- /dev/null +++ b/docs/solutions/1700-1799/index.md @@ -0,0 +1,13 @@ +## 本章内容 + +- [1710. 卡车上的最大单元数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/maximum-units-on-a-truck.md) +- [1716. 计算力扣银行的钱](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/calculate-money-in-leetcode-bank.md) +- [1720. 解码异或后的数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/decode-xored-array.md) +- [1726. 同积元组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/tuple-with-same-product.md) +- [1736. 替换隐藏数字得到的最晚时间](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/latest-time-by-replacing-hidden-digits.md) +- [1742. 盒子中小球的最大数量](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/maximum-number-of-balls-in-a-box.md) +- [1749. 任意子数组和的绝对值的最大值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/maximum-absolute-sum-of-any-subarray.md) +- [1763. 最长的美好子字符串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/longest-nice-substring.md) +- [1779. 找到最近的有相同 X 或 Y 坐标的点](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/find-nearest-point-that-has-the-same-x-or-y-coordinate.md) +- [1790. 仅执行一次字符串交换能否使两个字符串相等](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/check-if-one-string-swap-can-make-strings-equal.md) +- [1791. 找出星型图的中心节点](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/find-center-of-star-graph.md) diff --git "a/Solutions/1736. \346\233\277\346\215\242\351\232\220\350\227\217\346\225\260\345\255\227\345\276\227\345\210\260\347\232\204\346\234\200\346\231\232\346\227\266\351\227\264.md" b/docs/solutions/1700-1799/latest-time-by-replacing-hidden-digits.md similarity index 100% rename from "Solutions/1736. \346\233\277\346\215\242\351\232\220\350\227\217\346\225\260\345\255\227\345\276\227\345\210\260\347\232\204\346\234\200\346\231\232\346\227\266\351\227\264.md" rename to docs/solutions/1700-1799/latest-time-by-replacing-hidden-digits.md diff --git "a/Solutions/1763. \346\234\200\351\225\277\347\232\204\347\276\216\345\245\275\345\255\220\345\255\227\347\254\246\344\270\262.md" b/docs/solutions/1700-1799/longest-nice-substring.md similarity index 100% rename from "Solutions/1763. \346\234\200\351\225\277\347\232\204\347\276\216\345\245\275\345\255\220\345\255\227\347\254\246\344\270\262.md" rename to docs/solutions/1700-1799/longest-nice-substring.md diff --git "a/Solutions/1749. \344\273\273\346\204\217\345\255\220\346\225\260\347\273\204\345\222\214\347\232\204\347\273\235\345\257\271\345\200\274\347\232\204\346\234\200\345\244\247\345\200\274.md" b/docs/solutions/1700-1799/maximum-absolute-sum-of-any-subarray.md similarity index 100% rename from "Solutions/1749. \344\273\273\346\204\217\345\255\220\346\225\260\347\273\204\345\222\214\347\232\204\347\273\235\345\257\271\345\200\274\347\232\204\346\234\200\345\244\247\345\200\274.md" rename to docs/solutions/1700-1799/maximum-absolute-sum-of-any-subarray.md diff --git "a/Solutions/1742. \347\233\222\345\255\220\344\270\255\345\260\217\347\220\203\347\232\204\346\234\200\345\244\247\346\225\260\351\207\217.md" b/docs/solutions/1700-1799/maximum-number-of-balls-in-a-box.md similarity index 100% rename from "Solutions/1742. \347\233\222\345\255\220\344\270\255\345\260\217\347\220\203\347\232\204\346\234\200\345\244\247\346\225\260\351\207\217.md" rename to docs/solutions/1700-1799/maximum-number-of-balls-in-a-box.md diff --git "a/Solutions/1710. \345\215\241\350\275\246\344\270\212\347\232\204\346\234\200\345\244\247\345\215\225\345\205\203\346\225\260.md" b/docs/solutions/1700-1799/maximum-units-on-a-truck.md similarity index 100% rename from "Solutions/1710. \345\215\241\350\275\246\344\270\212\347\232\204\346\234\200\345\244\247\345\215\225\345\205\203\346\225\260.md" rename to docs/solutions/1700-1799/maximum-units-on-a-truck.md diff --git "a/Solutions/1726. \345\220\214\347\247\257\345\205\203\347\273\204.md" b/docs/solutions/1700-1799/tuple-with-same-product.md similarity index 100% rename from "Solutions/1726. \345\220\214\347\247\257\345\205\203\347\273\204.md" rename to docs/solutions/1700-1799/tuple-with-same-product.md diff --git "a/Solutions/1893. \346\243\200\346\237\245\346\230\257\345\220\246\345\214\272\345\237\237\345\206\205\346\211\200\346\234\211\346\225\264\346\225\260\351\203\275\350\242\253\350\246\206\347\233\226.md" b/docs/solutions/1800-1899/check-if-all-the-integers-in-a-range-are-covered.md similarity index 100% rename from "Solutions/1893. \346\243\200\346\237\245\346\230\257\345\220\246\345\214\272\345\237\237\345\206\205\346\211\200\346\234\211\346\225\264\346\225\260\351\203\275\350\242\253\350\246\206\347\233\226.md" rename to docs/solutions/1800-1899/check-if-all-the-integers-in-a-range-are-covered.md diff --git a/docs/solutions/1800-1899/index.md b/docs/solutions/1800-1899/index.md new file mode 100644 index 00000000..e7e943c0 --- /dev/null +++ b/docs/solutions/1800-1899/index.md @@ -0,0 +1,13 @@ +## 本章内容 + +- [1822. 数组元素积的符号](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1800-1899/sign-of-the-product-of-an-array.md) +- [1827. 最少操作使数组递增](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1800-1899/minimum-operations-to-make-the-array-increasing.md) +- [1833. 雪糕的最大数量](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1800-1899/maximum-ice-cream-bars.md) +- [1844. 将所有数字用字符替换](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1800-1899/replace-all-digits-with-characters.md) +- [1858. 包含所有前缀的最长单词](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1800-1899/longest-word-with-all-prefixes.md) +- [1859. 将句子排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1800-1899/sorting-the-sentence.md) +- [1876. 长度为三且各字符不同的子字符串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1800-1899/substrings-of-size-three-with-distinct-characters.md) +- [1877. 数组中最大数对和的最小值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1800-1899/minimize-maximum-pair-sum-in-array.md) +- [1879. 两个数组最小的异或值之和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1800-1899/minimum-xor-sum-of-two-arrays.md) +- [1893. 检查是否区域内所有整数都被覆盖](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1800-1899/check-if-all-the-integers-in-a-range-are-covered.md) +- [1897. 重新分配字符使所有字符串都相等](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1800-1899/redistribute-characters-to-make-all-strings-equal.md) diff --git "a/Solutions/1858. \345\214\205\345\220\253\346\211\200\346\234\211\345\211\215\347\274\200\347\232\204\346\234\200\351\225\277\345\215\225\350\257\215.md" b/docs/solutions/1800-1899/longest-word-with-all-prefixes.md similarity index 100% rename from "Solutions/1858. \345\214\205\345\220\253\346\211\200\346\234\211\345\211\215\347\274\200\347\232\204\346\234\200\351\225\277\345\215\225\350\257\215.md" rename to docs/solutions/1800-1899/longest-word-with-all-prefixes.md diff --git "a/Solutions/1833. \351\233\252\347\263\225\347\232\204\346\234\200\345\244\247\346\225\260\351\207\217.md" b/docs/solutions/1800-1899/maximum-ice-cream-bars.md similarity index 100% rename from "Solutions/1833. \351\233\252\347\263\225\347\232\204\346\234\200\345\244\247\346\225\260\351\207\217.md" rename to docs/solutions/1800-1899/maximum-ice-cream-bars.md diff --git "a/Solutions/1877. \346\225\260\347\273\204\344\270\255\346\234\200\345\244\247\346\225\260\345\257\271\345\222\214\347\232\204\346\234\200\345\260\217\345\200\274.md" b/docs/solutions/1800-1899/minimize-maximum-pair-sum-in-array.md similarity index 100% rename from "Solutions/1877. \346\225\260\347\273\204\344\270\255\346\234\200\345\244\247\346\225\260\345\257\271\345\222\214\347\232\204\346\234\200\345\260\217\345\200\274.md" rename to docs/solutions/1800-1899/minimize-maximum-pair-sum-in-array.md diff --git "a/Solutions/1827. \346\234\200\345\260\221\346\223\215\344\275\234\344\275\277\346\225\260\347\273\204\351\200\222\345\242\236.md" b/docs/solutions/1800-1899/minimum-operations-to-make-the-array-increasing.md similarity index 100% rename from "Solutions/1827. \346\234\200\345\260\221\346\223\215\344\275\234\344\275\277\346\225\260\347\273\204\351\200\222\345\242\236.md" rename to docs/solutions/1800-1899/minimum-operations-to-make-the-array-increasing.md diff --git "a/Solutions/1879. \344\270\244\344\270\252\346\225\260\347\273\204\346\234\200\345\260\217\347\232\204\345\274\202\346\210\226\345\200\274\344\271\213\345\222\214.md" b/docs/solutions/1800-1899/minimum-xor-sum-of-two-arrays.md similarity index 100% rename from "Solutions/1879. \344\270\244\344\270\252\346\225\260\347\273\204\346\234\200\345\260\217\347\232\204\345\274\202\346\210\226\345\200\274\344\271\213\345\222\214.md" rename to docs/solutions/1800-1899/minimum-xor-sum-of-two-arrays.md diff --git "a/Solutions/1897. \351\207\215\346\226\260\345\210\206\351\205\215\345\255\227\347\254\246\344\275\277\346\211\200\346\234\211\345\255\227\347\254\246\344\270\262\351\203\275\347\233\270\347\255\211.md" b/docs/solutions/1800-1899/redistribute-characters-to-make-all-strings-equal.md similarity index 100% rename from "Solutions/1897. \351\207\215\346\226\260\345\210\206\351\205\215\345\255\227\347\254\246\344\275\277\346\211\200\346\234\211\345\255\227\347\254\246\344\270\262\351\203\275\347\233\270\347\255\211.md" rename to docs/solutions/1800-1899/redistribute-characters-to-make-all-strings-equal.md diff --git "a/Solutions/1844. \345\260\206\346\211\200\346\234\211\346\225\260\345\255\227\347\224\250\345\255\227\347\254\246\346\233\277\346\215\242.md" b/docs/solutions/1800-1899/replace-all-digits-with-characters.md similarity index 100% rename from "Solutions/1844. \345\260\206\346\211\200\346\234\211\346\225\260\345\255\227\347\224\250\345\255\227\347\254\246\346\233\277\346\215\242.md" rename to docs/solutions/1800-1899/replace-all-digits-with-characters.md diff --git "a/Solutions/1822. \346\225\260\347\273\204\345\205\203\347\264\240\347\247\257\347\232\204\347\254\246\345\217\267.md" b/docs/solutions/1800-1899/sign-of-the-product-of-an-array.md similarity index 100% rename from "Solutions/1822. \346\225\260\347\273\204\345\205\203\347\264\240\347\247\257\347\232\204\347\254\246\345\217\267.md" rename to docs/solutions/1800-1899/sign-of-the-product-of-an-array.md diff --git "a/Solutions/1859. \345\260\206\345\217\245\345\255\220\346\216\222\345\272\217.md" b/docs/solutions/1800-1899/sorting-the-sentence.md similarity index 100% rename from "Solutions/1859. \345\260\206\345\217\245\345\255\220\346\216\222\345\272\217.md" rename to docs/solutions/1800-1899/sorting-the-sentence.md diff --git "a/Solutions/1876. \351\225\277\345\272\246\344\270\272\344\270\211\344\270\224\345\220\204\345\255\227\347\254\246\344\270\215\345\220\214\347\232\204\345\255\220\345\255\227\347\254\246\344\270\262.md" b/docs/solutions/1800-1899/substrings-of-size-three-with-distinct-characters.md similarity index 100% rename from "Solutions/1876. \351\225\277\345\272\246\344\270\272\344\270\211\344\270\224\345\220\204\345\255\227\347\254\246\344\270\215\345\220\214\347\232\204\345\255\220\345\255\227\347\254\246\344\270\262.md" rename to docs/solutions/1800-1899/substrings-of-size-three-with-distinct-characters.md diff --git "a/Solutions/1936. \346\226\260\345\242\236\347\232\204\346\234\200\345\260\221\345\217\260\351\230\266\346\225\260.md" b/docs/solutions/1900-1999/add-minimum-number-of-rungs.md similarity index 100% rename from "Solutions/1936. \346\226\260\345\242\236\347\232\204\346\234\200\345\260\221\345\217\260\351\230\266\346\225\260.md" rename to docs/solutions/1900-1999/add-minimum-number-of-rungs.md diff --git "a/Solutions/1941. \346\243\200\346\237\245\346\230\257\345\220\246\346\211\200\346\234\211\345\255\227\347\254\246\345\207\272\347\216\260\346\254\241\346\225\260\347\233\270\345\220\214.md" b/docs/solutions/1900-1999/check-if-all-characters-have-equal-number-of-occurrences.md similarity index 100% rename from "Solutions/1941. \346\243\200\346\237\245\346\230\257\345\220\246\346\211\200\346\234\211\345\255\227\347\254\246\345\207\272\347\216\260\346\254\241\346\225\260\347\233\270\345\220\214.md" rename to docs/solutions/1900-1999/check-if-all-characters-have-equal-number-of-occurrences.md diff --git "a/Solutions/1929. \346\225\260\347\273\204\344\270\262\350\201\224.md" b/docs/solutions/1900-1999/concatenation-of-array.md similarity index 100% rename from "Solutions/1929. \346\225\260\347\273\204\344\270\262\350\201\224.md" rename to docs/solutions/1900-1999/concatenation-of-array.md diff --git "a/Solutions/1925. \347\273\237\350\256\241\345\271\263\346\226\271\345\222\214\344\270\211\345\205\203\347\273\204\347\232\204\346\225\260\347\233\256.md" b/docs/solutions/1900-1999/count-square-sum-triples.md similarity index 100% rename from "Solutions/1925. \347\273\237\350\256\241\345\271\263\346\226\271\345\222\214\344\270\211\345\205\203\347\273\204\347\232\204\346\225\260\347\233\256.md" rename to docs/solutions/1900-1999/count-square-sum-triples.md diff --git "a/Solutions/1921. \346\266\210\347\201\255\346\200\252\347\211\251\347\232\204\346\234\200\345\244\247\346\225\260\351\207\217.md" b/docs/solutions/1900-1999/eliminate-maximum-number-of-monsters.md similarity index 100% rename from "Solutions/1921. \346\266\210\347\201\255\346\200\252\347\211\251\347\232\204\346\234\200\345\244\247\346\225\260\351\207\217.md" rename to docs/solutions/1900-1999/eliminate-maximum-number-of-monsters.md diff --git "a/Solutions/1991. \346\211\276\345\210\260\346\225\260\347\273\204\347\232\204\344\270\255\351\227\264\344\275\215\347\275\256.md" b/docs/solutions/1900-1999/find-the-middle-index-in-array.md similarity index 100% rename from "Solutions/1991. \346\211\276\345\210\260\346\225\260\347\273\204\347\232\204\344\270\255\351\227\264\344\275\215\347\275\256.md" rename to docs/solutions/1900-1999/find-the-middle-index-in-array.md diff --git a/docs/solutions/1900-1999/index.md b/docs/solutions/1900-1999/index.md new file mode 100644 index 00000000..16d32f62 --- /dev/null +++ b/docs/solutions/1900-1999/index.md @@ -0,0 +1,14 @@ +## 本章内容 + +- [1903. 字符串中的最大奇数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/largest-odd-number-in-string.md) +- [1921. 消灭怪物的最大数量](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/eliminate-maximum-number-of-monsters.md) +- [1925. 统计平方和三元组的数目](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/count-square-sum-triples.md) +- [1929. 数组串联](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/concatenation-of-array.md) +- [1930. 长度为 3 的不同回文子序列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/unique-length-3-palindromic-subsequences.md) +- [1936. 新增的最少台阶数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/add-minimum-number-of-rungs.md) +- [1941. 检查是否所有字符出现次数相同](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/check-if-all-characters-have-equal-number-of-occurrences.md) +- [1947. 最大兼容性评分和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/maximum-compatibility-score-sum.md) +- [1984. 学生分数的最小差值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/minimum-difference-between-highest-and-lowest-of-k-scores.md) +- [1986. 完成任务的最少工作时间段](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/minimum-number-of-work-sessions-to-finish-the-tasks.md) +- [1991. 找到数组的中间位置](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/find-the-middle-index-in-array.md) +- [1994. 好子集的数目](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/the-number-of-good-subsets.md) diff --git "a/Solutions/1903. \345\255\227\347\254\246\344\270\262\344\270\255\347\232\204\346\234\200\345\244\247\345\245\207\346\225\260.md" b/docs/solutions/1900-1999/largest-odd-number-in-string.md similarity index 100% rename from "Solutions/1903. \345\255\227\347\254\246\344\270\262\344\270\255\347\232\204\346\234\200\345\244\247\345\245\207\346\225\260.md" rename to docs/solutions/1900-1999/largest-odd-number-in-string.md diff --git "a/Solutions/1947. \346\234\200\345\244\247\345\205\274\345\256\271\346\200\247\350\257\204\345\210\206\345\222\214.md" b/docs/solutions/1900-1999/maximum-compatibility-score-sum.md similarity index 100% rename from "Solutions/1947. \346\234\200\345\244\247\345\205\274\345\256\271\346\200\247\350\257\204\345\210\206\345\222\214.md" rename to docs/solutions/1900-1999/maximum-compatibility-score-sum.md diff --git "a/Solutions/1984. \345\255\246\347\224\237\345\210\206\346\225\260\347\232\204\346\234\200\345\260\217\345\267\256\345\200\274.md" b/docs/solutions/1900-1999/minimum-difference-between-highest-and-lowest-of-k-scores.md similarity index 100% rename from "Solutions/1984. \345\255\246\347\224\237\345\210\206\346\225\260\347\232\204\346\234\200\345\260\217\345\267\256\345\200\274.md" rename to docs/solutions/1900-1999/minimum-difference-between-highest-and-lowest-of-k-scores.md diff --git "a/Solutions/1986. \345\256\214\346\210\220\344\273\273\345\212\241\347\232\204\346\234\200\345\260\221\345\267\245\344\275\234\346\227\266\351\227\264\346\256\265.md" b/docs/solutions/1900-1999/minimum-number-of-work-sessions-to-finish-the-tasks.md similarity index 100% rename from "Solutions/1986. \345\256\214\346\210\220\344\273\273\345\212\241\347\232\204\346\234\200\345\260\221\345\267\245\344\275\234\346\227\266\351\227\264\346\256\265.md" rename to docs/solutions/1900-1999/minimum-number-of-work-sessions-to-finish-the-tasks.md diff --git "a/Solutions/1994. \345\245\275\345\255\220\351\233\206\347\232\204\346\225\260\347\233\256.md" b/docs/solutions/1900-1999/the-number-of-good-subsets.md similarity index 100% rename from "Solutions/1994. \345\245\275\345\255\220\351\233\206\347\232\204\346\225\260\347\233\256.md" rename to docs/solutions/1900-1999/the-number-of-good-subsets.md diff --git "a/Solutions/1930. \351\225\277\345\272\246\344\270\272 3 \347\232\204\344\270\215\345\220\214\345\233\236\346\226\207\345\255\220\345\272\217\345\210\227.md" b/docs/solutions/1900-1999/unique-length-3-palindromic-subsequences.md similarity index 100% rename from "Solutions/1930. \351\225\277\345\272\246\344\270\272 3 \347\232\204\344\270\215\345\220\214\345\233\236\346\226\207\345\255\220\345\272\217\345\210\227.md" rename to docs/solutions/1900-1999/unique-length-3-palindromic-subsequences.md diff --git "a/Solutions/2011. \346\211\247\350\241\214\346\223\215\344\275\234\345\220\216\347\232\204\345\217\230\351\207\217\345\200\274.md" b/docs/solutions/2000-2099/final-value-of-variable-after-performing-operations.md similarity index 100% rename from "Solutions/2011. \346\211\247\350\241\214\346\223\215\344\275\234\345\220\216\347\232\204\345\217\230\351\207\217\345\200\274.md" rename to docs/solutions/2000-2099/final-value-of-variable-after-performing-operations.md diff --git a/docs/solutions/2000-2099/index.md b/docs/solutions/2000-2099/index.md new file mode 100644 index 00000000..e3a63edb --- /dev/null +++ b/docs/solutions/2000-2099/index.md @@ -0,0 +1,5 @@ +## 本章内容 + +- [2011. 执行操作后的变量值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2000-2099/final-value-of-variable-after-performing-operations.md) +- [2023. 连接后等于目标字符串的字符串对](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2000-2099/number-of-pairs-of-strings-with-concatenation-equal-to-target.md) +- [2050. 并行课程 III](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2000-2099/parallel-courses-iii.md) diff --git "a/Solutions/2023. \350\277\236\346\216\245\345\220\216\347\255\211\344\272\216\347\233\256\346\240\207\345\255\227\347\254\246\344\270\262\347\232\204\345\255\227\347\254\246\344\270\262\345\257\271.md" b/docs/solutions/2000-2099/number-of-pairs-of-strings-with-concatenation-equal-to-target.md similarity index 100% rename from "Solutions/2023. \350\277\236\346\216\245\345\220\216\347\255\211\344\272\216\347\233\256\346\240\207\345\255\227\347\254\246\344\270\262\347\232\204\345\255\227\347\254\246\344\270\262\345\257\271.md" rename to docs/solutions/2000-2099/number-of-pairs-of-strings-with-concatenation-equal-to-target.md diff --git "a/Solutions/2050. \345\271\266\350\241\214\350\257\276\347\250\213 III.md" b/docs/solutions/2000-2099/parallel-courses-iii.md similarity index 100% rename from "Solutions/2050. \345\271\266\350\241\214\350\257\276\347\250\213 III.md" rename to docs/solutions/2000-2099/parallel-courses-iii.md diff --git "a/Solutions/2156. \346\237\245\346\211\276\347\273\231\345\256\232\345\223\210\345\270\214\345\200\274\347\232\204\345\255\220\344\270\262.md" b/docs/solutions/2100-2199/find-substring-with-given-hash-value.md similarity index 100% rename from "Solutions/2156. \346\237\245\346\211\276\347\273\231\345\256\232\345\223\210\345\270\214\345\200\274\347\232\204\345\255\220\344\270\262.md" rename to docs/solutions/2100-2199/find-substring-with-given-hash-value.md diff --git a/docs/solutions/2100-2199/index.md b/docs/solutions/2100-2199/index.md new file mode 100644 index 00000000..91ab61f0 --- /dev/null +++ b/docs/solutions/2100-2199/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [2156. 查找给定哈希值的子串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2100-2199/find-substring-with-given-hash-value.md) +- [2172. 数组的最大与和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2100-2199/maximum-and-sum-of-array.md) diff --git "a/Solutions/2172. \346\225\260\347\273\204\347\232\204\346\234\200\345\244\247\344\270\216\345\222\214.md" b/docs/solutions/2100-2199/maximum-and-sum-of-array.md similarity index 100% rename from "Solutions/2172. \346\225\260\347\273\204\347\232\204\346\234\200\345\244\247\344\270\216\345\222\214.md" rename to docs/solutions/2100-2199/maximum-and-sum-of-array.md diff --git "a/Solutions/2235. \344\270\244\346\225\264\346\225\260\347\233\270\345\212\240.md" b/docs/solutions/2200-2299/add-two-integers.md similarity index 100% rename from "Solutions/2235. \344\270\244\346\225\264\346\225\260\347\233\270\345\212\240.md" rename to docs/solutions/2200-2299/add-two-integers.md diff --git "a/Solutions/2276. \347\273\237\350\256\241\345\214\272\351\227\264\344\270\255\347\232\204\346\225\264\346\225\260\346\225\260\347\233\256.md" b/docs/solutions/2200-2299/count-integers-in-intervals.md similarity index 100% rename from "Solutions/2276. \347\273\237\350\256\241\345\214\272\351\227\264\344\270\255\347\232\204\346\225\264\346\225\260\346\225\260\347\233\256.md" rename to docs/solutions/2200-2299/count-integers-in-intervals.md diff --git "a/Solutions/2249. \347\273\237\350\256\241\345\234\206\345\206\205\346\240\274\347\202\271\346\225\260\347\233\256.md" b/docs/solutions/2200-2299/count-lattice-points-inside-a-circle.md similarity index 100% rename from "Solutions/2249. \347\273\237\350\256\241\345\234\206\345\206\205\346\240\274\347\202\271\346\225\260\347\233\256.md" rename to docs/solutions/2200-2299/count-lattice-points-inside-a-circle.md diff --git a/docs/solutions/2200-2299/index.md b/docs/solutions/2200-2299/index.md new file mode 100644 index 00000000..ce4a5920 --- /dev/null +++ b/docs/solutions/2200-2299/index.md @@ -0,0 +1,6 @@ +## 本章内容 + +- [2235. 两整数相加](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2200-2299/add-two-integers.md) +- [2246. 相邻字符不同的最长路径](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2200-2299/longest-path-with-different-adjacent-characters.md) +- [2249. 统计圆内格点数目](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2200-2299/count-lattice-points-inside-a-circle.md) +- [2276. 统计区间中的整数数目](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2200-2299/count-integers-in-intervals.md) diff --git "a/Solutions/2246. \347\233\270\351\202\273\345\255\227\347\254\246\344\270\215\345\220\214\347\232\204\346\234\200\351\225\277\350\267\257\345\276\204.md" b/docs/solutions/2200-2299/longest-path-with-different-adjacent-characters.md similarity index 100% rename from "Solutions/2246. \347\233\270\351\202\273\345\255\227\347\254\246\344\270\215\345\220\214\347\232\204\346\234\200\351\225\277\350\267\257\345\276\204.md" rename to docs/solutions/2200-2299/longest-path-with-different-adjacent-characters.md diff --git "a/Solutions/2376. \347\273\237\350\256\241\347\211\271\346\256\212\346\225\264\346\225\260.md" b/docs/solutions/2300-2399/count-special-integers.md similarity index 100% rename from "Solutions/2376. \347\273\237\350\256\241\347\211\271\346\256\212\346\225\264\346\225\260.md" rename to docs/solutions/2300-2399/count-special-integers.md diff --git a/docs/solutions/2300-2399/index.md b/docs/solutions/2300-2399/index.md new file mode 100644 index 00000000..19cffb9a --- /dev/null +++ b/docs/solutions/2300-2399/index.md @@ -0,0 +1,3 @@ +## 本章内容 + +- [2376. 统计特殊整数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2300-2399/count-special-integers.md) diff --git a/docs/solutions/2400-2499/index.md b/docs/solutions/2400-2499/index.md new file mode 100644 index 00000000..a5b8d945 --- /dev/null +++ b/docs/solutions/2400-2499/index.md @@ -0,0 +1,3 @@ +## 本章内容 + +- [2427. 公因子的数目](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2400-2499/number-of-common-factors.md) diff --git "a/Solutions/2427. \345\205\254\345\233\240\345\255\220\347\232\204\346\225\260\347\233\256.md" b/docs/solutions/2400-2499/number-of-common-factors.md similarity index 100% rename from "Solutions/2427. \345\205\254\345\233\240\345\255\220\347\232\204\346\225\260\347\233\256.md" rename to docs/solutions/2400-2499/number-of-common-factors.md diff --git "a/Solutions/2538. \346\234\200\345\244\247\344\273\267\345\200\274\345\222\214\344\270\216\346\234\200\345\260\217\344\273\267\345\200\274\345\222\214\347\232\204\345\267\256\345\200\274.md" b/docs/solutions/2500-2599/difference-between-maximum-and-minimum-price-sum.md similarity index 100% rename from "Solutions/2538. \346\234\200\345\244\247\344\273\267\345\200\274\345\222\214\344\270\216\346\234\200\345\260\217\344\273\267\345\200\274\345\222\214\347\232\204\345\267\256\345\200\274.md" rename to docs/solutions/2500-2599/difference-between-maximum-and-minimum-price-sum.md diff --git a/docs/solutions/2500-2599/index.md b/docs/solutions/2500-2599/index.md new file mode 100644 index 00000000..7a1ae3c8 --- /dev/null +++ b/docs/solutions/2500-2599/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [2538. 最大价值和与最小价值和的差值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2500-2599/difference-between-maximum-and-minimum-price-sum.md) +- [2585. 获得分数的方法数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2500-2599/number-of-ways-to-earn-points.md) diff --git "a/Solutions/2585. \350\216\267\345\276\227\345\210\206\346\225\260\347\232\204\346\226\271\346\263\225\346\225\260.md" b/docs/solutions/2500-2599/number-of-ways-to-earn-points.md similarity index 100% rename from "Solutions/2585. \350\216\267\345\276\227\345\210\206\346\225\260\347\232\204\346\226\271\346\263\225\346\225\260.md" rename to docs/solutions/2500-2599/number-of-ways-to-earn-points.md diff --git "a/Solutions/2719. \347\273\237\350\256\241\346\225\264\346\225\260\346\225\260\347\233\256.md" b/docs/solutions/2700-2799/count-of-integers.md similarity index 100% rename from "Solutions/2719. \347\273\237\350\256\241\346\225\264\346\225\260\346\225\260\347\233\256.md" rename to docs/solutions/2700-2799/count-of-integers.md diff --git a/docs/solutions/2700-2799/index.md b/docs/solutions/2700-2799/index.md new file mode 100644 index 00000000..24b33ddd --- /dev/null +++ b/docs/solutions/2700-2799/index.md @@ -0,0 +1,3 @@ +## 本章内容 + +- [2719. 统计整数数目](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2700-2799/count-of-integers.md) diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 075. \346\225\260\347\273\204\347\233\270\345\257\271\346\216\222\345\272\217.md" b/docs/solutions/LCR/0H97ZC.md similarity index 90% rename from "Solutions/\345\211\221\346\214\207 Offer II 075. \346\225\260\347\273\204\347\233\270\345\257\271\346\216\222\345\272\217.md" rename to docs/solutions/LCR/0H97ZC.md index c7ea2943..ea7e3ce5 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 075. \346\225\260\347\273\204\347\233\270\345\257\271\346\216\222\345\272\217.md" +++ b/docs/solutions/LCR/0H97ZC.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 075. 数组相对排序](https://leetcode.cn/problems/0H97ZC/) +# [LCR 075. 数组的相对排序](https://leetcode.cn/problems/0H97ZC/) - 标签：数组、哈希表、计数排序、排序 - 难度：简单 ## 题目链接 -- [剑指 Offer II 075. 数组相对排序 - 力扣](https://leetcode.cn/problems/0H97ZC/) +- [LCR 075. 数组的相对排序 - 力扣](https://leetcode.cn/problems/0H97ZC/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 087. \345\244\215\345\216\237 IP.md" b/docs/solutions/LCR/0on3uN.md similarity index 94% rename from "Solutions/\345\211\221\346\214\207 Offer II 087. \345\244\215\345\216\237 IP.md" rename to docs/solutions/LCR/0on3uN.md index 8bb162d2..1f76573f 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 087. \345\244\215\345\216\237 IP.md" +++ b/docs/solutions/LCR/0on3uN.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 087. 复原 IP](https://leetcode.cn/problems/0on3uN/) +# [LCR 087. 复原 IP 地址](https://leetcode.cn/problems/0on3uN/) - 标签：字符串、回溯 - 难度：中等 ## 题目链接 -- [剑指 Offer II 087. 复原 IP - 力扣](https://leetcode.cn/problems/0on3uN/) +- [LCR 087. 复原 IP 地址 - 力扣](https://leetcode.cn/problems/0on3uN/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 039. \347\233\264\346\226\271\345\233\276\346\234\200\345\244\247\347\237\251\345\275\242\351\235\242\347\247\257.md" b/docs/solutions/LCR/0ynMMM.md similarity index 92% rename from "Solutions/\345\211\221\346\214\207 Offer II 039. \347\233\264\346\226\271\345\233\276\346\234\200\345\244\247\347\237\251\345\275\242\351\235\242\347\247\257.md" rename to docs/solutions/LCR/0ynMMM.md index f5f87c1b..763a9886 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 039. \347\233\264\346\226\271\345\233\276\346\234\200\345\244\247\347\237\251\345\275\242\351\235\242\347\247\257.md" +++ b/docs/solutions/LCR/0ynMMM.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 039. 直方图最大矩形面积](https://leetcode.cn/problems/0ynMMM/) +# [LCR 039. 柱状图中最大的矩形](https://leetcode.cn/problems/0ynMMM/) - 标签：栈、数组、单调栈 - 难度：困难 ## 题目链接 -- [剑指 Offer II 039. 直方图最大矩形面积 - 力扣](https://leetcode.cn/problems/0ynMMM/) +- [LCR 039. 柱状图中最大的矩形 - 力扣](https://leetcode.cn/problems/0ynMMM/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 007. \346\225\260\347\273\204\344\270\255\345\222\214\344\270\272 0 \347\232\204\344\270\211\344\270\252\346\225\260.md" b/docs/solutions/LCR/1fGaJU.md similarity index 91% rename from "Solutions/\345\211\221\346\214\207 Offer II 007. \346\225\260\347\273\204\344\270\255\345\222\214\344\270\272 0 \347\232\204\344\270\211\344\270\252\346\225\260.md" rename to docs/solutions/LCR/1fGaJU.md index 680d5312..60c3a1b0 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 007. \346\225\260\347\273\204\344\270\255\345\222\214\344\270\272 0 \347\232\204\344\270\211\344\270\252\346\225\260.md" +++ b/docs/solutions/LCR/1fGaJU.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 007. 数组中和为 0 的三个数](https://leetcode.cn/problems/1fGaJU/) +# [LCR 007. 三数之和](https://leetcode.cn/problems/1fGaJU/) - 标签：数组、双指针、排序 - 难度：中等 ## 题目链接 -- [剑指 Offer II 007. 数组中和为 0 的三个数 - 力扣](https://leetcode.cn/problems/1fGaJU/) +- [LCR 007. 三数之和 - 力扣](https://leetcode.cn/problems/1fGaJU/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 097. \345\255\220\345\272\217\345\210\227\347\232\204\346\225\260\347\233\256.md" b/docs/solutions/LCR/21dk04.md similarity index 92% rename from "Solutions/\345\211\221\346\214\207 Offer II 097. \345\255\220\345\272\217\345\210\227\347\232\204\346\225\260\347\233\256.md" rename to docs/solutions/LCR/21dk04.md index 002657b8..339b0a0d 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 097. \345\255\220\345\272\217\345\210\227\347\232\204\346\225\260\347\233\256.md" +++ b/docs/solutions/LCR/21dk04.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 097. 子序列的数目](https://leetcode.cn/problems/21dk04/) +# [LCR 097. 不同的子序列](https://leetcode.cn/problems/21dk04/) - 标签：字符串、动态规划 - 难度：困难 ## 题目链接 -- [剑指 Offer II 097. 子序列的数目 - 力扣](https://leetcode.cn/problems/21dk04/) +- [LCR 097. 不同的子序列 - 力扣](https://leetcode.cn/problems/21dk04/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 098. \350\267\257\345\276\204\347\232\204\346\225\260\347\233\256.md" b/docs/solutions/LCR/2AoeFn.md similarity index 82% rename from "Solutions/\345\211\221\346\214\207 Offer II 098. \350\267\257\345\276\204\347\232\204\346\225\260\347\233\256.md" rename to docs/solutions/LCR/2AoeFn.md index d86c4f90..3d3d10cd 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 098. \350\267\257\345\276\204\347\232\204\346\225\260\347\233\256.md" +++ b/docs/solutions/LCR/2AoeFn.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 098. 路径的数目](https://leetcode.cn/problems/2AoeFn/) +# [LCR 098. 不同路径](https://leetcode.cn/problems/2AoeFn/) - 标签：数学、动态规划、组合数学 - 难度：中等 ## 题目链接 -- [剑指 Offer II 098. 路径的数目 - 力扣](https://leetcode.cn/problems/2AoeFn/) +- [LCR 098. 不同路径 - 力扣](https://leetcode.cn/problems/2AoeFn/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 008. \345\222\214\345\244\247\344\272\216\347\255\211\344\272\216 target \347\232\204\346\234\200\347\237\255\345\255\220\346\225\260\347\273\204.md" b/docs/solutions/LCR/2VG8Kg.md similarity index 88% rename from "Solutions/\345\211\221\346\214\207 Offer II 008. \345\222\214\345\244\247\344\272\216\347\255\211\344\272\216 target \347\232\204\346\234\200\347\237\255\345\255\220\346\225\260\347\273\204.md" rename to docs/solutions/LCR/2VG8Kg.md index 9921d1f3..e0dc88b9 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 008. \345\222\214\345\244\247\344\272\216\347\255\211\344\272\216 target \347\232\204\346\234\200\347\237\255\345\255\220\346\225\260\347\273\204.md" +++ b/docs/solutions/LCR/2VG8Kg.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 008. 和大于等于 target 的最短子数组](https://leetcode.cn/problems/2VG8Kg/) +# [LCR 008. 长度最小的子数组](https://leetcode.cn/problems/2VG8Kg/) - 标签：数组、二分查找、前缀和、滑动窗口 - 难度：中等 ## 题目链接 -- [剑指 Offer II 008. 和大于等于 target 的最短子数组 - 力扣](https://leetcode.cn/problems/2VG8Kg/) +- [LCR 008. 长度最小的子数组 - 力扣](https://leetcode.cn/problems/2VG8Kg/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 107. \347\237\251\351\230\265\344\270\255\347\232\204\350\267\235\347\246\273.md" b/docs/solutions/LCR/2bCMpM.md similarity index 91% rename from "Solutions/\345\211\221\346\214\207 Offer II 107. \347\237\251\351\230\265\344\270\255\347\232\204\350\267\235\347\246\273.md" rename to docs/solutions/LCR/2bCMpM.md index 235b3ff4..8305c5ba 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 107. \347\237\251\351\230\265\344\270\255\347\232\204\350\267\235\347\246\273.md" +++ b/docs/solutions/LCR/2bCMpM.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 107. 矩阵中的距离](https://leetcode.cn/problems/2bCMpM/) +# [LCR 107. 01 矩阵](https://leetcode.cn/problems/2bCMpM/) - 标签：广度优先搜索、数组、动态规划、矩阵 - 难度：中等 ## 题目链接 -- [剑指 Offer II 107. 矩阵中的距离 - 力扣](https://leetcode.cn/problems/2bCMpM/) +- [LCR 107. 01 矩阵 - 力扣](https://leetcode.cn/problems/2bCMpM/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 049. \344\273\216\346\240\271\350\212\202\347\202\271\345\210\260\345\217\266\350\212\202\347\202\271\347\232\204\350\267\257\345\276\204\346\225\260\345\255\227\344\271\213\345\222\214.md" b/docs/solutions/LCR/3Etpl5.md similarity index 82% rename from "Solutions/\345\211\221\346\214\207 Offer II 049. \344\273\216\346\240\271\350\212\202\347\202\271\345\210\260\345\217\266\350\212\202\347\202\271\347\232\204\350\267\257\345\276\204\346\225\260\345\255\227\344\271\213\345\222\214.md" rename to docs/solutions/LCR/3Etpl5.md index 69169059..42aa525a 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 049. \344\273\216\346\240\271\350\212\202\347\202\271\345\210\260\345\217\266\350\212\202\347\202\271\347\232\204\350\267\257\345\276\204\346\225\260\345\255\227\344\271\213\345\222\214.md" +++ b/docs/solutions/LCR/3Etpl5.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 049. 从根节点到叶节点的路径数字之和](https://leetcode.cn/problems/3Etpl5/) +# [LCR 049. 求根节点到叶节点数字之和](https://leetcode.cn/problems/3Etpl5/) - 标签：树、深度优先搜索、二叉树 - 难度：中等 ## 题目链接 -- [剑指 Offer II 049. 从根节点到叶节点的路径数字之和 - 力扣](https://leetcode.cn/problems/3Etpl5/) +- [LCR 049. 求根节点到叶节点数字之和 - 力扣](https://leetcode.cn/problems/3Etpl5/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 023. \344\270\244\344\270\252\351\223\276\350\241\250\347\232\204\347\254\254\344\270\200\344\270\252\351\207\215\345\220\210\350\212\202\347\202\271.md" b/docs/solutions/LCR/3u1WK4.md similarity index 88% rename from "Solutions/\345\211\221\346\214\207 Offer II 023. \344\270\244\344\270\252\351\223\276\350\241\250\347\232\204\347\254\254\344\270\200\344\270\252\351\207\215\345\220\210\350\212\202\347\202\271.md" rename to docs/solutions/LCR/3u1WK4.md index 16f0c24b..a975b037 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 023. \344\270\244\344\270\252\351\223\276\350\241\250\347\232\204\347\254\254\344\270\200\344\270\252\351\207\215\345\220\210\350\212\202\347\202\271.md" +++ b/docs/solutions/LCR/3u1WK4.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 023. 两个链表的第一个重合节点](https://leetcode.cn/problems/3u1WK4/) +# [LCR 023. 相交链表](https://leetcode.cn/problems/3u1WK4/) - 标签：哈希表、链表、双指针 - 难度：简单 ## 题目链接 -- [剑指 Offer II 023. 两个链表的第一个重合节点 - 力扣](https://leetcode.cn/problems/3u1WK4/) +- [LCR 023. 相交链表 - 力扣](https://leetcode.cn/problems/3u1WK4/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 082. \345\220\253\346\234\211\351\207\215\345\244\215\345\205\203\347\264\240\351\233\206\345\220\210\347\232\204\347\273\204\345\220\210.md" b/docs/solutions/LCR/4sjJUc.md similarity index 89% rename from "Solutions/\345\211\221\346\214\207 Offer II 082. \345\220\253\346\234\211\351\207\215\345\244\215\345\205\203\347\264\240\351\233\206\345\220\210\347\232\204\347\273\204\345\220\210.md" rename to docs/solutions/LCR/4sjJUc.md index cd7d752a..3bfc396d 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 082. \345\220\253\346\234\211\351\207\215\345\244\215\345\205\203\347\264\240\351\233\206\345\220\210\347\232\204\347\273\204\345\220\210.md" +++ b/docs/solutions/LCR/4sjJUc.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 082. 含有重复元素集合的组合](https://leetcode.cn/problems/4sjJUc/) +# [LCR 082. 组合总和 II](https://leetcode.cn/problems/4sjJUc/) - 标签：数组、回溯 - 难度：中等 ## 题目链接 -- [剑指 Offer II 082. 含有重复元素集合的组合 - 力扣](https://leetcode.cn/problems/4sjJUc/) +- [LCR 082. 组合总和 II - 力扣](https://leetcode.cn/problems/4sjJUc/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 029. \346\216\222\345\272\217\347\232\204\345\276\252\347\216\257\351\223\276\350\241\250.md" b/docs/solutions/LCR/4ueAj6.md similarity index 92% rename from "Solutions/\345\211\221\346\214\207 Offer II 029. \346\216\222\345\272\217\347\232\204\345\276\252\347\216\257\351\223\276\350\241\250.md" rename to docs/solutions/LCR/4ueAj6.md index 30407c41..af6458b9 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 029. \346\216\222\345\272\217\347\232\204\345\276\252\347\216\257\351\223\276\350\241\250.md" +++ b/docs/solutions/LCR/4ueAj6.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 029. 排序的循环链表](https://leetcode.cn/problems/4ueAj6/) +# [LCR 029. 循环有序列表的插入](https://leetcode.cn/problems/4ueAj6/) - 标签：链表 - 难度：中等 ## 题目链接 -- [剑指 Offer II 029. 排序的循环链表 - 力扣](https://leetcode.cn/problems/4ueAj6/) +- [LCR 029. 循环有序列表的插入 - 力扣](https://leetcode.cn/problems/4ueAj6/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 035. \346\234\200\345\260\217\346\227\266\351\227\264\345\267\256.md" b/docs/solutions/LCR/569nqc.md similarity index 89% rename from "Solutions/\345\211\221\346\214\207 Offer II 035. \346\234\200\345\260\217\346\227\266\351\227\264\345\267\256.md" rename to docs/solutions/LCR/569nqc.md index affdee56..f51af70e 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 035. \346\234\200\345\260\217\346\227\266\351\227\264\345\267\256.md" +++ b/docs/solutions/LCR/569nqc.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 035. 最小时间差](https://leetcode.cn/problems/569nqc/) +# [LCR 035. 最小时间差](https://leetcode.cn/problems/569nqc/) - 标签：数组、数学、字符串、排序 - 难度：中等 ## 题目链接 -- [剑指 Offer II 035. 最小时间差 - 力扣](https://leetcode.cn/problems/569nqc/) +- [LCR 035. 最小时间差 - 力扣](https://leetcode.cn/problems/569nqc/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 050. \345\220\221\344\270\213\347\232\204\350\267\257\345\276\204\350\212\202\347\202\271\344\271\213\345\222\214.md" b/docs/solutions/LCR/6eUYwP.md similarity index 82% rename from "Solutions/\345\211\221\346\214\207 Offer II 050. \345\220\221\344\270\213\347\232\204\350\267\257\345\276\204\350\212\202\347\202\271\344\271\213\345\222\214.md" rename to docs/solutions/LCR/6eUYwP.md index a2d44da9..8195bd14 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 050. \345\220\221\344\270\213\347\232\204\350\267\257\345\276\204\350\212\202\347\202\271\344\271\213\345\222\214.md" +++ b/docs/solutions/LCR/6eUYwP.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 050. 向下的路径节点之和](https://leetcode.cn/problems/6eUYwP/) +# [LCR 050. 路径总和 III](https://leetcode.cn/problems/6eUYwP/) - 标签：树、深度优先搜索、二叉树 - 难度：中等 ## 题目链接 -- [剑指 Offer II 050. 向下的路径节点之和 - 力扣](https://leetcode.cn/problems/6eUYwP/) +- [LCR 050. 路径总和 III - 力扣](https://leetcode.cn/problems/6eUYwP/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 118. \345\244\232\344\275\231\347\232\204\350\276\271.md" b/docs/solutions/LCR/7LpjUW.md similarity index 92% rename from "Solutions/\345\211\221\346\214\207 Offer II 118. \345\244\232\344\275\231\347\232\204\350\276\271.md" rename to docs/solutions/LCR/7LpjUW.md index bab8778f..db34f9bb 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 118. \345\244\232\344\275\231\347\232\204\350\276\271.md" +++ b/docs/solutions/LCR/7LpjUW.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 118. 多余的边](https://leetcode.cn/problems/7LpjUW/) +# [LCR 118. 冗余连接](https://leetcode.cn/problems/7LpjUW/) - 标签：深度优先搜索、广度优先搜索、并查集、图 - 难度：中等 ## 题目链接 -- [剑指 Offer II 118. 多余的边 - 力扣](https://leetcode.cn/problems/7LpjUW/) +- [LCR 118. 冗余连接 - 力扣](https://leetcode.cn/problems/7LpjUW/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 077. \351\223\276\350\241\250\346\216\222\345\272\217.md" b/docs/solutions/LCR/7WHec2.md similarity index 90% rename from "Solutions/\345\211\221\346\214\207 Offer II 077. \351\223\276\350\241\250\346\216\222\345\272\217.md" rename to docs/solutions/LCR/7WHec2.md index d6cfd53f..90f421bf 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 077. \351\223\276\350\241\250\346\216\222\345\272\217.md" +++ b/docs/solutions/LCR/7WHec2.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 077. 链表排序](https://leetcode.cn/problems/7WHec2/) +# [LCR 077. 排序链表](https://leetcode.cn/problems/7WHec2/) - 标签：链表、双指针、分治、排序、归并排序 - 难度：中等 ## 题目链接 -- [剑指 Offer II 077. 链表排序 - 力扣](https://leetcode.cn/problems/7WHec2/) +- [LCR 077. 排序链表 - 力扣](https://leetcode.cn/problems/7WHec2/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 057. \345\200\274\345\222\214\344\270\213\346\240\207\344\271\213\345\267\256\351\203\275\345\234\250\347\273\231\345\256\232\347\232\204\350\214\203\345\233\264\345\206\205.md" b/docs/solutions/LCR/7WqeDu.md similarity index 91% rename from "Solutions/\345\211\221\346\214\207 Offer II 057. \345\200\274\345\222\214\344\270\213\346\240\207\344\271\213\345\267\256\351\203\275\345\234\250\347\273\231\345\256\232\347\232\204\350\214\203\345\233\264\345\206\205.md" rename to docs/solutions/LCR/7WqeDu.md index 3d63e036..2a490326 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 057. \345\200\274\345\222\214\344\270\213\346\240\207\344\271\213\345\267\256\351\203\275\345\234\250\347\273\231\345\256\232\347\232\204\350\214\203\345\233\264\345\206\205.md" +++ b/docs/solutions/LCR/7WqeDu.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 057. 值和下标之差都在给定的范围内](https://leetcode.cn/problems/7WqeDu/) +# [LCR 057. 存在重复元素 III](https://leetcode.cn/problems/7WqeDu/) - 标签：数组、桶排序、有序集合、排序、滑动窗口 - 难度：中等 ## 题目链接 -- [剑指 Offer II 057. 值和下标之差都在给定的范围内 - 力扣](https://leetcode.cn/problems/7WqeDu/) +- [LCR 057. 存在重复元素 III - 力扣](https://leetcode.cn/problems/7WqeDu/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 084. \345\220\253\346\234\211\351\207\215\345\244\215\345\205\203\347\264\240\351\233\206\345\220\210\347\232\204\345\205\250\346\216\222\345\210\227.md" b/docs/solutions/LCR/7p8L0Z.md similarity index 66% rename from "Solutions/\345\211\221\346\214\207 Offer II 084. \345\220\253\346\234\211\351\207\215\345\244\215\345\205\203\347\264\240\351\233\206\345\220\210\347\232\204\345\205\250\346\216\222\345\210\227.md" rename to docs/solutions/LCR/7p8L0Z.md index dc7ade0f..d90c056e 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 084. \345\220\253\346\234\211\351\207\215\345\244\215\345\205\203\347\264\240\351\233\206\345\220\210\347\232\204\345\205\250\346\216\222\345\210\227.md" +++ b/docs/solutions/LCR/7p8L0Z.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 084. 含有重复元素集合的全排列](https://leetcode.cn/problems/7p8L0Z/) +# [LCR 084. 全排列 II](https://leetcode.cn/problems/7p8L0Z/) - 标签：数组、回溯 - 难度：中等 ## 题目链接 -- [剑指 Offer II 084. 含有重复元素集合的全排列 - 力扣](https://leetcode.cn/problems/7p8L0Z/) +- [LCR 084. 全排列 II - 力扣](https://leetcode.cn/problems/7p8L0Z/) ## 题目大意 @@ -15,7 +15,7 @@ ## 解题思路 -这道题跟「[剑指 Offer II 083. 没有重复元素集合的全排列](https://leetcode.cn/problems/VvJkup/)」不一样的地方在于增加了序列中的元素可重复这一条件。这就涉及到了去重。先对 `nums` 进行排序，然后使用 visited 数组标记该元素在当前排列中是否被访问过。若未被访问过则将其加入排列中，并在访问后将该元素变为未访问状态。 +这道题跟「[LCR 083. 全排列](https://leetcode.cn/problems/VvJkup/)」不一样的地方在于增加了序列中的元素可重复这一条件。这就涉及到了去重。先对 `nums` 进行排序，然后使用 visited 数组标记该元素在当前排列中是否被访问过。若未被访问过则将其加入排列中，并在访问后将该元素变为未访问状态。 然后再递归遍历下一层元素之前，增加一句语句进行判重：`if i > 0 and nums[i] == nums[i - 1] and not visited[i - 1]: continue`。 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 036. \345\220\216\347\274\200\350\241\250\350\276\276\345\274\217.md" b/docs/solutions/LCR/8Zf90G.md similarity index 85% rename from "Solutions/\345\211\221\346\214\207 Offer II 036. \345\220\216\347\274\200\350\241\250\350\276\276\345\274\217.md" rename to docs/solutions/LCR/8Zf90G.md index e73d29a9..3d983af7 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 036. \345\220\216\347\274\200\350\241\250\350\276\276\345\274\217.md" +++ b/docs/solutions/LCR/8Zf90G.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 036. 后缀表达式](https://leetcode.cn/problems/8Zf90G/) +# [LCR 036. 逆波兰表达式求值](https://leetcode.cn/problems/8Zf90G/) - 标签：栈、数组、数学 - 难度：中等 ## 题目链接 -- [剑指 Offer II 036. 后缀表达式 - 力扣](https://leetcode.cn/problems/8Zf90G/) +- [LCR 036. 逆波兰表达式求值 - 力扣](https://leetcode.cn/problems/8Zf90G/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 011. 0 \345\222\214 1 \344\270\252\346\225\260\347\233\270\345\220\214\347\232\204\345\255\220\346\225\260\347\273\204.md" b/docs/solutions/LCR/A1NYOS.md similarity index 94% rename from "Solutions/\345\211\221\346\214\207 Offer II 011. 0 \345\222\214 1 \344\270\252\346\225\260\347\233\270\345\220\214\347\232\204\345\255\220\346\225\260\347\273\204.md" rename to docs/solutions/LCR/A1NYOS.md index 2c73929b..5e9cb183 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 011. 0 \345\222\214 1 \344\270\252\346\225\260\347\233\270\345\220\214\347\232\204\345\255\220\346\225\260\347\273\204.md" +++ b/docs/solutions/LCR/A1NYOS.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 011. 0 和 1 个数相同的子数组](https://leetcode.cn/problems/A1NYOS/) +# [LCR 011. 连续数组](https://leetcode.cn/problems/A1NYOS/) - 标签：数组、哈希表、前缀和 - 难度：中等 ## 题目链接 -- [剑指 Offer II 011. 0 和 1 个数相同的子数组 - 力扣](https://leetcode.cn/problems/A1NYOS/) +- [LCR 011. 连续数组 - 力扣](https://leetcode.cn/problems/A1NYOS/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 104. \346\216\222\345\210\227\347\232\204\346\225\260\347\233\256.md" b/docs/solutions/LCR/D0F0SV.md similarity index 86% rename from "Solutions/\345\211\221\346\214\207 Offer II 104. \346\216\222\345\210\227\347\232\204\346\225\260\347\233\256.md" rename to docs/solutions/LCR/D0F0SV.md index eef9162a..9f4bbc36 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 104. \346\216\222\345\210\227\347\232\204\346\225\260\347\233\256.md" +++ b/docs/solutions/LCR/D0F0SV.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 104. 排列的数目](https://leetcode.cn/problems/D0F0SV/) +# [LCR 104. 组合总和 Ⅳ](https://leetcode.cn/problems/D0F0SV/) - 标签：数组、动态规划 - 难度：中等 ## 题目链接 -- [剑指 Offer II 104. 排列的数目 - 力扣](https://leetcode.cn/problems/D0F0SV/) +- [LCR 104. 组合总和 Ⅳ - 力扣](https://leetcode.cn/problems/D0F0SV/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 030. \346\217\222\345\205\245\343\200\201\345\210\240\351\231\244\345\222\214\351\232\217\346\234\272\350\256\277\351\227\256\351\203\275\346\230\257 O(1) \347\232\204\345\256\271\345\231\250.md" b/docs/solutions/LCR/FortPu.md similarity index 90% rename from "Solutions/\345\211\221\346\214\207 Offer II 030. \346\217\222\345\205\245\343\200\201\345\210\240\351\231\244\345\222\214\351\232\217\346\234\272\350\256\277\351\227\256\351\203\275\346\230\257 O(1) \347\232\204\345\256\271\345\231\250.md" rename to docs/solutions/LCR/FortPu.md index 18c33c2d..9bc4e8bd 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 030. \346\217\222\345\205\245\343\200\201\345\210\240\351\231\244\345\222\214\351\232\217\346\234\272\350\256\277\351\227\256\351\203\275\346\230\257 O(1) \347\232\204\345\256\271\345\231\250.md" +++ b/docs/solutions/LCR/FortPu.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 030. 插入、删除和随机访问都是 O(1) 的容器](https://leetcode.cn/problems/FortPu/) +# [LCR 030. O(1) 时间插入、删除和获取随机元素](https://leetcode.cn/problems/FortPu/) - 标签：设计、数组、哈希表、数学、随机化 - 难度：中等 ## 题目链接 -- [剑指 Offer II 030. 插入、删除和随机访问都是 O(1) 的容器 - 力扣](https://leetcode.cn/problems/FortPu/) +- [LCR 030. O(1) 时间插入、删除和获取随机元素 - 力扣](https://leetcode.cn/problems/FortPu/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 089. \346\210\277\345\261\213\345\201\267\347\233\227.md" b/docs/solutions/LCR/Gu0c2T.md similarity index 92% rename from "Solutions/\345\211\221\346\214\207 Offer II 089. \346\210\277\345\261\213\345\201\267\347\233\227.md" rename to docs/solutions/LCR/Gu0c2T.md index 3fd0fdd2..834a6c3c 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 089. \346\210\277\345\261\213\345\201\267\347\233\227.md" +++ b/docs/solutions/LCR/Gu0c2T.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 089. 房屋偷盗](https://leetcode.cn/problems/Gu0c2T/) +# [LCR 089. 打家劫舍](https://leetcode.cn/problems/Gu0c2T/) - 标签：数组、动态规划 - 难度：中等 ## 题目链接 -- [剑指 Offer II 089. 房屋偷盗 - 力扣](https://leetcode.cn/problems/Gu0c2T/) +- [LCR 089. 打家劫舍 - 力扣](https://leetcode.cn/problems/Gu0c2T/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 088. \347\210\254\346\245\274\346\242\257\347\232\204\346\234\200\345\260\221\346\210\220\346\234\254.md" b/docs/solutions/LCR/GzCJIP.md similarity index 88% rename from "Solutions/\345\211\221\346\214\207 Offer II 088. \347\210\254\346\245\274\346\242\257\347\232\204\346\234\200\345\260\221\346\210\220\346\234\254.md" rename to docs/solutions/LCR/GzCJIP.md index eb2de0dd..d577b152 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 088. \347\210\254\346\245\274\346\242\257\347\232\204\346\234\200\345\260\221\346\210\220\346\234\254.md" +++ b/docs/solutions/LCR/GzCJIP.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 088. 爬楼梯的最少成本](https://leetcode.cn/problems/GzCJIP/) +# [LCR 088. 使用最小花费爬楼梯](https://leetcode.cn/problems/GzCJIP/) - 标签：数组、动态规划 - 难度：简单 ## 题目链接 -- [剑指 Offer II 088. 爬楼梯的最少成本 - 力扣](https://leetcode.cn/problems/GzCJIP/) +- [LCR 088. 使用最小花费爬楼梯 - 力扣](https://leetcode.cn/problems/GzCJIP/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 042. \346\234\200\350\277\221\350\257\267\346\261\202\346\254\241\346\225\260.md" b/docs/solutions/LCR/H8086Q.md similarity index 85% rename from "Solutions/\345\211\221\346\214\207 Offer II 042. \346\234\200\350\277\221\350\257\267\346\261\202\346\254\241\346\225\260.md" rename to docs/solutions/LCR/H8086Q.md index 0f6219bd..f8ba66de 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 042. \346\234\200\350\277\221\350\257\267\346\261\202\346\254\241\346\225\260.md" +++ b/docs/solutions/LCR/H8086Q.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 042. 最近请求次数](https://leetcode.cn/problems/H8086Q/) +# [LCR 042. 最近的请求次数](https://leetcode.cn/problems/H8086Q/) - 标签：设计、队列、数据流 - 难度：简单 ## 题目链接 -- [剑指 Offer II 042. 最近请求次数 - 力扣](https://leetcode.cn/problems/H8086Q/) +- [LCR 042. 最近的请求次数 - 力扣](https://leetcode.cn/problems/H8086Q/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 085. \347\224\237\346\210\220\345\214\271\351\205\215\347\232\204\346\213\254\345\217\267.md" b/docs/solutions/LCR/IDBivT.md similarity index 88% rename from "Solutions/\345\211\221\346\214\207 Offer II 085. \347\224\237\346\210\220\345\214\271\351\205\215\347\232\204\346\213\254\345\217\267.md" rename to docs/solutions/LCR/IDBivT.md index d5efe559..df0a6d8f 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 085. \347\224\237\346\210\220\345\214\271\351\205\215\347\232\204\346\213\254\345\217\267.md" +++ b/docs/solutions/LCR/IDBivT.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 085. 生成匹配的括号](https://leetcode.cn/problems/IDBivT/) +# [LCR 085. 括号生成](https://leetcode.cn/problems/IDBivT/) - 标签：字符串、动态规划、回溯 - 难度：中等 ## 题目链接 -- [剑指 Offer II 085. 生成匹配的括号 - 力扣](https://leetcode.cn/problems/IDBivT/) +- [LCR 085. 括号生成 - 力扣](https://leetcode.cn/problems/IDBivT/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 002. \344\272\214\350\277\233\345\210\266\345\212\240\346\263\225.md" b/docs/solutions/LCR/JFETK5.md similarity index 88% rename from "Solutions/\345\211\221\346\214\207 Offer II 002. \344\272\214\350\277\233\345\210\266\345\212\240\346\263\225.md" rename to docs/solutions/LCR/JFETK5.md index 99ed6ae5..045fb5db 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 002. \344\272\214\350\277\233\345\210\266\345\212\240\346\263\225.md" +++ b/docs/solutions/LCR/JFETK5.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 002. 二进制加法](https://leetcode.cn/problems/JFETK5/) +# [LCR 002. 二进制求和](https://leetcode.cn/problems/JFETK5/) - 标签：位运算、数学、字符串、模拟 - 难度：简单 ## 题目链接 -- [剑指 Offer II 002. 二进制加法 - 力扣](https://leetcode.cn/problems/JFETK5/) +- [LCR 002. 二进制求和 - 力扣](https://leetcode.cn/problems/JFETK5/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 026. \351\207\215\346\216\222\351\223\276\350\241\250.md" b/docs/solutions/LCR/LGjMqU.md similarity index 88% rename from "Solutions/\345\211\221\346\214\207 Offer II 026. \351\207\215\346\216\222\351\223\276\350\241\250.md" rename to docs/solutions/LCR/LGjMqU.md index 7cbf286e..dd50e411 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 026. \351\207\215\346\216\222\351\223\276\350\241\250.md" +++ b/docs/solutions/LCR/LGjMqU.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 026. 重排链表](https://leetcode.cn/problems/LGjMqU/) +# [LCR 026. 重排链表](https://leetcode.cn/problems/LGjMqU/) - 标签：栈、递归、链表、双指针 - 难度：中等 ## 题目链接 -- [剑指 Offer II 026. 重排链表 - 力扣](https://leetcode.cn/problems/LGjMqU/) +- [LCR 026. 重排链表 - 力扣](https://leetcode.cn/problems/LGjMqU/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 045. \344\272\214\345\217\211\346\240\221\346\234\200\345\272\225\345\261\202\346\234\200\345\267\246\350\276\271\347\232\204\345\200\274.md" b/docs/solutions/LCR/LwUNpT.md similarity index 85% rename from "Solutions/\345\211\221\346\214\207 Offer II 045. \344\272\214\345\217\211\346\240\221\346\234\200\345\272\225\345\261\202\346\234\200\345\267\246\350\276\271\347\232\204\345\200\274.md" rename to docs/solutions/LCR/LwUNpT.md index 0e0f9fac..8028fbd6 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 045. \344\272\214\345\217\211\346\240\221\346\234\200\345\272\225\345\261\202\346\234\200\345\267\246\350\276\271\347\232\204\345\200\274.md" +++ b/docs/solutions/LCR/LwUNpT.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 045. 二叉树最底层最左边的值](https://leetcode.cn/problems/LwUNpT/) +# [LCR 045. 找树左下角的值](https://leetcode.cn/problems/LwUNpT/) - 标签：树、深度优先搜索、广度优先搜索、二叉树 - 难度：中等 ## 题目链接 -- [剑指 Offer II 045. 二叉树最底层最左边的值 - 力扣](https://leetcode.cn/problems/LwUNpT/) +- [LCR 045. 找树左下角的值 - 力扣](https://leetcode.cn/problems/LwUNpT/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 017. \345\220\253\346\234\211\346\211\200\346\234\211\345\255\227\347\254\246\347\232\204\346\234\200\347\237\255\345\255\227\347\254\246\344\270\262.md" b/docs/solutions/LCR/M1oyTv.md similarity index 89% rename from "Solutions/\345\211\221\346\214\207 Offer II 017. \345\220\253\346\234\211\346\211\200\346\234\211\345\255\227\347\254\246\347\232\204\346\234\200\347\237\255\345\255\227\347\254\246\344\270\262.md" rename to docs/solutions/LCR/M1oyTv.md index 659ccc5a..7b2208bb 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 017. \345\220\253\346\234\211\346\211\200\346\234\211\345\255\227\347\254\246\347\232\204\346\234\200\347\237\255\345\255\227\347\254\246\344\270\262.md" +++ b/docs/solutions/LCR/M1oyTv.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 017. 含有所有字符的最短字符串](https://leetcode.cn/problems/M1oyTv/) +# [LCR 017. 最小覆盖子串](https://leetcode.cn/problems/M1oyTv/) - 标签：哈希表、字符串、滑动窗口 - 难度：困难 ## 题目链接 -- [剑指 Offer II 017. 含有所有字符的最短字符串 - 力扣](https://leetcode.cn/problems/M1oyTv/) +- [LCR 017. 最小覆盖子串 - 力扣](https://leetcode.cn/problems/M1oyTv/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 086. \345\210\206\345\211\262\345\233\236\346\226\207\345\255\220\345\255\227\347\254\246\344\270\262.md" b/docs/solutions/LCR/M99OJA.md similarity index 91% rename from "Solutions/\345\211\221\346\214\207 Offer II 086. \345\210\206\345\211\262\345\233\236\346\226\207\345\255\220\345\255\227\347\254\246\344\270\262.md" rename to docs/solutions/LCR/M99OJA.md index 170b41f2..f6bc7863 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 086. \345\210\206\345\211\262\345\233\236\346\226\207\345\255\220\345\255\227\347\254\246\344\270\262.md" +++ b/docs/solutions/LCR/M99OJA.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 086. 分割回文子字符串](https://leetcode.cn/problems/M99OJA/) +# [LCR 086. 分割回文串](https://leetcode.cn/problems/M99OJA/) - 标签：深度优先搜索、广度优先搜索、图、哈希表 - 难度：中等 ## 题目链接 -- [剑指 Offer II 086. 分割回文子字符串 - 力扣](https://leetcode.cn/problems/M99OJA/) +- [LCR 086. 分割回文串 - 力扣](https://leetcode.cn/problems/M99OJA/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 068. \346\237\245\346\211\276\346\217\222\345\205\245\344\275\215\347\275\256.md" b/docs/solutions/LCR/N6YdxV.md similarity index 87% rename from "Solutions/\345\211\221\346\214\207 Offer II 068. \346\237\245\346\211\276\346\217\222\345\205\245\344\275\215\347\275\256.md" rename to docs/solutions/LCR/N6YdxV.md index 1b0eb31d..bde08aea 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 068. \346\237\245\346\211\276\346\217\222\345\205\245\344\275\215\347\275\256.md" +++ b/docs/solutions/LCR/N6YdxV.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 068. 查找插入位置](https://leetcode.cn/problems/N6YdxV/) +# [LCR 068. 搜索插入位置](https://leetcode.cn/problems/N6YdxV/) - 标签：数组、二分查找 - 难度：简单 ## 题目链接 -- [剑指 Offer II 068. 查找插入位置 - 力扣](https://leetcode.cn/problems/N6YdxV/) +- [LCR 068. 搜索插入位置 - 力扣](https://leetcode.cn/problems/N6YdxV/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 101. \345\210\206\345\211\262\347\255\211\345\222\214\345\255\220\351\233\206.md" b/docs/solutions/LCR/NUPfPr.md similarity index 88% rename from "Solutions/\345\211\221\346\214\207 Offer II 101. \345\210\206\345\211\262\347\255\211\345\222\214\345\255\220\351\233\206.md" rename to docs/solutions/LCR/NUPfPr.md index 5f28b479..d6ea4a4d 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 101. \345\210\206\345\211\262\347\255\211\345\222\214\345\255\220\351\233\206.md" +++ b/docs/solutions/LCR/NUPfPr.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 101. 分割等和子集](https://leetcode.cn/problems/NUPfPr/) +# [LCR 101. 分割等和子集](https://leetcode.cn/problems/NUPfPr/) - 标签：数学、字符串、模拟 - 难度：简单 ## 题目链接 -- [剑指 Offer II 101. 分割等和子集 - 力扣](https://leetcode.cn/problems/NUPfPr/) +- [LCR 101. 分割等和子集 - 力扣](https://leetcode.cn/problems/NUPfPr/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 052. \345\261\225\345\271\263\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221.md" b/docs/solutions/LCR/NYBBNL.md similarity index 89% rename from "Solutions/\345\211\221\346\214\207 Offer II 052. \345\261\225\345\271\263\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221.md" rename to docs/solutions/LCR/NYBBNL.md index 394ed157..7feddd0c 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 052. \345\261\225\345\271\263\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221.md" +++ b/docs/solutions/LCR/NYBBNL.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 052. 展平二叉搜索树](https://leetcode.cn/problems/NYBBNL/) +# [LCR 052. 递增顺序搜索树](https://leetcode.cn/problems/NYBBNL/) - 标签：栈、树、深度优先搜索、二叉搜索树、二叉树 - 难度：简单 ## 题目链接 -- [剑指 Offer II 052. 展平二叉搜索树 - 力扣](https://leetcode.cn/problems/NYBBNL/) +- [LCR 052. 递增顺序搜索树 - 力扣](https://leetcode.cn/problems/NYBBNL/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 043. \345\276\200\345\256\214\345\205\250\344\272\214\345\217\211\346\240\221\346\267\273\345\212\240\350\212\202\347\202\271.md" b/docs/solutions/LCR/NaqhDT.md similarity index 89% rename from "Solutions/\345\211\221\346\214\207 Offer II 043. \345\276\200\345\256\214\345\205\250\344\272\214\345\217\211\346\240\221\346\267\273\345\212\240\350\212\202\347\202\271.md" rename to docs/solutions/LCR/NaqhDT.md index e4c35c20..cca716d5 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 043. \345\276\200\345\256\214\345\205\250\344\272\214\345\217\211\346\240\221\346\267\273\345\212\240\350\212\202\347\202\271.md" +++ b/docs/solutions/LCR/NaqhDT.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 043. 往完全二叉树添加节点](https://leetcode.cn/problems/NaqhDT/) +# [LCR 043. 完全二叉树插入器](https://leetcode.cn/problems/NaqhDT/) - 标签：树、广度优先搜索、设计、二叉树 - 难度：中等 ## 题目链接 -- [剑指 Offer II 043. 往完全二叉树添加节点 - 力扣](https://leetcode.cn/problems/NaqhDT/) +- [LCR 043. 完全二叉树插入器 - 力扣](https://leetcode.cn/problems/NaqhDT/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 013. \344\272\214\347\273\264\345\255\220\347\237\251\351\230\265\347\232\204\345\222\214.md" b/docs/solutions/LCR/O4NDxx.md similarity index 91% rename from "Solutions/\345\211\221\346\214\207 Offer II 013. \344\272\214\347\273\264\345\255\220\347\237\251\351\230\265\347\232\204\345\222\214.md" rename to docs/solutions/LCR/O4NDxx.md index 8264d767..da9c6857 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 013. \344\272\214\347\273\264\345\255\220\347\237\251\351\230\265\347\232\204\345\222\214.md" +++ b/docs/solutions/LCR/O4NDxx.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 013. 二维子矩阵的和](https://leetcode.cn/problems/O4NDxx/) +# [LCR 013. 二维区域和检索 - 矩阵不可变](https://leetcode.cn/problems/O4NDxx/) - 标签：设计、数组、矩阵、前缀和 - 难度：中等 ## 题目链接 -- [剑指 Offer II 013. 二维子矩阵的和 - 力扣](https://leetcode.cn/problems/O4NDxx/) +- [LCR 013. 二维区域和检索 - 矩阵不可变 - 力扣](https://leetcode.cn/problems/O4NDxx/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 031. \346\234\200\350\277\221\346\234\200\345\260\221\344\275\277\347\224\250\347\274\223\345\255\230.md" b/docs/solutions/LCR/OrIXps.md similarity index 92% rename from "Solutions/\345\211\221\346\214\207 Offer II 031. \346\234\200\350\277\221\346\234\200\345\260\221\344\275\277\347\224\250\347\274\223\345\255\230.md" rename to docs/solutions/LCR/OrIXps.md index 11f701ef..5d4cb029 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 031. \346\234\200\350\277\221\346\234\200\345\260\221\344\275\277\347\224\250\347\274\223\345\255\230.md" +++ b/docs/solutions/LCR/OrIXps.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 031. 最近最少使用缓存](https://leetcode.cn/problems/OrIXps/) +# [LCR 031. LRU 缓存](https://leetcode.cn/problems/OrIXps/) - 标签：设计、哈希表、链表、双向链表 - 难度：中等 ## 题目链接 -- [剑指 Offer II 031. 最近最少使用缓存 - 力扣](https://leetcode.cn/problems/OrIXps/) +- [LCR 031. LRU 缓存 - 力扣](https://leetcode.cn/problems/OrIXps/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 053. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\344\270\255\347\232\204\344\270\255\345\272\217\345\220\216\347\273\247.md" b/docs/solutions/LCR/P5rCT8.md similarity index 85% rename from "Solutions/\345\211\221\346\214\207 Offer II 053. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\344\270\255\347\232\204\344\270\255\345\272\217\345\220\216\347\273\247.md" rename to docs/solutions/LCR/P5rCT8.md index 27ee7ac4..8f4e937c 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 053. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\344\270\255\347\232\204\344\270\255\345\272\217\345\220\216\347\273\247.md" +++ b/docs/solutions/LCR/P5rCT8.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 053. 二叉搜索树中的中序后继](https://leetcode.cn/problems/P5rCT8/) +# [LCR 053. 二叉搜索树中的中序后继](https://leetcode.cn/problems/P5rCT8/) - 标签：树、深度优先搜索、二叉搜索树、二叉树 - 难度：中等 ## 题目链接 -- [剑指 Offer II 053. 二叉搜索树中的中序后继 - 力扣](https://leetcode.cn/problems/P5rCT8/) +- [LCR 053. 二叉搜索树中的中序后继 - 力扣](https://leetcode.cn/problems/P5rCT8/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 090. \347\216\257\345\275\242\346\210\277\345\261\213\345\201\267\347\233\227.md" b/docs/solutions/LCR/PzWKhm.md similarity index 80% rename from "Solutions/\345\211\221\346\214\207 Offer II 090. \347\216\257\345\275\242\346\210\277\345\261\213\345\201\267\347\233\227.md" rename to docs/solutions/LCR/PzWKhm.md index 33c7667f..73a4db2d 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 090. \347\216\257\345\275\242\346\210\277\345\261\213\345\201\267\347\233\227.md" +++ b/docs/solutions/LCR/PzWKhm.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 090. 环形房屋偷盗](https://leetcode.cn/problems/PzWKhm/) +# [LCR 090. 打家劫舍 II](https://leetcode.cn/problems/PzWKhm/) - 标签：数组、动态规划 - 难度：中等 ## 题目链接 -- [剑指 Offer II 090. 环形房屋偷盗 - 力扣](https://leetcode.cn/problems/PzWKhm/) +- [LCR 090. 打家劫舍 II - 力扣](https://leetcode.cn/problems/PzWKhm/) ## 题目大意 @@ -15,7 +15,7 @@ ## 解题思路 -「[剑指 Offer II 089. 房屋偷盗](https://leetcode.cn/problems/Gu0c2T/)」的升级版。可以用动态规划来解决问题，关键点在于找到状态转移方程。 +「[LCR 089. 打家劫舍](https://leetcode.cn/problems/Gu0c2T/)」的升级版。可以用动态规划来解决问题，关键点在于找到状态转移方程。 先来考虑最简单的情况。 @@ -23,9 +23,9 @@ 两间屋子以下，最多只能偷窃一间房屋，则不用考虑首尾相连的情况。如果三个屋子以上，偷窃了第一间房屋，则不能偷窃最后一间房屋。同样偷窃了最后一间房屋则不能偷窃第一间房屋。 -假设总共房屋数量为 N，这种情况可以转换为分别求解 $[0, N - 2]$ 和 $[1, N - 1]$ 范围下首尾不相连的房屋所能偷窃的最高金额，这就变成了「[剑指 Offer II 089. 房屋偷盗](https://leetcode.cn/problems/Gu0c2T/)」的求解问题。 +假设总共房屋数量为 N，这种情况可以转换为分别求解 $[0, N - 2]$ 和 $[1, N - 1]$ 范围下首尾不相连的房屋所能偷窃的最高金额，这就变成了「[LCR 089. 打家劫舍](https://leetcode.cn/problems/Gu0c2T/)」的求解问题。 -「[剑指 Offer II 089. 房屋偷盗](https://leetcode.cn/problems/Gu0c2T/)」求解思路如下： +「[LCR 089. 打家劫舍](https://leetcode.cn/problems/Gu0c2T/)」求解思路如下： 如果房屋大于两间，则偷窃第 `i` 间房屋的时候，就有两种状态： diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 093. \346\234\200\351\225\277\346\226\220\346\263\242\351\202\243\345\245\221\346\225\260\345\210\227.md" b/docs/solutions/LCR/Q91FMA.md similarity index 96% rename from "Solutions/\345\211\221\346\214\207 Offer II 093. \346\234\200\351\225\277\346\226\220\346\263\242\351\202\243\345\245\221\346\225\260\345\210\227.md" rename to docs/solutions/LCR/Q91FMA.md index c4b8df27..8eb48dfd 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 093. \346\234\200\351\225\277\346\226\220\346\263\242\351\202\243\345\245\221\346\225\260\345\210\227.md" +++ b/docs/solutions/LCR/Q91FMA.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 093. 最长斐波那契数列](https://leetcode.cn/problems/Q91FMA/) +# [LCR 093. 最长的斐波那契子序列的长度](https://leetcode.cn/problems/Q91FMA/) - 标签：数组、哈希表、动态规划 - 难度：中等 ## 题目链接 -- [剑指 Offer II 093. 最长斐波那契数列 - 力扣](https://leetcode.cn/problems/Q91FMA/) +- [LCR 093. 最长的斐波那契子序列的长度 - 力扣](https://leetcode.cn/problems/Q91FMA/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 113. \350\257\276\347\250\213\351\241\272\345\272\217.md" b/docs/solutions/LCR/QA2IGt.md similarity index 93% rename from "Solutions/\345\211\221\346\214\207 Offer II 113. \350\257\276\347\250\213\351\241\272\345\272\217.md" rename to docs/solutions/LCR/QA2IGt.md index 2f4b7268..58c9b720 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 113. \350\257\276\347\250\213\351\241\272\345\272\217.md" +++ b/docs/solutions/LCR/QA2IGt.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 113. 课程顺序](https://leetcode.cn/problems/QA2IGt/) +# [LCR 113. 课程表 II](https://leetcode.cn/problems/QA2IGt/) - 标签：深度优先搜索、广度优先搜索、图、拓扑排序 - 难度：中等 ## 题目链接 -- [剑指 Offer II 113. 课程顺序 - 力扣](https://leetcode.cn/problems/QA2IGt/) +- [LCR 113. 课程表 II - 力扣](https://leetcode.cn/problems/QA2IGt/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 062. \345\256\236\347\216\260\345\211\215\347\274\200\346\240\221.md" b/docs/solutions/LCR/QC3q1f.md similarity index 94% rename from "Solutions/\345\211\221\346\214\207 Offer II 062. \345\256\236\347\216\260\345\211\215\347\274\200\346\240\221.md" rename to docs/solutions/LCR/QC3q1f.md index 15699a5f..ea15ee2f 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 062. \345\256\236\347\216\260\345\211\215\347\274\200\346\240\221.md" +++ b/docs/solutions/LCR/QC3q1f.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 062. 实现前缀树](https://leetcode.cn/problems/QC3q1f/) +# [LCR 062. 实现 Trie (前缀树)](https://leetcode.cn/problems/QC3q1f/) - 标签：设计、字典树、哈希表、字符串 - 难度：中等 ## 题目链接 -- [剑指 Offer II 062. 实现前缀树 - 力扣](https://leetcode.cn/problems/QC3q1f/) +- [LCR 062. 实现 Trie (前缀树) - 力扣](https://leetcode.cn/problems/QC3q1f/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 010. \345\222\214\344\270\272 k \347\232\204\345\255\220\346\225\260\347\273\204.md" b/docs/solutions/LCR/QTMn0o.md similarity index 93% rename from "Solutions/\345\211\221\346\214\207 Offer II 010. \345\222\214\344\270\272 k \347\232\204\345\255\220\346\225\260\347\273\204.md" rename to docs/solutions/LCR/QTMn0o.md index c2a438d2..797623c0 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 010. \345\222\214\344\270\272 k \347\232\204\345\255\220\346\225\260\347\273\204.md" +++ b/docs/solutions/LCR/QTMn0o.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 010. 和为 k 的子数组](https://leetcode.cn/problems/QTMn0o/) +# [LCR 010. 和为 K 的子数组](https://leetcode.cn/problems/QTMn0o/) - 标签：数组、哈希表、前缀和 - 难度：中等 ## 题目链接 -- [剑指 Offer II 010. 和为 k 的子数组 - 力扣](https://leetcode.cn/problems/QTMn0o/) +- [LCR 010. 和为 K 的子数组 - 力扣](https://leetcode.cn/problems/QTMn0o/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 028. \345\261\225\345\271\263\345\244\232\347\272\247\345\217\214\345\220\221\351\223\276\350\241\250.md" b/docs/solutions/LCR/Qv1Da2.md similarity index 91% rename from "Solutions/\345\211\221\346\214\207 Offer II 028. \345\261\225\345\271\263\345\244\232\347\272\247\345\217\214\345\220\221\351\223\276\350\241\250.md" rename to docs/solutions/LCR/Qv1Da2.md index c16124b8..50562f52 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 028. \345\261\225\345\271\263\345\244\232\347\272\247\345\217\214\345\220\221\351\223\276\350\241\250.md" +++ b/docs/solutions/LCR/Qv1Da2.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 028. 展平多级双向链表](https://leetcode.cn/problems/Qv1Da2/) +# [LCR 028. 扁平化多级双向链表](https://leetcode.cn/problems/Qv1Da2/) - 标签：深度优先搜索、链表、双向链表 - 难度：中等 ## 题目链接 -- [剑指 Offer II 028. 展平多级双向链表 - 力扣](https://leetcode.cn/problems/Qv1Da2/) +- [LCR 028. 扁平化多级双向链表 - 力扣](https://leetcode.cn/problems/Qv1Da2/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 019. \346\234\200\345\244\232\345\210\240\351\231\244\344\270\200\344\270\252\345\255\227\347\254\246\345\276\227\345\210\260\345\233\236\346\226\207.md" b/docs/solutions/LCR/RQku0D.md similarity index 86% rename from "Solutions/\345\211\221\346\214\207 Offer II 019. \346\234\200\345\244\232\345\210\240\351\231\244\344\270\200\344\270\252\345\255\227\347\254\246\345\276\227\345\210\260\345\233\236\346\226\207.md" rename to docs/solutions/LCR/RQku0D.md index 7f39bd99..75476cb6 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 019. \346\234\200\345\244\232\345\210\240\351\231\244\344\270\200\344\270\252\345\255\227\347\254\246\345\276\227\345\210\260\345\233\236\346\226\207.md" +++ b/docs/solutions/LCR/RQku0D.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 019. 最多删除一个字符得到回文](https://leetcode.cn/problems/RQku0D/) +# [LCR 019. 验证回文串 II](https://leetcode.cn/problems/RQku0D/) - 标签：贪心、双指针、字符串 - 难度：简单 ## 题目链接 -- [剑指 Offer II 019. 最多删除一个字符得到回文 - 力扣](https://leetcode.cn/problems/RQku0D/) +- [LCR 019. 验证回文串 II - 力扣](https://leetcode.cn/problems/RQku0D/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 021. \345\210\240\351\231\244\351\223\276\350\241\250\347\232\204\345\200\222\346\225\260\347\254\254 n \344\270\252\347\273\223\347\202\271.md" b/docs/solutions/LCR/SLwz0R.md similarity index 87% rename from "Solutions/\345\211\221\346\214\207 Offer II 021. \345\210\240\351\231\244\351\223\276\350\241\250\347\232\204\345\200\222\346\225\260\347\254\254 n \344\270\252\347\273\223\347\202\271.md" rename to docs/solutions/LCR/SLwz0R.md index 871bd104..b5da545e 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 021. \345\210\240\351\231\244\351\223\276\350\241\250\347\232\204\345\200\222\346\225\260\347\254\254 n \344\270\252\347\273\223\347\202\271.md" +++ b/docs/solutions/LCR/SLwz0R.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 021. 删除链表的倒数第 n 个结点](https://leetcode.cn/problems/SLwz0R/) +# [LCR 021. 删除链表的倒数第 N 个结点](https://leetcode.cn/problems/SLwz0R/) - 标签：链表、双指针 - 难度：中等 ## 题目链接 -- [剑指 Offer II 021. 删除链表的倒数第 n 个结点 - 力扣](https://leetcode.cn/problems/SLwz0R/) +- [LCR 021. 删除链表的倒数第 N 个结点 - 力扣](https://leetcode.cn/problems/SLwz0R/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 074. \345\220\210\345\271\266\345\214\272\351\227\264.md" b/docs/solutions/LCR/SsGoHC.md similarity index 89% rename from "Solutions/\345\211\221\346\214\207 Offer II 074. \345\220\210\345\271\266\345\214\272\351\227\264.md" rename to docs/solutions/LCR/SsGoHC.md index 25bba808..fb2f91a8 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 074. \345\220\210\345\271\266\345\214\272\351\227\264.md" +++ b/docs/solutions/LCR/SsGoHC.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 074. 合并区间](https://leetcode.cn/problems/SsGoHC/) +# [LCR 074. 合并区间](https://leetcode.cn/problems/SsGoHC/) - 标签：数组、排序 - 难度：中等 ## 题目链接 -- [剑指 Offer II 074. 合并区间 - 力扣](https://leetcode.cn/problems/SsGoHC/) +- [LCR 074. 合并区间 - 力扣](https://leetcode.cn/problems/SsGoHC/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 079. \346\211\200\346\234\211\345\255\220\351\233\206.md" b/docs/solutions/LCR/TVdhkn.md similarity index 82% rename from "Solutions/\345\211\221\346\214\207 Offer II 079. \346\211\200\346\234\211\345\255\220\351\233\206.md" rename to docs/solutions/LCR/TVdhkn.md index f7b718bd..28cc4174 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 079. \346\211\200\346\234\211\345\255\220\351\233\206.md" +++ b/docs/solutions/LCR/TVdhkn.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 079. 所有子集](https://leetcode.cn/problems/TVdhkn/) +# [LCR 079. 子集](https://leetcode.cn/problems/TVdhkn/) - 标签：位运算、数组、回溯 - 难度：中等 ## 题目链接 -- [剑指 Offer II 079. 所有子集 - 力扣](https://leetcode.cn/problems/TVdhkn/) +- [LCR 079. 子集 - 力扣](https://leetcode.cn/problems/TVdhkn/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 024. \345\217\215\350\275\254\351\223\276\350\241\250.md" b/docs/solutions/LCR/UHnkqh.md similarity index 95% rename from "Solutions/\345\211\221\346\214\207 Offer II 024. \345\217\215\350\275\254\351\223\276\350\241\250.md" rename to docs/solutions/LCR/UHnkqh.md index 7feea5c2..4f2f3bb5 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 024. \345\217\215\350\275\254\351\223\276\350\241\250.md" +++ b/docs/solutions/LCR/UHnkqh.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 024. 反转链表](https://leetcode.cn/problems/UHnkqh/) +# [LCR 024. 反转链表](https://leetcode.cn/problems/UHnkqh/) - 标签：递归、链表 - 难度：简单 ## 题目链接 -- [剑指 Offer II 024. 反转链表 - 力扣](https://leetcode.cn/problems/UHnkqh/) +- [LCR 024. 反转链表 - 力扣](https://leetcode.cn/problems/UHnkqh/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 064. \347\245\236\345\245\207\347\232\204\345\255\227\345\205\270.md" b/docs/solutions/LCR/US1pGT.md similarity index 93% rename from "Solutions/\345\211\221\346\214\207 Offer II 064. \347\245\236\345\245\207\347\232\204\345\255\227\345\205\270.md" rename to docs/solutions/LCR/US1pGT.md index ddce22eb..a41bdcfd 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 064. \347\245\236\345\245\207\347\232\204\345\255\227\345\205\270.md" +++ b/docs/solutions/LCR/US1pGT.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 064. 神奇的字典](https://leetcode.cn/problems/US1pGT/) +# [LCR 064. 实现一个魔法字典](https://leetcode.cn/problems/US1pGT/) - 标签：设计、字典树、哈希表、字符串 - 难度：中等 ## 题目链接 -- [剑指 Offer II 064. 神奇的字典 - 力扣](https://leetcode.cn/problems/US1pGT/) +- [LCR 064. 实现一个魔法字典 - 力扣](https://leetcode.cn/problems/US1pGT/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 063. \346\233\277\346\215\242\345\215\225\350\257\215.md" b/docs/solutions/LCR/UhWRSj.md similarity index 91% rename from "Solutions/\345\211\221\346\214\207 Offer II 063. \346\233\277\346\215\242\345\215\225\350\257\215.md" rename to docs/solutions/LCR/UhWRSj.md index 584526b9..d9bce2db 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 063. \346\233\277\346\215\242\345\215\225\350\257\215.md" +++ b/docs/solutions/LCR/UhWRSj.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 063. 替换单词](https://leetcode.cn/problems/UhWRSj/) +# [LCR 063. 单词替换](https://leetcode.cn/problems/UhWRSj/) - 标签：字典树、数组、哈希表、字符串 - 难度：中等 ## 题目链接 -- [剑指 Offer II 063. 替换单词 - 力扣](https://leetcode.cn/problems/UhWRSj/) +- [LCR 063. 单词替换 - 力扣](https://leetcode.cn/problems/UhWRSj/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 083. \346\262\241\346\234\211\351\207\215\345\244\215\345\205\203\347\264\240\351\233\206\345\220\210\347\232\204\345\205\250\346\216\222\345\210\227.md" b/docs/solutions/LCR/VvJkup.md similarity index 83% rename from "Solutions/\345\211\221\346\214\207 Offer II 083. \346\262\241\346\234\211\351\207\215\345\244\215\345\205\203\347\264\240\351\233\206\345\220\210\347\232\204\345\205\250\346\216\222\345\210\227.md" rename to docs/solutions/LCR/VvJkup.md index 5935064e..9d0320f4 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 083. \346\262\241\346\234\211\351\207\215\345\244\215\345\205\203\347\264\240\351\233\206\345\220\210\347\232\204\345\205\250\346\216\222\345\210\227.md" +++ b/docs/solutions/LCR/VvJkup.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 083. 没有重复元素集合的全排列](https://leetcode.cn/problems/VvJkup/) +# [LCR 083. 全排列](https://leetcode.cn/problems/VvJkup/) - 标签：数组、回溯 - 难度：中等 ## 题目链接 -- [剑指 Offer II 083. 没有重复元素集合的全排列 - 力扣](https://leetcode.cn/problems/VvJkup/) +- [LCR 083. 全排列 - 力扣](https://leetcode.cn/problems/VvJkup/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 004. \345\217\252\345\207\272\347\216\260\344\270\200\346\254\241\347\232\204\346\225\260\345\255\227.md" b/docs/solutions/LCR/WGki4K.md similarity index 93% rename from "Solutions/\345\211\221\346\214\207 Offer II 004. \345\217\252\345\207\272\347\216\260\344\270\200\346\254\241\347\232\204\346\225\260\345\255\227.md" rename to docs/solutions/LCR/WGki4K.md index cea40233..18fc3783 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 004. \345\217\252\345\207\272\347\216\260\344\270\200\346\254\241\347\232\204\346\225\260\345\255\227.md" +++ b/docs/solutions/LCR/WGki4K.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 004. 只出现一次的数字](https://leetcode.cn/problems/WGki4K/) +# [LCR 004. 只出现一次的数字 II](https://leetcode.cn/problems/WGki4K/) - 标签：位运算、数组 - 难度：中等 ## 题目链接 -- [剑指 Offer II 004. 只出现一次的数字 - 力扣](https://leetcode.cn/problems/WGki4K/) +- [LCR 004. 只出现一次的数字 II - 力扣](https://leetcode.cn/problems/WGki4K/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 046. \344\272\214\345\217\211\346\240\221\347\232\204\345\217\263\344\276\247\350\247\206\345\233\276.md" b/docs/solutions/LCR/WNC0Lk.md similarity index 84% rename from "Solutions/\345\211\221\346\214\207 Offer II 046. \344\272\214\345\217\211\346\240\221\347\232\204\345\217\263\344\276\247\350\247\206\345\233\276.md" rename to docs/solutions/LCR/WNC0Lk.md index 6589de02..3d33a4b3 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 046. \344\272\214\345\217\211\346\240\221\347\232\204\345\217\263\344\276\247\350\247\206\345\233\276.md" +++ b/docs/solutions/LCR/WNC0Lk.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 046. 二叉树的右侧视图](https://leetcode.cn/problems/WNC0Lk/) +# [LCR 046. 二叉树的右视图](https://leetcode.cn/problems/WNC0Lk/) - 标签：树、深度优先搜索、广度优先搜索、二叉树 - 难度：中等 ## 题目链接 -- [剑指 Offer II 046. 二叉树的右侧视图 - 力扣](https://leetcode.cn/problems/WNC0Lk/) +- [LCR 046. 二叉树的右视图 - 力扣](https://leetcode.cn/problems/WNC0Lk/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 119. \346\234\200\351\225\277\350\277\236\347\273\255\345\272\217\345\210\227.md" b/docs/solutions/LCR/WhsWhI.md similarity index 92% rename from "Solutions/\345\211\221\346\214\207 Offer II 119. \346\234\200\351\225\277\350\277\236\347\273\255\345\272\217\345\210\227.md" rename to docs/solutions/LCR/WhsWhI.md index c3f073c2..ec9f906d 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 119. \346\234\200\351\225\277\350\277\236\347\273\255\345\272\217\345\210\227.md" +++ b/docs/solutions/LCR/WhsWhI.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 119. 最长连续序列](https://leetcode.cn/problems/WhsWhI/) +# [LCR 119. 最长连续序列](https://leetcode.cn/problems/WhsWhI/) - 标签：并查集、数组、哈希表 - 难度：中等 ## 题目链接 -- [剑指 Offer II 119. 最长连续序列 - 力扣](https://leetcode.cn/problems/WhsWhI/) +- [LCR 119. 最长连续序列 - 力扣](https://leetcode.cn/problems/WhsWhI/) ## 题目大意 diff --git "a/Solutions/0735. \350\241\214\346\230\237\347\242\260\346\222\236.md" b/docs/solutions/LCR/XagZNi.md similarity index 92% rename from "Solutions/0735. \350\241\214\346\230\237\347\242\260\346\222\236.md" rename to docs/solutions/LCR/XagZNi.md index e96f4dcd..128681b4 100644 --- "a/Solutions/0735. \350\241\214\346\230\237\347\242\260\346\222\236.md" +++ b/docs/solutions/LCR/XagZNi.md @@ -1,11 +1,11 @@ -# [0735. 行星碰撞](https://leetcode.cn/problems/asteroid-collision/) +# [LCR 037. 行星碰撞](https://leetcode.cn/problems/XagZNi/) - 标签：栈、数组 - 难度：中等 ## 题目链接 -- [0735. 行星碰撞 - 力扣](https://leetcode.cn/problems/asteroid-collision/) +- [LCR 037. 行星碰撞 - 力扣](https://leetcode.cn/problems/XagZNi/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 018. \346\234\211\346\225\210\347\232\204\345\233\236\346\226\207.md" b/docs/solutions/LCR/XltzEq.md similarity index 86% rename from "Solutions/\345\211\221\346\214\207 Offer II 018. \346\234\211\346\225\210\347\232\204\345\233\236\346\226\207.md" rename to docs/solutions/LCR/XltzEq.md index 952c8fba..d6ce554b 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 018. \346\234\211\346\225\210\347\232\204\345\233\236\346\226\207.md" +++ b/docs/solutions/LCR/XltzEq.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 018. 有效的回文](https://leetcode.cn/problems/XltzEq/) +# [LCR 018. 验证回文串](https://leetcode.cn/problems/XltzEq/) - 标签：双指针、字符串 - 难度：简单 ## 题目链接 -- [剑指 Offer II 018. 有效的回文 - 力扣](https://leetcode.cn/problems/XltzEq/) +- [LCR 018. 验证回文串 - 力扣](https://leetcode.cn/problems/XltzEq/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 102. \345\212\240\345\207\217\347\232\204\347\233\256\346\240\207\345\200\274.md" b/docs/solutions/LCR/YaVDxD.md similarity index 91% rename from "Solutions/\345\211\221\346\214\207 Offer II 102. \345\212\240\345\207\217\347\232\204\347\233\256\346\240\207\345\200\274.md" rename to docs/solutions/LCR/YaVDxD.md index 8f243470..76e11f0c 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 102. \345\212\240\345\207\217\347\232\204\347\233\256\346\240\207\345\200\274.md" +++ b/docs/solutions/LCR/YaVDxD.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 102. 加减的目标值](https://leetcode.cn/problems/YaVDxD/) +# [LCR 102. 目标和](https://leetcode.cn/problems/YaVDxD/) - 标签：数组、动态规划、回溯 - 难度：中等 ## 题目链接 -- [剑指 Offer II 102. 加减的目标值 - 力扣](https://leetcode.cn/problems/YaVDxD/) +- [LCR 102. 目标和 - 力扣](https://leetcode.cn/problems/YaVDxD/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 081. \345\205\201\350\256\270\351\207\215\345\244\215\351\200\211\346\213\251\345\205\203\347\264\240\347\232\204\347\273\204\345\220\210.md" b/docs/solutions/LCR/Ygoe9J.md similarity index 91% rename from "Solutions/\345\211\221\346\214\207 Offer II 081. \345\205\201\350\256\270\351\207\215\345\244\215\351\200\211\346\213\251\345\205\203\347\264\240\347\232\204\347\273\204\345\220\210.md" rename to docs/solutions/LCR/Ygoe9J.md index fe9edbb7..b28319a8 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 081. \345\205\201\350\256\270\351\207\215\345\244\215\351\200\211\346\213\251\345\205\203\347\264\240\347\232\204\347\273\204\345\220\210.md" +++ b/docs/solutions/LCR/Ygoe9J.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 081. 允许重复选择元素的组合](https://leetcode.cn/problems/Ygoe9J/) +# [LCR 081. 组合总和](https://leetcode.cn/problems/Ygoe9J/) - 标签：数组、回溯 - 难度：中等 ## 题目链接 -- [剑指 Offer II 081. 允许重复选择元素的组合 - 力扣](https://leetcode.cn/problems/Ygoe9J/) +- [LCR 081. 组合总和 - 力扣](https://leetcode.cn/problems/Ygoe9J/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 105. \345\262\233\345\261\277\347\232\204\346\234\200\345\244\247\351\235\242\347\247\257.md" b/docs/solutions/LCR/ZL6zAn.md similarity index 88% rename from "Solutions/\345\211\221\346\214\207 Offer II 105. \345\262\233\345\261\277\347\232\204\346\234\200\345\244\247\351\235\242\347\247\257.md" rename to docs/solutions/LCR/ZL6zAn.md index 03765059..c5c8ee2e 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 105. \345\262\233\345\261\277\347\232\204\346\234\200\345\244\247\351\235\242\347\247\257.md" +++ b/docs/solutions/LCR/ZL6zAn.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 105. 岛屿的最大面积](https://leetcode.cn/problems/ZL6zAn/) +# [LCR 105. 岛屿的最大面积](https://leetcode.cn/problems/ZL6zAn/) - 标签：深度优先搜索、广度优先搜索、并查集、数组、矩阵 - 难度：中等 ## 题目链接 -- [剑指 Offer II 105. 岛屿的最大面积 - 力扣](https://leetcode.cn/problems/ZL6zAn/) +- [LCR 105. 岛屿的最大面积 - 力扣](https://leetcode.cn/problems/ZL6zAn/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 009. \344\271\230\347\247\257\345\260\217\344\272\216 K \347\232\204\345\255\220\346\225\260\347\273\204.md" b/docs/solutions/LCR/ZVAVXX.md similarity index 87% rename from "Solutions/\345\211\221\346\214\207 Offer II 009. \344\271\230\347\247\257\345\260\217\344\272\216 K \347\232\204\345\255\220\346\225\260\347\273\204.md" rename to docs/solutions/LCR/ZVAVXX.md index bb7e4820..b6223caa 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 009. \344\271\230\347\247\257\345\260\217\344\272\216 K \347\232\204\345\255\220\346\225\260\347\273\204.md" +++ b/docs/solutions/LCR/ZVAVXX.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 009. 乘积小于 K 的子数组](https://leetcode.cn/problems/ZVAVXX/) +# [LCR 009. 乘积小于 K 的子数组](https://leetcode.cn/problems/ZVAVXX/) - 标签：数组、滑动窗口 - 难度：中等 ## 题目链接 -- [剑指 Offer II 009. 乘积小于 K 的子数组 - 力扣](https://leetcode.cn/problems/ZVAVXX/) +- [LCR 009. 乘积小于 K 的子数组 - 力扣](https://leetcode.cn/problems/ZVAVXX/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 020. \345\233\236\346\226\207\345\255\220\345\255\227\347\254\246\344\270\262\347\232\204\344\270\252\346\225\260.md" b/docs/solutions/LCR/a7VOhD.md similarity index 89% rename from "Solutions/\345\211\221\346\214\207 Offer II 020. \345\233\236\346\226\207\345\255\220\345\255\227\347\254\246\344\270\262\347\232\204\344\270\252\346\225\260.md" rename to docs/solutions/LCR/a7VOhD.md index 84d3b14a..2f1090ae 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 020. \345\233\236\346\226\207\345\255\220\345\255\227\347\254\246\344\270\262\347\232\204\344\270\252\346\225\260.md" +++ b/docs/solutions/LCR/a7VOhD.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 020. 回文子字符串的个数](https://leetcode.cn/problems/a7VOhD/) +# [LCR 020. 回文子串](https://leetcode.cn/problems/a7VOhD/) - 标签：字符串、动态规划 - 难度：中等 ## 题目链接 -- [剑指 Offer II 020. 回文子字符串的个数 - 力扣](https://leetcode.cn/problems/a7VOhD/) +- [LCR 020. 回文子串 - 力扣](https://leetcode.cn/problems/a7VOhD/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 027. \345\233\236\346\226\207\351\223\276\350\241\250.md" b/docs/solutions/LCR/aMhZSa.md similarity index 81% rename from "Solutions/\345\211\221\346\214\207 Offer II 027. \345\233\236\346\226\207\351\223\276\350\241\250.md" rename to docs/solutions/LCR/aMhZSa.md index 10eacce6..2d9cc3e4 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 027. \345\233\236\346\226\207\351\223\276\350\241\250.md" +++ b/docs/solutions/LCR/aMhZSa.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 027. 回文链表](https://leetcode.cn/problems/aMhZSa/) +# [LCR 027. 回文链表](https://leetcode.cn/problems/aMhZSa/) - 标签：栈、递归、链表、双指针 - 难度：简单 ## 题目链接 -- [剑指 Offer II 027. 回文链表 - 力扣](https://leetcode.cn/problems/aMhZSa/) +- [LCR 027. 回文链表 - 力扣](https://leetcode.cn/problems/aMhZSa/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 005. \345\215\225\350\257\215\351\225\277\345\272\246\347\232\204\346\234\200\345\244\247\344\271\230\347\247\257.md" b/docs/solutions/LCR/aseY1I.md similarity index 90% rename from "Solutions/\345\211\221\346\214\207 Offer II 005. \345\215\225\350\257\215\351\225\277\345\272\246\347\232\204\346\234\200\345\244\247\344\271\230\347\247\257.md" rename to docs/solutions/LCR/aseY1I.md index 7066e417..dabd22b7 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 005. \345\215\225\350\257\215\351\225\277\345\272\246\347\232\204\346\234\200\345\244\247\344\271\230\347\247\257.md" +++ b/docs/solutions/LCR/aseY1I.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 005. 单词长度的最大乘积](https://leetcode.cn/problems/aseY1I/) +# [LCR 005. 最大单词长度乘积](https://leetcode.cn/problems/aseY1I/) - 标签：位运算、数组、字符串 - 难度：中等 ## 题目链接 -- [剑指 Offer II 005. 单词长度的最大乘积 - 力扣](https://leetcode.cn/problems/aseY1I/) +- [LCR 005. 最大单词长度乘积 - 力扣](https://leetcode.cn/problems/aseY1I/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 116. \347\234\201\344\273\275\346\225\260\351\207\217.md" b/docs/solutions/LCR/bLyHh0.md similarity index 92% rename from "Solutions/\345\211\221\346\214\207 Offer II 116. \347\234\201\344\273\275\346\225\260\351\207\217.md" rename to docs/solutions/LCR/bLyHh0.md index 1ab9cace..733b3734 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 116. \347\234\201\344\273\275\346\225\260\351\207\217.md" +++ b/docs/solutions/LCR/bLyHh0.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 116. 省份数量](https://leetcode.cn/problems/bLyHh0/) +# [LCR 116. 省份数量](https://leetcode.cn/problems/bLyHh0/) - 标签：深度优先搜索、广度优先搜索、并查集、图 - 难度：中等 ## 题目链接 -- [剑指 Offer II 116. 省份数量 - 力扣](https://leetcode.cn/problems/bLyHh0/) +- [LCR 116. 省份数量 - 力扣](https://leetcode.cn/problems/bLyHh0/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 46. \346\212\212\346\225\260\345\255\227\347\277\273\350\257\221\346\210\220\345\255\227\347\254\246\344\270\262.md" b/docs/solutions/LCR/ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof.md similarity index 84% rename from "Solutions/\345\211\221\346\214\207 Offer 46. \346\212\212\346\225\260\345\255\227\347\277\273\350\257\221\346\210\220\345\255\227\347\254\246\344\270\262.md" rename to docs/solutions/LCR/ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof.md index 2dc575de..677e007d 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 46. \346\212\212\346\225\260\345\255\227\347\277\273\350\257\221\346\210\220\345\255\227\347\254\246\344\270\262.md" +++ b/docs/solutions/LCR/ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 46. 把数字翻译成字符串](https://leetcode.cn/problems/ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof/) +# [LCR 165. 解密数字](https://leetcode.cn/problems/ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof/) - 标签：字符串、动态规划 - 难度：中等 ## 题目链接 -- [剑指 Offer 46. 把数字翻译成字符串 - 力扣](https://leetcode.cn/problems/ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof/) +- [LCR 165. 解密数字 - 力扣](https://leetcode.cn/problems/ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 45. \346\212\212\346\225\260\347\273\204\346\216\222\346\210\220\346\234\200\345\260\217\347\232\204\346\225\260.md" b/docs/solutions/LCR/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof.md similarity index 78% rename from "Solutions/\345\211\221\346\214\207 Offer 45. \346\212\212\346\225\260\347\273\204\346\216\222\346\210\220\346\234\200\345\260\217\347\232\204\346\225\260.md" rename to docs/solutions/LCR/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof.md index fe9b4ee8..f803ce7e 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 45. \346\212\212\346\225\260\347\273\204\346\216\222\346\210\220\346\234\200\345\260\217\347\232\204\346\225\260.md" +++ b/docs/solutions/LCR/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 45. 把数组排成最小的数](https://leetcode.cn/problems/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof/) +# [LCR 164. 破解闯关密码](https://leetcode.cn/problems/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof/) - 标签：贪心、字符串、排序 - 难度：中等 ## 题目链接 -- [剑指 Offer 45. 把数组排成最小的数 - 力扣](https://leetcode.cn/problems/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof/) +- [LCR 164. 破解闯关密码 - 力扣](https://leetcode.cn/problems/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof/) ## 题目大意 @@ -73,4 +73,4 @@ class Solution: ## 参考资料 -- 【题解】[剑指 Offer 45. 把数组排成最小的数（自定义排序，清晰图解） - 把数组排成最小的数 - 力扣](https://leetcode.cn/problems/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof/solution/mian-shi-ti-45-ba-shu-zu-pai-cheng-zui-xiao-de-s-4/) +- 【题解】[LCR 164. 破解闯关密码（自定义排序，清晰图解） - 把数组排成最小的数 - 力扣](https://leetcode.cn/problems/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof/solution/mian-shi-ti-45-ba-shu-zu-pai-cheng-zui-xiao-de-s-4/) diff --git "a/Solutions/\345\211\221\346\214\207 Offer 67. \346\212\212\345\255\227\347\254\246\344\270\262\350\275\254\346\215\242\346\210\220\346\225\264\346\225\260.md" b/docs/solutions/LCR/ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof.md similarity index 88% rename from "Solutions/\345\211\221\346\214\207 Offer 67. \346\212\212\345\255\227\347\254\246\344\270\262\350\275\254\346\215\242\346\210\220\346\225\264\346\225\260.md" rename to docs/solutions/LCR/ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof.md index b97b3760..438f4929 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 67. \346\212\212\345\255\227\347\254\246\344\270\262\350\275\254\346\215\242\346\210\220\346\225\264\346\225\260.md" +++ b/docs/solutions/LCR/ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 67. 把字符串转换成整数](https://leetcode.cn/problems/ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof/) +# [LCR 192. 把字符串转换成整数 (atoi)](https://leetcode.cn/problems/ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof/) - 标签：字符串 - 难度：中等 ## 题目链接 -- [剑指 Offer 67. 把字符串转换成整数 - 力扣](https://leetcode.cn/problems/ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof/) +- [LCR 192. 把字符串转换成整数 (atoi) - 力扣](https://leetcode.cn/problems/ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 30. \345\214\205\345\220\253min\345\207\275\346\225\260\347\232\204\346\240\210.md" b/docs/solutions/LCR/bao-han-minhan-shu-de-zhan-lcof.md similarity index 85% rename from "Solutions/\345\211\221\346\214\207 Offer 30. \345\214\205\345\220\253min\345\207\275\346\225\260\347\232\204\346\240\210.md" rename to docs/solutions/LCR/bao-han-minhan-shu-de-zhan-lcof.md index c0eac409..b7d49f1d 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 30. \345\214\205\345\220\253min\345\207\275\346\225\260\347\232\204\346\240\210.md" +++ b/docs/solutions/LCR/bao-han-minhan-shu-de-zhan-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 30. 包含min函数的栈](https://leetcode.cn/problems/bao-han-minhan-shu-de-zhan-lcof/) +# [LCR 147. 最小栈](https://leetcode.cn/problems/bao-han-minhan-shu-de-zhan-lcof/) - 标签：栈、设计 - 难度：简单 ## 题目链接 -- [剑指 Offer 30. 包含min函数的栈 - 力扣](https://leetcode.cn/problems/bao-han-minhan-shu-de-zhan-lcof/) +- [LCR 147. 最小栈 - 力扣](https://leetcode.cn/problems/bao-han-minhan-shu-de-zhan-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 61. \346\211\221\345\205\213\347\211\214\344\270\255\347\232\204\351\241\272\345\255\220.md" b/docs/solutions/LCR/bu-ke-pai-zhong-de-shun-zi-lcof.md similarity index 87% rename from "Solutions/\345\211\221\346\214\207 Offer 61. \346\211\221\345\205\213\347\211\214\344\270\255\347\232\204\351\241\272\345\255\220.md" rename to docs/solutions/LCR/bu-ke-pai-zhong-de-shun-zi-lcof.md index 1efb62b1..073fbc1b 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 61. \346\211\221\345\205\213\347\211\214\344\270\255\347\232\204\351\241\272\345\255\220.md" +++ b/docs/solutions/LCR/bu-ke-pai-zhong-de-shun-zi-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 61. 扑克牌中的顺子](https://leetcode.cn/problems/bu-ke-pai-zhong-de-shun-zi-lcof/) +# [LCR 186. 文物朝代判断](https://leetcode.cn/problems/bu-ke-pai-zhong-de-shun-zi-lcof/) - 标签：数组、排序 - 难度：简单 ## 题目链接 -- [剑指 Offer 61. 扑克牌中的顺子 - 力扣](https://leetcode.cn/problems/bu-ke-pai-zhong-de-shun-zi-lcof/) +- [LCR 186. 文物朝代判断 - 力扣](https://leetcode.cn/problems/bu-ke-pai-zhong-de-shun-zi-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 65. \344\270\215\347\224\250\345\212\240\345\207\217\344\271\230\351\231\244\345\201\232\345\212\240\346\263\225.md" b/docs/solutions/LCR/bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof.md similarity index 85% rename from "Solutions/\345\211\221\346\214\207 Offer 65. \344\270\215\347\224\250\345\212\240\345\207\217\344\271\230\351\231\244\345\201\232\345\212\240\346\263\225.md" rename to docs/solutions/LCR/bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof.md index ee9d3511..e1bdbfcc 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 65. \344\270\215\347\224\250\345\212\240\345\207\217\344\271\230\351\231\244\345\201\232\345\212\240\346\263\225.md" +++ b/docs/solutions/LCR/bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 65. 不用加减乘除做加法](https://leetcode.cn/problems/bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof/) +# [LCR 190. 加密运算](https://leetcode.cn/problems/bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof/) - 标签：位运算、数学 - 难度：简单 ## 题目链接 -- [剑指 Offer 65. 不用加减乘除做加法 - 力扣](https://leetcode.cn/problems/bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof/) +- [LCR 190. 加密运算 - 力扣](https://leetcode.cn/problems/bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 022. \351\223\276\350\241\250\344\270\255\347\216\257\347\232\204\345\205\245\345\217\243\350\212\202\347\202\271.md" b/docs/solutions/LCR/c32eOV.md similarity index 89% rename from "Solutions/\345\211\221\346\214\207 Offer II 022. \351\223\276\350\241\250\344\270\255\347\216\257\347\232\204\345\205\245\345\217\243\350\212\202\347\202\271.md" rename to docs/solutions/LCR/c32eOV.md index 9dd6c703..d82762af 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 022. \351\223\276\350\241\250\344\270\255\347\216\257\347\232\204\345\205\245\345\217\243\350\212\202\347\202\271.md" +++ b/docs/solutions/LCR/c32eOV.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 022. 链表中环的入口节点](https://leetcode.cn/problems/c32eOV/) +# [LCR 022. 环形链表 II](https://leetcode.cn/problems/c32eOV/) - 标签：哈希表、链表、双指针 - 难度：中等 ## 题目链接 -- [剑指 Offer II 022. 链表中环的入口节点 - 力扣](https://leetcode.cn/problems/c32eOV/) +- [LCR 022. 环形链表 II - 力扣](https://leetcode.cn/problems/c32eOV/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 49. \344\270\221\346\225\260.md" b/docs/solutions/LCR/chou-shu-lcof.md similarity index 86% rename from "Solutions/\345\211\221\346\214\207 Offer 49. \344\270\221\346\225\260.md" rename to docs/solutions/LCR/chou-shu-lcof.md index b87bc0b4..388ed365 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 49. \344\270\221\346\225\260.md" +++ b/docs/solutions/LCR/chou-shu-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 49. 丑数](https://leetcode.cn/problems/chou-shu-lcof/) +# [LCR 168. 丑数](https://leetcode.cn/problems/chou-shu-lcof/) - 标签：哈希表、数学、动态规划、堆（优先队列） - 难度：中等 ## 题目链接 -- [剑指 Offer 49. 丑数 - 力扣](https://leetcode.cn/problems/chou-shu-lcof/) +- [LCR 168. 丑数 - 力扣](https://leetcode.cn/problems/chou-shu-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 32 - II. \344\273\216\344\270\212\345\210\260\344\270\213\346\211\223\345\215\260\344\272\214\345\217\211\346\240\221 II.md" b/docs/solutions/LCR/cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof.md similarity index 83% rename from "Solutions/\345\211\221\346\214\207 Offer 32 - II. \344\273\216\344\270\212\345\210\260\344\270\213\346\211\223\345\215\260\344\272\214\345\217\211\346\240\221 II.md" rename to docs/solutions/LCR/cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof.md index d9d6404c..1c5f9909 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 32 - II. \344\273\216\344\270\212\345\210\260\344\270\213\346\211\223\345\215\260\344\272\214\345\217\211\346\240\221 II.md" +++ b/docs/solutions/LCR/cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 32 - II. 从上到下打印二叉树 II](https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof/) +# [LCR 150. 彩灯装饰记录 II](https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof/) - 标签：树、广度优先搜索、二叉树 - 难度：简单 ## 题目链接 -- [剑指 Offer 32 - II. 从上到下打印二叉树 II - 力扣](https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof/) +- [LCR 150. 彩灯装饰记录 II - 力扣](https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 32 - III. \344\273\216\344\270\212\345\210\260\344\270\213\346\211\223\345\215\260\344\272\214\345\217\211\346\240\221 III.md" b/docs/solutions/LCR/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof.md similarity index 87% rename from "Solutions/\345\211\221\346\214\207 Offer 32 - III. \344\273\216\344\270\212\345\210\260\344\270\213\346\211\223\345\215\260\344\272\214\345\217\211\346\240\221 III.md" rename to docs/solutions/LCR/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof.md index c70ab810..3448ae42 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 32 - III. \344\273\216\344\270\212\345\210\260\344\270\213\346\211\223\345\215\260\344\272\214\345\217\211\346\240\221 III.md" +++ b/docs/solutions/LCR/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 32 - III. 从上到下打印二叉树 III](https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof/) +# [LCR 151. 彩灯装饰记录 III](https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof/) - 标签：树、广度优先搜索、二叉树 - 难度：中等 ## 题目链接 -- [剑指 Offer 32 - III. 从上到下打印二叉树 III - 力扣](https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof/) +- [LCR 151. 彩灯装饰记录 III - 力扣](https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 32 - I. \344\273\216\344\270\212\345\210\260\344\270\213\346\211\223\345\215\260\344\272\214\345\217\211\346\240\221.md" b/docs/solutions/LCR/cong-shang-dao-xia-da-yin-er-cha-shu-lcof.md similarity index 80% rename from "Solutions/\345\211\221\346\214\207 Offer 32 - I. \344\273\216\344\270\212\345\210\260\344\270\213\346\211\223\345\215\260\344\272\214\345\217\211\346\240\221.md" rename to docs/solutions/LCR/cong-shang-dao-xia-da-yin-er-cha-shu-lcof.md index 5929d2e9..87cb98b5 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 32 - I. \344\273\216\344\270\212\345\210\260\344\270\213\346\211\223\345\215\260\344\272\214\345\217\211\346\240\221.md" +++ b/docs/solutions/LCR/cong-shang-dao-xia-da-yin-er-cha-shu-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 32 - I. 从上到下打印二叉树](https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-lcof/) +# [LCR 149. 彩灯装饰记录 I](https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-lcof/) - 标签：树、广度优先搜索、二叉树 - 难度：中等 ## 题目链接 -- [剑指 Offer 32 - I. 从上到下打印二叉树 - 力扣](https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-lcof/) +- [LCR 149. 彩灯装饰记录 I - 力扣](https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 06. \344\273\216\345\260\276\345\210\260\345\244\264\346\211\223\345\215\260\351\223\276\350\241\250.md" b/docs/solutions/LCR/cong-wei-dao-tou-da-yin-lian-biao-lcof.md similarity index 70% rename from "Solutions/\345\211\221\346\214\207 Offer 06. \344\273\216\345\260\276\345\210\260\345\244\264\346\211\223\345\215\260\351\223\276\350\241\250.md" rename to docs/solutions/LCR/cong-wei-dao-tou-da-yin-lian-biao-lcof.md index 159055e3..134bb705 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 06. \344\273\216\345\260\276\345\210\260\345\244\264\346\211\223\345\215\260\351\223\276\350\241\250.md" +++ b/docs/solutions/LCR/cong-wei-dao-tou-da-yin-lian-biao-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 06. 从尾到头打印链表](https://leetcode.cn/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof/) +# [LCR 123. 图书整理 I](https://leetcode.cn/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof/) - 标签：栈、递归、链表、双指针 - 难度：简单 ## 题目链接 -- [剑指 Offer 06. 从尾到头打印链表 - 力扣](https://leetcode.cn/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof/) +- [LCR 123. 图书整理 I - 力扣](https://leetcode.cn/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 032. \346\234\211\346\225\210\347\232\204\345\217\230\344\275\215\350\257\215.md" b/docs/solutions/LCR/dKk3P7.md similarity index 88% rename from "Solutions/\345\211\221\346\214\207 Offer II 032. \346\234\211\346\225\210\347\232\204\345\217\230\344\275\215\350\257\215.md" rename to docs/solutions/LCR/dKk3P7.md index 6ac97654..841495e7 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 032. \346\234\211\346\225\210\347\232\204\345\217\230\344\275\215\350\257\215.md" +++ b/docs/solutions/LCR/dKk3P7.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 032. 有效的变位词](https://leetcode.cn/problems/dKk3P7/) +# [LCR 032. 有效的字母异位词](https://leetcode.cn/problems/dKk3P7/) - 标签：哈希表、字符串、排序 - 难度：简单 ## 题目链接 -- [剑指 Offer II 032. 有效的变位词 - 力扣](https://leetcode.cn/problems/dKk3P7/) +- [LCR 032. 有效的字母异位词 - 力扣](https://leetcode.cn/problems/dKk3P7/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 17. \346\211\223\345\215\260\344\273\2161\345\210\260\346\234\200\345\244\247\347\232\204n\344\275\215\346\225\260.md" b/docs/solutions/LCR/da-yin-cong-1dao-zui-da-de-nwei-shu-lcof.md similarity index 60% rename from "Solutions/\345\211\221\346\214\207 Offer 17. \346\211\223\345\215\260\344\273\2161\345\210\260\346\234\200\345\244\247\347\232\204n\344\275\215\346\225\260.md" rename to docs/solutions/LCR/da-yin-cong-1dao-zui-da-de-nwei-shu-lcof.md index fc156377..5f8a4dd7 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 17. \346\211\223\345\215\260\344\273\2161\345\210\260\346\234\200\345\244\247\347\232\204n\344\275\215\346\225\260.md" +++ b/docs/solutions/LCR/da-yin-cong-1dao-zui-da-de-nwei-shu-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 17. 打印从1到最大的n位数](https://leetcode.cn/problems/da-yin-cong-1dao-zui-da-de-nwei-shu-lcof/) +# [LCR 135. 报数](https://leetcode.cn/problems/da-yin-cong-1dao-zui-da-de-nwei-shu-lcof/) - 标签：数组、数学 - 难度：简单 ## 题目链接 -- [剑指 Offer 17. 打印从1到最大的n位数 - 力扣](https://leetcode.cn/problems/da-yin-cong-1dao-zui-da-de-nwei-shu-lcof/) +- [LCR 135. 报数 - 力扣](https://leetcode.cn/problems/da-yin-cong-1dao-zui-da-de-nwei-shu-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 50. \347\254\254\344\270\200\344\270\252\345\217\252\345\207\272\347\216\260\344\270\200\346\254\241\347\232\204\345\255\227\347\254\246.md" b/docs/solutions/LCR/di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof.md similarity index 73% rename from "Solutions/\345\211\221\346\214\207 Offer 50. \347\254\254\344\270\200\344\270\252\345\217\252\345\207\272\347\216\260\344\270\200\346\254\241\347\232\204\345\255\227\347\254\246.md" rename to docs/solutions/LCR/di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof.md index b97c2e2c..8fb09e82 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 50. \347\254\254\344\270\200\344\270\252\345\217\252\345\207\272\347\216\260\344\270\200\346\254\241\347\232\204\345\255\227\347\254\246.md" +++ b/docs/solutions/LCR/di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 50. 第一个只出现一次的字符](https://leetcode.cn/problems/di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof/) +# [LCR 169. 招式拆解 II](https://leetcode.cn/problems/di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof/) - 标签：队列、哈希表、字符串、计数 - 难度：简单 ## 题目链接 -- [剑指 Offer 50. 第一个只出现一次的字符 - 力扣](https://leetcode.cn/problems/di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof/) +- [LCR 169. 招式拆解 II - 力扣](https://leetcode.cn/problems/di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 21. \350\260\203\346\225\264\346\225\260\347\273\204\351\241\272\345\272\217\344\275\277\345\245\207\346\225\260\344\275\215\344\272\216\345\201\266\346\225\260\345\211\215\351\235\242.md" b/docs/solutions/LCR/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof.md similarity index 79% rename from "Solutions/\345\211\221\346\214\207 Offer 21. \350\260\203\346\225\264\346\225\260\347\273\204\351\241\272\345\272\217\344\275\277\345\245\207\346\225\260\344\275\215\344\272\216\345\201\266\346\225\260\345\211\215\351\235\242.md" rename to docs/solutions/LCR/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof.md index 6cd03adf..bb452cb1 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 21. \350\260\203\346\225\264\346\225\260\347\273\204\351\241\272\345\272\217\344\275\277\345\245\207\346\225\260\344\275\215\344\272\216\345\201\266\346\225\260\345\211\215\351\235\242.md" +++ b/docs/solutions/LCR/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 21. 调整数组顺序使奇数位于偶数前面](https://leetcode.cn/problems/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof/) +# [LCR 139. 训练计划 I](https://leetcode.cn/problems/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof/) - 标签：数组、双指针、排序 - 难度：简单 ## 题目链接 -- [剑指 Offer 21. 调整数组顺序使奇数位于偶数前面 - 力扣](https://leetcode.cn/problems/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof/) +- [LCR 139. 训练计划 I - 力扣](https://leetcode.cn/problems/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 28. \345\257\271\347\247\260\347\232\204\344\272\214\345\217\211\346\240\221.md" b/docs/solutions/LCR/dui-cheng-de-er-cha-shu-lcof.md similarity index 84% rename from "Solutions/\345\211\221\346\214\207 Offer 28. \345\257\271\347\247\260\347\232\204\344\272\214\345\217\211\346\240\221.md" rename to docs/solutions/LCR/dui-cheng-de-er-cha-shu-lcof.md index 2cec0f3f..63280f93 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 28. \345\257\271\347\247\260\347\232\204\344\272\214\345\217\211\346\240\221.md" +++ b/docs/solutions/LCR/dui-cheng-de-er-cha-shu-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 28. 对称的二叉树](https://leetcode.cn/problems/dui-cheng-de-er-cha-shu-lcof/) +# [LCR 145. 判断对称二叉树](https://leetcode.cn/problems/dui-cheng-de-er-cha-shu-lcof/) - 标签：树、深度优先搜索、广度优先搜索、二叉树 - 难度：简单 ## 题目链接 -- [剑指 Offer 28. 对称的二叉树 - 力扣](https://leetcode.cn/problems/dui-cheng-de-er-cha-shu-lcof/) +- [LCR 145. 判断对称二叉树 - 力扣](https://leetcode.cn/problems/dui-cheng-de-er-cha-shu-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 59 - II. \351\230\237\345\210\227\347\232\204\346\234\200\345\244\247\345\200\274.md" b/docs/solutions/LCR/dui-lie-de-zui-da-zhi-lcof.md similarity index 89% rename from "Solutions/\345\211\221\346\214\207 Offer 59 - II. \351\230\237\345\210\227\347\232\204\346\234\200\345\244\247\345\200\274.md" rename to docs/solutions/LCR/dui-lie-de-zui-da-zhi-lcof.md index 75a78621..a032fa76 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 59 - II. \351\230\237\345\210\227\347\232\204\346\234\200\345\244\247\345\200\274.md" +++ b/docs/solutions/LCR/dui-lie-de-zui-da-zhi-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 59 - II. 队列的最大值](https://leetcode.cn/problems/dui-lie-de-zui-da-zhi-lcof/) +# [LCR 184. 设计自助结算系统](https://leetcode.cn/problems/dui-lie-de-zui-da-zhi-lcof/) - 标签：设计、队列、单调队列 - 难度：中等 ## 题目链接 -- [剑指 Offer 59 - II. 队列的最大值 - 力扣](https://leetcode.cn/problems/dui-lie-de-zui-da-zhi-lcof/) +- [LCR 184. 设计自助结算系统 - 力扣](https://leetcode.cn/problems/dui-lie-de-zui-da-zhi-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 27. \344\272\214\345\217\211\346\240\221\347\232\204\351\225\234\345\203\217.md" b/docs/solutions/LCR/er-cha-shu-de-jing-xiang-lcof.md similarity index 74% rename from "Solutions/\345\211\221\346\214\207 Offer 27. \344\272\214\345\217\211\346\240\221\347\232\204\351\225\234\345\203\217.md" rename to docs/solutions/LCR/er-cha-shu-de-jing-xiang-lcof.md index c4c75b72..3e3de15c 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 27. \344\272\214\345\217\211\346\240\221\347\232\204\351\225\234\345\203\217.md" +++ b/docs/solutions/LCR/er-cha-shu-de-jing-xiang-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 27. 二叉树的镜像](https://leetcode.cn/problems/er-cha-shu-de-jing-xiang-lcof/) +# [LCR 144. 翻转二叉树](https://leetcode.cn/problems/er-cha-shu-de-jing-xiang-lcof/) - 标签：树、深度优先搜索、广度优先搜索、二叉树 - 难度：简单 ## 题目链接 -- [剑指 Offer 27. 二叉树的镜像 - 力扣](https://leetcode.cn/problems/er-cha-shu-de-jing-xiang-lcof/) +- [LCR 144. 翻转二叉树 - 力扣](https://leetcode.cn/problems/er-cha-shu-de-jing-xiang-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 55 - I. \344\272\214\345\217\211\346\240\221\347\232\204\346\267\261\345\272\246.md" b/docs/solutions/LCR/er-cha-shu-de-shen-du-lcof.md similarity index 78% rename from "Solutions/\345\211\221\346\214\207 Offer 55 - I. \344\272\214\345\217\211\346\240\221\347\232\204\346\267\261\345\272\246.md" rename to docs/solutions/LCR/er-cha-shu-de-shen-du-lcof.md index e2d490e2..ac21d2df 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 55 - I. \344\272\214\345\217\211\346\240\221\347\232\204\346\267\261\345\272\246.md" +++ b/docs/solutions/LCR/er-cha-shu-de-shen-du-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 55 - I. 二叉树的深度](https://leetcode.cn/problems/er-cha-shu-de-shen-du-lcof/) +# [LCR 175. 计算二叉树的深度](https://leetcode.cn/problems/er-cha-shu-de-shen-du-lcof/) - 标签：树、深度优先搜索、广度优先搜索、二叉树 - 难度：简单 ## 题目链接 -- [剑指 Offer 55 - I. 二叉树的深度 - 力扣](https://leetcode.cn/problems/er-cha-shu-de-shen-du-lcof/) +- [LCR 175. 计算二叉树的深度 - 力扣](https://leetcode.cn/problems/er-cha-shu-de-shen-du-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 68 - II. \344\272\214\345\217\211\346\240\221\347\232\204\346\234\200\350\277\221\345\205\254\345\205\261\347\245\226\345\205\210.md" b/docs/solutions/LCR/er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof.md similarity index 89% rename from "Solutions/\345\211\221\346\214\207 Offer 68 - II. \344\272\214\345\217\211\346\240\221\347\232\204\346\234\200\350\277\221\345\205\254\345\205\261\347\245\226\345\205\210.md" rename to docs/solutions/LCR/er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof.md index 79a9ef48..e2dcac43 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 68 - II. \344\272\214\345\217\211\346\240\221\347\232\204\346\234\200\350\277\221\345\205\254\345\205\261\347\245\226\345\205\210.md" +++ b/docs/solutions/LCR/er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 68 - II. 二叉树的最近公共祖先](https://leetcode.cn/problems/er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof/) +# [LCR 194. 二叉树的最近公共祖先](https://leetcode.cn/problems/er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof/) - 标签：树、深度优先搜索、二叉树 - 难度：简单 ## 题目链接 -- [剑指 Offer 68 - II. 二叉树的最近公共祖先 - 力扣](https://leetcode.cn/problems/er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof/) +- [LCR 194. 二叉树的最近公共祖先 - 力扣](https://leetcode.cn/problems/er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 34. \344\272\214\345\217\211\346\240\221\344\270\255\345\222\214\344\270\272\346\237\220\344\270\200\345\200\274\347\232\204\350\267\257\345\276\204.md" b/docs/solutions/LCR/er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof.md similarity index 80% rename from "Solutions/\345\211\221\346\214\207 Offer 34. \344\272\214\345\217\211\346\240\221\344\270\255\345\222\214\344\270\272\346\237\220\344\270\200\345\200\274\347\232\204\350\267\257\345\276\204.md" rename to docs/solutions/LCR/er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof.md index 2cd732c8..72fb70ee 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 34. \344\272\214\345\217\211\346\240\221\344\270\255\345\222\214\344\270\272\346\237\220\344\270\200\345\200\274\347\232\204\350\267\257\345\276\204.md" +++ b/docs/solutions/LCR/er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 34. 二叉树中和为某一值的路径](https://leetcode.cn/problems/er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof/) +# [LCR 153. 二叉树中和为目标值的路径](https://leetcode.cn/problems/er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof/) - 标签：树、深度优先搜索、回溯、二叉树 - 难度：中等 ## 题目链接 -- [剑指 Offer 34. 二叉树中和为某一值的路径 - 力扣](https://leetcode.cn/problems/er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof/) +- [LCR 153. 二叉树中和为目标值的路径 - 力扣](https://leetcode.cn/problems/er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 54. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\347\232\204\347\254\254k\345\244\247\350\212\202\347\202\271.md" b/docs/solutions/LCR/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof.md similarity index 93% rename from "Solutions/\345\211\221\346\214\207 Offer 54. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\347\232\204\347\254\254k\345\244\247\350\212\202\347\202\271.md" rename to docs/solutions/LCR/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof.md index da4581ac..b649faad 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 54. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\347\232\204\347\254\254k\345\244\247\350\212\202\347\202\271.md" +++ b/docs/solutions/LCR/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 54. 二叉搜索树的第k大节点](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof/) +# [LCR 174. 寻找二叉搜索树中的目标节点](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof/) - 标签：树、深度优先搜索、二叉搜索树、二叉树 - 难度：简单 ## 题目链接 -- [剑指 Offer 54. 二叉搜索树的第k大节点 - 力扣](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof/) +- [LCR 174. 寻找二叉搜索树中的目标节点 - 力扣](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 33. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\347\232\204\345\220\216\345\272\217\351\201\215\345\216\206\345\272\217\345\210\227.md" b/docs/solutions/LCR/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof.md similarity index 88% rename from "Solutions/\345\211\221\346\214\207 Offer 33. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\347\232\204\345\220\216\345\272\217\351\201\215\345\216\206\345\272\217\345\210\227.md" rename to docs/solutions/LCR/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof.md index f2b1f700..47067c60 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 33. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\347\232\204\345\220\216\345\272\217\351\201\215\345\216\206\345\272\217\345\210\227.md" +++ b/docs/solutions/LCR/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 33. 二叉搜索树的后序遍历序列](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof/) +# [LCR 152. 验证二叉搜索树的后序遍历序列](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof/) - 标签：栈、树、二叉搜索树、递归、二叉树、单调栈 - 难度：中等 ## 题目链接 -- [剑指 Offer 33. 二叉搜索树的后序遍历序列 - 力扣](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof/) +- [LCR 152. 验证二叉搜索树的后序遍历序列 - 力扣](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 68 - I. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\347\232\204\346\234\200\350\277\221\345\205\254\345\205\261\347\245\226\345\205\210.md" b/docs/solutions/LCR/er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof.md similarity index 86% rename from "Solutions/\345\211\221\346\214\207 Offer 68 - I. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\347\232\204\346\234\200\350\277\221\345\205\254\345\205\261\347\245\226\345\205\210.md" rename to docs/solutions/LCR/er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof.md index e162f4b8..7930c210 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 68 - I. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\347\232\204\346\234\200\350\277\221\345\205\254\345\205\261\347\245\226\345\205\210.md" +++ b/docs/solutions/LCR/er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 68 - I. 二叉搜索树的最近公共祖先](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof/) +# [LCR 193. 二叉搜索树的最近公共祖先](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof/) - 标签：树、深度优先搜索、二叉搜索树、二叉树 - 难度：简单 ## 题目链接 -- [剑指 Offer 68 - I. 二叉搜索树的最近公共祖先 - 力扣](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof/) +- [LCR 193. 二叉搜索树的最近公共祖先 - 力扣](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 36. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\344\270\216\345\217\214\345\220\221\351\223\276\350\241\250.md" b/docs/solutions/LCR/er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof.md similarity index 84% rename from "Solutions/\345\211\221\346\214\207 Offer 36. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\344\270\216\345\217\214\345\220\221\351\223\276\350\241\250.md" rename to docs/solutions/LCR/er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof.md index 18e99982..882820b0 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 36. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\344\270\216\345\217\214\345\220\221\351\223\276\350\241\250.md" +++ b/docs/solutions/LCR/er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 36. 二叉搜索树与双向链表](https://leetcode.cn/problems/er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof/) +# [LCR 155. 将二叉搜索树转化为排序的双向链表](https://leetcode.cn/problems/er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof/) - 标签：栈、树、深度优先搜索、二叉搜索树、链表、二叉树、双向链表 - 难度：中等 ## 题目链接 -- [剑指 Offer 36. 二叉搜索树与双向链表 - 力扣](https://leetcode.cn/problems/er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof/) +- [LCR 155. 将二叉搜索树转化为排序的双向链表 - 力扣](https://leetcode.cn/problems/er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 15. \344\272\214\350\277\233\345\210\266\344\270\2551\347\232\204\344\270\252\346\225\260.md" b/docs/solutions/LCR/er-jin-zhi-zhong-1de-ge-shu-lcof.md similarity index 82% rename from "Solutions/\345\211\221\346\214\207 Offer 15. \344\272\214\350\277\233\345\210\266\344\270\2551\347\232\204\344\270\252\346\225\260.md" rename to docs/solutions/LCR/er-jin-zhi-zhong-1de-ge-shu-lcof.md index 792ce325..c9df6b42 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 15. \344\272\214\350\277\233\345\210\266\344\270\2551\347\232\204\344\270\252\346\225\260.md" +++ b/docs/solutions/LCR/er-jin-zhi-zhong-1de-ge-shu-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 15. 二进制中1的个数](https://leetcode.cn/problems/er-jin-zhi-zhong-1de-ge-shu-lcof/) +# [LCR 133. 位 1 的个数](https://leetcode.cn/problems/er-jin-zhi-zhong-1de-ge-shu-lcof/) - 标签：位运算 - 难度：简单 ## 题目链接 -- [剑指 Offer 15. 二进制中1的个数 - 力扣](https://leetcode.cn/problems/er-jin-zhi-zhong-1de-ge-shu-lcof/) +- [LCR 133. 位 1 的个数 - 力扣](https://leetcode.cn/problems/er-jin-zhi-zhong-1de-ge-shu-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 04. \344\272\214\347\273\264\346\225\260\347\273\204\344\270\255\347\232\204\346\237\245\346\211\276.md" b/docs/solutions/LCR/er-wei-shu-zu-zhong-de-cha-zhao-lcof.md similarity index 92% rename from "Solutions/\345\211\221\346\214\207 Offer 04. \344\272\214\347\273\264\346\225\260\347\273\204\344\270\255\347\232\204\346\237\245\346\211\276.md" rename to docs/solutions/LCR/er-wei-shu-zu-zhong-de-cha-zhao-lcof.md index e4e93206..1a4eb233 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 04. \344\272\214\347\273\264\346\225\260\347\273\204\344\270\255\347\232\204\346\237\245\346\211\276.md" +++ b/docs/solutions/LCR/er-wei-shu-zu-zhong-de-cha-zhao-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 04. 二维数组中的查找](https://leetcode.cn/problems/er-wei-shu-zu-zhong-de-cha-zhao-lcof/) +# [LCR 121. 寻找目标值 - 二维数组](https://leetcode.cn/problems/er-wei-shu-zu-zhong-de-cha-zhao-lcof/) - 标签：数组、二分查找、分治、矩阵 - 难度：中等 ## 题目链接 -- [剑指 Offer 04. 二维数组中的查找 - 力扣](https://leetcode.cn/problems/er-wei-shu-zu-zhong-de-cha-zhao-lcof/) +- [LCR 121. 寻找目标值 - 二维数组 - 力扣](https://leetcode.cn/problems/er-wei-shu-zu-zhong-de-cha-zhao-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 58 - I. \347\277\273\350\275\254\345\215\225\350\257\215\351\241\272\345\272\217.md" b/docs/solutions/LCR/fan-zhuan-dan-ci-shun-xu-lcof.md similarity index 74% rename from "Solutions/\345\211\221\346\214\207 Offer 58 - I. \347\277\273\350\275\254\345\215\225\350\257\215\351\241\272\345\272\217.md" rename to docs/solutions/LCR/fan-zhuan-dan-ci-shun-xu-lcof.md index 51deea29..99faaa61 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 58 - I. \347\277\273\350\275\254\345\215\225\350\257\215\351\241\272\345\272\217.md" +++ b/docs/solutions/LCR/fan-zhuan-dan-ci-shun-xu-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 58 - I. 翻转单词顺序](https://leetcode.cn/problems/fan-zhuan-dan-ci-shun-xu-lcof/) +# [LCR 181. 字符串中的单词反转](https://leetcode.cn/problems/fan-zhuan-dan-ci-shun-xu-lcof/) - 标签：双指针、字符串 - 难度：简单 ## 题目链接 -- [剑指 Offer 58 - I. 翻转单词顺序 - 力扣](https://leetcode.cn/problems/fan-zhuan-dan-ci-shun-xu-lcof/) +- [LCR 181. 字符串中的单词反转 - 力扣](https://leetcode.cn/problems/fan-zhuan-dan-ci-shun-xu-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 24. \345\217\215\350\275\254\351\223\276\350\241\250.md" b/docs/solutions/LCR/fan-zhuan-lian-biao-lcof.md similarity index 94% rename from "Solutions/\345\211\221\346\214\207 Offer 24. \345\217\215\350\275\254\351\223\276\350\241\250.md" rename to docs/solutions/LCR/fan-zhuan-lian-biao-lcof.md index cf955d63..40000966 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 24. \345\217\215\350\275\254\351\223\276\350\241\250.md" +++ b/docs/solutions/LCR/fan-zhuan-lian-biao-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 24. 反转链表](https://leetcode.cn/problems/fan-zhuan-lian-biao-lcof/) +# [LCR 141. 训练计划 III](https://leetcode.cn/problems/fan-zhuan-lian-biao-lcof/) - 标签：递归、链表 - 难度：简单 ## 题目链接 -- [剑指 Offer 24. 反转链表 - 力扣](https://leetcode.cn/problems/fan-zhuan-lian-biao-lcof/) +- [LCR 141. 训练计划 III - 力扣](https://leetcode.cn/problems/fan-zhuan-lian-biao-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 10- I. \346\226\220\346\263\242\351\202\243\345\245\221\346\225\260\345\210\227.md" b/docs/solutions/LCR/fei-bo-na-qi-shu-lie-lcof.md similarity index 76% rename from "Solutions/\345\211\221\346\214\207 Offer 10- I. \346\226\220\346\263\242\351\202\243\345\245\221\346\225\260\345\210\227.md" rename to docs/solutions/LCR/fei-bo-na-qi-shu-lie-lcof.md index fcfd3ac4..bf28b20a 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 10- I. \346\226\220\346\263\242\351\202\243\345\245\221\346\225\260\345\210\227.md" +++ b/docs/solutions/LCR/fei-bo-na-qi-shu-lie-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 10- I. 斐波那契数列](https://leetcode.cn/problems/fei-bo-na-qi-shu-lie-lcof/) +# [LCR 126. 斐波那契数](https://leetcode.cn/problems/fei-bo-na-qi-shu-lie-lcof/) - 标签：记忆化搜索、数学、动态规划 - 难度：简单 ## 题目链接 -- [剑指 Offer 10- I. 斐波那契数列 - 力扣](https://leetcode.cn/problems/fei-bo-na-qi-shu-lie-lcof/) +- [LCR 126. 斐波那契数 - 力扣](https://leetcode.cn/problems/fei-bo-na-qi-shu-lie-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 112. \346\234\200\351\225\277\351\200\222\345\242\236\350\267\257\345\276\204.md" b/docs/solutions/LCR/fpTFWP.md similarity index 92% rename from "Solutions/\345\211\221\346\214\207 Offer II 112. \346\234\200\351\225\277\351\200\222\345\242\236\350\267\257\345\276\204.md" rename to docs/solutions/LCR/fpTFWP.md index 35d4a239..ecf927f6 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 112. \346\234\200\351\225\277\351\200\222\345\242\236\350\267\257\345\276\204.md" +++ b/docs/solutions/LCR/fpTFWP.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 112. 最长递增路径](https://leetcode.cn/problems/fpTFWP/) +# [LCR 112. 矩阵中的最长递增路径](https://leetcode.cn/problems/fpTFWP/) - 标签：深度优先搜索、广度优先搜索、图、拓扑排序、记忆化搜索、数组、动态规划、矩阵 - 难度：困难 ## 题目链接 -- [剑指 Offer II 112. 最长递增路径 - 力扣](https://leetcode.cn/problems/fpTFWP/) +- [LCR 112. 矩阵中的最长递增路径 - 力扣](https://leetcode.cn/problems/fpTFWP/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 35. \345\244\215\346\235\202\351\223\276\350\241\250\347\232\204\345\244\215\345\210\266.md" b/docs/solutions/LCR/fu-za-lian-biao-de-fu-zhi-lcof.md similarity index 83% rename from "Solutions/\345\211\221\346\214\207 Offer 35. \345\244\215\346\235\202\351\223\276\350\241\250\347\232\204\345\244\215\345\210\266.md" rename to docs/solutions/LCR/fu-za-lian-biao-de-fu-zhi-lcof.md index ef55af6b..f1496a06 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 35. \345\244\215\346\235\202\351\223\276\350\241\250\347\232\204\345\244\215\345\210\266.md" +++ b/docs/solutions/LCR/fu-za-lian-biao-de-fu-zhi-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 35. 复杂链表的复制](https://leetcode.cn/problems/fu-za-lian-biao-de-fu-zhi-lcof/) +# [LCR 154. 复杂链表的复制](https://leetcode.cn/problems/fu-za-lian-biao-de-fu-zhi-lcof/) - 标签：哈希表、链表 - 难度：中等 ## 题目链接 -- [剑指 Offer 35. 复杂链表的复制 - 力扣](https://leetcode.cn/problems/fu-za-lian-biao-de-fu-zhi-lcof/) +- [LCR 154. 复杂链表的复制 - 力扣](https://leetcode.cn/problems/fu-za-lian-biao-de-fu-zhi-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 060. \345\207\272\347\216\260\351\242\221\347\216\207\346\234\200\351\253\230\347\232\204 k \344\270\252\346\225\260\345\255\227.md" b/docs/solutions/LCR/g5c51o.md similarity index 94% rename from "Solutions/\345\211\221\346\214\207 Offer II 060. \345\207\272\347\216\260\351\242\221\347\216\207\346\234\200\351\253\230\347\232\204 k \344\270\252\346\225\260\345\255\227.md" rename to docs/solutions/LCR/g5c51o.md index 912ee21b..e4190d6b 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 060. \345\207\272\347\216\260\351\242\221\347\216\207\346\234\200\351\253\230\347\232\204 k \344\270\252\346\225\260\345\255\227.md" +++ b/docs/solutions/LCR/g5c51o.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 060. 出现频率最高的 k 个数字](https://leetcode.cn/problems/g5c51o/) +# [LCR 060. 前 K 个高频元素](https://leetcode.cn/problems/g5c51o/) - 标签：数组、哈希表、分治、桶排序、计数、快速选择、排序、堆（优先队列） - 难度：中等 ## 题目链接 -- [剑指 Offer II 060. 出现频率最高的 k 个数字 - 力扣](https://leetcode.cn/problems/g5c51o/) +- [LCR 060. 前 K 个高频元素 - 力扣](https://leetcode.cn/problems/g5c51o/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 103. \346\234\200\345\260\221\347\232\204\347\241\254\345\270\201\346\225\260\347\233\256.md" b/docs/solutions/LCR/gaM7Ch.md similarity index 88% rename from "Solutions/\345\211\221\346\214\207 Offer II 103. \346\234\200\345\260\221\347\232\204\347\241\254\345\270\201\346\225\260\347\233\256.md" rename to docs/solutions/LCR/gaM7Ch.md index ffc1db51..b9c93915 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 103. \346\234\200\345\260\221\347\232\204\347\241\254\345\270\201\346\225\260\347\233\256.md" +++ b/docs/solutions/LCR/gaM7Ch.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 103. 最少的硬币数目](https://leetcode.cn/problems/gaM7Ch/) +# [LCR 103. 零钱兑换](https://leetcode.cn/problems/gaM7Ch/) - 标签：广度优先搜索、数组、动态规划 - 难度：中等 ## 题目链接 -- [剑指 Offer II 103. 最少的硬币数目 - 力扣](https://leetcode.cn/problems/gaM7Ch/) +- [LCR 103. 零钱兑换 - 力扣](https://leetcode.cn/problems/gaM7Ch/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 66. \346\236\204\345\273\272\344\271\230\347\247\257\346\225\260\347\273\204.md" b/docs/solutions/LCR/gou-jian-cheng-ji-shu-zu-lcof.md similarity index 82% rename from "Solutions/\345\211\221\346\214\207 Offer 66. \346\236\204\345\273\272\344\271\230\347\247\257\346\225\260\347\273\204.md" rename to docs/solutions/LCR/gou-jian-cheng-ji-shu-zu-lcof.md index 6d839c22..e629feba 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 66. \346\236\204\345\273\272\344\271\230\347\247\257\346\225\260\347\273\204.md" +++ b/docs/solutions/LCR/gou-jian-cheng-ji-shu-zu-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 66. 构建乘积数组](https://leetcode.cn/problems/gou-jian-cheng-ji-shu-zu-lcof/) +# [LCR 191. 按规则计算统计结果](https://leetcode.cn/problems/gou-jian-cheng-ji-shu-zu-lcof/) - 标签：数组、前缀和 - 难度：中等 ## 题目链接 -- [剑指 Offer 66. 构建乘积数组 - 力扣](https://leetcode.cn/problems/gou-jian-cheng-ji-shu-zu-lcof/) +- [LCR 191. 按规则计算统计结果 - 力扣](https://leetcode.cn/problems/gou-jian-cheng-ji-shu-zu-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 63. \350\202\241\347\245\250\347\232\204\346\234\200\345\244\247\345\210\251\346\266\246.md" b/docs/solutions/LCR/gu-piao-de-zui-da-li-run-lcof.md similarity index 84% rename from "Solutions/\345\211\221\346\214\207 Offer 63. \350\202\241\347\245\250\347\232\204\346\234\200\345\244\247\345\210\251\346\266\246.md" rename to docs/solutions/LCR/gu-piao-de-zui-da-li-run-lcof.md index 97f92a17..7096700a 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 63. \350\202\241\347\245\250\347\232\204\346\234\200\345\244\247\345\210\251\346\266\246.md" +++ b/docs/solutions/LCR/gu-piao-de-zui-da-li-run-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 63. 股票的最大利润](https://leetcode.cn/problems/gu-piao-de-zui-da-li-run-lcof/) +# [LCR 188. 买卖芯片的最佳时机](https://leetcode.cn/problems/gu-piao-de-zui-da-li-run-lcof/) - 标签：数组、动态规划 - 难度：中等 ## 题目链接 -- [剑指 Offer 63. 股票的最大利润 - 力扣](https://leetcode.cn/problems/gu-piao-de-zui-da-li-run-lcof/) +- [LCR 188. 买卖芯片的最佳时机 - 力扣](https://leetcode.cn/problems/gu-piao-de-zui-da-li-run-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 048. \345\272\217\345\210\227\345\214\226\344\270\216\345\217\215\345\272\217\345\210\227\345\214\226\344\272\214\345\217\211\346\240\221.md" b/docs/solutions/LCR/h54YBf.md similarity index 91% rename from "Solutions/\345\211\221\346\214\207 Offer II 048. \345\272\217\345\210\227\345\214\226\344\270\216\345\217\215\345\272\217\345\210\227\345\214\226\344\272\214\345\217\211\346\240\221.md" rename to docs/solutions/LCR/h54YBf.md index 340cfc9c..81884f52 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 048. \345\272\217\345\210\227\345\214\226\344\270\216\345\217\215\345\272\217\345\210\227\345\214\226\344\272\214\345\217\211\346\240\221.md" +++ b/docs/solutions/LCR/h54YBf.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 048. 序列化与反序列化二叉树](https://leetcode.cn/problems/h54YBf/) +# [LCR 048. 二叉树的序列化与反序列化](https://leetcode.cn/problems/h54YBf/) - 标签：树、深度优先搜索、广度优先搜索、设计、字符串、二叉树 - 难度：困难 ## 题目链接 -- [剑指 Offer II 048. 序列化与反序列化二叉树 - 力扣](https://leetcode.cn/problems/h54YBf/) +- [LCR 048. 二叉树的序列化与反序列化 - 力扣](https://leetcode.cn/problems/h54YBf/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 044. \344\272\214\345\217\211\346\240\221\346\257\217\345\261\202\347\232\204\346\234\200\345\244\247\345\200\274.md" b/docs/solutions/LCR/hPov7L.md similarity index 85% rename from "Solutions/\345\211\221\346\214\207 Offer II 044. \344\272\214\345\217\211\346\240\221\346\257\217\345\261\202\347\232\204\346\234\200\345\244\247\345\200\274.md" rename to docs/solutions/LCR/hPov7L.md index 785351a4..9f7f4b47 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 044. \344\272\214\345\217\211\346\240\221\346\257\217\345\261\202\347\232\204\346\234\200\345\244\247\345\200\274.md" +++ b/docs/solutions/LCR/hPov7L.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 044. 二叉树每层的最大值](https://leetcode.cn/problems/hPov7L/) +# [LCR 044. 在每个树行中找最大值](https://leetcode.cn/problems/hPov7L/) - 标签：树、深度优先搜索、广度优先搜索、二叉树 - 难度：中等 ## 题目链接 -- [剑指 Offer II 044. 二叉树每层的最大值 - 力扣](https://leetcode.cn/problems/hPov7L/) +- [LCR 044. 在每个树行中找最大值 - 力扣](https://leetcode.cn/problems/hPov7L/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 25. \345\220\210\345\271\266\344\270\244\344\270\252\346\216\222\345\272\217\347\232\204\351\223\276\350\241\250.md" b/docs/solutions/LCR/he-bing-liang-ge-pai-xu-de-lian-biao-lcof.md similarity index 83% rename from "Solutions/\345\211\221\346\214\207 Offer 25. \345\220\210\345\271\266\344\270\244\344\270\252\346\216\222\345\272\217\347\232\204\351\223\276\350\241\250.md" rename to docs/solutions/LCR/he-bing-liang-ge-pai-xu-de-lian-biao-lcof.md index a54aa02c..714c4c54 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 25. \345\220\210\345\271\266\344\270\244\344\270\252\346\216\222\345\272\217\347\232\204\351\223\276\350\241\250.md" +++ b/docs/solutions/LCR/he-bing-liang-ge-pai-xu-de-lian-biao-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 25. 合并两个排序的链表](https://leetcode.cn/problems/he-bing-liang-ge-pai-xu-de-lian-biao-lcof/) +# [LCR 142. 训练计划 IV](https://leetcode.cn/problems/he-bing-liang-ge-pai-xu-de-lian-biao-lcof/) - 标签：递归、链表 - 难度：简单 ## 题目链接 -- [剑指 Offer 25. 合并两个排序的链表 - 力扣](https://leetcode.cn/problems/he-bing-liang-ge-pai-xu-de-lian-biao-lcof/) +- [LCR 142. 训练计划 IV - 力扣](https://leetcode.cn/problems/he-bing-liang-ge-pai-xu-de-lian-biao-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 57 - II. \345\222\214\344\270\272s\347\232\204\350\277\236\347\273\255\346\255\243\346\225\260\345\272\217\345\210\227.md" b/docs/solutions/LCR/he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof.md similarity index 93% rename from "Solutions/\345\211\221\346\214\207 Offer 57 - II. \345\222\214\344\270\272s\347\232\204\350\277\236\347\273\255\346\255\243\346\225\260\345\272\217\345\210\227.md" rename to docs/solutions/LCR/he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof.md index a3c66f73..64e0883c 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 57 - II. \345\222\214\344\270\272s\347\232\204\350\277\236\347\273\255\346\255\243\346\225\260\345\272\217\345\210\227.md" +++ b/docs/solutions/LCR/he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 57 - II. 和为s的连续正数序列](https://leetcode.cn/problems/he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof/) +# [LCR 180. 文件组合](https://leetcode.cn/problems/he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof/) - 标签：数学、双指针、枚举 - 难度：简单 ## 题目链接 -- [剑指 Offer 57 - II. 和为s的连续正数序列 - 力扣](https://leetcode.cn/problems/he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof/) +- [LCR 180. 文件组合 - 力扣](https://leetcode.cn/problems/he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 57. \345\222\214\344\270\272s\347\232\204\344\270\244\344\270\252\346\225\260\345\255\227.md" b/docs/solutions/LCR/he-wei-sde-liang-ge-shu-zi-lcof.md similarity index 80% rename from "Solutions/\345\211\221\346\214\207 Offer 57. \345\222\214\344\270\272s\347\232\204\344\270\244\344\270\252\346\225\260\345\255\227.md" rename to docs/solutions/LCR/he-wei-sde-liang-ge-shu-zi-lcof.md index 343753fa..40168787 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 57. \345\222\214\344\270\272s\347\232\204\344\270\244\344\270\252\346\225\260\345\255\227.md" +++ b/docs/solutions/LCR/he-wei-sde-liang-ge-shu-zi-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 57. 和为s的两个数字](https://leetcode.cn/problems/he-wei-sde-liang-ge-shu-zi-lcof/) +# [LCR 179. 查找总价格为目标值的两个商品](https://leetcode.cn/problems/he-wei-sde-liang-ge-shu-zi-lcof/) - 标签：数组、双指针、二分查找 - 难度：简单 ## 题目链接 -- [剑指 Offer 57. 和为s的两个数字 - 力扣](https://leetcode.cn/problems/he-wei-sde-liang-ge-shu-zi-lcof/) +- [LCR 179. 查找总价格为目标值的两个商品 - 力扣](https://leetcode.cn/problems/he-wei-sde-liang-ge-shu-zi-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 59 - I. \346\273\221\345\212\250\347\252\227\345\217\243\347\232\204\346\234\200\345\244\247\345\200\274.md" b/docs/solutions/LCR/hua-dong-chuang-kou-de-zui-da-zhi-lcof.md similarity index 86% rename from "Solutions/\345\211\221\346\214\207 Offer 59 - I. \346\273\221\345\212\250\347\252\227\345\217\243\347\232\204\346\234\200\345\244\247\345\200\274.md" rename to docs/solutions/LCR/hua-dong-chuang-kou-de-zui-da-zhi-lcof.md index 97e29981..2bb4be17 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 59 - I. \346\273\221\345\212\250\347\252\227\345\217\243\347\232\204\346\234\200\345\244\247\345\200\274.md" +++ b/docs/solutions/LCR/hua-dong-chuang-kou-de-zui-da-zhi-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 59 - I. 滑动窗口的最大值](https://leetcode.cn/problems/hua-dong-chuang-kou-de-zui-da-zhi-lcof/) +# [LCR 183. 望远镜中最高的海拔](https://leetcode.cn/problems/hua-dong-chuang-kou-de-zui-da-zhi-lcof/) - 标签：队列、滑动窗口、单调队列、堆（优先队列） - 难度：困难 ## 题目链接 -- [剑指 Offer 59 - I. 滑动窗口的最大值 - 力扣](https://leetcode.cn/problems/hua-dong-chuang-kou-de-zui-da-zhi-lcof/) +- [LCR 183. 望远镜中最高的海拔 - 力扣](https://leetcode.cn/problems/hua-dong-chuang-kou-de-zui-da-zhi-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 038. \346\257\217\346\227\245\346\270\251\345\272\246.md" b/docs/solutions/LCR/iIQa4I.md similarity index 91% rename from "Solutions/\345\211\221\346\214\207 Offer II 038. \346\257\217\346\227\245\346\270\251\345\272\246.md" rename to docs/solutions/LCR/iIQa4I.md index 787656a7..af440845 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 038. \346\257\217\346\227\245\346\270\251\345\272\246.md" +++ b/docs/solutions/LCR/iIQa4I.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 038. 每日温度](https://leetcode.cn/problems/iIQa4I/) +# [LCR 038. 每日温度](https://leetcode.cn/problems/iIQa4I/) - 标签：栈、数组、单调栈 - 难度：中等 ## 题目链接 -- [剑指 Offer II 038. 每日温度 - 力扣](https://leetcode.cn/problems/iIQa4I/) +- [LCR 038. 每日温度 - 力扣](https://leetcode.cn/problems/iIQa4I/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 065. \346\234\200\347\237\255\347\232\204\345\215\225\350\257\215\347\274\226\347\240\201.md" b/docs/solutions/LCR/iSwD2y.md similarity index 92% rename from "Solutions/\345\211\221\346\214\207 Offer II 065. \346\234\200\347\237\255\347\232\204\345\215\225\350\257\215\347\274\226\347\240\201.md" rename to docs/solutions/LCR/iSwD2y.md index 2cee65bf..7f2670ef 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 065. \346\234\200\347\237\255\347\232\204\345\215\225\350\257\215\347\274\226\347\240\201.md" +++ b/docs/solutions/LCR/iSwD2y.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 065. 最短的单词编码](https://leetcode.cn/problems/iSwD2y/) +# [LCR 065. 单词的压缩编码](https://leetcode.cn/problems/iSwD2y/) - 标签：字典树、数组、哈希表、字符串 - 难度：中等 ## 题目链接 -- [剑指 Offer II 065. 最短的单词编码 - 力扣](https://leetcode.cn/problems/iSwD2y/) +- [LCR 065. 单词的压缩编码 - 力扣](https://leetcode.cn/problems/iSwD2y/) ## 题目大意 diff --git a/docs/solutions/LCR/index.md b/docs/solutions/LCR/index.md new file mode 100644 index 00000000..0abc9de6 --- /dev/null +++ b/docs/solutions/LCR/index.md @@ -0,0 +1,172 @@ +## 本章内容 + +- [LCR 001. 两数相除](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/xoh6Oh.md) +- [LCR 002. 二进制求和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/JFETK5.md) +- [LCR 003. 比特位计数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/w3tCBm.md) +- [LCR 004. 只出现一次的数字 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/WGki4K.md) +- [LCR 005. 最大单词长度乘积](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/aseY1I.md) +- [LCR 006. 两数之和 II - 输入有序数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/kLl5u1.md) +- [LCR 007. 三数之和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/1fGaJU.md) +- [LCR 008. 长度最小的子数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/2VG8Kg.md) +- [LCR 009. 乘积小于 K 的子数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/ZVAVXX.md) +- [LCR 010. 和为 K 的子数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/QTMn0o.md) +- [LCR 011. 连续数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/A1NYOS.md) +- [LCR 012. 寻找数组的中心下标](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/tvdfij.md) +- [LCR 013. 二维区域和检索 - 矩阵不可变](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/O4NDxx.md) +- [LCR 016. 无重复字符的最长子串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/wtcaE1.md) +- [LCR 017. 最小覆盖子串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/M1oyTv.md) +- [LCR 018. 验证回文串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/XltzEq.md) +- [LCR 019. 验证回文串 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/RQku0D.md) +- [LCR 020. 回文子串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/a7VOhD.md) +- [LCR 021. 删除链表的倒数第 N 个结点](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/SLwz0R.md) +- [LCR 022. 环形链表 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/c32eOV.md) +- [LCR 023. 相交链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/3u1WK4.md) +- [LCR 024. 反转链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/UHnkqh.md) +- [LCR 025. 两数相加 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/lMSNwu.md) +- [LCR 026. 重排链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/LGjMqU.md) +- [LCR 027. 回文链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/aMhZSa.md) +- [LCR 028. 扁平化多级双向链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/Qv1Da2.md) +- [LCR 029. 循环有序列表的插入](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/4ueAj6.md) +- [LCR 030. O(1) 时间插入、删除和获取随机元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/FortPu.md) +- [LCR 031. LRU 缓存](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/OrIXps.md) +- [LCR 032. 有效的字母异位词](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/dKk3P7.md) +- [LCR 033. 字母异位词分组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/sfvd7V.md) +- [LCR 034. 验证外星语词典](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/lwyVBB.md) +- [LCR 035. 最小时间差](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/569nqc.md) +- [LCR 036. 逆波兰表达式求值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/8Zf90G.md) +- [LCR 037. 行星碰撞](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/XagZNi.md) +- [LCR 038. 每日温度](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/iIQa4I.md) +- [LCR 039. 柱状图中最大的矩形](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/0ynMMM.md) +- [LCR 041. 数据流中的移动平均值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/qIsx9U.md) +- [LCR 042. 最近的请求次数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/H8086Q.md) +- [LCR 043. 完全二叉树插入器](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/NaqhDT.md) +- [LCR 044. 在每个树行中找最大值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/hPov7L.md) +- [LCR 045. 找树左下角的值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/LwUNpT.md) +- [LCR 046. 二叉树的右视图](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/WNC0Lk.md) +- [LCR 047. 二叉树剪枝](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/pOCWxh.md) +- [LCR 048. 二叉树的序列化与反序列化](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/h54YBf.md) +- [LCR 049. 求根节点到叶节点数字之和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/3Etpl5.md) +- [LCR 050. 路径总和 III](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/6eUYwP.md) +- [LCR 051. 二叉树中的最大路径和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/jC7MId.md) +- [LCR 052. 递增顺序搜索树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/NYBBNL.md) +- [LCR 053. 二叉搜索树中的中序后继](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/P5rCT8.md) +- [LCR 054. 把二叉搜索树转换为累加树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/w6cpku.md) +- [LCR 055. 二叉搜索树迭代器](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/kTOapQ.md) +- [LCR 056. 两数之和 IV - 输入二叉搜索树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/opLdQZ.md) +- [LCR 057. 存在重复元素 III](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/7WqeDu.md) +- [LCR 059. 数据流中的第 K 大元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/jBjn9C.md) +- [LCR 060. 前 K 个高频元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/g5c51o.md) +- [LCR 062. 实现 Trie (前缀树)](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/QC3q1f.md) +- [LCR 063. 单词替换](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/UhWRSj.md) +- [LCR 064. 实现一个魔法字典](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/US1pGT.md) +- [LCR 065. 单词的压缩编码](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/iSwD2y.md) +- [LCR 066. 键值映射](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/z1R5dt.md) +- [LCR 067. 数组中两个数的最大异或值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/ms70jA.md) +- [LCR 068. 搜索插入位置](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/N6YdxV.md) +- [LCR 072. x 的平方根](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/jJ0w9p.md) +- [LCR 073. 爱吃香蕉的狒狒](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/nZZqjQ.md) +- [LCR 074. 合并区间](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/SsGoHC.md) +- [LCR 075. 数组的相对排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/0H97ZC.md) +- [LCR 076. 数组中的第 K 个最大元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/xx4gT2.md) +- [LCR 077. 排序链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/7WHec2.md) +- [LCR 078. 合并 K 个升序链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/vvXgSW.md) +- [LCR 079. 子集](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/TVdhkn.md) +- [LCR 080. 组合](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/uUsW3B.md) +- [LCR 081. 组合总和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/Ygoe9J.md) +- [LCR 082. 组合总和 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/4sjJUc.md) +- [LCR 083. 全排列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/VvJkup.md) +- [LCR 084. 全排列 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/7p8L0Z.md) +- [LCR 085. 括号生成](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/IDBivT.md) +- [LCR 086. 分割回文串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/M99OJA.md) +- [LCR 087. 复原 IP 地址](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/0on3uN.md) +- [LCR 088. 使用最小花费爬楼梯](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/GzCJIP.md) +- [LCR 089. 打家劫舍](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/Gu0c2T.md) +- [LCR 090. 打家劫舍 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/PzWKhm.md) +- [LCR 093. 最长的斐波那契子序列的长度](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/Q91FMA.md) +- [LCR 095. 最长公共子序列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/qJnOS7.md) +- [LCR 097. 不同的子序列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/21dk04.md) +- [LCR 098. 不同路径](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/2AoeFn.md) +- [LCR 101. 分割等和子集](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/NUPfPr.md) +- [LCR 102. 目标和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/YaVDxD.md) +- [LCR 103. 零钱兑换](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/gaM7Ch.md) +- [LCR 104. 组合总和 Ⅳ](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/D0F0SV.md) +- [LCR 105. 岛屿的最大面积](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/ZL6zAn.md) +- [LCR 106. 判断二分图](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/vEAB3K.md) +- [LCR 107. 01 矩阵](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/2bCMpM.md) +- [LCR 108. 单词接龙](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/om3reC.md) +- [LCR 109. 打开转盘锁](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/zlDJc7.md) +- [LCR 111. 除法求值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/vlzXQL.md) +- [LCR 112. 矩阵中的最长递增路径](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/fpTFWP.md) +- [LCR 113. 课程表 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/QA2IGt.md) +- [LCR 116. 省份数量](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/bLyHh0.md) +- [LCR 118. 冗余连接](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/7LpjUW.md) +- [LCR 119. 最长连续序列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/WhsWhI.md) +- [LCR 120. 寻找文件副本](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/shu-zu-zhong-zhong-fu-de-shu-zi-lcof.md) +- [LCR 121. 寻找目标值 - 二维数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/er-wei-shu-zu-zhong-de-cha-zhao-lcof.md) +- [LCR 122. 路径加密](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/ti-huan-kong-ge-lcof.md) +- [LCR 123. 图书整理 I](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/cong-wei-dao-tou-da-yin-lian-biao-lcof.md) +- [LCR 124. 推理二叉树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/zhong-jian-er-cha-shu-lcof.md) +- [LCR 125. 图书整理 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/yong-liang-ge-zhan-shi-xian-dui-lie-lcof.md) +- [LCR 126. 斐波那契数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/fei-bo-na-qi-shu-lie-lcof.md) +- [LCR 127. 跳跃训练](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/qing-wa-tiao-tai-jie-wen-ti-lcof.md) +- [LCR 128. 库存管理 I](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof.md) +- [LCR 129. 字母迷宫](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/ju-zhen-zhong-de-lu-jing-lcof.md) +- [LCR 130. 衣橱整理](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/ji-qi-ren-de-yun-dong-fan-wei-lcof.md) +- [LCR 131. 砍竹子 I](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/jian-sheng-zi-lcof.md) +- [LCR 133. 位 1 的个数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/er-jin-zhi-zhong-1de-ge-shu-lcof.md) +- [LCR 134. Pow(x, n)](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/shu-zhi-de-zheng-shu-ci-fang-lcof.md) +- [LCR 135. 报数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/da-yin-cong-1dao-zui-da-de-nwei-shu-lcof.md) +- [LCR 136. 删除链表的节点](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/shan-chu-lian-biao-de-jie-dian-lcof.md) +- [LCR 139. 训练计划 I](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof.md) +- [LCR 140. 训练计划 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof.md) +- [LCR 141. 训练计划 III](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/fan-zhuan-lian-biao-lcof.md) +- [LCR 142. 训练计划 IV](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/he-bing-liang-ge-pai-xu-de-lian-biao-lcof.md) +- [LCR 143. 子结构判断](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/shu-de-zi-jie-gou-lcof.md) +- [LCR 144. 翻转二叉树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/er-cha-shu-de-jing-xiang-lcof.md) +- [LCR 145. 判断对称二叉树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/dui-cheng-de-er-cha-shu-lcof.md) +- [LCR 146. 螺旋遍历二维数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/shun-shi-zhen-da-yin-ju-zhen-lcof.md) +- [LCR 147. 最小栈](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/bao-han-minhan-shu-de-zhan-lcof.md) +- [LCR 148. 验证图书取出顺序](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/zhan-de-ya-ru-dan-chu-xu-lie-lcof.md) +- [LCR 149. 彩灯装饰记录 I](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/cong-shang-dao-xia-da-yin-er-cha-shu-lcof.md) +- [LCR 150. 彩灯装饰记录 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof.md) +- [LCR 151. 彩灯装饰记录 III](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof.md) +- [LCR 152. 验证二叉搜索树的后序遍历序列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof.md) +- [LCR 153. 二叉树中和为目标值的路径](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof.md) +- [LCR 154. 复杂链表的复制](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/fu-za-lian-biao-de-fu-zhi-lcof.md) +- [LCR 155. 将二叉搜索树转化为排序的双向链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof.md) +- [LCR 156. 序列化与反序列化二叉树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/xu-lie-hua-er-cha-shu-lcof.md) +- [LCR 157. 套餐内商品的排列顺序](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/zi-fu-chuan-de-pai-lie-lcof.md) +- [LCR 158. 库存管理 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof.md) +- [LCR 159. 库存管理 III](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/zui-xiao-de-kge-shu-lcof.md) +- [LCR 160. 数据流中的中位数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/shu-ju-liu-zhong-de-zhong-wei-shu-lcof.md) +- [LCR 161. 连续天数的最高销售额](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/lian-xu-zi-shu-zu-de-zui-da-he-lcof.md) +- [LCR 163. 找到第 k 位数字](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof.md) +- [LCR 164. 破解闯关密码](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof.md) +- [LCR 165. 解密数字](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof.md) +- [LCR 166. 珠宝的最高价值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/li-wu-de-zui-da-jie-zhi-lcof.md) +- [LCR 167. 招式拆解 I](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof.md) +- [LCR 168. 丑数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/chou-shu-lcof.md) +- [LCR 169. 招式拆解 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof.md) +- [LCR 170. 交易逆序对的总数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/shu-zu-zhong-de-ni-xu-dui-lcof.md) +- [LCR 171. 训练计划 V](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof.md) +- [LCR 172. 统计目标成绩的出现次数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof.md) +- [LCR 173. 点名](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/que-shi-de-shu-zi-lcof.md) +- [LCR 174. 寻找二叉搜索树中的目标节点](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof.md) +- [LCR 175. 计算二叉树的深度](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/er-cha-shu-de-shen-du-lcof.md) +- [LCR 176. 判断是否为平衡二叉树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/ping-heng-er-cha-shu-lcof.md) +- [LCR 177. 撞色搭配](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof.md) +- [LCR 179. 查找总价格为目标值的两个商品](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/he-wei-sde-liang-ge-shu-zi-lcof.md) +- [LCR 180. 文件组合](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof.md) +- [LCR 181. 字符串中的单词反转](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/fan-zhuan-dan-ci-shun-xu-lcof.md) +- [LCR 182. 动态口令](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/zuo-xuan-zhuan-zi-fu-chuan-lcof.md) +- [LCR 183. 望远镜中最高的海拔](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/hua-dong-chuang-kou-de-zui-da-zhi-lcof.md) +- [LCR 184. 设计自助结算系统](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/dui-lie-de-zui-da-zhi-lcof.md) +- [LCR 186. 文物朝代判断](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/bu-ke-pai-zhong-de-shun-zi-lcof.md) +- [LCR 187. 破冰游戏](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof.md) +- [LCR 188. 买卖芯片的最佳时机](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/gu-piao-de-zui-da-li-run-lcof.md) +- [LCR 189. 设计机械累加器](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/qiu-12n-lcof.md) +- [LCR 190. 加密运算](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof.md) +- [LCR 191. 按规则计算统计结果](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/gou-jian-cheng-ji-shu-zu-lcof.md) +- [LCR 192. 把字符串转换成整数 (atoi)](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof.md) +- [LCR 193. 二叉搜索树的最近公共祖先](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof.md) +- [LCR 194. 二叉树的最近公共祖先](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof.md) diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 059. \346\225\260\346\215\256\346\265\201\347\232\204\347\254\254 K \345\244\247\346\225\260\345\200\274.md" b/docs/solutions/LCR/jBjn9C.md similarity index 88% rename from "Solutions/\345\211\221\346\214\207 Offer II 059. \346\225\260\346\215\256\346\265\201\347\232\204\347\254\254 K \345\244\247\346\225\260\345\200\274.md" rename to docs/solutions/LCR/jBjn9C.md index 1a3df66d..6b7ad2af 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 059. \346\225\260\346\215\256\346\265\201\347\232\204\347\254\254 K \345\244\247\346\225\260\345\200\274.md" +++ b/docs/solutions/LCR/jBjn9C.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 059. 数据流的第 K 大数值](https://leetcode.cn/problems/jBjn9C/) +# [LCR 059. 数据流中的第 K 大元素](https://leetcode.cn/problems/jBjn9C/) - 标签：树、设计、二叉搜索树、二叉树、数据流、堆（优先队列） - 难度：简单 ## 题目链接 -- [剑指 Offer II 059. 数据流的第 K 大数值 - 力扣](https://leetcode.cn/problems/jBjn9C/) +- [LCR 059. 数据流中的第 K 大元素 - 力扣](https://leetcode.cn/problems/jBjn9C/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 051. \350\212\202\347\202\271\344\271\213\345\222\214\346\234\200\345\244\247\347\232\204\350\267\257\345\276\204.md" b/docs/solutions/LCR/jC7MId.md similarity index 90% rename from "Solutions/\345\211\221\346\214\207 Offer II 051. \350\212\202\347\202\271\344\271\213\345\222\214\346\234\200\345\244\247\347\232\204\350\267\257\345\276\204.md" rename to docs/solutions/LCR/jC7MId.md index a64410b9..b8d6c92b 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 051. \350\212\202\347\202\271\344\271\213\345\222\214\346\234\200\345\244\247\347\232\204\350\267\257\345\276\204.md" +++ b/docs/solutions/LCR/jC7MId.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 051. 节点之和最大的路径](https://leetcode.cn/problems/jC7MId/) +# [LCR 051. 二叉树中的最大路径和](https://leetcode.cn/problems/jC7MId/) - 标签：树、深度优先搜索、动态规划、二叉树 - 难度：困难 ## 题目链接 -- [剑指 Offer II 051. 节点之和最大的路径 - 力扣](https://leetcode.cn/problems/jC7MId/) +- [LCR 051. 二叉树中的最大路径和 - 力扣](https://leetcode.cn/problems/jC7MId/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 072. \346\261\202\345\271\263\346\226\271\346\240\271.md" b/docs/solutions/LCR/jJ0w9p.md similarity index 83% rename from "Solutions/\345\211\221\346\214\207 Offer II 072. \346\261\202\345\271\263\346\226\271\346\240\271.md" rename to docs/solutions/LCR/jJ0w9p.md index bd51cebe..b0225cc5 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 072. \346\261\202\345\271\263\346\226\271\346\240\271.md" +++ b/docs/solutions/LCR/jJ0w9p.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 072. 求平方根](https://leetcode.cn/problems/jJ0w9p/) +# [LCR 072. x 的平方根](https://leetcode.cn/problems/jJ0w9p/) - 标签：数学、二分查找 - 难度：简单 ## 题目链接 -- [剑指 Offer II 072. 求平方根 - 力扣](https://leetcode.cn/problems/jJ0w9p/) +- [LCR 072. x 的平方根 - 力扣](https://leetcode.cn/problems/jJ0w9p/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 13. \346\234\272\345\231\250\344\272\272\347\232\204\350\277\220\345\212\250\350\214\203\345\233\264.md" b/docs/solutions/LCR/ji-qi-ren-de-yun-dong-fan-wei-lcof.md similarity index 90% rename from "Solutions/\345\211\221\346\214\207 Offer 13. \346\234\272\345\231\250\344\272\272\347\232\204\350\277\220\345\212\250\350\214\203\345\233\264.md" rename to docs/solutions/LCR/ji-qi-ren-de-yun-dong-fan-wei-lcof.md index af601050..e212e650 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 13. \346\234\272\345\231\250\344\272\272\347\232\204\350\277\220\345\212\250\350\214\203\345\233\264.md" +++ b/docs/solutions/LCR/ji-qi-ren-de-yun-dong-fan-wei-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 13. 机器人的运动范围](https://leetcode.cn/problems/ji-qi-ren-de-yun-dong-fan-wei-lcof/) +# [LCR 130. 衣橱整理](https://leetcode.cn/problems/ji-qi-ren-de-yun-dong-fan-wei-lcof/) - 标签：深度优先搜索、广度优先搜索、动态规划 - 难度：中等 ## 题目链接 -- [剑指 Offer 13. 机器人的运动范围 - 力扣](https://leetcode.cn/problems/ji-qi-ren-de-yun-dong-fan-wei-lcof/) +- [LCR 130. 衣橱整理 - 力扣](https://leetcode.cn/problems/ji-qi-ren-de-yun-dong-fan-wei-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 14- I. \345\211\252\347\273\263\345\255\220.md" b/docs/solutions/LCR/jian-sheng-zi-lcof.md similarity index 88% rename from "Solutions/\345\211\221\346\214\207 Offer 14- I. \345\211\252\347\273\263\345\255\220.md" rename to docs/solutions/LCR/jian-sheng-zi-lcof.md index 57db3edf..a32ed232 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 14- I. \345\211\252\347\273\263\345\255\220.md" +++ b/docs/solutions/LCR/jian-sheng-zi-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 14- I. 剪绳子](https://leetcode.cn/problems/jian-sheng-zi-lcof/) +# [LCR 131. 砍竹子 I](https://leetcode.cn/problems/jian-sheng-zi-lcof/) - 标签：数学、动态规划 - 难度：中等 ## 题目链接 -- [剑指 Offer 14- I. 剪绳子 - 力扣](https://leetcode.cn/problems/jian-sheng-zi-lcof/) +- [LCR 131. 砍竹子 I - 力扣](https://leetcode.cn/problems/jian-sheng-zi-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 12. \347\237\251\351\230\265\344\270\255\347\232\204\350\267\257\345\276\204.md" b/docs/solutions/LCR/ju-zhen-zhong-de-lu-jing-lcof.md similarity index 91% rename from "Solutions/\345\211\221\346\214\207 Offer 12. \347\237\251\351\230\265\344\270\255\347\232\204\350\267\257\345\276\204.md" rename to docs/solutions/LCR/ju-zhen-zhong-de-lu-jing-lcof.md index ed03a9a2..700ce2e8 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 12. \347\237\251\351\230\265\344\270\255\347\232\204\350\267\257\345\276\204.md" +++ b/docs/solutions/LCR/ju-zhen-zhong-de-lu-jing-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 12. 矩阵中的路径](https://leetcode.cn/problems/ju-zhen-zhong-de-lu-jing-lcof/) +# [LCR 129. 字母迷宫](https://leetcode.cn/problems/ju-zhen-zhong-de-lu-jing-lcof/) - 标签：数组、回溯、矩阵 - 难度：中等 ## 题目链接 -- [剑指 Offer 12. 矩阵中的路径 - 力扣](https://leetcode.cn/problems/ju-zhen-zhong-de-lu-jing-lcof/) +- [LCR 129. 字母迷宫 - 力扣](https://leetcode.cn/problems/ju-zhen-zhong-de-lu-jing-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 006. \346\216\222\345\272\217\346\225\260\347\273\204\344\270\255\344\270\244\344\270\252\346\225\260\345\255\227\344\271\213\345\222\214.md" b/docs/solutions/LCR/kLl5u1.md similarity index 87% rename from "Solutions/\345\211\221\346\214\207 Offer II 006. \346\216\222\345\272\217\346\225\260\347\273\204\344\270\255\344\270\244\344\270\252\346\225\260\345\255\227\344\271\213\345\222\214.md" rename to docs/solutions/LCR/kLl5u1.md index 80d48f88..c1e0844c 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 006. \346\216\222\345\272\217\346\225\260\347\273\204\344\270\255\344\270\244\344\270\252\346\225\260\345\255\227\344\271\213\345\222\214.md" +++ b/docs/solutions/LCR/kLl5u1.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 006. 排序数组中两个数字之和](https://leetcode.cn/problems/kLl5u1/) +# [LCR 006. 两数之和 II - 输入有序数组](https://leetcode.cn/problems/kLl5u1/) - 标签：数组、双指针、二分查找 - 难度：简单 ## 题目链接 -- [剑指 Offer II 006. 排序数组中两个数字之和 - 力扣](https://leetcode.cn/problems/kLl5u1/) +- [LCR 006. 两数之和 II - 输入有序数组 - 力扣](https://leetcode.cn/problems/kLl5u1/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 055. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\350\277\255\344\273\243\345\231\250.md" b/docs/solutions/LCR/kTOapQ.md similarity index 89% rename from "Solutions/\345\211\221\346\214\207 Offer II 055. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\350\277\255\344\273\243\345\231\250.md" rename to docs/solutions/LCR/kTOapQ.md index 576aa937..e15e1860 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 055. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\350\277\255\344\273\243\345\231\250.md" +++ b/docs/solutions/LCR/kTOapQ.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 055. 二叉搜索树迭代器](https://leetcode.cn/problems/kTOapQ/) +# [LCR 055. 二叉搜索树迭代器](https://leetcode.cn/problems/kTOapQ/) - 标签：栈、树、设计、二叉搜索树、二叉树、迭代器 - 难度：中等 ## 题目链接 -- [剑指 Offer II 055. 二叉搜索树迭代器 - 力扣](https://leetcode.cn/problems/kTOapQ/) +- [LCR 055. 二叉搜索树迭代器 - 力扣](https://leetcode.cn/problems/kTOapQ/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 025. \351\223\276\350\241\250\344\270\255\347\232\204\344\270\244\346\225\260\347\233\270\345\212\240.md" b/docs/solutions/LCR/lMSNwu.md similarity index 92% rename from "Solutions/\345\211\221\346\214\207 Offer II 025. \351\223\276\350\241\250\344\270\255\347\232\204\344\270\244\346\225\260\347\233\270\345\212\240.md" rename to docs/solutions/LCR/lMSNwu.md index 793aebd6..506ee06d 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 025. \351\223\276\350\241\250\344\270\255\347\232\204\344\270\244\346\225\260\347\233\270\345\212\240.md" +++ b/docs/solutions/LCR/lMSNwu.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 025. 链表中的两数相加](https://leetcode.cn/problems/lMSNwu/) +# [LCR 025. 两数相加 II](https://leetcode.cn/problems/lMSNwu/) - 标签：栈、链表、数学 - 难度：中等 ## 题目链接 -- [剑指 Offer II 025. 链表中的两数相加 - 力扣](https://leetcode.cn/problems/lMSNwu/) +- [LCR 025. 两数相加 II - 力扣](https://leetcode.cn/problems/lMSNwu/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 47. \347\244\274\347\211\251\347\232\204\346\234\200\345\244\247\344\273\267\345\200\274.md" b/docs/solutions/LCR/li-wu-de-zui-da-jie-zhi-lcof.md similarity index 85% rename from "Solutions/\345\211\221\346\214\207 Offer 47. \347\244\274\347\211\251\347\232\204\346\234\200\345\244\247\344\273\267\345\200\274.md" rename to docs/solutions/LCR/li-wu-de-zui-da-jie-zhi-lcof.md index 55c1488a..c0797148 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 47. \347\244\274\347\211\251\347\232\204\346\234\200\345\244\247\344\273\267\345\200\274.md" +++ b/docs/solutions/LCR/li-wu-de-zui-da-jie-zhi-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 47. 礼物的最大价值](https://leetcode.cn/problems/li-wu-de-zui-da-jie-zhi-lcof/) +# [LCR 166. 珠宝的最高价值](https://leetcode.cn/problems/li-wu-de-zui-da-jie-zhi-lcof/) - 标签：数组、动态规划、矩阵 - 难度：中等 ## 题目链接 -- [剑指 Offer 47. 礼物的最大价值 - 力扣](https://leetcode.cn/problems/li-wu-de-zui-da-jie-zhi-lcof/) +- [LCR 166. 珠宝的最高价值 - 力扣](https://leetcode.cn/problems/li-wu-de-zui-da-jie-zhi-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 22. \351\223\276\350\241\250\344\270\255\345\200\222\346\225\260\347\254\254k\344\270\252\350\212\202\347\202\271.md" b/docs/solutions/LCR/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof.md similarity index 79% rename from "Solutions/\345\211\221\346\214\207 Offer 22. \351\223\276\350\241\250\344\270\255\345\200\222\346\225\260\347\254\254k\344\270\252\350\212\202\347\202\271.md" rename to docs/solutions/LCR/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof.md index 1145bc38..575d1b0c 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 22. \351\223\276\350\241\250\344\270\255\345\200\222\346\225\260\347\254\254k\344\270\252\350\212\202\347\202\271.md" +++ b/docs/solutions/LCR/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 22. 链表中倒数第k个节点](https://leetcode.cn/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof/) +# [LCR 140. 训练计划 II](https://leetcode.cn/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof/) - 标签：链表、双指针 - 难度：简单 ## 题目链接 -- [剑指 Offer 22. 链表中倒数第k个节点 - 力扣](https://leetcode.cn/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof/) +- [LCR 140. 训练计划 II - 力扣](https://leetcode.cn/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 42. \350\277\236\347\273\255\345\255\220\346\225\260\347\273\204\347\232\204\346\234\200\345\244\247\345\222\214.md" b/docs/solutions/LCR/lian-xu-zi-shu-zu-de-zui-da-he-lcof.md similarity index 80% rename from "Solutions/\345\211\221\346\214\207 Offer 42. \350\277\236\347\273\255\345\255\220\346\225\260\347\273\204\347\232\204\346\234\200\345\244\247\345\222\214.md" rename to docs/solutions/LCR/lian-xu-zi-shu-zu-de-zui-da-he-lcof.md index ec253f48..61218216 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 42. \350\277\236\347\273\255\345\255\220\346\225\260\347\273\204\347\232\204\346\234\200\345\244\247\345\222\214.md" +++ b/docs/solutions/LCR/lian-xu-zi-shu-zu-de-zui-da-he-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 42. 连续子数组的最大和](https://leetcode.cn/problems/lian-xu-zi-shu-zu-de-zui-da-he-lcof/) +# [LCR 161. 连续天数的最高销售额](https://leetcode.cn/problems/lian-xu-zi-shu-zu-de-zui-da-he-lcof/) - 标签：数组、分治、动态规划 - 难度：简单 ## 题目链接 -- [剑指 Offer 42. 连续子数组的最大和 - 力扣](https://leetcode.cn/problems/lian-xu-zi-shu-zu-de-zui-da-he-lcof/) +- [LCR 161. 连续天数的最高销售额 - 力扣](https://leetcode.cn/problems/lian-xu-zi-shu-zu-de-zui-da-he-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 52. \344\270\244\344\270\252\351\223\276\350\241\250\347\232\204\347\254\254\344\270\200\344\270\252\345\205\254\345\205\261\350\212\202\347\202\271.md" b/docs/solutions/LCR/liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof.md similarity index 83% rename from "Solutions/\345\211\221\346\214\207 Offer 52. \344\270\244\344\270\252\351\223\276\350\241\250\347\232\204\347\254\254\344\270\200\344\270\252\345\205\254\345\205\261\350\212\202\347\202\271.md" rename to docs/solutions/LCR/liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof.md index b9311ee3..c4227218 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 52. \344\270\244\344\270\252\351\223\276\350\241\250\347\232\204\347\254\254\344\270\200\344\270\252\345\205\254\345\205\261\350\212\202\347\202\271.md" +++ b/docs/solutions/LCR/liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 52. 两个链表的第一个公共节点](https://leetcode.cn/problems/liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof/) +# [LCR 171. 训练计划 V](https://leetcode.cn/problems/liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof/) - 标签：哈希表、链表、双指针 - 难度：简单 ## 题目链接 -- [剑指 Offer 52. 两个链表的第一个公共节点 - 力扣](https://leetcode.cn/problems/liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof/) +- [LCR 171. 训练计划 V - 力扣](https://leetcode.cn/problems/liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 034. \345\244\226\346\230\237\350\257\255\350\250\200\346\230\257\345\220\246\346\216\222\345\272\217.md" b/docs/solutions/LCR/lwyVBB.md similarity index 90% rename from "Solutions/\345\211\221\346\214\207 Offer II 034. \345\244\226\346\230\237\350\257\255\350\250\200\346\230\257\345\220\246\346\216\222\345\272\217.md" rename to docs/solutions/LCR/lwyVBB.md index 2cebf50b..a4da5c53 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 034. \345\244\226\346\230\237\350\257\255\350\250\200\346\230\257\345\220\246\346\216\222\345\272\217.md" +++ b/docs/solutions/LCR/lwyVBB.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 034. 外星语言是否排序](https://leetcode.cn/problems/lwyVBB/) +# [LCR 034. 验证外星语词典](https://leetcode.cn/problems/lwyVBB/) - 标签：数组、哈希表、字符串 - 难度：简单 ## 题目链接 -- [剑指 Offer II 034. 外星语言是否排序 - 力扣](https://leetcode.cn/problems/lwyVBB/) +- [LCR 034. 验证外星语词典 - 力扣](https://leetcode.cn/problems/lwyVBB/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 067. \346\234\200\345\244\247\347\232\204\345\274\202\346\210\226.md" b/docs/solutions/LCR/ms70jA.md similarity index 94% rename from "Solutions/\345\211\221\346\214\207 Offer II 067. \346\234\200\345\244\247\347\232\204\345\274\202\346\210\226.md" rename to docs/solutions/LCR/ms70jA.md index 1d79787b..b5c1255d 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 067. \346\234\200\345\244\247\347\232\204\345\274\202\346\210\226.md" +++ b/docs/solutions/LCR/ms70jA.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 067. 最大的异或](https://leetcode.cn/problems/ms70jA/) +# [LCR 067. 数组中两个数的最大异或值](https://leetcode.cn/problems/ms70jA/) - 标签：位运算、字典树、数组、哈希表 - 难度：中等 ## 题目链接 -- [剑指 Offer II 067. 最大的异或 - 力扣](https://leetcode.cn/problems/ms70jA/) +- [LCR 067. 数组中两个数的最大异或值 - 力扣](https://leetcode.cn/problems/ms70jA/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 073. \347\213\222\347\213\222\345\220\203\351\246\231\350\225\211.md" b/docs/solutions/LCR/nZZqjQ.md similarity index 93% rename from "Solutions/\345\211\221\346\214\207 Offer II 073. \347\213\222\347\213\222\345\220\203\351\246\231\350\225\211.md" rename to docs/solutions/LCR/nZZqjQ.md index ae87abb7..e9d09e54 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 073. \347\213\222\347\213\222\345\220\203\351\246\231\350\225\211.md" +++ b/docs/solutions/LCR/nZZqjQ.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 073. 狒狒吃香蕉](https://leetcode.cn/problems/nZZqjQ/) +# [LCR 073. 爱吃香蕉的狒狒](https://leetcode.cn/problems/nZZqjQ/) - 标签：数组、二分查找 - 难度：中等 ## 题目链接 -- [剑指 Offer II 073. 狒狒吃香蕉 - 力扣](https://leetcode.cn/problems/nZZqjQ/) +- [LCR 073. 爱吃香蕉的狒狒 - 力扣](https://leetcode.cn/problems/nZZqjQ/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 108. \345\215\225\350\257\215\346\274\224\345\217\230.md" b/docs/solutions/LCR/om3reC.md similarity index 91% rename from "Solutions/\345\211\221\346\214\207 Offer II 108. \345\215\225\350\257\215\346\274\224\345\217\230.md" rename to docs/solutions/LCR/om3reC.md index 57dc3638..5500ac16 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 108. \345\215\225\350\257\215\346\274\224\345\217\230.md" +++ b/docs/solutions/LCR/om3reC.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 108. 单词演变](https://leetcode.cn/problems/om3reC/) +# [LCR 108. 单词接龙](https://leetcode.cn/problems/om3reC/) - 标签：广度优先搜索、哈希表、字符串 - 难度：困难 ## 题目链接 -- [剑指 Offer II 108. 单词演变 - 力扣](https://leetcode.cn/problems/om3reC/) +- [LCR 108. 单词接龙 - 力扣](https://leetcode.cn/problems/om3reC/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 056. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\344\270\255\344\270\244\344\270\252\350\212\202\347\202\271\344\271\213\345\222\214.md" b/docs/solutions/LCR/opLdQZ.md similarity index 88% rename from "Solutions/\345\211\221\346\214\207 Offer II 056. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\344\270\255\344\270\244\344\270\252\350\212\202\347\202\271\344\271\213\345\222\214.md" rename to docs/solutions/LCR/opLdQZ.md index 25511024..95443742 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 056. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\344\270\255\344\270\244\344\270\252\350\212\202\347\202\271\344\271\213\345\222\214.md" +++ b/docs/solutions/LCR/opLdQZ.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 056. 二叉搜索树中两个节点之和](https://leetcode.cn/problems/opLdQZ/) +# [LCR 056. 两数之和 IV - 输入二叉搜索树](https://leetcode.cn/problems/opLdQZ/) - 标签：树、深度优先搜索、广度优先搜索、二叉搜索树、哈希表、双指针、二叉树 - 难度：简单 ## 题目链接 -- [剑指 Offer II 056. 二叉搜索树中两个节点之和 - 力扣](https://leetcode.cn/problems/opLdQZ/) +- [LCR 056. 两数之和 IV - 输入二叉搜索树 - 力扣](https://leetcode.cn/problems/opLdQZ/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 047. \344\272\214\345\217\211\346\240\221\345\211\252\346\236\235.md" b/docs/solutions/LCR/pOCWxh.md similarity index 89% rename from "Solutions/\345\211\221\346\214\207 Offer II 047. \344\272\214\345\217\211\346\240\221\345\211\252\346\236\235.md" rename to docs/solutions/LCR/pOCWxh.md index 179a4c64..ad9714bd 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 047. \344\272\214\345\217\211\346\240\221\345\211\252\346\236\235.md" +++ b/docs/solutions/LCR/pOCWxh.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 047. 二叉树剪枝](https://leetcode.cn/problems/pOCWxh/) +# [LCR 047. 二叉树剪枝](https://leetcode.cn/problems/pOCWxh/) - 标签：树、深度优先搜索、二叉树 - 难度：中等 ## 题目链接 -- [剑指 Offer II 047. 二叉树剪枝 - 力扣](https://leetcode.cn/problems/pOCWxh/) +- [LCR 047. 二叉树剪枝 - 力扣](https://leetcode.cn/problems/pOCWxh/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 55 - II. \345\271\263\350\241\241\344\272\214\345\217\211\346\240\221.md" b/docs/solutions/LCR/ping-heng-er-cha-shu-lcof.md similarity index 84% rename from "Solutions/\345\211\221\346\214\207 Offer 55 - II. \345\271\263\350\241\241\344\272\214\345\217\211\346\240\221.md" rename to docs/solutions/LCR/ping-heng-er-cha-shu-lcof.md index ae199d28..006cfa56 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 55 - II. \345\271\263\350\241\241\344\272\214\345\217\211\346\240\221.md" +++ b/docs/solutions/LCR/ping-heng-er-cha-shu-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 55 - II. 平衡二叉树](https://leetcode.cn/problems/ping-heng-er-cha-shu-lcof/) +# [LCR 176. 判断是否为平衡二叉树](https://leetcode.cn/problems/ping-heng-er-cha-shu-lcof/) - 标签：树、深度优先搜索、二叉树 - 难度：简单 ## 题目链接 -- [剑指 Offer 55 - II. 平衡二叉树 - 力扣](https://leetcode.cn/problems/ping-heng-er-cha-shu-lcof/) +- [LCR 176. 判断是否为平衡二叉树 - 力扣](https://leetcode.cn/problems/ping-heng-er-cha-shu-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 041. \346\273\221\345\212\250\347\252\227\345\217\243\347\232\204\345\271\263\345\235\207\345\200\274.md" b/docs/solutions/LCR/qIsx9U.md similarity index 92% rename from "Solutions/\345\211\221\346\214\207 Offer II 041. \346\273\221\345\212\250\347\252\227\345\217\243\347\232\204\345\271\263\345\235\207\345\200\274.md" rename to docs/solutions/LCR/qIsx9U.md index ced7512d..a49080c3 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 041. \346\273\221\345\212\250\347\252\227\345\217\243\347\232\204\345\271\263\345\235\207\345\200\274.md" +++ b/docs/solutions/LCR/qIsx9U.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 041. 滑动窗口的平均值](https://leetcode.cn/problems/qIsx9U/) +# [LCR 041. 数据流中的移动平均值](https://leetcode.cn/problems/qIsx9U/) - 标签：设计、队列、数组、数据流 - 难度：简单 ## 题目链接 -- [剑指 Offer II 041. 滑动窗口的平均值 - 力扣](https://leetcode.cn/problems/qIsx9U/) +- [LCR 041. 数据流中的移动平均值 - 力扣](https://leetcode.cn/problems/qIsx9U/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 095. \346\234\200\351\225\277\345\205\254\345\205\261\345\255\220\345\272\217\345\210\227.md" b/docs/solutions/LCR/qJnOS7.md similarity index 91% rename from "Solutions/\345\211\221\346\214\207 Offer II 095. \346\234\200\351\225\277\345\205\254\345\205\261\345\255\220\345\272\217\345\210\227.md" rename to docs/solutions/LCR/qJnOS7.md index bee95db4..a447f25a 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 095. \346\234\200\351\225\277\345\205\254\345\205\261\345\255\220\345\272\217\345\210\227.md" +++ b/docs/solutions/LCR/qJnOS7.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 095. 最长公共子序列](https://leetcode.cn/problems/qJnOS7/) +# [LCR 095. 最长公共子序列](https://leetcode.cn/problems/qJnOS7/) - 标签：字符串、动态规划 - 难度：中等 ## 题目链接 -- [剑指 Offer II 095. 最长公共子序列 - 力扣](https://leetcode.cn/problems/qJnOS7/) +- [LCR 095. 最长公共子序列 - 力扣](https://leetcode.cn/problems/qJnOS7/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 10- II. \351\235\222\350\233\231\350\267\263\345\217\260\351\230\266\351\227\256\351\242\230.md" b/docs/solutions/LCR/qing-wa-tiao-tai-jie-wen-ti-lcof.md similarity index 81% rename from "Solutions/\345\211\221\346\214\207 Offer 10- II. \351\235\222\350\233\231\350\267\263\345\217\260\351\230\266\351\227\256\351\242\230.md" rename to docs/solutions/LCR/qing-wa-tiao-tai-jie-wen-ti-lcof.md index c1808ffb..6f261465 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 10- II. \351\235\222\350\233\231\350\267\263\345\217\260\351\230\266\351\227\256\351\242\230.md" +++ b/docs/solutions/LCR/qing-wa-tiao-tai-jie-wen-ti-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 10- II. 青蛙跳台阶问题](https://leetcode.cn/problems/qing-wa-tiao-tai-jie-wen-ti-lcof/) +# [LCR 127. 跳跃训练](https://leetcode.cn/problems/qing-wa-tiao-tai-jie-wen-ti-lcof/) - 标签：记忆化搜索、数学、动态规划 - 难度：简单 ## 题目链接 -- [剑指 Offer 10- II. 青蛙跳台阶问题 - 力扣](https://leetcode.cn/problems/qing-wa-tiao-tai-jie-wen-ti-lcof/) +- [LCR 127. 跳跃训练 - 力扣](https://leetcode.cn/problems/qing-wa-tiao-tai-jie-wen-ti-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 64. \346\261\2021+2+\342\200\246+n.md" b/docs/solutions/LCR/qiu-12n-lcof.md similarity index 77% rename from "Solutions/\345\211\221\346\214\207 Offer 64. \346\261\2021+2+\342\200\246+n.md" rename to docs/solutions/LCR/qiu-12n-lcof.md index 728ed3da..fa207a81 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 64. \346\261\2021+2+\342\200\246+n.md" +++ b/docs/solutions/LCR/qiu-12n-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 64. 求1+2+…+n](https://leetcode.cn/problems/qiu-12n-lcof/) +# [LCR 189. 设计机械累加器](https://leetcode.cn/problems/qiu-12n-lcof/) - 标签：位运算、递归、脑筋急转弯 - 难度：中等 ## 题目链接 -- [剑指 Offer 64. 求1+2+…+n - 力扣](https://leetcode.cn/problems/qiu-12n-lcof/) +- [LCR 189. 设计机械累加器 - 力扣](https://leetcode.cn/problems/qiu-12n-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 53 - II. 0\357\275\236n-1\344\270\255\347\274\272\345\244\261\347\232\204\346\225\260\345\255\227.md" b/docs/solutions/LCR/que-shi-de-shu-zi-lcof.md similarity index 82% rename from "Solutions/\345\211\221\346\214\207 Offer 53 - II. 0\357\275\236n-1\344\270\255\347\274\272\345\244\261\347\232\204\346\225\260\345\255\227.md" rename to docs/solutions/LCR/que-shi-de-shu-zi-lcof.md index 42349a71..4f0f8478 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 53 - II. 0\357\275\236n-1\344\270\255\347\274\272\345\244\261\347\232\204\346\225\260\345\255\227.md" +++ b/docs/solutions/LCR/que-shi-de-shu-zi-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 53 - II. 0～n-1中缺失的数字](https://leetcode.cn/problems/que-shi-de-shu-zi-lcof/) +# [LCR 173. 点名](https://leetcode.cn/problems/que-shi-de-shu-zi-lcof/) - 标签：位运算、数组、哈希表、数学、二分查找 - 难度：简单 ## 题目链接 -- [剑指 Offer 53 - II. 0～n-1中缺失的数字 - 力扣](https://leetcode.cn/problems/que-shi-de-shu-zi-lcof/) +- [LCR 173. 点名 - 力扣](https://leetcode.cn/problems/que-shi-de-shu-zi-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 033. \345\217\230\344\275\215\350\257\215\347\273\204.md" b/docs/solutions/LCR/sfvd7V.md similarity index 85% rename from "Solutions/\345\211\221\346\214\207 Offer II 033. \345\217\230\344\275\215\350\257\215\347\273\204.md" rename to docs/solutions/LCR/sfvd7V.md index dbe4c21e..8d0949b4 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 033. \345\217\230\344\275\215\350\257\215\347\273\204.md" +++ b/docs/solutions/LCR/sfvd7V.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 033. 变位词组](https://leetcode.cn/problems/sfvd7V/) +# [LCR 033. 字母异位词分组](https://leetcode.cn/problems/sfvd7V/) - 标签：数组、哈希表、字符串、排序 - 难度：中等 ## 题目链接 -- [剑指 Offer II 033. 变位词组 - 力扣](https://leetcode.cn/problems/sfvd7V/) +- [LCR 033. 字母异位词分组 - 力扣](https://leetcode.cn/problems/sfvd7V/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 18. \345\210\240\351\231\244\351\223\276\350\241\250\347\232\204\350\212\202\347\202\271.md" b/docs/solutions/LCR/shan-chu-lian-biao-de-jie-dian-lcof.md similarity index 83% rename from "Solutions/\345\211\221\346\214\207 Offer 18. \345\210\240\351\231\244\351\223\276\350\241\250\347\232\204\350\212\202\347\202\271.md" rename to docs/solutions/LCR/shan-chu-lian-biao-de-jie-dian-lcof.md index c5bcf1bf..908cd592 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 18. \345\210\240\351\231\244\351\223\276\350\241\250\347\232\204\350\212\202\347\202\271.md" +++ b/docs/solutions/LCR/shan-chu-lian-biao-de-jie-dian-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 18. 删除链表的节点](https://leetcode.cn/problems/shan-chu-lian-biao-de-jie-dian-lcof/) +# [LCR 136. 删除链表的节点](https://leetcode.cn/problems/shan-chu-lian-biao-de-jie-dian-lcof/) - 标签：链表 - 难度：简单 ## 题目链接 -- [剑指 Offer 18. 删除链表的节点 - 力扣](https://leetcode.cn/problems/shan-chu-lian-biao-de-jie-dian-lcof/) +- [LCR 136. 删除链表的节点 - 力扣](https://leetcode.cn/problems/shan-chu-lian-biao-de-jie-dian-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 26. \346\240\221\347\232\204\345\255\220\347\273\223\346\236\204.md" b/docs/solutions/LCR/shu-de-zi-jie-gou-lcof.md similarity index 90% rename from "Solutions/\345\211\221\346\214\207 Offer 26. \346\240\221\347\232\204\345\255\220\347\273\223\346\236\204.md" rename to docs/solutions/LCR/shu-de-zi-jie-gou-lcof.md index 0c8334e8..bd7c58da 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 26. \346\240\221\347\232\204\345\255\220\347\273\223\346\236\204.md" +++ b/docs/solutions/LCR/shu-de-zi-jie-gou-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 26. 树的子结构](https://leetcode.cn/problems/shu-de-zi-jie-gou-lcof/) +# [LCR 143. 子结构判断](https://leetcode.cn/problems/shu-de-zi-jie-gou-lcof/) - 标签：树、深度优先搜索、二叉树 - 难度：中等 ## 题目链接 -- [剑指 Offer 26. 树的子结构 - 力扣](https://leetcode.cn/problems/shu-de-zi-jie-gou-lcof/) +- [LCR 143. 子结构判断 - 力扣](https://leetcode.cn/problems/shu-de-zi-jie-gou-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 41. \346\225\260\346\215\256\346\265\201\344\270\255\347\232\204\344\270\255\344\275\215\346\225\260.md" b/docs/solutions/LCR/shu-ju-liu-zhong-de-zhong-wei-shu-lcof.md similarity index 89% rename from "Solutions/\345\211\221\346\214\207 Offer 41. \346\225\260\346\215\256\346\265\201\344\270\255\347\232\204\344\270\255\344\275\215\346\225\260.md" rename to docs/solutions/LCR/shu-ju-liu-zhong-de-zhong-wei-shu-lcof.md index 809280b4..cd20280b 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 41. \346\225\260\346\215\256\346\265\201\344\270\255\347\232\204\344\270\255\344\275\215\346\225\260.md" +++ b/docs/solutions/LCR/shu-ju-liu-zhong-de-zhong-wei-shu-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 41. 数据流中的中位数](https://leetcode.cn/problems/shu-ju-liu-zhong-de-zhong-wei-shu-lcof/) +# [LCR 160. 数据流中的中位数](https://leetcode.cn/problems/shu-ju-liu-zhong-de-zhong-wei-shu-lcof/) - 标签：设计、双指针、数据流、排序、堆（优先队列） - 难度：困难 ## 题目链接 -- [剑指 Offer 41. 数据流中的中位数 - 力扣](https://leetcode.cn/problems/shu-ju-liu-zhong-de-zhong-wei-shu-lcof/) +- [LCR 160. 数据流中的中位数 - 力扣](https://leetcode.cn/problems/shu-ju-liu-zhong-de-zhong-wei-shu-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 16. \346\225\260\345\200\274\347\232\204\346\225\264\346\225\260\346\254\241\346\226\271.md" b/docs/solutions/LCR/shu-zhi-de-zheng-shu-ci-fang-lcof.md similarity index 83% rename from "Solutions/\345\211\221\346\214\207 Offer 16. \346\225\260\345\200\274\347\232\204\346\225\264\346\225\260\346\254\241\346\226\271.md" rename to docs/solutions/LCR/shu-zhi-de-zheng-shu-ci-fang-lcof.md index c995e0f9..13fac5bf 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 16. \346\225\260\345\200\274\347\232\204\346\225\264\346\225\260\346\254\241\346\226\271.md" +++ b/docs/solutions/LCR/shu-zhi-de-zheng-shu-ci-fang-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 16. 数值的整数次方](https://leetcode.cn/problems/shu-zhi-de-zheng-shu-ci-fang-lcof/) +# [LCR 134. Pow(x, n)](https://leetcode.cn/problems/shu-zhi-de-zheng-shu-ci-fang-lcof/) - 标签：递归、数学 - 难度：中等 ## 题目链接 -- [剑指 Offer 16. 数值的整数次方 - 力扣](https://leetcode.cn/problems/shu-zhi-de-zheng-shu-ci-fang-lcof/) +- [LCR 134. Pow(x, n) - 力扣](https://leetcode.cn/problems/shu-zhi-de-zheng-shu-ci-fang-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 44. \346\225\260\345\255\227\345\272\217\345\210\227\344\270\255\346\237\220\344\270\200\344\275\215\347\232\204\346\225\260\345\255\227.md" b/docs/solutions/LCR/shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof.md similarity index 86% rename from "Solutions/\345\211\221\346\214\207 Offer 44. \346\225\260\345\255\227\345\272\217\345\210\227\344\270\255\346\237\220\344\270\200\344\275\215\347\232\204\346\225\260\345\255\227.md" rename to docs/solutions/LCR/shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof.md index 15e0ec34..2f33abb6 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 44. \346\225\260\345\255\227\345\272\217\345\210\227\344\270\255\346\237\220\344\270\200\344\275\215\347\232\204\346\225\260\345\255\227.md" +++ b/docs/solutions/LCR/shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 44. 数字序列中某一位的数字](https://leetcode.cn/problems/shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof/) +# [LCR 163. 找到第 k 位数字](https://leetcode.cn/problems/shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof/) - 标签：数学、二分查找 - 难度：中等 ## 题目链接 -- [剑指 Offer 44. 数字序列中某一位的数字 - 力扣](https://leetcode.cn/problems/shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof/) +- [LCR 163. 找到第 k 位数字 - 力扣](https://leetcode.cn/problems/shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 39. \346\225\260\347\273\204\344\270\255\345\207\272\347\216\260\346\254\241\346\225\260\350\266\205\350\277\207\344\270\200\345\215\212\347\232\204\346\225\260\345\255\227.md" b/docs/solutions/LCR/shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof.md similarity index 74% rename from "Solutions/\345\211\221\346\214\207 Offer 39. \346\225\260\347\273\204\344\270\255\345\207\272\347\216\260\346\254\241\346\225\260\350\266\205\350\277\207\344\270\200\345\215\212\347\232\204\346\225\260\345\255\227.md" rename to docs/solutions/LCR/shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof.md index 0fa6c543..eda53db6 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 39. \346\225\260\347\273\204\344\270\255\345\207\272\347\216\260\346\254\241\346\225\260\350\266\205\350\277\207\344\270\200\345\215\212\347\232\204\346\225\260\345\255\227.md" +++ b/docs/solutions/LCR/shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 39. 数组中出现次数超过一半的数字](https://leetcode.cn/problems/shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof/) +# [LCR 158. 库存管理 II](https://leetcode.cn/problems/shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof/) - 标签：数组、哈希表、分治、计数、排序 - 难度：简单 ## 题目链接 -- [剑指 Offer 39. 数组中出现次数超过一半的数字 - 力扣](https://leetcode.cn/problems/shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof/) +- [LCR 158. 库存管理 II - 力扣](https://leetcode.cn/problems/shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 51. \346\225\260\347\273\204\344\270\255\347\232\204\351\200\206\345\272\217\345\257\271.md" b/docs/solutions/LCR/shu-zu-zhong-de-ni-xu-dui-lcof.md similarity index 96% rename from "Solutions/\345\211\221\346\214\207 Offer 51. \346\225\260\347\273\204\344\270\255\347\232\204\351\200\206\345\272\217\345\257\271.md" rename to docs/solutions/LCR/shu-zu-zhong-de-ni-xu-dui-lcof.md index 1cdc68c8..2563d853 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 51. \346\225\260\347\273\204\344\270\255\347\232\204\351\200\206\345\272\217\345\257\271.md" +++ b/docs/solutions/LCR/shu-zu-zhong-de-ni-xu-dui-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 51. 数组中的逆序对](https://leetcode.cn/problems/shu-zu-zhong-de-ni-xu-dui-lcof/) +# [LCR 170. 交易逆序对的总数](https://leetcode.cn/problems/shu-zu-zhong-de-ni-xu-dui-lcof/) - 标签：树状数组、线段树、数组、二分查找、分治、有序集合、归并排序 - 难度：困难 ## 题目链接 -- [剑指 Offer 51. 数组中的逆序对 - 力扣](https://leetcode.cn/problems/shu-zu-zhong-de-ni-xu-dui-lcof/) +- [LCR 170. 交易逆序对的总数 - 力扣](https://leetcode.cn/problems/shu-zu-zhong-de-ni-xu-dui-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 56 - I. \346\225\260\347\273\204\344\270\255\346\225\260\345\255\227\345\207\272\347\216\260\347\232\204\346\254\241\346\225\260.md" b/docs/solutions/LCR/shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof.md similarity index 86% rename from "Solutions/\345\211\221\346\214\207 Offer 56 - I. \346\225\260\347\273\204\344\270\255\346\225\260\345\255\227\345\207\272\347\216\260\347\232\204\346\254\241\346\225\260.md" rename to docs/solutions/LCR/shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof.md index 2e6cf764..9a6ff8cf 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 56 - I. \346\225\260\347\273\204\344\270\255\346\225\260\345\255\227\345\207\272\347\216\260\347\232\204\346\254\241\346\225\260.md" +++ b/docs/solutions/LCR/shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 56 - I. 数组中数字出现的次数](https://leetcode.cn/problems/shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof/) +# [LCR 177. 撞色搭配](https://leetcode.cn/problems/shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof/) - 标签：位运算、数组 - 难度：中等 ## 题目链接 -- [剑指 Offer 56 - I. 数组中数字出现的次数 - 力扣](https://leetcode.cn/problems/shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof/) +- [LCR 177. 撞色搭配 - 力扣](https://leetcode.cn/problems/shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 03. \346\225\260\347\273\204\344\270\255\351\207\215\345\244\215\347\232\204\346\225\260\345\255\227.md" b/docs/solutions/LCR/shu-zu-zhong-zhong-fu-de-shu-zi-lcof.md similarity index 73% rename from "Solutions/\345\211\221\346\214\207 Offer 03. \346\225\260\347\273\204\344\270\255\351\207\215\345\244\215\347\232\204\346\225\260\345\255\227.md" rename to docs/solutions/LCR/shu-zu-zhong-zhong-fu-de-shu-zi-lcof.md index 3b39660b..4e33e1e9 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 03. \346\225\260\347\273\204\344\270\255\351\207\215\345\244\215\347\232\204\346\225\260\345\255\227.md" +++ b/docs/solutions/LCR/shu-zu-zhong-zhong-fu-de-shu-zi-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 03. 数组中重复的数字](https://leetcode.cn/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof/) +# [LCR 120. 寻找文件副本](https://leetcode.cn/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof/) - 标签：数组、哈希表、排序 - 难度：简单 ## 题目链接 -- [剑指 Offer 03. 数组中重复的数字 - 力扣](https://leetcode.cn/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof/) +- [LCR 120. 寻找文件副本 - 力扣](https://leetcode.cn/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 29. \351\241\272\346\227\266\351\222\210\346\211\223\345\215\260\347\237\251\351\230\265.md" b/docs/solutions/LCR/shun-shi-zhen-da-yin-ju-zhen-lcof.md similarity index 87% rename from "Solutions/\345\211\221\346\214\207 Offer 29. \351\241\272\346\227\266\351\222\210\346\211\223\345\215\260\347\237\251\351\230\265.md" rename to docs/solutions/LCR/shun-shi-zhen-da-yin-ju-zhen-lcof.md index 2fb38218..996646e6 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 29. \351\241\272\346\227\266\351\222\210\346\211\223\345\215\260\347\237\251\351\230\265.md" +++ b/docs/solutions/LCR/shun-shi-zhen-da-yin-ju-zhen-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 29. 顺时针打印矩阵](https://leetcode.cn/problems/shun-shi-zhen-da-yin-ju-zhen-lcof/) +# [LCR 146. 螺旋遍历二维数组](https://leetcode.cn/problems/shun-shi-zhen-da-yin-ju-zhen-lcof/) - 标签：数组、矩阵、模拟 - 难度：简单 ## 题目链接 -- [剑指 Offer 29. 顺时针打印矩阵 - 力扣](https://leetcode.cn/problems/shun-shi-zhen-da-yin-ju-zhen-lcof/) +- [LCR 146. 螺旋遍历二维数组 - 力扣](https://leetcode.cn/problems/shun-shi-zhen-da-yin-ju-zhen-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 05. \346\233\277\346\215\242\347\251\272\346\240\274.md" b/docs/solutions/LCR/ti-huan-kong-ge-lcof.md similarity index 82% rename from "Solutions/\345\211\221\346\214\207 Offer 05. \346\233\277\346\215\242\347\251\272\346\240\274.md" rename to docs/solutions/LCR/ti-huan-kong-ge-lcof.md index b1772cc2..172e6e1e 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 05. \346\233\277\346\215\242\347\251\272\346\240\274.md" +++ b/docs/solutions/LCR/ti-huan-kong-ge-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 05. 替换空格](https://leetcode.cn/problems/ti-huan-kong-ge-lcof/) +# [LCR 122. 路径加密](https://leetcode.cn/problems/ti-huan-kong-ge-lcof/) - 标签：字符串 - 难度：简单 ## 题目链接 -- [剑指 Offer 05. 替换空格 - 力扣](https://leetcode.cn/problems/ti-huan-kong-ge-lcof/) +- [LCR 122. 路径加密 - 力扣](https://leetcode.cn/problems/ti-huan-kong-ge-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 012. \345\267\246\345\217\263\344\270\244\350\276\271\345\255\220\346\225\260\347\273\204\347\232\204\345\222\214\347\233\270\347\255\211.md" b/docs/solutions/LCR/tvdfij.md similarity index 78% rename from "Solutions/\345\211\221\346\214\207 Offer II 012. \345\267\246\345\217\263\344\270\244\350\276\271\345\255\220\346\225\260\347\273\204\347\232\204\345\222\214\347\233\270\347\255\211.md" rename to docs/solutions/LCR/tvdfij.md index b3130ca5..07ab138b 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 012. \345\267\246\345\217\263\344\270\244\350\276\271\345\255\220\346\225\260\347\273\204\347\232\204\345\222\214\347\233\270\347\255\211.md" +++ b/docs/solutions/LCR/tvdfij.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 012. 左右两边子数组的和相等](https://leetcode.cn/problems/tvdfij/) +# [LCR 012. 寻找数组的中心下标](https://leetcode.cn/problems/tvdfij/) - 标签：数组、前缀和 - 难度：简单 ## 题目链接 -- [剑指 Offer II 012. 左右两边子数组的和相等 - 力扣](https://leetcode.cn/problems/tvdfij/) +- [LCR 012. 寻找数组的中心下标 - 力扣](https://leetcode.cn/problems/tvdfij/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 080. \345\220\253\346\234\211 k \344\270\252\345\205\203\347\264\240\347\232\204\347\273\204\345\220\210.md" b/docs/solutions/LCR/uUsW3B.md similarity index 88% rename from "Solutions/\345\211\221\346\214\207 Offer II 080. \345\220\253\346\234\211 k \344\270\252\345\205\203\347\264\240\347\232\204\347\273\204\345\220\210.md" rename to docs/solutions/LCR/uUsW3B.md index 722bdbfc..5215ce75 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 080. \345\220\253\346\234\211 k \344\270\252\345\205\203\347\264\240\347\232\204\347\273\204\345\220\210.md" +++ b/docs/solutions/LCR/uUsW3B.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 080. 含有 k 个元素的组合](https://leetcode.cn/problems/uUsW3B/) +# [LCR 080. 组合](https://leetcode.cn/problems/uUsW3B/) - 标签：数组、回溯 - 难度：中等 ## 题目链接 -- [剑指 Offer II 080. 含有 k 个元素的组合 - 力扣](https://leetcode.cn/problems/uUsW3B/) +- [LCR 080. 组合 - 力扣](https://leetcode.cn/problems/uUsW3B/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 106. \344\272\214\345\210\206\345\233\276.md" b/docs/solutions/LCR/vEAB3K.md similarity index 94% rename from "Solutions/\345\211\221\346\214\207 Offer II 106. \344\272\214\345\210\206\345\233\276.md" rename to docs/solutions/LCR/vEAB3K.md index 3b55f18d..1c0df49c 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 106. \344\272\214\345\210\206\345\233\276.md" +++ b/docs/solutions/LCR/vEAB3K.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 106. 二分图](https://leetcode.cn/problems/vEAB3K/) +# [LCR 106. 判断二分图](https://leetcode.cn/problems/vEAB3K/) - 标签：深度优先搜索、广度优先搜索、并查集、图 - 难度：中等 ## 题目链接 -- [剑指 Offer II 106. 二分图 - 力扣](https://leetcode.cn/problems/vEAB3K/) +- [LCR 106. 判断二分图 - 力扣](https://leetcode.cn/problems/vEAB3K/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 111. \350\256\241\347\256\227\351\231\244\346\263\225.md" b/docs/solutions/LCR/vlzXQL.md similarity index 96% rename from "Solutions/\345\211\221\346\214\207 Offer II 111. \350\256\241\347\256\227\351\231\244\346\263\225.md" rename to docs/solutions/LCR/vlzXQL.md index 06c3db6d..f774a008 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 111. \350\256\241\347\256\227\351\231\244\346\263\225.md" +++ b/docs/solutions/LCR/vlzXQL.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 111. 计算除法](https://leetcode.cn/problems/vlzXQL/) +# [LCR 111. 除法求值](https://leetcode.cn/problems/vlzXQL/) - 标签：深度优先搜索、广度优先搜索、并查集、图、数组、最短路 - 难度：中等 ## 题目链接 -- [剑指 Offer II 111. 计算除法 - 力扣](https://leetcode.cn/problems/vlzXQL/) +- [LCR 111. 除法求值 - 力扣](https://leetcode.cn/problems/vlzXQL/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 078. \345\220\210\345\271\266\346\216\222\345\272\217\351\223\276\350\241\250.md" b/docs/solutions/LCR/vvXgSW.md similarity index 89% rename from "Solutions/\345\211\221\346\214\207 Offer II 078. \345\220\210\345\271\266\346\216\222\345\272\217\351\223\276\350\241\250.md" rename to docs/solutions/LCR/vvXgSW.md index 0ffd9591..4c6728ea 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 078. \345\220\210\345\271\266\346\216\222\345\272\217\351\223\276\350\241\250.md" +++ b/docs/solutions/LCR/vvXgSW.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 078. 合并排序链表](https://leetcode.cn/problems/vvXgSW/) +# [LCR 078. 合并 K 个升序链表](https://leetcode.cn/problems/vvXgSW/) - 标签：链表、分治、堆（优先队列）、归并排序 - 难度：困难 ## 题目链接 -- [剑指 Offer II 078. 合并排序链表 - 力扣](https://leetcode.cn/problems/vvXgSW/) +- [LCR 078. 合并 K 个升序链表 - 力扣](https://leetcode.cn/problems/vvXgSW/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 003. \345\211\215 n \344\270\252\346\225\260\345\255\227\344\272\214\350\277\233\345\210\266\344\270\255 1 \347\232\204\344\270\252\346\225\260.md" b/docs/solutions/LCR/w3tCBm.md similarity index 80% rename from "Solutions/\345\211\221\346\214\207 Offer II 003. \345\211\215 n \344\270\252\346\225\260\345\255\227\344\272\214\350\277\233\345\210\266\344\270\255 1 \347\232\204\344\270\252\346\225\260.md" rename to docs/solutions/LCR/w3tCBm.md index 89d6f54f..fa303277 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 003. \345\211\215 n \344\270\252\346\225\260\345\255\227\344\272\214\350\277\233\345\210\266\344\270\255 1 \347\232\204\344\270\252\346\225\260.md" +++ b/docs/solutions/LCR/w3tCBm.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 003. 前 n 个数字二进制中 1 的个数](https://leetcode.cn/problems/w3tCBm/) +# [LCR 003. 比特位计数](https://leetcode.cn/problems/w3tCBm/) - 标签：位运算、动态规划 - 难度：简单 ## 题目链接 -- [剑指 Offer II 003. 前 n 个数字二进制中 1 的个数 - 力扣](https://leetcode.cn/problems/w3tCBm/) +- [LCR 003. 比特位计数 - 力扣](https://leetcode.cn/problems/w3tCBm/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 054. \346\211\200\346\234\211\345\244\247\344\272\216\347\255\211\344\272\216\350\212\202\347\202\271\347\232\204\345\200\274\344\271\213\345\222\214.md" b/docs/solutions/LCR/w6cpku.md similarity index 89% rename from "Solutions/\345\211\221\346\214\207 Offer II 054. \346\211\200\346\234\211\345\244\247\344\272\216\347\255\211\344\272\216\350\212\202\347\202\271\347\232\204\345\200\274\344\271\213\345\222\214.md" rename to docs/solutions/LCR/w6cpku.md index 2ec38886..dd25e693 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 054. \346\211\200\346\234\211\345\244\247\344\272\216\347\255\211\344\272\216\350\212\202\347\202\271\347\232\204\345\200\274\344\271\213\345\222\214.md" +++ b/docs/solutions/LCR/w6cpku.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 054. 所有大于等于节点的值之和](https://leetcode.cn/problems/w6cpku/) +# [LCR 054. 把二叉搜索树转换为累加树](https://leetcode.cn/problems/w6cpku/) - 标签：树、深度优先搜索、二叉搜索树、二叉树 - 难度：中等 ## 题目链接 -- [剑指 Offer II 054. 所有大于等于节点的值之和 - 力扣](https://leetcode.cn/problems/w6cpku/) +- [LCR 054. 把二叉搜索树转换为累加树 - 力扣](https://leetcode.cn/problems/w6cpku/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 016. \344\270\215\345\220\253\351\207\215\345\244\215\345\255\227\347\254\246\347\232\204\346\234\200\351\225\277\345\255\220\345\255\227\347\254\246\344\270\262.md" b/docs/solutions/LCR/wtcaE1.md similarity index 83% rename from "Solutions/\345\211\221\346\214\207 Offer II 016. \344\270\215\345\220\253\351\207\215\345\244\215\345\255\227\347\254\246\347\232\204\346\234\200\351\225\277\345\255\220\345\255\227\347\254\246\344\270\262.md" rename to docs/solutions/LCR/wtcaE1.md index 0b707a9b..e2b91a16 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 016. \344\270\215\345\220\253\351\207\215\345\244\215\345\255\227\347\254\246\347\232\204\346\234\200\351\225\277\345\255\220\345\255\227\347\254\246\344\270\262.md" +++ b/docs/solutions/LCR/wtcaE1.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 016. 不含重复字符的最长子字符串](https://leetcode.cn/problems/wtcaE1/) +# [LCR 016. 无重复字符的最长子串](https://leetcode.cn/problems/wtcaE1/) - 标签：哈希表、字符串、滑动窗口 - 难度：中等 ## 题目链接 -- [剑指 Offer II 016. 不含重复字符的最长子字符串 - 力扣](https://leetcode.cn/problems/wtcaE1/) +- [LCR 016. 无重复字符的最长子串 - 力扣](https://leetcode.cn/problems/wtcaE1/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 001. \346\225\264\346\225\260\351\231\244\346\263\225.md" b/docs/solutions/LCR/xoh6Oh.md similarity index 91% rename from "Solutions/\345\211\221\346\214\207 Offer II 001. \346\225\264\346\225\260\351\231\244\346\263\225.md" rename to docs/solutions/LCR/xoh6Oh.md index 583c3826..11ed6615 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 001. \346\225\264\346\225\260\351\231\244\346\263\225.md" +++ b/docs/solutions/LCR/xoh6Oh.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 001. 整数除法](https://leetcode.cn/problems/xoh6Oh/) +# [LCR 001. 两数相除](https://leetcode.cn/problems/xoh6Oh/) - 标签：位运算、数学 - 难度：简单 ## 题目链接 -- [剑指 Offer II 001. 整数除法 - 力扣](https://leetcode.cn/problems/xoh6Oh/) +- [LCR 001. 两数相除 - 力扣](https://leetcode.cn/problems/xoh6Oh/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 37. \345\272\217\345\210\227\345\214\226\344\272\214\345\217\211\346\240\221.md" b/docs/solutions/LCR/xu-lie-hua-er-cha-shu-lcof.md similarity index 89% rename from "Solutions/\345\211\221\346\214\207 Offer 37. \345\272\217\345\210\227\345\214\226\344\272\214\345\217\211\346\240\221.md" rename to docs/solutions/LCR/xu-lie-hua-er-cha-shu-lcof.md index f181e606..48ddfbd0 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 37. \345\272\217\345\210\227\345\214\226\344\272\214\345\217\211\346\240\221.md" +++ b/docs/solutions/LCR/xu-lie-hua-er-cha-shu-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 37. 序列化二叉树](https://leetcode.cn/problems/xu-lie-hua-er-cha-shu-lcof/) +# [LCR 156. 序列化与反序列化二叉树](https://leetcode.cn/problems/xu-lie-hua-er-cha-shu-lcof/) - 标签：树、深度优先搜索、广度优先搜索、设计、字符串、二叉树 - 难度：困难 ## 题目链接 -- [剑指 Offer 37. 序列化二叉树 - 力扣](https://leetcode.cn/problems/xu-lie-hua-er-cha-shu-lcof/) +- [LCR 156. 序列化与反序列化二叉树 - 力扣](https://leetcode.cn/problems/xu-lie-hua-er-cha-shu-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 11. \346\227\213\350\275\254\346\225\260\347\273\204\347\232\204\346\234\200\345\260\217\346\225\260\345\255\227.md" b/docs/solutions/LCR/xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof.md similarity index 88% rename from "Solutions/\345\211\221\346\214\207 Offer 11. \346\227\213\350\275\254\346\225\260\347\273\204\347\232\204\346\234\200\345\260\217\346\225\260\345\255\227.md" rename to docs/solutions/LCR/xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof.md index 3de5c887..84571ab0 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 11. \346\227\213\350\275\254\346\225\260\347\273\204\347\232\204\346\234\200\345\260\217\346\225\260\345\255\227.md" +++ b/docs/solutions/LCR/xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 11. 旋转数组的最小数字](https://leetcode.cn/problems/xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof/) +# [LCR 128. 库存管理 I](https://leetcode.cn/problems/xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof/) - 标签：数组、二分查找 - 难度：简单 ## 题目链接 -- [剑指 Offer 11. 旋转数组的最小数字 - 力扣](https://leetcode.cn/problems/xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof/) +- [LCR 128. 库存管理 I - 力扣](https://leetcode.cn/problems/xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 076. \346\225\260\347\273\204\344\270\255\347\232\204\347\254\254 k \345\244\247\347\232\204\346\225\260\345\255\227.md" b/docs/solutions/LCR/xx4gT2.md similarity index 96% rename from "Solutions/\345\211\221\346\214\207 Offer II 076. \346\225\260\347\273\204\344\270\255\347\232\204\347\254\254 k \345\244\247\347\232\204\346\225\260\345\255\227.md" rename to docs/solutions/LCR/xx4gT2.md index ea5a929c..16470ff7 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 076. \346\225\260\347\273\204\344\270\255\347\232\204\347\254\254 k \345\244\247\347\232\204\346\225\260\345\255\227.md" +++ b/docs/solutions/LCR/xx4gT2.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 076. 数组中的第 k 大的数字](https://leetcode.cn/problems/xx4gT2/) +# [LCR 076. 数组中的第 K 个最大元素](https://leetcode.cn/problems/xx4gT2/) - 标签：数组、分治、快速选择、排序、堆（优先队列） - 难度：中等 ## 题目链接 -- [剑指 Offer II 076. 数组中的第 k 大的数字 - 力扣](https://leetcode.cn/problems/xx4gT2/) +- [LCR 076. 数组中的第 K 个最大元素 - 力扣](https://leetcode.cn/problems/xx4gT2/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 09. \347\224\250\344\270\244\344\270\252\346\240\210\345\256\236\347\216\260\351\230\237\345\210\227.md" b/docs/solutions/LCR/yong-liang-ge-zhan-shi-xian-dui-lie-lcof.md similarity index 86% rename from "Solutions/\345\211\221\346\214\207 Offer 09. \347\224\250\344\270\244\344\270\252\346\240\210\345\256\236\347\216\260\351\230\237\345\210\227.md" rename to docs/solutions/LCR/yong-liang-ge-zhan-shi-xian-dui-lie-lcof.md index ba129782..636e2751 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 09. \347\224\250\344\270\244\344\270\252\346\240\210\345\256\236\347\216\260\351\230\237\345\210\227.md" +++ b/docs/solutions/LCR/yong-liang-ge-zhan-shi-xian-dui-lie-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 09. 用两个栈实现队列](https://leetcode.cn/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/) +# [LCR 125. 图书整理 II](https://leetcode.cn/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/) - 标签：栈、设计、队列 - 难度：简单 ## 题目链接 -- [剑指 Offer 09. 用两个栈实现队列 - 力扣](https://leetcode.cn/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/) +- [LCR 125. 图书整理 II - 力扣](https://leetcode.cn/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 62. \345\234\206\345\234\210\344\270\255\346\234\200\345\220\216\345\211\251\344\270\213\347\232\204\346\225\260\345\255\227.md" b/docs/solutions/LCR/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof.md similarity index 91% rename from "Solutions/\345\211\221\346\214\207 Offer 62. \345\234\206\345\234\210\344\270\255\346\234\200\345\220\216\345\211\251\344\270\213\347\232\204\346\225\260\345\255\227.md" rename to docs/solutions/LCR/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof.md index 65b74b0d..5fcd7d09 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 62. \345\234\206\345\234\210\344\270\255\346\234\200\345\220\216\345\211\251\344\270\213\347\232\204\346\225\260\345\255\227.md" +++ b/docs/solutions/LCR/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 62. 圆圈中最后剩下的数字](https://leetcode.cn/problems/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof/) +# [LCR 187. 破冰游戏](https://leetcode.cn/problems/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof/) - 标签：递归、数学 - 难度：简单 ## 题目链接 -- [剑指 Offer 62. 圆圈中最后剩下的数字 - 力扣](https://leetcode.cn/problems/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof/) +- [LCR 187. 破冰游戏 - 力扣](https://leetcode.cn/problems/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 066. \345\215\225\350\257\215\344\271\213\345\222\214.md" b/docs/solutions/LCR/z1R5dt.md similarity index 93% rename from "Solutions/\345\211\221\346\214\207 Offer II 066. \345\215\225\350\257\215\344\271\213\345\222\214.md" rename to docs/solutions/LCR/z1R5dt.md index 7006ac8c..f833f895 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 066. \345\215\225\350\257\215\344\271\213\345\222\214.md" +++ b/docs/solutions/LCR/z1R5dt.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 066. 单词之和](https://leetcode.cn/problems/z1R5dt/) +# [LCR 066. 键值映射](https://leetcode.cn/problems/z1R5dt/) - 标签：设计、字典树、哈希表、字符串 - 难度：中等 ## 题目链接 -- [剑指 Offer II 066. 单词之和 - 力扣](https://leetcode.cn/problems/z1R5dt/) +- [LCR 066. 键值映射 - 力扣](https://leetcode.cn/problems/z1R5dt/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 53 - I. \345\234\250\346\216\222\345\272\217\346\225\260\347\273\204\344\270\255\346\237\245\346\211\276\346\225\260\345\255\227 I.md" b/docs/solutions/LCR/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof.md similarity index 83% rename from "Solutions/\345\211\221\346\214\207 Offer 53 - I. \345\234\250\346\216\222\345\272\217\346\225\260\347\273\204\344\270\255\346\237\245\346\211\276\346\225\260\345\255\227 I.md" rename to docs/solutions/LCR/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof.md index 6327314b..73ea3076 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 53 - I. \345\234\250\346\216\222\345\272\217\346\225\260\347\273\204\344\270\255\346\237\245\346\211\276\346\225\260\345\255\227 I.md" +++ b/docs/solutions/LCR/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 53 - I. 在排序数组中查找数字 I](https://leetcode.cn/problems/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof/) +# [LCR 172. 统计目标成绩的出现次数](https://leetcode.cn/problems/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof/) - 标签：数组、二分查找 - 难度：简单 ## 题目链接 -- [剑指 Offer 53 - I. 在排序数组中查找数字 I - 力扣](https://leetcode.cn/problems/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof/) +- [LCR 172. 统计目标成绩的出现次数 - 力扣](https://leetcode.cn/problems/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 31. \346\240\210\347\232\204\345\216\213\345\205\245\343\200\201\345\274\271\345\207\272\345\272\217\345\210\227.md" b/docs/solutions/LCR/zhan-de-ya-ru-dan-chu-xu-lie-lcof.md similarity index 75% rename from "Solutions/\345\211\221\346\214\207 Offer 31. \346\240\210\347\232\204\345\216\213\345\205\245\343\200\201\345\274\271\345\207\272\345\272\217\345\210\227.md" rename to docs/solutions/LCR/zhan-de-ya-ru-dan-chu-xu-lie-lcof.md index 47edc5b8..ba715cab 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 31. \346\240\210\347\232\204\345\216\213\345\205\245\343\200\201\345\274\271\345\207\272\345\272\217\345\210\227.md" +++ b/docs/solutions/LCR/zhan-de-ya-ru-dan-chu-xu-lie-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 31. 栈的压入、弹出序列](https://leetcode.cn/problems/zhan-de-ya-ru-dan-chu-xu-lie-lcof/) +# [LCR 148. 验证图书取出顺序](https://leetcode.cn/problems/zhan-de-ya-ru-dan-chu-xu-lie-lcof/) - 标签：栈、数组、模拟 - 难度：中等 ## 题目链接 -- [剑指 Offer 31. 栈的压入、弹出序列 - 力扣](https://leetcode.cn/problems/zhan-de-ya-ru-dan-chu-xu-lie-lcof/) +- [LCR 148. 验证图书取出顺序 - 力扣](https://leetcode.cn/problems/zhan-de-ya-ru-dan-chu-xu-lie-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 07. \351\207\215\345\273\272\344\272\214\345\217\211\346\240\221.md" b/docs/solutions/LCR/zhong-jian-er-cha-shu-lcof.md similarity index 90% rename from "Solutions/\345\211\221\346\214\207 Offer 07. \351\207\215\345\273\272\344\272\214\345\217\211\346\240\221.md" rename to docs/solutions/LCR/zhong-jian-er-cha-shu-lcof.md index f9c6c4a5..d8c6b348 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 07. \351\207\215\345\273\272\344\272\214\345\217\211\346\240\221.md" +++ b/docs/solutions/LCR/zhong-jian-er-cha-shu-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 07. 重建二叉树](https://leetcode.cn/problems/zhong-jian-er-cha-shu-lcof/) +# [LCR 124. 推理二叉树](https://leetcode.cn/problems/zhong-jian-er-cha-shu-lcof/) - 标签：树、数组、哈希表、分治、二叉树 - 难度：中等 ## 题目链接 -- [剑指 Offer 07. 重建二叉树 - 力扣](https://leetcode.cn/problems/zhong-jian-er-cha-shu-lcof/) +- [LCR 124. 推理二叉树 - 力扣](https://leetcode.cn/problems/zhong-jian-er-cha-shu-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 38. \345\255\227\347\254\246\344\270\262\347\232\204\346\216\222\345\210\227.md" b/docs/solutions/LCR/zi-fu-chuan-de-pai-lie-lcof.md similarity index 88% rename from "Solutions/\345\211\221\346\214\207 Offer 38. \345\255\227\347\254\246\344\270\262\347\232\204\346\216\222\345\210\227.md" rename to docs/solutions/LCR/zi-fu-chuan-de-pai-lie-lcof.md index deee93d1..c5cdf821 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 38. \345\255\227\347\254\246\344\270\262\347\232\204\346\216\222\345\210\227.md" +++ b/docs/solutions/LCR/zi-fu-chuan-de-pai-lie-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 38. 字符串的排列](https://leetcode.cn/problems/zi-fu-chuan-de-pai-lie-lcof/) +# [LCR 157. 套餐内商品的排列顺序](https://leetcode.cn/problems/zi-fu-chuan-de-pai-lie-lcof/) - 标签：字符串、回溯 - 难度：中等 ## 题目链接 -- [剑指 Offer 38. 字符串的排列 - 力扣](https://leetcode.cn/problems/zi-fu-chuan-de-pai-lie-lcof/) +- [LCR 157. 套餐内商品的排列顺序 - 力扣](https://leetcode.cn/problems/zi-fu-chuan-de-pai-lie-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer II 109. \345\274\200\345\257\206\347\240\201\351\224\201.md" b/docs/solutions/LCR/zlDJc7.md similarity index 94% rename from "Solutions/\345\211\221\346\214\207 Offer II 109. \345\274\200\345\257\206\347\240\201\351\224\201.md" rename to docs/solutions/LCR/zlDJc7.md index 75524f10..b70ff05c 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer II 109. \345\274\200\345\257\206\347\240\201\351\224\201.md" +++ b/docs/solutions/LCR/zlDJc7.md @@ -1,11 +1,11 @@ -# [剑指 Offer II 109. 开密码锁](https://leetcode.cn/problems/zlDJc7/) +# [LCR 109. 打开转盘锁](https://leetcode.cn/problems/zlDJc7/) - 标签：广度优先搜索、数组、哈希表、字符串 - 难度：中等 ## 题目链接 -- [剑指 Offer II 109. 开密码锁 - 力扣](https://leetcode.cn/problems/zlDJc7/) +- [LCR 109. 打开转盘锁 - 力扣](https://leetcode.cn/problems/zlDJc7/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 48. \346\234\200\351\225\277\344\270\215\345\220\253\351\207\215\345\244\215\345\255\227\347\254\246\347\232\204\345\255\220\345\255\227\347\254\246\344\270\262.md" b/docs/solutions/LCR/zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof.md similarity index 78% rename from "Solutions/\345\211\221\346\214\207 Offer 48. \346\234\200\351\225\277\344\270\215\345\220\253\351\207\215\345\244\215\345\255\227\347\254\246\347\232\204\345\255\220\345\255\227\347\254\246\344\270\262.md" rename to docs/solutions/LCR/zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof.md index b2bc6449..55f46821 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 48. \346\234\200\351\225\277\344\270\215\345\220\253\351\207\215\345\244\215\345\255\227\347\254\246\347\232\204\345\255\220\345\255\227\347\254\246\344\270\262.md" +++ b/docs/solutions/LCR/zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 48. 最长不含重复字符的子字符串](https://leetcode.cn/problems/zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof/) +# [LCR 167. 招式拆解 I](https://leetcode.cn/problems/zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof/) - 标签：哈希表、字符串、滑动窗口 - 难度：中等 ## 题目链接 -- [剑指 Offer 48. 最长不含重复字符的子字符串 - 力扣](https://leetcode.cn/problems/zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof/) +- [LCR 167. 招式拆解 I - 力扣](https://leetcode.cn/problems/zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 40. \346\234\200\345\260\217\347\232\204k\344\270\252\346\225\260.md" b/docs/solutions/LCR/zui-xiao-de-kge-shu-lcof.md similarity index 96% rename from "Solutions/\345\211\221\346\214\207 Offer 40. \346\234\200\345\260\217\347\232\204k\344\270\252\346\225\260.md" rename to docs/solutions/LCR/zui-xiao-de-kge-shu-lcof.md index 6750b918..475b6eb6 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 40. \346\234\200\345\260\217\347\232\204k\344\270\252\346\225\260.md" +++ b/docs/solutions/LCR/zui-xiao-de-kge-shu-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 40. 最小的k个数](https://leetcode.cn/problems/zui-xiao-de-kge-shu-lcof/) +# [LCR 159. 库存管理 III](https://leetcode.cn/problems/zui-xiao-de-kge-shu-lcof/) - 标签：数组、分治、快速选择、排序、堆（优先队列） - 难度：简单 ## 题目链接 -- [剑指 Offer 40. 最小的k个数 - 力扣](https://leetcode.cn/problems/zui-xiao-de-kge-shu-lcof/) +- [LCR 159. 库存管理 III - 力扣](https://leetcode.cn/problems/zui-xiao-de-kge-shu-lcof/) ## 题目大意 diff --git "a/Solutions/\345\211\221\346\214\207 Offer 58 - II. \345\267\246\346\227\213\350\275\254\345\255\227\347\254\246\344\270\262.md" b/docs/solutions/LCR/zuo-xuan-zhuan-zi-fu-chuan-lcof.md similarity index 77% rename from "Solutions/\345\211\221\346\214\207 Offer 58 - II. \345\267\246\346\227\213\350\275\254\345\255\227\347\254\246\344\270\262.md" rename to docs/solutions/LCR/zuo-xuan-zhuan-zi-fu-chuan-lcof.md index 32bf7382..6b661c62 100644 --- "a/Solutions/\345\211\221\346\214\207 Offer 58 - II. \345\267\246\346\227\213\350\275\254\345\255\227\347\254\246\344\270\262.md" +++ b/docs/solutions/LCR/zuo-xuan-zhuan-zi-fu-chuan-lcof.md @@ -1,11 +1,11 @@ -# [剑指 Offer 58 - II. 左旋转字符串](https://leetcode.cn/problems/zuo-xuan-zhuan-zi-fu-chuan-lcof/) +# [LCR 182. 动态口令](https://leetcode.cn/problems/zuo-xuan-zhuan-zi-fu-chuan-lcof/) - 标签：数学、双指针、字符串 - 难度：简单 ## 题目链接 -- [剑指 Offer 58 - II. 左旋转字符串 - 力扣](https://leetcode.cn/problems/zuo-xuan-zhuan-zi-fu-chuan-lcof/) +- [LCR 182. 动态口令 - 力扣](https://leetcode.cn/problems/zuo-xuan-zhuan-zi-fu-chuan-lcof/) ## 题目大意 diff --git a/docs/solutions/index.md b/docs/solutions/index.md new file mode 100644 index 00000000..2b2745ad --- /dev/null +++ b/docs/solutions/index.md @@ -0,0 +1,31 @@ +## 本章内容 + +- [第 1 ~ 99 题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/) +- [第 100 ~ 199 题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/) +- [第 200 ~ 299 题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/) +- [第 300 ~ 399 题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/) +- [第 400 ~ 499 题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/) +- [第 500 ~ 599 题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/) +- [第 600 ~ 699 题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/) +- [第 700 ~ 799 题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/) +- [第 800 ~ 899 题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0800-0899/) +- [第 900 ~ 999 题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/) +- [第 1000 ~ 1099 题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/) +- [第 1100 ~ 1199 题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/) +- [第 1200 ~ 1299 题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/) +- [第 1300 ~ 1399 题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1300-1399/) +- [第 1400 ~ 1499 题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/) +- [第 1500 ~ 1599 题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/) +- [第 1600 ~ 1699 题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1600-1699/) +- [第 1700 ~ 1799 题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1700-1799/) +- [第 1800 ~ 1899 题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1800-1899/) +- [第 1900 ~ 1999 题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/) +- [第 2000 ~ 2099 题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2000-2099/) +- [第 2100 ~ 2199 题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2100-2199/) +- [第 2200 ~ 2299 题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2200-2299/) +- [第 2300 ~ 2399 题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2300-2399/) +- [第 2400 ~ 2499 题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2400-2499/) +- [第 2500 ~ 2599 题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2500-2599/) +- [第 2700 ~ 2799 题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2700-2799/) +- [LCR 系列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/) +- [面试题](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/) diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 08.09. \346\213\254\345\217\267.md" b/docs/solutions/interviews/bracket-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 08.09. \346\213\254\345\217\267.md" rename to docs/solutions/interviews/bracket-lcci.md diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 16.26. \350\256\241\347\256\227\345\231\250.md" b/docs/solutions/interviews/calculator-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 16.26. \350\256\241\347\256\227\345\231\250.md" rename to docs/solutions/interviews/calculator-lcci.md diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 08.10. \351\242\234\350\211\262\345\241\253\345\205\205.md" b/docs/solutions/interviews/color-fill-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 08.10. \351\242\234\350\211\262\345\241\253\345\205\205.md" rename to docs/solutions/interviews/color-fill-lcci.md diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 08.12. \345\205\253\347\232\207\345\220\216.md" b/docs/solutions/interviews/eight-queens-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 08.12. \345\205\253\347\232\207\345\220\216.md" rename to docs/solutions/interviews/eight-queens-lcci.md diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 16.05. \351\230\266\344\271\230\345\260\276\346\225\260.md" b/docs/solutions/interviews/factorial-zeros-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 16.05. \351\230\266\344\271\230\345\260\276\346\225\260.md" rename to docs/solutions/interviews/factorial-zeros-lcci.md diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 04.08. \351\246\226\344\270\252\345\205\261\345\220\214\347\245\226\345\205\210.md" b/docs/solutions/interviews/first-common-ancestor-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 04.08. \351\246\226\344\270\252\345\205\261\345\220\214\347\245\226\345\205\210.md" rename to docs/solutions/interviews/first-common-ancestor-lcci.md diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 10.02. \345\217\230\344\275\215\350\257\215\347\273\204.md" b/docs/solutions/interviews/group-anagrams-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 10.02. \345\217\230\344\275\215\350\257\215\347\273\204.md" rename to docs/solutions/interviews/group-anagrams-lcci.md diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 03.04. \345\214\226\346\240\210\344\270\272\351\230\237.md" b/docs/solutions/interviews/implement-queue-using-stacks-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 03.04. \345\214\226\346\240\210\344\270\272\351\230\237.md" rename to docs/solutions/interviews/implement-queue-using-stacks-lcci.md diff --git a/docs/solutions/interviews/index.md b/docs/solutions/interviews/index.md new file mode 100644 index 00000000..3410fb8b --- /dev/null +++ b/docs/solutions/interviews/index.md @@ -0,0 +1,32 @@ +## 本章内容 + +- [面试题 01.07. 旋转矩阵](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/rotate-matrix-lcci.md) +- [面试题 01.08. 零矩阵](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/zero-matrix-lcci.md) +- [面试题 02.02. 返回倒数第 k 个节点](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/kth-node-from-end-of-list-lcci.md) +- [面试题 02.05. 链表求和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/sum-lists-lcci.md) +- [面试题 02.06. 回文链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/palindrome-linked-list-lcci.md) +- [面试题 02.07. 链表相交](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/intersection-of-two-linked-lists-lcci.md) +- [面试题 02.08. 环路检测](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/linked-list-cycle-lcci.md) +- [面试题 03.02. 栈的最小值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/min-stack-lcci.md) +- [面试题 03.04. 化栈为队](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/implement-queue-using-stacks-lcci.md) +- [面试题 04.02. 最小高度树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/minimum-height-tree-lcci.md) +- [面试题 04.05. 合法二叉搜索树](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/legal-binary-search-tree-lcci.md) +- [面试题 04.06. 后继者](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/successor-lcci.md) +- [面试题 04.08. 首个共同祖先](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/first-common-ancestor-lcci.md) +- [面试题 04.12. 求和路径](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/paths-with-sum-lcci.md) +- [面试题 08.04. 幂集](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/power-set-lcci.md) +- [面试题 08.07. 无重复字符串的排列组合](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/permutation-i-lcci.md) +- [面试题 08.08. 有重复字符串的排列组合](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/permutation-ii-lcci.md) +- [面试题 08.09. 括号](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/bracket-lcci.md) +- [面试题 08.10. 颜色填充](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/color-fill-lcci.md) +- [面试题 08.12. 八皇后](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/eight-queens-lcci.md) +- [面试题 10.01. 合并排序的数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/sorted-merge-lcci.md) +- [面试题 10.02. 变位词组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/group-anagrams-lcci.md) +- [面试题 10.09. 排序矩阵查找](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/sorted-matrix-search-lcci.md) +- [面试题 16.02. 单词频率](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/words-frequency-lcci.md) +- [面试题 16.05. 阶乘尾数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/factorial-zeros-lcci.md) +- [面试题 16.26. 计算器](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/calculator-lcci.md) +- [面试题 17.06. 2出现的次数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/number-of-2s-in-range-lcci.md) +- [面试题 17.14. 最小K个数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/smallest-k-lcci.md) +- [面试题 17.15. 最长单词](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/longest-word-lcci.md) +- [面试题 17.17. 多次搜索](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/interviews/multi-search-lcci.md) diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 02.07. \351\223\276\350\241\250\347\233\270\344\272\244.md" b/docs/solutions/interviews/intersection-of-two-linked-lists-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 02.07. \351\223\276\350\241\250\347\233\270\344\272\244.md" rename to docs/solutions/interviews/intersection-of-two-linked-lists-lcci.md diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 02.02. \350\277\224\345\233\236\345\200\222\346\225\260\347\254\254 k \344\270\252\350\212\202\347\202\271.md" b/docs/solutions/interviews/kth-node-from-end-of-list-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 02.02. \350\277\224\345\233\236\345\200\222\346\225\260\347\254\254 k \344\270\252\350\212\202\347\202\271.md" rename to docs/solutions/interviews/kth-node-from-end-of-list-lcci.md diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 04.05. \345\220\210\346\263\225\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221.md" b/docs/solutions/interviews/legal-binary-search-tree-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 04.05. \345\220\210\346\263\225\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221.md" rename to docs/solutions/interviews/legal-binary-search-tree-lcci.md diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 02.08. \347\216\257\350\267\257\346\243\200\346\265\213.md" b/docs/solutions/interviews/linked-list-cycle-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 02.08. \347\216\257\350\267\257\346\243\200\346\265\213.md" rename to docs/solutions/interviews/linked-list-cycle-lcci.md diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 17.15. \346\234\200\351\225\277\345\215\225\350\257\215.md" b/docs/solutions/interviews/longest-word-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 17.15. \346\234\200\351\225\277\345\215\225\350\257\215.md" rename to docs/solutions/interviews/longest-word-lcci.md diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 03.02. \346\240\210\347\232\204\346\234\200\345\260\217\345\200\274.md" b/docs/solutions/interviews/min-stack-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 03.02. \346\240\210\347\232\204\346\234\200\345\260\217\345\200\274.md" rename to docs/solutions/interviews/min-stack-lcci.md diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 04.02. \346\234\200\345\260\217\351\253\230\345\272\246\346\240\221.md" b/docs/solutions/interviews/minimum-height-tree-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 04.02. \346\234\200\345\260\217\351\253\230\345\272\246\346\240\221.md" rename to docs/solutions/interviews/minimum-height-tree-lcci.md diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 17.17. \345\244\232\346\254\241\346\220\234\347\264\242.md" b/docs/solutions/interviews/multi-search-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 17.17. \345\244\232\346\254\241\346\220\234\347\264\242.md" rename to docs/solutions/interviews/multi-search-lcci.md diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 17.06. 2\345\207\272\347\216\260\347\232\204\346\254\241\346\225\260.md" b/docs/solutions/interviews/number-of-2s-in-range-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 17.06. 2\345\207\272\347\216\260\347\232\204\346\254\241\346\225\260.md" rename to docs/solutions/interviews/number-of-2s-in-range-lcci.md diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 02.06. \345\233\236\346\226\207\351\223\276\350\241\250.md" b/docs/solutions/interviews/palindrome-linked-list-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 02.06. \345\233\236\346\226\207\351\223\276\350\241\250.md" rename to docs/solutions/interviews/palindrome-linked-list-lcci.md diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 04.12. \346\261\202\345\222\214\350\267\257\345\276\204.md" b/docs/solutions/interviews/paths-with-sum-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 04.12. \346\261\202\345\222\214\350\267\257\345\276\204.md" rename to docs/solutions/interviews/paths-with-sum-lcci.md diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 08.07. \346\227\240\351\207\215\345\244\215\345\255\227\347\254\246\344\270\262\347\232\204\346\216\222\345\210\227\347\273\204\345\220\210.md" b/docs/solutions/interviews/permutation-i-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 08.07. \346\227\240\351\207\215\345\244\215\345\255\227\347\254\246\344\270\262\347\232\204\346\216\222\345\210\227\347\273\204\345\220\210.md" rename to docs/solutions/interviews/permutation-i-lcci.md diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 08.08. \346\234\211\351\207\215\345\244\215\345\255\227\347\254\246\344\270\262\347\232\204\346\216\222\345\210\227\347\273\204\345\220\210.md" b/docs/solutions/interviews/permutation-ii-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 08.08. \346\234\211\351\207\215\345\244\215\345\255\227\347\254\246\344\270\262\347\232\204\346\216\222\345\210\227\347\273\204\345\220\210.md" rename to docs/solutions/interviews/permutation-ii-lcci.md diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 08.04. \345\271\202\351\233\206.md" b/docs/solutions/interviews/power-set-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 08.04. \345\271\202\351\233\206.md" rename to docs/solutions/interviews/power-set-lcci.md diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 01.07. \346\227\213\350\275\254\347\237\251\351\230\265.md" b/docs/solutions/interviews/rotate-matrix-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 01.07. \346\227\213\350\275\254\347\237\251\351\230\265.md" rename to docs/solutions/interviews/rotate-matrix-lcci.md diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 17.14. \346\234\200\345\260\217K\344\270\252\346\225\260.md" b/docs/solutions/interviews/smallest-k-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 17.14. \346\234\200\345\260\217K\344\270\252\346\225\260.md" rename to docs/solutions/interviews/smallest-k-lcci.md diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 10.09. \346\216\222\345\272\217\347\237\251\351\230\265\346\237\245\346\211\276.md" b/docs/solutions/interviews/sorted-matrix-search-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 10.09. \346\216\222\345\272\217\347\237\251\351\230\265\346\237\245\346\211\276.md" rename to docs/solutions/interviews/sorted-matrix-search-lcci.md diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 10.01. \345\220\210\345\271\266\346\216\222\345\272\217\347\232\204\346\225\260\347\273\204.md" b/docs/solutions/interviews/sorted-merge-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 10.01. \345\220\210\345\271\266\346\216\222\345\272\217\347\232\204\346\225\260\347\273\204.md" rename to docs/solutions/interviews/sorted-merge-lcci.md diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 04.06. \345\220\216\347\273\247\350\200\205.md" b/docs/solutions/interviews/successor-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 04.06. \345\220\216\347\273\247\350\200\205.md" rename to docs/solutions/interviews/successor-lcci.md diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 02.05. \351\223\276\350\241\250\346\261\202\345\222\214.md" b/docs/solutions/interviews/sum-lists-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 02.05. \351\223\276\350\241\250\346\261\202\345\222\214.md" rename to docs/solutions/interviews/sum-lists-lcci.md diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 16.02. \345\215\225\350\257\215\351\242\221\347\216\207.md" b/docs/solutions/interviews/words-frequency-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 16.02. \345\215\225\350\257\215\351\242\221\347\216\207.md" rename to docs/solutions/interviews/words-frequency-lcci.md diff --git "a/Solutions/\351\235\242\350\257\225\351\242\230 01.08. \351\233\266\347\237\251\351\230\265.md" b/docs/solutions/interviews/zero-matrix-lcci.md similarity index 100% rename from "Solutions/\351\235\242\350\257\225\351\242\230 01.08. \351\233\266\347\237\251\351\230\265.md" rename to docs/solutions/interviews/zero-matrix-lcci.md