码迷,mamicode.com
首页 > 其他好文 > 详细

Minimum Moves to Equal Array Elements

时间:2017-02-17 23:23:46      阅读:145      评论:0      收藏:0      [点我收藏+]

标签:length   nts   lan   cte   one   empty   style   remember   integer   

Given a non-empty integer array, find the minimum number of moves required to make all array elements equal, where a move is incrementing a selected element by 1 or decrementing a selected element by 1.

You may assume the array‘s length is at most 10,000.

Example:

Input:
[1,2,3]

Output:
2

Explanation:
Only two moves are needed (remember each move increments or decrements one element):

[1,2,3]  =>  [2,2,3]  =>  [2,2,2]

 

 

 1 public class Solution {
 2     public int minMoves2(int[] nums) {
 3         Arrays.sort(nums);
 4         
 5         int result = 0;
 6         for (int i = 0, j = nums.length - 1; i < j; i++, j--) {
 7             result += nums[j] - nums[i];
 8         }
 9         return result;
10     }
11 }

 

Minimum Moves to Equal Array Elements

标签:length   nts   lan   cte   one   empty   style   remember   integer   

原文地址:http://www.cnblogs.com/amazingzoe/p/6411761.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!