Anonymous user
Longest substrings without repeating characters: Difference between revisions
Longest substrings without repeating characters (view source)
Revision as of 19:53, 22 June 2021
, 2 years ago→{{header|REXX}}: matched an invocation to the procedure name.
m (→{{header|REXX}}: matched an invocation to the procedure name.) |
|||
Line 398:
x= /*X: the substring, less the 1st char*/
do k=j+1 to L; x= x || substr($, k, 1) /*search for the max length substrings.*/
if \
_= length(x); if _<maxL then iterate /*is length less then the current max? */
@._= @._ x; maxL= _ /*add this substring to the max list. */
| |||