Merge branch '95-daily-29일차'

Author: jihostudy

Jiho/Day29/Leetcode_198. House Robber.js

@@ -0,0 +1,17 @@
+var rob = function (nums) {
+  const len = nums.length;
+
+  let arr = new Array(len);
+  arr[0] = nums[0];
+  arr[1] = Math.max(nums[0], nums[1]);
+  let i;
+  for (i = 2; i < len; i++) {
+    arr[i] = Math.max(arr[i - 1], arr[i - 2] + nums[i]);
+  }
+
+  return arr[len - 1];
+};
+
+console.log(rob([2, 1]));
+
+// DP

Jiho/Day29/Leetcode_213. House Robber II.js

@@ -0,0 +1,19 @@
+var rob2 = function (nums) {
+  const getMax = (nums) => {
+    let prevRob = 0,
+      maxRob = 0;
+
+    for (let num of nums) {
+      let temp = Math.max(maxRob, prevRob + num);
+      prevRob = maxRob;
+      maxRob = temp;
+    }
+
+    return maxRob;
+  };
+
+  if (nums.length === 1) return nums[0];
+  return Math.max(getMax(nums.slice(0, -1)), getMax(nums.slice(1)), nums[0]);
+};
+
+console.log(rob2([1, 2, 3, 1]));