使数组中所有元素都等于零

/*
 * Problem statement:
 * Given a non-negative integer array nums, in each operation you must:
 * 1. Choose a positive integer x, x must be less than or equal to the smallest non-zero element in nums.
 * 2. Subtract x from every positive integer in nums.
 * Return the minimum number of operations required to make all elements in nums equal to 0.
 */

import java.util.Arrays;

public class Solution {
    public int minOperations(int[] nums) {
        int operations = 0;
        while (Arrays.stream(nums).anyMatch(num -> num > 0)) {
            // Find the smallest non-zero element
            int min = Arrays.stream(nums).filter(num -> num > 0).min().orElse(0);
            // Subtract min from all positive elements
            nums = Arrays.stream(nums).map(num -> (num > 0) ? num - min : num).toArray();
            operations++; // Increment the operation count
        }
        return operations; // Return the number of operations
    }
}