题解 | 小红的回文串

#include <stdio.h>
#include <string.h>
//w,v,m,n,b,d,q,p,u

void chaifen(char a, char* p)
{
    int i = 0;
    while (p[i] != '\0') 
    {
        i++;
    }
    for (int j = i; j >= 0; j--) 
    {
        p[j + 1] = p[j];
    }
    p[0] = a;
    p[1] = a;
}

int panduan(char*p,char*q,int sz)
{
    int i=0;
    int flag=1;
    while ((p + i) <= (q - i))
{
    if (p[i] != q[-i])
    {
        if (((q[-i] == 'b') || (q[-i] == 'p') || (q[-i] == 'd') || (q[-i] == 'q')) && ((p[i] == 'b') || (p[i] == 'p') || (p[i] == 'd') || (p[i] == 'q')))
        {
            i++;
            continue;
        }
        else if (((q[-i] == 'n') || (q[-i] == 'u')) && ((p[i] == 'u') || (p[i] == 'n')))
        {
            i++;
            continue;
        }
        else return 0;

    }
    i++;
}
    return 1;
}

int main() 
{
    int n=0;
    scanf("%d",&n);
    while(n--)
    {
        char arr[10000]={0};
        scanf("%s",arr);
        char *p=arr+0;
        while(*p!='\0')
        {
            if(*p=='w') chaifen('v',p);
            if(*p=='m') chaifen('n',p);
            p++;
        }
        int sz =strlen(arr);      
        p=arr+0;
        char *q=arr+sz-1;
        int a=panduan(p,q,sz);
        if(a)
        printf("YES\n");
        else
        printf("NO\n");



    }
    return 0;
}