<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Utgnryk的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Utgnryk</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Utgnryk]]></copyright><item><title><![CDATA[hot100-动态规划]]></title><link>https://blog.youkuaiyun.com/Utgnryk/article/details/145978253</link><guid>https://blog.youkuaiyun.com/Utgnryk/article/details/145978253</guid><author>Utgnryk</author><pubDate>Tue, 04 Mar 2025 12:07:50 +0800</pubDate><description><![CDATA[新手刷题自用记录]]></description><category></category></item><item><title><![CDATA[hot100-贪心 回溯]]></title><link>https://blog.youkuaiyun.com/Utgnryk/article/details/145899664</link><guid>https://blog.youkuaiyun.com/Utgnryk/article/details/145899664</guid><author>Utgnryk</author><pubDate>Thu, 27 Feb 2025 12:27:54 +0800</pubDate><description><![CDATA[新手刷题自用记录]]></description><category></category></item><item><title><![CDATA[hot100-栈 二分]]></title><link>https://blog.youkuaiyun.com/Utgnryk/article/details/145847028</link><guid>https://blog.youkuaiyun.com/Utgnryk/article/details/145847028</guid><author>Utgnryk</author><pubDate>Wed, 26 Feb 2025 18:31:32 +0800</pubDate><description><![CDATA[rR记录第一次的r，在第一次中，l是最后一个小于target的数，r是第一个target（如果target存在）。在第二次中，l是最后一个target（如果target存在），r是target右侧第一个数。l指向的是首个元素大于target的一行的前一行。所以要判断首行的首个元素是不是大于target，若是，则l指向-1，再往后走会爆数组下标。i是nums1里分割线左侧的点，j是nums2里分割线左侧的点。如果第一次的r比第二次的l大，则target不存在。实际上也可以用辅助栈。]]></description><category></category></item><item><title><![CDATA[hot100-二叉树]]></title><link>https://blog.youkuaiyun.com/Utgnryk/article/details/145807986</link><guid>https://blog.youkuaiyun.com/Utgnryk/article/details/145807986</guid><author>Utgnryk</author><pubDate>Mon, 24 Feb 2025 18:34:11 +0800</pubDate><description><![CDATA[新手刷题自用记录]]></description><category></category></item><item><title><![CDATA[hot100-]]></title><link>https://blog.youkuaiyun.com/Utgnryk/article/details/145773345</link><guid>https://blog.youkuaiyun.com/Utgnryk/article/details/145773345</guid><author>Utgnryk</author><pubDate>Fri, 21 Feb 2025 13:54:21 +0800</pubDate><description><![CDATA[新手刷题自用记录]]></description><category></category></item><item><title><![CDATA[hot100-141、142、148、146、136、169、75、31、287 ]]></title><link>https://blog.youkuaiyun.com/Utgnryk/article/details/145746446</link><guid>https://blog.youkuaiyun.com/Utgnryk/article/details/145746446</guid><author>Utgnryk</author><pubDate>Thu, 20 Feb 2025 20:03:29 +0800</pubDate><description><![CDATA[新手刷题自用手册]]></description><category></category></item><item><title><![CDATA[hot100-3、438、560、239、240、160、234（2简3中1难）]]></title><link>https://blog.youkuaiyun.com/Utgnryk/article/details/145720501</link><guid>https://blog.youkuaiyun.com/Utgnryk/article/details/145720501</guid><author>Utgnryk</author><pubDate>Wed, 19 Feb 2025 18:23:43 +0800</pubDate><description><![CDATA[新手刷题自用记录]]></description><category></category></item><item><title><![CDATA[hot100——11，42]]></title><link>https://blog.youkuaiyun.com/Utgnryk/article/details/145706775</link><guid>https://blog.youkuaiyun.com/Utgnryk/article/details/145706775</guid><author>Utgnryk</author><pubDate>Tue, 18 Feb 2025 23:12:59 +0800</pubDate><description><![CDATA[新手刷题自用记录]]></description><category></category></item><item><title><![CDATA[数组与贪心算法——649、678、420 数字与贪心 343（3中1难）]]></title><link>https://blog.youkuaiyun.com/Utgnryk/article/details/142134300</link><guid>https://blog.youkuaiyun.com/Utgnryk/article/details/142134300</guid><author>Utgnryk</author><pubDate>Wed, 11 Sep 2024 16:50:01 +0800</pubDate><description><![CDATA[新手刷题自用记录]]></description><category></category></item><item><title><![CDATA[数组与贪心算法——215、75、324、517（3中1难）]]></title><link>https://blog.youkuaiyun.com/Utgnryk/article/details/142084873</link><guid>https://blog.youkuaiyun.com/Utgnryk/article/details/142084873</guid><author>Utgnryk</author><pubDate>Tue, 10 Sep 2024 23:14:34 +0800</pubDate><description><![CDATA[新手刷题自用记录]]></description><category></category></item><item><title><![CDATA[数组与贪心算法——452、435、646、406、169（1简4中）]]></title><link>https://blog.youkuaiyun.com/Utgnryk/article/details/142053403</link><guid>https://blog.youkuaiyun.com/Utgnryk/article/details/142053403</guid><author>Utgnryk</author><pubDate>Mon, 09 Sep 2024 23:52:42 +0800</pubDate><description><![CDATA[新手刷题自用记录]]></description><category></category></item><item><title><![CDATA[数组与贪心算法——179、56、57、228（2简2中）]]></title><link>https://blog.youkuaiyun.com/Utgnryk/article/details/141992630</link><guid>https://blog.youkuaiyun.com/Utgnryk/article/details/141992630</guid><author>Utgnryk</author><pubDate>Sat, 07 Sep 2024 23:31:27 +0800</pubDate><description><![CDATA[新手刷题自用手册]]></description><category></category></item><item><title><![CDATA[数组与贪心算法——409、621（1中1简）]]></title><link>https://blog.youkuaiyun.com/Utgnryk/article/details/141956827</link><guid>https://blog.youkuaiyun.com/Utgnryk/article/details/141956827</guid><author>Utgnryk</author><pubDate>Fri, 06 Sep 2024 23:48:46 +0800</pubDate><description><![CDATA[新手刷题自用记录]]></description><category></category></item><item><title><![CDATA[数组与贪心算法——605、121、122、561、455、575（5简1中）]]></title><link>https://blog.youkuaiyun.com/Utgnryk/article/details/141931863</link><guid>https://blog.youkuaiyun.com/Utgnryk/article/details/141931863</guid><author>Utgnryk</author><pubDate>Thu, 05 Sep 2024 22:08:16 +0800</pubDate><description><![CDATA[新手刷题自用记录]]></description><category></category></item><item><title><![CDATA[哈希表与统计——594、350、554、609、454(2简3中)]]></title><link>https://blog.youkuaiyun.com/Utgnryk/article/details/141889320</link><guid>https://blog.youkuaiyun.com/Utgnryk/article/details/141889320</guid><author>Utgnryk</author><pubDate>Wed, 04 Sep 2024 16:23:43 +0800</pubDate><description><![CDATA[新手刷题自用记录]]></description><category></category></item><item><title><![CDATA[哈希表的查找、插入及删除——166、138 哈希表与索引——1、167、599、219、220 （3简3中1难）]]></title><link>https://blog.youkuaiyun.com/Utgnryk/article/details/141418857</link><guid>https://blog.youkuaiyun.com/Utgnryk/article/details/141418857</guid><author>Utgnryk</author><pubDate>Tue, 03 Sep 2024 15:20:28 +0800</pubDate><description><![CDATA[在这里，对abs（取绝对值）的方法做了一个转换，使用了TreeSet.higher函数（寻找集里严格大于e的最小的那个数），而把e定为num-valueDiff-1。即，原来-4到-1也在0组，这样的话，就可以让-5到-1分到-1组，实现错位。这道题使用了双重区间，即下标区间和值区间，下标区间依旧可以通过219的滑动区间解决限制，但对于值区间，比起在值区间内进行值遍历，我首先想到的办法是先找到最接近的值、再判断是否在区间。因为最差值的是t，也就是说，x和x+t是最极端的符合条件的情况，它们需要在一个桶里。]]></description><category></category></item><item><title><![CDATA[哈希表的查找、插入及删除——217、633、349、128、202、500，290、532、205（五简四中）]]></title><link>https://blog.youkuaiyun.com/Utgnryk/article/details/141365863</link><guid>https://blog.youkuaiyun.com/Utgnryk/article/details/141365863</guid><author>Utgnryk</author><pubDate>Wed, 21 Aug 2024 19:07:40 +0800</pubDate><description><![CDATA[新手刷题自用记录]]></description><category></category></item><item><title><![CDATA[链表高精度加法——2、445 链表的合并——21、23（一简两中一难）]]></title><link>https://blog.youkuaiyun.com/Utgnryk/article/details/141352030</link><guid>https://blog.youkuaiyun.com/Utgnryk/article/details/141352030</guid><author>Utgnryk</author><pubDate>Tue, 20 Aug 2024 17:47:43 +0800</pubDate><description><![CDATA[新手刷题自用记录]]></description><category></category></item><item><title><![CDATA[链表的旋转与反转 61、24、206、92、25（1简3中1难）]]></title><link>https://blog.youkuaiyun.com/Utgnryk/article/details/141320321</link><guid>https://blog.youkuaiyun.com/Utgnryk/article/details/141320321</guid><author>Utgnryk</author><pubDate>Mon, 19 Aug 2024 20:38:15 +0800</pubDate><description><![CDATA[新手刷题自用记录]]></description><category></category></item><item><title><![CDATA[链表的删除 203、237、19 链表的遍历 430]]></title><link>https://blog.youkuaiyun.com/Utgnryk/article/details/141292114</link><guid>https://blog.youkuaiyun.com/Utgnryk/article/details/141292114</guid><author>Utgnryk</author><pubDate>Sun, 18 Aug 2024 22:18:37 +0800</pubDate><description><![CDATA[新手刷题自用记录]]></description><category></category></item></channel></rss>