无序链表合并为一个有序链表，且排序后链表中无重复元素

两个无序单链表，排序后合并成一个有序链表，且排序后链表中无重复元素

1.
#include<stdio.h>
#include<stdlib.h> 


struct Node
{
int data;
struct Node* next;


};


void listNum(struct Node *head,int count)//冒泡排序
{
int i,temp;
struct Node *p;


for (int i=0;i<count;++i)
{
for (p=head;p->next!=NULL;p=p->next)
{
if (p->data>p->next->data)
{
temp=p->data;
p->data=p->next->data;
p->next->data=temp;
}


}


}


printf("\n链表排序完后：\n");
p=head;
while(p)
{
printf("%d",p->data);
p=p->next;
}
printf("\n");
}


void merge(struct Node *head1,struct Node *head2)
{

struct Node *head3&