-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathrecursion.js
More file actions
53 lines (46 loc) · 1.19 KB
/
recursion.js
File metadata and controls
53 lines (46 loc) · 1.19 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
// Complete the following functions.
const nFibonacci = (n) => {
// fibonacci sequence: 1 1 2 3 5 8 13 ...
// return the nth number in the sequence
if (n <= 2) {
return 1;
}
return nFibonacci(n - 2) + nFibonacci(n - 1);
};
const nFactorial = (n) => {
// factorial example: !5 = 5 * 4 * 3 * 2 * 1
// return the factorial of `n`
if (n === 0) {
return 1;
}
return n * nFactorial(n - 1);
};
/* Extra Credit */
const referenceValue = [];
const checkMatchingLeaves = (obj) => {
// return true if every property on `obj` is the same
// otherwise return false
const ogObjectValues = Object.values(obj);
referenceValue.push(ogObjectValues[0]);
const fixedReference = referenceValue[0];
let result = true;
const tempValues = Object.values(obj);
tempValues.forEach((element) => {
if (element !== fixedReference && typeof element !== 'object') {
result = false;
}
if (typeof element === 'object') {
const thisValue = checkMatchingLeaves(element);
if (thisValue === false) {
result = false;
}
}
});
return result;
};
/* eslint-enable no-unused-vars */
module.exports = {
nFibonacci,
nFactorial,
checkMatchingLeaves,
};