mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-05 16:26:47 +08:00
Updated the problem10 solution
This commit is contained in:
@ -1,19 +1,21 @@
|
|||||||
// https://projecteuler.net/problem=10
|
// https://projecteuler.net/problem=10
|
||||||
|
|
||||||
const isPrime = (number) => {
|
const isPrime = (number) => {
|
||||||
let flag = true
|
if (number === 2) return true
|
||||||
for (let j = number - 1; j >= 2; j--) {
|
if (number % 2 === 0) return false
|
||||||
|
|
||||||
|
for (let j = 3; j * j <= number; j += 2) {
|
||||||
if (number % j === 0) {
|
if (number % j === 0) {
|
||||||
flag = false
|
return false
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
return flag
|
return true
|
||||||
}
|
}
|
||||||
|
|
||||||
const calculateSumOfPrimeNumbers = (maxNumber) => {
|
const calculateSumOfPrimeNumbers = (maxNumber) => {
|
||||||
let sum = 0
|
let sum = 0
|
||||||
for (let i = maxNumber - 1; i >= 2; i--) {
|
for (let i = maxNumber - 1; i >= 2; i--) {
|
||||||
if (isPrime(i) === true) {
|
if (isPrime(parseInt(i)) === true) {
|
||||||
sum += i
|
sum += i
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
Reference in New Issue
Block a user