Leetcode——198. House Robber

Description

https://leetcode.com/problems/house-robber/?tab=Description
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.

Solution

My answer is easier to understand, d[i] means the most value that can be robbed before the ith store. For each store, we have two choice: rob or not rob:
(1)if robbing, d[i] = d[i-2] + nums[i], for stores robbed cannot be connected.
(2)if not robbing, d[i] = d[i-1];

The idea is a bit like 0/1 knapsack

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

};