题目
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.
fig.jpg
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
大意
给定两个字符串,字符串字符用链表存放,有相同后缀的字符串就可以用一个链表保存后缀,要求找出此后缀的第一个元素。
直觉
采用静态链表,用散列的思想,数组下标代替地址。
先用一个结构体存放一个节点,用此结构体数组存放入所有节点,然后从一个头节点开始遍历,遍历过程中,把遍历到的节点中flag参数(结构体中定义)置1,再遍历第二个链表,如果遇到有flag为1的,就是我们要的结果了。
解题方案
直觉
复杂度
O(N),N是输入节点个数
代码
#include<cstdio>
#include<iostream>
using namespace std;
typedef struct node{
char ch;
int next;
int flag=0;
}node;
int main(){
int first_A,first_B,amount;
cin>>first_A>>first_B>>amount;
node input[100010];
int temp;
for(int i=0;i<amount;++i){
cin>>temp;
cin>>input[temp].ch>>input[temp].next ;
}
int p=first_A;
for(int i=0;i<amount&&p!=-1;++i){
input[p].flag =1;
p=input[p].next ;
}
p=first_B;
for(int i=0;i<amount&&p!=-1;++i){
if(input[p].flag==1){
printf("%05d",p);
return 0;
}
p=input[p].next ;
}
cout<<-1;
return 0;
}
提交时间 状态 分数 题目 编译器 耗时 用户
2019/8/16 20:03:38
答案正确
25 1032 C++ (g++) 158 ms Chester
测试点 结果 耗时 内存
0 答案正确 4 ms 1640 KB
1 答案正确 4 ms 1508 KB
2 答案正确 4 ms 1576 KB
3 答案正确 5 ms 1576 KB
4 答案正确 4 ms 1536 KB
5 答案正确 158 ms 1536 KB