test.cpp

数据结构汉诺塔

#include <iostream.h>

class stack
{
public:
	stack();
	bool push(int);
	bool pop();
private:
	int base;
	int top;
	int Array[4];
}
stack::stack()
{
	base = 0;
	top  = 0;
}
bool stack::push(int x)
{
	if(top == 3)
	{
		cout<<"堆栈已满，因此不能入栈"<<endl;
		return false;
	}
	else
	{
		Array[top] = x;
		top++;
		return true;
	}
}
bool stack::pop()
{
	if(top == 0 )
	{
		cout<<""<<endl;
		return false;
	}
	else
	{
		top--;
		return true;
	}
}