House Robber (leetcode 198)
来源:互联网 发布:各班级出勤率数据图表 编辑:程序博客网 时间:2024/04/29 02:03
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.
Credits:
Special thanks to @ifanchu for adding this problem and creating all test cases. Also thanks to @ts for adding additional test cases.
- 动态规划
class Solution {public: int rob(vector<int>& nums) { cout << nums.size(); vector<int> a, b; cout << a.size() << b.size(); if (nums.size() == 0) { return 0; } if (nums.size() == 1) { return nums[0]; } a.push_back(nums[0]); b.push_back(0); a.push_back(nums[1]); b.push_back(nums[0]); for (int i = 2; i < nums.size(); ++i) { a.push_back(b[i - 1] + nums[i]); b.push_back(b[i - 1] > a[i - 1] ? b[i - 1] : a[i - 1]); } return a.back() > b.back() ? a.back() : b.back(); }};---------------------class Solution {public: int rob(vector<int> &num) { int n = num.size(); if(n == 0) return 0; else if(n == 1) return num[0]; else { vector<int> maxV(n, 0); maxV[0] = num[0]; maxV[1] = max(num[0], num[1]); for(int i = 2; i < n; i ++) maxV[i] = max(maxV[i-2]+num[i], maxV[i-1]); return maxV[n-1]; } }};
0 0
- Leetcode 198: House Robber
- leetcode-198 House Robber
- [LeetCode 198]House Robber
- House Robber - LeetCode 198
- leetcode 198 House Robber
- leetCode #198 House Robber
- LeetCode 198-House Robber
- Leetcode[198]-House Robber
- 【Leetcode】House Robber #198
- Leetcode 198 House Robber
- leetcode 198:House Robber
- House Robber (leetcode 198)
- 【LeetCode】198:House Robber
- leetcode[198]:House Robber
- leetcode-198-House Robber
- leetcode 198: House Robber
- [LeetCode 198]House Robber
- Leetcode# 198 House Robber
- 数组中只出现一次的数
- 轻量级分布式 RPC 框架DIY(转)
- C - The C Answer (2nd Edition) - Exercise 1-11
- NSHashTable的特性和使用
- 第三章:Java语言基础II 第9、10节 综合案例 算命程序
- House Robber (leetcode 198)
- linux下几种目标文件的分析
- Java语言基础1--专题课 拆数
- Binary Tree Postorder Traversal
- 链表
- Hdu 5113 Black and White ---2014北京现场赛B题
- 大整数除法
- 解析目标文件
- 第三章——目标文件里有什么