_1576.java

packagecom.fishercoder.solutions.secondthousand;

publicclass_1576 {
publicstaticclassSolution1 {
/*
 * Each char could have at most two neighbors, so we only need to toggle between three character candidates to avoid repetition.
 */
publicStringmodifyString(Strings) {
char[] arr = s.toCharArray();
for (inti = 0; i < arr.length; i++) {
if (arr[i] == '?') {
for (intj = 0; j < 3; j++) {
if (i > 0 && arr[i - 1] == 'a' + j) {
continue;
 } elseif (i < arr.length - 1 && arr[i + 1] == 'a' + j) {
continue;
 } else {
arr[i] = (char) ('a' + j);
break;
 }
 }
 }
 }
returnString.valueOf(arr);
 }
 }
}