Package g2501_2600.s2521_distinct_prime_factors_of_product_of_array

Class Solution

java.lang.Object

g2501_2600.s2521_distinct_prime_factors_of_product_of_array.Solution

public class Solution
extends Object

2521 - Distinct Prime Factors of Product of Array.<p>Medium</p> <p>Given an array of positive integers <code>nums</code>, return <em>the number of <strong>distinct prime factors</strong> in the product of the elements of</em> <code>nums</code>.</p> <p><strong>Note</strong> that:</p> <ul> <li>A number greater than <code>1</code> is called <strong>prime</strong> if it is divisible by only <code>1</code> and itself.</li> <li>An integer <code>val1</code> is a factor of another integer <code>val2</code> if <code>val2 / val1</code> is an integer.</li> </ul> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [2,4,3,7,10,6]</p> <p><strong>Output:</strong> 4</p> <p><strong>Explanation:</strong> The product of all the elements in nums is: 2 * 4 * 3 * 7 * 10 * 6 = 10080 = 2⁵ * 3² * 5 * 7.</p> <p>There are 4 distinct prime factors so we return 4.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [2,4,8,16]</p> <p><strong>Output:</strong> 1</p> <p><strong>Explanation:</strong> The product of all the elements in nums is: 2 * 4 * 8 * 16 = 1024 = 2¹⁰.</p> <p>There is 1 distinct prime factor so we return 1.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 10⁴</code></li> <li><code>2 <= nums[i] <= 1000</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	distinctPrimeFactors(int[] nums)

Methods inherited from class java.lang.Object

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

Constructor Details

Solution

public Solution()

Method Details

distinctPrimeFactors

public int distinctPrimeFactors(int[] nums)