题目描述
删除链表中等于给定值 val 的所有节点。
示例：
输入: 1->2->6->3->4->5->6, val = 6
输出: 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) {
if(head->val != val) break;
head = head->next;
}
ListNode* pre = head;
ListNode* cur = head;
while(cur != NULL) {
if(cur->val == val) pre->next = cur->next;
else pre = cur;
cur = cur->next;
}
return head;
}
};
