Leetcode-Question-3: Longest Substring Without Repeating Characters

原文链接
https://leetcode.com/problems/longest-substring-without-repeating-characters/

题目描述
Longest Substring Without Repeating Characters
Difficulty: Medium

Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for “abcabcbb” is “abc”, which the length is 3. For “bbbbb” the longest substring is “b”, with the length of 1.

解答:
十一个月后

Updated 2017.10.09 Happy Birthday to ShoweryHe~

 

发表评论

电子邮件地址不会被公开。 必填项已用*标注