2020-08-06

JiayangWu · JiayangWu · commit 0f41ca89dc02 · 2020-08-06T23:46:09.000-04:00
diff --git a/0100.相同的树/0100-相同的树.py b/0100.相同的树/0100-相同的树.py
@@ -1,19 +1,18 @@
 # Definition for a binary tree node.
 # class TreeNode(object):
-#     def __init__(self, x):
-#         self.val = x
-#         self.left = None
-#         self.right = None
-
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
 class Solution(object):
     def isSameTree(self, p, q):
         """
         :type p: TreeNode
         :type q: TreeNode
         :rtype: bool
         """
-        if not p:
-            return not q
-        if not q:
-            return not p
+        if not p and not q:
+            return True
+        if not p or not q:
+            return False
         return p.val == q.val and self.isSameTree(p.left, q.left) and self.isSameTree(p.right, q.right)
