Package g1501_1600.s1576_replace_all_s_to_avoid_consecutive_repeating_characters

Class Solution

java.lang.Object
g1501_1600.s1576_replace_all_s_to_avoid_consecutive_repeating_characters.Solution
public class Solution extends java.lang.Object
1576 - Replace All ?’

s to Avoid Consecutive Repeating Characters.

Easy

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 '?'.

  • Constructor Summary

    Constructors
    Constructor
    Description
    Solution()
     

  • Method Summary

    Modifier and Type
    Method
    Description
    java.lang.String
    modifyString(java.lang.String s)
     

    Methods inherited from class java.lang.Object

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • modifyString

      public java.lang.String modifyString(java.lang.String s)