#include <stdio.h>
using namespace std;
#include <iostream>
#include<queue>
int main(){
queue<int> q;
for(int i=1;i<=5;i++) {
q.push(i); //push(i)用以将i压入队列,因此一次入队 1 2 3 4 5
}
int len = q.size();
cout<<"队列q原来的大小:"<< len <<endl;
queue<int> new_q;
for(int i=1;i<=len;i++) {
int temp = q.front();
new_q.push(temp);
q.pop(); //队首元素出队列(1 2 )出队列
q.push(temp);
}
cout<<endl<<"队列q现在的大小:"<< q.size() <<endl;
while (!q.empty())
{
cout << " " << q.front();
q.pop();
}
cout<<endl<<"队列new_q现在的大小:"<< new_q.size() <<endl;
while (!new_q.empty())
{
cout << " " << new_q.front();
new_q.pop();
}
cout<<endl;
return 0;
}
队列queue最简单的复制拷贝方式
最新推荐文章于 2024-06-26 21:39:44 发布