zoukankan      html  css  js  c++  java
  • 1379. 找出克隆二叉树中的相同节点

    Given two binary trees original and cloned and given a reference to a node target in the original tree.

    The cloned tree is a copy of the original tree.

    Return a reference to the same node in the cloned tree.

    Note that you are not allowed to change any of the two trees or the target node and the answer must be a reference to a node in the cloned tree.

    Follow up: Solve the problem if repeated values on the tree are allowed.

    Example 1:

     
    Input: tree = [7,4,3,null,null,6,19], target = 3
    Output: 3
    Explanation: In all examples the original and cloned trees are shown. The target node is a green node from the original tree. The answer is the yellow node from the cloned tree.

    Example 2:

     
    Input: tree = [7], target = 7
    Output: 7

    Example 3:

     
    Input: tree = [8,null,6,null,5,null,4,null,3,null,2,null,1], target = 4
    Output: 4

    Example 4:

     
    Input: tree = [1,2,3,4,5,6,7,8,9,10], target = 5
    Output: 5

    Example 5:

     
    Input: tree = [1,2,null,3], target = 2
    Output: 2

    Constraints:

    • The number of nodes in the tree is in the range [1, 10^4].

    • The values of the nodes of the tree are unique.

     target node is a node from the original tree and is not null.

     

     

    # 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) -> TreeNode:
            if not original or not cloned:return None
            if original==target:return cloned
            left=self.getTargetCopy(original.left,cloned.left,target)
            right=self.getTargetCopy(original.right,cloned.right,target)
            return left or right
                

  • 相关阅读:
    【转自百度贴吧】把古诗最后三个字改为“日了狗”,看谁最有才!
    计划!
    [BZOJ2424][HAOI2010]订货
    [BZOJ1026][SCOI2009]windy数
    【作文】高考之外
    [AYYZVijos1761]运输问题
    [BZOJ1047][HAOI2007]理想的正方形
    [NOIP2015]代码
    新的独立博客
    不忘初心,方得始终——NOIP2016前的感悟
  • 原文地址:https://www.cnblogs.com/xxxsans/p/13833693.html
Copyright © 2011-2022 走看看