#include <iostream>
using namespace std;
#define MAXSIZE 100
#define OK 1
#define ERROR 0
typedef int SElemType;
typedef int Status;
typedef struct
{
SElemType data[MAXSIZE];
int top;
}SqStack;
Status Push(SqStack* S, SElemType e )
{
if (S->top == MAXSIZE - 1)
{
return ERROR;
}
S->top++;
S->data[S->top] = e;
return OK;
}
Status Top(SqStack* S, SElemType* e)
{
if (S->top == -1)
{
return ERROR;
}
*e = S->data[S->top];
S->top--;
return OK;
}
数据结构三栈的顺序存储结构
最新推荐文章于 2022-12-10 18:18:24 发布