1.求素数
return arr.filter( function(x){ var y = Math.sqrt(x); var isPrime = true; if(x===1) return false; if(x === 2) return true; for(let i = 2; i <= y; i++){ if(x%i == 0){ isPrime = false; } } return isPrime; } );
Sign in to make a reply
髣髴兮飘摇
1.求素数