LeetCode 198. House Robber 题解

198. House Robber

 

Question Editorial Solution

  My Submissions

• Total Accepted: 98866
• Total Submissions: 269326
• Difficulty: Easy
• Contributors: Admin

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.

解题思路：

本题即为一个简单的动态规划问题。设置一个递归辅助函数help。n为一共有多少户人家。n为0则结果为0。n为1的时候即返回nums[0]。n>1时，调用

help(nums,n-1); 若n=2，即返回nums[0]和nums[1]中较大的那个。n>2时，返回

max(tmp[n]+help(tmp,n-2),help(tmp,n-1));

同时注意保存中间计算结果，提高效率。

代码展示：

class Solution {
public:
    vector<int> res;
    int help(vector<int>  tmp, int n)
    {
        if(res[n]!=-1) return res[n];
        if(n==0)
        {
            res[0]=tmp[0];
            return tmp[0];
        }
        if(n==1) 
        {   res[1]=max(tmp[1],tmp[0]);
            return res[1];
        }
        else
        {
            res[n]=max(tmp[n]+help(tmp,n-2),help(tmp,n-1));
            return res[n];
        }
    }
    int rob(vector<int>& nums) {
        
        int n=nums.size();
        if(!n) return 0;
        if(n==1) return nums[0];
        //vector<vector<int> > tmp;
        //vector<int> save;
        for(int i=0;i<n;i++)
        {
            //save.push_back(nums[i]);
            //tmp.push_back(save);
            res.push_back(-1);
        }
        return help(nums,n-1);
    }
};