拿到题目没多想基本就是暴力求法,保存两个节点的的路径,然后比较路径
1.从根开始找到第一个不同的节点就是公共祖先节点。比如4和2就是 5-3-6-4和5-3-7-2祖先节点7
2.如果一条路径全覆盖另一条还有,说明全覆盖的路径的节点的祖先是另一个节点 ,比如3和6就是 5-3-6和5-3
重点重点!!!我用自己编译器全部可以得到答案,但是通不过!!!!,不知道哪里错了QAQ
#include<iostream>
#include<string>
#include<stdio.h>
#include<string.h>
#include<vector>
#include<stack>
#include<set>
#include<unordered_map>
#include<queue>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long LL;
const int maxn=10010;
int pre[maxn],in[maxn];
int m,n;
vector<int> temp,res;
struct node{
int data;
node* pre;
node* left;
node* right;
};
int flag=0;
void DFS(node* root,int data){
if(root==NULL){
return;
}
temp.push_back(root->data);
if(root->data==data){
res=temp;
return;
}
if(root->left!=NULL) DFS(root->left,data);
if(root->right!=NULL) DFS(root->right,data);
temp.pop_back();
}
node* create(int inL,int inR,int preL,int preR){
if(preL>preR) return NULL;
node *root=new node;
root->data=pre[preL];
int k;
for(k=inL;k<=inR;k++){
if(in[k]==pre[preL]){
break;
}
}
int numleft=k-inL;
root->left=create(inL,k-1,preL+1,preL+numleft);
root->right=create(k+1,inR,preL+numleft+1,preR);
}
int main()
{
scanf("%d%d",&m,&n);
for(int i=0;i<n;i++){
scanf("%d",&in[i]);
}
for(int i=0;i<n;i++){
scanf("%d",&pre[i]);
}
node* root=create(0,n-1,0,n-1);
//printf("%d",root->data);
int h1,h2;
// DFS(root,8);
// for(auto it=res.begin();it!=res.end();it++){
// printf("%d",*it);
// }
for(int i=0;i<m;i++){
temp.clear();
res.clear();
vector<int> v1,v2;
scanf("%d%d",&h1,&h2);
DFS(root,h1);
v1=res;
temp.clear();
res.clear();
DFS(root,h2);
v2=res;
if(v1.size()==0&&v2.size()==0){
printf("ERROR: %d and %d are not found.",h1,h2);
}
else if(v1.size()==0){
printf("ERROR: %d is not found.",h1);
}
else if(v2.size()==0){
printf("ERROR: %d is not found.",h2);
}
else{
vector<int>::iterator it1,it2;
it1=v1.begin();
it2=v2.begin();
while(it1!=v1.end()&&it2!=v2.end()){
if(*it1!=*it2) break;
it1++;
it2++;
}
if(it1==v1.end()){
printf("%d is an ancestor of %d.",h1,h2);
}
else if(it2==v2.end()){
printf("%d is an ancestor of %d.",h2,h1);
}
else{
printf("LCA of %d and %d is %d.",h1,h2,*(it1-1));
}
}
if(i<m-1) printf("\n");
}
}