LeetCode学习篇十四——House Robber
来源:互联网 发布:linux usleep 头文件 编辑:程序博客网 时间:2024/06/08 01:07
题目: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.
难度:easy 通过率:26.8%
理解了这道题的题意,状态转移方程就很容易想出来了,利用count数组记录偷取前i家的财产总额,如果偷取第i家,则加上count[i-2],和偷取前i-1家的财产总额比较,取较大值。这里有个需要注意的地方,一开始忘记判断特殊情况当数组大小为0或1时,所以一直导致RTE。
代码实现如下,时间复杂度:O(n)
class Solution {public: int rob(vector<int>& nums) { if(nums.size() == 0) return 0; if(nums.size() == 1) return nums[0]; vector<int> count(nums.size(),0); count[0] = nums[0]; count[1] = max(nums[0],nums[1]); for(int i = 2; i < nums.size(); i++) { count[i] = max(count[i-2]+nums[i], count[i-1]); } return count[nums.size()-1]; }};
0 0
- LeetCode学习篇十四——House Robber
- LeetCode——House Robber
- LeetCode——House Robber
- LeetCode——House Robber
- LeetCode题解——House Robber III
- Leetcode——198. House Robber
- LeetCode198—House Robber
- leetcode——198——House Robber
- leetcode——213——House Robber II
- leetcode——337—— House Robber III
- 【dp】Leetcode House Robber&& House Robber II
- 【leetcode】House Robber && House Robber II
- LeetCode --- House Robber & House Robber II
- LeetCode198——House Robber
- Leetcode198——House Robber
- DP——House Robber
- Algorithms—198.House Robber
- LeetCode OJ House Robber
- jquery源码学习--资源清单
- 网易视频云受邀参加中国视频云峰会,有哪些看点?
- 排座椅
- 树莓派3b学习笔记
- git用法,clone依赖的库
- LeetCode学习篇十四——House Robber
- 统计文件中单词出现的行号及打印出该行内容
- 一天一条Linux指令-useradd
- 1101学习记录!!!一定切记,executeUpdate后面括号中不要添加strSql
- Google 发布 Android 性能优化典范
- redis 键(key)
- 网易视频云受邀参加中国视频云峰会,有哪些看点?
- linux环境变量不能生效问题
- 亿级Web系统搭建——单机到分布式集群