目录
一、题目
1、题目描述
给你两棵二叉树,原始树
original
和克隆树cloned
,以及一个位于原始树original
中的目标节点target
。其中,克隆树
cloned
是原始树original
的一个 副本 。请找出在树
cloned
中,与target
相同 的节点,并返回对该节点的引用(在 C/C++ 等有指针的语言中返回 节点指针,其他语言返回节点本身)。注意:你 不能 对两棵二叉树,以及
target
节点进行更改。只能 返回对克隆树cloned
中已有的节点的引用。
2、接口描述
python3
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def getTargetCopy(self, original: TreeNode, cloned: TreeNode, target: TreeNode) -> Optional[TreeNode]:
cpp
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* getTargetCopy(TreeNode* original, TreeNode* cloned, TreeNode* target) {
}
};
3、原题链接
二、解题报告
1、思路分析
让clone跟着original前序遍历,original找到说明clone也找到,直接返回即可
2、复杂度
时间复杂度: O(n)空间复杂度:O(n)
3、代码详解
python3
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* getTargetCopy(TreeNode* original, TreeNode* cloned, TreeNode* target) {
if(!original || original == target) return cloned;
TreeNode* l = getTargetCopy(original->left, cloned->left, target), *r = getTargetCopy(original->right, cloned->right, target);
return l ? l : r;
}
};
cpp
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* getTargetCopy(TreeNode* original, TreeNode* cloned, TreeNode* target) {
if(!original || original == target) return cloned;
TreeNode* l = getTargetCopy(original->left, cloned->left, target), *r = getTargetCopy(original->right, cloned->right, target);
return l ? l : r;
}
};