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.1 KiB
1.1 KiB
id, title, challengeType, videoUrl, dashedName
| id | title | challengeType | videoUrl | dashedName |
|---|---|---|---|---|
| 598de241872ef8353c58a7a2 | 评估二项式系数 | 5 | evaluate-binomial-coefficients |
--description--
写一个函数来计算给定n和k值的二项式系数。
推荐这个公式：
$ \\ binom {n} {k} = \\ frac {n！} {（nk）！k！} = \\ frac {n（n-1）（n-2）\\ ldots（n-k + 1）} { k（k-1）（k-2）\\ ldots 1} $--hints--
binom是一个功能。
assert(typeof binom === 'function');
binom(5,3)应该返回10。
assert.equal(binom(5, 3), 10);
binom(7,2)应该返回21。
assert.equal(binom(7, 2), 21);
binom(10,4)应该返回210。
assert.equal(binom(10, 4), 210);
binom(6,1)应该返回6。
assert.equal(binom(6, 1), 6);
binom(12,8)应该返回495。
assert.equal(binom(12, 8), 495);
--seed--
--seed-contents--
function binom(n, k) {
}
--solutions--
function binom(n, k) {
let coeff = 1;
for (let i = n - k + 1; i <= n; i++) coeff *= i;
for (let i = 1; i <= k; i++) coeff /= i;
return coeff;
}