解题思路:
1.根据题目的查询结果,计算val = queries[i][0], index = queries[i][1],并更新A[index]
2.遍历数组,将数组中的偶数相加,并存入新的数组
3.返回新数组
代码实现:
class Solution {
public int[] sumEvenAfterQueries(int[] A, int[][] queries){
int len=queries.length;
int[] res=new int[len];
for(int i=0;i<len;++i){
int val=queries[i][0];
int index=queries[i][1];
A[index]+=val;
res[i]=calSum(A);
}
return res;
}
//计算偶数和
public int calSum(int[] A){
int sum=0;
int size=A.length;
for(int i=0;i<size;++i){
if((A[i]&0x01)==0){
sum+=A[i];
}
}
return sum;
}
}