<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>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2018/12/01/ex1.png" style="width: 500px; height: 97px;" />
<pre>
<strong>Input:</strong> nums = [4,6,15,35]
<strong>Output:</strong> 4
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2018/12/01/ex2.png" style="width: 500px; height: 85px;" />
<pre>
<strong>Input:</strong> nums = [20,50,9,63]
<strong>Output:</strong> 2
</pre>

<p><strong class="example">Example 3:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2018/12/01/ex3.png" style="width: 500px; height: 260px;" />
<pre>
<strong>Input:</strong> nums = [2,3,6,7,4,12,21,39]
<strong>Output:</strong> 8
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 2 * 10<sup>4</sup></code></li>
	<li><code>1 &lt;= nums[i] &lt;= 10<sup>5</sup></code></li>
	<li>All the values of <code>nums</code> are <strong>unique</strong>.</li>
</ul>

void dfs(int Node,vector<int>&vis,vector<int>adj[],int &count)
{
    vis[Node]=1;
    count++;
    for(auto it : adj[Node])
    {
        if(vis[it]==0)
        {
            dfs(it,vis,adj,count);
        }
    }
}
class Solution {
public:
    int largestComponentSize(vector<int>& nums) {
        int N=*max_element(nums.begin(),nums.end());
        map<int,int>M;
        for(int i=0;i<nums.size();i++)
        {
            M[nums[i]]++;
        }
        vector<int>adj[N+1];
        for(int i=2;i<=1e5;i++)
        {
            int P;
            int count=0;
            for(int j=i;j<=N;j+=i)
            {
                if(M.find(j)!=M.end())
                {
                    if(count==0)
                    {
                        P=j;
                        count++;
                    }
                    else
                    {
                        adj[P].push_back(j);
                        adj[j].push_back(P);
                    }
                }
            }
        }
        for(int i=1;i<=N;i++)
        {
            if(M.find(i)!=M.end() && adj[i].empty()==true)
            {
                adj[i].push_back(i);
            }
        }
        int count=0;
        vector<int>vis(N+1,0);
        int ans=0;
        for(int i=1;i<=N;i++)
        {
            if(adj[i].empty()==false && vis[i]==0)
            {
                int count=0;
                dfs(i,vis,adj,count);
                ans=max(ans,count);
            }
        }
        return ans;
    }
};
122628