Package g2501_2600.s2521_distinct_prime_factors_of_product_of_array

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    2521 - Distinct Prime Factors of Product of Array\.

    Medium

    Given an array of positive integers nums, return the number of distinct prime factors in the product of the elements of nums.

    Note that:

    • A number greater than 1 is called prime if it is divisible by only 1 and itself.

    • An integer val1 is a factor of another integer val2 if val2 / val1 is an integer.

    Example 1:

    Input: nums = 2,4,3,7,10,6

    Output: 4

    Explanation: The product of all the elements in nums is: 2 \* 4 \* 3 \* 7 \* 10 \* 6 = 10080 = 2<sup>5</sup> \* 3<sup>2</sup> \* 5 \* 7.

    There are 4 distinct prime factors so we return 4.

    Example 2:

    Input: nums = 2,4,8,16

    Output: 1

    Explanation: The product of all the elements in nums is: 2 \* 4 \* 8 \* 16 = 1024 = 2<sup>10</sup>.

    There is 1 distinct prime factor so we return 1.

    Constraints:

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

    • 2 &lt;= nums[i] &lt;= 1000

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description
      public class Solution.Companion

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer distinctPrimeFactors(IntArray nums)

      • Methods inherited from class java.lang.Object

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