删除链表中的一个结点

struct ListNode {

int val;

struct ListNode *next;

};

struct ListNode* removeElements(struct ListNode* head, int val) {

struct ListNode** prev = &head;

struct ListNode* curr = head;

while (curr)
{
if (curr->val == val)
*prev = curr->next;
else
prev = &(curr->next);
curr = curr->next;
}

return head;

}