摘要: 算法导论提到过这题 class Solution { public: int longestCommonSubsequence(string text1, string text2) { int a[1001][1001]; int i,j; for(i=0;i<1001;i++){ a[i][0] 阅读全文
posted @ 2021-04-05 22:55 vdk 阅读(45) 评论(0) 推荐(0)