Skip to content

爬楼梯算法 #2

@zhngjn

Description

@zhngjn

dp.append(dp[i-1] + dp[i-2])
应该是dp.append(dp[i-1] + 2 * dp[i-2])
爬i阶楼梯,在i-2阶之上,有两种爬法,1+1, 2

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions