5/30/2017 - 3:07 PM

70. Climbing Stairs

  1. Climbing Stairs

class Solution(object):
    def climbStairs(self, n):
        :type n: int
        :rtype: int
        eleList = [0, 1, 2]
        if n >= 3:
            for i in range(3,n+1):
                eleList.append(eleList[i-1] + eleList[i-2])
        return eleList[n]

You are climbing a stair case. It takes n steps to reach to the top.

Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

Note: Given n will be a positive integer.