Linked List Components Python Solution

lcpy gen -n 817   # by problem number
lcpy gen -s linked_list_components   # by problem name

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.

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.

from leetcode_py import ListNode


class Solution:
    # Time: O(n)
    # Space: O(m) for the nums set
    def num_components(self, head: ListNode[int] | None, nums: list[int]) -> int:
        values = set(nums)
        count = 0
        in_component = False
        node = head
        while node is not None:
            if node.val in values:
                if not in_component:
                    count += 1
                    in_component = True
            else:
                in_component = False
            node = node.next
        return count