<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Reader_Dreamer的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Reader_Dreamer</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Reader_Dreamer]]></copyright><item><title><![CDATA[python动态规划_爬楼梯]]></title><link>https://blog.youkuaiyun.com/Reader_Dreamer/article/details/77913854</link><guid>https://blog.youkuaiyun.com/Reader_Dreamer/article/details/77913854</guid><author>Reader_Dreamer</author><pubDate>Sat, 09 Sep 2017 11:14:05 +0800</pubDate><description><![CDATA[# coding = UTF-8
import time

def fun(n):
    if n == 0 or n == 1:
        return n+1
    else:
     return fun(n -1) + fun(n - 2)

# [1, 2, 3, 5, 8, 13, 21]
# 上台阶的方法数
global dp,f1,f2
f1 = 1
f2 = 2
dp]]></description><category></category></item></channel></rss>