LeetCode-Fair Candy Swap

最新推荐文章于 2021-02-28 17:48:18 发布

BeHelium

最新推荐文章于 2021-02-28 17:48:18 发布

阅读量263

点赞数

分类专栏： LeetCode 文章标签： LeetCode Java

本文链接：https://blog.csdn.net/qq_24133491/article/details/81982369

版权

LeetCode 专栏收录该内容

306 篇文章 0 订阅

订阅专栏

Description：
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.

Example 1:

Input: A = [1,1], B = [2,2]
Output: [1,2]

Example 2:

Input: A = [1,2], B = [2,3]
Output: [1,2]

Example 3:

Input: A = [2], B = [1,3]
Output: [2,3]

Example 4:

Input: A = [1,2,5], B = [2,4]
Output: [5,4]

Note:

1 <= A.length <= 10000
1 <= B.length <= 10000
1 <= A[i] <= 100000
1 <= B[i] <= 100000
It is guaranteed that Alice and Bob have different total amounts of candy.
It is guaranteed there exists an answer.

题意：有两个数组，其各自所有元素的和是不相同的，要求交换两个数组中的一个元素，使得两个数组的和是相同的;

解法：记两个数组A和B的元素和分别为S_A和S_B，数组A要交换的元素为x，数组B要交换的元素为y，那么交换后需要满足：

S A - x + y = S B - y + x

$S_A-x+y = S_B-y+x$
化简后可以得到：

x = y + S A - S B 2

$x = y + \frac{S_A-S_B}{2}$
因此，我们可以遍历数组B，对数组B中的每个元素y判断在数组A中是否存在满足上式的元素x;

class Solution {
    public int[] fairCandySwap(int[] A, int[] B) {
        int sumA = 0;
        int sumB = 0;
        Set<Integer> numInA = new HashSet<>();
        for(int i=0; i<A.length; i++) {
            sumA += A[i];
            numInA.add(A[i]);
        }
        for(int i=0; i<B.length; i++) {
            sumB += B[i];
        }
        for(int i=0; i<B.length; i++) {
            int x = B[i] + (sumA - sumB) / 2;
            if(numInA.contains(x)) {
                return new int[] {x, B[i]};
            }
        }
        return null;
    }
}