798A - Mike and palindrome

本文介绍了一个简单的字符串处理问题,即如何判断一个字符串是否可以通过仅改变一个字符而变为回文串。通过两端向中间遍历的方法,文章提供了一种有效的算法解决方案,并详细解释了算法的工作原理。

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

In this problem,we can change the only one character.We define a variable amount to count the number of different characters when we traverse from the both ends to the middle.When the amount>=2,it means we must change more than once,so we just print "NO".When the amount equals one,we just print "YES".But when the amount equals zero,what we should do depends on the size of the string.If the size is odd,we can just change the alphebet in the middle,so in this case,we can print "YES".However, when the size of the string is even,it means we have to change at least two alphebats.So we should print "NO".Well, that is all.微笑

#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<algorithm>
#include<queue>
using namespace std;

int main(){
	string s;
	while (cin >> s){
		int i = 0, j = s.size() - 1;
		int amount = 0;
		while (i < j){
			if (s[i] != s[j]) amount++;
			if (amount >= 2){
				cout << "NO" << endl;
				break;
			}
			i++;
			j--;
		}
		if (amount == 1) cout << "YES" << endl;
		else if (amount == 0){
			if (s.size() % 2)
				cout << "YES" << endl;
			else cout << "NO" << endl;
		}
	}
	system("pause");
	return 0;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值