LeetCode888

水题，注意多次查找在不在列表时，可以先将列表集合化。 

import numpy as np


def fairCandySwap(A, B):
    """
    :type A: List[int]
    :type B: List[int]
    :rtype: List[int]
    """
    t = (sum(A)+sum(B))//2-sum(A)
    b = set(B)
    for i in A:
        if i+t in b:
            return [i, i+t]

# sample:
A, B = [1,1], [2,2]
print(fairCandySwap(A, B))

A, B = [1,2], [2,3]
print(fairCandySwap(A, B))