题目
思路
dp
代码
class Solution:
"""
@param n: An integer
@return: An integer
"""
def climbStairs(self, n):
# write your code here
dp = [0, 1, 2];
for i in range(3, n + 1): dp.append(dp[i - 1] + dp[i - 2])
return dp[n]