class Solution {
public String predictPartyVictory(String senate) {
Queue<Integer> r = new LinkedList<>();
Queue<Integer> d = new LinkedList<>();
int len = senate.length();
// 给两个阵营进行初始化
for(int i = 0; i < len; i++) {
if(senate.charAt(i) == 'R') {
r.offer(i);
} else {
d.offer(i);
}
}
while(!r.isEmpty() && !d.isEmpty()) {
int rPoll = r.poll();
int dPoll = d.poll();
if(rPoll < dPoll) {
r.offer(rPoll+len);
} else {
d.offer(dPoll+len);
}
}
return r.isEmpty()?"Dire":"Radiant";
}
}