0218合并两单链表

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

typedef struct lnode { //结构体
	int data;
	struct lnode* next;
}lnode, * linklist;



void buildlist(linklist& L, int aa[], int n) { //建表
	L = (linklist)malloc(sizeof(lnode));
	lnode* r = L, * s;
	for (int i = 0; i < n; i++)
	{
		s = (lnode*)malloc(sizeof(lnode));
		s->data = aa[i];
		r->next = s;
		r = r->next;

	}
	r->next = L;
}

void marge(linklist& L1, linklist& L2) {
	lnode* p, * q;
	p = L1;
	while (p->next!=L1) {
		p = p->next;
	}
	q = L2;
	while (q->next != L2) {
		q = q->next;
	}
	p->next = L2;
	q->next = L1;
	return;

}
void disp(linklist L) {
	lnode* c = L->next;
	while (c != L) {
		printf("%d", c->data);
		c = c->next;
	}return;
}

int main() {
	linklist L1,L2;
	int a1[]{ 1,2,3};
	int n1 = 3;
	int a2[]{ 4,5,6};
	int n2 = 3;
	buildlist(L1, a1, n1);
	buildlist(L2, a2, n2);
	marge(L1, L2);
	disp(L1);
	return 0;
}