leetcode

0 class Solution {

1 public:

2 ListNode *modifiedList(const vector<int> &nums, ListNode *head) const {

3 const unordered_set<int> us(begin(nums), end(nums));

4 ListNode dummy(-1, head);

5

6 for (auto *p = &dummy; p && p->next;) {

7 if (!us.count(p->next->val))

8 p = p->next;

9 else

10 p->next = p->next->next;

11 }

12

13 return dummy.next;

14 }

15 };