数组配对 给定N个整数，N为偶数，是否能找到N/2对，使得每对和能被K整除。注意：每个元素只能出现在一个配对中。public class num9 { public boolean checkP

public class num9 {

public boolean checkPairable(int[] nums,int k){

if(k <= 0) return false;

int[] counts = new int[k];

for (int num : nums) {

counts[num % k]++;

}

if(counts[0] % 2 != 0) return false;

if(k % 2 == 0){

if(counts[k/2] % 2 != 0) return false;

}

for(int i = 1;i <= k/2;i++){

if(counts[i] != counts[k-i]) return false;

}

return true;

}

public static void main(String[] args) {

int[] nums = new int[6];

int k = 5;

}

}