感觉跟原先网上看过来的代码有出入
public class Solution {
/**
* @param A: An array of non-negative integers
* @return: The maximum amount of money you can rob tonight
*/
public long houseRobber(int[] A) {
// write your code here
if(A.length==0){
return 0;
}
if(A.length==1){
return A[0];
}//数组要大于1
long DP_i_1 = A[0];
long DP_i_2 = A[1];
long DP_i_3=A[0]+A[2];
for(int i=3;i<A.length;i++){
long _final=Math.max(DP_i_2+A[i],DP_i_1+A[i]);
DP_i_1=DP_i_2;
DP_i_2=DP_i_3;
DP_i_3=_final;
}
return Math.max(DP_i_2,DP_i_3);
}
}