[LeetCode-py-0003] Longest Substring Without Repeating Characters

原文

Given a string, find the length of the longest substring without repeating characters.

Example 1:

1
2
3
Input: "abcabcbb"
Output: 3
Explanation: The answer is "abc", with the length of 3.

Example 2:

1
2
3
Input: "bbbbb"
Output: 1
Explanation: The answer is "b", with the length of 1.

Example 3:

1
2
3
4
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.

翻译


--------------------本文至此结束  感谢您的阅读--------------------

本文标题:[LeetCode-py-0003] Longest Substring Without Repeating Characters

文章作者:Memento

发布时间:2019年05月29日 - 15:05

最后更新:2019年12月12日 - 22:12

原始链接:http://memento.net.cn/post/533ccb7d.html

许可协议: 署名-非商业性使用-禁止演绎 4.0 国际 转载请保留原文链接及作者。

Memento wechat
欢迎您扫一扫上面的微信公众号, 订阅阁主公众号!
坚持原创技术分享, 您的支持将鼓励我继续创作