版权声明：本文为博主原创文章，如需转载请注明出处，谢谢。 https://blog.csdn.net/qq_38542085/article/details/80023828
今天正好下午没课，就接着昨天所看的课程一口气把郝斌老师有关栈的视频也刷完了，通过他用代码实现栈的常见操作使我对栈也有了一个进一步的认识，下面是我看过视频后参考郝斌老师的代码对栈常见功能的代码实现。
#include <stdio.h>
#include <stdlib.h>
typedef struct Node{
int data;
struct Node* pNext;
} Node,* PNode;
typedef struct Stack{//创建两个指针分别指向栈顶和栈底
PNode pTop;
PNode pBottom;//总是指向栈的头节点
} Stack,* PStack;
void init(PStack);//初始化一个栈
void push(PStack,int);//入栈
void traverse(PStack);//遍历
void pop(PStack,int*);//出栈
void clear(PStack);//重置栈中的数据
int main() {
Stack S;
int val;
init(&S);
push(&S,1);
push(&S,2);
push(&S,3);
push(&S,4);
push(&S,5);
push(&S,6);
traverse(&S);
pop(&S,&val);
printf("pop的值为%d\n",val);
traverse(&S);
clear(&S);
traverse(&S);
return 0;
}
void init(PStack pS){
pS->pTop = (PNode)malloc(sizeof(Node));
if(pS == NULL){
printf("分配内存失败!\n");
exit(-1);
}else{
pS->pBottom = pS->pTop;
pS->pBottom->pNext = NULL;
}
return;
}
void push(PStack pS,int val){
PNode pNew = (PNode)malloc(sizeof(Node));
pNew->data = val;
pNew->pNext = pS->pTop;
pS->pTop = pNew;
return;
}
void traverse(PStack pS){
if(pS->pTop == pS->pBottom){
printf("栈为空!\n");
return;
}else{
PNode p = pS->pTop;
while (p != pS->pBottom) {
printf("%d ",p->data);
p = p->pNext;
}
printf("\n");
}
return;
}
void pop(PStack pS,int* val){//这里的int *val是为了让用户知道pop的数据是什么
if(pS->pTop == pS->pBottom){
printf("栈为空!\n");
return;
}else{
*val = pS->pTop->data;
PNode p = pS->pTop;
pS->pTop = pS->pTop->pNext;
free(p);
p = NULL;
}
return;
}
void clear(PStack pS){
if(pS->pTop == pS->pBottom){
printf("栈为空!\n");
return;
}else{
PNode p = pS->pTop;
PNode q;
while (p != pS->pBottom) {
q = p;
p = p->pNext;
free(q);
q = NULL;
}
pS->pTop = pS->pBottom;
printf("已clear成功!\n");
return;
}
}