# leetcode 817. Linked List Components

## 题目

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:
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:
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.

### python代码

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
"""
:type G: List[int]
:rtype: int
"""
return 0
h = ListNode(0)
li = []
while h.next != None:
li.append(h.next.val)
h = h.next

dic = {}
for i in range(len(li)):
dic[li[i]] = i

G1 = [dic[i] for i in G]
G1.sort()
if len(G1) == 1:
return 1
else:
num = 1
for i in range(len(G1)-1):
if G1[i+1]-G1[i] != 1:
num+=1
return num