题目:817. 链表组件
思路:set
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
int numComponents(ListNode* head, vector<int>& nums) {
set<int> st;
int n = nums.size();
for(auto i:nums){
st.insert(i);
}
bool flag = false;
int res = 0;
ListNode* cur = head;
while(cur!=nullptr){
if(st.count(cur->val)==1){
if(flag == true){
cur = cur->next;
continue;
}else{
res++;
flag = true;
st.erase(cur->val);
}
}else{
flag = false;
}
cur = cur->next;
}
return res;
}
};