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]

 

思路：

1，求出平均值，也就是两者相等时的值

2，求出A的值

3，只要A的值等于平均值，则B的值也会等于平均值

     判断方法为：

     1）从A中取出一个数，则此时A中的总和为sumA-A[i]

     2）用平均值减去sumA-A[i]，即temp=avg-（sumA-A[i]），此时为减去A中的一个值后，A的总和与avg的差值temp

          若这个差值temp与B中的一个数相等，那么将B中的这个数拿给A，此时A的总和就为avg，把A中减去的这个数拿给B，B的总和也会等于avg。

 

 

 

 

 

#pragma once
#include<iostream>
#include<vector>
#include <algorithm>
#include <numeric>


using namespace std;

class Solution {
public:
	vector<int> fairCandySwap(vector<int>& A, vector<int>& B) {
		//计算两个相等的时候每个人的数量
		int avg = (accumulate(A.begin(), A.end(),0) + accumulate(B.begin(), B.end(),0))/2;
		//计算A的和
		int sumA = accumulate(A.begin(), A.end(), 0);
		int temp = 0;
		vector <int> ans;
		for (int i = 0; i < A.size(); i++)
		{
			//因为交换只交换一个数，交换的数为temp=avg-(A的和-A[i])
			temp= avg -(sumA - A[i]);
			for (int j = 0; j <B.size(); j++)
			{
				//若temp与B中的一个数相等，则可交换，并且交换后A,B相等
				if (temp == B[j])
				{
					ans.push_back(A[i]);
					ans.push_back(B[j]);
					return ans;;
				}

			}
		}
		return ans;

	}
};