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:3Explanation:Only three moves are needed (remember each move increments two elements):[1,2,3] => [2,3,3] => [3,4,3] => [4,4,4]class Solution {public: int minMoves(vector<int>& nums) { int m = 0; int min = 0x7fffffff; for(int num : nums){ if(num < min) min = num; } for(int num : nums){ m += (num - min); } return m; }};新聞熱點
疑難解答
