#2521

Distinct Prime Factors of Product of Array

specialist · 805 · lc medium +31 · verified · 54.2% accepted · 543 likes · top 46%

Description

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

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 = 25 * 32 * 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 = 210.

There is 1 distinct prime factor so we return 1.

Code

1

2

3

class Solution:
    def distinctPrimeFactors(self, nums: List[int]) -> int:

class Solution:
    def distinctPrimeFactors(self, nums: List[int]) -> int: