顺序栈

#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<time.h>
#define OK 1
#define ERROR 0
#define MAXSIZE 20
using namespace std;
typedef struct Stack
{
	int data[MAXSIZE];
	int top;
}sqstack;

//建立一个栈首，
int initial(sqstack *s)
{
	s->top = -1;
	return OK;
}
void  visit(int c)
{
	cout << c << endl;

}
int travel(sqstack s)
{
	int i = 0;
	while (i <= s.top)
	{
		visit(s.data[i++]);
	}
	cout << endl;
	return OK;
}



int push(sqstack*s, int c)
{
	if (s->top == MAXSIZE - 1)
		return  ERROR;
	s->top++;
	s->data[s->top] = c;
	return OK;

}
int main()
{
	sqstack s;
	int opp=2;
	int j;
	if (initial(&s) == OK)
	{
		cout << "建立成功" << endl;
		travel(s);
	}

	while (opp != 0)
	{
		cin >> opp;
		switch (opp){
		case 1:
			srand(time(0));
			for (j = 1; j <= 10; j++)
			{
				push(&s, rand() % 100 + 1);
			}
			travel(s);
			break;
		case 2:
			travel(s);
			break;
		case 0:
			exit(0);
		}
	}
}