1. 动态链表实现
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#include <stdio.h>
#include <stdlib.h>
typedef int Status;
typedef int ElemType;
typedef struct LNode
{
ElemType data;
struct LNode *next;
} LNode, *LinkList;
Status InitLList(LinkList &L)
{
L = (LNode*) malloc(sizeof(LNode));
L->next = NULL;
if(L)
{
return OK;
}
else
{
return ERROR;
}
}
Status GetLListElem(LinkList L, int i, ElemType &e)
{
LNode *p = L->next;
int j = 1;
while(p && j < i)
{
j++;
p = p->next;
}
if(!p || j > i)
{
return ERROR;
}
e = p->data;
return OK;
}
LNode *LocLListElem(LinkList L, const ElemType &e)
{
LNode *p = L->next;
while(p && p->data !=e)
{
p = p->next;
}
return p;
}
Status InsertLList(LinkList &L, int i, const ElemType &e)
{
LNode *p = L;
int j = 0;
while(p && j< i-1)
{
p = p->next;
j++;
}
if(!p || j > i - 1)
{
return ERROR;
}
LNode *s = (LNode*)malloc(sizeof(LNode));
if(s)
{
s->data = e;
s->next = p->next;
p->next = s;
}
else
{
return ERROR;
}
return OK;
}
Status DeleteLList(LinkList &L, int i)
{
LNode *p = L;
int j = 0;
while(p && j < i - 1)
{
p = p->next;
j++;
}
if(!p || j > i - 1)
{
return ERROR;
}
LNode *s = p->next;
p->next = s->next;
free(s);
s = NULL;
return OK;
}
Status CreateList_H(LinkList &L, int n)
{
LNode *p;
for(int i = n; i > 0; i--)
{
p = (LNode *)malloc(sizeof(LNode));
if(p != NULL)
{
int data;
scanf("%d",&data);
p->data = data;
p->next = L->next;
L->next = p;
}
else
{
return ERROR;
}
}
return OK;
}
Status CreateList_R(LinkList &L, int n)
{
LNode *r;
r = L;
LNode *p;
for(int i = n; i > 0; i--)
{
p = (LNode*)malloc(sizeof(LNode));
if(p)
{
int data;
scanf("%d",&data);
p->data = data;
r->next = p;
r = p;
}
else
{
return ERROR;
}
}
r->next = NULL;
return OK;
}
void TraverseLList(LinkList L)
{
LNode *p = L->next;
while(p->next)
{
printf("%d",p->data);
printf("->");
p = p->next;
}
printf("%d",p->data);
}
void MergeLList(LinkList &LA, LinkList &LB, LinkList &LC)
{
LNode *pa = LA->next;
LNode *pb = LB->next;
LNode *pc = LA;
LC = pc;
while(pa && pb)
{
if(pa->data <= pb->data)
{
pc->next = pa;
pc = pa;
pa = pa->next;
}
else
{
pc->next = pb;
pc = pb;
pb = pb->next;
}
}
pc->next = pa ? pa : pb;
free(LB);
}
void FreeLList(LinkList &L)
{
LNode *p = L;
LNode *temp = NULL;
while(p)
{
temp = p->next;
free(p);
p = NULL;
p = temp;
}
}
int main()
{
printf("合并链表:\n");
printf("请输入创建链表A的结点个数:");
int na;
scanf("%d",&na);
printf("请输入要创建链表A的结点:");
LinkList LA;
InitLList(LA);
CreateList_R(LA,na);
printf("请输入创建链表B的节点个数:");
int nb;
scanf("%d",&nb);
printf("请输入要创建链表B的结点:");
LinkList LB;
InitLList(LB);
CreateList_R(LB,nb);
printf("合并之后的链表LC:");
LinkList LC;
InitLList(LC);
MergeLList(LA, LB, LC);
TraverseLList(LC);
FreeLList(LA);
FreeLList(LB);
FreeLList(LC);
return 0;
}
2. 静态链表实现
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define MAXSIZE 20
#include <stdio.h>
#include <stdlib.h>
typedef int ElemType;
typedef int Status;
typedef struct
{
ElemType data;
int cur;
} component, SLinkList[MAXSIZE];
void InitSpace(SLinkList &space)
{
space[0].cur = 2;
space[0].data = -1;
space[1].cur = -1;
space[1].data = -1;
for(int i = 2; i < MAXSIZE - 1; i++)
{
space[i].cur = i + 1;
space[i].data = -1;
}
space[MAXSIZE - 1].cur = 0;
space[MAXSIZE - 1].data = -1;
}
int LocSListElem(SLinkList S, ElemType e)
{
int i = S[1].cur;
while(i && S[i].data != e)
{
i = S[i].cur;
}
return i;
}
int Malloc(SLinkList &space)
{
int i = space[0].cur;
if(space[0].cur != 0)
{
space[0].cur = space[i].cur;
}
return i;
}
void Free(SLinkList &space, int k)
{
space[k].cur = space[0].cur;
space[k].data = -1;
space[0].cur = k;
}
Status DeleteSList(SLinkList &space, int i)
{
int j = 1;
int k = 0;
while(j !=0 && k < i - 1)
{
j = space[j].cur;
k++;
}
if(space[j].cur == 0 || k >= i || i <= 0)
{
return ERROR;
}
component c = space[space[j].cur];
Free(space, space[j].cur);
space[j].cur = c.cur;
return OK;
}
Status InsertSList(SLinkList &space,int i, ElemType e)
{
int j = 1;
int k = 0;
while(j !=0 && k < i - 1)
{
j = space[j].cur;
k++;
}
if(space[j].cur == 0 || k > i || i <= 0)
{
return ERROR;
}
int idx = Malloc(space);
space[idx].data = e;
space[idx].cur = space[j].cur;
space[j].cur = idx;
return OK;
}
void CreateSList(SLinkList &space,int n)
{
space[1].cur = 2;
for(int i = 0; i < n; i++)
{
int idx = Malloc(space);
ElemType e;
scanf("%d", &e);
space[idx].data = e;
if( i == n - 1)
space[idx].cur = 0;
}
}
void TraverseSList(SLinkList &space)
{
for(int i = 0; i < 20; i++)
{
printf("%10d ",i);
printf("%10d ",space[i].data);
printf("%10d \n",space[i].cur);
}
}
int main()
{
SLinkList space;
InitSpace(space);
int n;
printf("请输入您要创建的静态链表元素的个数(>0):");
scanf("%d", &n);
printf("请输入您要创建的静态链表的元素:");
CreateSList(space,n);
printf("您创建的静态链表:\n");
TraverseSList(space);
printf("\n");
int insert_i;
printf("请输入您要插入的元素的位置(>0):");
scanf("%d",&insert_i);
int insert_e;
printf("请输入您要插入的元素:");
scanf("%d", &insert_e);
if(InsertSList(space, insert_i, insert_e))
{
printf("插入成功!\n");
printf("插入之后的静态链表:\n");
TraverseSList(space);
printf("\n");
}
else
{
printf("插入失败!\n");
}
int delete_i;
printf("请输入您要删除的元素的位置(>0):");
scanf("%d", &delete_i);
if(DeleteSList(space, delete_i))
{
printf("删除成功!\n");
printf("删除之后的静态链表:\n");
TraverseSList(space);
}
else
{
printf("删除失败!\n");
}
return 0;
}