Add files via upload

Author: assassint2017

House Robber III/House_Robber_III.cpp

@@ -0,0 +1,48 @@
+// Runtime: 28 ms, faster than 72.39% of C++ online submissions for House Robber III.
+// Memory Usage: 23.8 MB, less than 23.60% of C++ online submissions for House Robber III.
+
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
+ * };
+ */
+typedef unordered_map<TreeNode*, int> HashMap;
+class Solution 
+{
+public:
+    int rob(TreeNode* root) 
+    {
+        HashMap hashmap;
+        return helper(root, hashmap);
+    }
+private:
+    int helper(TreeNode* root, HashMap& hashmap)
+    {
+        if (!root)
+            return 0;
+        if (hashmap.find(root) == hashmap.end())
+        {
+            int notrobfirst = helper(root->left, hashmap) + helper(root->right, hashmap);
+            
+            int robfirst = root->val;
+            if (root->left && root->right)
+                robfirst += helper(root->left->left, hashmap) + 
+                            helper(root->left->right, hashmap) +
+                            helper(root->right->left, hashmap) +
+                            helper(root->right->right, hashmap);
+
+            else if (root->left)
+                robfirst += helper(root->left->left, hashmap) + helper(root->left->right, hashmap);
+            
+            else if (root->right)
+                robfirst += helper(root->right->left, hashmap) + helper(root->right->right, hashmap);
+            
+            hashmap.insert(make_pair(root, max(notrobfirst, robfirst)));
+        }
+        return hashmap.at(root);
+    }
+};

House Robber III/House_Robber_III.py

@@ -0,0 +1,32 @@
+# Runtime: 72 ms, faster than 39.39% of Python3 online submissions for House Robber III.
+# Memory Usage: 15.8 MB, less than 5.09% of Python3 online submissions for House Robber III.
+
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, x):
+#         self.val = x
+#         self.left = None
+#         self.right = None
+
+class Solution:
+    def rob(self, root: TreeNode) -> int:
+        hashmap = dict()
+        return self.helper(root, hashmap)
+    def helper(self, root, hashmap):
+        if root is None:
+            return 0
+        if root not in hashmap:
+            notrobfirst = self.helper(root.left, hashmap) + self.helper(root.right, hashmap)
+            robfirst = root.val
+            if root.left and root.right:
+                robfirst += (self.helper(root.left.left, hashmap) +
+                            self.helper(root.left.right, hashmap) +
+                            self.helper(root.right.left, hashmap) +
+                            self.helper(root.right.right, hashmap))
+            elif root.left:
+                robfirst += self.helper(root.left.left, hashmap) + self.helper(root.left.right, hashmap)
+            elif root.right:
+                robfirst += self.helper(root.right.left, hashmap) + self.helper(root.right.right, hashmap)
+            
+            hashmap[root] = max(robfirst, notrobfirst)
+        return hashmap[root]