<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:
    bool canTransform(string start, string end){
        vector<int>indexs,indexe;
        for(int i=0;i<(int)start.size();i++){
              if(start[i]=='R' || start[i]=='L'){
                 indexs.push_back(i);
              }
        }
        for(int i=0;i<(int)end.size();i++){
               if(end[i]=='R' || end[i]=='L'){
                indexe.push_back(i);
               }
        }
        if(indexs.size()==indexe.size()){
            bool p=true;
                for(int i=0;i<(int)indexs.size();i++){
                    if(start[indexs[i]]=='L' && end[indexe[i]]=='L' && indexs[i]>=indexe[i]){

                    }
                    else if(start[indexs[i]]=='R' && end[indexe[i]]=='R' && indexs[i]<=indexe[i]){

                    }
                    else{
                        p=false;
                        break;
                    }
                }
                return p;
        }
        else{
            return false;
        }
    }
};
9900