Problem
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 <= 100001 <= B.length <= 100001 <= A[i] <= 1000001 <= B[i] <= 100000- It is guaranteed that Alice and Bob have different total amounts of candy.
- It is guaranteed there exists an answer.
Solution: HashTable
Time complexity: O(A+B)
Space complexity: O(B)
Clean version
|
1 2 3 4 5 6 7 8 9 10 11 12 13 |
// Author: Huahua // Running time: 132 ms class Solution { public: vector<int> fairCandySwap(vector<int>& A, vector<int>& B) { int sum_a = accumulate(begin(A), end(A), 0); int sum_b = accumulate(begin(B), end(B), 0); unordered_set<int> s(begin(B), end(B)); int diff = (sum_b - sum_a) / 2; for (int a : A) if (s.count(a + diff)) return {a, a + diff}; } }; |
Faster version
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 |
// Author: Huahua // Running time: 68 ms class Solution { public: vector<int> fairCandySwap(vector<int>& A, vector<int>& B) { int sum_a = accumulate(begin(A), end(A), 0); int sum_b = 0; unordered_set<int> s; for (int b : B) { sum_b += b; s.insert(b); } int diff = (sum_b - sum_a) / 2; for (int a : A) if (s.count(a + diff)) return {a, a + diff}; } }; |
请尊重作者的劳动成果，转载请注明出处！花花保留对文章／视频的所有权利。
如果您喜欢这篇文章／视频，欢迎您捐赠花花。
If you like my articles / videos, donations are welcome.
huahualeetcode
Be First to Comment