PAT--1032. Sharing

To store English words, one method is to use linked lists and store a word letter by letter. To save some space, we may let the words share the same sublist if they share the same suffix. For example, “loading” and “being” are stored as showed in Figure 1.

Figure 1
You are supposed to find the starting position of the common suffix (e.g. the position of “i” in Figure 1).

Input Specification:

Each input file contains one test case. For each case, the first line contains two addresses of nodes and a positive N (<= 105), where the two addresses are the addresses of the first nodes of the two words, and N is the total number of nodes. The address of a node is a 5-digit positive 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 the letter contained by this node which is an English letter chosen from {a-z, A-Z}, and Next is the position of the next node.

Output Specification:

For each case, simply output the 5-digit starting position of the common suffix. If the two words have no common suffix, output “-1” instead.

Sample Input 1:

11111 22222 9
67890 i 00002
00010 a 12345
00003 g -1
12345 D 67890
00002 n 00003
22222 B 23456
11111 L 00001
23456 e 67890
00001 o 00010

Sample Output 1:

67890

Sample Input 2:

00001 00002 4
00001 a 10001
10001 s -1
00002 a 10002
10002 t -1

Sample Output 2:

-1

题解

查找两个链表的第一个公共节点。
假设链表A的长度为a，链表B的长度为b，且a > b, 则A先前进a−b个节点，然后A和B同步前进，第一个地址值相同的节点即为公共节点。

#include <bits/stdc++.h>using namespace std;const int maxn = 100010;int p1, p2, n;struct Node{    char data;    int next;};Node node[maxn];int len(int p){    int ret = 0;    while(p != -1) { p = node[p].next; ret++; }    return ret;}int main(){#ifndef ONLINE_JUDGEfreopen("data.in", "r", stdin);#endif // ONLINE_JUDGE    scanf("%d %d %d", &p1, &p2, &n);    int address, data, next;    for(int i = 0; i < n; ++i){        scanf("%d %c %d", &address, &data, &next);        node[address] = Node{data, next};    }    int p1_len = len(p1), p2_len = len(p2);    if(p1_len > p2_len){        for(int i = 0; i < p1_len - p2_len; ++i)  p1 = node[p1].next;    }else {        for(int i = 0; i < p2_len - p1_len; ++i)  p2 = node[p2].next;    }//    printf("%05d %05d\n", p1, p2);    while(p1 != p2){        p1 = node[p1].next;        p2 = node[p2].next;    }    if(p1 != -1) printf("%05d\n", p1);    else puts("-1");    return 0;}