freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-4-largest-palindrome-product.chinese.md

id	challengeType	title	videoUrl	localeTitle
5900f3701000cf542c50fe83	5	Problem 4: Largest palindrome product		问题4：最大的回文产品

Description

回文数字读取两种方式相同。由两个2位数字的乘积制成的最大回文是9009 = 91×99。找到由两个n数字的乘积制成的最大回文。

Instructions

Tests

tests:
  - text: <code>largestPalindromeProduct(2)</code>应返回9009。
    testString: 'assert.strictEqual(largestPalindromeProduct(2), 9009, "<code>largestPalindromeProduct(2)</code> should return 9009.");'
  - text: <code>largestPalindromeProduct(3)</code>应返回906609。
    testString: 'assert.strictEqual(largestPalindromeProduct(3), 906609, "<code>largestPalindromeProduct(3)</code> should return 906609.");'

Challenge Seed

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

largestPalindromeProduct(3);

Solution

// solution required