Acknowledgement:
感谢大神 shenweihai
原题解链接:https://leetcode.com/problems/swap-adjacent-in-lr-string/discuss/217070/Python-using-corresponding-position-
Description:
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 <= len(start) = len(end) <= 10000.
- Both start and end will only consist of characters in {‘L’, ‘R’, ‘X’}.
Analysis:
Code:
class Solution {
public boolean canTransform(String start, String end) {
List<Record> list1 = getRecords(start);
List<Record> list2 = getRecords(end);
if(list1.size() != list2.size()) {
return false;
}
for(int i = 0; i < list1.size(); i++) {
Record record1 = list1.get(i), record2 = list2.get(i);
char ch1 = record1.getCh(), ch2 = record2.getCh();
int index1 = record1.getIndex(), index2 = record2.getIndex();
if(ch1 != ch2) {
return false;
}else {
if(ch1 == 'L' && index1 < index2) {
return false;
}else if(ch1 == 'R' && index1 > index2) {
return false;
}
}
}
return true;
}
public List<Record> getRecords(String s) {
List<Record> list = new ArrayList<>();
char[] ch = s.toCharArray();
for(int i = 0; i < ch.length; i++) {
if(ch[i] == 'L' || ch[i] == 'R') {
list.add(new Record(i, ch[i]));
}
}
return list;
}
}
class Record {
int index;
char ch;
public Record(int index, char ch) {
this.index = index;
this.ch = ch;
}
public int getIndex() {
return index;
}
public char getCh() {
return ch;
}
}