888. Fair Candy Swap

888. Fair Candy Swap

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.

解法一：

O(nm)：对数组A和B分别求出数组元素的总和，然后比较两个和的大小，如果sum(A) > sum(B)，那么就是要遍历数组寻找一对A[i]-B[j] = 1/2(sum(A)-sum(B))。

class Solution {
public:
    vector<int> fairCandySwap(vector<int>& A, vector<int>& B) {
        vector<int> res;
        int sumA = accumulate(A.begin(),A.end(),0);
        int sumB = accumulate(B.begin(),B.end(),0);
        int diff = (sumA-sumB)/2;
        for(int i = 0;i < A.size();i++)
        {
            for(int j = 0;j < B.size();j++)
            {
                if(A[i] - B[j] == diff)
                {
                    res.push_back(A[i]);
                    res.push_back(B[j]);
                    return res;
                }
            }
        }
        return res;
    }
};

解法二：

用unordered_set来重新存A、B数组，如果有重复元素的话，在set里find的速度在vector的快一些，也比直接遍历快一点，因为set里没有重复元素。
下次专门写一个关于unordered_set,set,unordered_map,map,vector,list的区别。

class Solution {
public:
    vector<int> fairCandySwap(vector<int>& A, vector<int>& B) {
        int sumA = accumulate(A.begin(),A.end(),0);
        int sumB = accumulate(B.begin(),B.end(),0);
        unordered_set<int> aSet,bSet;
        for(int i = 0;i < A.size();i++)
        {
            aSet.insert(A[i]);
        }
        for(int i = 0;i < B.size();i++)
        {
            bSet.insert(B[i]);
        }
        int diff = (sumA - sumB)/2;
        unordered_set<int>::iterator  it;
        for(it = aSet.begin();it != aSet.end();it++)
        {
            if(bSet.find(*it-diff) != bSet.end())
            {
                return vector<int> {*it,*it-diff};
            }
        }
    }
};

加法比较：时间从长到短（大致）

第一种传统方法

        for(int i = 0;i < A.size();i++)
            sumA += A[i];

第二种使用auto

        for(auto a:A)
            sumA += a;

第三种使用accumulate

int sumA = accumulate(A.begin(),A.end(),0);