diff --git a/problems/0070.爬楼梯完全背包版本.md b/problems/0070.爬楼梯完全背包版本.md
index 3093c833..41c2e616 100644
--- a/problems/0070.爬楼梯完全背包版本.md
+++ b/problems/0070.爬楼梯完全背包版本.md
@@ -128,12 +128,12 @@ Java：
 class Solution {
     public int climbStairs(int n) {
         int[] dp = new int[n + 1];
-        int[] weight = {1,2};
+        int m = 2;
         dp[0] = 1;
 
-        for (int i = 0; i <= n; i++) {
-            for (int j = 0; j < weight.length; j++) {
-                if (i >= weight[j]) dp[i] += dp[i - weight[j]];
+        for (int i = 1; i <= n; i++) { // 遍历背包
+            for (int j = 1; j <= m; j++) { //遍历物品
+                if (i >= j) dp[i] += dp[i - j];
             }
         }
 
@@ -227,3 +227,4 @@ function climbStairs(n: number): number {
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">
   <img src="../pics/网站星球宣传海报.jpg" width="1000"/>
 </a>
+