RT[字?jǐn)?shù)補(bǔ)丁]
2
0
0
這個(gè)寫(xiě)的非常詳細(xì)
http://www.ruanyifeng.com/blog/2012/08/how_to_read_diff.html
最長(zhǎng)公共子序列（Longest common subsequence problem）
It is a classic computer science problem, the basis of file comparison programs such as diff
