[11道链表经典笔试题]优化的算法思想：反转链表链表相交快慢指针

Posted 2022-12-09 .阿Q.

1.删除链表中等于给定值 val 的所有节点

AC代码

/**
 * Definition for singly-linked list.
 * struct ListNode 
 *     int val;
 *     struct ListNode *next;
 * ;
 */
struct ListNode* removeElements(struct ListNode* head, int val)
    struct ListNode* prev = NULL, *cur = head;
    while(cur)
    
        if(cur->val == val)
        
            //1.头删
            //2.中间删除
            if(cur == head)
            
                head = cur->next;
                free(cur);
                cur = h