Update Solution2.java

Author: yanglbme

solution/0100-0199/0198.House Robber/Solution2.java

@@ -1,11 +1,11 @@
 class Solution {
     public int rob(int[] nums) {
-        int f = 0, g = 0;
-        for (int x : nums) {
-            int ff = Math.max(f, g);
-            g = f + x;
-            f = ff;
+        int n = nums.length;
+        int[] f = new int[n + 1];
+        f[1] = nums[0];
+        for (int i = 2; i <= n; ++i) {
+            f[i] = Math.max(f[i - 1], f[i - 2] + nums[i - 1]);
         }
-        return Math.max(f, g);
+        return f[n];
     }
-}
+}