Longest Substring Without Repeating Characters

From LeetCode No.3;

Tier:Medium

Content:

Given a string, find the length of the longest substring without repeating characters.

Example 1:

Input: “abcabcbb”
Output: 3
Explanation: The answer is “abc”, with the length of 3.

Example 2:

Input: “bbbbb”
Output: 1
Explanation: The answer is “b”, with the length of 1.

Example 3:

Input: “pwwkew”
Output: 3
Explanation: 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.

A Solution With Java：

class Solution {
    public int lengthOfLongestSubstring(String s) {
        String sub=new String("");
        int num=0,a=0;
        for(int i=0;i<s.length();i++){
            if(sub.contains(s.charAt(i)+"")){
                int m=0;
                while(sub.charAt(m)!=s.charAt(i)) m++;
                if(a>num)
                    num=a;
                sub=sub.substring(m+1)+s.charAt(i);
                a=sub.length();
            }else{
                sub+=s.charAt(i);
                a++;
            }
        }
        if(a>num) num=a;
        return num;
    }
}

Thanks For Your Reading.