用队列和栈实现回文

什么是回文？"回文数"是一种数字。如：1986891, 这个数字正读是1986891,倒读也是1986891,正读倒读一样，所以这个数字就是回文数。

#include <iostream>
using namespace std;
typedef  int  DataType;
#define  MaxListSize 10 //栈的大小
//
class SeqStack
{
	DataType data[MaxListSize];
	int top;
public:
	SeqStack(void)
	{
		top  = 0;
	}
	~SeqStack() {};
	void push(const DataType& item);
	DataType Pop(void);
	DataType Peek(void) const; //读栈顶数据元素并返回
	int StackEmpty(void) const
	{
		return (top == 0);
	}
	int GetSize(void) const
	{
		return top;
	}
	void ClearStack(void)
	{
		top = 0;
	}
};
void SeqStack::push(const DataType& item)
{
	if (top == MaxListSize)
	{
		cout<<"堆栈已满"<<endl;
		exit(0);
	}
	data[top] = item;
	top++;
}
DataType SeqStack::Pop()   //出栈
{
	if (top == 0)
	{
		cout<<"堆栈以空"<<endl;
		exit(0);
	}
	top--;
	return data[top];
}
DataType SeqStack::Peek(void) const //得到栈顶的值
{
	if (top == 0)
	{
		cout<<"堆栈空！"<<endl;
		exit(0);
	}
	return data[top - 1];
}
//


class SeqQeue   //队列类
{
private:
	DataType data[MaxListSize];
	int front;
	int rear;
	int count; //元素个数计数器
public:
	SeqQeue(void)
	{
		front = rear = 0;
		count = 0;
	}
	~SeqQeue(void){}
	void QInsert(const DataType &item);
	DataType QDelete(void);
	DataType QFront(void) const;
	int QueueEmpty(void) const
	{
		return front == rear;
	}
	void ClearQueue(void)
	{
		front = rear = 0;
		count = 0;
	}
	int GetSize(void) const
	{
		return count;
	}
	
	
};
void SeqQeue::QInsert(const DataType& item)   //往队列中加入新的元素
{
	if (count == MaxListSize)
	{
		cout<<"queue is full"<<endl;
		exit(0);
	}
	data[rear] = item;   
	rear = (rear+1)%MaxListSize;
	count++;
}
DataType SeqQeue::QDelete()
{
	DataType temp;
	if (count == 0)
	{
		cout<<"队列已空"<<endl;
		exit(0);
	}
	temp = data[front];
	front = (front+1)%MaxListSize;
	count--;
	return temp;
}
DataType SeqQeue::QFront(void) const
{
	if (count == 0)
	{
		cout<<"queue is empty!"<<endl;
		exit(0);
	}
	return data[front];
}


//
void main()
{
	SeqStack myStack;
	SeqQeue myQueue;
	char str[80] = {0};
	cout<<"please input the char"<<endl;
	cin.getline(str,80);
	int h = strlen(str);
	for (int i = 0;i<h;i++)
	{
		myQueue.QInsert(str[i]);
		myStack.push(str[i]);
	}
	while (!myQueue.QueueEmpty())
	{
		if (myQueue.QDelete() != myStack.Pop())
		{
			cout<<"不是回文!"<<endl;
			return;
		}
	}
	cout<<"是回文！"<<endl;
}