[LeetCode-03]-Longest Substring Without Repeating Characters

每周完成一个ARTS：(Algorithm、Review、Tip、Share, ARTS)

• Algorithm: 每周至少做一个 leetcode 的算法题
• Review: 阅读并点评至少一篇英文技术文章
• Tip: 学习至少一个技术技巧
• Share: 分享一篇有观点和思考的技术文章

题目相关

【题目】原题链接
Given a string, find the length of the longest substring without repeating characters.

Example 1:

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

Example 2:

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

Example 3:

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.

【难度】Medium

Solution

测试用例有的未通过，还在调测中，后面补坑