3. Longest Substring Without Repeating Characters

3. Longest Substring Without Repeating Characters

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

Example 1:
Input: “abcabcbb”
Output: 3
Explanation: The answer is “abc”, with the length of 3.

Example 2:
Input: “bbbbb”
Output: 1
Explanation: The answer is “b”, with the length of 1.

Example 3:
Input: “pwwkew”
Output: 3
Explanation: 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.

slide window

如果判断Sij是否有重复，不需要i到j之间每个都判断，只需要在Sij-1的基础上判断Sj是不是有重复，如果重复就将i向后推一位，开始判断Si+1j是否重复，如果不重复，就继续将j向后推一位开始判断。而判断是否重复的过程可以用集合（i看作头，j看作尾）

class Solution {
    public int lengthOfLongestSubstring(String s) {
        int max=0,i=0,j=0;
        int n=s.length();
        Set<Character> set=new HashSet<>();
        while(i<n&&j<n){
            if(set.contains(s.charAt(j)))
            {
                set.remove(s.charAt(i));
                i++;
            }
            else{
                set.add(s.charAt(j));
                j++;
                max=Math.max(max,j-i);
            }
        }
        return max;
    }
}

class Solution:
    def lengthOfLongestSubstring(self, s: str) -> int:
        se = set()
        n = len(s)
        m=0
        i=0
        j=0
        while(i<n and j<n):
            if(s[j] in se):
                se.remove(s[i])
                i=i+1
            else:
                se.add(s[j])
                j=j+1
                m=max(m,j-i)
        return m