顺序栈(sequence stack)

#include <stdio.h>#define MAXSIZE 1 << 10typedef int elemtype;typedef struct {elemtype data[MAXSIZE];int top;}seqstack;/* FUNCTIONseqstack_initDESCRIPTIONinitialize the sequence stackPARAMETERSp_seq_s: the pointer to sequence stackRETURNSvoid */void seqstack_init(seqstack * p_seq_s) {p_seq_s->top = 0;}/*FUNCTIONseqstack_emptyDESCRIPTIONjudge the sequence stack whether empty or notPARAMETERSp_seq_s: the pointer of sequence stackRETURNS1: the sequence stack is empty0: the sequence stack isn't empty */int seqstack_empty(seqstack * p_seq_s) {if (p_seq_s->top == 0) {return 1;} else {return 0;}}/*FUNCTIONseqstack_pushDESCRIPTIONpush the element in the sequence stackPARAMETERSp_seq_s: the pointer of sequence stackRETURNSflag: the flag whether the push operation successful or not */int seqstack_push(seqstack * p_seq_s, elemtype value) {int flag;if (p_seq_s->top == MAXSIZE) {flag = 0;} else {p_seq_s->data[p_seq_s->top++] = value;flag = 1;}return flag;}/*FUNCTIONseqstack_popDESCRIPTIONpop the element from stack's topPARAMETERSp_seq_s: the pointer of sequence stackRETURNSflag: the flag whethe the pop operatrion successful or not */int seqstack_pop(seqstack * p_seq_s) {int flag;if (p_seq_s->top == 0) {flag = 0;} else {p_seq_s->top--;flag = 1;}return flag;}/*FUNCTIONseqstack_topDESCRIPTIONget the top element in the stackPARAMETERSp_seq_s: the pointer of sequence stackRETURNSp_seq_s->data[p_seq_s->top - 1]: the top element in the sequence stack */elemtype seqstack_top(seqstack * p_seq_s) {return p_seq_s->data[p_seq_s->top - 1];}int main() {seqstack s;seqstack_init(&s);int i;for (i = 0; i < 20; i++) {seqstack_push(&s, i + 1);}while (!seqstack_empty(&s)) {printf("%d ", seqstack_top(&s));seqstack_pop(&s);}return 0;}