leetcode（力扣）198. 打家劫舍||213. 打家劫舍 II||337. 打家劫舍 III

198. 打家劫舍

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(),0);
        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];

    }
};

213. 打家劫舍 II

class Solution {
private:
       int robRange(vector<int>& nums,int start,int end){
           if(start==end) return nums[start];
           vector<int> dp(nums.size(),0);
           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];
       }
public:
    int rob(vector<int>& nums) {
        if(nums.size()==0) return 0;
        if(nums.size()==1) return nums[0];

        int rang1=robRange(nums,0,nums.size()-2);
        int rang2=robRange(nums,1,nums.size()-1);

        return max(rang1,rang2);

    }
};

337. 打家劫舍 III

class Solution {
private:
       vector<int> robTree(TreeNode* root){
           if(root==nullptr) return vector<int>{0,0};
     
           vector<int> left=robTree(root->left);
           vector<int> right=robTree(root->right);


           //0不偷
           int val1=max(left[0],left[1])+max(right[0],right[1]);
           //1偷
           int val2=root->val+left[0]+right[0];

           return {val1,val2};

       }
public:
    int rob(TreeNode* root) {
        vector<int> result;

        result=robTree( root);

        return max(result[0],result[1]);

    }
};