最长不重复子串
2018-11-11 本文已影响0人
Ziyi_aaa8
尝试刷题的时候更新下有价值的Medium和Hard难度的题
这里从第三题开始（从字符串中得到不重复子串的最长）
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.
解答如下
```python
print(a)
```
