开始刷leetcode day3： house robber

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security system connected and it will automatically contact the police if two adjacent houses were broken into on the same night.

Given a list of non-negative integers representing the amount of money of each house, determine the maximum amount of money you can rob tonight without alerting the police.

Java：

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

这道题需要用dp的思想来解，一开始想不通，还是先看了下别人的思路。。。。此代码仅供参考