Left and Right Sum Differences - Practice Coding | SlaveCode
0
0123456789
0
0123456789
:
0
0123456789
0
0123456789
2574. Left and Right Sum Differences
Easy
10 Points
Array
Prefix Sum
You are given a 0-indexed integer array nums of size n.
Define two arrays leftSum and rightSum where:
Return an integer array answer of size n where answer[i] = |leftSum[i] - rightSum[i]|.
Examples
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
1 <= nums[i] <= 105
2574. Left and Right Sum Differences
Easy
10 Points
Array
Prefix Sum
You are given a 0-indexed integer array nums of size n.
Define two arrays leftSum and rightSum where:
Return an integer array answer of size n where answer[i] = |leftSum[i] - rightSum[i]|.
Examples
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].