leetcode 462 Minimum Moves to Equal Array Elements II C++
2016-12-20 17:12
453 查看
找到中位数，计算每一个数字和中位数相减的绝对值的和即可
看了discussion，用了两头减的方法，会少一半的循环次数，但是看运算时间和我差不多，不知道为什么。
int minMoves2(vector<int>& nums) {
int count = 0;
if (nums.size() == 0) return count;
sort(nums.begin(),nums.end());
int midNum = nums[nums.size()/2];
for (int i = 0;i<nums.size();i++) {
count += abs(midNum - nums[i]);
}
return count;
}看了discussion，用了两头减的方法，会少一半的循环次数，但是看运算时间和我差不多，不知道为什么。
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- Leetcode 462 Minimum Moves to Equal Array Elements II
- Leetcode 462 Minimum Moves to Equal Array Elements II
- LeetCode 462 Minimum Moves to Equal Array Elements II (中位数)
- Leetcode-462 Minimum Moves to Equal Array Elements II
- [leetcode462] Minimum Moves to Equal Array Elements II
- [leetcode][462] Minimum Moves to Equal Array Elements II
- 【LeetCode-462】Minimum Moves to Equal Array Elements II
- Math-462-Minimum Moves to Equal Array Elements II
- [LeetCode] Minimum Moves to Equal Array Elements II 最少移动次数使数组元素相等之二
- LeetCode: Minimum Moves to Equal Array Elements II
- leetcode 453 Minimum Moves to Equal Array Elements C++
- LeetCode Minimum Moves to Equal Array Elements II
- Leetcode: Minimum Moves to Equal Array Elements II
- LeetCode - 462. Minimum Moves to Equal Array Elements II - 思路详解 - C++
- [LeetCode]Minimum Moves to Equal Array Elements II(Java)
- LeetCode - 453/462 - Minimum Moves to Equal Array Elements
- 462. Minimum Moves to Equal Array Elements II
- 462. Minimum Moves to Equal Array Elements II
- Leetcode 之 Minimum Moves to Equal Array Elements II
- LeetCode No.453 Minimum Moves to Equal Array Elements