-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSplitArrayLargestSum.java
More file actions
52 lines (36 loc) · 1007 Bytes
/
Copy pathSplitArrayLargestSum.java
File metadata and controls
52 lines (36 loc) · 1007 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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
package com.binarySearch;
import com.sun.jmx.snmp.SnmpUnknownMsgProcModelException;
public class SplitArrayLargestSum {
public static void main(String[] args) {
int[] arr = {1,2,3,4,5};
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 pieces = 1;
int sum = 0;
int mid = start + (end - start)/2;
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;
}
}