KMP 算法
摘要:
KMP算法核心 next函数:1.定义: next[k] =1) k = 1时,next[k] = 0;2) = max( k | { 1 < k < j ) { p[1...k-1] = p[j-k+1...j-1] }3) 其他情况 next[k] = 12.递推求解1) 定义,next[1] = 0, 假设next[j] = k, p[1..k-1] = p[j-k+1..j-1]2) 若p[j] = p[k], p[1..k] = p[j-k+1..j], next[j+1] = next[j] + 1 = k + 1;3) 若p[j] != p[k],匹配失败时 k = 阅读全文
posted @ 2012-07-20 15:05 more think, more gains 阅读(205) 评论(0) 推荐(0) 编辑