标签：链表
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
题目大意：
删除链表中全部的目标元素。
代码如下：
/**
* 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;
}
};2016-08-12 16:00:52
本文出自 “做最好的自己” 博客，请务必保留此出处http://qiaopeng688.blog.51cto.com/3572484/1837338
leetCode 203. Remove Linked List Elements 链表
标签：链表
原文地址：http://qiaopeng688.blog.51cto.com/3572484/1837338
