ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
1.4 KiB
1.4 KiB
id, title, challengeType, videoUrl, dashedName
| id | title | challengeType | videoUrl | dashedName |
|---|---|---|---|---|
| 5900f36f1000cf542c50fe82 | 问题3：最大素数 | 5 | problem-3-largest-prime-factor |
--description--
13195的主要因子是5、7、13和29。
给定数字的最大素数是多少？
--hints--
largestPrimeFactor(2)应该返回2。
assert.strictEqual(largestPrimeFactor(2), 2);
largestPrimeFactor(3)应该返回3。
assert.strictEqual(largestPrimeFactor(3), 3);
largestPrimeFactor(5)应该返回5。
assert.strictEqual(largestPrimeFactor(5), 5);
largestPrimeFactor(7)应该返回7。
assert.strictEqual(largestPrimeFactor(7), 7);
largestPrimeFactor(13195)应该返回29。
assert.strictEqual(largestPrimeFactor(13195), 29);
largestPrimeFactor(600851475143)应该返回6857。
assert.strictEqual(largestPrimeFactor(600851475143), 6857);
--seed--
--seed-contents--
function largestPrimeFactor(number) {
return true;
}
largestPrimeFactor(13195);
--solutions--
const largestPrimeFactor = (number) => {
let largestFactor = number;
for (let i = 2; i <= Math.sqrt(largestFactor); i++) {
if (!(largestFactor % i)) {
let factor = largestFactor / i;
let candidate = largestPrimeFactor(factor);
return i > candidate ? i : candidate;
}
}
return largestFactor;
}