LeetCode3. Longest Substring Without Repeating Characters

最新推荐文章于 2021-02-26 10:29:29 发布

Black_Cater

最新推荐文章于 2021-02-26 10:29:29 发布

阅读量86

点赞数

分类专栏： JAVA

本文链接：https://blog.csdn.net/Black_Cater/article/details/110522510

版权

JAVA 专栏收录该内容

27 篇文章 0 订阅

订阅专栏

该博客探讨了LeetCode第3题，寻找字符串中最长的无重复字符子串。通过举例说明了问题，如输入's=“abcabcbb”'时答案为3，因为子串'abc'的长度为3。博主提到了两种方法：暴力求解（超时）和动态规划加双指针法，并提到复杂度为O(n)。

摘要由CSDN通过智能技术生成

Given a string s, find the length of the longest substring without repeating characters.

Example 1:

Input: s = “abcabcbb” Output: 3 Explanation: The answer is “abc”, with
the length of 3. Example 2:

Input: s = “bbbbb” Output: 1 Explanation: The answer is “b”, with the
length of 1. Example 3:

Input: s = “pwwkew” Output: 3 Explanation: The answer is “wke”, with
the length of 3. Notice that the answer must be a substring, “pwke” is
a subsequence and not a substring. Example 4:

Input: s = “” Output: 0

Constraints:

0 <= s.length <= 5 * 104
s consists of English letters, digits, symbols and spaces.

brute force (O(n^3))
(超时了，直接遍历string，一遍一遍查找相同的，储存最大值即可，（用两个for loop遍历string，然后再判断中间substring是否符合条件，需要用到hashtable来判断））
DP + memo + two pointer
以下是非常简陋的图解。。。。。

class Solution {
    public int lengthOfLongestSubstring(String s) {
        if (s.length() == 0) return 0;
        Map<Character, Integer> map = new HashMap<>();
        int max = 0;
        int start = 0;
        for (int i = 0; i < s.length(); i++) {
            if (map.containsKey(s.charAt(i))) {
                start = Math.max(start, map.get(s.charAt(i)) + 1);
            }
            map.put(s.charAt(i), i);
            max = Math.max(max, i - start + 1);
        }
        return max;
    }
}