#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
typedef struct lnode
{
int data;
struct lnode *next;
} lnode,*linklist;
int initlist(linklist &L) //单链表初始化
{
L=new lnode;
L->next=NULL;
return 1;
}
int locatedlist(linklist L,int e)
{
linklist p;
p=L->next;
int j=1;
while(p&&p->data!=e)
{
p=p->next;
j++;
}
if(p) return j;
else return 0;
}
int listinsert(linklist &L,int i,int e) //单链表的插入
{
linklist p;
p=L;
int j=0;
while(p&&j<i-1)
{
p=p->next;
j++;
}
if(!p||j>i-1) return 0;
linklist s=new lnode;
s->data=e;
s->next=p->next;
p->next=s;
return 1;
}
int listdelete(linklist &L,int i) //单链表的删除
{
linklist p;
p=L;
int j=0;
while(p&&j<i-1)
{
p=p->next;
j++;
}
if(!p||j>i-1) return 0;
linklist q;
q=p->next;
p->next=p->next->next;
delete q;
return 1;
}
void destroylist(linklist &L)
{
linklist p;
while(L)
{
p=L;
L=L->next;
delete p;
}
p=NULL;
}
int lengthlist(linklist &L) //查找链表表长
{
linklist p=L;
int length=0;
while(p)
{
p=p->next;
length++;
}
return length-1;
}
void creatlist_H(linklist &L) //前插法创建链表
{
int n;
L=new lnode;
L->next=NULL;
while(~scanf("%d",&n)&&n!=0)
{
linklist p=new lnode;
p->data=n;
p->next=L->next;
L->next=p;
}
}
void creatlist_R(linklist &L) //后插法创建单链表
{
int n;
linklist r;
L=new lnode;
L->next=NULL;
r=L;
while(~scanf("%d",&n)&&n!=0)
{
linklist p=new lnode;
p->data=n;
p->next=NULL;
r->next=p;
r=p;
}
}
void printflist(linklist &L) //直接输出链表
{
linklist p=L->next;
printf("当前链表元素:");
while(p)
{
printf("%d ",p->data);
p=p->next;
}
}
void mergelist(linklist &a,linklist &b,linklist &c)
{
linklist pa,pb,pc;
pa=a->next,pb=b->next;
pc=c;
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;
}
int main()
{
linklist mylist,ourlist,yourlist;
initlist(mylist);
initlist(yourlist);
initlist(ourlist);
creatlist_R(mylist);
creatlist_R(yourlist);
mergelist(mylist,yourlist,ourlist);
printflist(ourlist);
return 0;
}
链表有序表合并
最新推荐文章于 2023-06-05 19:59:46 发布