4116. Minimum Moves to Equal Array Elements III
My accepted Python solution to LeetCode problem 4116, Minimum Moves to Equal Array Elements III, running in 3ms.
- Difficulty: Easy
- Python
- Runtime 3ms
- Memory 17.2MB
- Updated
Read the problem on LeetCode View on GitHub
The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.
Python
Accepted on LeetCode — runtime 3ms, memory 17.2MB, accepted 2025-12-31.
class Solution:
def minMoves(self, nums: List[int]) -> int:
# All elements should become the maximum
max_val = max(nums)
return sum(max_val - num for num in nums)