一种数学解法
首先统计出两个数组的和,记为sum1,sum2
计算差值/2 就是要拿掉的两个元素的差
(sum1-x = sum2+x) = >2x = |sum1-sum2|
之后再两个数组中找这个差值的两个元素
LeetCode有时间要求,所以不能使用两个for循环
可以使用快速排序对其中的一个数组进行排序 (为了锻炼,这里没有库函数中快排的代码),之后遍历没有排序的那个数组,在已经排好序的数组中找到差值(折半查找)
/**
* @Description 我们写代码,靠的是技术(狗头)
* @auther admin
* @create 2020-07-04 20:44
*/
public class Solution16_21 {
public void QuickSort(int[] array,int low,int high){
if(low<high){
int pivot = fun(array,low,high);
//设置枢轴
QuickSort(array,low,pivot-1);
QuickSort(array,pivot+1,high);
}
}
public int fun(int[] array,int low,int high){
int pivot = array[low];
while (low<high){
while (array[high]>=pivot&&low<high)high--;
array[low] = array[high];
while(array[low]<=pivot&&low<high)low++;
array[high] = array[low];
}
array[low] = pivot;
return low;
}
public boolean Binary_Search(int[] array,double key){
int low = 0,high = array.length-1;
int mid;
while (low<=high){
mid = (low+high)/2;
if(array[mid]==key)return true;
else if(array[mid]>key)high = mid-1;
else low = mid+1;
}
return false;
}
public int[] findSwapValues(int[] array1, int[] array2) {
int sln[] = null;
int sum1 = 0,sum2 = 0;
for(int i = 0;i<array1.length;i++)sum1+=array1[i];
for(int i = 0;i<array2.length;i++)sum2+=array2[i];
double dlt = (double) Math.abs(sum1-sum2)/2;
double flag = 0;
QuickSort(array1,0,array1.length-1);
if(sum1>sum2){
for(int i = 0;i<array2.length;i++){
flag = dlt + array2[i];
if(Binary_Search(array1,flag)){
sln = new int[2];
sln[0] = (int) flag;
sln[1] = array2[i];
return sln;
}
}
}
if(sum1<sum2){
for(int i = 0;i<array2.length;i++){
flag =array2[i]-dlt;
if(Binary_Search(array1,flag)){
sln = new int[2];
sln[0] = (int) flag;
sln[1] = array2[i];
return sln;
}
}
}
return new int[0];
}
public static void main(String[] args) {
Solution16_21 solution16_21 = new Solution16_21();
int[] a= solution16_21.findSwapValues(new int[]{519, 886, 282, 382, 662, 4718, 258, 719, 494, 795},new int[]{52, 20, 78, 50, 38, 96, 81, 20});
for(int i = 0;i<a.length;i++){
System.out.print(a[i]);
}
}
}