栈

/*
   输入一组数，倒着输出，并且输出个数
*/
#pragma once
#include "Stack"
#include <iostream>

using namespace std;
const int MAXSIZE=1000;

class Stack
{
public:
	Stack(void);
	~Stack(void);
	//入栈
	void inStack(int num);
	//出栈
	int outStack();
	//返回栈中元素的个数
	int getSize();

private:
	int size;
	int array[MAXSIZE];
};

Stack::Stack(void)
{
	size=0;
}

Stack::~Stack(void)
{
}

void Stack::inStack(int num)
{
	if(size<MAXSIZE){
		//判断栈没有满
		array[size]=num;
		size++;
	}else{
		cout<<"栈已经满了"<<endl;
	}
}

int Stack::outStack()
{
	if(size<=0){
		return -404;
	}else{
		return array[--size];
	}
}

int Stack::getSize()
{
	return size;
}
int main()
{
	Stack s;
	s.inStack(10);
	s.inStack(20);
	s.inStack(30);
	s.inStack(40);
	s.inStack(50);
	s.inStack(60);

	cout<<s.outStack()<<endl;
	cout<<s.outStack()<<endl;
	cout<<s.outStack()<<endl;
	cout<<s.outStack()<<endl;
	cout<<s.outStack()<<endl;
	cout<<s.outStack()<<endl;
	cout<<s.outStack()<<endl;
	cout<<s.outStack()<<endl;
	cout<<s.outStack()<<endl;
	cout<<s.getSize()<<endl;
}