算法分析与设计——LeetCode: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.

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) {
    }
};

思路

这道题的意思是在一个数组nums中，对于每个i，nums[i]和nums[i+1]最多只能选择一个，求能选出的最大和。这就涉及到了动态规划。如下代码，a[i]代表当前数nums[i]没有选中时前i+1个数的最大和，b[i]代表当前数nums[i]选中时前i+1个数的最大和。

对于每个i>0，均有：

    a[i]：当前数没有选中，则前一个数nums[i-1]可选可不选，a[i] = max(a[i-1], b[i-1])

    b[i]：当前数选中，则前一个数nums[i-1]不可选，b[i] = a[i-1]+nums[i]

最后再比较当a[n-1]，b[n-1]的大小，取最大值，即含有n个数的数组的前n个数的最大和。

上面描述的是下面我注释掉的代码，新增加的代码是在注释的代码基础上进行的小修改，可以少用两个数组，节省空间。

时间复杂度为O(n)。

代码

class Solution {
public:
    int rob(vector<int>& nums) {
        int size = nums.size();
        if (size == 0) {
            return 0;
        }
        /*int* a = new int[size];
        int* b = new int[size];
        a[0] = 0;
        b[0] = nums[0];
        for (int i = 1; i < size; i++) {
            b[i] = a[i-1]+nums[i];
            a[i] = max(a[i-1], b[i-1]);
        }
        return max(a[size-1], b[size-1]);*/
        int a = 0, b = nums[0];
        for (int i = 1; i < size; i++) {
            int tb = b, ta = a;
            b = ta+nums[i];
            a = max(ta, tb);
        }
        return max(a, b);
    }
};