单链表归并操作：逆序Merging Operation of Single-linked List in Reversed Order

与普通的归并操作大致相同，但是建立归并链表的时候采用头插法。代码如下：

#define _CRT_SECURE_NO_WARNINGS 1
#include<iostream>
using namespace std;

typedef struct LNode
{
	int data;
	struct LNode* next;
}LNode;

int main()
{
	void createlist(LNode*&, int);
	void mergelist(LNode*, LNode*, LNode*&);
	void printlist(LNode*);
	LNode* a, * b, * c;
	int n1, n2;

	cout << "Please enter the length of the first linked list:";
	cin >> n1;
	createlist(a, n1);
	printlist(a);
	cout << "Please enter the length of the second linked list:";
	cin >> n2;
	createlist(b, n2);
	printlist(b);
	mergelist(a, b, c);
	printlist(c);

	return 0;
}

void createlist(LNode*& a, int n)
{
	LNode* p;

	a = (LNode*)malloc(sizeof(LNode));
	p = (LNode*)malloc(sizeof(LNode));
	a->next = p;
	cout << "Please enter the elements of the linked list one by one in an increasing order:";
	for (int i = 0; i < n; i++)
	{
		cin >> p->data;
		if (i < n - 1)
		{
			p->next = (LNode*)malloc(sizeof(LNode));
			p = p->next;
		}
	}
	p->next = NULL;

	return;
}

void mergelist(LNode* a, LNode* b, LNode*& c)
{
	LNode* p;

	c = (LNode*)malloc(sizeof(LNode));
	c->next = NULL;
	a = a->next;
	b = b->next;
	while (a != NULL || b != NULL)
	{
		p = (LNode*)malloc(sizeof(LNode));
		if (a == NULL)
		{
			p->data = b->data;
			b = b->next;
		}
		else
		{
			if (b == NULL)
			{
				p->data = a->data;
				a = a->next;
			}
			else
			{
				if (a->data < b->data)
				{
					p->data = a->data;
					a = a->next;
				}
				else
				{
					p->data = b->data;
					b = b->next;
				}
			}
		}
		p->next = c->next;
		c->next = p;
	}

	return;
}

void printlist(LNode* a)
{
	a = a->next;
	while (a)
	{
		cout << a->data;
		if (a->next)
		{
			cout << " -> ";
		}

		a = a->next;
	}
	cout << endl;


	return;
}