首页 > itarticle > 453. minimum moves to equal array elements

453. minimum moves to equal array elements

admin 11月 15, 2020 0

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

Example:

1
2
3
4
5
6
7
8
9
10
 
Input:
[1,2,3]

Output:
3

Explanation:
Only three moves are needed (remember each move increments two elements):

[1,2,3]  =>  [2,3,3]  =>  [3,4,3]  =>  [4,4,4]
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
 
class  {
    public int minMoves(int[] nums) {
        int min = nums[0];
        for (int num : nums) {
         if (num < min) {
             min = num;
           }
        }
        int ans = 0;
        for (int num: nums) {
          ans += (num - min);
      }
        return ans;
    }
}
微海报分享

近期文章

近期评论

标签

热门

文章归档

分类目录

功能