Longest substrings without repeating characters: Difference between revisions
Content deleted Content added
No edit summary |
|||
Line 24: | Line 24: | ||
del(strOK,n) |
del(strOK,n) |
||
ok |
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 |
next |
||