-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path3.py
78 lines (52 loc) · 1.95 KB
/
3.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
71
72
73
74
75
76
77
78
'''3. Longest Substring Without Repeating Characters
Created on 2024-12-09 14:33:00
2024-12-09 15:18:08
@author: MilkTea_shih
'''
#%% Packages
#%% Variable
#%% Functions
class Solution_single_loop:
def lengthOfLongestSubstring(self, s: str) -> int:
last_seen_table: dict[str, int] = {} #key: string, value: index
last_index: int = -1 # The length from begin to index is `index + 1`.
result: int = 0
for index, string in enumerate(s):
last_index = max(last_seen_table.get(string, -1), last_index)
result = max(index - last_index, result)
last_seen_table[string] = index
return result
class Solution_reference:
def lengthOfLongestSubstring(self, s: str) -> int:
substring_start: int = 0
string_table: dict[str, int] = {} #key: string, value: count
result: int = 0
for index, string in enumerate(s):
string_table[string] = string_table.get(string, 0) + 1
while string_table[string] > 1:
string_table[s[substring_start]] -= 1
substring_start += 1
result = max(index - substring_start + 1, result)
return result
class Solution:
def lengthOfLongestSubstring(self, s: str) -> int:
substring_start: int = 0
substring: set[str] = set()
result: int = 0
for string in s:
if string in substring:
result = max(len(substring), result)
#remove all elements before `string` in `substring`
while s[substring_start] != string:
substring.remove(s[substring_start])
substring_start += 1
substring_start += 1
else:
substring.add(string)
return max(len(substring), result)
#%% Main Function
Solution().lengthOfLongestSubstring("abcabcbb")
#%% Main
if __name__ == '__main__':
pass
#%%