题解 | #子串计算#
子串计算
https://www.nowcoder.com/practice/bcad754c91a54994be31a239996e7c11
import java.util.*;
// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
String one_zero_string = in.nextLine();
TreeMap<String,Integer> map = new TreeMap<>();
int len = one_zero_string.length();
for(int i = 0;i<len;i++){
for(int j = i;j<=len;j++){
String key = one_zero_string.substring(i,j);
map.put(key,map.getOrDefault(key,0) + 1);
}
}
for(String str:map.keySet()){
if(str.equals("")) continue;
if(map.get(str) > 1) System.out.println(str + " " + map.get(str));
}
}
}