算法基础练习-KMP字符串实现----number sequence
题不知道哪个平台有,根据王道机试指南的题:
Given two sequences of numbers : a[1], a[2], … , a[N], and b[1], b[2], … , b[M] (1 <= M <= 10000, 1 <= N <= 1000000). Your task is to find a number K which make a[K] = b[1], a[K + 1] = b[2], … , a[K + M - 1] = b[M]. If the
原创
2021-03-19 13:34:30 ·
72 阅读 ·
0 评论