LeetCode #3: Longest Substring Without Repeating Characters

Problem Statement

(Problem Link) Given a string, find the length of the longest substring without repeating characters.

Examples:

Given "abcabcbb", the answer is "abc", which the length is 3.

Given "bbbbb", the answer is "b", with the length of 1.

Given "pwwkew", the answer is "wke", with the length of 3. Note that the answer must be a substring, "pwke" is a subsequence and not a substring.

Approach 1

class Solution(object):
    def lengthOfLongestSubstring(self, s):
        """
        :type s: str
        :rtype: int
        """
        if not s:
            return 0

        se = set([s[0]])
        res = 1
        lo, hi = 0, 1
        n = len(s)
        while hi < n:
            if s[hi] in se:
                while lo < hi:
                    se.remove(s[lo])
                    lo += 1
                    if s[lo - 1] == s[hi]:
                        break

            se.add(s[hi])
            res = max(res, len(se))
            hi += 1

        return res

Approach 2

class Solution:
    # @param {string} s
    # @return {integer}
    def lengthOfLongestSubstring(self, s):
        if not s:
            return 0

        res = 1  
        start, n = 0, len(s)
        used = {}
        for i in xrange(n):
            if s[i] in used and used[s[i]] >= start:
                start = used[s[i]] + 1
            else:
                res = max(res, i - start + 1)
            used[s[i]] = i

        return res