feat: add House Robber

Author: dukeluo

README.md

@@ -81,6 +81,7 @@ Roadmap: https://neetcode.io/roadmap
 | 17   | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/description/)                                         | Medium     | [ts](./TypeScript/17.letter-combinations-of-a-phone-number.ts)                                | Backtracking     |
 | 70   | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/description/)                                                                                     | Easy       | [ts](./TypeScript/70.climbing-stairs.ts)                                                      | 1-D DP           |
 | 746  | [Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/description/)                                                                   | Easy       | [ts](./TypeScript/70.climbing-stairs.ts)                                                      | 1-D DP           |
+| 198  | [House Robber](https://leetcode.com/problems/house-robber/description/)                                                                                           | Medium     | [ts](./TypeScript/70.climbing-stairs.ts)                                                      | 1-D DP           |
 
 ### Others
 

TypeScript/198.house-robber.ts

@@ -0,0 +1,13 @@
+function rob(nums: number[]): number {
+  for (let i = 1; i < nums.length; i++) {
+    nums[i] =
+      i === 1
+        ? Math.max(nums[1], nums[0])
+        : Math.max(nums[i - 2] + nums[i], nums[i - 1]);
+  }
+
+  return nums[nums.length - 1];
+}
+
+console.log(rob([2, 7, 9, 3, 1]));
+console.log(rob([2, 1, 1, 2]));