From f9e2d8072cc59530876a562169c422a32afa5243 Mon Sep 17 00:00:00 2001 From: "github-actions[bot]" <41898282+github-actions[bot]@users.noreply.github.com> Date: Sun, 2 Aug 2026 20:05:43 +0000 Subject: [PATCH] =?UTF-8?q?fix(docs):=20=E4=BF=AE=E5=9B=9E=2033=20?= =?UTF-8?q?=E7=AF=87=E4=B8=AD=E6=96=87=E6=96=87=E6=A1=A3=E8=A2=AB=E6=9C=BA?= =?UTF-8?q?=E7=BF=BB=E6=AF=81=E6=8E=89=E7=9A=84=20title?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit 这批文档的 frontmatter title 是早期机翻残留，正文是中文、标题却是 乱码英文，最离谱的几个： 213.Hiccup II → 213. 打家劫舍 II（打嗝…） Sword finger Offer II 021. … → 剑指 Offer II 021. 删除链表的倒数第 n 个结点 2679.In the matrix and the harmony.md → 2679. 矩阵中的和 76Minimum cover string.md → 76. 最小覆盖子串 title 是页面

和 、sitemap.xml、站内搜索索引、以及新加的 /llms.txt 索引的取值来源，所以这批坏标题同时在坑人和坑搜索/AI 抓取。 还有一批标题干脆把文件名连 .md 后缀一起塞了进去。 正确标题不用外部查询，仓库自己就有： - 30 篇的 description 已经写成 "LeetCode <编号>. <中文标题> 题解 — …" （lib/seo-description.ts 那轮补全的产物），直接从里面取 - 3 篇从文件名里的中文还原 description 比文件名更可信：[121] 那篇文件名写的是"最佳时期"， description 里是官方译名"最佳时机"，取了后者。 只改 title，其余 frontmatter（docId / abbrlink / tags / date）一个字节没动， .en.md 英文版保持英文标题不动。33 篇全部通过 YAML 解析校验。 注：这些文件的正文同样是机翻残留（"Today's daily question is too difficult， So find the problem by yourself。"），且部分与 .en.md 重复；那是另一件事， 本次不碰。 --- .../docs/career/interview-prep/leetcode/1004_translated.md | 2 +- ...241\241\345\255\227\347\254\246\344\270\262_translated.md" | 2 +- ...6\257\345\275\242\351\223\276\350\241\250II_translated.md" | 2 +- ...210\240\351\231\244\346\254\241\346\225\260_translated.md" | 2 +- ...232\204\346\226\271\346\241\210\346\225\260_translated.md" | 2 +- ...272 MK \345\271\263\345\235\207\345\200\274_translated.md" | 2 +- ...202\271\347\232\204\346\225\260\347\233\256_translated.md" | 2 +- content/docs/career/interview-prep/leetcode/219_translated.md | 2 +- .../docs/career/interview-prep/leetcode/2293_translated.md | 2 +- ...0\201\346\243\200\351\252\214\345\231\250II_translated.md" | 2 +- ...213\261\346\226\207\345\255\227\346\257\215_translated.md" | 4 +--- ...237\255\346\200\273\346\227\266\351\225\277_translated.md" | 2 +- ...244\232\345\260\221\346\225\260\345\257\271_translated.md" | 2 +- ...210\227\347\232\204\345\256\275\345\272\246_translated.md" | 2 +- ...230\265\344\270\255\347\232\204\345\222\214_translated.md" | 2 +- ...\252\346\225\260\347\273\204\344\270\255 II_translated.md" | 2 +- ...205\203\351\237\263\345\255\227\346\257\215_translated.md" | 2 +- ...270\272\347\264\257\345\212\240\346\240\221_translated.md" | 2 +- ...244\232\347\232\204\345\204\277\347\253\245_translated.md" | 2 +- ...246\206\347\233\226\345\255\220\344\270\262_translated.md" | 2 +- content/docs/career/interview-prep/leetcode/80_translated.md | 2 +- .../docs/career/interview-prep/leetcode/9021_TUT_3_25T1.md | 2 +- ...203\202\347\232\204\346\251\230\345\255\220_translated.md" | 2 +- .../leetcode/Counting Stars-Inter-Uni Programming Contest.md | 2 +- ...234\200\344\275\263\346\227\266\346\234\237_translated.md" | 2 +- ...216\205\350\277\207\346\273\244\345\231\250_translated.md" | 2 +- .../leetcode/[146]LRU \347\274\223\345\255\230_translated.md" | 2 +- ...\223\345\256\266\345\212\253\350\210\215 II_translated.md" | 2 +- .../[2490]\345\233\236\347\216\257\345\217\245_translated.md" | 2 +- ...232\204\344\270\262\350\201\224\345\200\274_translated.md" | 2 +- .../[2582]\351\200\222\346\236\225\345\244\264_translated.md" | 2 +- ...275\234\344\270\232\345\270\256\345\277\231_translated.md" | 2 +- ...\254 n \344\270\252\347\273\223\347\202\271_translated.md" | 2 +- 33 files changed, 33 insertions(+), 35 deletions(-) diff --git a/content/docs/career/interview-prep/leetcode/1004_translated.md b/content/docs/career/interview-prep/leetcode/1004_translated.md index 7263adf5..fe09b259 100644 --- a/content/docs/career/interview-prep/leetcode/1004_translated.md +++ b/content/docs/career/interview-prep/leetcode/1004_translated.md @@ -1,5 +1,5 @@ --- -title: 1004.Maximum continuity1Number III Maximum continuity1Number III +title: "1004. 最大连续1的个数 III" description: "LeetCode 1004. 最大连续1的个数 III 题解 — 滑动窗口与双指针解法，核心技巧在于维护窗口内最多翻转 K 个 0，通过动态调整左右指针实现最长连续 1 子数组。适合准备算法面试、刷题进阶的 CS 求职者与 AI 学习者。" date: "2022.12.07-01:15" tags: diff --git "a/content/docs/career/interview-prep/leetcode/1234. \346\233\277\346\215\242\345\255\220\344\270\262\345\276\227\345\210\260\345\271\263\350\241\241\345\255\227\347\254\246\344\270\262_translated.md" "b/content/docs/career/interview-prep/leetcode/1234. \346\233\277\346\215\242\345\255\220\344\270\262\345\276\227\345\210\260\345\271\263\350\241\241\345\255\227\347\254\246\344\270\262_translated.md" index a0e90be7..bd838e91 100644 --- "a/content/docs/career/interview-prep/leetcode/1234. \346\233\277\346\215\242\345\255\220\344\270\262\345\276\227\345\210\260\345\271\263\350\241\241\345\255\227\347\254\246\344\270\262_translated.md" +++ "b/content/docs/career/interview-prep/leetcode/1234. \346\233\277\346\215\242\345\255\220\344\270\262\345\276\227\345\210\260\345\271\263\350\241\241\345\255\227\347\254\246\344\270\262_translated.md" @@ -1,5 +1,5 @@ --- -title: 1234. Replace the sub -string to get a balanced string One question daily +title: "1234. 替换子串得到平衡字符串" description: "LeetCode 1234. 替换子串得到平衡字符串 题解 — 使用同向双指针（滑动窗口）维护待替换子串，核心技巧是检查窗口外各字符出现次数是否均不超过 n/4，从而找到最小替换长度。适合备战面试、刷滑动窗口与字符串平衡类题目的算法学习者。" date: "2024.01.01 0:00" tags: diff --git "a/content/docs/career/interview-prep/leetcode/142.\347\216\257\345\275\242\351\223\276\350\241\250II_translated.md" "b/content/docs/career/interview-prep/leetcode/142.\347\216\257\345\275\242\351\223\276\350\241\250II_translated.md" index 5f42da65..3691a0cd 100644 --- "a/content/docs/career/interview-prep/leetcode/142.\347\216\257\345\275\242\351\223\276\350\241\250II_translated.md" +++ "b/content/docs/career/interview-prep/leetcode/142.\347\216\257\345\275\242\351\223\276\350\241\250II_translated.md" @@ -1,5 +1,5 @@ --- -title: 142.Ring linkedII.md +title: "142. 环形链表 II" description: "LeetCode 142. 环形链表 II 题解 — 使用快慢双指针检测链表环入口，核心技巧是相遇后重置慢指针到头节点、同步步进直至再次相遇。适合准备算法面试、刷链表题型的 CS 求职者与 LeetCode 学习者阅读。" date: "2024.01.01 0:00" tags: diff --git "a/content/docs/career/interview-prep/leetcode/1653. \344\275\277\345\255\227\347\254\246\344\270\262\345\271\263\350\241\241\347\232\204\346\234\200\345\260\221\345\210\240\351\231\244\346\254\241\346\225\260_translated.md" "b/content/docs/career/interview-prep/leetcode/1653. \344\275\277\345\255\227\347\254\246\344\270\262\345\271\263\350\241\241\347\232\204\346\234\200\345\260\221\345\210\240\351\231\244\346\254\241\346\225\260_translated.md" index 96799c27..bb4012e7 100644 --- "a/content/docs/career/interview-prep/leetcode/1653. \344\275\277\345\255\227\347\254\246\344\270\262\345\271\263\350\241\241\347\232\204\346\234\200\345\260\221\345\210\240\351\231\244\346\254\241\346\225\260_translated.md" +++ "b/content/docs/career/interview-prep/leetcode/1653. \344\275\277\345\255\227\347\254\246\344\270\262\345\271\263\350\241\241\347\232\204\346\234\200\345\260\221\345\210\240\351\231\244\346\254\241\346\225\260_translated.md" @@ -1,5 +1,5 @@ --- -title: 1653. The minimum number of times to balance the string balance.md +title: "1653. 使字符串平衡的最少删除次数" description: "LeetCode 1653. 使字符串平衡的最少删除次数题解 — 通过动态规划与状态机思想，将字符映射为数值（(c - 'a') * 2 - 1）消除分支预测失败，提升执行效率。详解如何用一次遍历与最小前缀/后缀计数，计算删除最少字符使字符串中所有 a 在 b 之后。适合备战面试、追求高性能解法的 LeetCode 刷题者与算法竞赛选手。" date: "2024.01.01 0:00" tags: diff --git "a/content/docs/career/interview-prep/leetcode/1664\347\224\237\346\210\220\345\271\263\350\241\241\346\225\260\347\273\204\347\232\204\346\226\271\346\241\210\346\225\260_translated.md" "b/content/docs/career/interview-prep/leetcode/1664\347\224\237\346\210\220\345\271\263\350\241\241\346\225\260\347\273\204\347\232\204\346\226\271\346\241\210\346\225\260_translated.md" index c40ea629..19d717ae 100644 --- "a/content/docs/career/interview-prep/leetcode/1664\347\224\237\346\210\220\345\271\263\350\241\241\346\225\260\347\273\204\347\232\204\346\226\271\346\241\210\346\225\260_translated.md" +++ "b/content/docs/career/interview-prep/leetcode/1664\347\224\237\346\210\220\345\271\263\350\241\241\346\225\260\347\273\204\347\232\204\346\226\271\346\241\210\346\225\260_translated.md" @@ -1,5 +1,5 @@ --- -title: 1664. Number of schemes to generate balance numbers One question daily +title: "1664. 生成平衡数组的方案数" description: "LeetCode 1664. 生成平衡数组的方案数 题解 — 使用动态规划与奇偶性分析，核心技巧是预处理前缀奇偶和与后缀奇偶和，在枚举删除每个元素时 O(1) 判断剩余数组奇偶下标和是否相等。适合准备算法面试、刷 LeetCode 中等题的求职者和 CS 学生。" date: "2024.01.01 0:00" tags: diff --git "a/content/docs/career/interview-prep/leetcode/1825\346\261\202\345\207\272 MK \345\271\263\345\235\207\345\200\274_translated.md" "b/content/docs/career/interview-prep/leetcode/1825\346\261\202\345\207\272 MK \345\271\263\345\235\207\345\200\274_translated.md" index 758ccacc..9ae6a8e4 100644 --- "a/content/docs/career/interview-prep/leetcode/1825\346\261\202\345\207\272 MK \345\271\263\345\235\207\345\200\274_translated.md" +++ "b/content/docs/career/interview-prep/leetcode/1825\346\261\202\345\207\272 MK \345\271\263\345\235\207\345\200\274_translated.md" @@ -1,5 +1,5 @@ --- -title: 1825. Seek out MK average value +title: "1825. 求出 MK 平均值" description: "LeetCode 1825. 求出 MK 平均值 题解 — 使用三个 multiset 维护滑动窗口中的最小值、中间值和最大值集合，通过平衡插入与删除操作保持 lower 和 upper 各含 k 个元素，并实时维护 middle 的元素和以 O(log n) 计算剔除首尾 k 个后的平均值。适合准备系统设计面试或需要掌握有序集合与滑动窗口技巧的算法学习者。" date: "2024.01.01 0:00" tags: diff --git "a/content/docs/career/interview-prep/leetcode/1828\347\273\237\350\256\241\344\270\200\344\270\252\345\234\206\344\270\255\347\202\271\347\232\204\346\225\260\347\233\256_translated.md" "b/content/docs/career/interview-prep/leetcode/1828\347\273\237\350\256\241\344\270\200\344\270\252\345\234\206\344\270\255\347\202\271\347\232\204\346\225\260\347\233\256_translated.md" index fa090655..92d2c9e1 100644 --- "a/content/docs/career/interview-prep/leetcode/1828\347\273\237\350\256\241\344\270\200\344\270\252\345\234\206\344\270\255\347\202\271\347\232\204\346\225\260\347\233\256_translated.md" +++ "b/content/docs/career/interview-prep/leetcode/1828\347\273\237\350\256\241\344\270\200\344\270\252\345\234\206\344\270\255\347\202\271\347\232\204\346\225\260\347\233\256_translated.md" @@ -1,5 +1,5 @@ --- -title: 1828. Statistics the number of a circle mid -point One question daily +title: "1828. 统计一个圆中点的数目" description: "LeetCode 1828. 统计一个圆中点的数目 题解 — 使用欧几里得距离公式计算每个点与圆心的距离，判断是否小于等于半径，时间复杂度 O(n^2)。关键技巧是直接遍历所有点与所有圆，无需优化。适合正在刷 LeetCode 每日一题、入门数学类模拟题的求职者和算法初学者。" date: "2024.01.01 0:00" tags: diff --git a/content/docs/career/interview-prep/leetcode/219_translated.md b/content/docs/career/interview-prep/leetcode/219_translated.md index 7e0e2f31..2143881f 100644 --- a/content/docs/career/interview-prep/leetcode/219_translated.md +++ b/content/docs/career/interview-prep/leetcode/219_translated.md @@ -1,5 +1,5 @@ --- -title: 219.Existing duplicate elements II Hash table graphics +title: "219. 存在重复元素 II" description: "LeetCode 219. 存在重复元素 II 题解 — 使用哈希表与滑动窗口双指针解法，核心技巧是维护一个长度不超过 k+1 的窗口，在窗口内快速检测重复元素。适合正在刷 LeetCode 数组与哈希表题目的求职者或算法学习者。" date: "2024.01.01 0:00" categories: diff --git a/content/docs/career/interview-prep/leetcode/2293_translated.md b/content/docs/career/interview-prep/leetcode/2293_translated.md index 7a3b05f0..d5182b98 100644 --- a/content/docs/career/interview-prep/leetcode/2293_translated.md +++ b/content/docs/career/interview-prep/leetcode/2293_translated.md @@ -1,5 +1,5 @@ --- -title: One question daily 2293. Great mini game +title: "2293. 极大极小游戏" description: "LeetCode 2293. 极大极小游戏 题解 — 通过递归思想将一维数组不断转化为二维数组操作，避免索引变化混乱；利用 flag 计数交替取最大值与最小值，适合正在刷简单题、巩固递归与数组处理技巧的算法初学者。" date: "2024.01.01 0:00" tags: diff --git "a/content/docs/career/interview-prep/leetcode/2299\345\274\272\345\257\206\347\240\201\346\243\200\351\252\214\345\231\250II_translated.md" "b/content/docs/career/interview-prep/leetcode/2299\345\274\272\345\257\206\347\240\201\346\243\200\351\252\214\345\231\250II_translated.md" index 2b99fb1f..6cbb396a 100644 --- "a/content/docs/career/interview-prep/leetcode/2299\345\274\272\345\257\206\347\240\201\346\243\200\351\252\214\345\231\250II_translated.md" +++ "b/content/docs/career/interview-prep/leetcode/2299\345\274\272\345\257\206\347\240\201\346\243\200\351\252\214\345\231\250II_translated.md" @@ -1,5 +1,5 @@ --- -title: One question daily 2299. Code inspection device II +title: "2299. 强密码检验器 II" description: "LeetCode 2299. 强密码检验器 II 题解 — 模拟与位运算检查密码强度，使用掩码 mask 记录是否包含小写字母、大写字母、数字和特殊字符，并确保无连续相同字符。适合刷题求职者、准备算法面试的 CS 学生。" date: "2024.01.01 0:00" tags: diff --git "a/content/docs/career/interview-prep/leetcode/2309\345\205\274\345\205\267\345\244\247\345\260\217\345\206\231\347\232\204\346\234\200\345\245\275\350\213\261\346\226\207\345\255\227\346\257\215_translated.md" "b/content/docs/career/interview-prep/leetcode/2309\345\205\274\345\205\267\345\244\247\345\260\217\345\206\231\347\232\204\346\234\200\345\245\275\350\213\261\346\226\207\345\255\227\346\257\215_translated.md" index 0017e4d3..07d3bdc9 100644 --- "a/content/docs/career/interview-prep/leetcode/2309\345\205\274\345\205\267\345\244\247\345\260\217\345\206\231\347\232\204\346\234\200\345\245\275\350\213\261\346\226\207\345\255\227\346\257\215_translated.md" +++ "b/content/docs/career/interview-prep/leetcode/2309\345\205\274\345\205\267\345\244\247\345\260\217\345\206\231\347\232\204\346\234\200\345\245\275\350\213\261\346\226\207\345\255\227\346\257\215_translated.md" @@ -1,7 +1,5 @@ --- -title: >- - 2309. The best English letters with both appropriates and lowercases One - question daily +title: "2309. 兼具大小写的最好英文字母" description: "LeetCode 2309. 兼具大小写的最好英文字母 题解 — 使用哈希表与位运算两种解法，哈希表法从 Z 开始逆序查找字母是否同时出现大小写，位运算法用两个整数掩码分别记录小写和大写字母出现情况，再通过与运算找出最高位对应字母。适合正在刷 LeetCode 每日一题、想掌握哈希表与位运算技巧的求职者和算法学习者。" date: "2024.01.01 0:00" tags: diff --git "a/content/docs/career/interview-prep/leetcode/2335. \350\243\205\346\273\241\346\235\257\345\255\220\351\234\200\350\246\201\347\232\204\346\234\200\347\237\255\346\200\273\346\227\266\351\225\277_translated.md" "b/content/docs/career/interview-prep/leetcode/2335. \350\243\205\346\273\241\346\235\257\345\255\220\351\234\200\350\246\201\347\232\204\346\234\200\347\237\255\346\200\273\346\227\266\351\225\277_translated.md" index c5f5818f..315e97db 100644 --- "a/content/docs/career/interview-prep/leetcode/2335. \350\243\205\346\273\241\346\235\257\345\255\220\351\234\200\350\246\201\347\232\204\346\234\200\347\237\255\346\200\273\346\227\266\351\225\277_translated.md" +++ "b/content/docs/career/interview-prep/leetcode/2335. \350\243\205\346\273\241\346\235\257\345\255\220\351\234\200\350\246\201\347\232\204\346\234\200\347\237\255\346\200\273\346\227\266\351\225\277_translated.md" @@ -1,5 +1,5 @@ --- -title: 2335. The shortest total time to be filled with a cup One question daily +title: "2335. 装满杯子需要的最短总时长" description: "LeetCode 2335. 装满杯子需要的最短总时长 题解 — 贪心策略与数学分类讨论两种解法，核心技巧是每次选取剩余最多的两种饮料进行配对，或利用 x+y≤z 直接得出答案。适合正在刷每日一题、学习贪心算法与数学优化的求职者和算法学习者。" date: "2024.01.01 0:00" tags: diff --git "a/content/docs/career/interview-prep/leetcode/2341. \346\225\260\347\273\204\350\203\275\345\275\242\346\210\220\345\244\232\345\260\221\346\225\260\345\257\271_translated.md" "b/content/docs/career/interview-prep/leetcode/2341. \346\225\260\347\273\204\350\203\275\345\275\242\346\210\220\345\244\232\345\260\221\346\225\260\345\257\271_translated.md" index bf9640f7..d4cf6b77 100644 --- "a/content/docs/career/interview-prep/leetcode/2341. \346\225\260\347\273\204\350\203\275\345\275\242\346\210\220\345\244\232\345\260\221\346\225\260\345\257\271_translated.md" +++ "b/content/docs/career/interview-prep/leetcode/2341. \346\225\260\347\273\204\350\203\275\345\275\242\346\210\220\345\244\232\345\260\221\346\225\260\345\257\271_translated.md" @@ -1,5 +1,5 @@ --- -title: 2341. How much can the array be formed One question daily +title: "2341. 数组能形成多少数对" description: "LeetCode 2341. 数组能形成多少数对 题解 — 使用哈希表（Counter）统计每个数字出现次数，通过整除2计算可形成数对数量，关键技巧是排序后双指针或直接哈希计数。适合正在刷LeetCode每日一题、学习哈希表与计数算法的求职者和CS/AI学习者。" tags: - - Python diff --git "a/content/docs/career/interview-prep/leetcode/2639. \346\237\245\350\257\242\347\275\221\346\240\274\345\233\276\344\270\255\346\257\217\344\270\200\345\210\227\347\232\204\345\256\275\345\272\246_translated.md" "b/content/docs/career/interview-prep/leetcode/2639. \346\237\245\350\257\242\347\275\221\346\240\274\345\233\276\344\270\255\346\257\217\344\270\200\345\210\227\347\232\204\345\256\275\345\272\246_translated.md" index 3540805c..da2d8c30 100644 --- "a/content/docs/career/interview-prep/leetcode/2639. \346\237\245\350\257\242\347\275\221\346\240\274\345\233\276\344\270\255\346\257\217\344\270\200\345\210\227\347\232\204\345\256\275\345\272\246_translated.md" +++ "b/content/docs/career/interview-prep/leetcode/2639. \346\237\245\350\257\242\347\275\221\346\240\274\345\233\276\344\270\255\346\257\217\344\270\200\345\210\227\347\232\204\345\256\275\345\272\246_translated.md" @@ -1,5 +1,5 @@ --- -title: 2639. Query the width of each column in the grid diagram.md +title: "2639. 查询网格图中每一列的宽度" description: "LeetCode 2639. 查询网格图中每一列的宽度 题解 — 使用 NumPy 库高效计算每列数字字符串最大宽度，关键技巧包括矩阵转置与列迭代。适合正在刷 LeetCode 数组与矩阵题型、希望掌握 NumPy 加速列运算的 Python 求职者与算法学习者。" date: "2024.01.01 0:00" tags: diff --git "a/content/docs/career/interview-prep/leetcode/2679.\347\237\251\351\230\265\344\270\255\347\232\204\345\222\214_translated.md" "b/content/docs/career/interview-prep/leetcode/2679.\347\237\251\351\230\265\344\270\255\347\232\204\345\222\214_translated.md" index f023cd3e..93037d91 100644 --- "a/content/docs/career/interview-prep/leetcode/2679.\347\237\251\351\230\265\344\270\255\347\232\204\345\222\214_translated.md" +++ "b/content/docs/career/interview-prep/leetcode/2679.\347\237\251\351\230\265\344\270\255\347\232\204\345\222\214_translated.md" @@ -1,5 +1,5 @@ --- -title: 2679.In the matrix and the harmony.md +title: "2679. 矩阵中的和" description: "LeetCode 2679. 矩阵中的和 题解 — 先对每行子数组排序，再用 zip 一次性纵向遍历所有行，每列取最大值后求和。关键技巧：排序预处理 + zip 解包实现列级最大值提取。适合正在刷排序与矩阵操作题的 Python 求职者与算法学习者。" date: "2024.01.01 0:00" tags: diff --git "a/content/docs/career/interview-prep/leetcode/3072. \345\260\206\345\205\203\347\264\240\345\210\206\351\205\215\345\210\260\344\270\244\344\270\252\346\225\260\347\273\204\344\270\255 II_translated.md" "b/content/docs/career/interview-prep/leetcode/3072. \345\260\206\345\205\203\347\264\240\345\210\206\351\205\215\345\210\260\344\270\244\344\270\252\346\225\260\347\273\204\344\270\255 II_translated.md" index 1066e147..b1d86706 100644 --- "a/content/docs/career/interview-prep/leetcode/3072. \345\260\206\345\205\203\347\264\240\345\210\206\351\205\215\345\210\260\344\270\244\344\270\252\346\225\260\347\273\204\344\270\255 II_translated.md" +++ "b/content/docs/career/interview-prep/leetcode/3072. \345\260\206\345\205\203\347\264\240\345\210\206\351\205\215\345\210\260\344\270\244\344\270\252\346\225\260\347\273\204\344\270\255 II_translated.md" @@ -1,5 +1,5 @@ --- -title: 3072. Allocate elements into two arrays II.md +title: "3072. 将元素分配到两个数组中 II" description: "LeetCode 3072. 将元素分配到两个数组中 II 题解 — 使用树状数组（Fenwick Tree）维护两个数组中大于当前值的元素计数，通过离散化与二分索引实现 O(n log n) 高效分配。适合备战高频算法面试、需要掌握树状数组与离散化技巧的求职者与竞赛选手。" date: "2024.01.01 0:00" tags: diff --git "a/content/docs/career/interview-prep/leetcode/345. \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_translated.md" "b/content/docs/career/interview-prep/leetcode/345. \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_translated.md" index 995deb6c..4643f072 100644 --- "a/content/docs/career/interview-prep/leetcode/345. \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_translated.md" +++ "b/content/docs/career/interview-prep/leetcode/345. \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_translated.md" @@ -1,5 +1,5 @@ --- -title: 345. Voice letter in the reverse string.md +title: "345. 反转字符串中的元音字母" description: "LeetCode 345. 反转字符串中的元音字母 题解 — 使用双指针技巧从字符串两端向中间遍历，分别定位元音字母并交换位置。关键点在于用哈希集合或条件判断快速识别元音字母（a、e、i、o、u 大小写均可）。适合正在刷 LeetCode 基础题、练习双指针与字符串操作的求职者或 CS 学习者阅读。" date: "2024.01.01 0:00" tags: diff --git "a/content/docs/career/interview-prep/leetcode/538.\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_translated.md" "b/content/docs/career/interview-prep/leetcode/538.\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_translated.md" index f45451a0..ad4d81e2 100644 --- "a/content/docs/career/interview-prep/leetcode/538.\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_translated.md" +++ "b/content/docs/career/interview-prep/leetcode/538.\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_translated.md" @@ -1,5 +1,5 @@ --- -title: 538.Convert the binary search tree to cumulative tree +title: "538. 把二叉搜索树转换为累加树" description: "LeetCode 538. 把二叉搜索树转换为累加树 题解 — 利用反向中序遍历（右-根-左）累加节点值，将 BST 原地转换为累加树（Greater Sum Tree），关键技巧是维护全局累加变量记录已遍历节点和。适合准备面试、刷二叉树与递归的算法学习者。" date: "2024.01.01 0:00" tags: diff --git "a/content/docs/career/interview-prep/leetcode/6323. \345\260\206\351\222\261\345\210\206\347\273\231\346\234\200\345\244\232\347\232\204\345\204\277\347\253\245_translated.md" "b/content/docs/career/interview-prep/leetcode/6323. \345\260\206\351\222\261\345\210\206\347\273\231\346\234\200\345\244\232\347\232\204\345\204\277\347\253\245_translated.md" index da572604..3d0ce617 100644 --- "a/content/docs/career/interview-prep/leetcode/6323. \345\260\206\351\222\261\345\210\206\347\273\231\346\234\200\345\244\232\347\232\204\345\204\277\347\253\245_translated.md" +++ "b/content/docs/career/interview-prep/leetcode/6323. \345\260\206\351\222\261\345\210\206\347\273\231\346\234\200\345\244\232\347\232\204\345\204\277\347\253\245_translated.md" @@ -1,5 +1,5 @@ --- -title: 6323. Child that divides money the most.md +title: "6323. 将钱分给最多的儿童" description: "LeetCode 6323. 将钱分给最多的儿童 题解 — 数学贪心分类讨论，核心技巧是优先让每个儿童分到 8 美元，再根据剩余钱数和剩余人数处理边界情况：剩余钱数 >0 且剩余人数为 0 时需从已分 8 美元的儿童中扣减；剩余 1 人且剩余钱数为 3 时同样需扣减；其余情况将剩余钱全部分给一人，若该人分到 4 美元则转给另一人 1 美元，答案不变。适合备战周赛、需要掌握数学贪心与边界条件处理的算法学习者。" date: "2024.01.01 0:00" tags: diff --git "a/content/docs/career/interview-prep/leetcode/76\346\234\200\345\260\217\350\246\206\347\233\226\345\255\220\344\270\262_translated.md" "b/content/docs/career/interview-prep/leetcode/76\346\234\200\345\260\217\350\246\206\347\233\226\345\255\220\344\270\262_translated.md" index ad460929..31bcb058 100644 --- "a/content/docs/career/interview-prep/leetcode/76\346\234\200\345\260\217\350\246\206\347\233\226\345\255\220\344\270\262_translated.md" +++ "b/content/docs/career/interview-prep/leetcode/76\346\234\200\345\260\217\350\246\206\347\233\226\345\255\220\344\270\262_translated.md" @@ -1,5 +1,5 @@ --- -title: 76Minimum cover string.md +title: "76. 最小覆盖子串" description: "LeetCode 76. 最小覆盖子串 题解 — 滑动窗口 + 双指针 + 哈希表计数，通过右指针扩展窗口、左指针收缩窗口，动态维护字符频次字典以判断是否覆盖目标串 t。适合准备面试、刷 LeetCode 的 CS/AI 求职者与算法学习者阅读。" date: "2024.01.01 0:00" tags: diff --git a/content/docs/career/interview-prep/leetcode/80_translated.md b/content/docs/career/interview-prep/leetcode/80_translated.md index 82c978d8..f6b4e5f0 100644 --- a/content/docs/career/interview-prep/leetcode/80_translated.md +++ b/content/docs/career/interview-prep/leetcode/80_translated.md @@ -1,5 +1,5 @@ --- -title: Python beat98.40% collectionsofCounter method！ +title: "80. 删除有序数组中的重复项 II" description: "LeetCode 80. 删除有序数组中的重复项 II 题解 — 使用双指针原地修改数组，允许每个元素最多出现两次，关键技巧是维护慢指针控制写入位置与快指针遍历数组，适合准备面试、需要掌握数组去重与双指针技巧的求职者与算法学习者。" date: "2024.01.01 0:00" tags: diff --git a/content/docs/career/interview-prep/leetcode/9021_TUT_3_25T1.md b/content/docs/career/interview-prep/leetcode/9021_TUT_3_25T1.md index 0c50ebb9..b6f2fc60 100644 --- a/content/docs/career/interview-prep/leetcode/9021_TUT_3_25T1.md +++ b/content/docs/career/interview-prep/leetcode/9021_TUT_3_25T1.md @@ -1,5 +1,5 @@ --- -title: 9021_TUT_3_25T1.md +title: "9021_TUT_3_25T1" description: "LeetCode 9021. 题解 — 构造重复单元拼接字符串，使用列表生成与字符串 join 方法分解单元结构，适合算法初学者与备考编程面试的读者巩固基础字符串操作与分治思维。" date: 2025/3/07 tags: diff --git "a/content/docs/career/interview-prep/leetcode/994.\350\205\220\347\203\202\347\232\204\346\251\230\345\255\220_translated.md" "b/content/docs/career/interview-prep/leetcode/994.\350\205\220\347\203\202\347\232\204\346\251\230\345\255\220_translated.md" index 4515780f..bd2b3cfd 100644 --- "a/content/docs/career/interview-prep/leetcode/994.\350\205\220\347\203\202\347\232\204\346\251\230\345\255\220_translated.md" +++ "b/content/docs/career/interview-prep/leetcode/994.\350\205\220\347\203\202\347\232\204\346\251\230\345\255\220_translated.md" @@ -1,5 +1,5 @@ --- -title: 994.Rotten orange.md +title: "994. 腐烂的橘子" description: "LeetCode 994. 腐烂的橘子 题解 — 多源 BFS 广度优先搜索模拟腐烂扩散过程，使用队列同时从所有初始腐烂橘子出发逐层感染，统计新鲜橘子全部腐烂所需最小分钟数。适合准备面试、刷图论与BFS算法题的求职者和CS/AI学习者。" date: "2024.05.14 0:00" tags: diff --git a/content/docs/career/interview-prep/leetcode/Counting Stars-Inter-Uni Programming Contest.md b/content/docs/career/interview-prep/leetcode/Counting Stars-Inter-Uni Programming Contest.md index 6b6e0b98..94dcb33b 100644 --- a/content/docs/career/interview-prep/leetcode/Counting Stars-Inter-Uni Programming Contest.md +++ b/content/docs/career/interview-prep/leetcode/Counting Stars-Inter-Uni Programming Contest.md @@ -1,5 +1,5 @@ --- -title: Counting Stars-Inter-Uni Programming Contest.md +title: "Counting Stars-Inter-Uni Programming Contest" description: "LeetCode 题解 — 基于排序与贪心策略的流星轨迹还原问题。通过按 x 坐标递增排序后维护当前链的最后 y 坐标，判断新点能否接续已有流星路径，从而计算最少所需恒星数量。适合备战算法竞赛、练习贪心与排序技巧的 CS 学习者。" date: 22/9/2024 tags: diff --git "a/content/docs/career/interview-prep/leetcode/[121]\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\237_translated.md" "b/content/docs/career/interview-prep/leetcode/[121]\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\237_translated.md" index ed2e9a90..855de0ca 100644 --- "a/content/docs/career/interview-prep/leetcode/[121]\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\237_translated.md" +++ "b/content/docs/career/interview-prep/leetcode/[121]\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\237_translated.md" @@ -1,5 +1,5 @@ --- -title: 121.The best time for buying and selling stocks +title: "121. 买卖股票的最佳时机" description: "LeetCode 121. 买卖股票的最佳时机 题解 — 使用动态规划（DP）求解单次交易最大利润，核心技巧是维护历史最低股价并实时计算当日卖出收益。适合准备算法面试、刷 LeetCode 数组与 DP 题的求职者和 CS 学生。" date: "2024.01.01 0:00" tags: diff --git "a/content/docs/career/interview-prep/leetcode/[1333]\351\244\220\345\216\205\350\277\207\346\273\244\345\231\250_translated.md" "b/content/docs/career/interview-prep/leetcode/[1333]\351\244\220\345\216\205\350\277\207\346\273\244\345\231\250_translated.md" index 15c06863..6e122765 100644 --- "a/content/docs/career/interview-prep/leetcode/[1333]\351\244\220\345\216\205\350\277\207\346\273\244\345\231\250_translated.md" +++ "b/content/docs/career/interview-prep/leetcode/[1333]\351\244\220\345\216\205\350\277\207\346\273\244\345\231\250_translated.md" @@ -1,5 +1,5 @@ --- -title: 1333.Restaurant filter +title: "1333. 餐厅过滤器" description: "LeetCode 1333. 餐厅过滤器 题解 — 使用列表推导式与排序优化过滤逻辑，关键技巧包括利用 sorted 与 lambda 实现多级排序（先按评分降序、再按 id 降序），适合准备算法面试、希望提升 Python 代码效率的 LeetCode 刷题者阅读。" date: "2024.01.01 0:00" tags: diff --git "a/content/docs/career/interview-prep/leetcode/[146]LRU \347\274\223\345\255\230_translated.md" "b/content/docs/career/interview-prep/leetcode/[146]LRU \347\274\223\345\255\230_translated.md" index 1453346a..c30f93ed 100644 --- "a/content/docs/career/interview-prep/leetcode/[146]LRU \347\274\223\345\255\230_translated.md" +++ "b/content/docs/career/interview-prep/leetcode/[146]LRU \347\274\223\345\255\230_translated.md" @@ -1,5 +1,5 @@ --- -title: 146.LRU cache +title: "146. LRU 缓存" description: "LeetCode 146. LRU 缓存 题解 — 使用哈希表 + 双向链表实现 O(1) 时间复杂度的 get 和 put 操作，核心技巧是维护最近最少使用顺序。适合准备面试、需要掌握 LRU 缓存机制与链表操作的算法学习者。" date: "2024.01.01 0:00" tags: diff --git "a/content/docs/career/interview-prep/leetcode/[213]\346\211\223\345\256\266\345\212\253\350\210\215 II_translated.md" "b/content/docs/career/interview-prep/leetcode/[213]\346\211\223\345\256\266\345\212\253\350\210\215 II_translated.md" index bb23ca51..88cdc909 100644 --- "a/content/docs/career/interview-prep/leetcode/[213]\346\211\223\345\256\266\345\212\253\350\210\215 II_translated.md" +++ "b/content/docs/career/interview-prep/leetcode/[213]\346\211\223\345\256\266\345\212\253\350\210\215 II_translated.md" @@ -1,5 +1,5 @@ --- -title: 213.Hiccup II +title: "213. 打家劫舍 II" description: "LeetCode 213. 打家劫舍 II 题解 — 动态规划解决环形街区偷窃问题，核心技巧是将环形拆分为两个线性子问题：分别考虑不偷第一间和不偷最后一间，再取最大值。适合正在刷 LeetCode 动态规划题、准备算法面试的 CS 求职者。" date: "2024.01.01 0:00" tags: diff --git "a/content/docs/career/interview-prep/leetcode/[2490]\345\233\236\347\216\257\345\217\245_translated.md" "b/content/docs/career/interview-prep/leetcode/[2490]\345\233\236\347\216\257\345\217\245_translated.md" index 9602751b..68f96023 100644 --- "a/content/docs/career/interview-prep/leetcode/[2490]\345\233\236\347\216\257\345\217\245_translated.md" +++ "b/content/docs/career/interview-prep/leetcode/[2490]\345\233\236\347\216\257\345\217\245_translated.md" @@ -1,5 +1,5 @@ --- -title: 2490Return ring sentence +title: "2490. 回环句" description: "LeetCode 2490. 回环句 题解 — 判断句子是否为回环句，核心解法为分割单词后检查每个单词末字母与下一单词首字母是否相同，涉及字符串分割与双指针遍历技巧。适合正在刷 LeetCode 字符串类题目的求职者与算法学习者。" date: "2024.01.01 0:00" tags: diff --git "a/content/docs/career/interview-prep/leetcode/[2562]\346\211\276\345\207\272\346\225\260\347\273\204\347\232\204\344\270\262\350\201\224\345\200\274_translated.md" "b/content/docs/career/interview-prep/leetcode/[2562]\346\211\276\345\207\272\346\225\260\347\273\204\347\232\204\344\270\262\350\201\224\345\200\274_translated.md" index 06c272a2..f9afc872 100644 --- "a/content/docs/career/interview-prep/leetcode/[2562]\346\211\276\345\207\272\346\225\260\347\273\204\347\232\204\344\270\262\350\201\224\345\200\274_translated.md" +++ "b/content/docs/career/interview-prep/leetcode/[2562]\346\211\276\345\207\272\346\225\260\347\273\204\347\232\204\344\270\262\350\201\224\345\200\274_translated.md" @@ -1,5 +1,5 @@ --- -title: 2562.Find the series of the array +title: "2562. 找出数组的串联值" description: "LeetCode 2562. 找出数组的串联值 题解 — 使用双指针技巧从数组两端逐步取出数字并拼接为串联值，关键点在于正确处理正负索引的转换关系，避免越界错误。适合正在刷 LeetCode 双指针题型、需要巩固数组索引边界处理的求职者和算法学习者。" date: "2024.01.01 0:00" tags: diff --git "a/content/docs/career/interview-prep/leetcode/[2582]\351\200\222\346\236\225\345\244\264_translated.md" "b/content/docs/career/interview-prep/leetcode/[2582]\351\200\222\346\236\225\345\244\264_translated.md" index e15fbac0..ed4dac95 100644 --- "a/content/docs/career/interview-prep/leetcode/[2582]\351\200\222\346\236\225\345\244\264_translated.md" +++ "b/content/docs/career/interview-prep/leetcode/[2582]\351\200\222\346\236\225\345\244\264_translated.md" @@ -1,5 +1,5 @@ --- -title: 2582.Pillow +title: "2582. 递枕头" description: "LeetCode 2582. 递枕头 题解 — 数学规律题，核心技巧是利用 n 个人传枕头时每轮间隔为 n-1，通过 time // (n-1) 计算完整轮次，再根据轮次奇偶性判断正向或反向传递位置。适合正在刷 LeetCode 数学模拟类题目的求职者与算法学习者。" date: "2024.01.01 0:00" tags: diff --git "a/content/docs/career/interview-prep/leetcode/brief_alternate \344\275\234\344\270\232\345\270\256\345\277\231_translated.md" "b/content/docs/career/interview-prep/leetcode/brief_alternate \344\275\234\344\270\232\345\270\256\345\277\231_translated.md" index 86bc0ab4..3cfa0676 100644 --- "a/content/docs/career/interview-prep/leetcode/brief_alternate \344\275\234\344\270\232\345\270\256\345\277\231_translated.md" +++ "b/content/docs/career/interview-prep/leetcode/brief_alternate \344\275\234\344\270\232\345\270\256\345\277\231_translated.md" @@ -1,5 +1,5 @@ --- -title: brief_alternate Assignment +title: "brief_alternate 作业帮忙" description: 'LeetCode 题解 — 基于 pandas 的数据处理与求职面试实战题解。讲解如何使用 df["Name"] 直接提取列、idxmax() 与 max() 获取最大值索引与数值，以及 .loc 函数进行行列定位与筛选。适合正在刷 LeetCode 数据科学题、准备 AI/数据分析岗位面试的求职者与自学者。' date: "2024.01.01 0:00" tags: diff --git "a/content/docs/career/interview-prep/leetcode/\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_translated.md" "b/content/docs/career/interview-prep/leetcode/\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_translated.md" index 1d957d18..e04ad0db 100644 --- "a/content/docs/career/interview-prep/leetcode/\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_translated.md" +++ "b/content/docs/career/interview-prep/leetcode/\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_translated.md" @@ -1,5 +1,5 @@ --- -title: Sword finger Offer II 021. Delete the countdown of the linked list n Node.md +title: "剑指 Offer II 021. 删除链表的倒数第 n 个结点" description: "LeetCode 剑指 Offer II 021. 删除链表的倒数第 n 个结点 题解 — 使用双指针（滑动窗口）与虚拟头节点技巧，快指针先走 n 步，再与慢指针同步移动直至快指针到达链表末尾，从而定位并删除倒数第 n 个结点。适合正在刷链表题型、准备算法面试或需要掌握双指针与虚拟头节点用法的读者。" date: "2024.01.01 0:00" tags: