seqstack.h

来自「数据结构中有关栈的知识」· C头文件 代码 · 共 21 行

#include <iostream>
using namespace std;
class seqstack
{
public:
	int *elements;
	int maxsize;
	int top;

    seqstack();
	~seqstack();
	void push();
	void pop();
	bool isfull() {return (top+1==maxsize)?1:0;}
	bool isempty() {return (top==-1)?1:0;}
	//void sort();
	int getsize() {return top;}
	friend ostream& operator <<(ostream& out,seqstack& l);
	friend istream& operator >>(istream& in,seqstack& l);
};