<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[EODVT的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/EODVT</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; EODVT]]></copyright><item><title><![CDATA[圣诞树-Python版]]></title><link>https://blog.youkuaiyun.com/EODVT/article/details/128433911</link><guid>https://blog.youkuaiyun.com/EODVT/article/details/128433911</guid><author>EODVT</author><pubDate>Sun, 25 Dec 2022 11:26:24 +0800</pubDate><description><![CDATA[到了圣诞,画棵圣诞树吧。]]></description><category></category></item><item><title><![CDATA[N的阶乘（递归）]]></title><link>https://blog.youkuaiyun.com/EODVT/article/details/128380645</link><guid>https://blog.youkuaiyun.com/EODVT/article/details/128380645</guid><author>EODVT</author><pubDate>Tue, 20 Dec 2022 09:51:57 +0800</pubDate><description><![CDATA[jc()函数的核心是调用n*jc(n-1)函数自己。]]></description><category></category></item><item><title><![CDATA[DP走台阶]]></title><link>https://blog.youkuaiyun.com/EODVT/article/details/128365025</link><guid>https://blog.youkuaiyun.com/EODVT/article/details/128365025</guid><author>EODVT</author><pubDate>Sun, 18 Dec 2022 19:24:47 +0800</pubDate><description><![CDATA[走台阶,非常经典的一道题,可以选用动态规划解法]]></description><category></category></item></channel></rss>