seqstack.cpp

来自「数据结构中有关栈的知识」· C++ 代码 · 共 67 行

#include "seqstack.h"
#include <iostream>
using namespace std;

seqstack::seqstack()
{
	top=-1;
	maxsize=20;
	elements=new int[maxsize];
}

seqstack::~seqstack()
{
	delete []elements;
}


istream& operator >>(istream& in,seqstack& l)
{
	cout<<"请输入个数   1~"<< l.maxsize<<"之间"<<endl;
	int i;
	in>>i;
	for(int m=0;m<i;m++)
	{
		cout<<"输入第"<<m+1<<"个数"<<endl;
		in>>l.elements[m];
		l.top++;
	}
	return in;
}


ostream& operator <<(ostream& out,seqstack& l)
{
	if(l.isempty()==1)
		cout<<"栈为空，无法输出，请先建栈"<<endl;
	for(int i=0;i<=l.getsize();i++)
	{
		out<<'#'<<i+1<<':'<<l.elements[i]<<endl;
	}
	return out;
}


void seqstack::push()
{
	if(isfull())  cout<<"数组已满"<<endl;
	else 
	{
		cout<<"请输入要进栈的数"<<endl;
	    int x;
	    cin>>x;
	    top++;
	    elements[top]=x;
	}
}


void seqstack::pop()
{
	if(isempty())  cout<<"栈空，无法出栈,请先建栈"<<endl;
	else 
	{
		cout<<"出栈的数为"<<elements[top]<<endl;
		top--;
	}
}