203.移除链表元素

给你一个链表的头节点 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

C++在原链表上操作:

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* removeElements(ListNode* head, int val) {
        
            //删除头结点
            while(head!= NULL && head->val==val){ //一定要先判空,否则会报错
                ListNode* cur=head;
                head=cur->next;
                delete cur;
            }
            //删除非头节点
            ListNode* cur=head;
            while(cur!=NULL && cur->next!=NULL ){ //一定要先判空,否则会报错
                if(cur->next->val==val){
                    ListNode* tmp=cur->next;
                    cur->next=cur->next->next;
                    delete tmp;
                }else{
                    cur=cur->next;
                }
            }
        return head;
    }
};

C++新增头结点操作：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* removeElements(ListNode* head, int val) {
        ListNode *dummyHead=new ListNode(0);
        dummyHead->next=head;
        ListNode *cur=dummyHead;
        while(cur->next!=NULL){
            if(cur->next->val==val){
                ListNode* tmp=cur->next;
                cur->next=cur->next->next;
                delete tmp;
            }else{
                cur=cur->next;
            }
        }
        head=dummyHead->next; //这步是必须的，因为原来的head节点可能已经被删了
        delete dummyHead;
        return head;
    }
};

JAVA增加头结点：

/**
 * 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) {
         ListNode dummy = new ListNode(-1, head);
         ListNode cur=dummy;
         while(cur.next!=null){
             if(cur.next.val==val){
                 cur.next=cur.next.next;
             }else{
                 cur=cur.next;
             }
         }
         head=dummy.next;
         return head;
    }
}

python

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def removeElements(self, head: Optional[ListNode], val: int) -> Optional[ListNode]:
        dummy_head = ListNode(next = head)
        cur=dummy_head
        while cur.next:
            if cur.next.val == val:
                cur.next=cur.next.next
            else:
                cur=cur.next
        head=dummy_head.next
        return head