Merge branch 'master' into patch-29

problems/0070.爬楼梯完全背包版本.md

@@ -146,19 +146,24 @@ class Solution {
 ```
 
 Python：
-```python
+
+
+```python3
 class Solution:
     def climbStairs(self, n: int) -> int:
-        m = 2
-        dp = [0] * (n + 1)
+        dp = [0]*(n + 1)
         dp[0] = 1
-        for i in range(n + 1):
-            for j in range(1, m + 1):
-                if i >= j:
-                    dp[i] += dp[i - j]
-        return dp[-1]
+        m = 2
+        # 遍历背包
+        for j in range(n + 1):
+            # 遍历物品
+            for step in range(1, m + 1):
+                if j >= step:
+                    dp[j] += dp[j - step]
+        return dp[n]
 ```
 
+
 Go：
 ```go
 func climbStairs(n int) int {