Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 453 with 26 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 453 # by problem number
lcpy gen -s minimum_moves_to_equal_array_elements # by problem name
nums of size n, return the minimum number of moves required to make all array elements equal.
In one move, you can increment n - 1 elements of the array by 1.
Input: nums = [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]
Input: nums = [1,1,1]
Output: 0
class Solution:
# Time: O(n)
# Space: O(1)
def min_moves(self, nums: list[int]) -> int:
# Each move raises n - 1 elements by 1, so the minimum never falls behind.
# Equivalently, every element must climb to the maximum: one move can be
# seen as lowering a single element by 1, giving sum(nums) - n * min(nums).
return sum(nums) - min(nums) * len(nums)
| Time | Space |
|---|---|
| O(n) | O(1) |