자바 프로 그래 밍 문제:오늘 의 첫 번 째 필기시험 문제

 4 0 
 1 1 1 1 

  1

5 2
1 3 3 2 5

 2

import java.util.Scanner;

public class Main {

    private static int count(int[] array, int k) {
        int count = 0;
        int size = array.length;
        if (size == 1)
            return 0;
        for (int i = 0; i < size - 1; i++) {
            if (array[i] == array[i + 1]) {
                i = tail(array, i + 1);
                if (k == 0) { // k = 0 ，          
                    count++;
                    continue;
                }
            }
            for (int j = i + 1; j < size; j++) {
                if (j != size - 1 && array[j] == array[j + 1])
                    j = tail(array, j + 1);
                if (array[i] + k == array[j]) {
                    count++;
                }
            }
        }
        return count;

    }

    //             
    private static int tail(int[] array, int index) {
        int i = index;
        for (; i < array.length; i++) {
            if (array[i] != array[i - 1])
                return i - 1;
        }
        return array.length - 1;
    }

    //     ，    
    private static void insertionSort(int[] array) {
        int temp;
        int hole;
        for (int i = 1; i < array.length; i++) {
            temp = array[i];
            for (hole = i; hole > 0 && temp < (array[hole - 1]);)
                array[hole] = array[--hole];

            array[hole] = temp;
        }
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int k = in.nextInt();
        int[] array = new int[n];
        for (int i = 0; i < n; i++)
            array[i] = in.nextInt();

        insertionSort(array);
        System.out.println(count(array, k));

    }
}