/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode modifiedList(int[] nums, ListNode head) {
HashSet<Integer> set = new HashSet<>();
for(int num : nums) {
set.add(num);
}
ListNode dummy = new ListNode(-1);
dummy.next = head;
ListNode temp = dummy;
while(temp.next!=null) {
if(set.contains(temp.next.val)) {
temp.next = temp.next.next;
}
else temp = temp.next;
}
return dummy.next;
}
}