[LeetCode从零单刷]House Robber

来源:互联网 时间:1970-01-01

题目:

 

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 andit 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 tonightwithout alerting the police.

解答:

不能够连续抢劫两家房屋。看到这种有限制地选择数组中的一部分,求和。很自然就想到动态规划。

等到当前房屋,分为两个状态:抢劫当前房屋 (selected)、不抢劫当前房屋 (unselected)。两种状态两种最优值。

selected: 上个房屋 unselected 最优值 + 当前房屋财产(财产必然为非负数)unselected: max(上个房屋 unselected 最优值,上个房屋 selected 最优值)(不抢劫当前房屋,无论上个房屋是否被抢劫都成立)

 

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

 

 



相关阅读:
Top