My LeetCode grinding. Trying to do a problem a day.
Вы не можете выбрать более 25 тем Темы должны начинаться с буквы или цифры, могут содержать дефисы(-) и должны содержать не более 35 символов.

1234567891011121314151617181920212223242526272829
  1. class TreeNode:
  2. def __init__(self, x):
  3. self.val = x
  4. self.left = None
  5. self.right = None
  6. class Solution:
  7. def getTargetCopy(self, original: TreeNode, cloned: TreeNode, target: TreeNode) -> TreeNode:
  8. return self.findTarget(cloned, target)
  9. def findTarget(self, tree, t):
  10. if tree is not None:
  11. if tree.val == t.val:
  12. return tree
  13. leftFound = self.findTarget(tree.left, t)
  14. rightFound = self.findTarget(tree.right, t)
  15. if leftFound is not None:
  16. return leftFound
  17. elif rightFound is not None:
  18. return rightFound
  19. s = Solution()
  20. o = TreeNode(1)
  21. o.left = TreeNode(3)
  22. c = TreeNode(1)
  23. t = TreeNode(3)
  24. c.left = t
  25. print("Expected: 3")
  26. print("Got:", s.getTargetCopy(o, c, t).val)