Longest Substring Without Repeating Characters计算字符串中不含有重复字符的连续字符串的最大长度

最新推荐文章于 2024-12-19 16:15:24 发布

原创最新推荐文章于 2024-12-19 16:15:24 发布 · 342 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

学习生活总结专栏收录该内容

8 篇文章

订阅专栏

本文介绍了一种解决LeetCode中等难度题目的方法：计算给定字符串中最长的无重复字符子串的长度。通过使用哈希表来跟踪字符出现的位置，并采用滑动窗口技巧实现了高效求解。

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

Examples:

Given "abcabcbb", the answer is "abc", which the length is 3.

Given "bbbbb", the answer is "b", with the length of 1.

Given "pwwkew", 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.

在leetcode中做到的一道中等题，计算字符串中不含有重复字符的连续字符串的最大长度。

对于这道思维题我开始想麻烦了。代码记录下来：

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