Class Solution
-
- All Implemented Interfaces:
public final class Solution
523 - Continuous Subarray Sum\.
Medium
Given an integer array nums and an integer k, return
true
ifnums
has a good subarray orfalse
otherwise.A good subarray is a subarray where:
its length is at least two , and
the sum of the elements of the subarray is a multiple of
k
.
Note that:
A subarray is a contiguous part of the array.
An integer
x
is a multiple ofk
if there exists an integern
such thatx = n * k
.0
is always a multiple ofk
.
Example 1:
Input: nums = 23,<ins>2,4</ins>,6,7, k = 6
Output: true
Explanation: 2, 4 is a continuous subarray of size 2 whose elements sum up to 6.
Example 2:
Input: nums = <ins>23,2,6,4,7</ins>, k = 6
Output: true
Explanation: 23, 2, 6, 4, 7 is an continuous subarray of size 5 whose elements sum up to 42. 42 is a multiple of 6 because 42 = 7 \* 6 and 7 is an integer.
Example 3:
Input: nums = 23,2,6,4,7, k = 13
Output: false
Constraints:
<code>1 <= nums.length <= 10<sup>5</sup></code>
<code>0 <= numsi<= 10<sup>9</sup></code>
<code>0 <= sum(numsi) <= 2<sup>31</sup> - 1</code>
<code>1 <= k <= 2<sup>31</sup> - 1</code>
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
Modifier and Type Method Description final Boolean
checkSubarraySum(IntArray nums, Integer k)
-
-
Method Detail
-
checkSubarraySum
final Boolean checkSubarraySum(IntArray nums, Integer k)
-
-
-
-