LeetCode 1578.替换所有的问号

原题链接：LeetCode 1578.替换所有的问号

Given a string s containing only lowercase English letters and the ’?' character, convert all the ‘?’ characters into lowercase letters such that the final string does not contain any consecutive repeating characters. You cannot modify the non ‘?’ characters.

It is guaranteed that there are no consecutive repeating characters in the given string except for ‘?’.

Return the final string after all the conversions (possibly zero) have been made. If there is more than one solution, return any of them. It can be shown that an answer is always possible with the given constraints.

Example 1:

Input: s = “?zs”
Output: “azs”
Explanation: There are 25 solutions for this problem. From “azs” to “yzs”, all are valid. Only “z” is an invalid modification as the string will consist of consecutive repeating characters in “zzs”.

Example 2:

Input: s = “ubv?w”
Output: “ubvaw”
Explanation: There are 24 solutions for this problem. Only “v” and “w” are invalid modifications as the strings will consist of consecutive repeating characters in “ubvvw” and “ubvww”.

Constraints:

• 1 <= s.length <= 100
• s consist of lowercase English letters and ‘?’.

---

思路：
替换字符只要和他前后都不一样就可以，因此用a、b、c就足够
遍历a、b、c，和它前后都不一样的时候，替换即可

---

c++实现：

class Solution {
public:
    string modifyString(string s) {
        for(int i = 0; i < s.length(); i ++ ){
            if(s[i] == '?'){
                for(char c = 'a'; c <= 'c'; ++c){
                    if((i > 0 && s[i-1] == c) || (i < s.length()-1 && s[i+1] == c))
                        continue;
                    s[i] = c;
                    break;
                }   
            }
        }
        return s;
    }
};