-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathrecursion.js
More file actions
52 lines (46 loc) · 1.32 KB
/
Copy pathrecursion.js
File metadata and controls
52 lines (46 loc) · 1.32 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
// Complete the following functions.
const nFibonacci = (n) => {
// fibonacci sequence: 1 2 3 5 8 13 ...
// return the nth number in the sequence
let result = 1;
let prevNum = 1;
const helper = (num) => {
if (n === 0) return;
prevNum = result;
result = num;
n -= 1;
return helper(result + prevNum);
};
helper(result);
return result;
};
// or const nFibonacci = n => n < 2 ? 1 : nFibonacci(n - 2) + nFibonacci(n - 1);
const nFactorial = (n) => {
// factorial example: !5 = 5 * 4 * 3 * 2 * 1
// return the factorial of `n`
return n === 0 ? 1 : nFactorial(n - 1) * n;
};
/* Extra Credit */
const checkMatchingLeaves = (obj) => {
// return true if every property on `obj` is the same
// otherwise return false
const vals = [];
const helper = (newObj) => {
const props = Object.keys(newObj);
props.forEach((prop) => { // or !!newObj[prop] && newObj[prop].constructor === Object or Object(newObj[prop]) === newObj[prop]
if (typeof newObj[prop] === 'object' && newObj[prop] !== null && !Array.isArray(newObj[prop])) {
helper(newObj[prop]);
return;
}
vals.push(newObj[prop]);
});
};
helper(obj);
return vals.every(val => val === vals[0]);
};
/* eslint-enable no-unused-vars */
module.exports = {
nFibonacci,
nFactorial,
checkMatchingLeaves,
};