检查是否存在满足条件的数字组合

Scanner sc = new Scanner(System.in);
int num = sc.nextInt(); sc.nextLine();
String[] arr = sc.nextLine().split(" ");
int[] comf = new int[num];
for (int i = 0; i < arr.length; i++) {
    comf[i] = Integer.parseInt(arr[i]);
}

//从大到小排序
int[] array = Arrays.stream(comf)
        .boxed()
        .sorted((Comparator.reverseOrder()))
        .mapToInt(Integer::intValue)
        .toArray();
//A不可能取到最小的两个
for (int i = 0; i < num-2; i++) {
    //B一定小于A，从左往右开始
    for (int j = i+1; j < num; j++) {
        //C一定小于A且C不等于B，从右往左走
        for (int k = num-1; k >i&& k!=j ; k--) {
            int sum = array[j]+array[k]*2;
            if (array[i] == sum){
                System.out.println(array[i]+" "+array[j]+" "+array[k]);
            }
        }
    }
}