README_EN.md

2357. Make Array Zero by Subtracting Equal Amounts

中文文档

Description

You are given a non-negative integer array nums. In one operation, you must:

• Choose a positive integer x such that x is less than or equal to the smallest non-zero element in nums.
• Subtract x from every positive element in nums.

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 <= 100
• 0 <= nums[i] <= 100

Solutions

Python3

class Solution:
    def minimumOperations(self, nums: List[int]) -> int:
        s = {v for v in nums if v}
        return len(s)

Java

class Solution {
    public int minimumOperations(int[] nums) {
        Set<Integer> s = new HashSet<>();
        for (int v : nums) {
            if (v > 0) {
                s.add(v);
            }
        }
        return s.size();
    }
}

C++

class Solution {
public:
    int minimumOperations(vector<int>& nums) {
        unordered_set<int> s;
        for (int v : nums)
            if (v) s.insert(v);
        return s.size();
    }
};

Go

func minimumOperations(nums []int) int {
	s := map[int]bool{}
	for _, v := range nums {
		if v > 0 {
			s[v] = true
		}
	}
	return len(s)
}

TypeScript

...