203. 移除链表元素https://leetcode.cn/problems/remove-linked-list-elements/203. 移除链表元素
难度简单963
给你一个链表的头节点 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 输出:[]
提示:
- 列表中的节点数目在范围
[0, 104]
内 1 <= Node.val <= 50
0 <= val <= 50
通过次数390,013提交次数723,408
/**
* 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) head=head.next;
if(head==null) return head;
ListNode node = head;
while(node.next!=null)
{
if(node.next.val==val) node.next=node.next.next;
else node = node.next;
}
return head;
}
}
/**
* 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) {
//在前面添加一个头节点,不要对head进行单独处理
ListNode node = new ListNode();
node.next=head;
ListNode ans = node;
while(node.next!=null)
{
if(node.next.val==val) node.next=node.next.next;
else node = node.next;
}
return ans.next;
}
}