LeetCode-3:Longest Substring Without Repeating Characters

来源:互联网 发布:淘宝上买丝袜保密吗 编辑:程序博客网 时间:2024/06/14 04:33

3.Longest Substring Without Repeating Characters

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.

题意:给定一个字符串,找到其中的一个最长的子串,使得这个子串不包含重复的字符,注意子序列并非子串。



阅读全文
0 0
原创粉丝点击