Easy Python beats 99.28%....Haha...Guest it's pure luck....


  • 0
    F
    class Solution(object):
        def climbStairs(self, n):
            """
            :type n: int
            :rtype: int
            """
            # typical dynamic programming problem
            dp = [1 for _ in range(n + 1)]
            for i in range(2, n + 1):
                dp[i] = dp[i - 1] + dp[i - 2]
            return dp[n]
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.