leetcode-java-198. House Robber

思路：
考查动态规划，基本思路是当前节点处最大值curMax = Math.max(curMax, curPrePreMax + cur)

public class Solution {     public int rob(int[] nums) {         int curMax = 0,             curPrePreMax = 0;         for(int cur:nums) {             int temp = curMax;             curMax = Math.max(curMax,curPrePreMax + cur);             curPrePreMax = temp;         }         return curMax;     } }