14/12/2020

Author: jameszu

Daily-challenge/Dec/12/README.md

@@ -41,16 +41,27 @@ The values of the nodes in the tree are unique. <br>
 
 ## Code
 ```python
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
 class Solution:
-    def permuteUnique(self, nums):
-        ans = [[]]
-        for n in nums:
-            new_ans = []
-            for l in ans:
-                for i in range(len(l)+1):
-                    new_ans.append(l[:i]+[n]+l[i:])
-                    if i<len(l) and l[i]==n: break             
-            ans = new_ans
-        return ans
+    def subtreeWithAllDeepest(self, root: TreeNode) -> TreeNode:
+        def postorder(root):
+            if not root: return 0, None
+            
+            l, r = postorder(root.left), postorder(root.right)
+            
+            if l[0] > r[0]:
+                return l[0] + 1, l[1]
+            elif l[0] < r[0]:
+                return r[0] + 1, r[1]
+            
+            else:
+                return l[0] + 1, root
+            
+        return postorder(root)[1]
 ```
 

Daily-challenge/Dec/12/sol.py

@@ -1,11 +1,22 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
 class Solution:
-    def permuteUnique(self, nums):
-        ans = [[]]
-        for n in nums:
-            new_ans = []
-            for l in ans:
-                for i in range(len(l)+1):
-                    new_ans.append(l[:i]+[n]+l[i:])
-                    if i<len(l) and l[i]==n: break             
-            ans = new_ans
-        return ans
+    def subtreeWithAllDeepest(self, root: TreeNode) -> TreeNode:
+        def postorder(root):
+            if not root: return 0, None
+            
+            l, r = postorder(root.left), postorder(root.right)
+            
+            if l[0] > r[0]:
+                return l[0] + 1, l[1]
+            elif l[0] < r[0]:
+                return r[0] + 1, r[1]
+            
+            else:
+                return l[0] + 1, root
+            
+        return postorder(root)[1]