贪心-python

1、3. 无重复字符的最长子串

    def lengthOfLongestSubstring(self, s: str) -> int:
        n, max_n, temp = 0, 0, ""

        for i in s:
            if i not in temp:
                temp += i
                n += 1
            else:
                if n > max_n:
                    max_n = n
                pos = temp.index(i)
                temp = temp[pos+1:] + i
                n = len(temp)

        if n > max_n:
            max_n = n
        return max_n