Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public:
- bool canTransform(string start, string end) {
- vector<pair<int, int>> s, d;
- for(int i=0; i<start.size(); i++){
- if(start[i] != 'X')
- s.push_back({start[i], i});
- }
- for(int i=0; i<end.size(); i++){
- if(end[i] != 'X')
- d.push_back({end[i], i});
- }
- if(s.size() != d.size()) return false;
- for(int i=0; i<s.size(); i++){
- if(s[i].first != d[i].first) return false;
- if(s[i].first == 'L' && d[i].second > s[i].second) return false;
- if(s[i].first == 'R' && d[i].second < s[i].second) return false;
- }
- return true;
- }
- };
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement