freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-208-robot-walks.chi...

56 lines
1.1 KiB
Markdown
Raw Normal View History

---
id: 5900f43f1000cf542c50ff51
challengeType: 5
title: 'Problem 208: Robot Walks'
videoUrl: ''
localeTitle: 问题208机器人走路
---
## Description
<section id="description">机器人以一系列五分之一圆弧72°移动每个步骤可自由选择顺时针或逆时针弧但不能转动现场。 <p>从北向南开始的70932条可能的闭合路径之一是</p><p>鉴于机器人开始面向北方在最终弧线之后可以将多少70个弧长的行程返回到其起始位置 (任何弧都可以多次遍历。) </p></section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler208()</code>应该返回331951449665644800。
testString: 'assert.strictEqual(euler208(), 331951449665644800, "<code>euler208()</code> should return 331951449665644800.");'
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler208() {
// Good luck!
return true;
}
euler208();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>