mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 19:18:14 +08:00
36 lines
1.5 KiB
HTML
36 lines
1.5 KiB
HTML
|
<p>一个专业的小偷，计划偷窃沿街的房屋。每间房内都藏有一定的现金，影响小偷偷窃的唯一制约因素就是相邻的房屋装有相互连通的防盗系统，<strong>如果两间相邻的房屋在同一晚上被小偷闯入，系统会自动报警</strong>。</p>
|
|||
|
|
|
|||
|
|
<p>给定一个代表每个房屋存放金额的非负整数数组 <code>nums</code> ，请计算<strong> 不触动警报装置的情况下 </strong>，一夜之内能够偷窃到的最高金额。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>nums =<strong> </strong>[1,2,3,1]
|
|||
|
|
<strong>输出：</strong>4
|
|||
|
|
<strong>解释：</strong>偷窃 1 号房屋 (金额 = 1) ，然后偷窃 3 号房屋 (金额 = 3)。
|
|||
|
|
偷窃到的最高金额 = 1 + 3 = 4 。</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>nums =<strong> </strong>[2,7,9,3,1]
|
|||
|
|
<strong>输出：</strong>12
|
|||
|
|
<strong>解释：</strong>偷窃 1 号房屋 (金额 = 2), 偷窃 3 号房屋 (金额 = 9)，接着偷窃 5 号房屋 (金额 = 1)。
|
|||
|
|
偷窃到的最高金额 = 2 + 9 + 1 = 12 。
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>1 <= nums.length <= 100</code></li>
|
|||
|
|
<li><code>0 <= nums[i] <= 400</code></li>
|
|||
|
|
</ul>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><meta charset="UTF-8" />注意：本题与主站 198 题相同： <a href="https://leetcode-cn.com/problems/house-robber/">https://leetcode-cn.com/problems/house-robber/</a></p>
|