<?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 Answer</title>
    <link>https://answer.freetools.me/tags/%E5%89%AA%E6%9E%9D/</link>
    <description>Recent content in 剪枝 on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Sun, 08 Mar 2026 20:05:57 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/%E5%89%AA%E6%9E%9D/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>回溯算法:从决策树到剪枝优化的完整LeetCode通关指南</title>
      <link>https://answer.freetools.me/%E5%9B%9E%E6%BA%AF%E7%AE%97%E6%B3%95%E4%BB%8E%E5%86%B3%E7%AD%96%E6%A0%91%E5%88%B0%E5%89%AA%E6%9E%9D%E4%BC%98%E5%8C%96%E7%9A%84%E5%AE%8C%E6%95%B4leetcode%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</link>
      <pubDate>Sun, 08 Mar 2026 20:05:57 +0800</pubDate>
      <guid>https://answer.freetools.me/%E5%9B%9E%E6%BA%AF%E7%AE%97%E6%B3%95%E4%BB%8E%E5%86%B3%E7%AD%96%E6%A0%91%E5%88%B0%E5%89%AA%E6%9E%9D%E4%BC%98%E5%8C%96%E7%9A%84%E5%AE%8C%E6%95%B4leetcode%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</guid>
      <description>一篇系统讲解回溯算法的完整指南，从核心原理到剪枝优化，涵盖排列、组合、子集、N皇后、数独等LeetCode经典题目（46/47/77/39/40/216/78/90/51/37/17/22/93/131/79等）的Java实现与复杂度分析。</description>
    </item>
  </channel>
</rss>
