java 最长字串_java 实现 一个字符串中不重复最长子串

public static void longestNodupSubstring(String string)

{

int len = string.length();

if(len>0){

Map cursor = new HashMap();

cursor.put(string.charAt(0), 0);

int [] lengthAt = new int[string.length()];

lengthAt[0] =1;

int max =0;

for(int i = 1 ;i

char c = string.charAt(i);

if(cursor.containsKey(c)){

lengthAt[i] = Math.min(lengthAt[i-1]+1, i-cursor.get(c));

}else {

lengthAt[i] = lengthAt[i-1]+1;

}

max = Math.max(max, lengthAt[i]);

cursor.put(c, i);

}

for(int i=0;i

if(max == lengthAt[i]){

System.out.println(string.substring(i-max+1, i+1));

}

}

}

}