#include<stdio.h>
#include<stdlib.h>
#include<time.h>
typedef struct node{
int data;
struct node *next;
} LinkList;
LinkList* initialList(LinkList *linkList){
linkList = NULL;
LinkList *p;
int i = 0;
srand(time(NULL));
while(i < 10){
p = (LinkList*)malloc(sizeof(LinkList));
p ->data = rand() % 100;
printf("%d ", p ->data);
p ->next = linkList;
linkList = p;
i ++;
}
printf("\n");
return linkList;
}
LinkList* jiaoji(LinkList *La, LinkList *Lb){
LinkList *p, *q, *t;
LinkList *tmpLinkList = NULL;
//Lc = NULL;
for(p &
#include<stdlib.h>
#include<time.h>
typedef struct node{
int data;
struct node *next;
} LinkList;
LinkList* initialList(LinkList *linkList){
linkList = NULL;
LinkList *p;
int i = 0;
srand(time(NULL));
while(i < 10){
p = (LinkList*)malloc(sizeof(LinkList));
p ->data = rand() % 100;
printf("%d ", p ->data);
p ->next = linkList;
linkList = p;
i ++;
}
printf("\n");
return linkList;
}
LinkList* jiaoji(LinkList *La, LinkList *Lb){
LinkList *p, *q, *t;
LinkList *tmpLinkList = NULL;
//Lc = NULL;
for(p &