三刷198

Author: diguage

docs/0198-house-robber.adoc

@@ -1,34 +1,35 @@
 [#0198-house-robber]
-= 198. House Robber
+= 198. 打家劫舍
 
-:stem: latexmath
+https://leetcode.cn/problems/house-robber/[LeetCode - 198. 打家劫舍 ^]
 
-{leetcode}/problems/house-robber/[LeetCode - 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*.
+*示例 1：*
 
-*Example 1:*
+....
+输入：[1,2,3,1]
+输出：4
+解释：偷窃 1 号房屋 (金额 = 1) ，然后偷窃 3 号房屋 (金额 = 3)。
+     偷窃到的最高金额 = 1 + 3 = 4 。
+....
 
-[subs="verbatim,quotes,macros"]
-----
-*Input:* [1,2,3,1]
-*Output:* 4
-*Explanation:* Rob house 1 (money = 1) and then rob house 3 (money = 3).
-             Total amount you can rob = 1 + 3 = 4.
-----
+*示例 2：*
 
-*Example 2:*
+....
+输入：[2,7,9,3,1]
+输出：12
+解释：偷窃 1 号房屋 (金额 = 2), 偷窃 3 号房屋 (金额 = 9)，接着偷窃 5 号房屋 (金额 = 1)。
+     偷窃到的最高金额 = 2 + 9 + 1 = 12 。
+....
 
-[subs="verbatim,quotes,macros"]
-----
-*Input:* [2,7,9,3,1]
-*Output:* 12
-*Explanation:* Rob house 1 (money = 2), rob house 3 (money = 9) and rob house 5 (money = 1).
-             Total amount you can rob = 2 + 9 + 1 = 12.
+*提示：*
+
+* `+1 <= nums.length <= 100+`
+* `+0 <= nums[i] <= 400+`
 
-----
 
 == 思路分析
 
@@ -77,6 +78,15 @@ include::{sourcedir}/_0198_HouseRobber.java[tag=answer]
 include::{sourcedir}/_0198_HouseRobber_2.java[tag=answer]
 ----
 --
+
+三刷::
++
+--
+[{java_src_attr}]
+----
+include::{sourcedir}/_0198_HouseRobber_3.java[tag=answer]
+----
+--
 ====
 
 == 参考资料

logbook/202503.adoc

@@ -275,6 +275,11 @@ endif::[]
 |{doc_base_url}/0746-min-cost-climbing-stairs.adoc[题解]
 |✅ 动态规划
 
+|{counter:codes2503}
+|{leetcode_base_url}/house-robber/[198. 打家劫舍^]
+|{doc_base_url}/0198-house-robber.adoc[题解]
+|✅ 动态规划
+
 
 |===
 ˚

src/main/java/com/diguage/algo/leetcode/_0198_HouseRobber_3.java

@@ -0,0 +1,25 @@
+package com.diguage.algo.leetcode;
+
+public class _0198_HouseRobber_3 {
+  // tag::answer[]
+
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2025-04-16 20:19:02
+   */
+  public int rob(int[] nums) {
+    if (nums.length == 1) {
+      return nums[0];
+    }
+    if (nums.length == 2) {
+      return Math.max(nums[0], nums[1]);
+    }
+    nums[1] = Math.max(nums[0], nums[1]);
+    for (int i = 2; i < nums.length; i++) {
+      // dp[i] = max(nums[i] + dp[i-2], dp[i-1])
+      nums[i] = Math.max(nums[i - 1], nums[i] + nums[i - 2]);
+    }
+    return nums[nums.length - 1];
+  }
+  // end::answer[]
+}