从一个字符串中找到一个连续子串，该子串中任何两个字符不能相同，求子串的最大长度并输出一条最长不重复子串。(From a string to find a continuous substring, any two characters cannot be the same substring, the maximum length of her series and output a maximum repeat substring.)