LeetCode3.lengthOfLongestSubstring

最新推荐文章于 2024-07-01 20:33:02 发布

原创最新推荐文章于 2024-07-01 20:33:02 发布 · 2.1k 阅读

0 ·

CC 4.0 BY-SA版权

java进阶同时被 2 个专栏收录

9 篇文章

订阅专栏

LeetCode

2 篇文章

订阅专栏

本文介绍了一种寻找给定字符串中包含最多不同字符的子串的方法。通过使用哈希映射来跟踪字符及其索引，该算法能在O(n)时间内找到最长的无重复字符子串长度。

找给定字符串中最大的不同字符的子串

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 asubstring, "pwke" is a subsequence and not a substring.

/*time:2016-7-28 15:50:05
 * location:home
 * */
import java.util.HashMap;


public class Solution3 {
	public static int lengthOfLongestSubstring(String s){
		if(s.length() == 0){
			return 0;
		}
		
		int max = 0;
		HashMap<Character, Integer> map = new HashMap<Character,Integer>();
		for(int i=0,j=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+1-j);
			
		}
		return max;
		
	}
	//test
	public static void main(String[] args){
		String s = "heelldf";
		//System.out.print(s);
		int max = lengthOfLongestSubstring(s);
		System.out.println(max);
		
	}

}