-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
985.java
55 lines (47 loc) · 1.78 KB
/
985.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
__________________________________________________________________________________________________
sample 2 ms submission
class Solution {
public int[] sumEvenAfterQueries(int[] A, int[][] queries) {
int sum = 0;
for (int i = 0; i < A.length; i++) {
sum += (A[i] & 1 ^ 1) * A[i];
}
int[] result = new int[queries.length];
for (int index = 0; index < queries.length; index++) {
int pos = queries[index][1];
//System.out.println(""+A[pos]+" "+isEven[pos]);
sum -= (A[pos] & 1 ^ 1) * A[pos];
A[pos] += queries[index][0];
sum += (A[pos] & 1 ^ 1) * A[pos];
//System.out.println(""+A[pos]+" "+isEven[pos]);
result[index] = sum;
}
return result;
}
}
__________________________________________________________________________________________________
sample 56432 kb submission
class Solution {
public int[] sumEvenAfterQueries(int[] A, int[][] queries) {
int sum = Arrays.stream(A).filter(n -> isEven(n)).sum();
int[] res = new int[queries.length];
for (int i=0; i<queries.length; i++) {
int[] q = queries[i];
int numToAdd = q[0];
int idx = q[1];
int before = A[idx];
A[idx] += numToAdd;
if (isEven(before)) {
sum += isEven(A[idx]) ? numToAdd : -before;
} else {
sum += isEven(A[idx]) ? A[idx] : 0;
}
res[i] = sum;
}
return res;
}
private boolean isEven(int num) {
return Math.abs(num) % 2 == 0;
}
}
__________________________________________________________________________________________________