JustKitt's blog


  • Home

  • About

  • Archives

  • Tags

动态规划:最长公共子序列

Posted on 2017-05-21 | In 动态规划

转载请注明出处:blog.justkitt.com

问题1

有两个序列,分别是s1 = {a,b,c,b,d,a,b},s2 = {b,d,c,a,b,a},从前往后找,s1和s2的最长公共子序列为LCS(s1,s2) = {b,c,b,a},求s1和s2的最长公共子序列长度。

Read more »
12
JustKitt

JustKitt

11 posts
5 categories
14 tags
© 2018 JustKitt
Powered by Hexo
Theme - NexT.Pisces