<?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/%E6%95%B0%E7%BB%84/</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/%E6%95%B0%E7%BB%84/index.xml" rel="self" type="application/rss+xml"/><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>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>公共最长（连续）子串</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></channel></rss>