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: | Line 83: | ||
do k=j+1 to L; x= x || substr($, k, 1) /*search for the max length substrings.*/ |
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. */ |
if \okx(x) then iterate j /*Are there an replications? Skip it. */ |
||
_= length(x); if _<maxL then iterate /*is length less then the current max? */ |
|||
_= |
@._= @._ x; maxL= _ /*add this substring to the max list. */ |
||
@._= @._ ss; maxL= _ /*add this substring to the max list. */ |
|||
end /*k*/ |
end /*k*/ |
||
end /*j*/ |
end /*j*/ |
||