freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-36-double-base-palindromes.chinese.md

id	challengeType	title	videoUrl	localeTitle
5900f3901000cf542c50fea3	5	Problem 36: Double-base palindromes		问题36：双基回文

Description

十进制数，585 = 10010010012（二进制），在两个碱基中都是回文。找到所有数字的总和，小于n，而1000 <= n <= 1000000，它们在基数10和基数2中是回文的。（请注意，任一基数中的回文数可能不包括前导零。）

Instructions

Tests

tests:
  - text: <code>doubleBasePalindromes(1000)</code>应该返回1772。
    testString: 'assert(doubleBasePalindromes(1000) == 1772, "<code>doubleBasePalindromes(1000)</code> should return 1772.");'
  - text: <code>doubleBasePalindromes(50000)</code>应该返回105795。
    testString: 'assert(doubleBasePalindromes(50000) == 105795, "<code>doubleBasePalindromes(50000)</code> should return 105795.");'
  - text: <code>doubleBasePalindromes(500000)</code>应该返回286602。
    testString: 'assert(doubleBasePalindromes(500000) == 286602, "<code>doubleBasePalindromes(500000)</code> should return 286602.");'
  - text: <code>doubleBasePalindromes(1000000)</code>应该返回872187。
    testString: 'assert(doubleBasePalindromes(1000000) == 872187, "<code>doubleBasePalindromes(1000000)</code> should return 872187.");'

Challenge Seed

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

doubleBasePalindromes(1000000);

Solution

// solution required