c语言求两个单链表的交集，并且将交集存入新的链表中(13)

这个和之前题目实现的算法差不多，不过由于用一个新的链表存储，所以，我觉得还是更简单的。

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

//这个要c令开辟空间，就更简单啦～

typedef struct node
{
	int data;
	struct node * next;

}Node;

typedef struct list
{
	Node* head;
	Node* tail;

}List;

void only_init(List *L)
{

	Node* first = (Node*)malloc(sizeof(Node));
	if(!first)
		printf("wrong!\n");
	first -> data = 0;
	first -> next = NULL;
	L->head = L->tail = first;

}

void Init_list(List* L)
{
	Node* first = (Node*)malloc(sizeof(Node));
	if(!first)
		printf("wrong!\n");
	first -> data = 0;
	first -> next = NULL;
	L->head = L->tail = first;

	int length;

	printf("please enter list length: ");
	scanf("%d",&length); //scanf里面不能写类似于printf中打印字符串的语句
	for(int i = 0; i< length; i++)
	{
		Node* new = (Node*)malloc(sizeof(Node));
		scanf("%d",&new -> data); //这个语句注意一下

		new -> next = NULL;
		L->tail -> next = new;
		L->tail = new;

	}


}


void merge(List l1,List l2,List *l3)
{
	Node *p, *q,*w,*save,*prev;
	p = l1.head->next;  q = l2.head->next; w = l3->tail;
    //用l3来存储新的链表
    w -> next = NULL;

	
	while(p && q)
	{
		if(p->data == q->data)
		{
			save = p;  //这里我就破坏原链表的结构啦 题目也没有要求，这样实现的话，比较简单
			p = p -> next;
			q = q-> next;
			w -> next = save;
			save -> next = NULL;
			w = w -> next;

		}
		else if(p->data < q -> data)
		{
			p = p->next;
			//q = q->next;  //这里要注意，p不要动了，因为后面可能有相同的元素
		}
		else
			q = q->next;
	} 


}


void print_list(List L)
{
	Node* p;
	p = L.head->next;

	while(p != NULL)
	{
		printf("%d ",p->data);
		p = p -> next;
	}

	printf("\n");
}


int main(int argc, char const *argv[])
{
	List l1,l2,l3;

	Init_list(&l1);
	Init_list(&l2);

	only_init(&l3);



	merge(l1,l2,&l3);

	printf("--------------------\n");
	printf("after merge: ");
	print_list(l3);

	
	return 0;
}

运行截图：