[leetcode] 817. Linked List Components-CSDN博客

本文链接：https://blog.csdn.net/w5688414/article/details/87859622

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.

分析

题目的意思是：这道题给了一个链表，又给了一个结点值数组G，里面不一定包括了链表中所有的结点值。让我们返回结点值数组中有多少个相连的组件，因为缺失的结点值会将原链表断开，实际上就是让我们求有多少个相连的子链表.

用G中的结点加入set集合中，然后再遍历链表，来判断G中的元素是否相连，不相连则res++，如果相连则继续遍历。

代码

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    int numComponents(ListNode* head, vector<int>& G) {
        unordered_set<int> s;
        for(int g:G){
            s.insert(g);
        }
        ListNode* cur=head;
        int res=0;
        while(cur){
            if(s.count(cur->val)&&(!cur->next||!s.count(cur->next->val))){
                res++;
            }
            cur=cur->next;
        }
        return res;
    }
};