LeetCode-203. Remove Linked List Elements

LeetCode-203. Remove Linked List Elements

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

Example:

Input: 1->2->6->3->4->5->6, val = 6Output: 1->2->3->4->5

题解：

增加个头结点指向需要删除结点的前面就好了

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

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。