题目: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:
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]
标签为easy的竟然编了一个小时还没编出来,然后一看discussion,我去,原来数学东西没搞懂,一个式子就能搞定的东西,我在那里写什么破循环!!!!(我只推出了一个式子,没有推出第二个)
思路:
设加x次,加到最后,每个数都为y
则有:
.........................................................................(式1)
...............................................................................................(式2)
得:
以上