力扣周赛-302：6122. 使数组可以被整除的最少删除次数

class Solution {
    public int minOperations(int[] nums, int[] numsDivide) {
        Arrays.sort(nums);
        int res = 0;
        for (int i = 0; i < nums.length; i++){
            if (i == 0 || (i > 0 && nums[i] != nums[i - 1])){
                if (calculation(nums[i], numsDivide)){
                    return res;
                }
            } 
            res++;
        }
        return res == nums.length ? -1 : res; 
    }

    private boolean calculation(int num, int[] numsDivide){
        for (int i : numsDivide) {
            if (i % num != 0){
                return false;
            }
        }
        return true;
    }
}