<p>In a string composed of <code>&#39;L&#39;</code>, <code>&#39;R&#39;</code>, and <code>&#39;X&#39;</code> characters, like <code>&quot;RXXLRXRXL&quot;</code>, a move consists of either replacing one occurrence of <code>&quot;XL&quot;</code> with <code>&quot;LX&quot;</code>, or replacing one occurrence of <code>&quot;RX&quot;</code> with <code>&quot;XR&quot;</code>. Given the starting string <code>start</code> and the ending string <code>end</code>, return <code>True</code> if and only if there exists a sequence of moves to transform <code>start</code> to <code>end</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> start = &quot;RXXLRXRXL&quot;, end = &quot;XRLXXRRLX&quot;
<strong>Output:</strong> true
<strong>Explanation:</strong> We can transform start to end following these steps:
RXXLRXRXL -&gt;
XRXLRXRXL -&gt;
XRLXRXRXL -&gt;
XRLXXRRXL -&gt;
XRLXXRRLX
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> start = &quot;X&quot;, end = &quot;L&quot;
<strong>Output:</strong> false
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= start.length&nbsp;&lt;= 10<sup>4</sup></code></li>
	<li><code>start.length == end.length</code></li>
	<li>Both <code>start</code> and <code>end</code> will only consist of characters in <code>&#39;L&#39;</code>, <code>&#39;R&#39;</code>, and&nbsp;<code>&#39;X&#39;</code>.</li>
</ul>

class Solution {
public:
    int findLR(int s, string& str) {
        for (int i=s; i<str.length(); i++) {
            if (str[i] != 'X') return i;
        }
        return -1;
    }

    bool canTransform(string& start, string& end) {
        int s, e;
        bool ans = true;
        s = 0;
        e = 0;
        while (1) {
            int tmp1 = findLR(s, start);
            int tmp2 = findLR(e, end);

            printf("%d %d\n", tmp1, tmp2);

            if (tmp1 == -1 || tmp2 == -1) {
                ans = tmp1 == tmp2;
                break;
            }

            if (start[tmp1] != end[tmp2]) return false;
            else if (start[tmp1] == 'R') {
                if (tmp1 > tmp2) return false;
            } else if (start[tmp1] == 'L') {
                if (tmp1 < tmp2) return false;
            }
            s = tmp1 + 1;
            e = tmp2 + 1;
        }

        return ans;
    }
};
8700