# 带翅膀的猫

## 时光荏苒，我们一直都在

### 《LeetCode刷题（Easy Rank）：888. Fair Candy Swap》

6月前  •   •   •   41  •

### Question:

Alice and Bob have candy bars of different sizes: A[i] is the size of the i-th bar of candy that Alice has, and B[j] is the size of the j-th bar of candy that Bob has.

Since they are friends, they would like to exchange one candy bar each so that after the exchange, they both have the same total amount of candy.  (The total amount of candy a person has is the sum of the sizes of candy bars they have.)

Return an integer array ans where ans[0] is the size of the candy bar that Alice must exchange, and ans[1] is the size of the candy bar that Bob must exchange.

If there are multiple answers, you may return any one of them.  It is guaranteed an answer exists.

### Solution:

Pythonclass Solution:
def fairCandySwap(self, A, B):
"""
:type A: List[int]
:type B: List[int]
:rtype: List[int]
"""
sumA = sum(A)#Alice的糖果总数
sumB = sum(B)#Bob的糖果总数
sub = (sumA-sumB)//2#需要交换的两个数之间的差值
setB = set(B)
for i in A:
if i-sub in setB:
return [i,i-sub]

### 已有0条评论

还没有任何评论，你来说两句吧!