顺序栈

Head file

using ElementType = int;
#define MaxSzie 100
#define  Eof -1
using PtrTop = int;
struct SeqStack{
    ElementType data[MaxSzie];
    PtrTop top;
};
using PtrStack = SeqStack*;
void InitStack(PtrStack p);
bool IsEmpty(PtrStack p);
void Push(PtrStack p, ElementType value);
void Pop(PtrStack p);
ElementType Top(PtrStack p);
int StackLength(PtrStack p);
void ClearStack(PtrStack p);

Function body

/*Implementaiton of SeqStack */
#include <iostream>
#include "标头.h"
bool IsEmpty(PtrStack p){
    return p->top == Eof;
}
void InitStack(PtrStack p){
    p->top = Eof;
    std::cout << "Initialize successfully \n";
}
void Push(PtrStack p, ElementType value){
    if (p->top == MaxSzie - 1){
        std::cout << "The stack is full \n";
        exit(0);
    }
    p->data[++p->top] = value;
}
void Pop(PtrStack p){
    if (IsEmpty(p)){
        std::cout << "The stack is empty \n";
        exit(0);
    }
    --p->top;
}
ElementType Top(PtrStack p){
    if (IsEmpty(p)){
        std::cout << "The stack is empty \n";
        exit(0);
    }
    ElementType temp = p->data[p->top];
    return temp;
}
int StackLength(PtrStack p){
    return p->top + 1;
}
void ClearStack(PtrStack p){
    p->top = Eof;
    std::cout << "Over \n";
}

Test

int main(){
    PtrStack S = new SeqStack;
    InitStack(S);
    for (int i = 0; i < 10; ++i)
        Push(S, i + 1);
    std::cout << "Check if the stack is empty : ";
    if (IsEmpty(S))
        std::cout << "Empty \n";
    else
        std::cout << "Not empty \n";
    std::cout << "The first element is :" << Top(S);
    Pop(S);
    std::cout << "The first element is :" << Top(S);
    ClearStack(S);
    std::cout << "Check if the stack is empty : ";
    if (IsEmpty(S))
        std::cout << "Empty \n";
    else
        std::cout << "Not empty \n";
    std::cout << "\n";
}

写的比较简陋，有些特殊情况的检测都省略了。因为大部分操作都类似顺序表。