牛客网机试练习KY121-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.

You are supposed to find the starting position of the common suffix (e.g. the position of “i” in Figure 1).
输入描述:
For each case, the first line contains two addresses of nodes and a positive N (<= 10^5), 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.
输出描述:
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.
输入

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
00001 00002 4
00001 a 10001
10001 s -1
00002 a 10002
10002 t -1

输出

67890
-1

代码

#include<iostream>
using namespace std;
#define max 100001
typedef struct node
{
    char data;
    int next;
}Node;

int main()
{
    int first,second,N;
    Node word[max];
    char data;
    int addr,next;
    int length1,length2;
    int newfirst,newsecond;
    
    cin>>first>>second>>N;
    
    for(int i=0;i<N;i++)
    {
        cin>>addr>>data>>next;
        word[addr].data=data;
        word[addr].next=next;
    }
    
    length1=length2=0;
    newfirst=first;
    newsecond=second;
    for(int i=0;i<N;i++)
    {
        if(newfirst!=-1)
        {
            length1++;
            newfirst=word[newfirst].next;
        }
        if(newsecond!=-1)
        {
            length2++;
            newsecond=word[newsecond].next;
        }
    }
    while(length1>length2)
    {
        first=word[first].next;
        length1--;
    }
    while(length1<length2)
    {
        second=word[second].next;
        length2--;
    }
    while(length1>0)
    {
        if(first==second)
        {
            cout<<first<<endl;
            break;
        }
        else{
            first=word[first].next;
            second=word[second].next;
        }
        length1--;
        length2--;
    }
    if(length1==0)
        cout<<"-1"<<endl;
}

这道题目的意思是用单链表存储单词，两个的单词的相同部分用公共结点存储，输入一组用例，算法实现查找两单词是否有公共部分，若有输出第一个相同字母的地址。
具体的解决办法正好在王道考研数据结构单链表的课后习题做过，只需计算两个链表的长度，将指针对齐，同步往后移动，遇到的第一个指向的字母相同的结点的地址即为所求，若指针移动到最后都没有相同的直接输出-1即可。