3736. Minimum Moves to Equal Array Elements III

/**
 * Problem: LeetCode 3736 - Minimum Moves to Equal Array Elements III
 * Difficulty: Easy
 * Language: Java
 * Author: CodeByTushu
 */
class Solution {
    public int minMoves(int[] nums) {
        int max = 0;
        for (int x : nums) {
            max = Math.max(max, x);
        }

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

        return moves;
    }
}

"""
Problem: LeetCode 3736 - Minimum Moves to Equal Array Elements III
Difficulty: Easy
Language: Python (Python 3)
Author: CodeByTushu
"""

from typing import List

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

/**
 * Problem: LeetCode 3736 - Minimum Moves to Equal Array Elements III
 * Difficulty: Easy
 * Language: C++
 * Author: CodeByTushu
 */

#include <vector>
#include <algorithm>

using namespace std;

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

/**
 * Problem: LeetCode 3736 - Minimum Moves to Equal Array Elements III
 * Difficulty: Easy
 * Language: JavaScript
 * Author: CodeByTushu
 */

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

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

    return moves;
};