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
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}, andNext 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 00010Sample Output 1:
67890Sample Input 2:
00001 00002 4 00001 a 10001 10001 s -1 00002 a 10002 10002 t -1Sample Output 2:
-1
分析:找到两个链表中地址一样的节点就可以了。
#include<iostream>
#include<map>
int flag[100000];
bool is_find;
using namespace std;
struct Node{
int address;
Node *next;
Node(int a):address(a),next(NULL){}
};
void BuildList1(Node *& List, map<int,int> m)
{
Node *temp = List;
while(m[temp->address] != -1)
{
flag[temp->address] = 1;
Node *t = new Node(m[temp->address]);
temp->next = t;
temp = temp->next;
}
}
void BuildList2(Node *& List, map<int,int> m)
{
Node *temp = List;
while(m[temp->address] != -1)
{
if(flag[temp->address] == 1){
printf("%.05d\n",temp->address);
is_find = true;
return ;
}
Node *t = new Node(m[temp->address]);
temp->next = t;
temp = temp->next;
}
}
int main()
{
int address1,address2,N;
scanf("%d %d %d",&address1,&address2,&N);
int i;
int now,next;
char c;
map<int,int> m;
for(i=0; i<N; i++){
scanf("%d %c %d",&now,&c,&next);
m[now] = next;
}
Node *List1 = new Node(address1);
Node *List2 = new Node(address2);
BuildList1(List1,m);
is_find = false;
BuildList2(List2,m);
if(!is_find)
cout<<"-1"<<endl;
return 0;
}
以上有一组数据过不了,待解决。
今天重新做了一遍,可以AC。
思路:(1)不用输出公共的字符串,所以可以不用去记录字符串内容,只要知道位置就行;(2)模拟链表,第一个链表遍历过去后做上标记;第二个链表进行遍历时只要找到了标记过的点就说明这个点是公共的后缀的起点。
具体代码如下:
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define MAX 100002
int list[MAX];
int flag[MAX];
int main(int argc, char** argv) {
int aFrom, bFrom, n, addr, next;
int i;
char ch;
cin>>aFrom>>bFrom>>n;
for(i=0; i<100000; i++){
list[i] = 0;
flag[i] = 0;
}
for(i=0; i<n; i++){
cin>>addr>>ch>>next;
list[addr] = next;
}
for(i=aFrom; i!=-1; i=list[i]){
//第一个链表进行遍历,打上标记
flag[i] = 1;
}
flag[i] = 1;
bool f = false;
for(i=bFrom; i!=-1 ; i=list[i]){
if(flag[i]){
f = true;
break;
}
}
if(f){
printf("%05d\n",i);
}else{
cout<<"-1"<<endl;
}
return 0;
}