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 <= 100scontains only lower case English letters and ‘?’.
Solution: Greedy
For each ?, find the first one among ‘abc’ that is not same as left or right.
Time complexity: O(n)
Space complexity: O(1)
C++
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 |
class Solution { public: string modifyString(string s) { const int n = s.length(); for (int i = 0; i < n; ++i) { if (s[i] != '?') continue; for (char c : "abc") if ((i == 0 || s[i - 1] != c) && (i == n - 1 || s[i + 1] != c)) { s[i] = c; break; } } return s; } }; |
请尊重作者的劳动成果，转载请注明出处！花花保留对文章／视频的所有权利。
如果您喜欢这篇文章／视频，欢迎您捐赠花花。
If you like my articles / videos, donations are welcome.
huahualeetcode
Be First to Comment