原题网址:https://leetcode.com/problems/minimum-moves-to-equal-array-elements/
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]
方法:反过来分析,每次只操作最大的数字,递减,与原问题是等价的。
public class Solution {
public int minMoves(int[] nums) {
int min = Integer.MAX_VALUE;
for(int num: nums) {
min = Math.min(min, num);
}
int moves = 0;
for(int num: nums) {
moves += num - min;
}
return moves;
}
}