forked from zero-to-mastery/JS_Fun_Practice
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdavid_001_solutions.js
79 lines (66 loc) · 1.19 KB
/
david_001_solutions.js
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
77
78
79
function identity(x){
return x;
}
function addb(a,b){
return a+b;
}
function subb(a,b){
return a-b;
}
function mulb(a,b){
return a*b;
}
function minb(a, b){
return a<b ? a : b;
}
function maxb(a, b){
return a>b ? a : b;
}
function add(...nums){
let sum=0;
for(let i=0; i<nums.length; i++){
sum += nums[i];
}
return sum;
}
function sub(...nums){
let diff=nums[0];
for(let i=1; i<nums.length; i++){
diff -= nums[i];
}
return diff;
}
function mul(...nums){
let prod=1;
for(let i=0; i<nums.length; i++){
prod *= nums[i];
}
return prod;
}
function min(...nums){
let ans=99999999;
for(let i=0; i<nums.length; i++){
ans = nums[i]<ans ? nums[i] : ans;
}
return ans;
}
function max(...nums){
let ans=-99999999;
for(let i=0; i<nums.length; i++){
ans = nums[i]>ans ? nums[i] : ans;
}
return ans;
}
function addRecurse(...nums){
if(nums.length==1){
return nums[0];
}
return nums.pop() + addRecurse(...nums);
}
function mulRecurse(...nums){
if(nums.length==1){
return nums[0];
}
return nums.pop() * mulRecurse(...nums);
}
module.exports = {identity, addb, subb, mulb, minb, maxb, add, sub, mul, min, max, addRecurse, mulRecurse};