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

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.

思路：

从第一间屋开始，小偷有两个选择，一是偷这间屋，则不能偷第二间，下一次偷只能从第三间屋开始。 

如果不偷第一间屋的话，可以从第二间屋开始偷。对于当前的每一间屋都是这样，所以从这间屋开始可以偷的最大钱应该是

int rob_ =  nums[index] + canRob(nums, index + 2);
 int notrob = canRob(nums, index + 1);
max(rob_, notrob)这是能偷的最多的钱。

代码：（超时了）

#include<limits.h>
class Solution {
public:
    int rob(vector<int>& nums) {
        return canRob(nums, 0);
    }
    int canRob(vector<int>& nums, int index){
        if(index >= nums.size()) return 0;
        else if(index == nums.size() - 1) return nums[nums.size() - 1];
        else{
            int rob_ =  nums[index] + canRob(nums, index + 2);
            int notrob = canRob(nums, index + 1);
            return max(rob_, notrob);
        }
    }
};

改进：(用到动态规划，因为上面递归过程实际上有一部分是被重复计算了)

class Solution:
    def rob(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if len(nums) == 1:
            return nums[0]
        if len(nums) == 0:
            return 0
        i = 2
        length = len(nums)
        nums[1] = nums[0] if nums[0] > nums[1] else nums[1]
        while i < length:
            nums[i] = max(nums[i]+nums[i-2], nums[i-1])
            i += 1
        return max(nums[i-2], nums[i-1])