题目链接:https://leetcode-cn.com/problems/shan-chu-lian-biao-de-jie-dian-lcof/
题目如下:
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode deleteNode(ListNode head, int val) {
ListNode pre=new ListNode(0);
ListNode list=pre;//一定要有一个保存住链的头,一个在不断的遍历及操作
while(head!=null){
if(head.val!=val) {
//ListNode cur=new ListNode(head.val);
pre=pre.next=head;//cur;
}
head=head.next;
}
pre.next=null;
return list.next;
}
}