-
Notifications
You must be signed in to change notification settings - Fork 0
/
Longest_Distinct_characters_in_string.py
46 lines (40 loc) · 1.21 KB
/
Longest_Distinct_characters_in_string.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
"""
Given a string S, find the length of the longest substring with all distinct characters.
Example: Input: S = "geeksforgeeks"
Output: 7
Explanation: "eksforg" is the longest substring with all distinct characters.
Expected Time Complexity: O(|S|).
Expected Auxiliary Space: O(K), where K is Constant.
Constraints:
1<=|S|<=105
"""
class Solution:
def longestSubstrDistinctChars(self, S):
if len(set(S)) == len(S): return len(S)
i = 0
j = 1
maxlen = 0
while j<len(S)+1:
strx = S[i:j]
lenx = len(strx)
if lenx == len(set(strx)):
j += 1
if lenx>maxlen:
maxlen=lenx
else:
i += 1
return maxlen
# second way
class Solution:
def longestSubstrDistinctChars(self, S):
last_idx = {}
max_len = 0
start_idx = 0
for i in range(0, len(S)):
if S[i] in last_idx:
start_idx = max(start_idx, last_idx[S[i]] + 1)
# print("start", start_idx)
max_len = max(max_len, i-start_idx + 1)
# print("max", max_len)
last_idx[S[i]] = i
return max_len