Update Solution.cpp

Author: yanglbme

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

@@ -2,12 +2,17 @@ class Solution {
 public:
     int rob(vector<int>& nums) {
         int n = nums.size();
-        int f[n + 1];
-        memset(f, 0, sizeof(f));
-        f[1] = nums[0];
-        for (int i = 2; i <= n; ++i) {
-            f[i] = max(f[i - 1], f[i - 2] + nums[i - 1]);
-        }
-        return f[n];
+        int f[n];
+        memset(f, -1, sizeof(f));
+        auto dfs = [&](auto&& dfs, int i) -> int {
+            if (i >= n) {
+                return 0;
+            }
+            if (f[i] < 0) {
+                f[i] = max(nums[i] + dfs(dfs, i + 2), dfs(dfs, i + 1));
+            }
+            return f[i];
+        };
+        return dfs(dfs, 0);
     }
-};
+};