C++队列——纸牌问题

//Author:PanDaoxi
#include <iostream>
using namespace std;
// 创建队列 
const int MaxSize=101;
int q[MaxSize],front=0,rear=0;
void push(int value){ // 入队操作 
	if(rear<MaxSize) q[rear++]=value; 
} 
int pop(){ // 出队操作 
	if(front!=rear) return q[front++];
}
int main(){
	int n,temp;
	cin>>n;	
	for(int i=1;i<=n;i++){
		push(i);
	}
	for(int i=1;i<=n;i++){
		cout<<pop()<<" ";
		push(pop());
	}
	return 0;
} 

标签：纸牌,队列,C++,int,MaxSize,push,front,rear
来源： https://blog.csdn.net/PanDaoxi2020/article/details/120401204