1032. Sharing (25)

最新推荐文章于 2025-12-10 21:25:44 发布

原创最新推荐文章于 2025-12-10 21:25:44 发布 · 433 阅读

0 ·

CC 4.0 BY-SA版权

PAT 专栏收录该内容

79 篇文章

订阅专栏

本文介绍了一种利用链表存储英文单词的方法，并通过让具有相同后缀的单词共享同一子链表来节省空间。文章详细描述了输入输出规范，并提供了一个示例程序，用于找出两个单词共同后缀的起始位置。

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 (<= 10⁵), 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:

Sample Input 2:

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

Sample Output 2:

-1

参考代码：

#include <iostream>
#include <stdio.h>
using namespace std;
struct Node{
    char ch;
    int next;
};
Node arr[100001];
int visited[100001];
int ad1,ad2,N;

int main()
{
    cin>>ad1>>ad2>>N;
    for(int i=0;i<N;i++){
        int flag;
        cin>>flag;
        cin>>arr[flag].ch>>arr[flag].next;
    }
    int tmp = ad1;
    while(arr[tmp].next!=-1){
        visited[tmp] = 1;
        tmp = arr[tmp].next;
    }
    visited[tmp] = 1;

    int temp;
    for(temp=ad2;temp!=-1&&!visited[temp];temp=arr[temp].next){
        ;
    }
    if(temp!=-1)
        printf("%05d",temp);
    else
        printf("-1");
    return 0;
}