LeetCode第203题. 移除链表元素

最新推荐文章于 2024-10-06 13:05:10 发布

凡尘若诗

最新推荐文章于 2024-10-06 13:05:10 发布

阅读量88

点赞数 2

文章标签： leetcode 链表算法

本文链接：https://blog.csdn.net/2301_80423531/article/details/142723889

版权

文章目录

题目
解法

题目

在这里插入图片描述

解法

1.双指针

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode* removeElements(struct ListNode* head, int val) {
    if(!head)
        return head;
   struct ListNode* cur = head;
   struct ListNode* pre = head;
    while(cur)
   {
        if(head->val == val)   
            head = head->next;
        if(cur->val == val) 
            pre->next = cur->next; 
        else
            pre = cur;   
        cur = cur->next;
   }
    return head;
}

2.递归

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode* removeElements(struct ListNode* head, int val) {
    if(!head)
        return head;
    struct ListNode* ans = removeElements(head->next ,val);
    if(head->val == val)
        return ans;
    else{
        head->next = ans;
        return head;
    } 
}

3.虚拟头节点

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode* removeElements(struct ListNode* head, int val){
    struct ListNode *dummyHead = (struct ListNode*)malloc(sizeof(struct ListNode));
    if (NULL == dummyHead) {
        return NULL;
    }

    dummyHead->next = head;
    struct ListNode* cur = dummyHead;
    while (cur->next != NULL) 
    {
        if (cur->next->val == val) 
            cur->next = cur->next->next;
        else 
            cur = cur->next;
    }

    struct ListNode* ans = dummyHead->next;
    free(dummyHead);
    return ans;
}