andre/30-seconds-of-code
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Merge pull request #289 from kingdavidmartins/update-fib

Browse Source 
Update fib Array() -> Array.from()
This commit is contained in:
Angelos Chalaris
2017-12-21 14:33:09 +02:00
committed by GitHub
parent 2522e489c5 4ff3f4f5fd
commit 833ee4cff5
2 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
README.md
View File

@ -1242,7 +1242,7 @@ Use `Array.reduce()` to add values into the array, using the sum of the last two
```js ```js
const fibonacci = n => const fibonacci = n =>
Array(n).fill(0).reduce((acc, val, i) => acc.concat(i > 1 ? acc[i - 1] + acc[i - 2] : i), []); Array.from({ length: n}).map(v => 0).reduce((acc, val, i) => acc.concat(i > 1 ? acc[i - 1] + acc[i - 2] : i), []);
// fibonacci(5) -> [0,1,1,2,3] // fibonacci(5) -> [0,1,1,2,3]
``` ```

2
snippets/fibonacci.md
View File

@ -7,6 +7,6 @@ Use `Array.reduce()` to add values into the array, using the sum of the last two
```js ```js
const fibonacci = n => const fibonacci = n =>
Array(n).fill(0).reduce((acc, val, i) => acc.concat(i > 1 ? acc[i - 1] + acc[i - 2] : i), []); Array.from({ length: n}).map(v => 0).reduce((acc, val, i) => acc.concat(i > 1 ? acc[i - 1] + acc[i - 2] : i), []);
// fibonacci(5) -> [0,1,1,2,3] // fibonacci(5) -> [0,1,1,2,3]
``` ```