解题思路
1.用一个新的数组代替nums1,并排序
2.找到当前i处能变化的最大值max
3.最终sum-max就是答案
代码
class Solution {
public int minAbsoluteSumDiff(int[] nums1, int[] nums2) {
final int MOD = 1000000007;
int n = nums1.length;
int[] rec = new int[n];
System.arraycopy(nums1, 0, rec, 0, n);
Arrays.sort(rec);
int sum = 0, maxn = 0;
for (int i = 0; i < n; i++) {
int diff = Math.abs(nums1[i] - nums2[i]);
sum = (sum + diff) % MOD;
int j = binarySearch(rec, nums2[i]);
if (j < n) {
maxn = Math.max(maxn, diff - (rec[j] - nums2[i]));
}
if (j > 0) {
maxn = Math.max(maxn, diff - (nums2[i] - rec[j - 1]));
}
}
return (sum - maxn + MOD) % MOD;
}
public int binarySearch(int[] rec, int target) {
int low = 0, high = rec.length - 1;
if (rec[high] < target) {
return high + 1;
}
while (low < high) {
int mid = (high - low) / 2 + low;
if (rec[mid] < target) {
low = mid + 1;
} else {
high = mid;
}
}
return low;
}
}