精華區beta Marginalman 關於我們 聯絡資訊
100.same tree 題目給定兩個tree 判斷他們是不是長一樣 判斷節點一樣加遞迴左右子樹 class Solution: def isSameTree(self, p: Optional[TreeNode], q: Optional[TreeNode]) -> bool: if p is not None and q is not None: return p.val == q.val and self.isSameTree(p.left, q.left) and self.i sSameTree(p.right, q.right) elif p is None and q is None: return True else: return False ---- Sent from BePTT on my iPhone 13 mini -- ※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 27.242.32.63 (臺灣) ※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1708917849.A.8FC.html
DJYOSHITAKA: 大濕 02/26 11:31
digua: 大師 02/26 11:31
wu10200512: 大師 02/26 11:32
ijustcame: 大師 02/26 11:48