【LeetCode OJ】Longest Substring Without Repeating Characters

题目链接：https://leetcode.com/problems/longest-substring-without-repeating-characters/

题目：Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest substring is "b", with the length of 1.

解题思路：维护一个窗口，每次关注窗口中的字符串，维护一个HashSet，每扫描一个字符，如果HashSet中包含该字符，则移动左边窗口至重复字符的下一个字符，如果HashSet中没有改字符，则移动右边窗口。时间负复杂度为O(n)，空间复杂度也为O(n)。具体代码如下：

public class Solution
{
    public static void main(String[] args)
    {
        String str="abcbbc";
        System.out.println(lengthOfLongestSubstring(str));
    }
    public static int lengthOfLongestSubstring(String s) 
    {
         if(s==null && s.length()==0)
                return 0;
            HashSet<Character> set = new HashSet<Character>();
            int max = 0;     //最大不重复字符串长度
            int left = 0;     //不重复字符串起始位置
            int right = 0;    //不重复字符串结束为止
            while(right<s.length())
            {
                //如果集合中包含当前所指的字符
                if(set.contains(s.charAt(right)))
                {
                    //获取当前不重复字符串的长度，如果大于max，则将max值替换
                    if(max<right-left)
                    {
                        max = right-left;
                    }
                    //将left移动到第一个重复的字符后面
                    while(s.charAt(left)!=s.charAt(right))
                    {
                        set.remove(s.charAt(left));
                        left++;
                    }
                    left++;
                }
                else
                {
                    set.add(s.charAt(right));
                }
                right++;
            }
            max = Math.max(max,right-left);
            return max;
    }
}

 

转载于:https://www.cnblogs.com/xujian2014/p/4934183.html