类 KMP
- java.lang.Object
-
- edu.princeton.cs.algs4.KMP
-
public class KMP extends java.lang.ObjectTheKMPclass finds the first occurrence of a pattern string in a text string.This implementation uses a version of the Knuth-Morris-Pratt substring search algorithm. The version takes time proportional to n + m R in the worst case, where n is the length of the text string, m is the length of the pattern, and R is the alphabet size. It uses extra space proportional to m R.
For additional documentation, see Section 5.3 of Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.
-
-
方法概要
修饰符和类型 方法 说明 static voidmain(java.lang.String[] args)Takes a pattern string and an input string as command-line arguments; searches for the pattern string in the text string; and prints the first occurrence of the pattern string in the text string.intsearch(char[] text)Returns the index of the first occurrrence of the pattern string in the text string.intsearch(java.lang.String txt)Returns the index of the first occurrrence of the pattern string in the text string.
-
-
-
方法详细资料
-
search
public int search(java.lang.String txt)
Returns the index of the first occurrrence of the pattern string in the text string.- 参数:
txt- the text string- 返回:
- the index of the first occurrence of the pattern string in the text string; N if no such match
-
search
public int search(char[] text)
Returns the index of the first occurrrence of the pattern string in the text string.- 参数:
text- the text string- 返回:
- the index of the first occurrence of the pattern string in the text string; N if no such match
-
main
public static void main(java.lang.String[] args)
Takes a pattern string and an input string as command-line arguments; searches for the pattern string in the text string; and prints the first occurrence of the pattern string in the text string.- 参数:
args- the command-line arguments
-
-