LeetCode 462. Minimum Moves to Equal Array Elements II
2016-12-18 19:16
555 查看
public class Solution {
public int minMoves2(int[] nums) {
Arrays.sort(nums);
int l = nums.length;
int median = nums[l / 2];
int moves = 0;
for (int i = 0; i < l; i++) moves += (int)Math.abs(nums[i] - median);
return moves;
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- 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
- 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 - 思路详解 - C++
- 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
- [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 使数组相等 解题报告
- (Java) LeetCode 462. Minimum Moves to Equal Array Elements II —— 最少移动次数使数组元素相等 II
- LeetCode | 462. Minimum Moves to Equal Array Elements II 简单数学原理题
- leetcode_middle_4_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 解题报告（Python）