LeetCode House Robber

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]);
	}
}


阅读更多
文章标签: java leetcode DP
个人分类: 算法/oj
上一篇LeetCode Number of 1 Bits
下一篇LeetCode Binary Tree Right Side View
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭