input:
1
1 2 4 7 11 0 9 5
11
output:
3
本题思路比较简单,主要是尽量简化复杂度,同时注意排坑,一是不能和自己匹配,必须是不同的两个数,二是对于大小为目标数一半的数字,多次出现时要注意正确地计算其对数。采用map来保存出现次数,并将target/2单独拎出来可以规避自己与自己比较的情形。
import java.util.*;
public class Main
{
public static void main (String[] args){
Scanner scan = new Scanner(System.in);
int e_num = Integer.parseInt(scan.nextLine());
int result = 0;
while(e_num > 0){
String[] num = scan.nextLine().split(" ");
int target = Integer.parseInt(scan.nextLine());
Map<Integer,Integer> map = new HashMap<>(); //key存数,value存序号
for(int i=0;i < num.length;i ++){
if(map.containsKey(Integer.parseInt(num[i]))){
map.put(Integer.parseInt(num[i]),map.get(Integer.parseInt(num[i]))+1);
}else{
map.put(Integer.parseInt(num[i]),1);
}
}
for(int i=0;i < num.length;i ++){
int diffnum = target - Integer.parseInt(num[i]);
if(map.containsKey(diffnum) && diffnum != target/2){
result = result + map.get(diffnum);
}
}
result = result/2;
if(map.containsKey(target/2)){
result += map.get(target/2)*(map.get(target/2)-1)/2;
}
System.out.println(result);
e_num --;
}
}
}