-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathzero_array_transformer.py
50 lines (32 loc) · 1.02 KB
/
zero_array_transformer.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
from typing import List
class Solution:
def isZeroArray(self, nums: List[int], queries: List[List[int]]) -> bool:
n = len(nums)
delta = [0] * (n + 1) # One extra for handling the right boundary
for li, ri in queries:
delta[li] -= 1 # Decrement starting at li
if ri + 1 < n:
delta[ri + 1] += 1 # Increment stopping at ri + 1
current_decrement = 0
for i in range(n):
current_decrement += delta[i]
if nums[i] != 0:
if nums[i]+current_decrement<0:
nums[i] = 0
else:
nums[i] += current_decrement
return all(x == 0 for x in nums)
nums = [1, 0, 1]
queries = [[0, 2]]
nums = [4,3,2,1]
queries = [[1,3],[0,2]]
# nums = [2]
# queries = [[0,0],[0,0]]
# nums = [1, 0, 1]
# queries = [[0, 2]]
# nums = [2]
# queries = [[0,0],[0,0], [0,0]]
# queries = [[0,0],[0,0]]
solution = Solution()
output = solution.isZeroArray(nums, queries)
print(output)