Git-Mirrors/master-algorithms-py
1
0
Fork 0
mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-04-29 20:26:07 -04:00
Code Issues Packages Projects Releases Wiki Activity

Update and rename str-longest-non-repeating.py to longest_non_repeating.py

Browse Source
This commit is contained in:
marina 2023-08-07 17:36:23 -07:00 committed by GitHub
parent e54535ae2b
commit b9b5d8e21c
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 17 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
arrays_and_strings/str-longest-non-repeating.py → arrays_and_strings/longest_non_repeating.py
View File

@ -2,21 +2,16 @@
# -*- coding: utf-8 -*- # -*- coding: utf-8 -*-
# author: bt3gl # author: bt3gl
# find the length of the longest substring without repeating characters
def length_longest_substring(s) -> int:
def length_longest_substring(s: str) -> int:
result = "" result = ""
this_longest_string = "" this_longest_string = ""
i = 0 i = 0
for c in s: for c in s:
j = 0 j = 0
# this loop breaks if repeated
while j < len(this_longest_string): while j < len(this_longest_string):
if c == this_longest_string[j]: if c == this_longest_string[j]:
@ -26,17 +21,7 @@ def length_longest_substring(s: str) -> int:
j += 1 j += 1
# this loop continues creating the string
this_longest_string += c this_longest_string += c
return result, this_longest_string return result, this_longest_string
if __name__ == "__main__":
s = "abcabcbb"
print(length_longest_substring(s))
s = "dvdf"
print(length_longest_substring(s))