栈类

#include<iostream>
using namespace std;
class Stack
{
private:
	int i;
	int a[10];
public:
	Stack(int a=0){i=a;};
	void inStack(int x);
	int outStack();
	int getSize();
};
void Stack::inStack(int x)
{
	a[i]=x;
	i++;
	if(i>9)
		cout<<"栈已存满请换存"<<endl;
}
int  Stack::outStack()
{
	
	i--;
	if(i<0)
		cout<<"栈已空"<<endl;
	else
	return a[i];
}
int Stack::getSize()
{
	return i;
}
int main()
{
	Stack s;
	s.inStack(1);
	s.inStack(2);
	s.inStack(3);
	s.inStack(4);
	s.inStack(5);
	cout<<s.outStack()<<endl;
	cout<<s.outStack()<<endl;
	cout<<s.outStack()<<endl;
	cout<<"栈中含有"<<s.getSize()<<"个元素"<<endl;
	return 0;				
}
运行结果：