blob: e5fcfd0850fdf83ec4a298bb8c47d41d3aad5025 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
|
#include "leetcode.h"
class Solution {
public:
int minMoves2(vector<int> &nums) {
sort(nums.begin(), nums.end());
int mid = nums.size() / 2, steps = 0;
for (int i = 0; i < nums.size(); i++)
steps += abs(nums[i] - nums[mid]);
return steps;
}
};
int main() {
Solution obj;
vector<int> nums = {1, 2, 3};
cout << obj.minMoves2(nums);
}
|