include_No的博客

原创 最长公共子序列的递归与动态规划实现

LCS递归结构：递归实现：#include<iostream>#include<algorithm>using namespace std;string a, b;int LCSR(int m, int n){ if (m == a.length() || n == b.length()) return 0; if (a[m] == b[n]) ...