TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Longest Common Subsequence algorithm in Python

41 点作者 white_eskimo超过 15 年前

1 comment

Groxx超过 15 年前
It's a really nice breakdown of sub-sequence calculation methods. If you're doing a letter-perfect diff calculation, or need to know how "different" two strings are, this is what you need. It even includes code and <i>explanations of the code</i> and how it all works.<p>All in all, the post is roughly worth a couple algorithm class sessions. Worth the read for just about anyone, if only for picking up a few new logical tricks.