leetcode -- Climbing Stairs -- 简单重要

https://leetcode.com/problems/climbing-stairs/

简单的dp思路
d[n] = d[n - 1] + d[n - 2]

class Solution(object):
    def climbStairs(self, n):
        """
        :type n: int
        :rtype: int
        """


        d = [0,1,2]
        for i in xrange(3,n + 1):
            d.append(d[i - 1] + d[i - 2])
        return d[n]