超过 2 个字符串的最长公共子序列

Question

How to find the LCS (Longest Common Subsequence) for more than two strings? We can solve for the LCS for two strings with DP, but how to proceed for LCS for more than two strings?

Answer 1

I'm not sure if that's the best answer, but I guess a DP approach could work here as well. With 2 strings you make a 2D array and fill it with "match lengths" for different starting/ending indeces of both strings (depending on your approach). You could just use ND array for N strings, and fill it in the same way.