Left and Right Sum Differences
You are given a 0-indexed integer array nums of size n.
Define two arrays leftSum and rightSum where:
leftSum[i]is the sum of elements to the left of the indexiin the arraynums. If there is no such element,leftSum[i] = 0.rightSum[i]is the sum of elements to the right of the indexiin the arraynums. If there is no such element,rightSum[i] = 0.
Return an integer array answer of size n where answer[i] = |leftSum[i] - rightSum[i]|.
Example 1
Input
nums = [10,4,8,3]Output
[15,1,11,22]The array
leftSum is [0,10,14,22], the array rightSum is [15,11,3,0], and the absolute differences are [15,1,11,22].Example 2
Input
nums = [1]Output
[0]Both
leftSum and rightSum are [0], so the only absolute difference is 0.Constraints
- 1 <= nums.length <= 1000
- 1 <= nums[i] <= 10^5