<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[2302_76937973的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/2302_76937973</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; 2302_76937973]]></copyright><item><title><![CDATA[洛谷P1002 [NOIP2002 普及组] 过河卒 -动态规划]]></title><link>https://blog.youkuaiyun.com/2302_76937973/article/details/145136426</link><guid>https://blog.youkuaiyun.com/2302_76937973/article/details/145136426</guid><author>2302_76937973</author><pubDate>Tue, 14 Jan 2025 13:02:44 +0800</pubDate><description><![CDATA[【代码】洛谷P1002 [NOIP2002 普及组] 过河卒 -动态规划。]]></description><category></category></item><item><title><![CDATA[C++学习笔记 （随时更新 ）]]></title><link>https://blog.youkuaiyun.com/2302_76937973/article/details/142695602</link><guid>https://blog.youkuaiyun.com/2302_76937973/article/details/142695602</guid><author>2302_76937973</author><pubDate>Thu, 03 Oct 2024 20:17:01 +0800</pubDate><description><![CDATA[指针本身是常量，指向的位置不可更改，但指向的数据可以修改。指针指向的数据是常量，指针本身可以修改。]]></description><category></category></item><item><title><![CDATA[leetcode第1385题]]></title><link>https://blog.youkuaiyun.com/2302_76937973/article/details/142678601</link><guid>https://blog.youkuaiyun.com/2302_76937973/article/details/142678601</guid><author>2302_76937973</author><pubDate>Wed, 02 Oct 2024 10:09:03 +0800</pubDate><description><![CDATA[给你两个整数数组arr1和arr2，以及一个整数d，请你返回两个数组之间的。定义为符合此距离要求的元素数目：对于元素arr1[i]，不存在任何元素arr2[j]满足。]]></description><category></category></item><item><title><![CDATA[leetcode第1103题]]></title><link>https://blog.youkuaiyun.com/2302_76937973/article/details/142673937</link><guid>https://blog.youkuaiyun.com/2302_76937973/article/details/142673937</guid><author>2302_76937973</author><pubDate>Tue, 01 Oct 2024 20:01:50 +0800</pubDate><description><![CDATA[排排坐，分糖果。我们买了一些糖果candies，打算把它们分给排好队的个小朋友。给第一个小朋友 1 颗糖果，第二个小朋友 2 颗，依此类推，直到给最后一个小朋友n颗糖果。然后，我们再回到队伍的起点，给第一个小朋友n + 1颗糖果，第二个小朋友n + 2颗糖果，依此类推，直到给最后一个小朋友2 * n颗糖果。重复上述过程（每次都比上一次多给出一颗糖果，当到达队伍终点后再次从队伍起点开始），直到我们分完所有的糖果。]]></description><category></category></item><item><title><![CDATA[leetcode第389题]]></title><link>https://blog.youkuaiyun.com/2302_76937973/article/details/142672832</link><guid>https://blog.youkuaiyun.com/2302_76937973/article/details/142672832</guid><author>2302_76937973</author><pubDate>Tue, 01 Oct 2024 17:47:48 +0800</pubDate><description><![CDATA[用一个数组，数组大小26，索引0~25对应a~z，统计每个出现的字母的数量，分别遍历s和t，遍历s时数组元素的值++，遍历t时--，最后数组小于0的元素，其下标对应的字母即为所求。时间复杂度O（N）]]></description><category></category></item><item><title><![CDATA[leetcode第228题]]></title><link>https://blog.youkuaiyun.com/2302_76937973/article/details/142672330</link><guid>https://blog.youkuaiyun.com/2302_76937973/article/details/142672330</guid><author>2302_76937973</author><pubDate>Tue, 01 Oct 2024 17:14:45 +0800</pubDate><description><![CDATA[题目描述如上图。]]></description><category></category></item></channel></rss>