Linked List Components LeetCode solution in JavaScript

1
var numComponents = function (head, nums) {
2
  let broken = true,
3
    count = 0;
4

5
  while (head) {
6
    if (nums.includes(head.val) && broken) {
7
      count++;
8
      broken = false;
9
    } else if (!nums.includes(head.val)) {
10
      broken = true;
11
    }
12

13
    // reset head as next
14
    head = head.next;
15
  }
16

17
  // result
18
  return count;
19
};