203. Remove Linked List Elements

    203. Remove Linked List Elements           

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

        Example
        Given: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6,val = 6
        Return: 1 --> 2 --> 3 --> 4 --> 5

        题目很简单就是在链表中删除值为val的节点即可，考虑好边界就可以，代码如下：

       

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