-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSplit_array_largest_sum.java
More file actions
34 lines (34 loc) · 987 Bytes
/
Split_array_largest_sum.java
File metadata and controls
34 lines (34 loc) · 987 Bytes
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
public class Split_array_largest_sum {
public static void main(String[] args) {
int[] arr = {7, 2, 5, 10, 8};
int m = 2;
System.out.println(splitArray(arr, m));
}
static int splitArray(int[] nums, int m) {
int start=0;
int end=0;
for(int i=0;i<nums.length;i++){
start=Math.max(start,nums[i]);
end+=nums[i];
}
while(start<end){
int mid=start+(end-start)/2;
int sum=0;
int pieces=1;
for(int num:nums){
if(sum+num>mid){
sum=num;
pieces++;
}else{
sum+=num;
}
}
if(pieces>m){
start=mid+1;
}else{
end=mid;
}
}
return end;
}
}