回文是一个从左向右读和从右向左读都一样的单词或短语。对于给定的字符串，请判断是否存在一个与原字符串长度相同，且与原字符串最多只有一个字符不同的回文串。
输入格式
输入包含一行，为一个长度在 $2$ 到 $100\,000$ 之间的字符串，由小写拉丁字母组成。
输出格式
如果存在一个与原字符串长度相同，且与原字符串最多只有一个字符不同的回文串，则输出 YES，否则输出 NO。
样例
输入格式 1
motor
输出格式 1
YES
输入格式 2
hello
输出格式 2
NO
QOJ.ac
QOJ
حد الوقت: 1 s
حد الذاكرة: 256 MB
مجموع النقاط: 100
#7828. 回文
الإحصائيات
تم استخدام هذه المسألة في المسابقات التالية:
AI Translation —
This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.
Discussions
About Discussions
The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
Open Discussions 0
No discussions in this category.
Issues
About Issues
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines:
- This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
- Do not submit duplicated issues.
- Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.