題目:計算將一個字符串變為回文串需要最少插入多少字符,并輸出對應的回文串。
分析:dp,動態規劃。區間動態規劃,可以用自己和自己的反轉計算。
定義狀態:f[i][j]為【i,j】區間上的串變為回文串需要的最少插入的字符;
轉移方程:f[i][j] = min(f[i+1][j]+1, f[i][j-1]+1); (str[i] ≠str[j])
f[i][j] = min(f[i+1][j]+1, f[i][j-1]+1, f[i+1][j-1]);(str[i] = str[j])
說明:注意計算順序按長度遞增。╮(╯▽╰)╭。
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
char words[1005];
char other[1005];
int dp[1005][1005];
int operators[1005][1005];
void output(int l, int r)
{
if (l > r) {
return;
}else if (l == r) {
printf("%c",words[l-1]);
}else if (operators[l][r] == 1) {
printf("%c",words[l-1]);
output(l+1, r-1);
printf("%c",words[l-1]);
}else if (operators[l][r] == 2) {
printf("%c",words[l-1]);
output(l+1, r);
printf("%c",words[l-1]);
}else {
printf("%c",words[r-1]);
output(l, r-1);
printf("%c",words[r-1]);
}
}
int main()
{
while (~scanf("%s",words)) {
int length = strlen(words);
for (int i = 0; i <= length; ++ i) {
for (int j = 0; j <= length; ++ j) {
operators[i][i] = 0;
dp[i][j] = length*2-1;
if (i >= j) {
dp[i][j] = 0;
}
}
}
for (int l = 1; l <= length; ++ l) {
for (int s = 1; s+l-1 <= length; ++ s) {
int e = s+l-1;
if (words[s-1] == words[e-1]) {
dp[s][e] = dp[s+1][e-1];
operators[s][e] = 1;
}
if (dp[s][e] > dp[s+1][e]+1) {
dp[s][e] = dp[s+1][e]+1;
operators[s][e] = 2;
}
if (dp[s][e] > dp[s][e-1]+1) {
dp[s][e] = dp[s][e-1]+1;
operators[s][e] = 3;
}
}
}
printf("%d ",dp[1][length]);
output(1, length);
puts("");
}
return 0;
}