zoukankan      html  css  js  c++  java
  • [leetcode] 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.

    思路:

    先计算出一共有多少糖果,取平均数s.再去进一步计算.

    c++代码实现:

    class Solution {
    public:
        vector<int> fairCandySwap(vector<int>& A, vector<int>& B) {
            int suma=0,sumb=0;
            vector<int> res;
            for(int a=0; a<A.size(); a++)
            {
                suma+=A[a];
            }
             for(int b=0; b<B.size(); b++)
            {
                sumb+=B[b];
            }
            int sum=0.5*(suma+sumb);
            
            for(int a=0; a<A.size(); a++)
            {
                for(int b=0; b<B.size(); b++)
                {
                    if(A[a]-B[b]==suma-sum)
                    {
                        res.push_back(A[a]);
                        res.push_back(B[b]);
                        break;                    
                    }                
                }
                if(res.size()!=0) break;
            }
            return res;
        }
    };
    

      

  • 相关阅读:
    JavaScript 19 数组(二)
    JavaScript 19 数组(一)
    JavaScript 18 字符串(三)
    JavaScript 18 字符串(二)
    JavaScript 18 字符串(一)
    History 5 : Silk Roads / Mongols / Ottoman and Mughal Empires
    History : Pictures of History
    001 markdown基本语法
    c#知识结构图
    c#知识结构图
  • 原文地址:https://www.cnblogs.com/guweixin/p/10413905.html
Copyright © 2011-2022 走看看