LeetCode-House Robber-解题报告

原题链接https://leetcode.com/problems/house-robber/

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

简单dp

转移方程 dp[i] = max(dp[i - 2] + nums[i], dp[i - 1]);

dp[i]表示 走到第i房子所取得的最大值。

class Solution {public:    int rob(vector<int>& nums) {if (nums.empty())return 0;if (nums.size() == 1)return nums[0];vector<int>dp(nums.size(), 0);dp[0] = nums[0];dp[1] = nums[1];dp[1] = max(dp[0], dp[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];}};