7-2 Merging Linked Lists (25 分)

Given two singly linked lists L
1
​
=a
1
​
→a
2
​
→⋯→a
n−1
​
→a
n
​
and L
2
​
=b
1
​
→b
2
​
→⋯→b
m−1
​
→b
m
​
. If n≥2m, you are supposed to reverse and merge the shorter one into the longer one to obtain a list like a
1
​
→a
2
​
→b
m
​
→a
3
​
→a
4
​
→b
m−1
​
⋯. 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 L
2
​
, 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

#include
using namespace std;
struct node {
    int address, next, data;
}l1[100010];
stack<node> q;
int main() {
    int st1, st2, n;
    cin >> st1 >> st2 >> n;
    for (int i = 0; i < n; i++) {
        int a;
        cin >> a;
        l1[a].address = a;
        cin >> l1[a].data >> l1[a].next;
    }
    int len1 = 0, len2 = 0;
    for (int i = st1; i != -1; i = l1[i].next) {
        len1++;
    }
    for (int i = st2; i != -1; i = l1[i].next) {
        len2++;
    }
    if (len1 > len2) {
        for (int k = st2; k != -1; k = l1[k].next) 
            q.push(l1[k]);
        int j = st2, i = st1;
        while (j != -1) {
            i = l1[i].next;
            node x = q.top();
            q.pop();
            l1[x.address].next = l1[i].next;
            l1[i].next = x.address;
            i = l1[i].next;
            j = l1[j].next;
        }
        for (i = st1; i != -1; i = l1[i].next) {
            if(l1[i].next!=-1)
                printf("%05d %d %05d\n", l1[i].address, l1[i].data, l1[i].next);
            else
                printf("%05d %d -1\n",l1[i].address, l1[i].data);
        }
    }
    if (len1 < len2) {
        for (int k = st1; k != -1; k = l1[k].next) 
            q.push(l1[k]);
        int j = st1, i = st2;
        while (len1--) {
            i = l1[i].next;
            node x = q.top();
            q.pop();
            l1[x.address].next = l1[i].next;
            l1[i].next = x.address;
            i = l1[i].next;
            i = l1[i].next;
        }
        for (int i = st2; i != -1; i = l1[i].next) {
            if(l1[i].next!=-1)
                printf("%05d %d %05d\n", l1[i].address, l1[i].data, l1[i].next);
            else
                printf("%05d %d -1\n",l1[i].address, l1[i].data);
        }
    }
}