<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>回溯算法 on 知识铺的博客</title>
    <link>https://index.zshipu.com/ai002/tags/%E5%9B%9E%E6%BA%AF%E7%AE%97%E6%B3%95/</link>
    <description>Recent content in 回溯算法 on 知识铺的博客</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>zh-CN</language>
    <lastBuildDate>Fri, 04 Sep 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://index.zshipu.com/ai002/tags/%E5%9B%9E%E6%BA%AF%E7%AE%97%E6%B3%95/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>递归算法从原理到实战：递推公式、壳函数与缓存优化</title>
      <link>https://index.zshipu.com/ai002/post/20260904/%E9%80%92%E5%BD%92%E7%AE%97%E6%B3%95%E4%BB%8E%E5%8E%9F%E7%90%86%E5%88%B0%E5%AE%9E%E6%88%98%E9%80%92%E6%8E%A8%E5%85%AC%E5%BC%8F%E5%A3%B3%E5%87%BD%E6%95%B0%E4%B8%8E%E7%BC%93%E5%AD%98%E4%BC%98%E5%8C%96/</link>
      <pubDate>Fri, 04 Sep 2026 00:00:00 +0000</pubDate>
      <guid>https://index.zshipu.com/ai002/post/20260904/%E9%80%92%E5%BD%92%E7%AE%97%E6%B3%95%E4%BB%8E%E5%8E%9F%E7%90%86%E5%88%B0%E5%AE%9E%E6%88%98%E9%80%92%E6%8E%A8%E5%85%AC%E5%BC%8F%E5%A3%B3%E5%87%BD%E6%95%B0%E4%B8%8E%E7%BC%93%E5%AD%98%E4%BC%98%E5%8C%96/</guid>
      <description>写递归时试图模拟执行过程是常见误区 写递归时试图模拟执行过程是常见误区，正确做法是找到递推公式加上终止条件，就能把大问题拆成同构小问题。当需要跨层携带共享状态如缓存或路径列表时，用非递归壳函数包裹初始化和调用，对外接口才保持干净。 很多初学者在面对递归题目时，第一反应是拿笔画出每一层</description>
    </item>
  </channel>
</rss>
