# leetCode 203. Remove Linked List Elements 链表

+关注继续查看

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

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

 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 /**  * Definition for singly-linked list.  * struct ListNode {  *     int val;  *     ListNode *next;  *     ListNode(int x) : val(x), next(NULL) {}  * };  */ class Solution { public:     ListNode* removeElements(ListNode* head, int val) {         while(head!=NULL && head->val == val)             head = head->next;         if(head == NULL)             return NULL;         ListNode * p = head->next;         ListNode * q = head;         while(p)         {             if(p->val != val)             {                 q->next = p;                 q = p;             }             else             {                 q->next = NULL;             }             p = p->next;         }         return head;     } };

LeetCode 203. Remove Linked List Elements

0 0
Remove all elements from a linked list of integers that have value val. Example Given: 1 –> 2 –> 6 –> 3 –> 4 –> 5 –> 6, val = 6 Return: 1 –> 2 –> 3 –> 4 –>
770 0

597 0
leetcode 203 Remove Linked List Elements
﻿﻿ Remove all elements from a linked list of integers that have valueval. ExampleGiven: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6Return: 1 ...
621 0
Remove all elements from a linked list of integers that have value val. Example Given: 1 –> 2 –> 6 –> 3 –> 4 –> 5 –> 6, val = 6 Return: 1 –> 2 –> 3 –> 4 –> 5
881 0
+关注