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