LeetCode OJ 之 House Robber(抢劫犯)
来源:互联网 发布:红太阳炒股软件 编辑:程序博客网 时间:2024/05/30 13:41
题目:
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security system connected and it will automatically contact the police if two adjacent houses were broken into on the same night.
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.
假设你是一个专业抢劫犯,计划抢劫一条街道的房子。每个房子内都有一定数量的钱,唯一限制你抢劫的是每相邻的两个房子都有安保系统连接。如果两个相邻的房子都被破门而入的话,安保系统会自动报警。有一组非负整数代表每个房子内的钱数,判断如何在不惊动警察的情况下可以抢劫的最多钱数。
思路:
动态规划:假设 f [ i ] 表示到第 i 个房子抢到的钱,则可得到状态转移方程为:f [ i ] = max( f [ i - 2 ] + nums [ i ] , f [ i - 1 ]).
代码:
class Solution {public: int rob(vector<int>& nums) { int len = nums.size(); if(len == 0) return 0; if(len == 1) return nums[0]; if(len == 2) return max(nums[0] , nums[1]); vector<int> f(len , 0); f[0] = nums[0]; f[1] = max(nums[0] , nums[1]); for(int i = 2 ; i < len ; i++) f[i] = max(f[i-2] + nums[i] , f[i-1]); return f[len-1]; }};
优化空间复杂度:
class Solution {public: int rob(vector<int>& nums) { int len = nums.size(); int f0 = 0 , f1 = 0 , f2 = 0; for(int i = 0 ; i < len ; i++) { f2 = max(f0 + nums[i] , f1); f0 = f1 ; f1 = f2; } return f2; }};
0 0
- LeetCode OJ 之 House Robber(抢劫犯)
- LeetCode OJ 之 House Robber II (抢劫犯 - 二)
- 【LeetCode-面试算法经典-Java实现】【198-House Robber(抢劫犯)】
- LeetCode OJ House Robber
- LeetCode OJ 198 House Robber
- LeetCode OJ-198. House Robber
- LeetCode 之 House Robber
- LeetCode 之 House Robber
- leetcode之House Robber
- leetcode之House Robber
- leetcode之house Robber
- LeetCode之House Robber
- leetcode之旅-easy(House Robber)
- LeetCode之旅(22)-House Robber
- <LeetCode OJ> (198 / 213) House Robber(I / II)
- leetcode之House Robber(打家劫舍)
- leetcode之House Robber II
- leetcode之 House Robber III
- 非常简单的语音朗读功能
- Android 实现记住用户名和密码的功能
- 第13周项目 程序阅读(6)
- 第十二周 【项目2 - 摩托车继承自行车和机动车】
- 7zip 压缩 压缩路径的问题
- LeetCode OJ 之 House Robber(抢劫犯)
- 形状类族的纯虚数
- mybatis(错误一) 项目启动时报“Result Maps collection already contains value forxxx”的解决方案
- Android自定义组合控件---简单导航栏
- C++刷题——2830: 递归求1*1+2*2+3*3+……+n*n
- GitHub 上都有哪些值得关注学习的 iOS 开源项目?
- Android 实现记住用户名和密码的功能
- 第十三周 项目一 动物这样叫
- 第13周-程序阅读(4)