Package g0901_1000.s0974_subarray_sums_divisible_by_k

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    974 - Subarray Sums Divisible by K\.

    Medium

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

    A subarray is a contiguous part of an array.

    Example 1:

    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

    Example 2:

    Input: nums = 5, k = 9

    Output: 0

    Constraints:

    • <code>1 <= nums.length <= 3 * 10<sup>4</sup></code>

    • <code>-10<sup>4</sup><= numsi<= 10<sup>4</sup></code>

    • <code>2 <= k <= 10<sup>4</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer subarraysDivByK(IntArray nums, Integer k)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait