We have an array A
of integers, and an array queries
of queries.
For the i
-th query val = queries[i][0], index = queries[i][1]
, we add val to A[index]
. Then, the answer to the i
-th query is the sum of the even values of A
.
(Here, the given index = queries[i][1]
is a 0-based index, and each query permanently modifies the array A
.)
Return the answer to all queries. Your answer
array should have answer[i]
as the answer to the i
-th query.
Example 1:
Input: A = [1,2,3,4], queries = [[1,0],[-3,1],[-4,0],[2,3]]
Output: [8,6,2,4]
Explanation:
At the beginning, the array is [1,2,3,4].
After adding 1 to A[0], the array is [2,2,3,4], and the sum of even values is 2 + 2 + 4 = 8.
After adding -3 to A[1], the array is [2,-1,3,4], and the sum of even values is 2 + 4 = 6.
After adding -4 to A[0], the array is [-2,-1,3,4], and the sum of even values is -2 + 4 = 2.
After adding 2 to A[3], the array is [-2,-1,3,6], and the sum of even values is -2 + 6 = 4.
Note:
1 <= A.length <= 10000
-10000 <= A[i] <= 10000
1 <= queries.length <= 10000
-10000 <= queries[i][0] <= 10000
0 <= queries[i][1] < A.length
题目理解:
给定一个数组,和众多的query,每一个query修改一个数字的值,并且要求整个数组中偶数的和
解题思路:
保存当前所有偶数的和sum,遍历所有query,根据数字修改的情况,修改sum的值并且返回
class Solution {
public int[] sumEvenAfterQueries(int[] A, int[][] queries) {
int sum = 0;
int len = queries.length;
for(int num : A){
if(num % 2 == 0)
sum += num;
}
int[] res = new int[len];
for(int i = 0; i < len; i++){
int val = queries[i][0], id = queries[i][1];
if(A[id] % 2 == 0){
if((A[id] + val) % 2 == 0)
sum += val;
else
sum -= A[id];
}
else{
if((A[id] + val) % 2 == 0)
sum += A[id] + val;
}
A[id] += val;
res[i] = sum;
}
return res;
}
}