feat: house-robber solution

Author: sm9171

house-robber/sm9171.java

@@ -0,0 +1,14 @@
+class Solution {
+    public int rob(int[] nums) {
+        if (nums.length == 0) return 0;
+        if (nums.length == 1) return nums[0];
+
+        nums[1] = Math.max(nums[0], nums[1]);
+
+        for (int i = 2; i < nums.length; i++) {
+            nums[i] = Math.max(nums[i - 1], nums[i - 2] + nums[i]);
+        }
+
+        return nums[nums.length - 1];
+    }
+}