Update Solution.rs

Author: yanglbme

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

@@ -1,9 +1,17 @@
 impl Solution {
     pub fn rob(nums: Vec<i32>) -> i32 {
-        let mut f = [0, 0];
-        for x in nums {
-            f = [f[0].max(f[1]), f[0] + x];
+        fn dfs(i: usize, nums: &Vec<i32>, f: &mut Vec<i32>) -> i32 {
+            if i >= nums.len() {
+                return 0;
+            }
+            if f[i] < 0 {
+                f[i] = (nums[i] + dfs(i + 2, nums, f)).max(dfs(i + 1, nums, f));
+            }
+            f[i]
         }
-        f[0].max(f[1])
+
+        let n = nums.len();
+        let mut f = vec![-1; n];
+        dfs(0, &nums, &mut f)
     }
 }