-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathrecursion.js
More file actions
59 lines (50 loc) · 1.09 KB
/
recursion.js
File metadata and controls
59 lines (50 loc) · 1.09 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
58
59
// Complete the following functions.
/* eslint-disable*/
const nFibonacci = (n) => {
switch (n) {
case 0:
return 1;
case 1:
return 1;
default:
return nFibonacci(n - 1) + nFibonacci(n - 2);
}
// fibonacci sequence: 1 2 3 5 8 13 ...
// return the nth number in the sequence
};
const nFactorial = (n) => {
if (n < 0)
return -1;
if (n === 0)
return 1;
else {
return (n * nFactorial(n - 1));
}
// factorial example: !5 = 5 * 4 * 3 * 2 * 1
// return the factorial of `n`
};
/* Extra Credit */
const checkMatchingLeaves = (obj) => {
// return true if every property on `obj` is the same
// otherwise return false
const matchingLeaves = [];
function checkmatches(leaves) {
if (Object(leaves) === leaves) {
Object.keys(leaves).map(key => leaves[key]).forEach(child => {
checkmatches(child);
});
}
else
{
matchingLeaves.push(leaves);
}
}
checkmatches(obj);
return matchingLeaves.every(value => value === matchingLeaves[0]);
};
/* eslint-enable no-unused-vars */
module.exports = {
nFibonacci,
nFactorial,
checkMatchingLeaves,
};