結果 : solve the longest common subsequence problem using dynamic programming