203. Remove Linked List Elements
Difficulty: Easy
Remove all elements from a linked list of integers that have value val.
Example:
Input: 1->2->6->3->4->5->6, val = 6
Output: 1->2->3->4->5
Solution
思路
- 申请一个
pre->val
为0
的节点,该节点的next
指向head
。 q
指向pre
节点用于返回。p
指向head
,遍历链表,如果p->val == val
删除,不等于val
,pre
和p
都继续向下移动。- 返回
q->next
。
Language: C++
/**
* 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* pre = new ListNode(0);
pre->next = head;
ListNode* q = pre;
ListNode* p = head;
while (p){
if (p->val == val)
pre->next = p->next;
else
pre = p;
p = p->next;
}
return q->next;
}
};