README_EN.md

817. Linked List Components

中文文档

Description

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:

<li>If&nbsp;<code>N</code>&nbsp;is the&nbsp;length of the linked list given by&nbsp;<code>head</code>,&nbsp;<code>1 &lt;= N &lt;= 10000</code>.</li>

<li>The value of each node in the linked list will be in the range<code> [0, N - 1]</code>.</li>

<li><code>1 &lt;= G.length &lt;= 10000</code>.</li>

<li><code>G</code> is a subset of all values in the linked list.</li>

Solutions

Python3

Java

...