Package g2501_2600.s2574_left_and_right_sum_differences

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    2574 - Left and Right Sum Differences\.

    Easy

    Given a 0-indexed integer array nums, find a 0-indexed integer array answer where:

    • answer.length == nums.length.

    • answer[i] = |leftSum[i] - rightSum[i]|.

    Where:

    • leftSum[i] is the sum of elements to the left of the index i in the array nums. If there is no such element, leftSum[i] = 0.

    • rightSum[i] is the sum of elements to the right of the index i in the array nums. If there is no such element, rightSum[i] = 0.

    Return the array answer.

    Example 1:

    Input: nums = 10,4,8,3

    Output: 15,1,11,22

    Explanation: The array leftSum is 0,10,14,22 and the array rightSum is 15,11,3,0. The array answer is |0 - 15|,|10 - 11|,|14 - 3|,|22 - 0| = 15,1,11,22.

    Example 2:

    Input: nums = 1

    Output: 0

    Explanation: The array leftSum is 0 and the array rightSum is 0. The array answer is |0 - 0| = 0.

    Constraints:

    • 1 <= nums.length <= 1000

    • <code>1 <= numsi<= 10<sup>5</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 leftRightDifference(IntArray nums)

      • Methods inherited from class java.lang.Object

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