设有两个串p和q,其中q是p的子串,求q在p中首次出现的位置的算法称为()(单选) There are two strings p q, q is p’s substring. The algorithm to search the first time q appeared in p is called ()(There is only one correct answer)
A、求子串 Seeking substring
B、联接 Concatenation
C、匹配 Matching
D、求串长 Seeking length
查看答案
更多“设有两个串p和q,其中q是p的子串,求q在p中首次出现的位置的算法称为()(单选) There are two strings p q, q is p’s substring. The algorit…”相关的问题