数据结构—栈

顺序结构

头定义

#define MAXSIZE 20
#define ERROR 0
#define OK 1

结构定义

//结构定义
typedef int SElemType;
typedef struct
{
    SElemType data[MAXSIZE];
    int top;                    //用于栈顶指针
}SqStack;

进栈操作Push

//进栈操作Push
Status Push(SqStack *S,SElemType e)
{
    if (S->top == MAXSIZE -1)   //栈满
        return ERROR;
    S->top++;                   //栈顶指针加一
    S->data[S->top]=e;          //将新插入元素赋值给栈顶空间
    return OK;
}

出栈操作Pop

//出栈操作Pop
Status Pop(SqStack *S,SElemType *e)
{
    if(S->top == -1)            //栈空
        return ERROR;
    *e = S->data[S->top];
    S->top--;
    return OK;
}

两栈共享空间结构

结构定义

//两栈共享空间结构
typedef struct
{
    SElemType data[MAXSIZE];
    int top1;
    int top2;
}SqDoubleStack;

进栈操作Push

//进栈操作push
Status Push(SqDoubleStack *S, SElemType e, int stacknumber)
{
    if(S->top1 + 1 == S->top2)   //栈满
        return ERROR;
    if(stacknumber == 1)
        S->data[++S->top1] = e;
    else if (stacknumber == 2)
        S->data[--S->top2] = e;
    return OK;
}

出栈操作Pop

//出栈操作pop
Status Pop(SqDoubleStack *S, SElemType *e, int stacknumber)
{
    if(stacknumber == 1)
    {
        if (S->top1 == -1)      //栈1为空栈
            return ERROR;
        *e = S->data[S->top1--];
    }
    else if (stacknumber == 2)
    {
        if (S->top2 == MAXSIZE)//栈2为空栈
            return ERROR;
        *e = S->data[S->top2++];
    }
    return OK;
}

链式结构

头定义

#include <stdlib.h>
#define MAXSIZE 20
#define ERROR 0
#define OK 1
typedef int Status;
typedef int SElemType;

结构定义

//结构定义
typedef struct StackNode
{
    SElemType data;
    struct StackNode *next;
}StackNode,*LinkStackPtr;

typedef struct LinkStack
{
    LinkStackPtr top;
    int count;
}LinkStack;

进栈操作Push

//进栈操作
Status Push(LinkStack *S, SElemType e)
{
    LinkStackPtr s = (LinkStackPtr)malloc(sizeof(StackNode));
    s->data = e;
    s->next = S->top;           //把当前的栈顶元素赋值给新结点的直接后继
    S->top = s;                 //将新结点s赋值给栈顶指针
    S->count++;
    return OK;
}

出栈操作Pop

//出栈操作
Status Pop(LinkStack *S, SElemType *e)
{
    LinkStackPtr p;
    if(S->top == NULL)          //判栈空，可单独写为StackEmpty函数
        return ERROR;
    *e = S->top->data;
    p = S->top;                 //将栈顶结点赋值给p
    S->top = S->top->next;      //使得栈顶指针下移一位，指向后一结点
    free(p);                    //释放p
    S->count--;
    return OK;

}