1.代码实现
#include<stdio.h>
#include <cstdlib>
//栈的初始长度
#define STACK_INIT_SIZE 100
//栈满时,栈的每次增加的大小
#define STACKINCREMENT 10
//栈中的数据类型是int
typedef int SElemType;
//定义栈的栈底指针,栈顶指针,以及栈的容量
typedef struct {
SElemType *base;
SElemType *top;
int stacksize;
} SqStack;
//栈的初始化
SqStack *InitStack() {
//栈的声明
SqStack *S ;
//申请一个STACK_INIT_SIZE * sizeof(SElemType)大小的内存,把地址赋给了S->base
S->base = (SElemType *) malloc(STACK_INIT_SIZE * sizeof(SElemType));
//空栈,栈底和栈顶地址相同
S->top = S->base;
//设置大小
S->stacksize = STACK_INIT_SIZE;
printf("输入任意数字,一个数字一行,并以0结束\n");
SElemType n;
scanf("%d", &n);
//当输入值不为0时,输入值入栈
while (n != 0) {
//判断是否栈满
if (S->top - S->base <= S->stacksize) {
//先给S->top所在的地址赋值为n,后栈顶指针后移
*S->top++ = n;
} else {
//栈满,realloc函数申请增加内存
S->base = (SElemType *) realloc(S->base, (STACKINCREMENT + S->stacksize) * sizeof(SElemType));
}
scanf("%d", &n);
}
return S;
}
//打印栈内所有的元素
void printALl(SqStack *S) {
SElemType *p = S->base;
printf("栈的所有元素为:");
while (S->base - S->top < 0) {
printf(" %d,", *S->base++);
}
printf("\n");
S->base = p;
}
//入栈操作
SqStack *push(SqStack *S, SElemType e) {
//判断,如果栈满,申请内存
if (S->base - S->top >= S->stacksize) {
S->base = (SElemType *) realloc(S->base, (STACKINCREMENT + S->stacksize) * sizeof(SElemType));
}
//先给栈顶指针所在的地址存值,后指针上移
*S->top++ = e;
return S;
}
//出栈操作
SqStack *pop(SqStack *S) {
//直接栈顶指针下移
--S->top;
return S;
}
//获取栈顶元素
SElemType getTop(SqStack *S) {
if (S->base != S->top) {
return *--S->top;
}
}
int main() {
//构造栈,初始化
SqStack *S;
S = InitStack();
printALl(S);
//入栈,让然后打印所有的站栈元素
printf("请输入你行你想入栈的值:\n");
SElemType n;
scanf("%d", &n);
S = push(S, n);
printALl(S);
//输入1,出栈
printf("输入1来决定是否出栈\n");
scanf("%d", &n);
if (n == 1) {
S = pop(S);
}
printALl(S);
//获取栈顶元素
printf("栈顶元素为:");
printf("%d", getTop(S));
}
栈只需要两个指针,分别指向栈顶和栈底,遵循LIFO(后进先出)。实现的时候只需要申请一段连续内存,然后栈底指针指向首地址,栈顶指针不断地后移就可以了,入栈出栈,都移动栈顶指针。