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

直接上代码，属于动态规划的范畴

int max_substr(string &str1, string &str2)//对源字符串进行操作
{
    int len1 = str1.length();
    int len2 = str2.length();
    vector<vector<int>>dp(len1,vector<int>(len2,0));//二维向量
    for (int i = 0; i < len1; i++)
    {
        dp[i][0] = str1[i]==str2[0] ? 1:0;
    }
    for (int j = 0; j <= len2; j++)
    {
        dp[0][j] = str1[0]==str2[j] ? 1:0;
    }
    for (int i = 1; i < len1; i++)
    {
        for (int j = 1; j < len2; j++)
        {
            if (str1[i] == str2[j])
            {
                dp[i][j] = dp[i - 1][j - 1]+1;//因为前一个公共子串肯定是横纵坐标-1处
            }
        }
    }
    int longest = 0;
    int longest_index = 0;
    for (int i = 0; i < len1; i++)
    {
        for (int j = 0; j < len2; j++)
        {
            if (longest < dp[i][j])
            {
                longest = dp[i][j];
                longest_index = i;
            }
        }
    }
    //输出公共子串,确定子串其实下标
    for (int i = longest_index-longest+1; i <=longest_index; i++)
    {
        cout << str1[i] << endl;
    }
    return longest;
}