2357. Make Array Zero by Subtracting Equal Amounts
Easy
You are given a non-negative integer array nums. In one operation, you must:
- Choose a positive integer
xsuch thatxis less than or equal to the smallest non-zero element innums. - Subtract
xfrom every positive element innums.
Return the minimum number of operations to make every element in nums equal to 0.
Example 1:
Input: nums = [1,5,0,3,5] Output: 3 Explanation: In the first operation, choose x = 1. Now, nums = [0,4,0,2,4]. In the second operation, choose x = 2. Now, nums = [0,2,0,0,2]. In the third operation, choose x = 2. Now, nums = [0,0,0,0,0].
Example 2:
Input: nums = [0] Output: 0 Explanation: Each element in nums is already 0 so no operations are needed.
Constraints:
1 <= nums.length <= 1000 <= nums[i] <= 100
class Solution:
def minimumOperations(self, nums: List[int]) -> int:
def get_min(nums):
s = set(nums)
s = sorted(s)
#min = sorted(s)[0]
min = s[0] if s[0] != 0 else s[1]
return min
step = 0
while True:
if nums[0] == 0 and (nums.count(nums[0]) == len(nums)):
return step
else:
min = get_min(nums)
nums = [value-min if value> 0 else value for value in nums ]
step += 1