337. House Robber III
2016-03-30 22:10
316 查看
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:
Maximum amount of money the thief can rob = 3 + 3 + 1 = 7.
Example 2:
Maximum amount of money the thief can rob = 4 + 5 = 9.
这道题就是个深搜,不过可能我没有减枝还是什么,时间是1188ms,网上的是16ms。但是思想貌似是一样的:
1.当前结点值加上孩子的孩子得curSum。
2.不算当前结点,左子树和右子树相加(包括当前结点的左右孩子)得lrmax;
算出来取最大值返回即可。
不知此题有无非递归法?
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int rob(TreeNode* root) {
if(root==NULL)
return 0;
int leftmax=0;
int rightmax=0;
int cur=root->val;
if(root->left!=NULL){
leftmax=rob(root->left);
cur+=rob(root->left->left)+rob(root->left->right);
}
if(root->right!=NULL){
rightmax=rob(root->right);
cur+=rob(root->right->left)+rob(root->right->right);
}
if(cur<leftmax+rightmax)
cur=leftmax+rightmax;
return cur;
}
};
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.
这道题就是个深搜,不过可能我没有减枝还是什么,时间是1188ms,网上的是16ms。但是思想貌似是一样的:
1.当前结点值加上孩子的孩子得curSum。
2.不算当前结点,左子树和右子树相加(包括当前结点的左右孩子)得lrmax;
算出来取最大值返回即可。
不知此题有无非递归法?
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int rob(TreeNode* root) {
if(root==NULL)
return 0;
int leftmax=0;
int rightmax=0;
int cur=root->val;
if(root->left!=NULL){
leftmax=rob(root->left);
cur+=rob(root->left->left)+rob(root->left->right);
}
if(root->right!=NULL){
rightmax=rob(root->right);
cur+=rob(root->right->left)+rob(root->right->right);
}
if(cur<leftmax+rightmax)
cur=leftmax+rightmax;
return cur;
}
};
相关文章推荐
- 设计模式之享元模式
- git版本控制工具的学习
- linux配置java环境变量
- Handler 接收Parcelable ArrayList时返回空的错误
- Docker安装脚本源码解读
- 笔记 - Android - 6.上下文Context API
- ubuntu中安装docker
- 孤儿进程和僵尸进程
- mybatis 注解和xml的使用
- Maven使用详解(一)
- android Spinner控件详解
- Android_Short_Key
- 【LeetCode-338】 Counting Bits
- android仿苹果SwitchButton效果的实现【新浪云搬运】
- 华宇拼音输入法在英雄联盟中没有输入框
- PHP中实现页面刷新或跳转的方法
- Java数据结构——有序链表
- block 用法2
- Android Studio 学习 2
- java大牛list