MCPcopy Create free account
hub / github.com/LjyYano/LeetCode / rob

Method rob

src/main/java/L0337_HouseRobberIII.java:36–39  ·  view source on GitHub ↗

使用后序遍历解决打家劫舍 III 对于每个节点,返回一个长度为 2 的数组 dp[0] 表示不选择当前节点时能获得的最大金额 dp[1] 表示选择当前节点时能获得的最大金额

(TreeNode root)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 1

mainMethod · 0.95

Calls 1

robHelperMethod · 0.95

Tested by

no test coverage detected