Files
freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-36-double-base-palindromes.chinese.md
Kristofer Koishigawa b3213fc892 fix(i18n): chinese test suite (#38220)
* fix: Chinese test suite

Add localeTiltes, descriptions, and adjust test text and testStrings to get the automated test suite working.

* fix: ran script, updated testStrings and solutions
2020-03-03 18:49:47 +05:30

62 lines
1.4 KiB
Markdown
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

---
id: 5900f3901000cf542c50fea3
challengeType: 5
title: 'Problem 36: Double-base palindromes'
videoUrl: ''
localeTitle: 问题36双基回文
---
## Description
<section id="description">十进制数585 = 10010010012二进制在两个碱基中都是回文。找到所有数字的总和小于n而1000 &lt;= n &lt;= 1000000它们在基数10和基数2中是回文的。请注意任一基数中的回文数可能不包括前导零。 </section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>doubleBasePalindromes(1000)</code>应该返回1772。
testString: assert(doubleBasePalindromes(1000) == 1772);
- text: <code>doubleBasePalindromes(50000)</code>应该返回105795。
testString: assert(doubleBasePalindromes(50000) == 105795);
- text: <code>doubleBasePalindromes(500000)</code>应该返回286602。
testString: assert(doubleBasePalindromes(500000) == 286602);
- text: <code>doubleBasePalindromes(1000000)</code>应该返回872187。
testString: assert(doubleBasePalindromes(1000000) == 872187);
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function doubleBasePalindromes(n) {
// Good luck!
return n;
}
doubleBasePalindromes(1000000);
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>