[Vssue]0070.爬楼梯完全背包版本.md

[youngyangyang04]

https://www.programmercarl.com/0070.%E7%88%AC%E6%A5%BC%E6%A2%AF%E5%AE%8C%E5%85%A8%E8%83%8C%E5%8C%85%E7%89%88%E6%9C%AC.html

[Du1in9]

class Solution {
    public int climbStairs(int n, int m) {
        int[] dp = new int[n + 1];
        dp[0] = 1;
        for (int j = 1; j <= n; j++) {
            for (int i = 1; i <= m; i++) {
                if (j - i >= 0) {
                    dp[j] += dp[j - i];
                }
            }
        }
        return dp[n];
    }
}