1
class Solution {
2
 public:
3
  bool canTransform(string start, string end) {
4
    int s = 0, e = 0;
5
    while (s <= start.size() and e <= end.size()) {
6
      while (s < start.size() and start[s] == 'X') {
7
        s++;
8
      }
9
      while (e < end.size() and end[e] == 'X') {
10
        e++;
11
      }
12
      if (s == start.size() or e == end.size()) {
13
        return s == start.size() and e == end.size();
14
      } else if (start[s] != end[e]) {
15
        return false;
16
      } else if (start[s] == 'R' and e < s) {
17
        return false;
18
      } else if (start[s] == 'L' and e > s) {
19
        return false;
20
      }
21
      s++;
22
      e++;
23
    }
24
    return true;
25
  }
26
};