Mike and palindrome

最新推荐文章于 2020-07-08 18:44:15 发布

cherkid

最新推荐文章于 2020-07-08 18:44:15 发布

阅读量237

点赞数

CC 4.0 BY-SA版权

分类专栏：水题

本文链接：https://blog.youkuaiyun.com/cherkid/article/details/78461004

水题专栏收录该内容

9 篇文章

订阅专栏

本文介绍了一个简单的算法问题，即如何通过更改一个字符使一个由小写英文字母组成的字符串变成回文串。文章提供了输入输出示例，并附带了一个C++代码示例，该示例使用了一个简洁的方法来解决这个问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Mike has a string s consisting of only lowercase English letters. He wants to change exactly one character from the string so that the resulting one is a palindrome.

A palindrome is a string that reads the same backward as forward, for example strings "z", "aaa", "aba", "abccba" are palindromes, but strings "codeforces", "reality", "ab" are not.

Input

The first and single line contains string s (1 ≤ |s| ≤ 15).

Output

Print "YES" (without quotes) if Mike can change exactly one character so that the resulting string is palindrome or "NO" (without quotes) otherwise.

Example

Input

abccaa

Output

YES

Input

abbcca

Output

NO

Input

abcda

Output

YES

以为注意了数组长度为1时就会不被坑了，怎知，还有当字符串是回文时并长度为奇数是也是符合的。

#include<bits/stdc++.h>
using namespace std;

int main()
{
    char c[16];
    while(scanf("%s",&c)!=EOF)
    {
        int len = strlen(c);
        int n=0;
        for(int i=0;i<len;i++)
        {
            if(c[i]!=c[len-i-1])
            n++;
        }

        if(len==1)
        printf("YES\n");
        else
        {
            if(n==2)
            printf("YES\n");
            else
            if(n==0&&len%2!=0)
            printf("YES\n");
            else
          {
            printf("NO\n");
          }
        }

    }
    return 0;
}