美文网首页
第三题——Longest Substring Without R

第三题——Longest Substring Without R

作者: M1chaelY0ung | 来源:发表于2016-09-28 18:26 被阅读0次

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

Examples:
Given "abcabcbb", the answer is "abc", which the length is 3.
Given "bbbbb", the answer is "b", with the length of 1.
Given "pwwkew", 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.

相关文章

网友评论

      本文标题:第三题——Longest Substring Without R

      本文链接:https://www.haomeiwen.com/subject/wwfkyttx.html