解题思路
PAT的经典题,建议多做几遍,反正我做这种题,做了不下五遍了。
版本1
PAT测试点
#include<bits/stdc++.h>
using namespace std;
struct node{
int pre1,pre2,next,add;
char c;
}E[100005];
int main(){
int p1,p2,n,add;
while(cin>>p1>>p2>>n){
for(int i=0;i<n;i++){
cin>>add;
E[add].add=add;
cin>>E[add].c>>E[add].next;
}
int pre1=-2;
while(p1 !=-1){ //记录前一个节点
E[p1].pre1 = pre1;
pre1 = p1;
p1 = E[p1].next;
}
int pre2=-2;
while(p2 !=-1){ //记录前一个节点
E[p2].pre2 = pre2;
pre2 = p2;
p2 = E[p2].next;
}
while(pre2!=-2 &&pre1 != -2){ //从尾往前查
if(E[pre1].c == E[pre2].c){
pre1 = E[pre1].pre1;
pre2 = E[pre2].pre2;
}else
break;
}
if(pre1==-2&&pre2==-2) cout<<-1<<endl;
else cout<< E[pre1].next<<endl;
}
return 0;
}
版本2
牛客网测试点
做了这么多遍还是错
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5+5;
struct node{
int next, add;
char val;
}E[maxn];
int main(){
int n, u, v, add, p, q;
cin >> u >> v >> n;
for(int i = 0; i < n; i++){
scanf("%d",&add);
E[add].add = add;
getchar();
scanf("%c %d",&E[add].val, &E[add].next);
}
int lenp = 0, lenq = 0;
p = u, q = v;
while(p != -1){
p = E[p].next;
lenp++;
}
while(q != -1){
q = E[q].next;
lenq++;
}
if(lenp < lenq){
for(int i = 0; i < lenq - lenp; i++){
v = E[v].next;
}
}else{
for(int i = 0; i < lenp - lenq; i++){
u = E[u].next;
}
}
bool flag = false;
while(u != -1 && v != -1){
if(E[u].add == E[v].add){
flag = true;
cout<<E[u].add<<endl;
break;
}
u = E[u].next;
v = E[v].next;
}
if(!flag) cout<<"-1"<<endl;
return 0;
}
版本3
牛客网测试点
用map把第一条链表的地址先存起来,遍历第二条链表的时候看该地址是否出现过,注意,不能比较值,而要比较地址。
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5+5;
struct node{
int next, add;
char val;
}E[maxn];
int main(){
int n, u, v, add, p, q;
bool flag = false;
unordered_map<int, bool> mp;
cin >> u >> v >> n;
for(int i = 0; i < n; i++){
scanf("%d",&add);
E[add].add = add;
getchar();
scanf("%c %d",&E[add].val, &E[add].next);
}
while(u != -1){
mp[E[u].add] = true;
u = E[u].next;
}
while(v != -1){
if(mp[E[v].add]) {
printf("%05d\n",E[v].add);
flag = true;
break;
}
v = E[v].next;
}
if(!flag) cout<<"-1"<<endl;
return 0;
}