顺序栈的具体实现

顺序栈

#include <stdio.h>
#include <iostream>
#include <stdlib.h>
#include <string>
#include <string.h>
using namespace std;

#define STACK_INIT_SIZE 100
#define STACKINCREMENT 10

typedef struct{
    int * base;
    int * top;
    int stacksize;
}SqStack;//Sequence Stack

int InitStack(SqStack &S){
    S.base = (int * )malloc(STACK_INIT_SIZE * sizeof(int));//被赋予新的内存空间的地址
    if(!S.base)
        exit(-2);//内存分配失败
    S.top = S.base;
    S.stacksize = STACK_INIT_SIZE;
    return 1;
}

int push(SqStack &S, int e){//考虑到超出范围
    if(S.top - S.base > STACK_INIT_SIZE){
        S.base = (int * ) realloc (S.base, (S.stacksize + STACKINCREMENT) * sizeof (int));
        if(!S.base) 
            exit(-2);
        S.top = S.base + S.stacksize;
        S.stacksize += STACKINCREMENT; 
    }

    *S.top = e;
    S.top++;
    return 1;
}

int pop(SqStack &S){//竟然如此简单
    if (S.base == S.top)
        return 0;

    cout << * --S.top << ' ';//这里top改变了，出栈了
    return 1;
}
//销毁栈
int stack_destroy(SqStack &S)
{
    free(S.base);
    S.base = S.top = NULL;
    S.stacksize = 0;
    return 0;
}

int main(){
    SqStack S;
    InitStack(S);
    push(S,2);
    push(S,3);
    push(S,4);
    push(S,5);
    pop(S);
    pop(S);
    stack_destroy(S);
    pop(S);
}