198. 打家劫舍

题目：

https://leetcode-cn.com/problems/house-robber/

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