198.House Robber(动态规划入门)

problems:
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.

solutions：
1.递归求解; 会超时。因为重复的问题多次求解

class Solution {
public:
    int solve(int length,vector<int>& nums)
    {
        if(length < 0) return 0;
        return max(nums[length]+solve(length-2,nums),solve(length-1,nums));
    }
    int rob(vector<int>& nums) {
        return solve(nums.size()-1,nums);
    }
};

2.动态规划：将子问题的结果用数组保存。用空间换时间

可以通过上图看出，对于抢不抢第n-1家店，接下来抢的店只对第n-3家店有影响，两种决策过程中有大量重复计算的过程。

   class Solution {
    public:
        vector<int> tip;
        int solve(int length,vector<int>& nums)
        {
            if(length < 0) return 0;
            if(tip[length] >= 0) return tip[length];
            tip[length] = max(nums[length]+solve(length-2,nums),solve(length-1,nums));
            return tip[length];
        }
        int rob(vector<int>& nums) {
            int n = nums.size();
            for(int i=0;i<n;i++)
            {
                tip.push_back(-1);//数组存储子问题的结果
            }
            return solve(nums.size()-1,nums);
        }
    };