update: 198

Author: hijiangtao

README.md

@@ -123,6 +123,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
 | 190 | [Reverse Bits](https://leetcode.com/problems/reverse-bits/)                                                                                     | [JavaScript](./src/reverse-bits/res.js)                                                                                 | Easy       |
 | 196 | [Delete Duplicate Emails](https://leetcode.com/problems/delete-duplicate-emails/)                                                               | [SQL](./src/delete-duplicate-emails/res.txt)                                                                            | Easy       |
 | 197 | [Rising Temperature](https://leetcode.com/problems/rising-temperature/)                                                                         | [SQL](./src/rising-temperature/res.txt)                                                                                 | Easy       |
+| 198 | [house-robber](https://leetcode.com/problems/house-robber/)                                                                                     | [TypeScript](./src/house-robber/res.ts)                                                                                 | Medium     |
 | 203 | [remove-linked-list-elements](https://leetcode.com/problems/remove-linked-list-elements/)                                                       | [TypeScript](./src/remove-linked-list-elements/res.ts)                                                                  | Easy       |
 | 206 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)                                                                       | [JavaScript](./src/reverse-linked-list/res.js)                                                                          | Easy       |
 | 207 | [Course Schedule](https://leetcode.com/problems/course-schedule/)                                                                               | [JavaScript](./src/course-schedule/res.js)                                                                              | Medium     |

src/house-robber/res.ts

@@ -0,0 +1,19 @@
+function rob(nums: number[]): number {
+    if (!nums.length) {
+        return 0;
+    }
+
+    const dp: number[] = new Array(nums.length).fill(0);
+
+    for (let i = 0; i < nums.length; i++) {
+        if (i === 0) {
+            dp[i] = nums[i];
+        } else if (i === 1) {
+            dp[i] = Math.max(nums[i], dp[i-1]);
+        } else {
+            dp[i] = Math.max(nums[i] + dp[i-2], dp[i-1]);
+        }
+    }
+
+    return dp[nums.length-1];
+};