Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
37 lines (30 loc) · 801 Bytes

File metadata and controls

37 lines (30 loc) · 801 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
package InterviewBit.Arrays.ArrayMath;
// https://www.interviewbit.com/problems/partitions/
// Partitions
import java.util.*;
public class Problem7 {
public int solve(int A, ArrayList<Integer> B) {
long pre = 0;
for(int i: B){
pre += i;
}
if(pre%3 != 0) return 0;
long[] index = new long[A+1];
long sf = 0;
for(int i = A-1; i >= 0; i--){
sf += B.get(i);
if(sf == pre/3) index[i] = 1;
}
for(int i = 1; i < A; i++){
index[i] += index[i-1];
}
pre = pre/3;
long t = 0;
int ans = 0;
for(int i = 0; i < A-1; i++){
t += B.get(i);
if(t == pre) ans += index[A-1] - index[i+1];
}
return ans;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.