Physical Address
304 North Cardinal St.
Dorchester Center, MA 02124
You are given a non-negative integer array nums
. In one operation, you must:
x
such that x
is less than or equal to the smallest non-zero element in nums
.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
public int minimumOperations(int[] nums) {
Set<Integer> set = new HashSet<>();
for (int a: nums)
if (a > 0)
set.add(a);
return set.size();
}
int minimumOperations(vector<int>& A) {
unordered_set<int> s = unordered_set(A.begin(), A.end());
return s.size() - s.count(0);
}
def minimumOperations(self, nums):
return len(set(x for x in nums if x > 0))
In our experience, we suggest you solve this Make Array Zero by Subtracting Equal Amounts LeetCode Solution and gain some new skills from Professionals completely free and we assure you will be worth it.
If you are stuck anywhere between any coding problem, just visit Queslers to get the Make Array Zero by Subtracting Equal Amounts LeetCode Solution
I hope this Make Array Zero by Subtracting Equal Amounts LeetCode Solution would be useful for you to learn something new from this problem. If it helped you then don’t forget to bookmark our site for more Coding Solutions.
This Problem is intended for audiences of all experiences who are interested in learning about Data Science in a business context; there are no prerequisites.
Keep Learning!
More Coding Solutions >>