1685. Sum of Absolute Differences in a Sorted Array (leetcode)

class Solution {
public:
    vector<int> getSumAbsoluteDifferences(vector<int>& nums) {
        vector < int > v;
        int cnt1 = 0 , cnt2 = 0 , n = (int)nums.size();
        for(int i=0 ; i<n ; i++) cnt1 += nums[i];
        for(int i=0 ; i<n ; i++){
            v.push_back( cnt1 - ((n - i) * nums[i]) + i*nums[i] - cnt2 );
            cnt2 += nums[i];
            cnt1 -= nums[i];

        }
        return v;

    }
};