给你一个链表的头节点 head 和一个整数 val ,请你删除链表中所有满足 Node.val == val 的节点,并返回 新的头节点 。
示例 1:
输入:head = [1,2,6,3,4,5,6], val = 6
输出:[1,2,3,4,5]
示例 2:
输入:head = [], val = 1
输出:[]
示例 3:
输入:head = [7,7,7,7], val = 7
输出:[]
/**
* 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) {
//先判断边界条件
//先判断头节点是否为空并且头节点刚好就是待删除的节点
while (head != null && head.val == val){
ListNode node = head;
head = head.next;
node.next = null;
}
//此时链表已经是个空链表了,直接return null
if (head == null){
return null;
}else {
//从头结点开始寻找值为val的节点
ListNode prev = head;
while (prev.next != null){
if (prev.next.val == val){
//node就是待删除节点
ListNode node = prev.next;
prev.next = node.next;
node.next = null;
}else {
prev = prev.next;
}
}
return head;
}
}
}