CodeForces 665C Simple Strings

最新推荐文章于 2020-09-28 13:46:14 发布

原创最新推荐文章于 2020-09-28 13:46:14 发布 · 790 阅读

0 ·

CC 4.0 BY-SA版权

贪心专栏收录该内容

29 篇文章

订阅专栏

本文介绍了一种通过最小数量的字符更改使字符串变得简单的算法。该算法确保相邻字符不同，并给出了解决方案的具体实现代码，包括输入输出示例。

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

题意：现在给你一个串，让你使得相邻的字符都不一样，要求修改的字符最少

问你最后的字符串长什么样

思路：贪心，如果这个位置一样，那就变化就好了

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

string s;
int main()
{
    cin>>s;
    s+='a';
    for(int i=1;i<s.size()-1;i++)
    {
        if(s[i]==s[i-1])
        {
            for(int j=0;j<26;j++)
            {
                if(j+'a'==s[i-1]||(j+'a')==s[i+1])
                    continue;
                s[i]=char(j+'a');
                break;
            }
        }
    }
    for(int i=0;i<s.size()-1;i++)cout<<s[i];
    cout<<endl;
}

Description

zscoder loves simple strings! A string t is called simple if every pair of adjacent characters are distinct. For example ab, aba, zscoder are simple whereas aa, add are not simple.

zscoder is given a string s. He wants to change a minimum number of characters so that the string s becomes simple. Help him with this task!

Input

The only line contains the string s (1 ≤ |s| ≤ 2·10⁵) — the string given to zscoder. The string s consists of only lowercase English letters.

Output

Print the simple string s' — the string s after the minimal number of changes. If there are multiple solutions, you may output any of them.

Note that the string s' should also consist of only lowercase English letters.

Sample Input

Input