代码拉取完成，页面将自动刷新
同步操作将从 doocs/leetcode 强制同步，此操作会覆盖自 Fork 仓库以来所做的任何修改，且无法恢复！！！
确定后同步将在后台操作，完成时将刷新页面，请耐心等待。
Given two arrays of integers, find a pair of values (one value from each array) that you can swap to give the two arrays the same sum.
Return an array, where the first element is the element in the first array that will be swapped, and the second element is another one in the second array. If there are more than one answers, return any one of them. If there is no answer, return an empty array.
Example:
Input: array1 = [4, 1, 2, 1, 1, 2], array2 = [3, 6, 3, 3] Output: [1, 3]
Example:
[1, 2, 3], array2 = [4, 5, 6]
Note:
1 <= array1.length, array2.length <= 100000class Solution:
def findSwapValues(self, array1: List[int], array2: List[int]) -> List[int]:
diff = sum(array1) - sum(array2)
if diff & 1:
return []
diff >>= 1
s = set(array2)
for a in array1:
b = a - diff
if b in s:
return [a, b]
return []
class Solution {
public int[] findSwapValues(int[] array1, int[] array2) {
int s1 = 0, s2 = 0;
Set<Integer> s = new HashSet<>();
for (int a : array1) {
s1 += a;
}
for (int b : array2) {
s.add(b);
s2 += b;
}
int diff = s1 - s2;
if ((diff & 1) == 1) {
return new int[]{};
}
diff >>= 1;
for (int a : array1) {
int b = a - diff;
if (s.contains(b)) {
return new int[]{a, b};
}
}
return new int[]{};
}
}
class Solution {
public:
vector<int> findSwapValues(vector<int>& array1, vector<int>& array2) {
int s1 = 0, s2 = 0;
unordered_set<int> s;
for (int a : array1) s1 += a;
for (int b : array2) {
s2 += b;
s.insert(b);
}
int diff = s1 - s2;
if (diff & 1) {
return {};
}
diff >>= 1;
for (int a : array1) {
int b = a - diff;
if (s.count(b)) {
return {a, b};
}
}
return {};
}
};
func findSwapValues(array1 []int, array2 []int) []int {
s1, s2 := 0, 0
for _, a := range array1 {
s1 += a
}
s := make(map[int]bool)
for _, b := range array2 {
s2 += b
s[b] = true
}
diff := s1 - s2
if (diff & 1) == 1 {
return []int{}
}
diff >>= 1
for _, a := range array1 {
b := a - diff
if s[b] {
return []int{a, b}
}
}
return []int{}
}
此处可能存在不合适展示的内容，页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容，可点击提交进行申诉，我们将尽快为您处理。
马建仓 AI 助手
