leecode练习——无重复字符的最长子串

题目：给定一个字符串，请你找出其中不含有重复字符的 最长子串 的长度。

题目链接：https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/

java代码

class Solution {
    public int lengthOfLongestSubstring(String s) {
    	if(s == null || s.length() == 0) {
    		return 0;
    	}
    	int max = 0;
    	int curMax = 0;
    	int curStart = 0;				//表示当前遍历的子序列的开始位置下标
    	char[] temp = s.toCharArray();
    	HashMap<Character, Integer> visited = new HashMap<>();	//存储是否访问过该字符，value值是该字符所在位置
    	for(int i = 0; i < temp.length; i++) {
    		if(!visited.containsKey(temp[i])) {
    			visited.put(temp[i], i);
    			curMax++;
    		} else {
    			int tag = visited.get(temp[i]);
    			for(int j = curStart; j < tag; j++) {
    				visited.remove(temp[j]);
    			}
    			max = max < curMax?curMax:max;
    			curMax = curMax - (tag - curStart);
    			curStart = tag+1;
    			visited.put(temp[i], i);
    		}
    	}
    	max = max < curMax?curMax:max;
    	return max;
    }
}