摘要：
This is the classic LCS problem. Since it only requires you to print the maximum length, the code can be optimized to use only O(m) space (seehere).My... 阅读全文
摘要：
This is the classic LCS problem. Since it requires you to print one longest common subsequence, just use the O(m*n)-space version here.My accepted cod... 阅读全文