【算法】【c++】打家劫舍问题

dp问题

213. House Robber II
     You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, 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.

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/house-robber-ii
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

class Solution {
public:
    int robBetween(vector<int>& nums, int l, int r) {
        int money2 = 0, money1 = 0;
        int money = 0;
        for(int i = r; i >= l; --i) {
            money = max(money2 + nums[i], money1);
            money2 = money1;
            money1 = money;
        }
        return money;
    }

    int rob(vector<int>& nums) {
        //可以转化为计算两个区间结果的最大值
        int n = nums.size();
        if(1 == n)
            return nums[0];
        return max(robBetween(nums, 0, n - 2),
            robBetween(nums, 1, n - 1));
    }
};

337. House Robber III
     The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the “root.” Besides the root, each house has one and only one parent house. After a tour, the smart thief realized that “all houses in this place forms a binary tree”. It will automatically contact the police if two directly-linked houses were broken into on the same night.

Determine the maximum amount of money the thief can rob tonight without alerting the police.

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<int> dp(TreeNode* root) {
        if(!root)
            return {0, 0}; 
        //0 表示不抢 1表示抢
        auto l = dp(root->left);
        auto r = dp(root->right);
        int robbed = root->val + l[0] + r[0];
        int notRob = max(l[0], l[1]) + max(r[0], r[1]);
        return {notRob, robbed};
    }

    int rob(TreeNode* root) {
        auto res = dp(root);
        return max(res[0], res[1]);
    }
};