https://shio-chan-dev.github.io/jeanblog/zh/tags/%E5%AD%97%E7%AC%A6%E4%B8%B2/Recent content in 字符串 on Jeanphilo BlogHugo -- 0.159.2zh-cnThu, 02 Apr 2026 13:48:57 +0800https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/backtracking/17-letter-combinations-of-a-phone-number/Thu, 02 Apr 2026 13:48:57 +0800https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/backtracking/17-letter-combinations-of-a-phone-number/围绕 LeetCode 17 讲清固定层数 DFS、数字到字母映射与多语言实现。https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/76-minimum-window-substring/Tue, 20 Jan 2026 21:59:19 +0800https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/76-minimum-window-substring/用可变滑动窗口与计数哈希表在 O(n) 时间找到最小覆盖子串，含工程场景与多语言实现。https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/1456-maximum-number-of-vowels-in-a-substring-of-given-length/Tue, 20 Jan 2026 13:40:45 +0800https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/1456-maximum-number-of-vowels-in-a-substring-of-given-length/用固定滑动窗口在 O(n) 时间求最大元音子串数量，含工程迁移与多语言实现。https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/1513-number-of-substrings-with-only-ones/Sun, 18 Jan 2026 18:42:59 +0800https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/1513-number-of-substrings-with-only-ones/用连续段在线统计在 O(n) 时间计算仅含 1 的子串数量，含工程场景与多语言实现。https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/2379-minimum-recolors-to-get-k-consecutive-black-blocks/Thu, 04 Dec 2025 10:30:00 +0800https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/2379-minimum-recolors-to-get-k-consecutive-black-blocks/给定只包含 W/B 的字符串 blocks，每次可将一个 W 涂成 B，如何用一次线性扫描求出得到至少一次连续 k 个黑色块的最少操作次数，并给出多语言实现与工程应用示例。