问将整数数组转换为集合，然后查找交集

EN

import java.io.IOException;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
import java.util.*;

public class intersectionRunner {
    public static void main(String args[]) throws IOException
    {
Scanner in = new Scanner(new File("intersection.dat"));
int numberOfProjects = Integer.parseInt(in.nextLine()); //proven to be =3
int numLinesBelow=0;
for(int i=0; i<numberOfProjects; i++) {
//proven to run 3 times
    Set<Integer> intersection = new TreeSet<Integer>();
    if(in.nextLine().length()==1) {
        numLinesBelow=in.nextLine();
        System.out.println(numLinesBelow);
    }
    for(int j =0; j< 0; j++) {
        
    }
}
    
    
    //MAIN ENDS
}
    
    
    
    //CLASS ENDS
}

3
1 2 3 4 5 5
3 4 5 6 7 5
4 5 1 2 3 5 6 7 8 9
5
10 11 15 61 42 14 112 34
12 13 11 61 42 10 34 12 14 112
10 10 13 11 112 54 61 13 13 34
11 112 15 42 13 34 17 10
71 10 11 112 75 63 15 42 34 56 67
4
1 2
3 4 5
6 7 8 9
10 11 12 13 14