-
Notifications
You must be signed in to change notification settings - Fork 8
/
Copy pathPrintSubarrays.java
57 lines (51 loc) · 1.54 KB
/
PrintSubarrays.java
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
import javax.lang.model.element.Element;
/*
* Print Subarrays
* Subarrays --> a continuous part of array
*
* Ex-> Array= {2,4,6,8,10};
*
* --> { 2 } { 2 4 } { 2 4 6 } { 2 4 6 8 } { 2 4 6 8 10 }
* { 4 } { 4 6 } { 4 6 8 } { 4 6 8 10 }
* { 6 } { 6 8 } { 6 8 10 }
* { 8 } { 8 10 }
* { 10 }
*
*/
public class PrintSubarrays {
public static void printSubarrays(int array[]) {
int smallest =Integer.MAX_VALUE , largest=Integer.MIN_VALUE;
for (int i = 0; i < array.length; i++) {
for (int j = i; j < array.length; j++) {
int sum=0;
System.out.print("{ ");
for (int k = i; k <= j; k++) {
System.out.print(array[k] + " ");
sum+=array[k];
}
largest=Math.max(sum,largest);
smallest=Math.min(sum,smallest);
System.out.print("} ");
}
System.out.println();
}
System.out.println("Smallest sum of Subarray: " + smallest);
System.out.println("Largest sum of Subarray: " + largest);
}
public static void main(String[] args) {
int array[] = { 2, 4, 6, 8, 10 };
printSubarrays(array);
}
}
/*
*
* Output:
* { 2 } { 2 4 } { 2 4 6 } { 2 4 6 8 } { 2 4 6 8 10 }
* { 4 } { 4 6 } { 4 6 8 } { 4 6 8 10 }
* { 6 } { 6 8 } { 6 8 10 }
* { 8 } { 8 10 }
* { 10 }
* Smallest sum of Subarray: 2
* Largest sum of Subarray: 30
*
*/