问个问题, 关于字符串patter matching 复杂度# JobHunting - 待字闺中
t*2
1 楼
请问, 关于patter matching 复杂度:
如果, pattern size is M, string length is N,
the worst complexity of the best algorithm is: O(M+N)
对不对, 多谢!
如果, pattern size is M, string length is N,
the worst complexity of the best algorithm is: O(M+N)
对不对, 多谢!