【链表遍历】817. Linked List Components

遍历链表，查询当前元素是否在G内；

/**
 * 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_map<int,bool> table;
        for(int i = 0;i<G.size();i++)
            table[G[i]]=1;
        
        int ans=0,flag=0;
        while(head!=NULL)
        {
            if(table.find(head->val)!=table.end())
                flag=1;
            else
            {
                if(flag==1)
                {
                    ans++;
                    flag=0;
                }
            }
            head=head->next;
        }
        if(flag==1)
            ans++;
        return ans;
    }
};