本文始发于个人公众号:TechFlow 今天和大家聊的问题叫做最长不重复子串,这道题很有意思,我们先来看题面: 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 ...