class Solution {
public int rob(int[] nums) {
int len = nums.length;
int[] f = new int[len+1];
f[0]=0;
f[1]=nums[0];
for(int i=2; i<=len; i++){
f[i] = Math.max(f[i-2]+nums[i-1],f[i-1]);
}
return f[len];
}
}