-
Notifications
You must be signed in to change notification settings - Fork 0
/
lesson6.js
79 lines (61 loc) · 1.86 KB
/
lesson6.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
//elementos únicos num array
function solution(A) {
var seen = {};
return A.filter(function(value) {
return seen.hasOwnProperty(value) ? false : (seen[value] = true);
}).length;
}
//maior tripla
function sortArray(a, b) {
return b - a;
}
function solution(A) {
var sortedArray = A.sort(sortArray);
var length = sortedArray.length;
var solutions = []
solutions.push(sortedArray[0] * sortedArray[1] * sortedArray[2])
solutions.push(sortedArray[0] * sortedArray[1] * sortedArray[length - 1])
solutions.push(sortedArray[length - 1] * sortedArray[length - 2] * sortedArray[length - 3])
solutions.push(sortedArray[length - 1] * sortedArray[length - 2] * sortedArray[0])
return solutions.sort(sortArray)[0];
}
//find triangle
function sortArray(a, b) {
return b - a;
}
function solution(array) {
var sortedArray = array.sort(sortArray);
for (i = 0; i < sortedArray.length - 2; i++) {
if ((sortedArray[i] + sortedArray[i + 1] > sortedArray[i + 2]) &&
(sortedArray[i + 1] + sortedArray[i + 2] > sortedArray[i]) &&
(sortedArray[i] + sortedArray[i + 2] > sortedArray[i + 1])) {
return 1;
}
}
return 0;
}
//find intersections
function solution(array) {
var arrays = [];
var count = 0;
array.map(function(value, index) {
var newArray = [];
for (i = index - value; i <= index + value; i ++) {
newArray.push(i);
}
arrays.push(newArray);
});
var current = arrays.pop();
while (arrays.length > 0) {
arrays.map(function(value, index) {
var filter = value.filter(function(n) {
return current.indexOf(n) > -1;
});
if (filter.length > 0) {
count++;
}
});
current = arrays.pop();
}
return count;
}