class Solution {
public int rob(int[] nums) {
if(nums.length==0){
return 0;
}
int[] dp = new int[nums.length+1];
//base
dp[0] = 0;
dp[1] = nums[0];
//状态转移
for(int i =2;i<nums.length+1;i++){
dp[i] = Math.max(dp[i-1],dp[i-2]+nums[i-1]);
}
return dp[nums.length];
}
}