import java.util.*;
public class Solution {
public String predictVictory (String s) {
Queue<Integer> D = new LinkedList<>(),R = new LinkedList<>();
for(int i=0;i<s.length();i++){
if(s.charAt(i)=='D')D.offer(i);
else R.offer(i);
}
while(!D.isEmpty()&&!R.isEmpty()){
int indexr = R.poll();
int indexd = D.poll();
if(indexr<indexd){//下标小的先行动
R.offer(indexr+s.length());
}else{
D.offer(indexd+s.length());
}
}
if(D.isEmpty())return "Red";
return "Dark";
}
}

京公网安备 11010502036488号