Longest substrings without repeating characters: Difference between revisions
Content deleted Content added
No edit summary |
|||
Line 40:
for m = 1 to len(strOK[n])
for p = m+1 to len(strOK[n])
if strOK[n][m] = strOK[n][p]
flag = 0
exit
ok
next
next
| |||