453. Minimum Moves to Equal Array Elements

/**
 * Problem: LeetCode 453 - Minimum Moves to Equal Array Elements
 * Difficulty: Medium
 * Language: Java
 * Author: CodeByTushu
 */
class Solution {
    public int minMoves(int[] nums) {
        int min = Integer.MAX_VALUE;
        for (int x : nums) {
            min = Math.min(min, x);
        }

        long moves = 0;
        for (int x : nums) {
            moves += (long) x - min;
        }

        return (int) moves;
    }
}

"""
Problem: LeetCode 453 - Minimum Moves to Equal Array Elements
Difficulty: Medium
Language: Python (Python 3)
Author: CodeByTushu
"""

from typing import List

class Solution:
    def minMoves(self, nums: List[int]) -> int:
        min_val = min(nums)
        return sum(x - min_val for x in nums)

/**
 * Problem: LeetCode 453 - Minimum Moves to Equal Array Elements
 * Difficulty: Medium
 * Language: C++
 * Author: CodeByTushu
 */

#include <vector>
#include <algorithm>
#include <climits>

using namespace std;

class Solution {
public:
    int minMoves(vector<int>& nums) {
        int minVal = *min_element(nums.begin(), nums.end());
        long long moves = 0;
        for (int x : nums) {
            moves += (long long)x - minVal;
        }
        return (int)moves;
    }
};

/**
 * Problem: LeetCode 453 - Minimum Moves to Equal Array Elements
 * Difficulty: Medium
 * Language: JavaScript
 * Author: CodeByTushu
 */

/**
 * @param {number[]} nums
 * @return {number}
 */
var minMoves = function(nums) {
    let min = Infinity;
    for (let i = 0; i < nums.length; i++) {
        if (nums[i] < min) {
            min = nums[i];
        }
    }

    let moves = 0;
    for (let i = 0; i < nums.length; i++) {
        moves += nums[i] - min;
    }

    return moves;
};