-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathrecursion.js
More file actions
57 lines (50 loc) · 1.46 KB
/
Copy pathrecursion.js
File metadata and controls
57 lines (50 loc) · 1.46 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
// Complete the following functions.
const arrayMethods = require('../src/arrays');
const objectMethods = require('../src/objects');
const nFibonacci = (n) => {
// fibonacci sequence: 1 2 3 5 8 13 ...
// return the nth number in the sequence
if (n < 2) {
return 1;
}
return nFibonacci(n - 1) + nFibonacci(n - 2);
};
const nFactorial = (n) => {
// factorial example: !5 = 5 * 4 * 3 * 2 * 1
// return the factorial of `n`
if (n === 1) {
return 1;
}
return n * nFactorial(n - 1);
};
const checkMatchingLeaves = (obj) => {
// return true if every property on obj is the same
// otherwise return
//
// Used an array to store an undefined value.
// If I used something like leaf = undefined and looped
// through checking if leaf was still undefined,
// it would return true in cases where some
// object's values were set to undefined
// and all others were set to 1 or whatever else
const leaves = [];
const getLeaves = (branch) => {
// if it finds more than two leaves, it skips over everything else
if (leaves.length <= 1) {
if (typeof branch === 'object') {
arrayMethods.each(objectMethods.values(branch), twig => getLeaves(twig));
} else if (leaves.indexOf(branch) < 0) {
leaves.push(branch);
}
}
};
getLeaves(obj);
// empty object is truthy
return leaves.length <= 1;
};
/* eslint-enable no-unused-vars */
module.exports = {
nFibonacci,
nFactorial,
checkMatchingLeaves
};