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 tonight without alerting the police.
Credits:
Special thanks to @ifanchu for adding this problem and creating all test cases. Also thanks to @ts for
adding additional test cases.
题目的意思是:从数组中任选N个数相加,要求取得的和最大。前提是,随意两个数不能相邻。
记S[I]表示前i个元素所可以取得的最大和,则S[I+1]=max(S[i],S[i-1]+num[i+1]),
则代码例如以下:
public class Solution { public int rob(int[] num) { if(num.length==0) return 0; int[] s=new int[num.length]; s[0]=num[0]; for(int i=1;i<num.length;i++){ if(i>1){ s[i]=Math.max(s[i-1],s[i-2]+num[i]); }else{ s[i]=Math.max(s[i-1],num[i]); } } return s[num.length-1]; } }
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步