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

whereAddress 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

题目大意

寻找俩个字符串中，第一个共用相同元素的地址，如果不存在输出-1

思路

将第一个字符串的所有地址全部标记true，然后从第二个字符串的头地址开始遍历，只要出现重复的就输出该地址并return

C/C++


#include
using namespace std;
int main()
{
    char ch;
    int address[100001],st1,st2,M,num;
    cin >> st1 >> st2 >> M;
    while (M--){
        cin >> num;
        cin >> ch >> address[num];
    }
    bool apr[100001] = {false};
    while (st1!=-1){
        apr[st1] = true;
        st1 = address[st1];
    }
    while (st2!=-1){
        if(apr[st2]){
            printf("%05d",st2);
            return 0;
        }
        st2 = address[st2];
    }
    cout << -1 << endl;
    return 0;
}

相关阅读:
[学习记录] SpringBoot 17. 数据访问 Mybatis
【广州华锐视点】VR塔吊模拟实操考核系统
9.30号作业
【附源码】Python计算机毕业设计社区疫情防控监管系统
【学习笔记51】ES6的新增属性Set和Map
R语言时间序列数据算术运算：使用diff函数计算时间序列数据的逐次差分、使用除法将两个长度不等时间序列数据进行相除、使用固定值乘以指定的时间序列
jsp+ajax+json练习（表单数据检测）
Nacos 配置中心
【leetcode】【剑指offer】【二进制中1的个数】
自洽可分的哈密顿系统的辛算法

原文地址：https://blog.csdn.net/daybreak_alonely/article/details/127731750