模拟
class Solution {
public:
int countStudents(vector<int>& students, vector<int>& sandwiches) {
queue<int> que;
for(int d : students) que.push(d);
int size = 0;
int i = 0;
while(size != que.size()){
size = que.size();
int k = size;
while(k--){
if(que.front() == sandwiches[i]){
i++;
que.pop();
break;
}else{
que.push(que.front());
que.pop();
}
}
}
return que.size();
}
};