题解 | #在字符串中找出连续最长的数字串#，先实现了再说，

import java.util.*;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNext()) { // 注意 while 处理多个 case
            String s = in.nextLine();
            char[] chars = s.toCharArray();
            int length = chars.length;
            HashMap<Integer, Integer> map = new HashMap<>();
            for (int i = 0; i < length; i++) {
                char c = chars[i];
                if (Character.isDigit(c)){
                    int count = 1;
                    for (int j = i + 1; j < length; j++) {
                        if (Character.isDigit(chars[j])){
                            count++;
                            continue;
                        }
                        break;
                    }
                    map.put(i,count);
                    i = i + count - 1;
                }
            }

            Set<Map.Entry<Integer, Integer>> entries = map.entrySet();
            int maxCount = 0;
            Map<Integer, Integer> treeMap = new TreeMap<>();
            for (Map.Entry<Integer, Integer> entry : entries) {
                Integer value = entry.getValue();
                maxCount = Math.max(maxCount, value);
            }
            for (Map.Entry<Integer, Integer> entry : entries) {
                Integer value = entry.getValue();
                if (value == maxCount){
                    treeMap.put(entry.getKey(),value);
                }
            }
            Set<Map.Entry<Integer, Integer>> ent = treeMap.entrySet();
            StringBuilder builder = new StringBuilder();
            for (Map.Entry<Integer, Integer> entry : ent) {
                Integer key = entry.getKey();
                String str = s.substring(key, key + maxCount);
                if (ent.size() == 1){
                    builder.append(str);
                    break;
                }
                    builder.append(str);
            }
            System.out.println(builder + "," + maxCount);
        }
    }
}