【算法作业12】LeetCode 198. House Robber
2017-05-12 01:17
447 查看
198. House Robber
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.
-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
题解:
这是一道动态规划的题目。题意是去盗窃一条路上的房子,如果盗窃两个连在一起的房子则会引发警报,因此只能盗窃不连续的房子,求能够盗窃到的最大金额数目。
题目给了一个vector<int> nums来存放每个房子的价值,我们再假设盗窃第i个和它之前的房子获得的最大金额为amount[i]。由于只能盗窃不相邻的房子,因此在决定一间房子i是否盗窃的时候只有两种方案,第一种是盗窃这个房子,那么此时获得的金钱就是nums[i] + amount[i
- 2];另一种方案是不盗窃这个房子,那么此时获得的金钱就是amount[i - 1]。遍历整个vector<int> nums,对每个房子选取获得最大金钱值的方案,最后就能获得最终结果。
代码:
class Solution {
public:
int max(int a, int b)
{
return (a > b ? a : b);
}
int rob(vector<int>& nums) {
if (nums.size() == 0)
return 0;
else
{
vector<int> amount;
amount.push_back(nums[0]);
amount.push_back(max(nums[0], nums[1]));
for (int i = 2; i < nums.size(); i++)
{
amount.push_back(max(amount[i - 2] + nums[i], amount[i - 1]));
}
return amount[nums.size() - 1];
}
}
};
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.
-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
题解:
这是一道动态规划的题目。题意是去盗窃一条路上的房子,如果盗窃两个连在一起的房子则会引发警报,因此只能盗窃不连续的房子,求能够盗窃到的最大金额数目。
题目给了一个vector<int> nums来存放每个房子的价值,我们再假设盗窃第i个和它之前的房子获得的最大金额为amount[i]。由于只能盗窃不相邻的房子,因此在决定一间房子i是否盗窃的时候只有两种方案,第一种是盗窃这个房子,那么此时获得的金钱就是nums[i] + amount[i
- 2];另一种方案是不盗窃这个房子,那么此时获得的金钱就是amount[i - 1]。遍历整个vector<int> nums,对每个房子选取获得最大金钱值的方案,最后就能获得最终结果。
代码:
class Solution {
public:
int max(int a, int b)
{
return (a > b ? a : b);
}
int rob(vector<int>& nums) {
if (nums.size() == 0)
return 0;
else
{
vector<int> amount;
amount.push_back(nums[0]);
amount.push_back(max(nums[0], nums[1]));
for (int i = 2; i < nums.size(); i++)
{
amount.push_back(max(amount[i - 2] + nums[i], amount[i - 1]));
}
return amount[nums.size() - 1];
}
}
};
相关文章推荐
- [算法作业][LeetCode] 50. Pow(x, n) -- 分治法
- 【算法作业3】LeetCode 169. Majority Element
- 【算法作业16】LeetCode 343. Integer Break
- 算法课程Leetcode作业第三周技术博客
- 算法课程Leetcode作业第二周技术博客
- 【python】【leetcode】【算法题目12—Integer to Roman】
- 算法系列(12)LeetCode292 Nim Game
- 【算法作业14】LeetCode 413. Arithmetic Slices
- 【算法作业13】LeetCode 338. Counting Bits
- 算法课程第六周Leetcode作业
- [算法作业][LeetCode] 133. Clone Graph
- 第六周作业2(LeetCode 12)
- 【算法作业7】LeetCode 204. Count Primes
- 【算法作业15】LeetCode 357. Count Numbers with Unique Digits
- 【算法作业11】LeetCode 70. Climbing Stairs
- 【算法作业2】LeetCode 492. Construct the Rectangle
- 算法作业_12(2017.4.5第七周)
- 【算法作业9】LeetCode 455. Assign Cookies
- 算法作业HW25:LeetCode 26. Remove Duplicates from Sorted Array
- Leetcode 算法题12