<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title>算法题 - Category - LenBlog</title><link>http://lennert.site/categories/%E7%AE%97%E6%B3%95%E9%A2%98/</link><description>算法题 - Category - LenBlog</description><generator>Hugo -- gohugo.io</generator><language>zh-CN</language><managingEditor>1416679017@qq.com (Lennert)</managingEditor><webMaster>1416679017@qq.com (Lennert)</webMaster><lastBuildDate>Sat, 20 Dec 2025 00:00:00 +0000</lastBuildDate><atom:link href="http://lennert.site/categories/%E7%AE%97%E6%B3%95%E9%A2%98/" rel="self" type="application/rss+xml"/><item><title>leecode Hot100 学习记录</title><link>http://lennert.site/posts/100hot_%E7%AE%97%E6%B3%95%E9%A2%98/</link><pubDate>Tue, 09 Dec 2025 00:00:00 +0000</pubDate><author>1416679017@qq.com (Lennert)</author><guid>http://lennert.site/posts/100hot_%E7%AE%97%E6%B3%95%E9%A2%98/</guid><description><![CDATA[<h3 id="前缀和">前缀和</h3>
<blockquote>
<p><strong>不单调数组求任意子数组和</strong></p></blockquote>
<p>前缀和概念和数列前n项和的概念很像，但是不包含最后一项（左闭右开），模版来自<a href="https://leetcode.cn/problems/range-sum-query-immutable/" target="_blank" rel="noopener noreffer ">303. 区域和检索 - 数组不可变 - 力扣（LeetCode）</a></p>]]></description></item><item><title>LCR 138. 有效数字</title><link>http://lennert.site/posts/%E6%9C%89%E9%99%90%E7%8A%B6%E6%80%81%E6%9C%BA/</link><pubDate>Sat, 20 Dec 2025 00:00:00 +0000</pubDate><author>1416679017@qq.com (Lennert)</author><guid>http://lennert.site/posts/%E6%9C%89%E9%99%90%E7%8A%B6%E6%80%81%E6%9C%BA/</guid><description>&lt;p>力扣题目：https://leetcode.cn/problems/biao-shi-shu-zhi-de-zi-fu-chuan-lcof/description/?envType=study-plan-v2&amp;amp;envId=coding-interviews&lt;/p></description></item><item><title>环形链表入口</title><link>http://lennert.site/posts/%E7%8E%AF%E5%BD%A2%E9%93%BE%E8%A1%A8%E5%85%A5%E5%8F%A3/</link><pubDate>Sat, 20 Dec 2025 00:00:00 +0000</pubDate><author>1416679017@qq.com (Lennert)</author><guid>http://lennert.site/posts/%E7%8E%AF%E5%BD%A2%E9%93%BE%E8%A1%A8%E5%85%A5%E5%8F%A3/</guid><description><![CDATA[<p><strong>环形链表的快慢指针相遇问题：</strong></p>
<p>力扣链接：https://leetcode.cn/problems/linked-list-cycle-ii/</p>
<p>给定一个链表的头节点  <code>head</code> ，返回链表开始入环的第一个节点。 如果链表无环，则返回 <code>null</code>。
</p>]]></description></item></channel></rss>