DP问题---添加字符把字符串变为回文字符串

问题详情

求解思路

f[i,j] = 0; if(i>=j)
f[i,j] = f[i+1,j-1]; if(i<j && s[i] == s[j])
f[i,j] = min(f[i+1,j],f[i,j-1]) +1 ; if(i < j && s[i] != s[j])

解题代码

#include<iostream>
#include<cstring>
#include<string>
#include<cstdlib>
#include<cmath>
using namespace std;

#define MAXSIZE 100

int f[MAXSIZE][MAXSIZE];

int main(){

string s;

while(cin >> s){

memset(f,0,sizeof(f));

for (int i = s.length() - 1; i >= 0; --i)
{
for (int j = i+1; j < s.length(); j++)
{
if(s[i] == s[j])
f[i][j] = f[i+1][j-1];
else
{
f[i][j] = min(f[i+1][j],f[i][j-1]) + 1;
}
}
}

cout<<f[0][s.length()-1]<<endl;
}
return 0;
}