题目描述
1032 Sharing (25分)
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^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.
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
求解思路
使用静态链表,首先遍历第一条链表,让其中的每一个元素的flag均为1,再遍历第二条链表,找到第一个flag为1的元素,输出其地址即可。如果没有找到则输出-1。
代码实现(AC)
#include<cstdio>
#include<cstring>
const int maxn=100010;
struct Node{
char data;
int next;
bool flag;
}node[maxn];
int address1,address2,n;
void init()
{
scanf("%d %d %d",&address1,&address2,&n);
for(int i=0;i<n;i++)
{
char data;
int address,next;
scanf("%d %c %d",&address,&data,&next);
node[address].data=data;
node[address].next=next;
}
}
void solve()
{
int i;
for(i=address1;i!=-1;i=node[i].next)
node[i].flag=1; //让第一条链表中的标志位均为1
for(i=address2;i!=-1;i=node[i].next)
{
if(node[i].flag) break;
}
if(i!=-1) printf("%05d\n",i);
else printf("-1\n");
}
int main()
{
init();
solve();
return 0;
}