8.13美团笔试-双端队列模拟
#include<iostream>
#include<vector>
#include<deque>
#include<algorithm>
using namespace std;
int main(){
deque<int> dq;
int n;
cin>>n;
vector<int> v(n);
vector<int> ans(n);
for(int i=0;i<n;i++){
cin>>v[i];
dq.push_back(i);
}
int b1,b2;
for(int i=0;i<n;i++){
b1 = dq.front();
dq.pop_front();
dq.push_back(b1);
b2 = dq.front();
dq.pop_front();
dq.push_back(b2);
ans[dq.front()] = v[i];
dq.pop_front();
}
for(int i=0;i<n;i++){
cout<<ans[i]<<" ";
}
}
查看1道真题和解析