Naive字符串匹配算法的实现

Question

我发现了一个非常有用的关于 Naive 字符串算法的代码，它是用 python 编写的，但它似乎没有运行有什么问题？

def naive(p, t):
occurrences = []
for i in range(len(t) - len(p) + 1):  # loop over alignments
    match = True
    for j in range(len(p)):           # loop over characters
        if t[i+j] != p[j]:            # compare characters
            match = False             # mismatch; reject alignment
            break                     #goes back to the outer loop and start the next step of looping in the alignment
    if match:                         #if match remained true 
      occurrences.append(i)           # all chars matched; record
return occurrences

naive("asge","asgefjlso") #to run #但它不运行也不显示任何东西

谁能帮我解释一下 if t[i+j] != p[j] 是什么意思？

Answer 1

我假设你已经执行了与上面所附格式相同的代码，那么它不会因为缩进问题而运行，正确的代码与正确的缩进如下

def naive(p, t):
    occurrences = []
    for i in range(len(t) - len(p) + 1):  # loop over alignments
        match = True
        for j in range(len(p)):             # loop over characters
            if t[i+j] != p[j]:                # compare characters
                match = False                  # mismatch; reject alignment
                break                          #goes back to the outer loop 
                                               # and start the 
                                          #next 
                                         #step of looping in the alignment
    if match:                             #if match remained true 
        occurrences.append(i)               # all chars matched; record
    return occurrences