#include <stdio.h>
#include <malloc.h>
typedef struct LNode {
int val;
struct LNode *next;
}node;
typedef struct Stack {
node *top;
int size;
}stack;
stack *create()
{
stack *stk = (stack *)malloc(sizeof(stack));
stk->size = 0;
stk->top = NULL;
return stk;
}
void push(stack *s, int val)
{
node *p = (node *)malloc(sizeof(node));
p->val = val;
p->next = s->top;
s->top = p;
++ s->size;
}
void pop(stack *s, int *val)
{
node *tmp = s->top;
*val = s->top->val;
s->top = s->top->next;
-- s->size;
free(tmp);
}
void destroy(stack *s)
{
if (!s->size) {
free(s);
}
}
int main()
{
stack *stk;
//stk = (stack *)malloc(sizeof(stack));
stk = create();
int a = 1, b = 2;
int c;
push(stk, a);
push(stk, b);
while (stk->size > 0) {
printf("%d\n", stk->top->val);
pop(stk, &c);
}
destroy(stk);
return 0;
}
链式栈的实现
最新推荐文章于 2021-08-14 21:39:55 发布