public class LongestCommonSubstring
extends Object
Compilation: javac LongestCommonSubstring.java
Execution: java LongestCommonSubstring file1.txt file2.txt
Dependencies: SuffixArray.java StdOut.java In.java
Reads in two text strings, replaces all consecutive blocks of
whitespace with a single space, and then computes the longest
common substring.
Assumes that the character '\1' does not appear in either text.
Perhaps, search for a character that does not appear in either text
(and make sure SuffixArray.java doesn't choose the same one).
% java LongestCommonSubstring tale.txt mobydick.txt
' seemed on the point of being '