1
# Runtime: 1565 ms (Top 5.26%) | Memory: 20.6 MB (Top 46.36%)
2
class Solution:
3
# O(n) || O(1)
4
# Runtime: 583ms 72.40% || memory: 20.5mb 37.69%
5
def sumEvenAfterQueries(
6
self, nums: List[int], queries: List[List[int]]
7
) -> List[int]:
8
totalEvenNumSum = sum([num for num in nums if num % 2 == 0])
9
result = []
10

11
for val, idx in queries:
12
oldVal = nums[idx]
13
nums[idx] += val
14

15
if oldVal % 2 == 0:
16
totalEvenNumSum -= oldVal
17

18
if nums[idx] % 2 == 0:
19
totalEvenNumSum += nums[idx]
20

21
result.append(totalEvenNumSum)
22

23
return result

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0