【链表】leetcode_203_移除链表元素

【链表】leetcode_203_移除链表元素

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 *p = new ListNode();
        p->next = head;
        
       
        ListNode *cur = p;
        while ( cur->next != nullptr){
                if (cur->next->val == val){
                    ListNode *tmp = cur->next;
                    cur->next = tmp->next;
                    delete tmp;
                }else{
                    cur = cur->next;
                }
        }
        return p->next; 
    }
};

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: ListNode, val: int) -> ListNode:
        dummy_head = ListNode(0, head)
        p = dummy_head
        

        while(p.next != None):
            
            if p.next.val == val:
                p.next = p.next.next
            else:
                p = p.next

        return dummy_head.next