不知道为什么5个测试用例我错了4个
我觉得我的思路对的啊,而且作者给出的源程序的例子跑了一遍我也是输出正确结果
只想说,坑爹!九度不给出测试用例我怎么知道错在哪里!!
所以还是大爱leetcode!
我的思路和源码思路不一样,源码是找出到给定节点的路径,再找它们公共祖先。
我是找左子树是否有这2个值存在,如果存在,输出。
#include <iostream>
#include <vector>
#include <string>
#include <cstdio>
#include<sstream>
using namespace std;
struct TreeNode
{
TreeNode *left,*right;
int val;
TreeNode(int _val){val=_val;left=NULL,right=NULL;}
};
TreeNode* getCommonParent(TreeNode *root,int v1,int v2,bool &b1,bool &b2)
{
if(root==NULL)return root;
bool bl1=false,bl2=false;
TreeNode *left=getCommonParent(root->left,v1,v2,bl1,bl2);
if(left!=NULL) return left;
bool br1=false,br2=false;
TreeNode *right=getCommonParent(root->right,v1,v2,br1,br2);
if(right!=NULL) return right;
if(root->val==v1) b1=true;
else if(root->val==v2) b2=true;
b1=b1 || (bl1||br1);
b2=b2 || (bl2||br2);
if(b1 && b2) return root;
else return NULL;
}
TreeNode* getCommonParent(TreeNode *root,int v1,int v2)
{
bool b1=false,b2=false;
return getCommonParent(root,v1,v2,b1,b2);
}
TreeNode *buildTree(vector<int> &vec,int &idx)
{
if(idx>=vec.size()) return NULL;
if(vec[idx]==0)
{
++idx;
return NULL;
}
TreeNode *root=new TreeNode(vec[idx]);
idx++;
root->left=buildTree(vec,idx);
root->right=buildTree(vec,idx);
return root;
}
int main()
{
int numsOfTest;
string line;
getline(cin, line);
istringstream tmp0(line);
tmp0>>numsOfTest;
vector<int> result;
for(int i=0;i<numsOfTest;i++)
{
getline(cin, line);
istringstream tmp(line);
vector<int> treeVal;
int k;
while(tmp>>k)
{
treeVal.push_back(k);
}
int begin=0;
TreeNode *root=buildTree(treeVal,begin);
getline(cin, line);
istringstream tmp2(line);
int v1,v2;
tmp2>>v1>>v2;
TreeNode *p=getCommonParent(root,v1,v2);
if(p==NULL) result.push_back(0);
else result.push_back(p->val);
//if(p==NULL) printf("My God\n");
//else printf("%d\n",p->val);
}
for (int i=0;i<result.size();i++)
{
if(result[i]==0) printf("My God\n");
else printf("%d\n",result[i]);
}
return 0;
}