LeetCode 3. Longest Substring Without Repeating Characters

来源:互联网 发布:天津软件测试 编辑:程序博客网 时间:2024/06/11 07:37

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 asubstring,"pwke" is asubsequence and not a substring.


JAVA代码如下:

C++代码如下:

1 0