- Notifications
You must be signed in to change notification settings - Fork 366
/
Copy pathSplitArray.java
43 lines (36 loc) · 1.01 KB
/
SplitArray.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
publicclassSplitArray {
publicstaticvoidmain(String[] args) {
int[] nums = {7,2,5,10,8};
intm = 2;
System.out.println(splitArray(nums, m));
}
staticintsplitArray(int[] nums, intm) {
ints = nums[0];
inte = 0;
for(intnum : nums){
s = num > s ? num : s;
e += num;
}
while(s < e){
intmid = s + (e-s)/2;
if( isPotentialLargestSum(mid, nums, m) ){
e = mid;
} else{
s = mid + 1;
}
}
returns; //e is also ok as they both are pointing to the same element ie ans
}
staticbooleanisPotentialLargestSum(intestimatedLargest, int[] nums, intpiecesAsked) {
intpieces = 1;
intsum = 0;
for(intnum : nums){
if(sum + num > estimatedLargest){
sum = 0;
pieces++;
}
sum += num;
}
returnpieces <= piecesAsked;
}
}