Package g1601_1700.s1685_sum_of_absolute_differences_in_a_sorted_array

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1685 - Sum of Absolute Differences in a Sorted Array.

    Medium

    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

    Explanation: Assuming the arrays are 0-indexed, then

    result0 = |2-2| + |2-3| + |2-5| = 0 + 1 + 3 = 4,

    result1 = |3-2| + |3-3| + |3-5| = 1 + 0 + 2 = 3,

    result2 = |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

    Constraints:

    • <code>2 <= nums.length <= 10<sup>5</sup></code>

    • <code>1 <= numsi<= numsi + 1<= 10<sup>4</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final IntArray getSumAbsoluteDifferences(IntArray nums)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait