题意
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
Credits:
Special thanks to @mithmatt for adding this problem and creating all test cases.
Subscribe to see which companies asked this question.
解法
实现
/**
* 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) {
if(head == NULL) return head;
ListNode* cur = head;
ListNode* pre = NULL;
while(cur != NULL){
if(cur->val == val){
if(pre == NULL){
head = cur->next;
cur = head;
} else {
pre->next = cur->next;
cur = pre->next;
}
}else {
pre = cur;
cur = cur->next;
}
}
return head;
}
};