3. 无重复字符的最长子串

思路：采用滑动窗口  复杂度o（n2）

class Solution {

    public int lengthOfLongestSubstring(String s) {

 

            int n=s.length();   

            if(n==1)

            {

                return 1;

            }

            int max=0;

            for(int i=0,j=0;j<n;j++)

            {

                

                for(int q=j-1;q>=i;q--)

                {

                    if(s.charAt(q)==s.charAt(j))

                    {

                        i=q+1;

                        if(j-i+1>max)

                        {

                            max=j-i+1;

                        }

                        break;

                    }

                    if(q==i)

                    {

                        if(j-i+1>max)

                        {

                            max=j-i+1;

                        }

                    }

                }

            }

            return max;

    }

}