1,链式栈
1.1链表基本框架
typedef int Data;
typedef struct _Node
{
Data data;
struct _Node* next;
}Node;
typedef struct _LinkStack
{
int size;
Node* front;
}LinkStack;
1.2创建一个链表
LinkStack* createLinkStack()
{
LinkStack* s = calloc(1, sizeof(LinkStack));
assert(s != NULL);
s->front = calloc(1, sizeof(Node));
assert(s->front != NULL);
s->size = 0;
return s;
}
1.3创建一个新结点
static Node* createNode(Data val)
{
Node* newNode = calloc(1, sizeof(Node));
if (!newNode)
{
return NULL;
}
newNode->data = val;
return newNode;
}
1.4插入
void push(LinkStack* s, Data val)
{
Node* newNode = createNode(val);
newNode->next = s->front->next;
s->front->next = newNode;
s->size++;
}
1.5删除
void pop(LinkStack* s)
{
assert(!empty(s));
Node* delNode = s->front->next;
s->front->next = delNode->next;
free(delNode);
s->size--;
}
1.6获取栈顶元素
Data top(LinkStack* s)
{
assert(!empty(s));
return s->front->next->data;
}
1.7大小
int size(LinkStack* s)
{
return s->size;
}
1.8判空
#include<stdbool.h>
bool empty(LinkStack* s)
{
return s->size == 0;
}