865. House Robber III
Medium•
This problem builds on house-robber-ii. Complete that first, then load your solution to continue.
Houses form a nonempty binary tree. Each node value is the money in that house. You may choose any set of houses, but cannot choose two houses joined directly by a parent-child edge.
Return the maximum total money you can collect. Siblings may both be chosen; a grandparent and grandchild may both be chosen.
Example inputs use level-order arrays with null for missing children. Your function receives a TreeNode object.
Example 1:
![Tree represented by [3,2,3,null,3,null,1]. The root and two grandchildren are highlighted, totaling 7 without selecting adjacent houses.](/problems/house-robber-iii/example-1.svg)
Input: root = [3,2,3,null,3,null,1]
Output: 7
Explanation: Choose the root and the two grandchildren: 3 + 3 + 1 = 7.
Example 2:
Input: root = [3,4,5,1,3,null,1]
Output: 9
Explanation: Choose the root's two children: 4 + 5 = 9. They are not directly joined.
Example 3:
Input: root = [0]
Output: 0
Explanation: Choosing no houses yields zero.
Constraints
- 1 <= number of nodes <= 10000
- 0 <= node.val <= 10000
Accepted2/3|Acceptance Rate66.7%