[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"project-1555":3},{"id":4,"name":5,"fullName":6,"owner":7,"repo":5,"description":8,"homepage":9,"htmlUrl":10,"language":11,"languages":10,"totalLinesOfCode":10,"stars":12,"forks":13,"watchers":14,"openIssues":15,"contributorsCount":16,"subscribersCount":16,"size":16,"stars1d":15,"stars7d":17,"stars30d":18,"stars90d":16,"forks30d":16,"starsTrendScore":19,"compositeScore":20,"rankGlobal":10,"rankLanguage":10,"license":21,"archived":22,"fork":22,"defaultBranch":23,"hasWiki":22,"hasPages":24,"topics":25,"createdAt":10,"pushedAt":10,"updatedAt":33,"readmeContent":34,"aiSummary":35,"trendingCount":16,"starSnapshotCount":16,"syncStatus":15,"lastSyncTime":36,"discoverSource":37},1555,"leetcode","doocs\u002Fleetcode","doocs","🔥LeetCode solutions in any programming language | 多种编程语言实现 LeetCode、《剑指 Offer（第 2 版）》、《程序员面试金典（第 6 版）》题解","https:\u002F\u002Fleetcode.doocs.org",null,"Java",36133,9432,337,2,0,35,150,20,45,"Creative Commons Attribution Share Alike 4.0 International",false,"main",true,[26,27,28,29,30,31,5,32],"algorithms","cpp","csharp","golang","java","javascript","python3","2026-06-12 02:00:29","\u003Cp align=\"center\">\n  \u003Ca href=\"https:\u002F\u002Fgithub.com\u002Fdoocs\u002Fleetcode\">\u003Cimg src=\"https:\u002F\u002Fcdn-doocs.oss-cn-shenzhen.aliyuncs.com\u002Fgh\u002Fdoocs\u002Fleetcode%40main\u002Fimages\u002Fdoocs-leetcode.png\" alt=\"LeetCode-GitHub-Doocs\">\u003C\u002Fa>\n\u003C\u002Fp>\n\n\u003Cp align=\"center\">\n  \u003Ca href=\"https:\u002F\u002Fdoocs.org\">\u003Cimg src=\"https:\u002F\u002Fimg.shields.io\u002Fbadge\u002Forganization-join%20us-4051B5?style=flat-square\" alt=\"open-source-organization\">\u003C\u002Fa>\n  \u003Ca href=\"https:\u002F\u002Fgithub.com\u002Fdoocs\u002Fleetcode\">\u003Cimg src=\"https:\u002F\u002Fimg.shields.io\u002Fbadge\u002Flangs-Python%20%7C%20Java%20%7C%20C++%20%7C%20Go%20%7C%20TypeScript%20%7C%20Rust%20%7C%20...-red?style=flat-square&color=4051B5\" alt=\"languages\">\u003C\u002Fa>\n  \u003Ca href=\"https:\u002F\u002Fgithub.com\u002Fdoocs\u002Fleetcode\u002Fblob\u002Fmain\u002FLICENSE\">\u003Cimg src=\"https:\u002F\u002Fimg.shields.io\u002Fgithub\u002Flicense\u002Fdoocs\u002Fleetcode?color=4051B5&style=flat-square\" alt=\"LICENSE\">\u003C\u002Fa>\u003Cbr>\n  \u003Ca href=\"https:\u002F\u002Fgithub.com\u002Fdoocs\u002Fleetcode\u002Fstargazers\">\u003Cimg src=\"https:\u002F\u002Fimg.shields.io\u002Fgithub\u002Fstars\u002Fdoocs\u002Fleetcode?color=4051B5&logo=github&style=flat-square\" alt=\"stars\">\u003C\u002Fa>\n  \u003Ca href=\"https:\u002F\u002Fgithub.com\u002Fdoocs\u002Fleetcode\u002Fnetwork\u002Fmembers\">\u003Cimg src=\"https:\u002F\u002Fimg.shields.io\u002Fgithub\u002Fforks\u002Fdoocs\u002Fleetcode?color=4051B5&logo=github&style=flat-square\" alt=\"forks\">\u003C\u002Fa>\n  \u003Ca href=\"https:\u002F\u002Fopencollective.com\u002Fdoocs-leetcode\" alt=\"backers on Open Collective\">\u003Cimg src=\"https:\u002F\u002Fimg.shields.io\u002Fopencollective\u002Fbackers\u002Fdoocs-leetcode?color=4051B5&style=flat-square&logo=open%20collective&logoColor=ffffff\" \u002F>\u003C\u002Fa>\n\u003C\u002Fp>\n\n## 介绍\n\n本项目包含 LeetCode、《剑指 Offer（第 2 版）》、《剑指 Offer（专项突击版）》、《程序员面试金典（第 6 版）》等题目的相关题解。所有题解均由多种编程语言实现，包括但不限于：Java、Python、C++、Go、TypeScript、Rust。我们正在全力更新，欢迎 Star 🌟 关注[本项目](https:\u002F\u002Fgithub.com\u002Fdoocs\u002Fleetcode)，获取项目最新动态。\n\n[English Version](\u002FREADME_EN.md)\n\n## 站点\n\n\u003Chttps:\u002F\u002Fleetcode.doocs.org>\n\n## 算法全解\n\n- [LeetCode](\u002Fsolution\u002FREADME.md)\n- [往期竞赛合集](\u002Fsolution\u002FCONTEST_README.md)\n- [剑指 Offer（第 2 版）](\u002Flcof\u002FREADME.md)\n- [剑指 Offer（专项突击版）](\u002Flcof2\u002FREADME.md)\n- [程序员面试金典（第 6 版）](\u002Flcci\u002FREADME.md)\n\n## 专项突破\n\n- [JavaScript 专项练习](\u002Fsolution\u002FJAVASCRIPT_README.md)\n- [数据库专项练习](\u002Fsolution\u002FDATABASE_README.md)\n\n## 算法提升专题\n\n### 1. 基础算法\n\n- [在排序数组中查找元素的第一个和最后一个位置](\u002Fsolution\u002F0000-0099\u002F0034.Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array\u002FREADME.md) - `二分查找`\n- [准时到达的列车最小时速](\u002Fsolution\u002F1800-1899\u002F1870.Minimum%20Speed%20to%20Arrive%20on%20Time\u002FREADME.md) - `二分查找`\n- [可移除字符的最大数目](\u002Fsolution\u002F1800-1899\u002F1898.Maximum%20Number%20of%20Removable%20Characters\u002FREADME.md) - `二分查找`\n- [排序数组](\u002Fsolution\u002F0900-0999\u002F0912.Sort%20an%20Array\u002FREADME.md) - `快速排序`、`归并排序`\n- [字符串相加](\u002Fsolution\u002F0400-0499\u002F0415.Add%20Strings\u002FREADME.md) - `高精度加法`\n- [字符串相乘](\u002Fsolution\u002F0000-0099\u002F0043.Multiply%20Strings\u002FREADME.md) - `高精度乘法`\n- [区域和检索 - 数组不可变](\u002Fsolution\u002F0300-0399\u002F0303.Range%20Sum%20Query%20-%20Immutable\u002FREADME.md) - `前缀和`\n- [二维区域和检索 - 矩阵不可变](\u002Fsolution\u002F0300-0399\u002F0304.Range%20Sum%20Query%202D%20-%20Immutable\u002FREADME.md) - `二维前缀和`\n- [区间加法](\u002Fsolution\u002F0300-0399\u002F0370.Range%20Addition\u002FREADME.md) - `前缀和`、`差分`\n- [用邮票贴满网格图](\u002Fsolution\u002F2100-2199\u002F2132.Stamping%20the%20Grid\u002FREADME.md) - `二维前缀和`、`二维差分`\n- [无重复字符的最长子串](\u002Fsolution\u002F0000-0099\u002F0003.Longest%20Substring%20Without%20Repeating%20Characters\u002FREADME.md) - `双指针`、`哈希表`\n- [乘积小于 K 的子数组](\u002Fsolution\u002F0700-0799\u002F0713.Subarray%20Product%20Less%20Than%20K\u002FREADME.md) - `双指针`\n- [位 1 的个数](\u002Fsolution\u002F0100-0199\u002F0191.Number%20of%201%20Bits\u002FREADME.md) - `位运算`、`lowbit`\n- [合并区间](\u002Fsolution\u002F0000-0099\u002F0056.Merge%20Intervals\u002FREADME.md) - `区间合并`\n\n### 2. 数据结构\n\n- [设计链表](\u002Fsolution\u002F0700-0799\u002F0707.Design%20Linked%20List\u002FREADME.md) - `单链表`、`指针引用`、`数组实现`\n- [下一个更大元素 I](\u002Fsolution\u002F0400-0499\u002F0496.Next%20Greater%20Element%20I\u002FREADME.md) - `单调栈`\n- [每日温度](\u002Fsolution\u002F0700-0799\u002F0739.Daily%20Temperatures\u002FREADME.md) - `单调栈`\n- [子数组的最小值之和](\u002Fsolution\u002F0900-0999\u002F0907.Sum%20of%20Subarray%20Minimums\u002FREADME.md) - `单调栈`\n- [最大宽度坡](\u002Fsolution\u002F0900-0999\u002F0962.Maximum%20Width%20Ramp\u002FREADME.md) - `单调栈`\n- [最多能完成排序的块 II](\u002Fsolution\u002F0700-0799\u002F0768.Max%20Chunks%20To%20Make%20Sorted%20II\u002FREADME.md) - `单调栈`\n- [子数组范围和](\u002Fsolution\u002F2100-2199\u002F2104.Sum%20of%20Subarray%20Ranges\u002FREADME.md) - `单调栈`\n- [子数组最小乘积的最大值](\u002Fsolution\u002F1800-1899\u002F1856.Maximum%20Subarray%20Min-Product\u002FREADME.md) - `单调栈`\n- [滑动窗口最大值](\u002Fsolution\u002F0200-0299\u002F0239.Sliding%20Window%20Maximum\u002FREADME.md) - `单调队列`\n- [满足不等式的最大值](\u002Fsolution\u002F1400-1499\u002F1499.Max%20Value%20of%20Equation\u002FREADME.md) - `单调队列`\n- [和至少为 K 的最短子数组](\u002Fsolution\u002F0800-0899\u002F0862.Shortest%20Subarray%20with%20Sum%20at%20Least%20K\u002FREADME.md) - `单调队列`\n- [带限制的子序列和](\u002Fsolution\u002F1400-1499\u002F1425.Constrained%20Subsequence%20Sum\u002FREADME.md) - `动态规划`、`单调队列优化`\n- [单词规律 II](\u002Fsolution\u002F0200-0299\u002F0291.Word%20Pattern%20II\u002FREADME.md) - `哈希表`、`回溯`\n- [最短回文串](\u002Fsolution\u002F0200-0299\u002F0214.Shortest%20Palindrome\u002FREADME.md) - `字符串哈希`\n- [回文对](\u002Fsolution\u002F0300-0399\u002F0336.Palindrome%20Pairs\u002FREADME.md) - `字符串哈希`\n- [最长重复子串](\u002Fsolution\u002F1000-1099\u002F1044.Longest%20Duplicate%20Substring\u002FREADME.md) - `字符串哈希`、`二分查找`\n- [不同的循环子字符串](\u002Fsolution\u002F1300-1399\u002F1316.Distinct%20Echo%20Substrings\u002FREADME.md) - `字符串哈希`\n\n### 3. 搜索\n\n- [图像渲染](\u002Fsolution\u002F0700-0799\u002F0733.Flood%20Fill\u002FREADME.md)- `BFS`、`DFS`、`Flood Fill 算法`、`连通性模型`\n- [岛屿数量](\u002Fsolution\u002F0200-0299\u002F0200.Number%20of%20Islands\u002FREADME.md) - `BFS`、`Flood Fill 算法`\n- [01 矩阵](\u002Fsolution\u002F0500-0599\u002F0542.01%20Matrix\u002FREADME.md) - `多源 BFS`\n- [地图中的最高点](\u002Fsolution\u002F1700-1799\u002F1765.Map%20of%20Highest%20Peak\u002FREADME.md) - `多源 BFS`\n- [进击的骑士](\u002Fsolution\u002F1100-1199\u002F1197.Minimum%20Knight%20Moves\u002FREADME.md) - `BFS`、`最短路模型`\n- [二进制矩阵中的最短路径](\u002Fsolution\u002F1000-1099\u002F1091.Shortest%20Path%20in%20Binary%20Matrix\u002FREADME.md) - `BFS`、`最短路模型`\n- [迷宫中离入口最近的出口](\u002Fsolution\u002F1900-1999\u002F1926.Nearest%20Exit%20from%20Entrance%20in%20Maze\u002FREADME.md) - `BFS`、`最短路模型`\n- [网格中的最短路径](\u002Fsolution\u002F1200-1299\u002F1293.Shortest%20Path%20in%20a%20Grid%20with%20Obstacles%20Elimination\u002FREADME.md) - `BFS`、`最短路模型`\n- [打开转盘锁](\u002Fsolution\u002F0700-0799\u002F0752.Open%20the%20Lock\u002FREADME.md) - `最小步数模型`、`双向 BFS`、`A* 算法`\n- [单词接龙](\u002Fsolution\u002F0100-0199\u002F0127.Word%20Ladder\u002FREADME.md) - `最小步数模型`、`双向 BFS`\n- [转化数字的最小运算数](\u002Fsolution\u002F2000-2099\u002F2059.Minimum%20Operations%20to%20Convert%20Number\u002FREADME.md) - `最小步数模型`、`双向 BFS`\n- [滑动谜题](\u002Fsolution\u002F0700-0799\u002F0773.Sliding%20Puzzle\u002FREADME.md) - `BFS`、`最小步数模型`、`A* 算法`\n- [访问所有节点的最短路径](\u002Fsolution\u002F0800-0899\u002F0847.Shortest%20Path%20Visiting%20All%20Nodes\u002FREADME.md) - `BFS`、`最小步数模型`、`A* 算法`\n- [为高尔夫比赛砍树](\u002Fsolution\u002F0600-0699\u002F0675.Cut%20Off%20Trees%20for%20Golf%20Event\u002FREADME.md) - `BFS`、`A* 算法`\n- [使网格图至少有一条有效路径的最小代价](\u002Fsolution\u002F1300-1399\u002F1368.Minimum%20Cost%20to%20Make%20at%20Least%20One%20Valid%20Path%20in%20a%20Grid\u002FREADME.md) - `双端队列 BFS`\n- [到达角落需要移除障碍物的最小数目](\u002Fsolution\u002F2200-2299\u002F2290.Minimum%20Obstacle%20Removal%20to%20Reach%20Corner\u002FREADME.md) - `双端队列 BFS`\n- [迷宫](\u002Fsolution\u002F0400-0499\u002F0490.The%20Maze\u002FREADME.md) - `DFS`、`连通性模型`、`Flood Fill 算法`\n- [单词搜索](\u002Fsolution\u002F0000-0099\u002F0079.Word%20Search\u002FREADME.md) - `DFS`、`搜索顺序`、`回溯`\n- [黄金矿工](\u002Fsolution\u002F1200-1299\u002F1219.Path%20with%20Maximum%20Gold\u002FREADME.md) - `DFS`、`搜索顺序`、`回溯`\n- [火柴拼正方形](\u002Fsolution\u002F0400-0499\u002F0473.Matchsticks%20to%20Square\u002FREADME.md) - `DFS`、`回溯`、`剪枝`\n- [划分为 k 个相等的子集](\u002Fsolution\u002F0600-0699\u002F0698.Partition%20to%20K%20Equal%20Sum%20Subsets\u002FREADME.md) - `DFS`、`回溯`、`剪枝`\n- [完成所有工作的最短时间](\u002Fsolution\u002F1700-1799\u002F1723.Find%20Minimum%20Time%20to%20Finish%20All%20Jobs\u002FREADME.md) - `DFS`、`回溯`、`剪枝`\n- [公平分发饼干](\u002Fsolution\u002F2300-2399\u002F2305.Fair%20Distribution%20of%20Cookies\u002FREADME.md) - `DFS`、`回溯`、`剪枝`\n- [矩阵中的最长递增路径](\u002Fsolution\u002F0300-0399\u002F0329.Longest%20Increasing%20Path%20in%20a%20Matrix\u002FREADME.md) - `DFS`、`记忆化搜索`\n- [网格图中递增路径的数目](\u002Fsolution\u002F2300-2399\u002F2328.Number%20of%20Increasing%20Paths%20in%20a%20Grid\u002FREADME.md) - `DFS`、`记忆化搜索`\n- [翻转游戏 II](\u002Fsolution\u002F0200-0299\u002F0294.Flip%20Game%20II\u002FREADME.md) - `DFS`、`状态压缩`、`记忆化搜索`\n- [统计所有可行路径](\u002Fsolution\u002F1500-1599\u002F1575.Count%20All%20Possible%20Routes\u002FREADME.md) - `DFS`、`记忆化搜索`\n- [切披萨的方案数](\u002Fsolution\u002F1400-1499\u002F1444.Number%20of%20Ways%20of%20Cutting%20a%20Pizza\u002FREADME.md) - `DFS`、`记忆化搜索`\n\n\u003C!-- DFS 待补充 -->\n\n### 4. 动态规划（DP）\n\n- [杨辉三角](\u002Fsolution\u002F0100-0199\u002F0118.Pascal's%20Triangle\u002FREADME.md) - `线性 DP`、`数字三角形模型`\n- [最小路径和](\u002Fsolution\u002F0000-0099\u002F0064.Minimum%20Path%20Sum\u002FREADME.md) - `线性 DP`、`数字三角形模型`\n- [摘樱桃](\u002Fsolution\u002F0700-0799\u002F0741.Cherry%20Pickup\u002FREADME.md) - `线性 DP`、`数字三角形模型`\n- [摘樱桃 II](\u002Fsolution\u002F1400-1499\u002F1463.Cherry%20Pickup%20II\u002FREADME.md) - `线性 DP`、`数字三角形模型`\n- [最长递增子序列](\u002Fsolution\u002F0300-0399\u002F0300.Longest%20Increasing%20Subsequence\u002FREADME.md) - `线性 DP`、`最长上升子序列模型`\n- [无重叠区间](\u002Fsolution\u002F0400-0499\u002F0435.Non-overlapping%20Intervals\u002FREADME.md) - `线性 DP`、`最长上升子序列模型`、`贪心优化`\n- [删列造序 III](\u002Fsolution\u002F0900-0999\u002F0960.Delete%20Columns%20to%20Make%20Sorted%20III\u002FREADME.md) - `线性 DP`、`最长上升子序列模型`\n- [俄罗斯套娃信封问题](\u002Fsolution\u002F0300-0399\u002F0354.Russian%20Doll%20Envelopes\u002FREADME.md) - `线性 DP`、`最长上升子序列模型`、`贪心优化`\n- [堆叠长方体的最大高度](\u002Fsolution\u002F1600-1699\u002F1691.Maximum%20Height%20by%20Stacking%20Cuboids\u002FREADME.md) - `排序`、`线性 DP`、`最长上升子序列模型`\n- [无矛盾的最佳球队](\u002Fsolution\u002F1600-1699\u002F1626.Best%20Team%20With%20No%20Conflicts\u002FREADME.md) - `排序`、`线性 DP`、`最长上升子序列模型`\n- [最长公共子序列](\u002Fsolution\u002F1100-1199\u002F1143.Longest%20Common%20Subsequence\u002FREADME.md) - `线性 DP`、`最长公共子序列模型`\n- [两个字符串的最小 ASCII 删除和](\u002Fsolution\u002F0700-0799\u002F0712.Minimum%20ASCII%20Delete%20Sum%20for%20Two%20Strings\u002FREADME.md) - `线性 DP`、`最长公共子序列模型`\n- [两个字符串的删除操作](\u002Fsolution\u002F0500-0599\u002F0583.Delete%20Operation%20for%20Two%20Strings\u002FREADME.md) - `线性 DP`、`最长公共子序列模型`\n- [目标和](\u002Fsolution\u002F0400-0499\u002F0494.Target%20Sum\u002FREADME.md) - `0-1 背包问题`\n- [分割等和子集](\u002Fsolution\u002F0400-0499\u002F0416.Partition%20Equal%20Subset%20Sum\u002FREADME.md) - `0-1 背包问题`\n- [最后一块石头的重量 II](\u002Fsolution\u002F1000-1099\u002F1049.Last%20Stone%20Weight%20II\u002FREADME.md) - `0-1 背包问题`\n- [零钱兑换](\u002Fsolution\u002F0300-0399\u002F0322.Coin%20Change\u002FREADME.md) - `完全背包问题`\n- [组合总和 Ⅳ](\u002Fsolution\u002F0300-0399\u002F0377.Combination%20Sum%20IV\u002FREADME.md) - `完全背包问题`\n- [从栈中取出 K 个硬币的最大面值和](\u002Fsolution\u002F2200-2299\u002F2218.Maximum%20Value%20of%20K%20Coins%20From%20Piles\u002FREADME.md) - `分组背包问题`\n- [数字 1 的个数](\u002Fsolution\u002F0200-0299\u002F0233.Number%20of%20Digit%20One\u002FREADME.md) - `数位 DP`、`记忆化搜索`\n- [统计各位数字都不同的数字个数](\u002Fsolution\u002F0300-0399\u002F0357.Count%20Numbers%20with%20Unique%20Digits\u002FREADME.md) - `数位 DP`、`记忆化搜索`、`状态压缩`\n- [不含连续 1 的非负整数](\u002Fsolution\u002F0600-0699\u002F0600.Non-negative%20Integers%20without%20Consecutive%20Ones\u002FREADME.md) - `数位 DP`、`记忆化搜索`\n- [旋转数字](\u002Fsolution\u002F0700-0799\u002F0788.Rotated%20Digits\u002FREADME.md) - `数位 DP`、`记忆化搜索`\n- [最大为 N 的数字组合](\u002Fsolution\u002F0900-0999\u002F0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set\u002FREADME.md) - `数位 DP`、`记忆化搜索`\n- [统计特殊整数](\u002Fsolution\u002F2300-2399\u002F2376.Count%20Special%20Integers\u002FREADME.md) - `数位 DP`、`记忆化搜索`\n\n\u003C!-- 背包问题、状态机模型、状压DP、区间DP、树形DP、数位DP 待补充 -->\n\n### 5. 高级数据结构\n\n- [二维网格图中探测环](\u002Fsolution\u002F1500-1599\u002F1559.Detect%20Cycles%20in%202D%20Grid\u002FREADME.md) - `并查集`、`检测环`\n- [除法求值](\u002Fsolution\u002F0300-0399\u002F0399.Evaluate%20Division\u002FREADME.md) - `并查集`、`权值维护`\n- [由斜杠划分区域](\u002Fsolution\u002F0900-0999\u002F0959.Regions%20Cut%20By%20Slashes\u002FREADME.md) - `并查集`、`连通分量个数`\n- [水位上升的泳池中游泳](\u002Fsolution\u002F0700-0799\u002F0778.Swim%20in%20Rising%20Water\u002FREADME.md) - `并查集`\n- [交换字符串中的元素](\u002Fsolution\u002F1200-1299\u002F1202.Smallest%20String%20With%20Swaps\u002FREADME.md) - `并查集`\n- [打砖块](\u002Fsolution\u002F0800-0899\u002F0803.Bricks%20Falling%20When%20Hit\u002FREADME.md) - `并查集`、`逆向思维`\n- [尽量减少恶意软件的传播 II](\u002Fsolution\u002F0900-0999\u002F0928.Minimize%20Malware%20Spread%20II\u002FREADME.md) - `并查集`、`逆向思维`\n- [检查边长度限制的路径是否存在](\u002Fsolution\u002F1600-1699\u002F1697.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths\u002FREADME.md) - `并查集`、`离线思维`\n- [保证图可完全遍历](\u002Fsolution\u002F1500-1599\u002F1579.Remove%20Max%20Number%20of%20Edges%20to%20Keep%20Graph%20Fully%20Traversable\u002FREADME.md) - `双并查集`\n- [区域和检索 - 数组可修改](\u002Fsolution\u002F0300-0399\u002F0307.Range%20Sum%20Query%20-%20Mutable\u002FREADME.md) - `树状数组`、`线段树`\n- [通过指令创建有序数组](\u002Fsolution\u002F1600-1699\u002F1649.Create%20Sorted%20Array%20through%20Instructions\u002FREADME.md) - `树状数组`、`线段树`\n- [统计数组中好三元组数目](\u002Fsolution\u002F2100-2199\u002F2179.Count%20Good%20Triplets%20in%20an%20Array\u002FREADME.md) - `树状数组`、`线段树`\n- [最多 K 次交换相邻数位后得到的最小整数](\u002Fsolution\u002F1500-1599\u002F1505.Minimum%20Possible%20Integer%20After%20at%20Most%20K%20Adjacent%20Swaps%20On%20Digits\u002FREADME.md) - `树状数组`\n- [二维区域和检索 - 可变](\u002Fsolution\u002F0300-0399\u002F0308.Range%20Sum%20Query%202D%20-%20Mutable\u002FREADME.md) - `二维树状数组`、`线段树`\n- [计算右侧小于当前元素的个数](\u002Fsolution\u002F0300-0399\u002F0315.Count%20of%20Smaller%20Numbers%20After%20Self\u002FREADME.md) - `离散化树状数组`、`线段树`\n- [区间和的个数](\u002Fsolution\u002F0300-0399\u002F0327.Count%20of%20Range%20Sum\u002FREADME.md) - `离散化树状数组`、`线段树`\n- [翻转对](\u002Fsolution\u002F0400-0499\u002F0493.Reverse%20Pairs\u002FREADME.md) - `离散化树状数组`、`分治归并`、`线段树`\n- [最长递增子序列的个数](\u002Fsolution\u002F0600-0699\u002F0673.Number%20of%20Longest%20Increasing%20Subsequence\u002FREADME.md) - `离散化树状数组`、`区间最值问题`\n- [奇妙序列](\u002Fsolution\u002F1600-1699\u002F1622.Fancy%20Sequence\u002FREADME.md) - `动态开点线段树`、`懒标记`\n- [Range 模块](\u002Fsolution\u002F0700-0799\u002F0715.Range%20Module\u002FREADME.md) - `动态开点线段树`、`懒标记`\n- [我的日程安排表 III](\u002Fsolution\u002F0700-0799\u002F0732.My%20Calendar%20III\u002FREADME.md) - `动态开点线段树`、`懒标记`\n- [每天绘制的新区域数量](\u002Fsolution\u002F2100-2199\u002F2158.Amount%20of%20New%20Area%20Painted%20Each%20Day\u002FREADME.md) - `动态开点线段树`、`懒标记`、`区间染色模型`\n- [由单个字符重复的最长子字符串](\u002Fsolution\u002F2200-2299\u002F2213.Longest%20Substring%20of%20One%20Repeating%20Character\u002FREADME.md) - `线段树`、`动态最大子段和模型`\n- [矩形面积 II](\u002Fsolution\u002F0800-0899\u002F0850.Rectangle%20Area%20II\u002FREADME.md) - `线段树`、`离散化`、`扫描线`\n\n### 6. 图论\n\n- [网络延迟时间](\u002Fsolution\u002F0700-0799\u002F0743.Network%20Delay%20Time\u002FREADME.md) - `最短路`、`Dijkstra 算法`、`Bellman Ford 算法`、`SPFA 算法`\n- [得到要求路径的最小带权子图](\u002Fsolution\u002F2200-2299\u002F2203.Minimum%20Weighted%20Subgraph%20With%20the%20Required%20Paths\u002FREADME.md) - `最短路`、`Dijkstra 算法`\n- [连接所有点的最小费用](\u002Fsolution\u002F1500-1599\u002F1584.Min%20Cost%20to%20Connect%20All%20Points\u002FREADME.md) - `最小生成树`、`Prim 算法`、`Kruskal 算法`\n- [最低成本联通所有城市](\u002Fsolution\u002F1100-1199\u002F1135.Connecting%20Cities%20With%20Minimum%20Cost\u002FREADME.md) - `最小生成树`、`Kruskal 算法`、`并查集`\n- [水资源分配优化](\u002Fsolution\u002F1100-1199\u002F1168.Optimize%20Water%20Distribution%20in%20a%20Village\u002FREADME.md) - `最小生成树`、`Kruskal 算法`、`并查集`\n- [找到最小生成树里的关键边和伪关键边](\u002Fsolution\u002F1400-1499\u002F1489.Find%20Critical%20and%20Pseudo-Critical%20Edges%20in%20Minimum%20Spanning%20Tree\u002FREADME.md) - `最小生成树`、`Kruskal 算法`、`并查集`\n- [判断二分图](\u002Fsolution\u002F0700-0799\u002F0785.Is%20Graph%20Bipartite\u002FREADME.md) - `染色法判定二分图`、`并查集`\n\n\u003C!-- 待补充\n### 7. 数学知识\n -->\n\n## 加入我们\n\n刷编程题的最大好处就是可以锻炼解决问题的思维能力。相信我，「如何去思考」​ 本身也是一项需要不断学习和练习的技能。非常感谢前微软工程师、现蚂蚁金服技术专家 [@kfstorm](https:\u002F\u002Fgithub.com\u002Fkfstorm) 贡献了本项目的所有 [C# 题解](https:\u002F\u002Fgithub.com\u002Fdoocs\u002Fleetcode\u002Fpull\u002F245)。\n\n如果你对本项目感兴趣，并且希望加入我们刷题小分队，欢迎随时提交 [PR](https:\u002F\u002Fgithub.com\u002Fdoocs\u002Fleetcode\u002Fpulls)。请参考如下步骤：\n\n1. 将本项目 fork 到你的个人 GitHub 帐户，然后 clone 到你的本地机器；\n1. 进入 leetcode 目录，切换到一个新的分支；\n1. 对项目做出一些变更，然后使用 git add、commit、push 等命令将你的本地变更提交到你的远程 GitHub 仓库；\n1. 将你的变更以 PR 的形式提交过来，项目的维护人员会在第一时间对你的变更进行 review！\n1. 你也可以参考帮助文档 \u003Chttps:\u002F\u002Fhelp.github.com\u002Fcn> 了解更多细节。\n\n\u003Cdiv align=\"center\">\n  \u003Cimg src=\"https:\u002F\u002Fcdn-doocs.oss-cn-shenzhen.aliyuncs.com\u002Fgh\u002Fdoocs\u002Fleetcode%40main\u002Fimages\u002Fpr.svg\" width=\"320px\"\u002F>\n\u003C\u002Fdiv>\n\n[![Open in GitHub Codespaces](https:\u002F\u002Fgithub.com\u002Fcodespaces\u002Fbadge.svg)](https:\u002F\u002Fgithub.com\u002Fcodespaces\u002Fnew?hide_repo_select=true&ref=main&repo=149001365&machine=basicLinux32gb&location=SoutheastAsia)\n\n## Stars 趋势\n\n\u003Ca href=\"https:\u002F\u002Fgithub.com\u002Fdoocs\u002Fleetcode\u002Fstargazers\" target=\"_blank\">\u003Cimg src=\".\u002Fimages\u002Fstarcharts.svg\" alt=\"Stargazers over time\" \u002F>\u003C\u002Fa>\n\n\u003Ca href=\"https:\u002F\u002Fnext.ossinsight.io\u002Fwidgets\u002Fofficial\u002Fanalyze-repo-stars-map?repo_id=149001365&activity=stars\" target=\"_blank\" style=\"display: block\" align=\"center\">\n  \u003Cpicture>\n    \u003Csource media=\"(prefers-color-scheme: dark)\" srcset=\"https:\u002F\u002Fnext.ossinsight.io\u002Fwidgets\u002Fofficial\u002Fanalyze-repo-stars-map\u002Fthumbnail.png?repo_id=149001365&activity=stars&image_size=auto&color_scheme=dark\" width=\"721\" height=\"auto\">\n    \u003Cimg alt=\"Star Geographical Distribution of doocs\u002Fleetcode\" src=\"https:\u002F\u002Fnext.ossinsight.io\u002Fwidgets\u002Fofficial\u002Fanalyze-repo-stars-map\u002Fthumbnail.png?repo_id=149001365&activity=stars&image_size=auto&color_scheme=light\" width=\"721\" height=\"auto\">\n  \u003C\u002Fpicture>\n\u003C\u002Fa>\n\n## 贡献者\n\n感谢以下所有朋友对本项目的贡献！\n\n\u003Ca href=\"https:\u002F\u002Fgithub.com\u002Fdoocs\u002Fleetcode\u002Fgraphs\u002Fcontributors\" target=\"_blank\">\u003Cimg src=\"https:\u002F\u002Fcontrib.rocks\u002Fimage?repo=doocs\u002Fleetcode&max=500\" \u002F>\u003C\u002Fa>\n\n## 版权\n\n本项目著作权归 [GitHub 开源社区 Doocs](https:\u002F\u002Fgithub.com\u002Fdoocs) 所有，商业转载请联系 @yanglbme 获得授权，非商业转载请注明出处。\n\n## 联系我们 & 支持项目\n\n欢迎各位小伙伴们添加 @yanglbme 的个人微信（微信号：YLB0109），备注 「**leetcode**」。后续我们会创建算法、技术相关的交流群，大家一起交流学习，分享经验，共同进步。\n\n如果你觉得这个项目对你有帮助，也欢迎通过微信扫码赞赏我们 ☕️ ～\n\n| \u003Cimg src=\"https:\u002F\u002Fcdn-doocs.oss-cn-shenzhen.aliyuncs.com\u002Fgh\u002Fdoocs\u002Fimages\u002Fqrcode-for-yanglbme.png\" width=\"260px\" align=\"center\"\u002F> | \u003Cimg src=\"https:\u002F\u002Fcdn-doocs.oss-cn-shenzhen.aliyuncs.com\u002Fgh\u002Fdoocs\u002Fleetcode%40main\u002Fimages\u002Fsupport1.jpg\" width=\"260px\" align=\"center\"\u002F> |\n| -------------------------------------------------------------------------------------------------------------------------------- | ------------------------------------------------------------------------------------------------------------------------------------- |\n\n## 许可证\n\n\u003Ca rel=\"license\" href=\"http:\u002F\u002Fcreativecommons.org\u002Flicenses\u002Fby-sa\u002F4.0\u002F\">知识共享 版权归属-相同方式共享 4.0 国际 公共许可证\u003C\u002Fa>\n","doocs\u002Fleetcode 是一个提供多种编程语言实现的 LeetCode、《剑指 Offer（第 2 版）》和《程序员面试金典（第 6 版）》等题目的题解项目。该项目支持 Java、Python、C++、Go、TypeScript 和 Rust 等多种编程语言，每道题目都有详细的代码实现与解析，帮助开发者更好地理解和掌握算法知识。无论是准备技术面试还是提升个人算法能力，这个项目都是一个宝贵的资源库。此外，项目持续更新，并且开源社区活跃，便于用户获取最新内容和技术支持。","2026-06-11 02:44:40","top_all"]