<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[m0_73925921的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/m0_73925921</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; m0_73925921]]></copyright><item><title><![CDATA[第33次CCF计算机软件能力认证——化学方程式配平]]></title><link>https://blog.youkuaiyun.com/m0_73925921/article/details/139067552</link><guid>https://blog.youkuaiyun.com/m0_73925921/article/details/139067552</guid><author>m0_73925921</author><pubDate>Mon, 20 May 2024 15:56:13 +0800</pubDate><description><![CDATA[【代码】第33次CCF计算机软件能力认证——化学方程式配平。]]></description><category></category></item><item><title><![CDATA[CCF ——序列查询新解T2]]></title><link>https://blog.youkuaiyun.com/m0_73925921/article/details/134294889</link><guid>https://blog.youkuaiyun.com/m0_73925921/article/details/134294889</guid><author>m0_73925921</author><pubDate>Wed, 08 Nov 2023 18:10:20 +0800</pubDate><description><![CDATA[此题与第一题有联系，f(x)定义：序列A中小于等于x的整数里的最大的数的下标。g(x)计算方式：r=N/(n+1)   g(x)=x/r。]]></description><category></category></item><item><title><![CDATA[CCF —— 非零段划分T2]]></title><link>https://blog.youkuaiyun.com/m0_73925921/article/details/134276673</link><guid>https://blog.youkuaiyun.com/m0_73925921/article/details/134276673</guid><author>m0_73925921</author><pubDate>Wed, 08 Nov 2023 17:30:42 +0800</pubDate><description><![CDATA[0 3 1 2 0 0 2 0 4 5 0 2  （以0为首）以此类推，可以发现用。]]></description><category></category></item><item><title><![CDATA[CCF——出行计划T2]]></title><link>https://blog.youkuaiyun.com/m0_73925921/article/details/134166820</link><guid>https://blog.youkuaiyun.com/m0_73925921/article/details/134166820</guid><author>m0_73925921</author><pubDate>Wed, 01 Nov 2023 18:03:17 +0800</pubDate><description><![CDATA[【代码】CCF——出行计划T2。]]></description><category></category></item><item><title><![CDATA[CCF——寻宝！大冒险！（JAVA实现）]]></title><link>https://blog.youkuaiyun.com/m0_73925921/article/details/134107530</link><guid>https://blog.youkuaiyun.com/m0_73925921/article/details/134107530</guid><author>m0_73925921</author><pubDate>Sun, 29 Oct 2023 20:37:22 +0800</pubDate><description><![CDATA[主要考察了对基本STL的使用, 部分JDK中没有pair，需要手动写一个。]]></description><category></category></item><item><title><![CDATA[CCF202309-2 坐标变换(其二)]]></title><link>https://blog.youkuaiyun.com/m0_73925921/article/details/133951005</link><guid>https://blog.youkuaiyun.com/m0_73925921/article/details/133951005</guid><author>m0_73925921</author><pubDate>Fri, 20 Oct 2023 17:33:25 +0800</pubDate><description><![CDATA[【代码】CCF202309-2 坐标变换(其二)]]></description><category></category></item><item><title><![CDATA[数据结构巩固刷题——链表]]></title><link>https://blog.youkuaiyun.com/m0_73925921/article/details/132377451</link><guid>https://blog.youkuaiyun.com/m0_73925921/article/details/132377451</guid><author>m0_73925921</author><pubDate>Sat, 19 Aug 2023 11:47:27 +0800</pubDate><description><![CDATA[​​​ ​​​​​​面试题 02.02. 返回倒数第 k 个节点 - 力扣（LeetCode）            用双指针找到倒数第k个节点即可，定义一个慢指针slow和一个快指针fast，使这两个指针的距离差为k。举个例子：        1->2->3->4->5->6->NULL        s          f                             s              f这样，当fast指针指向null的时候，slow指针就指向倒数第k个节点。


第二种思路，]]></description><category></category></item><item><title><![CDATA[入门线性dp]]></title><link>https://blog.youkuaiyun.com/m0_73925921/article/details/132010621</link><guid>https://blog.youkuaiyun.com/m0_73925921/article/details/132010621</guid><author>m0_73925921</author><pubDate>Mon, 31 Jul 2023 11:01:09 +0800</pubDate><description><![CDATA[几道leetcode上关于简单dp的题解]]></description><category></category></item></channel></rss>