Middle-题目129:337. House Robber III(增补1)

转载 2016年05月31日 20:23:55

题目原文:
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.

Example 1:
     3
    / \
   2   3
    \   \ 
     3   1

Maximum amount of money the thief can rob = 3 + 3 + 1 = 7.

Example 2:
     3
    / \
   4   5
  / \   \ 
 1   3   1

Maximum amount of money the thief can rob = 4 + 5 = 9.
题目大意:
此题是Easy-题目26Middle-题目58的变形,这次这个贼偷的是二叉树,每偷一个节点,它的父节点和子节点都不能偷了,求最大收益。
题目分析:
我们很熟悉的前两题都是使用动态规划,而这道题用的是深搜,深搜的返回结果是一个两个元素的数组profit,其中profit[0]代表偷当前节点的时候得到的最大收益,profit[1]代表不偷当前节点时获得的最大收益。那么每次搜索左右子树的最大收益记为leftprofit和rightprofit,并取:
profit[0]=leftProfit[1]+rightProfit[1]+root.val;
profit[1]=Math.max(leftProfit[0],leftProfit[1])+Math.max(rightProfit[0],rightProfit[1]);
直到遇到空节点返回new int[2].
源码:(language:java)

public class Solution {
    public int rob(TreeNode root) {
        int[] profit = dfs(root);
        return Math.max(profit[0], profit[1]);
    }
    private int[] dfs(TreeNode root) {
        int[] profit = new int[2];
        // profit[0] stands for the maximum profit with robbing root, while profit[1] stands for the maximum profit without robbing root.
        if(root!=null) {
            int[] leftProfit = dfs(root.left);
            int[] rightProfit = dfs(root.right);
            profit[0] = leftProfit[1] + rightProfit[1] + root.val;
            profit[1] = Math.max(leftProfit[0],leftProfit[1]) + Math.max(rightProfit[0], rightProfit[1]);
            return profit;
        }
        return new int[2];
    }
}

成绩:
1ms(统计信息还未显示)
Cmershen的碎碎念:
本题的递归之前的题较少接触,递归的关系不太容易看出来,其实递归的设计应该是考虑函数的入口参数和返回值以及函数的功能,而不是强调递推关系式(类似斐波那契数列的递归方法或者欧几里得算法求gcd),那样构思很多时候是想不出来的(比如本题)。

相关文章推荐

leetcode_middle_31_337. House Robber III

分析: 找出二叉树中最大的不相邻结点的值的和 题意: 一开始的想法是用一个布尔型参数确定下一个结点的值取不取,想的是就两种情况,一层取,下一层就不去...: private void h...
  • pusude
  • pusude
  • 2017年02月08日 19:39
  • 91

LeetCode #337 - House Robber III - Medium

ProblemThe thief has found himself a new place for his thievery again. There is only one entrance to...
  • Arcome
  • Arcome
  • 2016年11月09日 18:54
  • 142

[leetcode]337. House Robber III

The thief has found himself a new place for his thievery again. There is only one entrance to this a...

337. House Robber III

The thief has found himself a new place for his thievery again. There is only one entrance to this a...

LeetCode 337. House Robber III

大概题意:给定一棵二叉树,每个节点都有一个值,要求从其中选取若干个节点,是的值的和最大,约束条件为任意两个选取的节点之间不能相连。           解题的思路也很清晰,我们可以用动态规划的做法,...
  • isNoel
  • isNoel
  • 2016年12月22日 18:49
  • 142

leetcode 337:House Robber III

leetcode 337:House Robber III。leetcode新题,递归的动态规划

LeetCode - 337. House Robber III

这道题目具有Binary Tree的结构并且拥有最优子结构这一性质,也就是说如果我们想从当前的root抢劫到最多的钱,那么我们也希望在root的left和right子树上面抢到最多的钱。题目中已经给出...

[Leetcode] 337. House Robber III 解题报告

题目: The thief has found himself a new place for his thievery again. There is only one entrance ...

LeetCode337. House Robber III

题目: https://leetcode.com/problems/house-robber-iii/ The thief has found himself a new place for hi...
  • codeTZ
  • codeTZ
  • 2016年03月23日 20:34
  • 986

337 leetcode House Robber III

欢迎使用Markdown编辑器写博客本Markdown编辑器使用StackEdit修改而来,用它写博客,将会带来全新的体验哦: Markdown和扩展Markdown简洁的语法 代码块高亮 图片链接和...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Middle-题目129:337. House Robber III(增补1)
举报原因:
原因补充:

(最多只允许输入30个字)