-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathrecursion.js
More file actions
67 lines (60 loc) · 1.14 KB
/
recursion.js
File metadata and controls
67 lines (60 loc) · 1.14 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
60
61
62
63
64
65
66
67
// Complete the following functions.
const nFibonacci = (n) => {
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 === 0) {
return 1;
}
return n * nFactorial(n - 1);
};
/* Extra Credit */
const checkMatchingLeaves = (obj) => {
let tester;
let flag = true;
const checkLeaves = (object) => {
// console.log(Object.keys(object));
Object.keys(object).forEach((elem) => {
if (tester === undefined && typeof elem !== 'object') {
tester = object[elem];
}
if (typeof object[elem] === 'object') {
return checkLeaves(object[elem]);
}
if (object[elem] !== tester) {
flag = false;
}
});
};
checkLeaves(obj);
return flag;
};
const tree1 = {
x: 1,
y: 1,
z: 1,
xa: {
xx: 1,
xy: 1,
xz: 1,
zz: {
a: {
b: {
z: 1,
},
},
},
},
};
checkMatchingLeaves(tree1);
/* eslint-enable no-unused-vars */
module.exports = {
nFibonacci,
nFactorial,
checkMatchingLeaves,
};