方法一:
function isPrime(element, index, array) {
let start = 2;
while (start <= Math.sqrt(element)) {
if (element % start++ < 1) {
return false;
}
}
return element > 1 && element % 1 === 0;
}
console.log([4, 6, 8, 12].find(isPrime)); // undefined
console.log([4, 5, 8, 12].find(isPrime)); // 5
console.log([1, 1.2, 1.2, '', 'hahah', -1, 4, 5, 8, 12, 2, 3].find(isPrime)) // 5
方法二:
const isPrime = item => {
let start = 2
if (start <= Math.sqrt(item)) {
if (item % start < 1) {
return false
}
}
return item > 1 && item % 1 === 0 && item
}
console.log([4, 6, 8, 12].find(isPrime)) // undefined
console.log([4, 5, 8, 12].find(isPrime)) // 5
console.log([1, 1.2, 1.2, '', 'hahah', -1, 4, 5, 8, 12, 2, 3].find(isPrime)) // 5
方法三:
const getPrime = item => {
let start = 2
if (start <= Math.sqrt(item)) {
if (item % start < 1) {
return false
}
}
return item > 1 && Number.isInteger(item) && item
}
console.log([4, 6, 8, 12].filter(isPrime)) // []
console.log([4, 5, 8, 12].filter(isPrime)) // [5]
console.log([1, 1.2, 1.2, '', 'hahah', -1, 4, 5, 8, 12, 2, 3].filter(getPrime)) // [5,2,3]
方法四:
// 质数: 只能被1和它本身整除的数
const getPrimes = () => {
const arrPrime = [] // 存放质数
for (let i = 2; i <= 100; i++) {
let isPrime = true // 质数标志
for (let j = 2; j < i; j++) {
if (i % j === 0) {
// 如果i找到可以被j整除的数,则不是质数,跳出当前循环
isPrime = false
break
}
}
isPrime && arrPrime.push(i)
}
return arrPrime
}
console.log(getPrimes()) // [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]