Minimum Moves to Equal Array Elements LeetCode solution in C++

1
class Solution {
2
 public:
3
  int minMoves(vector<int> &nums) {
4
    // sorting the array to get min at the first
5
    sort(nums.begin(), nums.end());
6
    int cnt = 0, n = nums.size();
7

8
    // Now we have to make min equal to every number and keep adding the count
9
    for (int i = 1; i < n; i++) cnt += nums[i] - nums[0];
10

11
    return cnt;
12
  }
13
};