解法: dp 问题
public int rob(int[] nums) {
int[] dp = new int[nums.length + 2];
for (int i = 0; i < nums.length; i++) {
dp[i + 2] = Math.max(dp[i] + nums[i], dp[i + 1]);
}
return dp[nums.length + 1];
}原文：https://www.cnblogs.com/lasclocker/p/11470442.html