标签：bsp cti ber display 规律 换位思考 mini ott mil
Given anon-emptyinteger array of sizen, find the minimum number of moves required to make all array elements equal, where a move is incrementingn- 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]
class Solution { public int minMoves(int[] nums) { int min = Integer.MAX_VALUE; for(int num:nums) min = Math.min(num,min); int result = 0; for(int num:nums) result += (num-min); return result; } }
453. Minimum Moves to Equal Array Elements
标签：bsp cti ber display 规律 换位思考 mini ott mil
原文地址：http://www.cnblogs.com/wxshi/p/7598322.html
