-
Notifications
You must be signed in to change notification settings - Fork 0
/
Split_Array_Largest_Sum.java
67 lines (62 loc) · 1.28 KB
/
Split_Array_Largest_Sum.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
58
59
60
61
62
63
64
65
66
67
public class Split_Array_Largest_Sum {
public int splitArray(int[] nums, int k) {
int s=0;
int e=0;
for(int j:nums) {
s=Math.max(s, j);
e+=j;
}
while(s<e) {
int m=s+(e-s)/2;
int sum=0;
int peices=1;
for(int f:nums) {
if(sum+f>m) {
sum=f;
peices++;
}
else {
sum+=f;
}
}
if(peices>k) {
s=m+1;
}
else {
e=m;
}
}
return s;
}
public static void main(String[] args) {
// TODO Auto-generated method stub
}
static int splitArray(int[] arr , int N, int K) {
int s=0,e=0;
for(int i:arr) {
s=Math.max(s, i);
e+=i;
}
while(s<e) {
int m=s+(e-s)/2;
int sum=0;
int p=1;
for(int k:arr) {
if(sum+k>m) {
sum=k;
p++;
}
else {
sum+=k;
}
}
if(p>K) {
s=m+1;
}
else {
e=m;
}
}
return s;
}
}