- Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathContiguousSubArray.java
More file actions
Latest commit
108 lines (90 loc) · 1.83 KB
/
Copy pathContiguousSubArray.java
File metadata and controls
108 lines (90 loc) · 1.83 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
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
importjava.io.*;
importjava.util.*;
importjava.text.*;
importjava.math.*;
importjava.util.regex.*;
publicclassContiguousSubArray{
int[] array;
int[] myArray;
intsaved = 0;
intlength;
publicContiguousSubArray(int[] array, intlength){
this.array = array;
this.length = length;
myArray = newint[length];
}
publicbooleanisAllPositive(){
for(inti = 0; i != array.length; ++i){
if(array[i] < 0){
returnfalse;
}
}
returntrue;
}
publicintaddAllElements(){
intsum = 0;
for(inti = 0; i != array.length; ++i){
sum += array[i];
}
returnsum;
};
publicintaddAllPositiveElements(){
intsum = 0;
for(inti = 0; i != array.length; ++i){
if(array[i] > 0){
sum += array[i];
}
}
returnsum;
}
publicintmethod(){
for(inti = 0; i != array.length; ++i){
if(i == 0){
myArray[i] = array[0];
}else{
intone = myArray[i-1];
inttwo = array[i];
intsum = array[i] + myArray[i-1];
if(one > two && one > sum){
if(one > saved){
saved = one;
}
myArray[i] = sum;
}else{
if(two > sum){
myArray[i] = two;
}else{
myArray[i] = sum;
}
}
}
}
if(this.saved > myArray[this.length -1]){
returnsaved;
}else{
returnmyArray[this.length -1];
}
}
publicvoidgo(){
if(isAllPositive()){
System.out.print(addAllElements() + " ");
}else{
System.out.print(method() + " ");
}
System.out.print(addAllPositiveElements());
}
publicstaticvoidmain(String[] args){
Scanners = newScanner(System.in);
intnumTestCases = s.nextInt();
for(inti = 0; i != numTestCases; ++i){
intlength = s.nextInt();
int[] arr = newint[length];
for(intj = 0; j != length; ++j){
arr[j] = s.nextInt();
}
ContiguousSubArrayc = newContiguousSubArray(arr,length);
c.go();
System.out.println();
}
}
}