Given a string s containing only lower case English letters and the '?' character, convert all the '?' characters into lower case 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". Example 3:
Input: s = "j?qg??b" Output: "jaqgacb" Example 4:
Input: s = "??yw?ipkj?" Output: "acywaipkja"
Constraints:
1 <= s.length <= 100
s contains only lower case English letters and '?'.
public class Solution {
public string ModifyString(string s) {
if(s.Length == 0){
return "";
}
if(s.Length==1){
return s[0]=='?'?"a":s;
}
var arr = s.ToCharArray();
for(int i=0;i<arr.Length;i++){
if(arr[i]=='?'){
if(i==0){
if(arr[i+1]=='a'){
arr[i]='b';
}
else{
arr[i]='a';
}
}
else if(i==arr.Length-1){
if(arr[i-1]=='a'){
arr[i]='b';
}
else{
arr[i]='a';
}
}
else{
if(arr[i-1]=='a' || arr[i+1]=='a'){
if(arr[i-1]=='b' || arr[i+1]=='b'){
arr[i]='c';
}
else{
arr[i]='b';
}
}
else{
arr[i]='a';
}
}
}
}
return new string(arr);
}
}Time Complexity: O(n)
Space Complexity: O(n)
