freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-...

56 lines
969 B
Markdown
Raw Normal View History

---
id: 5900f4591000cf542c50ff6c
challengeType: 5
videoUrl: ''
localeTitle: 问题237在4 x n游戏板上游览
---
## Description
<section id="description">设Tn为4×n游戏板上的游览次数使得游览从左上角开始。巡视包括向上向下向左或向右一个方格的移动。游览访问每个广场一次。游览结束于左下角。该图显示了4×10板上的一次巡视 <p> T10是2329.什么是T1012模108 </p></section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler237()</code>应该返回15836928。
testString: assert.strictEqual(euler237(), 15836928);
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler237() {
// Good luck!
return true;
}
euler237();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
/section>