README_EN.md

985. Sum of Even Numbers After Queries

中文文档

Description

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. 1 <= A.length <= 10000
2. -10000 <= A[i] <= 10000
3. 1 <= queries.length <= 10000
4. -10000 <= queries[i][0] <= 10000
5. 0 <= queries[i][1] < A.length

Solutions

Python3

class Solution:
    def sumEvenAfterQueries(self, nums: List[int], queries: List[List[int]]) -> List[int]:
        ans = []
        s = sum(num for num in nums if num % 2 == 0)
        for v, i in queries:
            old = nums[i]
            nums[i] += v
            if nums[i] % 2 == 0 and old % 2 == 0:
                s += v
            elif nums[i] % 2 == 0 and old % 2 == 1:
                s += nums[i]
            elif old % 2 == 0:
                s -= old
            ans.append(s)
        return ans

Java

class Solution {
    public int[] sumEvenAfterQueries(int[] nums, int[][] queries) {
        int s = 0;
        for (int num : nums) {
            if (num % 2 == 0) {
                s += num;
            }
        }
        int[] ans = new int[queries.length];
        int idx = 0;
        for (int[] q : queries) {
            int v = q[0], i = q[1];
            int old = nums[i];
            nums[i] += v;
            if (nums[i] % 2 == 0 && old % 2 == 0) {
                s += v;
            } else if (nums[i] % 2 == 0 && old % 2 != 0) {
                s += nums[i];
            } else if (old % 2 == 0) {
                s -= old;
            }
            ans[idx++] = s;
        }
        return ans;
    }
}

C++

class Solution {
public:
    vector<int> sumEvenAfterQueries(vector<int>& nums, vector<vector<int>>& queries) {
        int s = 0;
        for (int& num : nums)
            if (num % 2 == 0)
                s += num;
        vector<int> ans;
        for (auto& q : queries)
        {
            int v = q[0], i = q[1];
            int old = nums[i];
            nums[i] += v;
            if (nums[i] % 2 == 0 && old % 2 == 0) s += v;
            else if (nums[i] % 2 == 0 && old % 2 != 0) s += nums[i];
            else if (old % 2 == 0) s -= old;
            ans.push_back(s);
        }
        return ans;
    }
};

Go

func sumEvenAfterQueries(nums []int, queries [][]int) []int {
	s := 0
	for _, num := range nums {
		if num%2 == 0 {
			s += num
		}
	}
	var ans []int
	for _, q := range queries {
		v, i := q[0], q[1]
		old := nums[i]
		nums[i] += v
		if nums[i]%2 == 0 && old%2 == 0 {
			s += v
		} else if nums[i]%2 == 0 && old%2 != 0 {
			s += nums[i]
		} else if old%2 == 0 {
			s -= old
		}
		ans = append(ans, s)
	}
	return ans
}

JavaScript

/**
 * @param {number[]} nums
 * @param {number[][]} queries
 * @return {number[]}
 */
var sumEvenAfterQueries = function(nums, queries) {
    let s = 0;
    for (let num of nums) {
        if (num % 2 == 0) {
            s += num;
        }
    }
    let ans = [];
    for (let [v, i] of queries) {
        const old = nums[i];
        nums[i] += v;
        if (nums[i] % 2 == 0 && old % 2 == 0) {
            s += v;
        } else if (nums[i] % 2 == 0 && old % 2 != 0) {
            s += nums[i];
        } else if (old % 2 == 0) {
            s -= old;
        }
        ans.push(s);
    }
    return ans;
};

...