JAVA 求2~1000中的所有亲密数对(亲密数对是指:如果A的因子和等于B,B的因子和等于A

public class QinMi { private int a[] = new int[999];//存储2-1000的每个数的因子和 private int duiShui = 0;//亲密数的对数 public int[] jiSuan() { for (int i = 2; i <= 1000; i++) {//外层循环是从2-1000 int sum = 0; for (int j = 1; j