LeetCode-java实现-T3Longest Substring Without Repeating Characters

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.

注意： 1.该题要用HashMap来查找，降低时间复杂度

            2.要注意删除map中相同字符前的所有字符，所以要保存字串第一个字符的首地址

package org.algorithm.leetcode;

import java.util.HashMap;

public class Item3 {
	public static int lengthOfLongestSubstring(String s) {
        HashMap<Character,Integer> map = new HashMap<Character,Integer>();
        int max = 0;
        int num = 0;
        int j = 0; //保存字串首字符下标
        for(int i = 0; i < s.length(); i++) {
        	if(map.containsKey(s.charAt(i))) {
        		while(s.charAt(j) != s.charAt(i)) {//删除map中相同字符前面存在的所有字符
        			map.remove(s.charAt(j));
        			j++;
        		}	
        		map.remove(s.charAt(j));
        		j = j + 1;
        		map.put(s.charAt(i), i);    	
        	} else {
        		map.put(s.charAt(i), i);
        	}
        	num = map.size();
            max = (num > max) ? num : max;
        }
        return max;
    }
	
	public static void main(String[] args) {
		String s = "cdd";
		System.out.println(lengthOfLongestSubstring(s));
	}
}