From f29c193560ac099af4876e82d7919811608d3db1 Mon Sep 17 00:00:00 2001
From: epiphany13-ning <3237480553@qq.com>
Date: Sat, 20 Sep 2025 18:18:36 +0800
Subject: [PATCH] feat: add DP solution for LeetCode 70 Climbing Stairs

---
 ...0.\347\210\254\346\245\274\346\242\257.md" | 21 ++++++++++---------
 1 file changed, 11 insertions(+), 10 deletions(-)

diff --git "a/problems/0070.\347\210\254\346\245\274\346\242\257.md" "b/problems/0070.\347\210\254\346\245\274\346\242\257.md"
index 316fbd4f39..ddb8795920 100755
--- "a/problems/0070.\347\210\254\346\245\274\346\242\257.md"
+++ "b/problems/0070.\347\210\254\346\245\274\346\242\257.md"
@@ -220,16 +220,17 @@ public:
 ### Java
 
 ```java
-// 常规方式
-public int climbStairs(int n) {
-    int[] dp = new int[n + 1];
-    dp[0] = 1;
-    dp[1] = 1;
-    for (int i = 2; i <= n; i++) {
-        dp[i] = dp[i - 1] + dp[i - 2];
-    }
-    return dp[n];
-}
+//常规方式，从n=1开始定义
+        if (n == 1 || n == 2) {
+            return n;
+        }
+        int[] dp = new int[n + 1];
+        dp[1] = 1;
+        dp[2] = 2;
+        for (int i = 3; i <= n; i++) {
+            dp[i] = dp[i - 2] + dp[i - 1];
+        }
+        return dp[n];
 ```
 
 ```Java