Update 198_House_Robber.java

Author: Sean Prashad

Dynamic Programming/198_House_Robber.java

@@ -10,14 +10,14 @@ public int rob(int[] nums) {
             return Math.max(nums[0], nums[1]);
         }
 
-        int[] dp = new int[nums.length];
-        dp[0] = nums[0];
-        dp[1] = Math.max(nums[0], nums[1]);
+        int prevHouse = 0, prevTwoHouses = 0, currHouse = 0;
 
-        for (int i = 2; i < nums.length; i++) {
-            dp[i] = Math.max(dp[i - 1], dp[i - 2] + nums[i]);
+        for (int i = 0; i < nums.length; i++) {
+            currHouse = Math.max(prevHouse, prevTwoHouses + nums[i]);
+            prevTwoHouses = prevHouse;
+            prevHouse = currHouse;
         }
 
-        return dp[nums.length - 1];
+        return currHouse;
     }
 }