<?xml version="1.0" encoding="utf-8"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"><channel><title>MagicLen</title><link>https://magiclen.org/cn/tag/string-search/</link><description>多元化原创文章，内容包罗万象，有编程语言、网站应用、软件介绍、硬件介绍、操作系统、旅行游记、专题采访、益智问题、文学创作，以及作者们的知识分享和作品分享。</description><language>zh-CN</language><lastBuildDate>Sun, 22 Nov 2026 19:11:43 +0800</lastBuildDate><atom:link href="https://magiclen.org/cn/tag/string-search/feed/" rel="self" type="application/rss+xml"/><sy:updatePeriod>hourly</sy:updatePeriod><sy:updateFrequency>8</sy:updateFrequency><sy:updateBase>1970-01-01T00:00+00:00</sy:updateBase><item><title>写程序的基本功：搜索算法(Search Algorithm)</title><link>https://magiclen.org/cn/search-algorithm/</link><description><![CDATA[<img src="https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-220x162.png" srcset="https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-220x162.png 1x, https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-440x324.png 2x, https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-660x486.png 3x" alt>
这里所称的搜索(Search)，是指在一个已排序好或是尚未排序好的集合中，将指定元素的键值(key)或是索引值(index)搜索出来，或者是给定某个条件，在集合中搜索出符合该条件的数据。在集合内搜索元素的方法当然不会只有一种，而不同方法搜索数据的难易度、速度和其它特性自然也会有所不同。搜索算法(Search Algorithm)就是搜索数据的方法，目前已知的方法有很多，在这篇文章中将会整理本站所介...]]></description><category>研究分享</category><category>算法</category><category>字符串搜索</category><category>搜索算法</category><category>写程序的基本功</category><guid>https://magiclen.org/cn/search-algorithm</guid><pubDate>Wed, 22 May 2019 12:00:45 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>暴力字符串搜索(Brute-force Substring Search)算法，简单粗暴地在一个字符串中寻找子字符串</title><link>https://magiclen.org/cn/brute-force-substring-search/</link><description><![CDATA[<img src="https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-220x162.png" srcset="https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-220x162.png 1x, https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-440x324.png 2x, https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-660x486.png 3x" alt>
暴力字符串搜索(Brute-force Substring Search)算法是最基本的字符串搜索算法。它可以按照原文中字符的顺序，逐一与搜索样本(pattern)进行比对，判断目前的搜索位置是否就是搜索样本存在的位置。]]></description><category>研究分享</category><category>Go</category><category>Java</category><category>Rust</category><category>算法</category><category>JavaScript</category><category>Java</category><category>JavaScript</category><category>字符串搜索</category><category>暴力字符串搜索</category><category>Rust</category><category>搜索算法</category><category>TypeScript</category><category>Go</category><guid>https://magiclen.org/cn/brute-force-substring-search</guid><pubDate>Mon, 20 May 2019 12:00:22 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>如何使用 Node.js 快速搜索字符串？</title><link>https://magiclen.org/cn/node-js-fast-string-search/</link><description><![CDATA[<img src="https://magiclen.org/wp-content/uploads/2017/08/nodejs-napi-220x162.png" srcset="https://magiclen.org/wp-content/uploads/2017/08/nodejs-napi-220x162.png 1x, https://magiclen.org/wp-content/uploads/2017/08/nodejs-napi-440x324.png 2x, https://magiclen.org/wp-content/uploads/2017/08/nodejs-napi-660x486.png 3x" alt>
字符串搜索是开发程序的时候时常会碰到的议题，由于常用，所以了解一个有效率进行字符串搜索的方式是很重要的。Node.js 使用的 Chrome V8 JavaScript 引擎对于字符串处理的性能已经十分良好，在很多情况下只要很直觉地使用原生的 JavaScript 或 Node.js 的功能就可以达成最佳效果了。像是字符串搜索，JavaScript 的字符串本身就有「indexOf」方法可以使用，...]]></description><category>C &amp; C++</category><category>JavaScript</category><category>Boyer-Moore-MagicLen</category><category>C/C++</category><category>JavaScript</category><category>字符串搜索</category><category>node.js</category><category>Node-API</category><category>fast-string-search</category><guid>https://magiclen.org/cn/node-js-fast-string-search</guid><pubDate>Tue, 8 Aug 2017 00:00:08 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>Boyer-Moore-MagicLen(BM-MagicLen) 字符串搜索算法，超快速的全文搜索算法</title><link>https://magiclen.org/cn/boyer-moore-magiclen/</link><description><![CDATA[<img src="https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-220x162.png" srcset="https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-220x162.png 1x, https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-440x324.png 2x, https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-660x486.png 3x" alt>
Boyer-Moore-MagicLen 是笔者结合 Boyer-Moore-Horspool 和 Quick Search Algorithm 得出的字符串搜索算法。这篇文章会从 Boyer-Moore 算法讲起，再说明 Boyer-Moore-MagicLen 的概念、过程、程序实作与复杂度。]]></description><category>研究分享</category><category>Go</category><category>Java</category><category>Rust</category><category>算法</category><category>JavaScript</category><category>Boyer-Moore</category><category>Boyer-Moore-Horspool</category><category>Boyer-Moore-MagicLen</category><category>Java</category><category>JavaScript</category><category>Quick Search Algorithm</category><category>字符串搜索</category><category>Rust</category><category>搜索算法</category><category>TypeScript</category><category>Go</category><guid>https://magiclen.org/cn/boyer-moore-magiclen</guid><pubDate>Sat, 9 Apr 2016 21:19:58 +0800</pubDate><dc:creator>Magic Len</dc:creator></item></channel></rss>