解题思路
此处撰写解题思路
代码
/**
* 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 removeElements(ListNode head, int val) {
if(head == null){
return head;
}
//设置 虚拟节点
ListNode dummy = new ListNode(-1,head);
ListNode pre = dummy;
ListNode cur = head;
//当存在节点时循环
while ( cur != null){
//如果为删除节点 ,则pre 下个节点直接指向cur 的下个节点
if(cur.val == val){
pre.next = cur.next;
}else {
pre = cur;
}
cur = cur.next; //节点后移
}
return dummy.next;
}
}