<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Rabbit_dayi的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Rabbit_dayi</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Rabbit_dayi]]></copyright><item><title><![CDATA[python 第七周]]></title><link>https://blog.youkuaiyun.com/Rabbit_dayi/article/details/127329970</link><guid>https://blog.youkuaiyun.com/Rabbit_dayi/article/details/127329970</guid><author>Rabbit_dayi</author><pubDate>Sat, 15 Oct 2022 00:14:52 +0800</pubDate><description><![CDATA[search(n);其中传入的参数n是一个三位数的正整数。函数search返回[101, n]区间内所有满足条件的数的个数。参数number是整数，参数digit为[1,9]区间的整数，函数返回number中digit出现的次数。def f(n):def p(t):其中函数f(n)，功能是判断n的奇偶性，n为奇数，返回1，偶数返回0，函数p(t)的功能是求字符串t中奇数数字的和，函数q(t)的功能是求字符串t中偶数数字的和。]]></description><category></category></item><item><title><![CDATA[python第五周 菱形]]></title><link>https://blog.youkuaiyun.com/Rabbit_dayi/article/details/127325604</link><guid>https://blog.youkuaiyun.com/Rabbit_dayi/article/details/127325604</guid><author>Rabbit_dayi</author><pubDate>Fri, 14 Oct 2022 18:19:37 +0800</pubDate><description><![CDATA[因为第一次尝试csdn，虽然很不情愿。只写一点点跟网上不太一样的思路。太简单的就不复制了。]]></description><category></category></item><item><title><![CDATA[找出全部子串位置（python re库实现）]]></title><link>https://blog.youkuaiyun.com/Rabbit_dayi/article/details/127325519</link><guid>https://blog.youkuaiyun.com/Rabbit_dayi/article/details/127325519</guid><author>Rabbit_dayi</author><pubDate>Fri, 14 Oct 2022 18:13:29 +0800</pubDate><description><![CDATA[输入两个串s1,s2，找出s2在s1中所有出现的位置。前后两个子串的出现不能重叠。例如’aa’在 aaaa 里出现的位置只有0,2。]]></description><category></category></item></channel></rss>