如果对区间每一个数进行加或者减,除考虑用线段树外,还可以使用差分
算法实现,是对左区间加上这个数,右区间+1减去这个数
通过求和获取对某个位置总共加减了多少
diff = [0] * (n+1)
for i in range(n):
l , r = max(0,i-d) ,min(n,i+d+1)
diff[l] += nums[i]
diff[r] -= nums[j]
cnt = 0
d = collections.defaultdict(int)
for i in range(n):
cnt += diff[i]
d[i] = cnt
# d 是每个元素总共被加了多少或者减了多少