Skip to content

修改0070.爬楼梯.md Java常规方式解法 #2970

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open

epiphany13-ning wants to merge 1 commit into youngyangyang04:master

from epiphany13-ning:add-climbing-stairs-solution

Open

修改0070.爬楼梯.md Java常规方式解法 #2970

Changes from all commits

Commits

Show all changes

Select commit

feat: add DP solution for LeetCode 70 Climbing Stairs

epiphany13-ning Sep 20, 2025

File filter

Filter by extension

Conversations

Jump to

Jump to file

Failed to load files.

Loading

Diff view

Diff view

21 changes: 11 additions & 10 deletions problems/0070.爬楼梯.md

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
Expand Up		@@ -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
Expand Down