Rosetta Code

Longest substrings without repeating characters: Difference between revisions

Page Discussion

Longest substrings without repeating characters (view source)

Revision as of 07:24, 27 May 2021

212 bytes removed ,  3 years ago
→‎{{header|Ring}}
No edit summary
Line 24:
del(strOK,n)
ok
next
 
for n = 1 to len(strOK)
for m = 1 to len(strOK)-1
if len(strOK[m+1]) > len(strOK[m])
temp = strOK[m]
strOK[m] = strOK[m+1]
strOK[m+1] = temp
ok
next
next
 
CalmoSoft
2,468

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/312422"