#817

Linked List Components

specialist · 820 · lc medium +31 · failed · 57.8% accepted · 1,194 likes · top 54%

Description

You are given the head of a linked list with unique integer values, and an integer array nums that is a subset of those values.

Return the number of connected components within nums, where two values are in the same component when they appear at consecutive positions in the linked list.

Example 1:

Input: head = [0,1,2,3], nums = [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], nums = [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.

Code

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def numComponents(self, head: Optional[ListNode], nums: List[int]) -> int:

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def numComponents(self, head: Optional[ListNode], nums: List[int]) -> int: