HouseRobber

fishercoder1534 · fishercoder1534 · commit 0b5cf91ef19b · 2016-08-01T20:35:40.000-07:00
diff --git a/EASY/src/easy/HouseRobber.java b/EASY/src/easy/HouseRobber.java
@@ -0,0 +1,33 @@
+package easy;
+
+/**198. House Robber
+
+    Total Accepted: 82030
+    Total Submissions: 230179
+    Difficulty: Easy
+
+You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security system connected and it will automatically contact the police if two adjacent houses were broken into on the same night.
+
+Given a list of non-negative integers representing the amount of money of each house, determine the maximum amount of money you can rob tonight without alerting the police.
+
+Credits:
+Special thanks to @ifanchu for adding this problem and creating all test cases. Also thanks to @ts for adding additional test cases.*/
+public class HouseRobber {
+
+    //classical dp problem
+    public int rob(int[] nums) {
+        
+        if(nums == null || nums.length == 0) return 0;
+        if(nums.length == 1) return nums[0];
+        if(nums.length == 2) 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]);
+        for(int i = 2; i < nums.length; i++){
+            dp[i] = Math.max(dp[i-2] + nums[i], dp[i-1]);
+        }
+        return dp[nums.length-1];
+    
+    }
+
+}
