LeetCode House Robber

最新推荐文章于 2024-09-02 07:40:27 发布

原创最新推荐文章于 2024-09-02 07:40:27 发布 · 858 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

LeetCode

LeetCode 算法实战

本文介绍LeetCode上的一道经典动态规划问题——打家劫舍（House Robber）。该问题要求从一系列房屋中挑选一些进行抢劫，但不能连续抢劫相邻的两座房屋。文章详细解释了如何通过动态规划算法找到最优解，并给出了一段C++代码实现。

LeetCode 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.

题目大意是给你一个保存正数的数组，要你根据要求计算最大和（要求：每次不能选择相邻的两个数）

解题思路：DP问题。对于某个元素nums[i]，是否并入和中主要有两点(sum1表示偶数下标的和，sum2表示奇数下标的和)：

i为偶数：sum1 = max(sum1 + nums[i], sum2)

i为奇数：sum2 = max(sum2 + nums[i], sum1)

class Solution {
    #define max(a,b) (a>b?a:b)
public:
    int rob(vector<int>& nums) {
        int sum1 = 0, sum2 = 0;
    	int count = nums.size();
    	if (0 == count)
    	{
    		return 0;
    	}
    	
    	for (int i = 0; i < count; i++)
    	{
    		if (i % 2 == 0)
    			sum1 = max(sum1 + nums[i], sum2);
    		else
    			sum2 = max(sum2 + nums[i], sum1);
    	}
    
    	return max(sum1, sum2);
        }
};

标签

#LeetCode House Robbe #House Robber