LeetCode:House Robber

标签：leetcode

题目描述：

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.

思路分析：动态规划。result[i] = max(nums[i]+result[i-2],result[i-1]),result[length-1] = nums[length-1],result[length-2] = max(nums[length-2],nums[length-1])，由此推出result[0]，即得结果。

代码：

class Solution
{
	public:
		int rob(vector<int> & nums)
		{
			int length = nums.size();
			if(length == 0)
				return 0;
			int result[length];
			if(length < 2)
				return nums[0];
			result[length-1] = nums[length-1];
			result[length-2] = nums[length-1] > nums[length-2] ? nums[length-1] : nums[length-2];
			for(int i = length - 3;i >= 0;i--)
				result[i] = nums[i] + result[i+2] > result[i+1] ? nums[i] + result[i+2] : result[i+1];
			return result[0];
		}
};

LeetCode:House Robber

标签：leetcode

原文地址：http://blog.csdn.net/yao_wust/article/details/45721591