Package g0901_1000.s0952_largest_component_size_by_common_factor

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    952 - Largest Component Size by Common Factor\.

    Hard

    You are given an integer array of unique positive integers nums. Consider the following graph:

    • There are nums.length nodes, labeled nums[0] to nums[nums.length - 1],

    • There is an undirected edge between nums[i] and nums[j] if nums[i] and nums[j] share a common factor greater than 1.

    Return the size of the largest connected component in the graph.

    Example 1:

    Input: nums = 4,6,15,35

    Output: 4

    Example 2:

    Input: nums = 20,50,9,63

    Output: 2

    Example 3:

    Input: nums = 2,3,6,7,4,12,21,39

    Output: 8

    Constraints:

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

    • <code>1 <= numsi<= 10<sup>5</sup></code>

    • All the values of nums are unique.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

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

      • Methods inherited from class java.lang.Object

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