Codeforces 798A -Mike and palindrome

最新推荐文章于 2021-04-27 12:27:23 发布

shyoldman

最新推荐文章于 2021-04-27 12:27:23 发布

阅读量364

点赞数

CC 4.0 BY-SA版权

分类专栏：就当它是水题吧

本文链接：https://blog.youkuaiyun.com/qq_37943488/article/details/74783759

就当它是水题吧专栏收录该内容

93 篇文章

订阅专栏

本文介绍了一个算法问题：通过更改字符串中的一个字符来判断其是否能变成回文串。文章提供了完整的C语言实现代码，并解释了核心逻辑，包括如何处理奇数长度的字符串特殊情况。

Mike has a string s consisting of only lowercase English letters. He wants tochange 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 changeexactly 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

题意是给你一个字符串，只改变字符串中的一个字符能否使它变为回文的字符串，坑点在于像“aaa"这种，它改中间的字母也是可以变为字符串的，还有单个字母的字符串例如“a"也是可以的

#include<stdio.h>
#include<string.h>
int main(){
	char str[100];
	scanf("%s",str);
	int count=0;
	int i;
	int len=strlen(str);
	for(i=0;i<=len-i-1;i++){
		if(str[i]!=str[len-i-1])
			count++;
		if(count>1)
			break;
	}
	if(len%2==1&&(count==0||count==1))
		printf("YES");
	else{
		if(count==1)
			printf("YES");
		else
			printf("NO");
	}
}