LeetCode-003-无重复字符的最长子串

题目：

解答：

class Solution {
    public int lengthOfLongestSubstring(String s) {
        int count =0,len=s.length();
    	if(len<=1) return len;
    	char[] alphabet = new char[len];
    	for(int i=0;i<len;i++)
    	{
    		alphabet[i]=s.charAt(i);
    	}
    	ArrayList<Character> ls = new ArrayList<>();
    	int length=0,max=-1;
    	while(count<len)
    	{
    		int i;
    		for(i=count;i<len;i++)
    		{
        		if(ls.contains(alphabet[i]))
        		{
        			if(length>max)
        			{
        				max=length;
        			}
    				break;
        		}
        		else
        		{
        			ls.add(alphabet[i]);
        			length++;
        		}
    		}
    		if(i==len&&length>max)
    		{
    			max=length;
    		}
    		length=0;
    		count++;
    		ls.clear();
    	}
        return max;
    }
}