freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-38-pandigital-multi...

56 lines
1.3 KiB
Markdown
Raw Normal View History

---
id: 5900f3931000cf542c50fea5
challengeType: 5
title: 'Problem 38: Pandigital multiples'
videoUrl: ''
localeTitle: 问题38Pandigital倍数
---
## Description
<section id="description">取数字192并乘以1,2和3中的每一个192×1 = 192 192×2 = 384 192×3 = 576通过连接每个产品我们得到1到9 pandigital192384576。我们将调用192384576 192和1,2,3的连接产物。通过从9开始并乘以1,2,3,4和5可以实现相同的目的得到pandigital918273645它是9和1,2,3,4,5的连接产物。什么是最大的1到9 pandigital 9位数字可以形成一个整数与1,2... <var>n</var> )的连接乘积,其中<var>n</var> &gt; 1 </section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: pandigitalMultiples <code>pandigitalMultiples()</code>应返回932718654。
testString: 'assert.strictEqual(pandigitalMultiples(), 932718654, "<code>pandigitalMultiples()</code> should return 932718654.");'
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function pandigitalMultiples() {
// Good luck!
return true;
}
pandigitalMultiples();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>