freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-178-step-numbers.md

---
id: 5900f41e1000cf542c50ff31
challengeType: 5
videoUrl: ''
title: 问题178：步骤编号
---

## Description
<section id="description">考虑数字45656.可以看出，45656的每对连续数字的差值为1。每对连续数字的差值为1的数字称为步数。 pandigital数字包含从0到9的每个十进制数字至少一次。 <p>有多少pandigital步数小于1040？ </p></section>

## Instructions
<section id="instructions">
</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler178()</code>应该返回126461847755。
    testString: assert.strictEqual(euler178(), 126461847755);

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

```js
function euler178() {
  // Good luck!
  return true;
}

euler178();

```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```

/section>