#include <malloc.h>
#include <stdio.h>
#define OK 1
#define ERROR 0
typedef int Status;
typedef int ElemType;
typedef struct LNode
{
ElemType data;
struct LNode * next;
} Lnode,*LinkList;
LinkList InitList();
Status Push(LinkList L, ElemType e);
int Pop(LinkList L);
void bianli(LinkList L);
int main()
{
LinkList L;
int x;
L = InitList(); //初始化链栈
Push(L,1);
Push(L,2);
Push(L,3);
bianli(L);
x = Pop(L);
printf(" %d\n", x);
return 0;
}
/*void InitList(LinkList L)
{
L->next = NULL;
}*/
/* 请在这里填写答案 */
LinkList InitList()
{
LinkList head;
head = (LinkList)malloc(sizeof(Lnode));
head->next = NULL;
return head;
}
Status Push(LinkList L, ElemType e)
{
LinkList p;
p = (LinkList)malloc(sizeof(Lnode));
p->data = e;
p->next = L->next;
L->next = p;
return OK;
}
Status Pop(LinkList L)
{
LinkList p,q;
ElemType e;
p = L->next;
q = p;
e = p->data;
p = p->next;
free(q);
return e;
}
void bianli(LinkList L)
{
LinkList p;
p = L->next;
while(p)
{
printf("%d ",p->data);
p = p->next;
}
}
栈(带头结点链表)
最新推荐文章于 2024-09-18 14:39:15 发布