#1685

Sum of Absolute Differences in a Sorted Array

pupil · 585 · lc medium +29 · verified · 68.2% accepted · 2,200 likes · top 75%

Description

Given a non-decreasing integer array nums, build an output array where result[i] equals the sum of absolute differences between nums[i] and every other element: sum(|nums[i] - nums[j]|) for all j != i. Return the result array.

Example 1:

Input: nums = [2,3,5]

Output: [4,3,5]

Explanation: Assuming the arrays are 0-indexed, then

result[0] = |2-2| + |2-3| + |2-5| = 0 + 1 + 3 = 4,

result[1] = |3-2| + |3-3| + |3-5| = 1 + 0 + 2 = 3,

result[2] = |5-2| + |5-3| + |5-5| = 3 + 2 + 0 = 5.

Example 2:

Input: nums = [1,4,6,8,10]

Output: [24,15,13,15,21]

Code

1

2

3

class Solution:
    def getSumAbsoluteDifferences(self, nums: List[int]) -> List[int]:

class Solution:
    def getSumAbsoluteDifferences(self, nums: List[int]) -> List[int]: