house robber solution

- 1차원 배열로 다시 풀이

Author: hyer0705

house-robber/hyer0705.ts

@@ -1,3 +1,23 @@
+// 0ms
+function rob(nums: number[]): number {
+  const n = nums.length;
+
+  if (n === 1) return nums[0];
+  if (n === 2) return Math.max(nums[0], nums[1]);
+
+  const dp: number[] = Array(n).fill(0);
+  dp[0] = nums[0];
+  dp[1] = Math.max(nums[0], nums[1]);
+
+  for (let i = 2; i < n; i++) {
+    dp[i] = Math.max(dp[i - 2] + nums[i], dp[i - 1]);
+  }
+
+  return dp[n - 1];
+}
+
+// 1ms
+/*
 function rob(nums: number[]): number {
   const n = nums.length;
 
@@ -12,3 +32,4 @@ function rob(nums: number[]): number {
 
   return Math.max(...dp[n - 1]);
 }
+*/