-
星空
class Solution(object): def minMoves(self, nums): """ :type nums: List[int] :rtype: int """ return sum(nums) - min(nums) * len(nums)
-
星空
public class Solution { public int minMoves(int[] nums) { if (nums.length == 0) return 0; int min = nums[0]; for (int n : nums) min = Math.min(min, n); int res = 0; for (int n : nums) res += n - min; return res; } }
-
星空
def min_moves(nums) nums.inject(:+) - nums.size * nums.min end
-