<?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 xun's Blog</title><link>https://xungirl.github.io/tags/%E9%80%92%E5%BD%92%E8%B0%83%E7%94%A8%E6%A0%88/</link><description>Recent content in 递归调用栈 on xun's Blog</description><generator>Hugo -- 0.168.0</generator><language>en</language><lastBuildDate>Mon, 19 Oct 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://xungirl.github.io/tags/%E9%80%92%E5%BD%92%E8%B0%83%E7%94%A8%E6%A0%88/index.xml" rel="self" type="application/rss+xml"/><item><title>2026-10-19 LeetCode 230 self.k 写法的执行顺序学习笔记</title><link>https://xungirl.github.io/posts/2026-10-19-lc230-self-k-execution-order/</link><pubDate>Mon, 19 Oct 2026 00:00:00 +0000</pubDate><guid>https://xungirl.github.io/posts/2026-10-19-lc230-self-k-execution-order/</guid><description>用逐步图解看 LC 230 的 self.k 写法怎么执行：先一路向左钻到底，每个节点在自己的调用里减一次 k，以及找到答案后为什么还会「多减一次」。</description></item></channel></rss>