# I am the Watcher. I am your guide through this vast new twtiverse.
# 
# Usage:
#     https://watcher.sour.is/api/plain/users              View list of users and latest twt date.
#     https://watcher.sour.is/api/plain/twt                View all twts.
#     https://watcher.sour.is/api/plain/mentions?uri=:uri  View all mentions for uri.
#     https://watcher.sour.is/api/plain/conv/:hash         View all twts for a conversation subject.
# 
# Options:
#     uri     Filter to show a specific users twts.
#     offset  Start index for quey.
#     limit   Count of items to return (going back in time).
# 
# twt range = 1 1
# self = https://watcher.sour.is/conv/eevb7ua
yue-fang-readfog
feeds.twtxt.net
View Thread
徹底理解字符串匹配 KMP 算法**
大家好，我是小風哥，今天簡單聊聊字符串匹配 kmp 算法。字符串匹配是計算機科學中非常基礎的操作，給定兩個字符串 a 和 b，我們需要判斷字符串 a 是否包含字符串 b。像你我這樣的普通程序員能想到的最簡單方法是這樣的，用字符串 b 不斷去匹配每個主串中的子串。 假設給定這樣兩個字符串：首先從主串的第一個位置和子串的第一個位置去匹配，我們發現 A 和 B 不相同：因此主串指針後移一位，子串重新從 ⌘ Read more