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:
67890
Sample Input 2:
00001 00002 4
00001 a 10001
10001 s -1
00002 a 10002
10002 t -1
Sample Output 2:
-1
一开始测试点5答案错误,然后发现测试点5考察的是只有当两个结点数据相同、地址也相同才算是同一个结点。
同时还要注意可能有一个链表的长度为0,需要单独判断一下,这题不知道有没有测试点考查,pat其他链表题有考察这个的,我就判断了一下。
附AC代码
#include <iostream>
#include <vector>
#include <map>
using namespace std;
struct Node
{
int add, next;
string data;
};
int main()
{
int start1, start2, n;
int add, next;
string data;
cin >> start1 >> start2 >> n;
map<int, Node> myMap;
vector<Node> nodes1;
vector<Node> nodes2;
for (int i = 0; i < n; i++)
{
cin >> add >> data >> next;
myMap[add].add = add;
myMap[add].data = data;
myMap[add].next = next;
}
while (start1 != -1)
{
Node node = myMap[start1];
nodes1.push_back(node);
start1 = node.next;
}
while (start2 != -1)
{
Node node = myMap[start2];
nodes2.push_back(node);
start2 = node.next;
}
if (nodes1.size() == 0 || nodes2.size() == 0)
printf("-1\n");
else
{
int i, j;
for (i = nodes1.size() - 1, j = nodes2.size() - 1; i >= 0, j >= 0; i--, j--)
if ((nodes1[i].data != nodes2[j].data) || (nodes1[i].add != nodes2[j].add))
break;
if (i != nodes1.size() - 1)
printf("%05d\n", nodes1[i + 1].add);
else
printf("-1\n");
}
}