Longest substrings without repeating characters: Difference between revisions
Content added Content deleted
m (→{{header|REXX}}: updated the output.) |
m (→{{header|REXX}}: simplified the code.) |
||
Line 83:
do k=j+1 to L; x= x || substr($, k, 1) /*search for the max length substrings.*/
if \okx(x) then iterate j /*Are there an replications? Skip it. */
@._=
end /*k*/
end /*j*/
|