Bonus-1 Merging Linked Lists (20分)

Given two singly linked lists L. If n≥2m, you are supposed to reverse and merge the shorter one into the longer one to obtain a list like a​​ ⋯. For example, given one list being 6→7 and the other one 1→2→3→4→5, you must output 1→2→7→3→4→6→5.

Input Specification:
Each input file contains one test case. For each case, the first line contains the two addresses of the first nodes of L​1 and L2​​ , plus a positive N (≤10​5 ) which is the total number of nodes given. The address of a node is a 5-digit nonnegative integer, and NULL is represented by -1.

Then N lines follow, each describes a node in the format:
Address Data Next
where Address is the position of the node, Data is a positive integer no more than 10​5, and Next is the position of the next node. It is guaranteed that no list is empty, and the longer list is at least twice as long as the shorter one.

Output Specification:
For each case, output in order the resulting linked list. Each node occupies a line, and is printed in the same format as in the input.

Sample Input:
00100 01000 7
02233 2 34891
00100 6 00001
34891 3 10086
01000 1 02233
00033 5 -1
10086 4 00033
00001 7 -1

Sample Output:
01000 1 02233
02233 2 00001
00001 7 34891
34891 3 10086
10086 4 00100
00100 6 00033
00033 5 -1

解法：

可以建一个结构，node[i].element存放element.node[i].ptr存放自己的指针。

引用方式	内存
node[0]	ptr element
node[1]	ptr element
…	…
node[n]	ptr element

1.保存输入。
2.建两个新数组读数据
3.循环数据小的表，每一次大表放两个，小表放一个
4.小表放完以后把大表放完。
注意可能出现放完小表以后大表只剩一个，放不完两个的情况，所以要判断。
5.输出的时候：
node[i].ptr node[i].elment node[i+1].ptr

优点是merge的时候比较快，对答案数组的赋值比较方便（链表稍微复杂一点）
缺点是模拟建表时候需要从头查找下一个结点，比较麻烦，但是只能说自己水平不够，用这种土方法属实无奈。

也可以按照网上的，把地址作为下标。
但是注意不要读入以后直接输出。
最好建一个新表或者数组存放答案，然后输出新表。第三个点会卡（具体原因还不清楚）。