LeetCode-Array中几种连续子序列问题总结
LeetCode-Array中几种连续子序列问题总结
1 和能被K整除的子数组个数
1.1 题目
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
...