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

891 B
Raw Blame History

id, challengeType, videoUrl, title
id challengeType videoUrl title
5900f41e1000cf542c50ff31 5 问题178步骤编号

Description

考虑数字45656.可以看出45656的每对连续数字的差值为1。每对连续数字的差值为1的数字称为步数。 pandigital数字包含从0到9的每个十进制数字至少一次。

有多少pandigital步数小于1040

Instructions

Tests

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

Challenge Seed

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

euler178();

Solution

// solution required

/section>