213. House Robber II
来源:互联网 发布:监控设备搜索软件 编辑:程序博客网 时间:2024/06/08 10:46
213. House Robber II
题目:
After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. This time, all houses at this place are arranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, the security system for these houses remain the same as for those in the previous street.Given a list of non-negative integers representing the amount of money of each house, determine the maximum amount of money you can rob tonight without alerting the police.
代码如下:
class Solution {public: int rob(vector<int>& nums) { int n = nums.size(); if (n < 2) return n ? nums[0] : 0; return max(robber(nums, 0, n - 2), robber(nums, 1, n - 1)); }private: int robber(vector<int>& nums, int l, int r) { int pre = 0, cur = 0; for (int i = l; i <= r; i++) { int temp = max(pre + nums[i], cur); pre = cur; cur = temp; } return cur; }};
解题思路:
这个问题可以简单地分解成两个房屋抢劫者的问题。
假设有n个房子,因为0号住宅和N - 1是邻居,我们不能一起抢劫,因此现在解决方案是最大的。
a.抢劫房屋0至N - 2;
b.抢劫房屋1至N - 1。
阅读全文
0 0
- 213.House Robber II
- 213. House Robber II
- 213. House Robber II
- 213. House Robber II
- 213. House Robber II
- 213. House Robber II
- 213. House Robber II
- 213. House Robber II
- 213. House Robber II
- 213. House Robber II
- 213. House Robber II
- 213. House Robber II
- 213. House Robber II
- 213. House Robber II
- 213. House Robber II
- 213. House Robber II**
- 213. House Robber II
- 213. House Robber II
- 技术广度和难度
- Linux系统编程——进程的介绍
- 33STL之Map和multimap容器
- Java面试笔试题大汇总(最全+详细答案)
- caffe:将图像转化为LMDB格式文件
- 213. House Robber II
- 利用建站快速软件包:XAMPP,构建基于winodws平台快速搭建PHP的数据库应用- kimai
- EventBus框架总结之用法
- CakePHP中的级联删除及批量删除
- LeetCode 198. House Robber 递归->记忆->动态规划 ->新思路
- usermod
- Java内存模型学习
- 解决chrome无法启用印象笔记-剪藏功能的办法
- caffe:使用训练好的模型