题目内容

12 StrIndex（‘DATASTRUCTURE'，‘STR'）=（）.

A. 5
B. 3
C. 4
D. 6

查看答案

搜索结果不匹配？点我反馈

更多问题

13 If the length of main body string is n and the length of pattern string is m, the time complexity of KMP algorithm for pattern matching is ( ).

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

14 StrIndex(‘Index of String’,1,‘Str’）=（）.

A. 10
B. 9
C. 8
D. 7

15 The return value of SubStr('I like University',8,3) is ( ).

A. Uni
B. ike
C. ver
D. ers

16 There are two strings p and q, q is p’s substring. The algorithm to search the first time q appeared in p is called ( )

A. Seeking substring
B. Concatenation
C. Matching
D. Seeking length