[Leo] 3rd Week solutions <Typo fixed, code manipulation>

Author: leokim0922

climbing-stairs/Leo.py

@@ -9,4 +9,4 @@ def climbStairs(self, n: int) -> int:
 
         return fast
 
-        ## TC: O(n), SC(1)
+        ## TC: O(n), SC:O(1)

meeting-rooms/Leo.py

@@ -8,4 +8,4 @@ def canAttendMeetings(self, intervals: List[List[int]]) -> bool:
 
         return True
 
-        ## TC: n(nlogn), SC: O(1)
+        ## TC: O(nlogn), SC: O(1)

same-tree/Leo.py

@@ -9,6 +9,6 @@ def isSameTree(self, p: Optional[TreeNode], q: Optional[TreeNode]) -> bool:
         if p and q:
             return p.val == q.val and self.isSameTree(p.right, q.right) and self.isSameTree(p.left, q.left)
         else:
-            return p == q
+            return p is None and q is None
 
         ## TC: O(n), SC: O(n) or O(logn) if it is balanced

subtree-of-another-tree/Leo.py

@@ -6,24 +6,25 @@
 #         self.right = right
 class Solution:
     def isSubtree(self, root: Optional[TreeNode], subRoot: Optional[TreeNode]) -> bool:
-        def dfs(root, subroot):
-            if not root and not subroot:
+
+        def dfs(root, subRoot):
+            if not root and not subRoot:
                 return True
-            if not root or not subroot:
+            if not root or not subRoot:
                 return False
-            if root.val != subroot.val:
+            if root.val != subRoot.val:
                 return False
 
-            return dfs(root.left, subroot.left) and dfs(root.right, subroot.right)
+            return dfs(root.left, subRoot.left) and dfs(root.right, subRoot.right)
 
-        def solve(root, subroot):
+        def solve(root):
             if not root:
                 return False
-            if dfs(root, subroot):
+            if dfs(root, subRoot):
                 return True
-            return solve(root.left, subroot) or solve(root.right, subroot)
+            return solve(root.left) or solve(root.right)
 
-        return solve(root, subRoot)
+        return solve(root)
 
         ## TC: O(mn), where m and n denote len(subroot) and len(root)
         ## SC: O(m+n)