freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-52-permuted-multiples.chinese.md

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f3a01000cf542c50feb3	5	Problem 52: Permuted multiples		问题52：置换倍数

Description

可以看出，数字125874及其双精度数251748包含完全相同的数字，但顺序不同。找到最小的正整数x，使得2x，3x，4x，5x和6x包含相同的数字。

Instructions

Tests

tests:
  - text: <code>permutedMultiples()</code>应该返回142857。
    testString: 'assert.strictEqual(permutedMultiples(), 142857, "<code>permutedMultiples()</code> should return 142857.");'

Challenge Seed

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

permutedMultiples();

Solution

// solution required