LeetCode #777 - Swap Adjacent in LR String

题目描述：

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

class Solution {
public:
    bool canTransform(string start, string end) {
        if(start.size()!=end.size()) return false;
        int n=start.size();
        int i=0;
        int j=0;
        while(i<n&&j<n)
        {
            while(i<n&&start[i]=='X') i++;
            while(j<n&&end[j]=='X') j++;
            // L只能让X向右移，R只能让X向左移，所以L和R的相对位置不会变
            if(start[i]!=end[j]) return false;
            // 只能对start操作，让其中的X相对于L往右移，或者相对于R往左移，所以L的下标只会减小，R的下标只会增大
            // 如果start[i]为L那么它对应end[j]必须满足i>=j，对start[i]为R同理
            if ((start[i]=='L'&&i<j)||(start[i]=='R'&&i>j)) return false;
            i++;
            j++;
        }
        return true;
    }
};