Description
In a string composed of ‘L’, ‘R’, and ‘X’ characters, like “RXXLRXRXL”, a move consists of either replacing one occurrence of “XL” with “LX”, or replacing one occurrence of “RX” with “XR”. Given the starting string start and the ending string end, return True if and only if there exists a sequence of moves to transform one string to the other.
Example
Example 1:1
2
3
4
5
6
7
8Input: start = "RXXLRXRXL", end = "XRLXXRRLX"
Output: true
Explanation: We can transform start to end following these steps:
RXXLRXRXL ->
XRXLRXRXL ->
XRLXRXRXL ->
XRLXXRRXL ->
XRLXXRRLX
Example 2:1
2Input: start = "X", end = "L"
Output: false
Example 3:1
2Input: start = "LLR", end = "RRL"
Output: false
Example 4:1
2Input: start = "XL", end = "LX"
Output: true
Example 5:1
2Input: start = "XLLR", end = "LXLX"
Output: false
Constraints:
- 1 <= start.length <= 104
- start.length == end.length
- Both start and end will only consist of characters in ‘L’, ‘R’, and ‘X’.
Solution
- Time Complexity:
- Space Complexity:
1 | class Solution { |