<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>递归 on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/zh/tags/%E9%80%92%E5%BD%92/</link><description>Recent content in 递归 on Jeanphilo Blog</description><generator>Hugo -- 0.159.2</generator><language>zh-cn</language><lastBuildDate>Fri, 06 Mar 2026 17:58:23 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/zh/tags/%E9%80%92%E5%BD%92/index.xml" rel="self" type="application/rss+xml"/><item><title>Hot100：翻转二叉树（Invert Binary Tree）递归 / BFS ACERS 解析</title><link>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/binary-tree/226-invert-binary-tree/</link><pubDate>Fri, 06 Mar 2026 17:58:23 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/binary-tree/226-invert-binary-tree/</guid><description>围绕 LeetCode 226 讲清树镜像变换、递归交换左右子树的本质，以及工程里的结构镜像场景。</description></item><item><title>Hot100：二叉树的最大深度（Maximum Depth of Binary Tree）DFS / BFS ACERS 解析</title><link>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/binary-tree/104-maximum-depth-of-binary-tree/</link><pubDate>Fri, 06 Mar 2026 17:58:22 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/binary-tree/104-maximum-depth-of-binary-tree/</guid><description>讲透 LeetCode 104 的深度定义、递归 DFS 与层序 BFS 两种主流解法，附工程迁移和多语言实现。</description></item><item><title>Hot100：反转链表（Reverse Linked List）三指针迭代/递归 ACERS 解析</title><link>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/linked-list/206-reverse-linked-list/</link><pubDate>Sun, 01 Feb 2026 16:30:26 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/linked-list/206-reverse-linked-list/</guid><description>用三指针迭代在 O(n) 时间、O(1) 额外空间反转单链表，并对比递归写法与常见坑，附多语言可运行实现（Hot100）。</description></item><item><title>从循环到递归：如何避免可变状态</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/language/loop-to-recursion-immutability/</link><pubDate>Sat, 24 Jan 2026 15:29:20 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/language/loop-to-recursion-immutability/</guid><description>演示把循环转换成递归的思路，并说明如何减少可变状态。</description></item><item><title>尾递归阶乘：把递归变成可优化形式</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/tail-recursive-factorial/</link><pubDate>Sat, 24 Jan 2026 13:20:24 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/tail-recursive-factorial/</guid><description>通过尾递归形式实现阶乘，并讨论实际语言支持情况。</description></item><item><title>栈溢出示例：递归深度与调用栈的边界</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/stack-overflow-example/</link><pubDate>Sat, 24 Jan 2026 13:20:24 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/stack-overflow-example/</guid><description>展示栈溢出的典型示例，并解释成因与规避方法。</description></item></channel></rss>