README_EN.md

974. Subarray Sums Divisible by K

中文文档

Description

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, -3, 1], [5], [5, 0], [5, 0, -2, -3], [0], [0, -2, -3], [-2, -3]

 

Note:

<li><code>1 &lt;= A.length &lt;= 30000</code></li>

<li><code>-10000 &lt;= A[i] &lt;= 10000</code></li>

<li><code>2 &lt;= K &lt;= 10000</code></li>

Solutions

Python3

Java

...