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

1
class Solution {
2
 public:
3
  int minMoves2(vector<int> &nums) {
4
    int result = 0, length = nums.size();
5
    sort(nums.begin(), nums.end());
6
    for (int i = 0; i < length; i++) {
7
      int median = length / 2;
8
      result += abs(nums[i] - nums[median]);
9
    }
10
    return result;
11
  }
12
};