关闭

LeetCode House Robber

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

Description:

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.

Solution:

dp[i][0]表示第i个房子没有偷的最大值,dp[i][1]表示第i个房子偷了的最大值。

dp[i][0] = max( dp[i-1][0], dp[i-1][1] )

dp[i][1] = dp[i-1][0] + nums[i]

import java.util.*;

public class Solution {
	public int rob(int[] nums) {
		int n = nums.length;
		if (n == 0)
			return 0;
		int dp[][] = new int[n][2];
		dp[0][0] = 0;
		dp[0][1] = nums[0];

		for (int i = 1; i < n; i++) {
			dp[i][0] = Math.max(dp[i - 1][0], dp[i - 1][1]);
			dp[i][1] = dp[i - 1][0] + nums[i];
		}

		return Math.max(dp[n - 1][0], dp[n - 1][1]);
	}
}


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:67253次
    • 积分:3299
    • 等级:
    • 排名:第10607名
    • 原创:288篇
    • 转载:0篇
    • 译文:0篇
    • 评论:4条
    最新评论