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
正常的思路,一次通过啦。
/** * 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* pre =new ListNode(0); pre->next=head; ListNode* temp=pre; while(temp->next!=NULL){ if(temp->next->val==val){ temp->next=temp->next->next; } else{ temp=temp->next; } } return pre->next; } };