-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy patha85_prfixSum.java
More file actions
49 lines (32 loc) · 1.22 KB
/
a85_prfixSum.java
File metadata and controls
49 lines (32 loc) · 1.22 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
public class a85_prfixSum {
public static void prefixSum(int arr[]){
int sum = 0;
int largest = Integer.MIN_VALUE;
int prefix[] = new int[arr.length]; // Create a new array, Its length is same as arr length
prefix[0] = arr[0];
// for calculate the prefix array[add ith index value of arr into the prefix array i-1 element]
for(int i = 1; i < arr.length; i++){
prefix[i] = prefix[i-1] + arr[i];
}
for(int i = 0; i < arr.length; i++){
for(int j = i; j < arr.length; j++){
if(i == 0){
sum = prefix[j];
System.out.println("Sum is: " + sum);
}
else{
sum = prefix[j] - prefix[i-1];
System.out.println("Sum is: " + sum);
}
if(sum > largest){
largest = sum;
}
}
}
System.out.println("The largest sum of sub arrays is: " + largest);
}
public static void main(String[] args) {
int arr[] = { 1, -2, 6, -1, 3 };
prefixSum(arr);
}
}