Package g2401_2500.s2447_number_of_subarrays_with_gcd_equal_to_k

Class Solution

java.lang.Object

g2401_2500.s2447_number_of_subarrays_with_gcd_equal_to_k.Solution

public class Solution
extends Object

2447 - Number of Subarrays With GCD Equal to K.

Medium

Given an integer array nums and an integer k, return the number of subarrays of nums where the greatest common divisor of the subarray’s elements is k.

A subarray is a contiguous non-empty sequence of elements within an array.

The greatest common divisor of an array is the largest integer that evenly divides all the array elements.

Example 1:

Input: nums = [9,3,1,2,6,3], k = 3

Output: 4

Explanation: The subarrays of nums where 3 is the greatest common divisor of all the subarray’s elements are:

• [9, 3 ,1,2,6,3]

• [9,3,1,2,6, 3 ]

• [ 9,3 ,1,2,6,3]

• [9,3,1,2, 6,3 ]

Example 2:

Input: nums = [4], k = 7

Output: 0

Explanation: There are no subarrays of nums where 7 is the greatest common divisor of all the subarray’s elements.

Constraints:

• 1 <= nums.length <= 1000
• 1 <= nums[i], k <= 109

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	subarrayGCD(int[] nums, int k)

Methods inherited from class java.lang.Object

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

Constructor Detail

Solution

public Solution()

Method Detail

subarrayGCD

public int subarrayGCD(int[] nums,
                       int k)