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

最新推荐文章于 2022-03-05 22:30:26 发布
VIP文章 最新推荐文章于 2022-03-05 22:30:26 发布
阅读量153 收藏
点赞数
分类专栏： leetcode深度优先搜索 leetcode动态规划 leetcode系列题
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/sjt19910311/article/details/107850125
版权

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) {}
 * };
 */
最低0.47元/天 解锁文章
Bryan要加油
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
最大公共字符串leetcode-HouseRobber-Problem-LeetCode-:HouseRobber-问题-LeetCode-
07-01
HouseRobber-问题-LeetCode- @Faizansayeed28 代码 /** * 问题陈述- 你是一名职业劫匪，计划抢劫街道上的房屋。 每个房子都有一定数量的钱 藏起来，阻止你抢劫他们的唯一限制是相邻的房子有安全系统 连接，如果同一...
LeetCode337. House Robber III
_今已亭亭如盖矣
03-23 1687
题目： https://leetcode.com/problems/house-robber-iii/ 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
leetcode -- 337. House Robber III
猪の成长日记
07-06 170
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...
LeetCode 337. House Robber III - 二叉树系列题25
hgq522的博客
03-05 501
问题的关键是不能连续偷两个房子，如果是从上往下偷，那么偷了当前节点就不能偷它的两个子节点；如果是从下往上偷，那么偷了当前节点就不能偷它的父节点。
LeetCode 题解 - 337. House Robber III
艾希射日
05-19 279
title: LeetCode-337. House Robber III-简记 date: 2019-07-23 tags: [“LeetCode”, “动态规划”] categories: [“LeetCode”] LeetCode 第 337. House Robber III，题目难度 Medium。 一. 题目要求 题目概要如下： 在上次打劫完一条街道之后和一圈房屋后，小偷又发现了一个新的可行窃的地区。这个地区只有一个入口，我们称之为“根”。 除了“根”之外，每栋房子有且只有一个“父“房子与之.
LeetCode:Leetcode-解决方案
05-09
House Robber [198]6. Range Sum Query - Immutable [303]7. Counting Bits [338]8. Palindromic Substrings [647]9. Maximum Length of Pair Chain [646]10. Integer Break [343]11. Count Numbers with Unique ...
leetcode最大蓄水量-leetcode:记录自己leetocde的过程
06-30
leetcode最大蓄水量 leetcode 记录自己leetocde的过程 2021.1.31 496 Next Greater Element I 复习了 linkedlist，arraylist的区别 2021.2.1 198 House Robber 学会了数组的创建，以及动态规划最基本的题目 2021.2.2...
zoj 2898 Greedy Grave Robber.md
11-17
zoj 2898 Greedy Grave Robber.md
leetcode和oj-OJ_Solution:leetcode、poj等OJ解决方案
06-30
leetcode 和 oj OJ_Solution Solutions for OJ such as leetcode, poj and so on 版本 修改日期 修改人 1 2015-04-16 skymoney ==== Java版本解答 1，java/addtwosum https://leetcode.com/problems/two-sum/ 2, ...
面试题 17.16. The Masseuse LCCI(Leetcode每日一题-2020.03.24)
Bryan要加油
03-24 680
Problem A popular masseuse receives a sequence of back-to-back appointment requests and is debating which ones to accept. She needs a break between appointments and therefore she cannot accept any adj...
1787. Make the XOR of All Segments Equal to Zero[Hard](Leetcode每日一题-2021.05.25)--抄答案
Bryan要加油
05-25 668
Problem You are given an array nums​​​ and an integer k​​​​​. The XOR of a segment [left, right] where left <= right is the XOR of all the elements with indices between left and right, inclusive: nums[left] XOR nums[left+1] XOR … XOR nums[right]. Return
474. Ones and Zeroes[Medium](Leetcode每日一题-2021.06.06)--抄答案
Bryan要加油
06-06 622
Problem You are given an array of binary strings strs and two integers m and n. Return the size of the largest subset of strs such that there are at most m 0’s and n 1’s in the subset. A set x is a subset of a set y if all elements of x are also elements o
1449. Form Largest Integer With Digits That Add up to Target[Hard](Leetcode每日一题-2021.06.12)--抄答案
Bryan要加油
06-15 590
Problem Given an array of integers cost and an integer target. Return the maximum integer you can paint under the following rules: The cost of painting a digit (i+1) is given by cost[i] (0 indexed). The total cost used must be equal to target. Integer does
879. Profitable Schemes[Hard](Leetcode每日一题-2021.06.09)--抄答案
Bryan要加油
06-09 525
Problem There is a group of n members, and a list of various crimes they could commit. The ith crime generates a profit[i] and requires group[i] members to participate in it. If a member participates in one crime, that member can’t participate in another c
494. Target Sum[Medium](Leetcode每日一题-2021.06.07)--抄答案
Bryan要加油
06-07 523
Problem You are given an integer array nums and an integer target. You want to build an expression out of nums by adding one of the symbols ‘+’ and ‘-’ before each integer in nums and then concatenate all the integers. For example, if nums = [2, 1], you c
279. Perfect Squares[Medium](Leetcode每日一题-2021.06.11)--抄答案
Bryan要加油
06-15 520
Problem Given an integer n, return the least number of perfect square numbers that sum to n. A perfect square is an integer that is the square of an integer; in other words, it is the product of some integer with itself. For example, 1, 4, 9, and 16 are pe
213. House Robber II(Leetcode每日一题-2021.04.15)
Bryan要加油
04-15 512
Problem You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, adjacen
740. Delete and Earn(Leetcode每日一题-2021.05.05)--抄答案
Bryan要加油
05-06 493
Problem Given an array nums of integers, you can perform operations on the array. In each operation, you pick any nums[i] and delete it to earn nums[i] points. After, you must delete every element equal to nums[i] - 1 or nums[i] + 1. You start with 0 point
leetcode动态规划习题
最新发布
10-01
2. 打家劫舍（House Robber）：给定一个非负整数数组，代表每个房屋存放的金额，相邻的房屋不能被同时抢劫，求能够抢劫到的最大金额。 3. 最长递增子序列（Longest Increasing Subsequence）：给定一个无序的整数数...

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值