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.


动态规划,列出公式实现即可

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


已标记关键词 清除标记
相关推荐
©️2020 CSDN 皮肤主题: 大白 设计师:CSDN官方博客 返回首页