RT[字数补丁]
这个写的非常详细http://www.ruanyifeng.com/blog/2012/08/how_to_read_diff.html
最长公共子序列（Longest common subsequence problem）
It is a classic computer science problem, the basis of file comparison programs such as diff
![[Web-Frontend] Node.js-Schnellstart](https://img.php.cn/upload/course/000/000/067/662b5d34ba7c0227.png)
这个写的非常详细
http://www.ruanyifeng.com/blog/2012/08/how_to_read_diff.html
最长公共子序列（Longest common subsequence problem）