<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>算法练习 on 相思不扫久积弥厚</title><link>https://blog.linhui.fun/categories/%E7%AE%97%E6%B3%95%E7%BB%83%E4%B9%A0/</link><description>Recent content in 算法练习 on 相思不扫久积弥厚</description><generator>Hugo</generator><language>zh-CN</language><lastBuildDate>Mon, 12 Oct 2026 00:00:00 +0800</lastBuildDate><atom:link href="https://blog.linhui.fun/categories/%E7%AE%97%E6%B3%95%E7%BB%83%E4%B9%A0/index.xml" rel="self" type="application/rss+xml"/><item><title>Codeforces Round 891 (Div. 3)AC代码</title><link>https://blog.linhui.fun/posts/tencent-2351645/</link><pubDate>Thu, 10 Aug 2023 00:00:00 +0800</pubDate><guid>https://blog.linhui.fun/posts/tencent-2351645/</guid><description>Codeforces Round 891 (Div. 3)AC代码。旧文归档，原始发表于 2023-08-10。</description></item><item><title>小气鬼送礼物算法优化-（2020阿里笔试题）</title><link>https://blog.linhui.fun/posts/tencent-2351655/</link><pubDate>Fri, 04 Mar 2022 00:00:00 +0800</pubDate><guid>https://blog.linhui.fun/posts/tencent-2351655/</guid><description>小气鬼送礼物算法优化-（2020阿里笔试题）。旧文归档，原始发表于 2022-03-04。</description></item><item><title>记京东笔试编程题目（JAVA开发）</title><link>https://blog.linhui.fun/posts/tencent-2351641/</link><pubDate>Thu, 27 Aug 2020 00:00:00 +0800</pubDate><guid>https://blog.linhui.fun/posts/tencent-2351641/</guid><description>记京东笔试编程题目（JAVA开发）。旧文归档，原始发表于 2020-08-27。</description></item><item><title>LeetCode 65：有效数字 DFA自动机解法</title><link>https://blog.linhui.fun/posts/tencent-2351644/</link><pubDate>Wed, 12 Aug 2020 00:00:00 +0800</pubDate><guid>https://blog.linhui.fun/posts/tencent-2351644/</guid><description>LeetCode 65：有效数字 DFA自动机解法。旧文归档，原始发表于 2020-08-12。</description></item><item><title>记华为笔试编程题目（软件开发）</title><link>https://blog.linhui.fun/posts/tencent-2351642/</link><pubDate>Wed, 12 Aug 2020 00:00:00 +0800</pubDate><guid>https://blog.linhui.fun/posts/tencent-2351642/</guid><description>记华为笔试编程题目（软件开发）。旧文归档，原始发表于 2020-08-12。</description></item><item><title>N皇后问题--bitset解的思路</title><link>https://blog.linhui.fun/posts/tencent-2351620/</link><pubDate>Mon, 10 Aug 2020 00:00:00 +0800</pubDate><guid>https://blog.linhui.fun/posts/tencent-2351620/</guid><description>N皇后问题--bitset解的思路。旧文归档，原始发表于 2020-08-10。</description></item><item><title>记阿里笔试编程题目（JAVA研发）</title><link>https://blog.linhui.fun/posts/tencent-2351656/</link><pubDate>Tue, 28 Jul 2020 00:00:00 +0800</pubDate><guid>https://blog.linhui.fun/posts/tencent-2351656/</guid><description>记阿里笔试编程题目（JAVA研发）。旧文归档，原始发表于 2020-07-28。</description></item><item><title>用A*算法让贪吃蛇跑满屏幕（顺手写了个贪吃蛇验证）</title><link>https://blog.linhui.fun/posts/tencent-2351614/</link><pubDate>Sat, 07 Sep 2019 00:00:00 +0800</pubDate><guid>https://blog.linhui.fun/posts/tencent-2351614/</guid><description>用A*算法让贪吃蛇跑满屏幕（顺手写了个贪吃蛇验证）。旧文归档，原始发表于 2019-09-07。</description></item><item><title>公共最长（连续）子串</title><link>https://blog.linhui.fun/posts/tencent-2351619/</link><pubDate>Mon, 06 May 2019 00:00:00 +0800</pubDate><guid>https://blog.linhui.fun/posts/tencent-2351619/</guid><description>公共最长（连续）子串。旧文归档，原始发表于 2019-05-06。</description></item><item><title>浮点数加减法过程模拟（C语言）</title><link>https://blog.linhui.fun/posts/tencent-2351610/</link><pubDate>Mon, 29 Apr 2019 00:00:00 +0800</pubDate><guid>https://blog.linhui.fun/posts/tencent-2351610/</guid><description>浮点数加减法过程模拟（C语言）。旧文归档，原始发表于 2019-04-29。</description></item></channel></rss>