LeetCode974.和可被K整除的子数组

题目来源： https://leetcode-cn.com/problems/subarray-sums-divisible-by-k/ 题目描述：   class Solution { public int subarraysDivByK(int[] A, int K) { int[] map = new int[K]; map[0]=1;

>>阅读原文<<