探讨一盗贼计划抢劫沿街房屋的问题，每栋房屋内藏有一定数额的钱财，但相邻房屋设有联动报警系统，若同一晚两栋相邻房屋遭窃则会自动报警。面对非负整数列表，代表各房屋钱款数额，如何在不惊动警方前提下，制定最佳抢劫方案以获取最大金额。
题目：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.
这是一道动态规划题
扫一扫
8万+
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
