顺序栈运算置空/判空/出栈/入栈/读栈顶元素

来源：互联网发布：final修饰数组编辑：程序博客网时间：2024/05/16 08:17

#include<iostream>#include<stdlib.h>#include<stdio.h>#define MAXSIZE 100using namespace std;//顺序栈的运算//顺序栈的类型struct seqstack{    int top ;    int data[MAXSIZE] ;};//置空栈void setnull(struct seqstack *s){    s->top = -1 ;}//判栈空int isempty(struct seqstack*s){    if(s->top == -1)        return 1 ;    return 0 ;}//进栈int push(struct seqstack *s , int x){    if(s->top == MAXSIZE -1)        return 0 ; //栈上溢，进栈不成功，返回0标志    s->top++ ;    s->data[s->top] = x ;    return 1 ; //进栈成功返回1}//出栈int pop(struct seqstack *s ){    if(s->top == -1)        return NULL ; //栈下溢无元素返回NULL    return s->data[s->top--] ;}//读栈顶元素int gettop(struct seqstack *s){    if(s->top == -1)        return NULL;    return s->data[s->top] ;}int main(){    struct seqstack *s ;    s = (struct seqstack *)malloc(sizeof(struct seqstack)) ;    setnull(s) ;    for(int i =1  ;i <10 ; i++)        push(s , i) ;    while(!isempty(s)){        cout<<"出栈顺序： "<<pop(s)<<endl ;    }   return 0 ;}

0 0