LeetCode Oj 203. Remove Linked List Elements

移除链表元素算法

最新推荐文章于 2023-02-25 23:03:36 发布

原创最新推荐文章于 2023-02-25 23:03:36 发布 · 300 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

19 篇文章

订阅专栏

本文介绍了一种从整数链表中移除特定值的所有元素的算法，并提供了一个C++实现示例。该算法递归地遍历链表，跳过所有等于给定值的节点，最终返回更新后的链表。

203. Remove Linked List Elements

My Submissions

Total Accepted: 71251
Total Submissions: 241722
Difficulty: Easy

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

Credits:
Special thanks to @mithmatt for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

Show Tags

Show Similar Problems

Have you met this question in a real interview?

Yes

Discuss Pick One

class Solution {
public:
       ListNode* removeElements(ListNode* head, int val) {
       if(head==NULL) return head;
       if(head->val!=val)
       {
           head->next=removeElements(head->next,val);
           return head;
       }
       else
         return removeElements(head->next,val);
    }
};