<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>我要成为蒜法高手 on Sianao</title>
    <link>https://sianao.cc/leetcode/</link>
    <description>Recent content in 我要成为蒜法高手 on Sianao</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en</language>
    <managingEditor>me@sianao.cc (Sianao)</managingEditor>
    <webMaster>me@sianao.cc (Sianao)</webMaster>
    <copyright>:copyright: 2026 Sianao</copyright>
    <lastBuildDate>Sat, 10 Jan 2026 22:34:03 +0800</lastBuildDate><atom:link href="https://sianao.cc/leetcode/index.xml" rel="self" type="application/rss+xml" />
    
    <item>
      <title>动态规划</title>
      <link>https://sianao.cc/leetcode/dp/</link>
      <pubDate>Sat, 10 Jan 2026 22:34:03 +0800</pubDate>
      <author>me@sianao.cc (Sianao)</author>
      <guid>https://sianao.cc/leetcode/dp/</guid>
      <description>&lt;p&gt;按照灵神题单刷题，题单如下  &lt;a href=&#34;https://leetcode.cn/discuss/post/3581838/fen-xiang-gun-ti-dan-dong-tai-gui-hua-ru-007o/&#34;  target=&#34;_blank&#34;&gt; 灵神题单 &lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2 class=&#34;relative group&#34;&gt;入门DP&#xA;    &lt;div id=&#34;入门dp&#34; class=&#34;anchor&#34;&gt;&lt;/div&gt;&#xA;    &#xA;    &lt;span&#xA;        class=&#34;absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none&#34;&gt;&#xA;        &lt;a class=&#34;text-primary-300 dark:text-neutral-700 !no-underline&#34; href=&#34;#%e5%85%a5%e9%97%a8dp&#34; aria-label=&#34;Anchor&#34;&gt;#&lt;/a&gt;&#xA;    &lt;/span&gt;&#xA;    &#xA;&lt;/h2&gt;&#xA;&lt;p&gt;爬楼梯&lt;/p&gt;</description>
      
    </item>
    
    <item>
      <title>每日一题</title>
      <link>https://sianao.cc/leetcode/daily/</link>
      <pubDate>Sat, 10 Jan 2026 22:32:04 +0800</pubDate>
      <author>me@sianao.cc (Sianao)</author>
      <guid>https://sianao.cc/leetcode/daily/</guid>
      <description>&lt;p&gt;&lt;a href=&#34;https://leetcode.cn/problems/four-divisors/&#34;  target=&#34;_blank&#34;&gt;1390. 四因数&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;给你一个整数数组 &lt;code&gt;nums&lt;/code&gt;，请你返回该数组中恰有四个因数的这些整数的各因数之和。如果数组中不存在满足题意的整数，则返回 &lt;code&gt;0&lt;/code&gt; 。&lt;/p&gt;</description>
      
    </item>
    
  </channel>
</rss>
