update: 213

Author: hijiangtao

README.md

@@ -129,6 +129,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
 | 207 | [Course Schedule](https://leetcode.com/problems/course-schedule/)                                                                               | [JavaScript](./src/course-schedule/res.js)                                                                              | Medium     |
 | 209 | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/)                                                           | [JavaScript](./src/minimum-size-subarray-sum/res.js)                                                                    | Medium     |
 | 210 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/)                                                                         | [JavaScript](./src/course-schedule-ii/res.js)                                                                           | Medium     |
+| 213 | [house-robber-ii](https://leetcode.com/problems/house-robber-ii/)                                                                               | [TypeScript](./src/house-robber-ii/res.ts)                                                                              | Medium     |
 | 215 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/)                                               | [JavaScript](./src/kth-largest-element-in-an-array/res.js)                                                              | Medium     |
 | 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)                                                                         | [JavaScript](./src/contains-duplicate/res.js)                                                                           | Easy       |
 | 219 | [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/)                                                                   | [JavaScript](./src/contains-duplicate-ii/res.js)                                                                        | Easy       |

src/house-robber-ii/res.ts

@@ -0,0 +1,27 @@
+function internalRob(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];
+};
+
+function rob(nums: number[]): number {
+    if (!nums.length) {
+        return 0;
+    }
+
+    return Math.max(internalRob(nums.slice(1)), internalRob(nums.slice(2, nums.length-1)) + nums[0]);
+};