leetcode

0 class Solution {

1 public:

2 vector<int> leftRightDifference(const vector<int> &nums) const {

3 const int sum = accumulate(begin(nums), end(nums), 0);

4 const int n = size(nums);

5 vector<int> res(n);

6 int acc = 0;

7

8 for (int i = 0; i < n; i++) {

9 res[i] = abs(sum - acc - nums[i] - acc);

10 acc += nums[i];

11 }

12

13 return res;

14 }

15 };