1.构造回文

1.题目链接：构造回文

2.Code 最长公共子序列知识介绍（LCS图解）

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e3+5;


int dp[maxn][maxn];

int LCS(char * str1, char* str2)
{
    int len1 = strlen(str1);
    int len2 = strlen(str2);
    memset(dp,0,sizeof(dp));

    for(int i = 0; i < len1; ++i){
        for(int j = 0; j < len2; ++j){
            if(str1[i] == str2[j]){
                dp[i+1][j+1] = dp[i][j] + 1;
            }else{
                dp[i+1][j+1] = max(dp[i][j+1],dp[i+1][j]);
            }
        }
    }
    return dp[len1][len2];
}

int main()
{   
    char str[maxn];
    char reverse[maxn];

    while(cin>>str){
        int len = strlen(str);
        memset(reverse,0,sizeof(reverse));
        for(int i = 0; i < len; ++i){
            reverse[i] = str[len-1-i];
        }
        cout<<len-LCS(str,reverse)<<endl;
    }

    return 0;
}


/**
abcda
google

2
2

*/