1063 Set Similarity java

Given two sets of integers, the similarity of the sets is defined to be N​c​​/N​t​​×100%, where N​c​​ is the number of distinct common numbers shared by the two sets, and N​t​​ is the total number of distinct numbers in the two sets. Your job is to calculate the similarity of any given pair of sets.

Input Specification:

Each input file contains one test case. Each case first gives a positive integer N (≤50) which is the total number of sets. Then Nlines follow, each gives a set with a positive M (≤10​4​​) and followed by M integers in the range [0,10​9​​]. After the input of sets, a positive integer K (≤2000) is given, followed by K lines of queries. Each query gives a pair of set numbers (the sets are numbered from 1 to N). All the numbers in a line are separated by a space.

Output Specification:

For each query, print in one line the similarity of the sets, in the percentage form accurate up to 1 decimal place.

Sample Input:

3
3 99 87 101
4 87 101 5 87
7 99 101 18 5 135 18 99
2
1 2
1 3

Sample Output:

50.0%
33.3%

import java.util.HashSet;
import java.util.Scanner;

public class Main{
    /**
     * 在牛客网上了pat提交正确，
     * */
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        HashSet<Integer> setS[] = new HashSet[n + 1];
        for (int i = 1; i <= n; ++i) {
            int k = scanner.nextInt();
            HashSet<Integer> eachSet = new HashSet<>();
            for (int j = 0; j < k; ++j) {
                int eachElement = scanner.nextInt();
                eachSet.add(eachElement);
            }
            setS[i] = eachSet;
        }
        int m = scanner.nextInt();
        for (int i = 0; i < m; ++i) {
            int indexA = scanner.nextInt(), indexB = scanner.nextInt();
            int lenA = setS[indexA].size(), lenB = setS[indexB].size(), commentLen = 0;
            int minLen = lenA <= lenB ? lenA : lenB;
            if (minLen != lenA) {
                int tempIndex = indexA;
                indexA = indexB;
                indexB = tempIndex;
            }
            // 遍历较短的集合，不然会有一组数据超时
            for (Integer each : setS[indexA]) {
                if (setS[indexB].contains(each)) {
                    ++commentLen;
                }
            }
            System.out.printf("%.1f%c\n", commentLen * 1.0 / (lenA + lenB - commentLen) * 100, '%');
        }

    }
}