【Leetcode】House Robber #198

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.

url:https://leetcode.com/problems/house-robber/

解题思路：动态规划

    int rob(vector<int>& nums) {
        int size = nums.size();
        if(size == 0) return 0;
        if(size == 1) return nums.back();
        if(size == 2) return max(nums[size - 1], nums[size - 2]);
        int* max_amount = new int[nums.size()];
        max_amount[size - 1] = nums.back();
        max_amount[size - 2] = max(max_amount[size - 1], nums[size - 2]);
        for (int i = size - 3; i >= 0; --i)
        {
            max_amount[i] = max(max_amount[i+1], max_amount[i+2]+nums[i]);
        }
        int ans = max_amount[0];
        delete max_amount;
        return ans;
    }

可以取消数组，节省空间

    int rob(vector<int>& nums) {
        int size = nums.size();
        if(size == 0) return 0;
        if(size == 1) return nums.back();
        if(size == 2) return max(nums[size - 1], nums[size - 2]);
        int max_amount_1 = nums.back();
        int max_amount_2 = max(max_amount_1, nums[size - 2]);
        for (int i = size - 3; i >= 0; --i)
        {
            int temp = max_amount_2;
            max_amount_2 = max(max_amount_2, max_amount_1+nums[i]);
            max_amount_1 = temp;
        }
        return max_amount_2;
    }