版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/u013554860/article/details/82957060
https://leetcode.com/problems/dota2-senate/description/
class Solution {
public:
string predictPartyVictory(string senate) {
int n = senate.length();
queue<int> Q1, Q2;
for(int i=0; i<n; i++){
if(senate[i]=='R'){
Q1.push(i);
}
else
Q2.push(i);
}
while (!Q1.empty()&&!Q2.empty()) {
int i = Q1.front(); Q1.pop();
int j = Q2.front(); Q2.pop();
if(i<j) Q1.push(i+n);
else Q2.push(j+n);
}
return Q1.size()>Q2.size()?"Radiant" : "Dire";
}
};