House Robber

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.

Example 1:

Input: [1,2,3,1]
Output: 4
Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3).
             Total amount you can rob = 1 + 3 = 4.

 

Example 2:

Input: [2,7,9,3,1]
Output: 12
Explanation: Rob house 1 (money = 2), rob house 3 (money = 9) and rob house 5 (money = 1).
             Total amount you can rob = 2 + 9 + 1 = 12.

 

很明显的动态规划题目。其实就是
f(0)=0   //注意数组从0开始索引,然后我们的标记数组的索引i代表输入数组有几个数
f(1)=a[0]  //此时有一个数
f(2)=max(a(0),a(1))  //此时两个数
...
f(n)= { 如果a[n]选中的话,则为a[n]+max(f(n-2),f(n-3)};  如果a[n] 不选的话,则为f(n-1)}
因此f(n)就是比较a[n]有无选中两种情况。
用for循环迭代产生即可。

class Solution {
public:
	int rob(vector<int>& nums) {


		int numSize = nums.size();
		if (numSize == 0)
			return 0;
		if (numSize == 1)
			return nums[0];
		if (numSize == 2)
			return max(nums[0], nums[1]);
		vector<int>maxf(numSize + 1);
		maxf[0] = 0;
		maxf[1] = nums[0];
		maxf[2] = max(nums[1],nums[0]);

		for (int i = 3; i<=numSize; i++)
		{
			maxf[i] = max(maxf[i - 1], nums[i-1] + max(maxf[i - 2], maxf[i - 3]));

		}
		return maxf[numSize];
	}
};
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值