777

777. Swap Adjacent in LR String (Medium)

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:

Input: start = "RXXLRXRXL", end = "XRLXXRRLX"
Output: True
Explanation:
We can transform start to end following these steps:
RXXLRXRXL ->
XRXLRXRXL ->
XRLXRXRXL ->
XRLXXRRXL ->
XRLXXRRLX

Note:

1. 1 <= len(start) = len(end) <= 10000.
2. Both start and end will only consist of characters in {'L', 'R', 'X'}.

Companies:
Google

Related Topics:
Brainteaser

Solution 1.

// OJ: https://leetcode.com/problems/swap-adjacent-in-lr-string/
// Author: github.com/lzl124631x
// Time: O(N)
// Space: O(N)
class Solution {
public:
    bool canTransform(string start, string end) {
        int N = start.size();
        string a = start, b = end;
        a.erase(remove(a.begin(), a.end(), 'X'), a.end());
        b.erase(remove(b.begin(), b.end(), 'X'), b.end());
        if (a != b) return false;
        for (int i = 0, j = 0; i < N; ++i) {
            if (start[i] == 'L') {
                while (end[j] != 'L') ++j;
                if (i < j++) return false;
            }
        }
        for (int i = 0, j = 0; i < N; ++i) {
            if (start[i] == 'R') {
                while (end[j] != 'R') ++j;
                if (i > j++) return false;
            }
        }
        return true;
    }
}; 

Solution 2.

// OJ: https://leetcode.com/problems/swap-adjacent-in-lr-string/
// Author: github.com/lzl124631x
// Time: O(N)
// Space: O(1)
class Solution {
public:
    bool canTransform(string start, string end) {
        int i = 0, j = 0, N = start.size();
        for (; i < N && j < N; ++i, ++j) {
            while (i < N && start[i] == 'X') ++i;
            while (j < N && end[j] == 'X') ++j;
            if ((i < N) ^ (j < N)) return false;
            if (i < N && j < N) {
                if (start[i] != end[j]
                   || (start[i] == 'L' && i < j)
                   || (start[i] == 'R' && i > j)) return false;
            }
        }
        return true;
    }
};