gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

chore(learn): Applied MDX format to Chinese curriculum files (#40462)

Browse Source
This commit is contained in:
Randell Dawson
2020-12-16 00:37:30 -07:00
committed by GitHub
parent 873fce02a2
commit 9ce4a02a41
1665 changed files with 58741 additions and 88042 deletions
Download Patch File Download Diff File Expand all files Collapse all files

50
curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-34-digit-factorials.md
View File

@ -1,57 +1,21 @@
---
id: 5900f38e1000cf542c50fea1
title: 问题34：数字阶乘
challengeType: 5
videoUrl: ''
title: 问题34：数字阶乘
---
## Description
<section id="description"> 145是一个奇怪的数字，为1！ + 4！ + 5！ = 1 + 24 + 120 = 145.找到数字和数字的总和，它们等于数字的阶乘之和。注意：为1！ = 1和2！ = 2不是它们不包括在内的总和。 </section>
# --description--
## Instructions
<section id="instructions">
</section>
145是一个奇怪的数字，为1！ + 4！ + 5！ = 1 + 24 + 120 = 145.找到数字和数字的总和，它们等于数字的阶乘之和。注意：为1！ = 1和2！ = 2不是它们不包括在内的总和。
## Tests
<section id='tests'>
# --hints--
```yml
tests:
- text: '<code>digitFactorial()</code>应该返回{sum：40730，数字：[145,40585]}。'
testString: "assert.deepEqual(digitFactorial(), { sum: 40730, numbers: [145, 40585] });"
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
`digitFactorial()`应该返回{sum：40730，数字：[145,40585]}。
```js
function digitFactorial() {
// Good luck!
var sum = 0;
var numbers = [];
return { sum, numbers };
}
digitFactorial();
assert.deepEqual(digitFactorial(), { sum: 40730, numbers: [145, 40585] });
```
</div>
# --solutions--
</section>
## Solution
<section id='solution'>
```js
// solution required
```
/section>