package question;

import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;

/**
 * @author Roderland
 * @since 1.0
 */
public class Question888 {
 public static void main(String[] args) {
 int[] ints = {
 1, 2, 3
 };
 new Question888().fairCandySwap(ints, ints);
 }

 public int[] fairCandySwap(int[] A, int[] B) {
 int s = (Arrays.stream(A).sum() - Arrays.stream(B).sum()) / 2;
// for (int i = 0; i < A.length; i++) {
// for (int j = 0; j < B.length; j++) {
// if (A[i]-B[j]==s) return new int[]{A[i], B[j]};
// }
// }
 Set<Integer> set = new HashSet<>();
 for (int i : B)
 set.add(i);
 for (int i : A)
 if (set.contains(i - s))
 return new int[]{i, i - s};
 return null;
 }
}