Package g2401_2500.s2470_number_of_subarrays_with_lcm_equal_to_k

Class Solution

java.lang.Object

g2401_2500.s2470_number_of_subarrays_with_lcm_equal_to_k.Solution

public class Solution
extends Object

2470 - Number of Subarrays With LCM Equal to K.

Medium

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

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

The least common multiple of an array is the smallest positive integer that is divisible by all the array elements.

Example 1:

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

Output: 4

Explanation: The subarrays of nums where 6 is the least common multiple of all the subarray’s elements are:

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

Example 2:

Input: nums = [3], k = 2

Output: 0

Explanation: There are no subarrays of nums where 2 is the least common multiple of all the subarray’s elements.

Constraints:

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

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	subarrayLCM(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

subarrayLCM

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