题目:
删除链表中等于给定值 val 的所有节点。
示例:
输入: 1->2->6->3->4->5->6, val = 6
输出: 1->2->3->4->5
思路:
建立虚拟头节点指向head
,遍历链表,当链表的cur->next->val
等于给定的val
则删除cur->next
并将cur
指向删除节点的下一节点。
/**
* 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) {
ListNode* dummyHead = new ListNode(0);
dummyHead -> next = head;
ListNode* cur = dummyHead;
while(cur -> next != NULL){
if(cur -> next -> val == val){
ListNode* delNode = cur -> next;
cur -> next = delNode -> next;
delete delNode;
}
else
cur = cur -> next;
}
ListNode* retNode = dummyHead -> next;
delete dummyHead;
return retNode;
}
};