337. House Robber III(Leetcode每日一题-2020.08.05)

本文主要是介绍337. House Robber III(Leetcode每日一题-2020.08.05)，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

Problem

The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the “root.” Besides the root, each house has one and only one parent house. After a tour, the smart thief realized that “all houses in this place forms a binary tree”. It will automatically contact the police if two directly-linked houses were broken into on the same night.

Determine the maximum amount of money the thief can rob tonight without alerting the police.

Example1

Example2

Solution

/*** Definition for a binary tree node.* struct TreeNode {*     int val;*     TreeNode *left;*     TreeNode *right;*     TreeNode(int x) : val(x), left(NULL), right(NULL) {}* };*/

这篇关于337. House Robber III(Leetcode每日一题-2020.08.05)的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---