题目内容

设有两个串S1和S2,求S1在S2中首次出现的位置的运算称为( )。

A. 求子串
B. 判断是否相等
C. 链接
D. 模式匹配

查看答案
更多问题

KMP 算法的特点是在模式匹配时指示主串的指针( )。

A. 不会变
B. 会变小
C. 有可能
D. 无法判断

设主串的长度为n,子串的长度为m,则KMP配算法的时间复杂度为()。

A. O(m)
B. O(n)
C. O(mn)
D. O(m+n)

已知串 S='aaab',其 next数组值为( )。

A. 0123
B. 0112
C. 0231
D. 1211

Directions:In this section, you will hear three passages. At the end of each passage, you willhear three or four questions. Both the passage and the questions will be spoken onlyonce. After you hear a question, you must choose the best answer from the fourchoices marked A), B), C), D).Questions 16 to 18 are based on the passage you have just heard.[音频]16

A. How space research benefits people on Earth.
B. When the International Space Station was built.
C. How many space shuttle missions there will be.
D. When America's earliest space program started.

答案查题题库