freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-142-perfect-square-collection.md

---
id: 5900f3fa1000cf542c50ff0d
challengeType: 5
videoUrl: ''
title: 问题142：完美的方形集合
---

## Description
<section id="description">找到具有整数x&gt; y&gt; z&gt; 0的最小x + y + z，使得x + y，x-y，x + z，x-z，y + z，y-z都是完美正方形。 </section>

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

## Tests
<section id='tests'>

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

```

</section>

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

<div id='js-seed'>

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

euler142();

```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```

/section>