打家劫舍Ⅰ&Ⅱ

打家劫舍Ⅰ

题目

代码

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

打家劫舍Ⅱ

题目

代码

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

    int robrange(vector<int>& nums, int start, int end)
    {
        if(end == start) return nums[start];

        vector<int> dp(nums.size()+1);
        dp[start] = nums[start];
        dp[start + 1] = max(nums[start], nums[start + 1]);
        for(int i = start + 2; i <= end; i++)
        {
            dp[i] = max(dp[i - 2] + nums[i], dp[i - 1]);
        } 
        return dp[end];
    }
};