C++ stack实现 stac.h

#include<iostream>
using namespace std;

class Stack{


public:
	enum {MaxStack = 5}
	void init() {top=-1;}

	void push(int n)
	{
		if(isFull()){
			errMsg("Full stack. Can‘t push.");
			return;
		}
		arr[++top] = n;
	}

	int pop(){
		if(isEmpty()){
			errMsg("Empty stack.Popping dummy value.");
			return dummy_val;
		}
		return arr[top--];
	}
	
	bool isEmpty(){return top<0;}
	bool isFull(){return top>MaxStack - 1;}
	void dump(){
		for(int i=top;i>=0;i--)
			cout<<"\t"<<arr[i]<<"\n";
	}
private:
	void errMsg(const char* msg) const{
		cerr<<"\n*** Stack operation failure: "<<msg<<endl;
	}
	int top;
	int arr[MaxStack];
	int dummy_val;

};

C++ stack实现 stac.h,布布扣,bubuko.com

C++ stack实现 stac.h

原文：http://blog.csdn.net/slience_perseverance/article/details/20134005