Files
freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-34-digit-factorials.md
Oliver Eyton-Williams dec409a4bd fix: s/localeTitle/title/g
2020-10-06 23:10:08 +05:30

58 lines
979 B
Markdown
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

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