LeetCode: Minimum Absolute Sum Difference Solution

1/**
2 * @param {number[]} nums1
3 * @param {number[]} nums2
4 * @return {number}
5 */
6var minAbsoluteSumDiff = function (nums1, nums2) {
7  const diffArr = nums1.map((num1, i) => Math.abs(num1 - nums2[i]))
8  const maxDiff = Math.max(...diffArr)
9  const maxDiffIdx = diffArr.findIndex(diff => diff === maxDiff)
10  const diffSum = diffArr.reduce((acc, el) => acc + el, 0) - maxDiff
11
12  let res = Infinity
13  for (const num of nums1) {
14    res = Math.min(res, diffSum + Math.abs(num - nums2[maxDiffIdx]))
15  }
16
17  return res % (1e9 + 7)
18}