subarray-sums-divisible-by-k

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an integer array <code>nums</code> and an integer <code>k</code>, return the number of non-empty subarrays that have a sum divisible by <code>k</code>.

A subarray is a contiguous part of an array.

&nbsp;
Example 1:

<pre>
Input: nums = [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]
</pre>

Example 2:

<pre>
Input: nums = [5], k = 9
Output: 0
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 3 * 104</code></li>
	<li><code>-104 &lt;= nums[i] &lt;= 104</code></li>
	<li><code>2 &lt;= k &lt;= 104</code></li>
</ul>

subarraysDivByK

Subarray Sums Divisible by K

Subarray Sum Equals K

subarray-sum-equals-k

和为 K 的子数组

Make Sum Divisible by P

make-sum-divisible-by-p

使数组和能被 P 整除

Count Number of Bad Pairs

count-number-of-bad-pairs

统计坏数对的数目

Find the Divisibility Array of a String

find-the-divisibility-array-of-a-string

找出字符串的可整除数组

Count of Interesting Subarrays

count-of-interesting-subarrays

统计趣味子数组的数目

Maximum Subarray Sum With Length Divisible by K

maximum-subarray-sum-with-length-divisible-by-k

长度可被 K 整除的子数组的最大元素和

Array

Hash Table

Prefix Sum

给定一个整数数组 <code>nums</code>&nbsp;和一个整数 <code>k</code> ，返回其中元素之和可被 <code>k</code>&nbsp;整除的非空&nbsp;子数组 的数目。

子数组 是数组中&nbsp;连续&nbsp;的部分。

&nbsp;

示例 1：

<pre>
输入：nums = [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]
</pre>

示例 2:

<pre>
输入: nums = [5], k = 9
输出: 0
</pre>

&nbsp;

提示:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 3 * 104</code></li>
	<li><code>-104&nbsp;&lt;= nums[i] &lt;= 104</code></li>
	<li><code>2 &lt;= k &lt;= 104</code></li>
</ul>