https://shio-chan-dev.github.io/jeanblog/zh/tags/dfs/Recent content in DFS 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/backtracking/46-permutations/Thu, 02 Apr 2026 13:48:57 +0800https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/backtracking/46-permutations/围绕 LeetCode 46 全排列，讲清 used[] 状态控制、叶子收集答案与多语言实现。https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/backtracking/78-subsets/Thu, 02 Apr 2026 13:48:57 +0800https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/backtracking/78-subsets/围绕 LeetCode 78 子集，讲清回溯树、startIndex 边界与多语言可运行实现。https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/backtracking/39-combination-sum/Thu, 02 Apr 2026 13:48:57 +0800https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/backtracking/39-combination-sum/围绕 LeetCode 39 讲清可重复选取、排序剪枝与组合型回溯实现。https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/133-clone-graph/Thu, 19 Mar 2026 13:18:26 +0800https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/133-clone-graph/用原节点到新节点的映射表实现无向连通图深拷贝，覆盖 DFS 与 BFS 两种写法、环处理、正确性分析与多语言可运行实现。https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/binary-tree/102-binary-tree-level-order-traversal/Sun, 15 Mar 2026 21:29:44 +0800https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/binary-tree/102-binary-tree-level-order-traversal/讲透 LeetCode 102 的按层 BFS、层宽控制与 DFS depth bucket 备选方案，附工程迁移和多语言实现。https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/binary-tree/101-symmetric-tree/Sun, 15 Mar 2026 21:29:43 +0800https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/binary-tree/101-symmetric-tree/围绕 LeetCode 101 讲清镜像递归、BFS 成对入队与树形结构对称校验，附工程迁移和多语言实现。https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/100-same-tree/Sun, 15 Mar 2026 21:29:42 +0800https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/100-same-tree/围绕 LeetCode 100 讲清同步递归比较、队列成对校验与结构等价判断，附工程迁移与多语言实现。https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/binary-tree/104-maximum-depth-of-binary-tree/Fri, 06 Mar 2026 17:58:22 +0800https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/binary-tree/104-maximum-depth-of-binary-tree/讲透 LeetCode 104 的深度定义、递归 DFS 与层序 BFS 两种主流解法，附工程迁移和多语言实现。https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/binary-tree/94-binary-tree-inorder-traversal/Fri, 06 Mar 2026 17:58:21 +0800https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/binary-tree/94-binary-tree-inorder-traversal/用左-根-右模板讲透 LeetCode 94，覆盖递归、显式栈与工程迁移场景，附多语言可运行实现。https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/graph/40-connected-components-and-scc-tarjan-kosaraju/Mon, 09 Feb 2026 09:50:22 +0800https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/graph/40-connected-components-and-scc-tarjan-kosaraju/系统讲解无向图 Connected Components 与有向图 SCC，重点覆盖 Tarjan（工程常用）与 Kosaraju，对应图数据库中的社区划分、子图切分与分片 hint。https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/graph/10-bfs-dfs-k-hop-subgraph-path-existence/Mon, 09 Feb 2026 09:44:11 +0800https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/graph/10-bfs-dfs-k-hop-subgraph-path-existence/围绕 k-hop 查询、子图抽取、路径可达性三类高频图任务，系统讲清 BFS/DFS 的迭代模板、early stop 剪枝与 visited bitmap/bloom 选型，并附多语言可运行实现。https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/binary-tree/437-path-sum-iii/Mon, 02 Feb 2026 22:13:45 +0800https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/binary-tree/437-path-sum-iii/用前缀和 + 计数哈希表在 O(n) 时间统计二叉树中和为 targetSum 的向下路径数，含推导、工程迁移与多语言实现。