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. 思路：动态规划，这个和币值最大化问题一样的状态转移方程 F(n) = max(c + F(n - 2), F(n - 1)), n > 1
class Solution {public: int rob(vector<int>& nums) { int size = nums.size(); int *F = new int[size]; if(size == 0) return 0; else if(size == 1) return nums[0]; F[0] = nums[0], F[1] = max(nums[0], nums[1]); for(int i = 2; i < size; ++i){ F[i] = max(nums[i] + F[i - 2], F[i - 1]); } return F[size - 1]; }};新闻热点
疑难解答
