Leetcode-198- house raiding

subject

Ideas

1. It feels like dynamic planning , Or from 0 Start grabbing Or from 1 Start grabbing
2. dp[i] The representative must rob the i The maximum amount of account , But it may rob i-2 Hu Hejie i-3 Household , Because it's impossible to rob i-1 Household , And if robbery i-4 Households can also rob i-2 Household , So we only need to consider robbing i-2 and i-3j that will do

Code

    public int rob(int[] nums) {
    
        if(nums.length<2) return nums[0];
        // It feels like dynamic planning 
        int[] dp = new int[nums.length];
        int ans = Integer.MIN_VALUE;
        // Or from 0 Start grabbing   Or from 1 Start grabbing 
        dp[0]=nums[0];
        dp[1]=nums[1];
        ans = Math.max(dp[0],dp[1]);
        //dp[i] The representative must rob the i The maximum amount of account 
        // But it may not rob i-2 Household robbery i-3 Household 
        for(int i=2;i<nums.length;i++){
    
                if(i-3>=0) dp[i]=Math.max(nums[i]+dp[i-2],nums[i]+dp[i-3]);
                else dp[i]=nums[i]+dp[i-2];
                ans = Math.max(ans,dp[i]);
        }
        return ans;
    }