【leetcode】985. Sum of Even Numbers After Queries

class Solution {
    public int[] sumEvenAfterQueries(int[] A, int[][] queries) {
        int[] result = new int[A.length];
        
        for(int j=0; j<A.length; j++) {
            int[] query = queries[j];
            
            int i = query[0];
            int index = query[1];
            
            A[index] += i;
            
            int sum = 0;
            for(int each : A)
                if(each % 2 == 0)
                    sum += each;
            
            result[j] = sum;
        }
        
        return result;
    }
}