修改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

Jump to bottom

Open

epiphany13-ning wants to merge 1 commit into youngyangyang04:master from epiphany13-ning:add-climbing-stairs-solution

epiphany13-ning commented Sep 20, 2025

修改常规方式

从n=1开始定义
初始化dp[1] = 1,dp[2] = 2


          feat: add DP solution for LeetCode 70 Climbing Stairs

f29c193

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet