题目
给定一个整数数组 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
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/subarray-sums-divisible-by-k
代码
使用哈希表+余数统计(相同表明两数之间差了K的倍数)
class Solution:
def subarraysDivByK(self, A: List[int], K: int) -> int:
res = {0:1}
sums,ans = 0,0
for num in A:
sums += num
out = sums % K
t = res.get(out,0)
ans += t
res[out] = t + 1
return ans