Package g3301_3400.s3378_count_connected_components_in_lcm_graph

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    3378 - Count Connected Components in LCM Graph.

    Hard

    You are given an array of integers nums of size n and a positive integer threshold.

    There is a graph consisting of n nodes with the <code>i<sup>th</sup></code> node having a value of nums[i]. Two nodes i and j in the graph are connected via an undirected edge if lcm(nums[i], nums[j]) &lt;= threshold.

    Return the number of connected components in this graph.

    A connected component is a subgraph of a graph in which there exists a path between any two vertices, and no vertex of the subgraph shares an edge with a vertex outside of the subgraph.

    The term lcm(a, b) denotes the least common multiple of a and b.

    Example 1:

    Input: nums = 2,4,8,3,9, threshold = 5

    Output: 4

    Explanation:

    The four connected components are (2, 4), (3), (8), (9).

    Example 2:

    Input: nums = 2,4,8,3,9,12, threshold = 10

    Output: 2

    Explanation:

    The two connected components are (2, 3, 4, 8, 9), and (12).

    Constraints:

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

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

    • All elements of nums are unique.

    • <code>1 <= threshold <= 2 * 10<sup>5</sup></code>

    • 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 countComponents(IntArray nums, Integer threshold)

      • Methods inherited from class java.lang.Object

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