198. House Robber

题目：https://leetcode.com/problems/house-robber/

代码:

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