【入门夯实】简易匹配引擎：手写字符串查找的实现

local function naiveFind(text, pattern)
    for i = 1, #text do
        if text:sub(i, i) == pattern then
            return i
        end
    end
end

local function naiveFind(text, pattern)
    local n, m = #text, #pattern
    for i = 1, n - m + 1 do
        local ok = true
        for j = 1, m do
            if string.byte(text, i + j - 1) ~= string.byte(pattern, j) then
                ok = false
                break
            end
        end
        if ok then
            return i
        end
    end
    return nil
end
print(naiveFind("祖玛教主掉落了裁决之杖", "裁决之杖"))

local firstByte = string.byte(pattern, 1)
for i = 1, n - m + 1 do
    if string.byte(text, i) == firstByte then
        -- 进入逐字符比对
    end
end