- 给你一个链表的头节点 head 和一个整数 val ,请你删除链表中所有满足 Node.val == val 的节点,并返回 新的头节点 。
示例 1:
- 输入:head = [1,2,6,3,4,5,6], val = 6
- 输出:[1,2,3,4,5]
示例 2:
- 输入:head = [], val = 1
- 输出:[]
示例 3:
- 输入:head = [7,7,7,7], val = 7
- 输出:[]
提示:
- 列表中的节点数目在范围 [0, 104] 内
- 1 <= Node.val <= 50
- 0 <= val <= 50
代码:
struct ListNode* removeElements(struct ListNode* head, int val){
struct ListNode *prior = NULL;
struct ListNode *cur = NULL;
struct ListNode * hNode = malloc(sizeof(struct ListNode ));
hNode->next = head;
prior = hNode;
while(prior->next){
cur = prior->next;
if(cur->val == val){
prior->next = cur->next;
free(cur);
}else{
prior = prior->next;
}
}
head = hNode->next;
free(hNode);
return head;
}