From e2b92184a88e4d5287e982cd97d4a425cf88acbc Mon Sep 17 00:00:00 2001
From: kankan-web <2728360489@qq.com>
Date: Sun, 7 Apr 2024 21:25:29 +0800
Subject: [PATCH] =?UTF-8?q?Update=200770.=E7=88=AC=E6=A5=BC=E6=A2=AF?=
 =?UTF-8?q?=E5=AE=8C=E5=85=A8=E8=83=8C=E5=8C=85=E7=89=88?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0070.爬楼梯完全背包版本.md | 27 ++++++++++++++++++--
 1 file changed, 25 insertions(+), 2 deletions(-)

diff --git a/problems/0070.爬楼梯完全背包版本.md b/problems/0070.爬楼梯完全背包版本.md
index 622b1117..fd5c24fb 100644
--- a/problems/0070.爬楼梯完全背包版本.md
+++ b/problems/0070.爬楼梯完全背包版本.md
@@ -211,10 +211,33 @@ func main() {
 ```
 
 ### JavaScript:
-
+```javaScript
+var climbStairs = function (n) {
+  let dp = new Array(n + 1).fill(0);
+  dp[0] = 1;
+  // 排列题，注意循环顺序，背包在外物品在内
+   for (let j = 1; j <= n; j++) {//遍历背包
+    for (let i = 1; i <= 2; i++) {//遍历物品
+     if (j - i >= 0) dp[j] = dp[j] + dp[j - i];
+    }
+  }
+  return dp[n];
+}
+```
 
 ### TypeScript：
-
+```typescript
+var climbStairs = function (n: number): number {
+    let dp: number[] = new Array(n + 1).fill(0);
+    dp[0] = 1;
+    for (let j = 1; j <= n; j++) {//遍历背包
+        for (let i = 1; i <= 2; i++) {//遍历物品
+            if (j - i >= 0) dp[j] = dp[j] + dp[j - i];
+        }
+    }
+    return dp[n];
+}
+```
 
 ### Rust: