LeetCode 198 robber house

题目要求:
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.

其中的大概的意思是说: 抢劫时不能是连续进行的,而且还要求最终的结果最大.

解题思路: 假若说使用暴力搜索的方法,题目是无法通过检查的.
转换使用DP的方式进行处理

首先创建一个数组dp,用于存储每一步的获得钱数.

dp[0] = nums[1];
dp[1] = Math.max(nums[0],nums[1]);

dp[i] = Math.max(num[i] + dp[i - 2], dp[i - 1]);
......`

public class solution {

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