freeCodeCamp/problem-4-largest-palindrome-product.chinese.md at b99d78858be1d1ab1aae3417e00c38a458a72ae3

Files

Oliver Eyton-Williams 61460c8601 fix: insert blank line after ```

search and replace ```\n< with ```\n\n< to ensure there's an empty line
before closing tags

2020-08-16 04:45:20 +05:30

1.0 KiB

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

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);
  - text: <code>largestPalindromeProduct(3)</code>应返回906609。
    testString: assert.strictEqual(largestPalindromeProduct(3), 906609);

Challenge Seed

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

largestPalindromeProduct(3);

Solution

// solution required

/section>

1.0 KiB Raw Blame History Unescape Escape