7-5 两个有序链表序列的合并 (20 分)

已知两个非降序链表序列S1与S2，设计函数构造出S1与S2合并后的新的非降序链表S3。

输入格式:

输入分两行，分别在每行给出由若干个正整数构成的非降序序列，用−1表示序列的结尾（−1不属于这个序列）。数字用空格间隔。

输出格式:

在一行中输出合并后新的非降序链表，数字间用空格分开，结尾不能有多余空格；若新链表为空，输出NULL。

输入样例:

1 3 5 -1
2 4 6 8 10 -1

输出样例:

1 2 3 4 5 6 8 10

#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
typedef struct Node* List;
struct Node {
	int self;
	List Next;
};
List creat() {
	List head = new Node();
	List p = head,temp;
	int n;
	while (cin >> n && n != -1) {
		temp = new Node();
		temp->self = n;
		p->Next = temp;
		p = p->Next;
	}
	return head->Next;
}
int main()
{
	int flag = 0;
	List head1 = creat(), head2 = creat();
	while (head1||head2) {
		if (head1 == NULL || head1->self > head2->self) {
			if (flag) printf(" ");
			printf("%d", head2->self); head2 = head2->Next; flag = 1;
		}
		else if (head2 == NULL || head1->self < head2->self) {
			if (flag) printf(" ");
			printf("%d", head1->self); head1 = head1->Next; flag = 1;
		}
		else {
			if (flag) printf(" ");
			printf("%d %d", head1->self, head2->self);
			head2 = head2->Next; head1 = head1->Next; flag = 1;
		}
	}
    if(!flag) printf("NULL\n");
}