-
Notifications
You must be signed in to change notification settings - Fork 0
/
longest_substring_lc3.py
70 lines (59 loc) · 1.7 KB
/
longest_substring_lc3.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
class Solution:
def lengthOfLongestSubstring(self, s: str) -> int:
if s == "":
return 0
if len(s) == 1:
return 1
a_pointer = 0
b_pointer = 0
max_length = 0
seen = {}
while b_pointer < len(s):
char = s[b_pointer]
if char not in seen:
seen[char] = True
b_pointer += 1
max_length = max(max_length, len(seen.keys()))
else:
seen.pop(s[a_pointer])
a_pointer += 1
return max_length
class Solution:
def lengthOfLongestSubstring(self, s: str) -> int:
if s == "":
return 0
if len(s) == 1:
return 1
max_length = 0
while len(s) > 0:
temp_max = 0
seen = {}
for i in s:
if i in seen:
break
else:
temp_max += 1
seen[i] = True
max_length = max(max_length, temp_max)
s = s[1:]
return max_length
class Solution:
def lengthOfLongestSubstring(self, s: str) -> int:
if s == "":
return 0
if len(s) == 1:
return 1
max_length = 0
chars = list(s)
while len(chars) > 0:
temp_max = 0
seen = {}
for i in chars:
if i in seen:
break
else:
temp_max += 1
seen[i] = True
max_length = max(max_length, temp_max)
chars.pop(0)
return max_length