Class Solution
-
- All Implemented Interfaces:
public final class Solution1003 - Check If Word Is Valid After Substitutions\.
Medium
Given a string
s, determine if it is valid.A string
sis valid if, starting with an empty stringt = "", you can transformtintosafter performing the following operation any number of times:Insert string
"abc"into any position int. More formally,tbecomes <code>t<sub>left</sub> + "abc" + t<sub>right</sub></code>, where <code>t == t<sub>left</sub> + t<sub>right</sub></code>. Note that <code>t<sub>left</sub></code> and <code>t<sub>right</sub></code> may be empty.
Return
trueifsis a valid string, otherwise, returnfalse.Example 1:
Input: s = "aabcbc"
Output: true
Explanation: "" -> "<ins>abc</ins>" -> "a<ins>abc</ins>bc" Thus, "aabcbc" is valid.
Example 2:
Input: s = "abcabcababcc"
Output: true
Explanation: "" -> "<ins>abc</ins>" -> "abc<ins>abc</ins>" -> "abcabc<ins>abc</ins>" -> "abcabcab<ins>abc</ins>c" Thus, "abcabcababcc" is valid.
Example 3:
Input: s = "abccba"
Output: false
Explanation: It is impossible to get "abccba" using the operation.
Constraints:
<code>1 <= s.length <= 2 * 10<sup>4</sup></code>
sconsists of letters'a','b', and'c'
-
-
Constructor Summary
Constructors Constructor Description Solution()
-