我想从字符串中提取最长的不同连续子字符串
例如:
1)abcdeddd
应该给
ABCDE
2)aaabcdrrr
A B C D
我写了这段代码
for (int i = 0; i < lines; i++) {
String s = bf.readLine();
ArrayList al = new ArrayList();
TreeMap count = new TreeMap();
int point = 0;
for (int j = 0; j < s.length() - 1; j++) {
if (s.charAt(j + 1) != s.charAt(j)) {
Character xyz = s.charAt(j);
String news = al.get(point).concat(xyz.toString());
al.add(point, news);
} else if (s.charAt(j + 1) == s.charAt(j)) {
point++;
}
for (int k = 0; k < al.size(); k++) {
count.put(al.get(k).length(), k);
}
System.out.println(al.get(count.get(count.size() - 1)));
}
}
} catch (Exception e) {
}
}