Update Solution.js

Author: yanglbme

solution/0100-0199/0198.House Robber/Solution.js

@@ -1,9 +1,14 @@
 function rob(nums) {
     const n = nums.length;
-    const f = Array(n + 1).fill(0);
-    f[1] = nums[0];
-    for (let i = 2; i <= n; ++i) {
-        f[i] = Math.max(f[i - 1], f[i - 2] + nums[i - 1]);
-    }
-    return f[n];
+    const f = Array(n).fill(-1);
+    const dfs = i => {
+        if (i >= n) {
+            return 0;
+        }
+        if (f[i] < 0) {
+            f[i] = Math.max(nums[i] + dfs(i + 2), dfs(i + 1));
+        }
+        return f[i];
+    };
+    return dfs(0);
 }