817-链表连通组件

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/LaputaFallen/article/details/79951781

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:

  • If N is the length of the linked list given by head, 1 <= N <= 10000.
  • The value of each node in the linked list will be in the range [0, N - 1].
  • 1 <= G.length <= 10000.
  • G is a subset of all values in the linked list.

问题描述
给出链表的表头head,链表包含各不相同的整数
给出数组G,G的所有元素的值为链表的子集
返回G中的连通组件。如果两个值在链表中相邻则连通


例子

head指向0->1->2->3
G = [0, 1, 3]
输出2
解释:0和1是连通组件,3为连通组件


问题分析
将G的元素放入Set,遍历head,若遇到一个元素在Set中并且下一个元素为空或者不在Set中,则将
连通组件个数增1


解法

class Solution {
     public int numComponents(ListNode head, int[] G) {
        Set<Integer> setG = new HashSet<>();

        for (int i : G) setG.add(i);

        int res = 0;
        while (head != null) {
            if (setG.contains(head.val) && (head.next == null || !setG.contains(head.next.val))) res++;
            head = head.next;
        }

        return res;
    }
}
阅读更多

没有更多推荐了,返回首页