Longest Substring Without Repeating Characters

最新推荐文章于 2024-01-06 13:50:14 发布

china_wanglong

最新推荐文章于 2024-01-06 13:50:14 发布

阅读量623

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/china_wanglong/article/details/38751755

版权

LeetCode 专栏收录该内容

22 篇文章 0 订阅

订阅专栏

原题：

Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest substring is "b", with the length of 1.

解法：

基本思路是维护一个窗口，每次关注窗口中的字符串，在每次判断中，左窗口和右窗口选择其一向前移动。

public int lengthOfLongestSubstring(String s) {
		if(s==null || s.isEmpty()) {
			return 0;
		}
		if(s.length()==1) {
			return 1;
		}
		boolean[] flags = new boolean[256];
		int maxLen = 1;
		int slow = 0;
		int fast = 0;
		while(fast<s.length()) {
			if(flags[s.charAt(fast)]) {
				while(s.charAt(slow)!=s.charAt(fast)) {
					flags[s.charAt(slow)] = false;
					slow++;
				}
				slow++;
				fast++;
			} else {
				flags[s.charAt(fast)] = true;
				fast++;
				maxLen = Math.max(maxLen, fast-slow);
			}
		}
		return maxLen;
    }