[LeetCode] 3. Longest Substring Without Repeating Characters_Medium tag: two pointers

本文主要是介绍[LeetCode] 3. Longest Substring Without Repeating Characters_Medium tag: two pointers，对大家解决编程问题具有一定的参考价值，需要的程序猿们随着小编来一起学习吧！

Given a string s, find the length of the longest substring without repeating characters.

Example 1:

Input: s = "abcabcbb"
Output: 3
Explanation: The answer is "abc", with the length of 3.

Example 2:

Input: s = "bbbbb"
Output: 1
Explanation: The answer is "b", with the length of 1.

Example 3:

Input: s = "pwwkew"
Output: 3
Explanation: The answer is "wke", with the length of 3.
Notice that the answer must be a substring, "pwke" is a subsequence and not a substring.

Example 4:

Input: s = ""
Output: 0

Constraints:

• 0 <= s.length <= 5 * 104
• s consists of English letters, digits, symbols and spaces.

Ideas:

visited record the letters we see so far in the range[l, r], if s[r] not in visited, r += 1, else continue l += 1 until s[r] not in visited

Code:

class Solution:
    def lengthOfLongestSubstring(self, s: str) -> int:
        ans, l, r, visited = 0, 0, 0, set()
        while r < len(s):
            if s[r] not in visited:
                visited.add(s[r])
                r += 1
            else:
                while s[r] in visited:
                    l_c = s[l]
                    visited.remove(l_c)
                    l += 1
            ans = max(ans, r - l)
        return ans

这篇关于[LeetCode] 3. Longest Substring Without Repeating Characters_Medium tag: two pointers的文章就介绍到这儿，希望我们推荐的文章对大家有所帮助，也希望大家多多支持为之网！