本文共 1965 字，大约阅读时间需要 6 分钟。

Generating Palindromes

Description

By definition palindrome is a string which is not changed when reversed. “MADAM” is a nice example of palindrome. It is an easy job to test whether a given string is a palindrome or not. But it may not be so easy to generate a palindrome.

Here we will make a palindrome generator which will take an input string and return a palindrome. You can easily verify that for a string of length n, no more than (n - 1) characters are required to make it a palindrome. Consider “abcd” and its palindrome “abcdcba” or “abc” and its palindrome “abcba”. But life is not so easy for programmers!! We always want optimal cost. And you have to find the minimum number of characters required to make a given string to a palindrome if you are only allowed to insert characters at any position of the string.

Input

Input starts with an integer T (≤ 200), denoting the number of test cases.

Each case contains a string of lowercase letters denoting the string for which we want to generate a palindrome. You may safely assume that the length of the string will be positive and no more than 100.

Output

For each case, print the case number and the minimum number of characters required to make string to a palindrome.

Sample Input

6 abcd aaaa abc aab abababaabababa pqrsabcdpqrs Sample Output Case 1: 3 Case 2: 0 Case 3: 2 Case 4: 1 Case 5: 0 Case 6: 9

实际就是找最大公共子序列裸体：

#include
   
    #include
    
     #include
     
      using namespace std;char st[110];int dp[110][110];int main(){    int T,nl = 0,i,j,pl;    scanf("%d",&T);    while(T--)    {        scanf("%s",st + 1);        pl = strlen(st + 1);        memset(dp,0,sizeof(dp));        for(i = pl - 1 ; i >= 1 ; i--)            for(j = i + 1 ; j <= pl ; j++)        {            if(st[i] == st[j])                dp[i][j] = dp[i + 1][j - 1];            else                dp[i][j] = min(dp[i + 1][j],dp[i][j - 1]) + 1 ;        }        printf("Case %d: %d\n",++nl,dp[1][pl]);    }    return 0;}
     
    
   

转载地址：https://blog.csdn.net/WYK1823376647/article/details/52618230 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！