1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
|
class (object): def leafSimilar(self, root1, root2): """ :type root1: TreeNode :type root2: TreeNode :rtype: bool """ def dfs(root,rec): if not root.left and not root.right: rec.append(root.val) if root.left: dfs(root.left,rec) if root.right: dfs(root.right,rec) rec1, rec2 = [], [] dfs(root1, rec1) dfs(root2, rec2) return rec1 == rec2
36 / 36 test cases passed. diffculty: easy Runtime: 28 ms
|
近期评论