LeetCode Linked List Components

We are given head, the head node of a linked list containing unique integer values.

We are also given the list G, a subset of the values in the linked list.

Return the number of connected components in G, where two values are connected if they appear consecutively in the linked list.

Example 1:

Input: 
head: 0->1->2->3
G = [0, 1, 3]
Output: 2
Explanation: 
0 and 1 are connected, so [0, 1] and [3] are the two connected components.

Example 2:

Input: 
head: 0->1->2->3->4
G = [0, 3, 1, 4]
Output: 2
Explanation: 
0 and 1 are connected, 3 and 4 are connected, so [0, 1] and [3, 4] are the two connected components.

Note:

• If N is the length of the linked list given by head, 1 <= N <= 10000.
• The value of each node in the linked list will be in the range [0, N - 1].
• 1 <= G.length <= 10000.
• G is a subset of all values in the linked list.

题解：给定一个单链表，此表的元素都只出现一次；再给定一个数组，其中需要求出该数组中的元素在单链表中的连通组件的个数。所谓连通组件，用一个例子表示即为：

head指向0->1->2->3 
G = [0, 1, 3] 
输出2 
解释:0和1是连通组件，3为连通组件，则连通组件的个数为2。

问题分析 
将G的元素放入Set，遍历head，若遇到一个元素在Set中并且下一个元素为空或者不在Set中，则将连通组件个数增1。

public int numComponents(ListNode head,int[] G)
    {
        Set<Integer> setG = new HashSet<>();
        for(int g : G)
            setG.add(g);   //用一个hashset来保存元素
        int num = 0;
        while(head != null)
        {
            if(setG.contains(head.val) && (head.next == null || !setG.contains(head.next.val)))
                num++;
            head = head.next;
        }
        return num;
    }

现将G中的元素放入一个set保存，然后遍历单链表，如果当前节点的值出现在set中，下一个的值不为空且还是出现在set中，那么将指针指向下一个节点；如果下一个节点为空或者下一个节点的值不出现在set中，说明在G中不存在，那么就将连通组件个数加1；如此循环，直至遍历到单链表末尾为止。