[leetcode note] Longest Substring Without Repeating Characters

时间: 2019-10-11 12:37 AM
题目地址: https://leetcode.com/problems/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.

Solution:

class Solution {
    public int lengthOfLongestSubstring(String s) {
        int length = s.length();
        Set<Character> set = new HashSet<>(length * 4 / 3 + 1);
        int len = 0, start = 0, end = 0;
        while (start < length && end < length) {
            if (!set.contains(s.charAt(end))) {
                set.add(s.charAt(end++));
                len = Math.max(len, end - start);
            } else {
                set.remove(s.charAt(start++));
            }
        }
        return len;
    }
}

Runtime: 9 ms, faster than 51.52% of Java online submissions for Longest Substring Without Repeating Characters.
Memory Usage: 36.3 MB, less than 99.76% of Java online submissions for Longest Substring Without Repeating Characters.

欢迎关注公众号(代码如诗):