mirror of
https://github.com/freeCodeCamp/freeCodeCamp.git
synced 2026-05-23 22:00:38 -04:00
116 lines
3.9 KiB
Markdown
116 lines
3.9 KiB
Markdown
---
|
||
id: 5992e222d397f00d21122931
|
||
title: Слово Фібоначчі
|
||
challengeType: 1
|
||
forumTopicId: 302269
|
||
dashedName: fibonacci-word
|
||
---
|
||
|
||
# --description--
|
||
|
||
The Fibonacci Word Sequence may be created in a manner analogous to the Fibonacci Sequence, but it focuses on iterating concatenation.
|
||
|
||
<pre>Визначте F_Слово<sub>1</sub> як <strong>1</strong>
|
||
Визначте F_Слово<sub>2</sub> як <strong>0</strong>
|
||
Форма F_Слова<sub>3</sub> як F_Слова<sub>2</sub> об'єднана з F_Словом<sub>1</sub> тобто: <strong>01</strong>
|
||
Форма F_Слова<sub>n</sub> as F_Слово<sub>n-1</sub> об'єднана з F_Словом<sub>n-2</sub>
|
||
</pre>
|
||
|
||
Entropy calculation is required in this challenge, <a href="https://www.freecodecamp.org/learn/coding-interview-prep/rosetta-code/entropy" target="_blank" rel="noopener noreferrer nofollow">as shown in this Rosetta Code challenge</a>
|
||
|
||
# --instructions--
|
||
|
||
Write a function to return the first `n` Fibonacci Words. The number of `n` is 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' }`. `Entropy` is computed for the string `Word` and rounded to 8 decimal digits of accuracy. Note that the indices of this sequence start at `1`.
|
||
|
||
# --hints--
|
||
|
||
`fibWord` має бути функцією.
|
||
|
||
```js
|
||
assert(typeof fibWord === 'function');
|
||
```
|
||
|
||
`fibWord(5)` should return an 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.91829583, Word:"010" },{ N:5, Length:5, Entropy:0.97095059, Word:"01001" }]`.
|
||
|
||
```js
|
||
assert.deepEqual(fibWord(5), words5);
|
||
```
|
||
|
||
`fibWord(7)` 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.91829583, Word:"010" },{ N:5, Length:5, Entropy:0.97095059, Word:"01001" }, { N:6, Length:8, Entropy:0.954434, Word:'01001010' }, { N:7, Length:13, Entropy:0.9612366, Word:'0100101001001' }]`.
|
||
|
||
```js
|
||
assert.deepEqual(fibWord(7), words7);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --after-user-code--
|
||
|
||
```js
|
||
const words5 = [
|
||
{ 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.91829583, Word: '010' },
|
||
{ N: 5, Length: 5, Entropy: 0.97095059, Word: '01001' }
|
||
];
|
||
|
||
const words7 = [
|
||
{ 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.91829583, Word: '010' },
|
||
{ N: 5, Length: 5, Entropy: 0.97095059, Word: '01001' },
|
||
{ N: 6, Length: 8, Entropy: 0.954434, Word: '01001010' },
|
||
{ N: 7, Length: 13, Entropy: 0.9612366, Word: '0100101001001' }
|
||
];
|
||
```
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function fibWord(n) {
|
||
|
||
}
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// Round to digits
|
||
function roundFloat(num, digits) {
|
||
return Math.round(num * 10.0**digits) / (10.0**digits);
|
||
}
|
||
|
||
// Entropy calculation for string with only 0 and 1
|
||
function entropy(word) {
|
||
function digitEntropy(count) {
|
||
return count < 1 ? 0
|
||
: - count / word.length * Math.log2(count / word.length);
|
||
}
|
||
const numZeros = word.split('').filter(e => e === '0').length;
|
||
const numOnes = word.length - numZeros;
|
||
return roundFloat(digitEntropy(numZeros) + digitEntropy(numOnes), 8);
|
||
}
|
||
|
||
// Compute array of Fibonacci words
|
||
function fibWord(n) {
|
||
return [...Array(n).keys()]
|
||
.reduce((words, i) => {
|
||
const word = i === 0 ? "1"
|
||
: i === 1 ? "0"
|
||
: words[i - 1].Word + words[i - 2].Word;
|
||
words.push(
|
||
{ N: i + 1, Length: word.length, Entropy: entropy(word), Word: word }
|
||
);
|
||
return words;
|
||
}, []);
|
||
}
|
||
```
|