题解 | 数据分类处理

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.hasNextInt()) { // 注意 while 处理多个 case
        //     int a = in.nextInt();
        //     int b = in.nextInt();
        //     System.out.println(a + b);
        // }

        int total_num = in.nextInt();
        int[] data = new int[total_num];
        for(int i =0 ;i < total_num; i++){
            data[i] = in.nextInt();
        }

        int rule_num = in.nextInt();
        
        Set<Integer> rule = new TreeSet<>();
        
        for(int i =0 ;i < rule_num; i++){
            rule.add(in.nextInt());
        }

        LinkedList<Integer> resList = new LinkedList<>();
 
        
        for(Integer ri : rule){
                LinkedList<Integer> tmpresList = new LinkedList<>();
            // if(){ 
            // }
            //
            int tmptotal = 0;
            for(int i =0;i<total_num;i++){
                if( String.valueOf( data[i]).contains( String.valueOf(ri))){
                    tmpresList.add(i);
                    tmpresList.add(data[i]); 
                    tmptotal++;
                } 
            }

            if(tmptotal >0){
                tmpresList.addFirst(tmptotal);
                tmpresList.addFirst(ri);
            } 
          resList.addAll(tmpresList);
        }
        resList.addFirst(resList.size());

        resList.forEach(item->{

         System.out.print(item+" ");

        });
    }
}