225基于链表两个递增序列的合并

描述

给定两个递增的整数序列A和B，利用链表表示序列A和B，将A和B合并为一个递增的有序序列C，序列C不允许有重复的数据。要求空间复杂度为O(1)。

输入

多组数据，每组数据有三行，第一行为序列A和B的长度n和m，第二行为序列A的n个元素，第三行为序列B的m个元素（元素之间用空格分隔）。n=0且m=0时输入结束。

输出

对于每组数据输出一行，为合并后的序列，每个数据之间用空格分隔。

示例：

输入：

5 5
1 3 5 7 9 
2 4 6 8 10 
3 4
1 5 9
1 2 5 9
0 0
输出：

1 2 3 4 5 6 7 8 9 10
1 2 5 9

#include<iostream>
using namespace std;
typedef struct node {
	int data;
	struct node* next;
} *linklist;
//两个递增链表合并
void innit(linklist& list) {

	list = new node;
	list->next = NULL;
}
void print(linklist list) {
	node* p;
	p = new node;
	p = list;
	while (p->next!= NULL) {
		p = p->next;
		cout << p->data << " ";
		
	}
}
void creat_linklist(linklist& list) {
	node* p;
	p = new node;
	p = list;
	for (int i = 0; i < list->data; i++) {
		int a;
		node* newnode;
		newnode = new node;
		cin >> a;
		newnode->data = a;
		newnode->next = p->next;//尾插
		p->next = newnode;
		p = p->next;
	}
	//cout << p->data;
}

linklist  merge(linklist &list1,linklist & list2) {
	linklist  result;
	//result = new node;//可省略，初始化函数中有空间申请
	innit(result);//很重要，忘记初始化空间就会 没办法输出result[i];
		//合并
		node* p, * q, * r;
		p = new node;
		q = new node;
		r = new node;
		p = list1->next;//链表1 的第一个结点
		q = list2->next;//链表2 的第一个结点
		r = result;//合并后链表的头结点
		while (p != NULL && q != NULL) {
			if (p->data < q->data) { node* newnode; newnode = new node; newnode->data = p->data; newnode->next = r->next; r->next = newnode; p = p->next; }
			else if (p->data > q->data) { node* newnode; newnode = new node; newnode->data = q->data; newnode->next = r->next; r->next = newnode; q = q->next; }
			else if (p->data == q->data) { node* newnode; newnode = new node; newnode->data = p->data; newnode->next = r->next; r->next = newnode; p = p->next; q = q->next; }
			r = r->next;
		}
		while (p != NULL) {//剩余部分挂链尾
			node* newnode;
			newnode = new node;
			newnode->data = p->data;
			newnode->next = r->next;
			r->next = newnode;
			r = r->next;
			p = p->next;
		}
		while (q != NULL) {//剩余部分挂链尾
			node* newnode;
			newnode = new node;
			newnode->data = q->data;
			newnode->next = r->next;
			r->next = newnode;
			r = r->next;
			q = q->next;
		}
	return result;
}

int main() {
	linklist list1, list2,*result;
	list1 = new node;
	list2 = new node;
	result = new linklist[100];
	innit(list1);
	innit(list2);
	int num,length1,length2;
	cin >> length1 >> length2;
	for (num = 0; length1 != 0 && length2 != 0; num++) {
		list1->data = length1;
		list2->data = length2;//存放链表长度
		result[num] = new node;
		innit(result[num]);
		creat_linklist(list1);
		creat_linklist(list2);
		result[num] = merge(list1, list2);
		print(result[num]);
		cin >> length1 >> length2;
		
	}
	
	for (int i = 0; i < num; i++) {
		print(result[i]);
	}
}