-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathFunctions.js
145 lines (142 loc) · 2.65 KB
/
Functions.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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
// Iteración #1:
function sum(numberOne, numberTwo) {
if (numberOne > numberTwo) {
return numberOne;
} else {
return numberTwo;
}
}
//Iteración #2
const avengers = [
"Hulk",
"Thor",
"IronMan",
"Captain A.",
"Spiderman",
"Captain M.",
];
function findLongestWord(param) {
if (Array.isArray(param)) {
let len = [];
param.forEach((a) => len.push(a.length));
let index = len.map((x) => x);
let max = len.sort((a, b) => a - b).pop();
return param[index.indexOf(max)];
} else {
return "No es un array";
}
}
// Iteración #3
const numbers = [1, 2, 3, 5, 45, 37, 58];
function sumAll(param) {
if (Array.isArray(param)) {
return param.reduce((a, b) => a + b);
} else {
return "No es un array";
}
}
// Iteración #4
const numbers = [12, 21, 38, 5, 45, 37, 6];
function average(param) {
if (Array.isArray(param)) {
return param.reduce((a, b) => a + b) / numbers.length;
} else {
return "No es un array";
}
}
// Iteración #5
const mixedElements = [6, 1, "Rayo", 1, "vallecano", "10", "upgrade", 8, "hub"];
function averageWord(param) {
if (Array.isArray(param)) {
let numbers = [];
param.forEach((d) => {
if (typeof d == "string") {
numbers.push(d.length);
} else {
numbers.push(d);
}
});
return numbers.reduce((a, b) => a + b) / numbers.length;
} else {
return "No es un array";
}
}
// Iteración #6
const duplicates = [
"sushi",
"pizza",
"burger",
"potatoe",
"pasta",
"ice-cream",
"pizza",
"chicken",
"onion rings",
"pasta",
"soda",
];
function removeDuplicates(param) {
if (Array.isArray(param)) {
let unique = new Set();
param.forEach((d) => unique.add(d));
return unique;
} else {
return "No es un array";
}
}
// Iteración #7
const nameFinder = [
"Peter",
"Steve",
"Tony",
"Natasha",
"Clint",
"Logan",
"Xabier",
"Bruce",
"Peggy",
"Jessica",
"Marc",
];
function finderName(param, value) {
if (Array.isArray(param, value)) {
if (param.indexOf(value) > 0) {
return [true, param.indexOf(value)];
} else {
return false;
}
} else {
return "No es un array";
}
}
// Iteración #8
const counterWords = [
"code",
"repeat",
"eat",
"sleep",
"code",
"enjoy",
"sleep",
"code",
"enjoy",
"upgrade",
"code",
];
function repeatCounter(param) {
let result = [];
let counter = [];
if (Array.isArray(param)) {
param.forEach((d) => {
if (counter.indexOf(d) < 0) {
counter.push(d);
result.push([d, 1]);
} else {
result[counter.indexOf(d)][1]++;
}
});
return result;
} else {
return "No es un array";
}
}