Given an array A of integers, return the number of (contiguous, non-empty) subarrays that have a sum divisible by K. Example 1: Input: A = [4,5,0,-2,-3,1], K = 5 Output: 7 Explanation: There are 7 subarrays with a sum divisible by K = 5: [4, 5, 0, -2…

这道题目描述很清晰,直接两层循环,代码如下: class Solution(object): def subarraysDivByK(self, A: 'List[int]', K: int) -> int: n = len(A) totalnum = 0 for i in range(n): cursum = 0 for j in range(i,n): cursum += A[j] if cursum % K == 0: totalnum += 1 return totalnum 显然,时间…