-
Notifications
You must be signed in to change notification settings - Fork 0
/
lesson9.js
82 lines (61 loc) · 1.69 KB
/
lesson9.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
//double Slices stack overflow
function solution(A) {
let maxsum = 0;
let max_end_at = Array(A.length);
let max_start_at = Array(A.length);
max_end_at[0] = max_start_at[0] = max_start_at[A.length - 1] = max_end_at[A.length - 1] = 0;
let { max } = Math;
for (let i = 1; i < A.length - 1; i++) {
max_end_at[i] = max(0, max_end_at[i - 1] + A[i]);
}
for (let n = A.length - 2; n > 0; n--) {
max_start_at[n] = max(0, max_start_at[n + 1] + A[n]);
}
for (let m = 1; m < A.length - 1; m++) {
maxsum = max(maxsum, max_end_at[m - 1] + max_start_at[m + 1]);
}
return maxsum;
}
//maxDoubleslicesum
function solution(A) {
var max = 0;
for (i=0; i<=A.length - 4; i++) {
for(y=3; y<A.length-i;y++) {
var sum = 0;
for (z=i+1; z<i+y; z++) {
sum = sum + A[z];
}
for (w=i+1; w<i+y;w++) {
if (max < sum - A[w]) (max = sum - A[w]);
}
}
}
return max;
}
//maxProfit
function solution(A) {
let maximumProfit = 0
let firstIndex = 0
for (i = 0; i < A.length - 1; i++) {
let biggest = A[i + 1]
for (j = i + 1; j < A.length; j++) {
biggest = A[j] > biggest ? A[j] : biggest
}
maximumProfit = (biggest - A[i]) > maximumProfit ? (biggest - A[i]) : maximumProfit
}
return maximumProfit
}
//maxSliceSum
function solution(A) {
let maxArray = A[0]
let { max } = Math
for (i=0; i < A.length; i++) {
let sum = A[i]
maxArray = max(maxArray, sum)
for (x=i+1; x < A.length; x++) {
sum = sum + A[x]
maxArray = max(maxArray, sum)
}
}
return maxArray
}