<?xml version="1.0" encoding="utf-8"?><rss version="2.0" 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/tag/%E6%9A%B4%E5%8A%9B%E5%AD%97%E4%B8%B2%E6%90%9C%E5%B0%8B/feed</link><description>多元化原創文章，內容包羅萬象，有程式語言、網站應用、軟體介紹、硬體介紹、作業系統、旅行遊記、專題採訪、益智問題、文學創作，以及作者們的知識分享和作品分享。</description><language>zh-TW</language><lastBuildDate>Fri, 3 Apr 2026 22:36:27 +0000</lastBuildDate><sy:updatePeriod>hourly</sy:updatePeriod><sy:updateFrequency>8</sy:updateFrequency><sy:updateBase>1970-01-01T00:00+00:00</sy:updateBase><item><title>暴力字串搜尋(Brute-force Substring Search)演算法，簡單粗暴地在一個字串中尋找子字串</title><link>https://magiclen.org/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>Java</category><category>Rust</category><category>演算法</category><category>Go</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/brute-force-substring-search</guid><pubDate>Mon, 20 May 2019 12:00:22 +0800</pubDate><dc:creator>Magic Len</dc:creator></item></channel></rss>