设有两个串p和q,其中q是p的子串,求q在p中首次出现的位置的算法称为( )。A、求子串B、联接C、模式匹配D、求串长
设有两个串p和q,其中q是p的子串,求q在p中首次出现的位置的算法称为( )。
A、求子串
B、联接
C、模式匹配
D、求串长
相关考题:
设有两个串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 substringB.联接 ConcatenationC.匹配 MatchingD.求串长 Seeking length
1、设有两个串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 substringB.联接 ConcatenationC.匹配 MatchingD.求串长 Seeking length
【单选题】设有两个串p和q,其中q是p的子串,q在p中首次出现的位置的算法称为()。A.求子串B.连接C.匹配D.求串长