class Solution {
public ListNode deleteNode(ListNode node,ListNode head) {
//使用两个指针记录当前元素和上一个元素,通过对比当前元素是否是要删除的元素
ListNode slow = head,fast = head.next,newhead = head;
while(fast.val != node.val){
fast = fast.next;
slow = slow.head;
}
slow.next = slow.next.next;
return newhead;
}
}