动态规划之打家劫舍

力扣打家劫舍问题系列 213题

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

    }


    int robRange(vector<int>& nums,int start, int end){
        int n = nums.size();
        //dp[i+1]      dp[i+2]
        int dp_i_1 = 0, dp_i_2 = 0;
        //记录dp[i]
        int dp_i = 0;
        for(int i = end;i >= start ;--i){
            dp_i = max(dp_i_1,nums[i] + dp_i_2);
            dp_i_2 = dp_i_1;
            dp_i_1 = dp_i;
        }
        return dp_i;
    }
};