Longest common substring: Difference between revisions

m
Line 1,566:
<syntaxhighlight lang="pascal">
PROGRAM LongestCommonSubString.pas;
 
 
{$IFDEF FPC}
Line 1,605 ⟶ 1,606:
BEGIN
lcss := '' ;
 
FOR j lcss := 0 TO length ( S1'' ) DO;
 
FOR j := 0 TO length ( S1 ) DO BEGIN
FOR k := length ( S1 ) - j DOWNTO 1 DO BEGIN
BEGIN
 
S := S1 [ ( j + 1 ) .. ( k + j + 1 ) ] ;
IF ( pos ( S, S2 ) > 0 ) AND
( length ( S ) > length ( lcss ) ) THEN BEGIN
BEGIN
lcss := S ;
BREAK ;
END ;
 
END ;
 
END ;
 
 
END;
END ; (*) FUNCTION lcss (*)
 
 
Line 1,645 ⟶ 1,642:
BEGIN
IF ParamCount = 2 THEN BEGIN
 
BEGIN
 
S1 := IFF( ( ParamStr ( 1 ) > '' ), ParamStr ( 1 ) , S1 );
Line 1,661 ⟶ 1,656:
WriteLn ( Lcss ( S1, S2 ) ) ;
END. (*) Of PROGRAM LongestCommonSubString.pas (*)
END.
 
(*)
</syntaxhighlight>
122

edits