StarMirror/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

auto commit

Browse Source
This commit is contained in:
CyC2018 2021-04-19 00:32:56 +08:00
parent 156f7a67f4
commit 908fd6c8e0
1 changed files with 6 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
notes/Leetcode 题解 - 树.md
View File

@ -427,13 +427,18 @@ Maximum amount of money the thief can rob = 3 + 3 + 1 = 7.
``` ```
```java ```java
Map<TreeNode, Integer> cache = new HashMap<>();
public int rob(TreeNode root) { public int rob(TreeNode root) {
if (root == null) return 0; if (root == null) return 0;
if (cache.containsKey(root)) return cache.get(root);
int val1 = root.val; int val1 = root.val;
if (root.left != null) val1 += rob(root.left.left) + rob(root.left.right); if (root.left != null) val1 += rob(root.left.left) + rob(root.left.right);
if (root.right != null) val1 += rob(root.right.left) + rob(root.right.right); if (root.right != null) val1 += rob(root.right.left) + rob(root.right.right);
int val2 = rob(root.left) + rob(root.right); int val2 = rob(root.left) + rob(root.right);
return Math.max(val1, val2); int res = Math.max(val1, val2);
cache.put(root, res);
return res;
} }
``` ```