Sum of Absolute Differences in a Sorted Array
You are given an integer array nums sorted in non-decreasing order.
Build and return an integer array result with the same length as nums such that result[i] is equal to the summation of absolute differences between nums[i] and all the other elements in the array.
In other words, result[i] is equal to sum(|nums[i] - nums[j]|) where 0 <= j < nums.length and j != i (0-indexed).
Example 1
Input
nums = [2,3,5]Output
[4,3,5]For each index, summing the absolute differences with every element gives 4, 3, and 5 respectively.
Example 2
Input
nums = [1,4,6,8,10]Output
[24,15,13,15,21]Summing the absolute differences between each element and all other elements gives the returned array.
Constraints
- 2 <= nums.length <= 10^5
- 1 <= nums[i] <= nums[i + 1] <= 10^4