LeetCode-974、和可被 K 整除的子数组-中等
给定一个整数数组 A,返回其中元素之和可被 K 整除的(连续、非空)子数组的数目。
示例:
输入:A = [4,5,0,-2,-3,1], K = 5
输出:7
解释:
有 7 个子数组满足其元素之和可被 K = 5 整除:
[4, 5, 0, -2, -3, 1], [5], [5, 0], [5, 0, -2, -3], [0], [0, -2, -3], [-2, -3]
提示:
- 1 <= A.length <= 30000
- -10000 <= A[i] <= 10000
- 2 <= K <= 10000
代码:
class Solution:
def subarraysDivByK(self, A: List[int], K: int) -> int:
dic = dict((x, 0) for x in range(K))
dic[0] = 1
s, ans = 0, 0
for a in A:
s += a
mod = s % K
ans += dic[mod]
dic[mod] += 1
return ans