LEETCODE 203

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) {
ListNode tempHead(val+1);
ListNode* tempPos = &tempHead;
tempHead.next = head;
while(tempPos->next)
{
if(val == tempPos->next->val)
tempPos->next = tempPos->next->next;
else
tempPos = tempPos->next;
}
return tempHead.next;
}
};