<?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/tags/%E7%AE%97%E6%B3%95/</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/tags/%E7%AE%97%E6%B3%95/index.xml" rel="self" type="application/rss+xml"/><item><title>根据时间戳生成消息号算法设计</title><link>https://blog.linhui.fun/posts/message-id-slots/</link><guid>https://blog.linhui.fun/posts/message-id-slots/</guid><description>根据时间戳生成消息号算法设计。原始时间：约 2026 年 9 月，具体日期不详。</description></item><item><title>分布式一致性算法-关于Paxos算法的理解</title><link>https://blog.linhui.fun/posts/tencent-2351650/</link><pubDate>Sat, 03 Sep 2022 00:00:00 +0800</pubDate><guid>https://blog.linhui.fun/posts/tencent-2351650/</guid><description>分布式一致性算法-关于Paxos算法的理解。旧文归档，原始发表于 2022-09-03。</description></item><item><title>令牌桶算法和分布式集群分级流控（服务降级）</title><link>https://blog.linhui.fun/posts/tencent-2351651/</link><pubDate>Tue, 16 Aug 2022 00:00:00 +0800</pubDate><guid>https://blog.linhui.fun/posts/tencent-2351651/</guid><description>令牌桶算法和分布式集群分级流控（服务降级）。旧文归档，原始发表于 2022-08-16。</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>分布式一致性算法-RAFT算法的理解和SOFA-RAFT的改进</title><link>https://blog.linhui.fun/posts/tencent-2351632/</link><pubDate>Mon, 21 Feb 2022 00:00:00 +0800</pubDate><guid>https://blog.linhui.fun/posts/tencent-2351632/</guid><description>分布式一致性算法-RAFT算法的理解和SOFA-RAFT的改进。旧文归档，原始发表于 2022-02-21。</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>用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></channel></rss>