LeetCode 3. Longest Substring Without Repeating Characters

//C++
int lengthOfLongestSubstring(string s) 
 {
    int max = 0;
	for (int i = 0; i < s.size(); i++)
	{
		string str = "";
		str += s[i];
		int j = i+1;
		while ((j<s.size())&&(s[i] != s[j]))
		{
			str += s[j];
		    j++;
		}
		for (int m = 0; m < str.size(); m++)
		{
			for (int n = m+1; n < str.size(); n++)
			{
				if(str[m]==str[n])
					str = str.substr(0, n);
			}
		}
    
		if (max < str.size())
			max = str.size();
    }
        return max;
}

//Java
class Solution {
    public int lengthOfLongestSubstring(String s) {
        int l=0;
        if(s.length()<=1)
            return s.length();
        for(int i=0;i<s.length()-1;i++)
        {
            char c=s.charAt(i);
            String s1=""+c;
            int j=i+1;
            int x=0;
            if(c==s.charAt(j))
            {
                x=1;
            }
            while(j<s.length()&&s.charAt(j)!=s.charAt(i))
            {
                s1=s1+s.charAt(j);
                boolean re=true;
                for(int m=0;m<s1.length()-1;m++)
                {
                    if(s1.charAt(m)==s1.charAt(s1.length()-1))
                        re=false;
                }
                if(re)
                {
                     x=s1.length();
                    j++;
                }
                else
                {
                    x=s1.length()-1;
                    break;
                }
            }
            if(l<x)
                l=x;
        }
        return l;
    }
}