gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

chore(i18n,curriculum): update translations (#43140)

Browse Source
This commit is contained in:
camperbot
2021-08-09 17:35:35 +09:00
committed by GitHub
parent dd5d2919be
commit 919728131e
64 changed files with 852 additions and 844 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/fibonacci-word.md
View File

@ -1,6 +1,6 @@
---
id: 5992e222d397f00d21122931
title: Fibonacci word
title: Palavra de Fibonacci
challengeType: 5
forumTopicId: 302269
dashedName: fibonacci-word
@ -8,33 +8,33 @@ dashedName: fibonacci-word
# --description--
The Fibonacci Word may be created in a manner analogous to the Fibonacci Sequence [as described here](https://hal.archives-ouvertes.fr/docs/00/36/79/72/PDF/The_Fibonacci_word_fractal.pdf):
A palavra de Fibonacci pode ser criada de forma análoga à Sequência de Fibonacci, [conforme descrito aqui](https://hal.archives-ouvertes.fr/docs/00/36/79/72/PDF/The_Fibonacci_word_fractal.pdf):
<pre>Define F_Word<sub>1</sub> as <strong>1</strong>
Define F_Word<sub>2</sub> as <strong>0</strong>
Form F_Word<sub>3</sub> as F_Word<sub>2</sub> concatenated with F_Word<sub>1</sub> i.e.: <strong>01</strong>
Form F_Word<sub>n</sub> as F_Word<sub>n-1</sub> concatenated with F_word<sub>n-2</sub>
<pre>Defina a F_Word<sub>1</sub> como <strong>1</strong>
Defina a F_Word<sub>2</sub> como <strong>0</strong>
Forme a F_Word<sub>3</sub> como F_Word<sub>2</sub> concatenada com a F_Word <sub>1</sub>, ou seja: <strong>01</strong>
Forme a F_Word<sub>n</sub> como F_Word<sub>n-1</sub> concatenada com a F_word <sub>n-2</sub>
</pre>
# --instructions--
Write a function to return the Fibonacci Words up to `n`. `n` will be provided as a parameter to the function. The function should return an array of objects. The objects should be of the form: `{ N: 1, Length: 1, Entropy: 0, Word: '1' }`.
Escreva uma função para retornar as palavras de Fibonacci até `n`. `n` será fornecido como um parâmetro para a função. A função deve retornar um array de objetos. Os objetos devem estar na forma: `{ N: 1, Length: 1, Entropy: 0, Word: '1' }` (tamanho, entropia e palavra).
# --hints--
`fibWord` should be a function.
`fibWord` deve ser uma função.
```js
assert(typeof fibWord === 'function');
```
`fibWord(5)` should return an array.
`fibWord(5)` deve retornar um array.
```js
assert(Array.isArray(fibWord(5)));
```
`fibWord(5)` should return `[{ N:1, Length:1, Entropy:0, Word:"1" },{ N:2, Length:1, Entropy:0, Word:"0" },{ N:3, Length:2, Entropy:1, Word:"01" },{ N:4, Length:3, Entropy:0.9182958340544896, Word:"010" },{ N:5, Length:5, Entropy:0.9709505944546688, Word:"01001" }]`.
`fibWord(5)` deve retornar `[{ N:1, Length:1, Entropy:0, Word:"1" },{ N:2, Length:1, Entropy:0, Word:"0" },{ N:3, Length:2, Entropy:1, Word:"01" },{ N:4, Length:3, Entropy:0.9182958340544896, Word:"010" },{ N:5, Length:5, Entropy:0.9709505944546688, Word:"01001" }]`.
```js
assert.deepEqual(fibWord(5), ans);