LintCode【入门】删除链表中的元素

val

1->2->3->3->4->5->3

3

1->2->4->5

/**
* Definition for singly-linked list.
* struct ListNode {
*     int val;
*     ListNode *next;
*     ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
/**
* @param head a ListNode
* @param val an integer
* @return a ListNode
*/
ListNode *removeElements(ListNode *head, int val) {
// Write your code here
if (head == NULL)
return head;
while (head->val == val) {
head = head->next;
if (head == NULL) return head;
}
ListNode *p, *q;
p = head;
q = p->next;
while (q!=NULL) {
if (q->val == val) {
q = q->next;
p->next = q;
} else {
p = p->next;
q = q->next;
}
}
return head;
}
};