ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
68 lines
1.1 KiB
Markdown
68 lines
1.1 KiB
Markdown
---
|
||
id: 597f24c1dda4e70f53c79c81
|
||
title: 斐波那契序列
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: fibonacci-sequence
|
||
---
|
||
|
||
# --description--
|
||
|
||
<p>编写一个函数来生成第<big>n <sup>个</sup></big> Fibonacci数。 </p> /// <p>第<big>n <sup>个</sup></big> Fibonacci数由下式给出：/// </p><p> F <sub>n</sub> = F <sub>n-1</sub> + F <sub>n-2</sub> </p> /// <p>该系列的前两个术语是0,1。 </p> /// <p>因此，该系列是：0,1,1,2,3,5,8,13 ...... </p> ///
|
||
|
||
# --hints--
|
||
|
||
`fibonacci`是一种功能。
|
||
|
||
```js
|
||
assert(typeof fibonacci === 'function');
|
||
```
|
||
|
||
`fibonacci(2)`应该返回一个数字。
|
||
|
||
```js
|
||
assert(typeof fibonacci(2) == 'number');
|
||
```
|
||
|
||
`fibonacci(3)`应该返回1.“）
|
||
|
||
```js
|
||
assert.equal(fibonacci(3), 1);
|
||
```
|
||
|
||
`fibonacci(5)`应该返回3.“）
|
||
|
||
```js
|
||
assert.equal(fibonacci(5), 3);
|
||
```
|
||
|
||
`fibonacci(10)`应该返回34.“）
|
||
|
||
```js
|
||
assert.equal(fibonacci(10), 34);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function fibonacci(n) {
|
||
|
||
}
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
function fibonacci(n) {
|
||
let a = 0, b = 1, t;
|
||
while (--n >= 0) {
|
||
t = a;
|
||
a = b;
|
||
b += t;
|
||
}
|
||
return a;
|
||
}
|
||
```
|