Package g0901_1000.s0952_largest_component_size_by_common_factor

Class Solution

java.lang.Object

g0901_1000.s0952_largest_component_size_by_common_factor.Solution

public class Solution
extends Object

952 - Largest Component Size by Common Factor.<p>Hard</p> <p>You are given an integer array of unique positive integers <code>nums</code>. Consider the following graph:</p> <ul> <li>There are <code>nums.length</code> nodes, labeled <code>nums[0]</code> to <code>nums[nums.length - 1]</code>,</li> <li>There is an undirected edge between <code>nums[i]</code> and <code>nums[j]</code> if <code>nums[i]</code> and <code>nums[j]</code> share a common factor greater than <code>1</code>.</li> </ul> <p>Return <em>the size of the largest connected component in the graph</em>.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2018/12/01/ex1.png" alt="" /></p> <p><strong>Input:</strong> nums = [4,6,15,35]</p> <p><strong>Output:</strong> 4</p> <p><strong>Example 2:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2018/12/01/ex2.png" alt="" /></p> <p><strong>Input:</strong> nums = [20,50,9,63]</p> <p><strong>Output:</strong> 2</p> <p><strong>Example 3:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2018/12/01/ex3.png" alt="" /></p> <p><strong>Input:</strong> nums = [2,3,6,7,4,12,21,39]</p> <p><strong>Output:</strong> 8</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 2 * 10⁴</code></li> <li><code>1 <= nums[i] <= 10⁵</code></li> <li>All the values of <code>nums</code> are <strong>unique</strong>.</li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	largestComponentSize(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

largestComponentSize

public int largestComponentSize(int[] nums)