tips:
kmp算法分两个步骤:
1)计算子串的next数组
2)匹配子串
conclusion:
其实求next数组和匹配子串是两个相似的过程
reference:
http://www.ruanyifeng.com/blog/2013/05/Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm.html
https://blog.csdn.net/your_answer/article/details/79619406
tips:
kmp算法分两个步骤:
1)计算子串的next数组
2)匹配子串
conclusion:
其实求next数组和匹配子串是两个相似的过程
reference:
http://www.ruanyifeng.com/blog/2013/05/Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm.html
https://blog.csdn.net/your_answer/article/details/79619406