35. Longest Common Subsequence、Dynamic Programming
#AL-03-035中Longest Common SubsequenceDynamic Programming
The Longest Common Subsequence (LCS) problem finds a longest subsequence common to two given sequences x[1..m] and y[1..n]. Which of the following statements are incorrect?
