203. Remove Linked List Elements

最新推荐文章于 2022-12-25 18:05:51 发布

mll1208596630

最新推荐文章于 2022-12-25 18:05:51 发布

阅读量280

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/mll1208596630/article/details/50382498

版权

LeetCode 专栏收录该内容

37 篇文章 0 订阅

订阅专栏

Remove all elements from a linked list of integers that have value val.

Example
Given: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6
Return: 1 --> 2 --> 3 --> 4 --> 5

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* removeElements(ListNode* head, int val) 
    {
        if((!head)||((head->val==NULL)&&(!NULL)))
            return NULL;
        if(head->val==val)
        {
            head=head->next;
            return removeElements(head,val);
        }
        else
        {
            ListNode* y=head;
            ListNode* z=y->next;
            while(z)
            {
                if(z->val==val)
                    y->next=z->next;
                else
                    y=z;
                z=z->next;
            }
        }
        return head;
    }
};