952. Largest Component Size by Common Factor
Hard
50 Points
Array
Hash Table
Math
Union Find
Number Theory
You are given an integer array of unique positive integers nums. Consider the following graph:
Return the size of the largest connected component in the graph.
Examples
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
1 <= nums.length <= 2 * 1041 <= nums[i] <= 105All the values of nums are unique.
952. Largest Component Size by Common Factor
Hard
50 Points
Array
Hash Table
Math
Union Find
Number Theory
You are given an integer array of unique positive integers nums. Consider the following graph:
Return the size of the largest connected component in the graph.
Examples
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
1 <= nums.length <= 2 * 1041 <= nums[i] <= 105All the values of nums are unique.