LeetCode -- 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.

Analysis: Dynamic Programming

 

Answer:

复制代码
public class Solution {
    public int rob(int[] nums) {
        if(nums == null || nums.length==0)
           return 0;
       int n = nums.length;
       int[] dp = new int[n+1];
       dp[0] = 0;
       dp[1] = nums[0];
       for(int i=2; i<n+1; i++){
           dp[i] = Math.max(dp[i-1], dp[i-2]+nums[i-1]);
       }
       return dp[n];
    }
}
复制代码

 

posted @   江湖小妞  阅读(190)  评论(0编辑  收藏  举报
努力加载评论中...
点击右上角即可分享
微信分享提示