Package g0801_0900.s0817_linked_list_components

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    817 - Linked List Components\.

    Medium

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

    Return the number of connected components in nums where two values are connected if they appear consecutively 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.

    Constraints:

    • The number of nodes in the linked list is n.

    • <code>1 <= n <= 10<sup>4</sup></code>

    • 0 &lt;= Node.val &lt; n

    • All the values Node.val are unique.

    • 1 &lt;= nums.length &lt;= n

    • 0 &lt;= nums[i] &lt; n

    • All the values of nums are unique.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer numComponents(ListNode head, IntArray nums)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait