text “（1） - 算法任务”由Szymon Zalarski撰写

Posted 2021-04-30

let sequenceA = [2,3,9,2,5,1,3,7,10];
let sequenceB = [2,1,3,4,3,10,6,6,1,7,10,10,10];
let sequenceC = [];
let repetitions = {};
let prohibitedNumbers = [];

const createSequencteC = (sequenceA, prohibitedNumbers) => {
    sequenceA.map(item => {
        if(prohibitedNumbers.includes(item)) {
            return false
        }
        sequenceC.push(item);
    })
    console.log(sequenceC);
}

const isPrime = (num) => {
    let numberOfDivisions = 0;
    for(let i = 0; i <= 10; i++) {
        if(num % i === 0 && num > 1) {
            numberOfDivisions++
        }
    }
    if(numberOfDivisions === 2) {
        return true;
    } else {
        return false;
    }
}

const checkDuplicates = (arr) => {
    arr.forEach((i) => repetitions[i] = (repetitions[i]||0) + 1);
    checkIsNumerOfRepetitionsIsPrime(repetitions)
}

const checkIsNumerOfRepetitionsIsPrime = (repetitions) => {
    for(let k in repetitions) {
        if(isPrime(repetitions[k]) && repetitions[k] >1 ) {
            prohibitedNumbers.push(parseInt(k))
        }
    }
}

checkDuplicates(sequenceB);

createSequencteC(sequenceA, prohibitedNumbers);