Skip to content

Latest commit

 

History

History
103 lines (75 loc) · 3.18 KB

0003-longest-substring-without-repeating-characters.adoc

File metadata and controls

103 lines (75 loc) · 3.18 KB

3. Longest Substring Without Repeating Characters

{leetcode}/problems/longest-substring-without-repeating-characters/[LeetCode - Longest Substring Without Repeating Characters^]

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.

思路分析

滑动窗口

{image_attr}
{image_attr}
{image_attr}
{image_attr}
{image_attr}
{image_attr}
{image_attr}
{image_attr}
{image_attr}
{image_attr}
{image_attr}
一刷
link:{sourcedir}/_0003_LongestSubstringWithoutRepeatingCharacters.java[role=include]
二刷
link:{sourcedir}/_0003_LongestSubstringWithoutRepeatingCharacters_2.java[role=include]
三刷
link:{sourcedir}/_0003_LongestSubstringWithoutRepeatingCharacters_3.java[role=include]