字符串中超过 1 个字母的最长公共子序列

Question

I'm trying to find the LCS of more than one letter in two strings using a k value. For example, if

k  = 3 
s1 = "AAABBBCCCDDDEEE"  
s2 = "AAACCCBBBDDDEEE" 

then the LCS would be 4 : "AAABBBDDDEEE" or "AAACCCDDDEEE" , another example is if

k  = 2 
s1 = "EEDDFFAABBCC" 
s2 = "AACCDDEEBBFF" 

then the LCS would be 2 : "EEBB" , "EEFF" , "DDFF" , "DDBB" , ... and so on. How would I be able to do it so that more than one character is in each cell of the table and if the characters are not equal I would have to use a sort, ie "EF" == "FE"

Answer 1

Use std::is_permutation to find if two strings contain the same characters. To store more than one character in each "cell of the table" use std::string .

For any questions on c++, go here .