leetcode_python/longestStrWithoutReaptingChar.py at main · xcosmos6/leetcode_python · GitHub

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
def lengthOfLongestSubstring(s):
    """
    :type s: str
    :rtype: int
    """
    clist = []
    longest = 0
    charDict = {}
    start = 0
    for c in range(len(s)):
        n = s[c]
        if n in charDict:
            start = max(charDict[n] + 1, start)
            # clist.append(n)
        # else:
        clength = c - start + 1
        if clength > longest:
            longest = clength
            # clength = len(clist)
            # if clength > longest:
            #     longest = clength
            # clist = list(s[start:c + 1])
        charDict[n] = c
    # clength = len(clist)
    # if clength > longest:
    #     longest = clength
    return longest


if __name__ == '__main__':
    s = 'tmmzuxt'
    length = lengthOfLongestSubstring(s)
    print(length)

# class Solution(object):
#     def lengthOfLongestSubstring(self, s):
#         """
#         :type s: str
#         :rtype: int
#         """
#         clist = []
#         longest = 0
#         charDict = {}
#         for c in range(len(s)):
#             n = s[c]
#             # if n not in charDict:
#             #     charDict[n] = c
#             # else:
#             #     charDict[n] = c
#             if n not in clist:
#                 clist.append(n)
#             else:
#                 clength = len(clist)
#                 if clength > longest:
#                     longest = clength
#                 start = charDict[n] + 1
#                 clist = list(s[start:c + 1])
#             charDict[n] = c
#         clength = len(clist)
#         if clength > longest:
#             longest = clength
#         return longest