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}, 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
题目大意:找两个链表的第一个公共节点。
常规解法:两个链表遍历先得出两个链表 的长度len1,len2;然后双指针法,长的链表指向的指针先走abs(len1-len2),然后两个指针一起遍历,知道指向相同
#include <iostream>
#include <vector>
using namespace std;
vector<int>Next(100005, -1);
char ch;
int n, La, Lb, p, q, lena = 0, lenb = 0, temp;
int main(){
scanf("%d %d %d", &La, &Lb, &n);
for(int i = 0; i < n; ++ i){
scanf("%d %c", &temp, &ch);
scanf("%d", &Next[temp]);
}
temp = La;
while(temp != -1){
temp = Next[temp];
++ lena;
}
temp = Lb;
while(temp != -1){
temp = Next[temp];
++ lenb;
}
if(lena > lenb)
swap(La, Lb);
p = La; q = Lb;
for(int i = 0; i < abs(lenb - lena); ++ i)
q = Next[q];
while(p != q){
p = Next[p];
q = Next[q];
}
if(p == -1)
printf("-1");
else
printf("%05d",p);
}
优化:我们不难发现,第一个公共节点后面的节点也都是一样的,不妨也将链表x中所有节点的地址也存储,然后遍历y,找到第一个已经被记录下的节点。
这样就最多遍历一遍链表,而常规解法需要遍历两遍
#include <iostream>
#include <vector>
using namespace std;
vector<int>Next(100005, -1), visit(100005, 0);
int n, La, Lb, temp;
char ch;
int main(){
scanf("%d %d %d", &La, &Lb, &n);
for(int i = 0; i < n; ++ i){
scanf("%d %c", &temp, &ch);
scanf("%d", &Next[temp]);
}
temp = La;
while(temp != -1){
visit[temp] = 1;
temp = Next[temp];
}
temp = Lb;
while(temp != -1 && visit[temp] == 0)
temp = Next[temp];
if(temp == -1)
printf("-1");
else
printf("%05d",temp);
}