百度机试：01串

最新推荐文章于 2024-05-20 22:14:20 发布

一步倾川

最新推荐文章于 2024-05-20 22:14:20 发布

阅读量60

点赞数

文章标签：前端算法 c++

本文链接：https://blog.csdn.net/weixin_43701995/article/details/126880200

版权

string help(string s) {
	while (s.size() > 3) {
		string temp = s.substr(0, 3);
		string temp1 = s.substr(3);
		int n0 = 0;
		for (auto& ss : temp) {
			if (ss = '0')n0++;
		}
		if (n0 % 2)s = "0" + temp1;
		else s = "1" + temp1;
	}
	if (s.size() <= 1)return "Yes";
	set<char>data(begin(s), end(s));
	if (s.size() == 2 && data.size() == s.size())return"No";
	if (s.size() == 2 && data.size() < s.size())return "Yes";
	if (s.size() == 3 && data.size() == s.size())return "Yes";
	if (s.size() == 3 && data.size() < s.size())return "Yes";
	return "No";
}
int main() {
	int n;
	cin >> n;
	while (n--) {
		string s;
		cin >> s;
		cout << help(s) << endl;
	}
	return 0;
}