Longest substrings without repeating characters: Difference between revisions

Content added Content deleted
Line 616: Line 616:
if rpt - beg < max then continue
if rpt - beg < max then continue
if rpt - beg > max then max = rpt - beg : mda_clear
if rpt - beg > max then max = rpt - beg : mda_clear
mda_add(0) = mid(t, beg, rpt - beg)
mda_add(0) = mid(t, beg, max)
next
next
print : print ," The string: """;t;""""
print : print ," The string: """;t;""""