ligecarryme
diff --git a/‎基础算法篇/动态规划.md‎
Lines changed: 29 additions & 0 deletions b/‎基础算法篇/动态规划.md‎
Lines changed: 29 additions & 0 deletions
@@ -227,3 +227,32 @@ var uniquePathsWithObstacles = function (obstacleGrid) {
 };
 ```
 
+## 2、序列类型（40%）
+
+##### [70. 爬楼梯](https://leetcode-cn.com/problems/climbing-stairs/)
+
+```js
+var climbStairs = function (n) {
+    const res = [1, 2]
+    for (let i = 2; i < n; i++) {
+        res[i] = res[i - 1] + res[i - 2]
+    }
+    return res[n - 1]
+};
+```
+
+##### [55. 跳跃游戏](https://leetcode-cn.com/problems/jump-game/)
+
+给定一个非负整数数组 `nums` ，你最初位于数组的 **第一个下标** 。数组中的每个元素代表你在该位置可以跳跃的最大长度。判断你是否能够到达最后一个下标。
+
+```js
+var canJump = function (nums) {
+    let k = 0
+    for (let i = 0; i < nums.length; i++) {
+        if (i > k) { return false }
+        k = Math.max(k, i + nums[i])
+    }
+    return true
+};
+```
+