52 lines
891 B
C
52 lines
891 B
C
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include "linked_list_stack.h"
|
|
|
|
// 初始栈
|
|
stack_linked* init_stack_linked(void)
|
|
{
|
|
stack_linked* s = (stack_linked*)malloc(sizeof(stack_linked));
|
|
if (s == NULL)
|
|
{
|
|
printf("内存分配失败！\n");
|
|
return NULL;
|
|
}
|
|
s->top = NULL;
|
|
s->size = 0;
|
|
return s;
|
|
}
|
|
|
|
// 入栈
|
|
void push_stack_linked(stack_linked* s, elem_type value)
|
|
{
|
|
stack_node* node = (stack_node*)malloc(sizeof(stack_node));
|
|
if (node == NULL)
|
|
{
|
|
printf("内存分配失败！\n");
|
|
return NULL;
|
|
}
|
|
node->value = value;
|
|
node->next = s->top;
|
|
s->top = node;
|
|
s->size++;
|
|
}
|
|
|
|
// 出栈
|
|
int pop_stack_linked(stack_linked* s)
|
|
{
|
|
int flog = 0;
|
|
flog = s->top->value;
|
|
stack_node* tmp = s->top;
|
|
s->top = s->top->next;
|
|
free(tmp);
|
|
tmp = NULL;
|
|
return flog;
|
|
}
|
|
void print_linked(stack_linked* s) {
|
|
stack_node* L = s->top;
|
|
while (L != NULL) {
|
|
printf("%d", L->value);
|
|
L = L->next;
|
|
}
|
|
printf("\n");
|
|
} |