LeetCode-198. House Robber

LeetCode-198. House Robber

​​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.

Example 1:

Input: [1,2,3,1]Output: 4Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3). Total amount you can rob = 1 + 3 = 4.

Example 2:

Input: [2,7,9,3,1]Output: 12Explanation: Rob house 1 (money = 2), rob house 3 (money = 9) and rob house 5 (money = 1). Total amount you can rob = 2 + 9 + 1 = 12.

题解：dp问题，每个dp[i]保存前0-i个的最大值。

class Solution {public: int rob(vector& nums) { if (nums.size() == 0){ return 0; } if (nums.size() == 2){ return max(nums[0], nums[1]); } if (nums.size() == 1){ return nums[0]; } vector dp(nums.size(), 0); dp[0] = nums[0]; dp[1] = max(dp[0], nums[1]); for (int i = 2; i < nums.size(); i++){ dp[i] = max(dp[i - 2] + nums[i], dp[i - 1]); } return dp[nums.size() - 1]; }};

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。