使用链表实现了栈的基本功能 初始 入栈 出栈 Co-Authored-By: Jdhggg <111557398+Jdhggg@users.noreply.github.com>
44 lines
401 B
C
44 lines
401 B
C
#ifndef LINKED_LIST_STACK_H
|
|
#define LINKED_LIST_STACK_H
|
|
|
|
typedef struct stack_node
|
|
{
|
|
int value;
|
|
struct stack_node *next;
|
|
|
|
}stack_node;
|
|
|
|
typedef struct stack_linked
|
|
{
|
|
stack_node *top;
|
|
int size;
|
|
}stack_linked;
|
|
|
|
// 初始栈
|
|
stack_linked* init_stack_linked(void);
|
|
|
|
// 入栈
|
|
void push_stack_linked(stack_linked* s, int value);
|
|
|
|
// 出栈
|
|
int pop_stack_linked(stack_linked* s);
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#endif
|