-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathrecursion.js
More file actions
76 lines (70 loc) · 1.14 KB
/
recursion.js
File metadata and controls
76 lines (70 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
68
69
70
71
72
73
74
75
76
// Complete the following functions.
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);
};
/* Extra Credit */
const obj = [
1,
1,
1,
[
[
1,
1,
[
1,
[
1,
[
[
1,
],
2,
],
1,
],
1,
],
],
1,
1,
],
1,
1,
[
1,
1,
1,
],
];
console.log(obj);
const checkMatchingLeaves = (obj) => {
let arr = [];
if (Array.isArray(obj)) {
obj.forEach((item) => {
return checkMatchingLeaves(item);
arr = item;
}
);
}
arr.reduce(function(a, b) {
return (a === b);
}
};
// return true if every property on `obj` is the same
// otherwise return false
/* eslint-enable no-unused-vars */
module.exports = {
nFibonacci,
nFactorial,
checkMatchingLeaves,
};