1、公平的糖果棒交换
public int[] fairCandySwap(int[] A, int[] B) {
int sumA= Arrays.stream(A).sum();
int sumB= Arrays.stream(B).sum();
int half=(sumA-sumB)>>1;
Set<Integer> set=new HashSet<>() ;
for (int num : A) {
set.add(num);
}
int[] result=new int[2];
for (int num : B) {
int ans=half+num;
if (set.contains(ans)){
result[0]=ans;
result[1]=num;
break;
}
}
return result;
}