Class Solution

LeetCode_problems/Linked List Components/solution.cpp:52–71

* 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(G.begin(),G.end());
        ListNode* temp=head;
        int c=0;
        while(temp){
            if(s.find(temp->val)!=s.end()){
                c++;
                while(temp and s.find(temp->val)!=s.end())
                    temp=temp->next;
                continue;
            }
            temp=temp->next;
        }
        return c;
        
        
    }
};