关闭

House Robber

标签: Javaleetcode
118人阅读 评论(0) 收藏 举报
分类:

1 题目描述

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.

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


2 解题思路

本题属于动态规划的题,主要是找到动态规划的方程。方法可以参考http://www.cnblogs.com/ganganloveu/p/4417485.html


3 源代码

package com.larry.easy;

public class HouseRobber {
	public int rob(int[] nums) {
		//max表示第i个房的最大收益
		int len = nums.length;
		int max[] = new int[len];
		
		if(len == 0) return 0;
		else if(len == 1) return nums[0];
		else{
			max[0] = nums[0];
			if(nums[0] >= nums[1]) max[1] = nums[0];
			else max[1] = nums[1];
			for(int i = 2; i < len; i++)
				max[i] = Math.max(max[i-2] + nums[i], max[i-1]);
		}
        return max[len-1];
    }
}


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:24385次
    • 积分:672
    • 等级:
    • 排名:千里之外
    • 原创:108篇
    • 转载:5篇
    • 译文:0篇
    • 评论:0条
    文章分类