删除链表中等于给定值 val 的所有节点。
示例:
输入: 1->2->6->3->4->5->6, val = 6 输出: 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) {
bool flag = true;
ListNode *head1 = head;
while(head1){
if(head1->next&&head1->next->val==val){
ListNode *tmp = head1->next;
head1->next = tmp->next;
free(tmp);
}
else head1 = head1->next;
}
if(head&&head->val==val){
ListNode *tmp = head;
head = head->next;
free(tmp);
}
return head;
}
};