实验三、顺序栈

设置top指针指示栈顶元素在数组中的位置，设储存元素的数组长度为stacksize

栈空时top=-1，栈满时top=stacksize-1

入栈top+1，出栈top-1

#include
   
   
    
    
using namespace std;
const int stacksize = 10;
class seqstack
{
public:
	seqstack() { top = -1; }
	~seqstack(){};
	void push(int x);
	int pop();
	int gettop() { if (top!=1) return data[top]; }
	int empty() { return(top == -1) ? 1 : 0; }
	void print();
private:
	int data[stacksize];
	int top;
};
void seqstack::push(int x)
{
	if (top == stacksize - 1)throw"上溢";
	top++;
	data[top] = x;
}
int seqstack::pop()
{
	if (top == -1)throw"下溢";
	int x = data[top--];
	return x;
}
void seqstack::print()
{
	for (int i = 0; i < top+1; i++)
		cout << data[i]<<",";
}
int main()
{
	seqstack a;
	a.push(20);
	a.print();
	cout << "\n" << endl;
	a.push(30);
	a.print();
}