freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-39-integer-right-triangles.md

id	challengeType	videoUrl	localeTitle
5900f3931000cf542c50fea6	5		问题39：整数直角三角形

Description

如果p是具有整数长度边的直角三角形的周长{a，b，c}，则对于p = 120，恰好有三个解。{20,48,52}，{24,45,51}，{ 30,40,50}对于p≤n的值，最大化解的数量是多少？

Instructions

Tests

tests:
  - text: <code>intRightTriangles(500)</code>应该返回420。
    testString: assert(intRightTriangles(500) == 420);
  - text: <code>intRightTriangles(800)</code>应该返回420。
    testString: assert(intRightTriangles(800) == 720);
  - text: <code>intRightTriangles(900)</code>应该返回840。
    testString: assert(intRightTriangles(900) == 840);
  - text: <code>intRightTriangles(1000)</code>应该返回840。
    testString: assert(intRightTriangles(1000) == 840);

Challenge Seed

function intRightTriangles(n) {
  // Good luck!
  return n;
}

intRightTriangles(1000);

Solution

// solution required

/section>