Question

Given an array of integers, determine the number of moves to make all elements equal. Each move consists of choosing all but 1 element and incrementing their values by 1. Example numbers = [3, 4, 6, 6, 3] Choose 4 of the 5 elements during each move and increment each of their values by one. Indexing begins at 1. It takes 7 moves as follows: Unchanged Iteration Array element's index 0 [3, 4, 6, 6, 3] 1 [4, 5, 7, 6, 4] 4 2 [5, 6, 7, 7, 5] 3 3 [6, 7, 8, 7, 6] 4 4 [7, 8, 8, 8, 7] 3 5 [8, 9, 9, 8, 8] 4 6 [9, 9, 10, 9, 9] 2 7 [10, 10, 10, 10, 10] 3 Function Description Complete the function countMoves in the editor below. countMoves has the following parameter(s): int numbers[n]: an array of integers Returns: long: the minimum number of moves required Constraints 1? n ? 10$^5$ 1 ? numbers[i] ? 10$^5$

          Given an array of integers, determine the number of moves to make all elements equal. Each
move consists of choosing all but 1 element and incrementing their values by 1.
Example
numbers = [3, 4, 6, 6, 3]
Choose 4 of the 5 elements during each move and increment each of their values by one.
Indexing begins at 1. It takes 7 moves as follows:
Unchanged
Iteration
Array
element's index
0
[3, 4, 6, 6, 3]
1
[4, 5, 7, 6, 4]
4
2
[5, 6, 7, 7, 5]
3
3
[6, 7, 8, 7, 6]
4
4
[7, 8, 8, 8, 7]
3
5
[8, 9, 9, 8, 8]
4
6
[9, 9, 10, 9, 9]
2
7
[10, 10, 10, 10, 10]
3
Function Description
Complete the function countMoves in the editor below.
countMoves has the following parameter(s):
int numbers[n]: an array of integers
Returns:
long: the minimum number of moves required
Constraints
1? n ? 10$^5$
1 ? numbers[i] ? 10$^5$

Given an array of integers, determine the number of moves to make all elements equal. Each
move consists of choosing all but 1 element and incrementing their values by 1.
Example
numbers = [3, 4, 6, 6, 3]
Choose 4 of the 5 elements during each move and increment each of their values by one.
Indexing begins at 1. It takes 7 moves as follows:
Unchanged
Iteration
Array
element's index
0
[3, 4, 6, 6, 3]
1
[4, 5, 7, 6, 4]
4
2
[5, 6, 7, 7, 5]
3
3
[6, 7, 8, 7, 6]
4
4
[7, 8, 8, 8, 7]
3
5
[8, 9, 9, 8, 8]
4
6
[9, 9, 10, 9, 9]
2
7
[10, 10, 10, 10, 10]
3
Function Description
Complete the function countMoves in the editor below.
countMoves has the following parameter(s):
int numbers[n]: an array of integers
Returns:
long: the minimum number of moves required
Constraints
1? n ? 10^5
1 ? numbers[i] ? 10^5

Added by Brett D.

Question

Please give Ace some feedback