题目:
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.
思路:
动态规划:rob(nums[1...n]) = 0 if n = 0
= nums[0] if n = 1
= max{rob[1...n-1],rob[1...n-2]+nums[n]} if n>= 2
代码 C++ :
class Solution { public: int rob(vector<int>& nums) { if (nums.size()==0) return 0; else if (nums.size() == 1) return nums[0]; int n1 = 0,n2 = nums[0]; for (int i = 1; i < nums.size(); i++) { int temp = n1; n1 = n2; n2 = max(temp + nums[i], n2); } return n2; } };
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步