LeetCode第3题

3. Longest Substring Without Repeating Characters
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.

Subscribe to see which companies asked this question

解题思路：
维护一个窗口，每次关注窗口中的字符串，在每次判断中，左窗口和右窗口选择其一向前移动。同样是维护一个HashSet, 正常情况下移动右窗口，如果没有出现重复则继续移动右窗口，如果发现重复字符，则说明当前窗口中的串已经不满足要求，继续移动有窗口不可能得到更好的结果，此时移动左窗口，直到不再有重复字符为止，中间跳过的这些串中不会有更好的结果，因为他们不是重复就是更短。因为左窗口和右窗口都只向前，所以两个窗口都对每个元素访问不超过一遍，因此时间复杂度为O(2*n)=O(n),是线性算法。空间复杂度为HashSet的size,也是O(n).
代码如下：

public class Solution {
    public int lengthOfLongestSubstring(String s) {
        if(s == null || s.length() == 0)
        return 0;
        int m = 0;
        int start = 0;
        int end = 0;
        HashSet<Character> set = new HashSet<Character>();
        while(end < s.length()){
            if(set.contains(s.charAt(end))){
                if(m < end - start){
                    m = end - start;
                }
                while(s.charAt(start) != s.charAt(end)){
                    set.remove(s.charAt(start));
                    start++;
                }
                start++;
            }
            else{
                set.add(s.charAt(end));
            }
            end++;
        }
        m = Math.max(m,end-start);
        return m;
    }
}