<?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/%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%AD%90%E5%BA%8F%E5%88%97/</link>
    <description>Recent content in 最长公共子序列 on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Sun, 08 Mar 2026 23:35:49 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%AD%90%E5%BA%8F%E5%88%97/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>最长公共子序列为何能解决十几类LeetCode问题从字符串相似度到DNA比对的动态规划精髓</title>
      <link>https://answer.freetools.me/%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%AD%90%E5%BA%8F%E5%88%97%E4%B8%BA%E4%BD%95%E8%83%BD%E8%A7%A3%E5%86%B3%E5%8D%81%E5%87%A0%E7%B1%BBleetcode%E9%97%AE%E9%A2%98%E4%BB%8E%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E4%BC%BC%E5%BA%A6%E5%88%B0dna%E6%AF%94%E5%AF%B9%E7%9A%84%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92%E7%B2%BE%E9%AB%93/</link>
      <pubDate>Sun, 08 Mar 2026 23:35:49 +0800</pubDate>
      <guid>https://answer.freetools.me/%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%AD%90%E5%BA%8F%E5%88%97%E4%B8%BA%E4%BD%95%E8%83%BD%E8%A7%A3%E5%86%B3%E5%8D%81%E5%87%A0%E7%B1%BBleetcode%E9%97%AE%E9%A2%98%E4%BB%8E%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E4%BC%BC%E5%BA%A6%E5%88%B0dna%E6%AF%94%E5%AF%B9%E7%9A%84%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92%E7%B2%BE%E9%AB%93/</guid>
      <description>深度解析最长公共子序列(LCS)算法的核心原理，从状态转移方程推导到空间优化技巧，完整覆盖LeetCode经典题目（1143/583/718/516/1092/1312等）的Java解法，并探讨其在Git diff、DNA序列比对等实际场景中的应用。</description>
    </item>
  </channel>
</rss>
