1685. Sum of Absolute Differences in a Sorted Array || Leetcode

preview_player
Показать описание
Telegram :

******************** CONTEST VIDEO EDITORIAL ****************

----- Codechef Playlist -----

----- Problem A Ladder -----

----- Problem B Ladder -----

------ Problem C Ladder ------

----- Problem D Ladder -----
Рекомендации по теме
Комментарии
Автор

first of all how did you change your looks man you look like completely different man now!!

Codekage
Автор

n_a = n - i works
where as n_a = n - i - 1 gives wrong answer.

Here's my code
class Solution {
public:
vector<int> nums) {
vector<int> res;
int totalSum =0;
for(int i=0;i<nums.size();i++){
totalSum += nums[i];
}

int prefixSum =0;
for(int i=0;i<nums.size();i++){
int lSum =(i*nums[i]) - prefixSum;
lSum = abs(lSum);
int suffixSum = totalSum - prefixSum;

int rSum = suffixSum - ((nums.size() - i )*nums[i]); // your version is rSum = suffixSum - ((nums.siz() - i - 1)* nums[i);

rSum = abs(rSum);
int val = lSum + rSum;
prefixSum+=nums[i];
res.push_back(val);

}
return res;
}
};

The addition of -1 gives me a wrong answer. If I'm wrong then can you send me your code?

allan
visit shbcf.ru