#include
#define Maxsize 50
using namespace std;
template
class SqQueue
{
public:
T *data;
int front,rear;
SqQueue()
{
data=new T[Maxsize];
front=0,rear=0;
}
~SqQueue()
{
delete [] data;
}
bool empty()
{
return rearfront;
}
bool Max()//判满
{
return (rear+1+Maxsize)%Maxsizefront;
}
bool push(T e)
{
if(Max())
return false;
rear++;
data[rear]=e;
return true;
}
bool pop(T &e)
{
if(empty())
return false;
front++;
e=data[front];
return true;
}
void Display()//输出函数
{
int x;
while(!empty())
{
pop(x);
cout<<x<<" ";
}
cout<<endl;
}
void ReQueue(SqQueue st,SqQueue sp)//核心函数
{
int e;
while(!empty())
{
pop(e);
if(front%2==0)
{
st.push(e);//偶数
}
else
{
sp.push(e);//奇数
}
}
while(!st.empty()||!sp.empty())
{
while(!st.empty())
{
st.pop(e);
push(e);
}
while(!sp.empty())
{
sp.pop(e);
push(e);
}
}
}
};
int main()
{
SqQueue sq,st,sp;
int i;
cout<<“建立队列:”;
while(cin>>i)
{
sq.push(i);
if(cin.get()==’\n’)
{
break;
}
}
sq.ReQueue(st,sp);
cout<<“重建后的队列:”;
sq.Display();
return 0;
}