- 3. Longest Substring Without Rep
- 3. Longest Substring Without Rep
- 3. Longest Substring Without Rep
- 3. Longest Substring Without Rep
- 3. Longest Substring Without Rep
- 3. Longest Substring Without Rep
- 3. Longest Substring Without Rep
- 3. Longest Substring Without Rep
- 3. Longest Substring Without Rep
- 3. Longest Substring Without Rep
题目：给定字符串，查找最长子串的长度而无重复字符。（注意：子串必须是相连的字符）
思路：使用两个指针构成一个滑动窗口，不断检查窗口后的第一个字符，若此字符与窗口内字符都不一样则将窗口增大（并将此字符添加到子串里）。若此字符与窗口内字符有一样的字符，则将窗口起始点移到重复字符之后，重新滑动
注意：字符串''长度为0，字符串' '长度为1.
网友评论