单项选择题

In the KMP algorithm, when a comparison fails at P[j] (the jth character of the pattern string P), the next aligned position would be
KMP算法的过程中,若某次比对在模式串P的第j个位置P[j]处失败,则将对齐位置换为:

A.prev[j]
B.next[j]
C.prev[j] + 1
D.next[j] + 1