From 296485551542d296e27486e985406d7944f3aa9a Mon Sep 17 00:00:00 2001
From: Steve2020 <841532108@qq.com>
Date: Wed, 11 May 2022 18:35:43 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=EF=BC=880213.=E6=89=93?=
 =?UTF-8?q?=E5=AE=B6=E5=8A=AB=E8=88=8DII.md=EF=BC=89=EF=BC=9A=E5=A2=9E?=
 =?UTF-8?q?=E5=8A=A0typescript=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0213.打家劫舍II.md | 23 +++++++++++++++++++++++
 1 file changed, 23 insertions(+)

diff --git a/problems/0213.打家劫舍II.md b/problems/0213.打家劫舍II.md
index 8e569e46..9e698d01 100644
--- a/problems/0213.打家劫舍II.md
+++ b/problems/0213.打家劫舍II.md
@@ -165,7 +165,30 @@ const robRange = (nums, start, end) => {
   return dp[end]
 }
 ```
+TypeScript：
+
+```typescript
+function rob(nums: number[]): number {
+    const length: number = nums.length;
+    if (length === 0) return 0;
+    if (length === 1) return nums[0];
+    return Math.max(robRange(nums, 0, length - 2),
+        robRange(nums, 1, length - 1));
+};
+function robRange(nums: number[], start: number, end: number): number {
+    if (start === end) return nums[start];
+    const dp: number[] = [];
+    dp[start] = nums[start];
+    dp[start + 1] = Math.max(nums[start], nums[start + 1]);
+    for (let i = start + 2; i <= end; i++) {
+        dp[i] = Math.max(dp[i - 1], dp[i - 2] + nums[i]);
+    }
+    return dp[end];
+}
+```
+
 Go：
+
 ```go
 // 打家劫舍Ⅱ 动态规划
 // 时间复杂度O(n) 空间复杂度O(n)